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-171620118400355.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-09, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r464-smll-171620118400355
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 15:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 155K Apr 12 15:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 12 15:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K 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.6K 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 927K 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-09-LTLCardinality-00
FORMULA_NAME Anderson-PT-09-LTLCardinality-01
FORMULA_NAME Anderson-PT-09-LTLCardinality-02
FORMULA_NAME Anderson-PT-09-LTLCardinality-03
FORMULA_NAME Anderson-PT-09-LTLCardinality-04
FORMULA_NAME Anderson-PT-09-LTLCardinality-05
FORMULA_NAME Anderson-PT-09-LTLCardinality-06
FORMULA_NAME Anderson-PT-09-LTLCardinality-07
FORMULA_NAME Anderson-PT-09-LTLCardinality-08
FORMULA_NAME Anderson-PT-09-LTLCardinality-09
FORMULA_NAME Anderson-PT-09-LTLCardinality-10
FORMULA_NAME Anderson-PT-09-LTLCardinality-11
FORMULA_NAME Anderson-PT-09-LTLCardinality-12
FORMULA_NAME Anderson-PT-09-LTLCardinality-13
FORMULA_NAME Anderson-PT-09-LTLCardinality-14
FORMULA_NAME Anderson-PT-09-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717257473434

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-09
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 15:57:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 15:57:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 15:57:56] [INFO ] Load time of PNML (sax parser for PT used): 387 ms
[2024-06-01 15:57:56] [INFO ] Transformed 505 places.
[2024-06-01 15:57:56] [INFO ] Transformed 1845 transitions.
[2024-06-01 15:57:56] [INFO ] Found NUPN structural information;
[2024-06-01 15:57:56] [INFO ] Parsed PT model containing 505 places and 1845 transitions and 7092 arcs in 733 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 27 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA Anderson-PT-09-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-09-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-09-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-09-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA Anderson-PT-09-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-09-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 505 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 505/505 places, 1845/1845 transitions.
Discarding 137 places :
Symmetric choice reduction at 0 with 137 rule applications. Total rules 137 place count 368 transition count 604
Iterating global reduction 0 with 137 rules applied. Total rules applied 274 place count 368 transition count 604
Applied a total of 274 rules in 187 ms. Remains 368 /505 variables (removed 137) and now considering 604/1845 (removed 1241) transitions.
// Phase 1: matrix 604 rows 368 cols
[2024-06-01 15:57:57] [INFO ] Computed 21 invariants in 76 ms
[2024-06-01 15:57:58] [INFO ] Implicit Places using invariants in 1410 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1503 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 367/505 places, 604/1845 transitions.
Applied a total of 0 rules in 36 ms. Remains 367 /367 variables (removed 0) and now considering 604/604 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1767 ms. Remains : 367/505 places, 604/1845 transitions.
Support contains 25 out of 367 places after structural reductions.
[2024-06-01 15:57:59] [INFO ] Flatten gal took : 166 ms
[2024-06-01 15:57:59] [INFO ] Flatten gal took : 98 ms
[2024-06-01 15:57:59] [INFO ] Input system was already deterministic with 604 transitions.
Reduction of identical properties reduced properties to check from 17 to 16
RANDOM walk for 40000 steps (8 resets) in 2634 ms. (15 steps per ms) remains 2/16 properties
BEST_FIRST walk for 40003 steps (8 resets) in 301 ms. (132 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 159 ms. (250 steps per ms) remains 2/2 properties
// Phase 1: matrix 604 rows 367 cols
[2024-06-01 15:58:00] [INFO ] Computed 20 invariants in 14 ms
[2024-06-01 15:58:00] [INFO ] State equation strengthened by 72 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 339/343 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/343 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 15/358 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/358 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 9/367 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/367 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 604/971 variables, 367/387 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/971 variables, 72/459 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/971 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/971 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 971/971 variables, and 459 constraints, problems are : Problem set: 0 solved, 2 unsolved in 853 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 367/367 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 339/343 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/343 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 15/358 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/358 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 9/367 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/367 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 604/971 variables, 367/387 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/971 variables, 72/459 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/971 variables, 2/461 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/971 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/971 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 971/971 variables, and 461 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1597 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 367/367 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 2521ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 293 ms.
Support contains 4 out of 367 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 367/367 places, 604/604 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 367 transition count 524
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 160 place count 287 transition count 524
Performed 69 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 69 Pre rules applied. Total rules applied 160 place count 287 transition count 455
Deduced a syphon composed of 69 places in 1 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 2 with 138 rules applied. Total rules applied 298 place count 218 transition count 455
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 301 place count 215 transition count 420
Iterating global reduction 2 with 3 rules applied. Total rules applied 304 place count 215 transition count 420
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 310 place count 212 transition count 417
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 311 place count 212 transition count 416
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 312 place count 211 transition count 416
Applied a total of 312 rules in 169 ms. Remains 211 /367 variables (removed 156) and now considering 416/604 (removed 188) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 169 ms. Remains : 211/367 places, 416/604 transitions.
RANDOM walk for 40000 steps (8 resets) in 494 ms. (80 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 147 ms. (270 steps per ms) remains 1/2 properties
// Phase 1: matrix 416 rows 211 cols
[2024-06-01 15:58:04] [INFO ] Computed 20 invariants in 10 ms
[2024-06-01 15:58:04] [INFO ] State equation strengthened by 72 read => feed constraints.
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) 193/195 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 15:58:04] [INFO ] Deduced a trap composed of 175 places in 230 ms of which 36 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 7/202 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 9/211 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/211 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 416/627 variables, 211/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/627 variables, 72/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/627 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/627 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 627/627 variables, and 304 constraints, problems are : Problem set: 0 solved, 1 unsolved in 618 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 211/211 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 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) 193/195 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 15:58:04] [INFO ] Deduced a trap composed of 175 places in 182 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/202 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 9/211 variables, 9/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/211 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 416/627 variables, 211/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/627 variables, 72/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/627 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/627 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/627 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 627/627 variables, and 306 constraints, problems are : Problem set: 0 solved, 1 unsolved in 712 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 211/211 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 1359ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 13 ms.
Support contains 2 out of 211 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 211/211 places, 416/416 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 209 transition count 414
Applied a total of 4 rules in 38 ms. Remains 209 /211 variables (removed 2) and now considering 414/416 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 209/211 places, 414/416 transitions.
RANDOM walk for 40000 steps (8 resets) in 124 ms. (320 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 131 ms. (303 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 388186 steps, run visited all 1 properties in 1492 ms. (steps per millisecond=260 )
Probabilistic random walk after 388186 steps, saw 269433 distinct states, run finished after 1497 ms. (steps per millisecond=259 ) properties seen :1
FORMULA Anderson-PT-09-LTLCardinality-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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((X(F(p0))&&F(p1))))'
Support contains 3 out of 367 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 367/367 places, 604/604 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 361 transition count 550
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 361 transition count 550
Applied a total of 12 rules in 18 ms. Remains 361 /367 variables (removed 6) and now considering 550/604 (removed 54) transitions.
// Phase 1: matrix 550 rows 361 cols
[2024-06-01 15:58:07] [INFO ] Computed 20 invariants in 6 ms
[2024-06-01 15:58:07] [INFO ] Implicit Places using invariants in 605 ms returned []
[2024-06-01 15:58:07] [INFO ] Invariant cache hit.
[2024-06-01 15:58:08] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 15:58:10] [INFO ] Implicit Places using invariants and state equation in 2701 ms returned []
Implicit Place search using SMT with State Equation took 3321 ms to find 0 implicit places.
Running 541 sub problems to find dead transitions.
[2024-06-01 15:58:10] [INFO ] Invariant cache hit.
[2024-06-01 15:58:10] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/360 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 541 unsolved
[2024-06-01 15:58:20] [INFO ] Deduced a trap composed of 99 places in 276 ms of which 4 ms to minimize.
[2024-06-01 15:58:20] [INFO ] Deduced a trap composed of 185 places in 299 ms of which 5 ms to minimize.
[2024-06-01 15:58:21] [INFO ] Deduced a trap composed of 111 places in 422 ms of which 6 ms to minimize.
[2024-06-01 15:58:21] [INFO ] Deduced a trap composed of 222 places in 352 ms of which 4 ms to minimize.
[2024-06-01 15:58:21] [INFO ] Deduced a trap composed of 102 places in 246 ms of which 4 ms to minimize.
[2024-06-01 15:58:22] [INFO ] Deduced a trap composed of 159 places in 416 ms of which 9 ms to minimize.
[2024-06-01 15:58:22] [INFO ] Deduced a trap composed of 144 places in 406 ms of which 6 ms to minimize.
[2024-06-01 15:58:23] [INFO ] Deduced a trap composed of 223 places in 327 ms of which 4 ms to minimize.
[2024-06-01 15:58:23] [INFO ] Deduced a trap composed of 108 places in 227 ms of which 4 ms to minimize.
[2024-06-01 15:58:23] [INFO ] Deduced a trap composed of 227 places in 374 ms of which 6 ms to minimize.
[2024-06-01 15:58:24] [INFO ] Deduced a trap composed of 90 places in 329 ms of which 3 ms to minimize.
[2024-06-01 15:58:27] [INFO ] Deduced a trap composed of 206 places in 249 ms of which 4 ms to minimize.
[2024-06-01 15:58:28] [INFO ] Deduced a trap composed of 80 places in 240 ms of which 4 ms to minimize.
[2024-06-01 15:58:28] [INFO ] Deduced a trap composed of 202 places in 236 ms of which 4 ms to minimize.
[2024-06-01 15:58:28] [INFO ] Deduced a trap composed of 70 places in 315 ms of which 4 ms to minimize.
[2024-06-01 15:58:28] [INFO ] Deduced a trap composed of 195 places in 273 ms of which 4 ms to minimize.
[2024-06-01 15:58:29] [INFO ] Deduced a trap composed of 67 places in 413 ms of which 6 ms to minimize.
[2024-06-01 15:58:29] [INFO ] Deduced a trap composed of 235 places in 445 ms of which 7 ms to minimize.
[2024-06-01 15:58:30] [INFO ] Deduced a trap composed of 113 places in 452 ms of which 6 ms to minimize.
[2024-06-01 15:58:30] [INFO ] Deduced a trap composed of 231 places in 413 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 541 unsolved
[2024-06-01 15:58:34] [INFO ] Deduced a trap composed of 175 places in 374 ms of which 6 ms to minimize.
[2024-06-01 15:58:35] [INFO ] Deduced a trap composed of 173 places in 450 ms of which 6 ms to minimize.
[2024-06-01 15:58:39] [INFO ] Deduced a trap composed of 137 places in 353 ms of which 3 ms to minimize.
[2024-06-01 15:58:39] [INFO ] Deduced a trap composed of 136 places in 259 ms of which 4 ms to minimize.
[2024-06-01 15:58:40] [INFO ] Deduced a trap composed of 133 places in 321 ms of which 6 ms to minimize.
[2024-06-01 15:58:40] [INFO ] Deduced a trap composed of 102 places in 419 ms of which 5 ms to minimize.
[2024-06-01 15:58:40] [INFO ] Deduced a trap composed of 133 places in 271 ms of which 4 ms to minimize.
[2024-06-01 15:58:41] [INFO ] Deduced a trap composed of 169 places in 379 ms of which 5 ms to minimize.
[2024-06-01 15:58:41] [INFO ] Deduced a trap composed of 116 places in 301 ms of which 5 ms to minimize.
SMT process timed out in 30881ms, After SMT, problems are : Problem set: 0 solved, 541 unsolved
Search for dead transitions found 0 dead transitions in 30902ms
Starting structural reductions in LTL mode, iteration 1 : 361/367 places, 550/604 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34250 ms. Remains : 361/367 places, 550/604 transitions.
Stuttering acceptance computed with spot in 408 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : Anderson-PT-09-LTLCardinality-01
Product exploration explored 100000 steps with 31 reset in 583 ms.
Stack based approach found an accepted trace after 124 steps with 0 reset with depth 125 and stack size 125 in 1 ms.
FORMULA Anderson-PT-09-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-09-LTLCardinality-01 finished in 35339 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 367 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 367/367 places, 604/604 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 360 transition count 549
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 360 transition count 549
Applied a total of 14 rules in 13 ms. Remains 360 /367 variables (removed 7) and now considering 549/604 (removed 55) transitions.
// Phase 1: matrix 549 rows 360 cols
[2024-06-01 15:58:42] [INFO ] Computed 20 invariants in 5 ms
[2024-06-01 15:58:42] [INFO ] Implicit Places using invariants in 337 ms returned []
[2024-06-01 15:58:42] [INFO ] Invariant cache hit.
[2024-06-01 15:58:43] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 15:58:45] [INFO ] Implicit Places using invariants and state equation in 2589 ms returned []
Implicit Place search using SMT with State Equation took 2933 ms to find 0 implicit places.
Running 540 sub problems to find dead transitions.
[2024-06-01 15:58:45] [INFO ] Invariant cache hit.
[2024-06-01 15:58:45] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/359 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/359 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 540 unsolved
[2024-06-01 15:58:56] [INFO ] Deduced a trap composed of 155 places in 430 ms of which 6 ms to minimize.
[2024-06-01 15:58:59] [INFO ] Deduced a trap composed of 131 places in 478 ms of which 6 ms to minimize.
[2024-06-01 15:58:59] [INFO ] Deduced a trap composed of 62 places in 452 ms of which 6 ms to minimize.
[2024-06-01 15:59:00] [INFO ] Deduced a trap composed of 158 places in 421 ms of which 7 ms to minimize.
[2024-06-01 15:59:00] [INFO ] Deduced a trap composed of 114 places in 447 ms of which 6 ms to minimize.
[2024-06-01 15:59:01] [INFO ] Deduced a trap composed of 132 places in 424 ms of which 6 ms to minimize.
[2024-06-01 15:59:01] [INFO ] Deduced a trap composed of 99 places in 471 ms of which 7 ms to minimize.
[2024-06-01 15:59:02] [INFO ] Deduced a trap composed of 182 places in 437 ms of which 5 ms to minimize.
[2024-06-01 15:59:02] [INFO ] Deduced a trap composed of 137 places in 420 ms of which 6 ms to minimize.
[2024-06-01 15:59:03] [INFO ] Deduced a trap composed of 136 places in 439 ms of which 6 ms to minimize.
[2024-06-01 15:59:03] [INFO ] Deduced a trap composed of 128 places in 439 ms of which 6 ms to minimize.
[2024-06-01 15:59:04] [INFO ] Deduced a trap composed of 146 places in 436 ms of which 6 ms to minimize.
[2024-06-01 15:59:04] [INFO ] Deduced a trap composed of 169 places in 434 ms of which 5 ms to minimize.
[2024-06-01 15:59:05] [INFO ] Deduced a trap composed of 171 places in 415 ms of which 6 ms to minimize.
[2024-06-01 15:59:05] [INFO ] Deduced a trap composed of 132 places in 423 ms of which 6 ms to minimize.
[2024-06-01 15:59:05] [INFO ] Deduced a trap composed of 163 places in 345 ms of which 6 ms to minimize.
[2024-06-01 15:59:06] [INFO ] Deduced a trap composed of 97 places in 334 ms of which 5 ms to minimize.
[2024-06-01 15:59:06] [INFO ] Deduced a trap composed of 115 places in 433 ms of which 6 ms to minimize.
[2024-06-01 15:59:07] [INFO ] Deduced a trap composed of 203 places in 376 ms of which 6 ms to minimize.
[2024-06-01 15:59:07] [INFO ] Deduced a trap composed of 214 places in 438 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/359 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 540 unsolved
[2024-06-01 15:59:11] [INFO ] Deduced a trap composed of 168 places in 352 ms of which 6 ms to minimize.
[2024-06-01 15:59:12] [INFO ] Deduced a trap composed of 97 places in 439 ms of which 6 ms to minimize.
[2024-06-01 15:59:12] [INFO ] Deduced a trap composed of 115 places in 441 ms of which 6 ms to minimize.
[2024-06-01 15:59:13] [INFO ] Deduced a trap composed of 172 places in 440 ms of which 6 ms to minimize.
[2024-06-01 15:59:13] [INFO ] Deduced a trap composed of 147 places in 460 ms of which 6 ms to minimize.
[2024-06-01 15:59:13] [INFO ] Deduced a trap composed of 114 places in 430 ms of which 9 ms to minimize.
[2024-06-01 15:59:14] [INFO ] Deduced a trap composed of 194 places in 455 ms of which 6 ms to minimize.
[2024-06-01 15:59:14] [INFO ] Deduced a trap composed of 140 places in 453 ms of which 6 ms to minimize.
[2024-06-01 15:59:15] [INFO ] Deduced a trap composed of 132 places in 464 ms of which 6 ms to minimize.
[2024-06-01 15:59:15] [INFO ] Deduced a trap composed of 240 places in 447 ms of which 6 ms to minimize.
[2024-06-01 15:59:16] [INFO ] Deduced a trap composed of 156 places in 415 ms of which 6 ms to minimize.
SMT process timed out in 30691ms, After SMT, problems are : Problem set: 0 solved, 540 unsolved
Search for dead transitions found 0 dead transitions in 30704ms
Starting structural reductions in LTL mode, iteration 1 : 360/367 places, 549/604 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33656 ms. Remains : 360/367 places, 549/604 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-09-LTLCardinality-03
Product exploration explored 100000 steps with 25 reset in 340 ms.
Stack based approach found an accepted trace after 86 steps with 0 reset with depth 87 and stack size 87 in 2 ms.
FORMULA Anderson-PT-09-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-09-LTLCardinality-03 finished in 34130 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 367 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 367/367 places, 604/604 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 81 rules applied. Total rules applied 81 place count 367 transition count 523
Reduce places removed 81 places and 0 transitions.
Iterating post reduction 1 with 81 rules applied. Total rules applied 162 place count 286 transition count 523
Performed 70 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 70 Pre rules applied. Total rules applied 162 place count 286 transition count 453
Deduced a syphon composed of 70 places in 1 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 302 place count 216 transition count 453
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 308 place count 210 transition count 399
Iterating global reduction 2 with 6 rules applied. Total rules applied 314 place count 210 transition count 399
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 316 place count 209 transition count 398
Applied a total of 316 rules in 106 ms. Remains 209 /367 variables (removed 158) and now considering 398/604 (removed 206) transitions.
// Phase 1: matrix 398 rows 209 cols
[2024-06-01 15:59:16] [INFO ] Computed 20 invariants in 9 ms
[2024-06-01 15:59:17] [INFO ] Implicit Places using invariants in 475 ms returned []
[2024-06-01 15:59:17] [INFO ] Invariant cache hit.
[2024-06-01 15:59:17] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 15:59:18] [INFO ] Implicit Places using invariants and state equation in 1111 ms returned []
Implicit Place search using SMT with State Equation took 1588 ms to find 0 implicit places.
[2024-06-01 15:59:18] [INFO ] Redundant transitions in 47 ms returned []
Running 389 sub problems to find dead transitions.
[2024-06-01 15:59:18] [INFO ] Invariant cache hit.
[2024-06-01 15:59:18] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 3 (OVERLAPS) 1/209 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-06-01 15:59:29] [INFO ] Deduced a trap composed of 83 places in 204 ms of which 4 ms to minimize.
[2024-06-01 15:59:30] [INFO ] Deduced a trap composed of 69 places in 283 ms of which 3 ms to minimize.
[2024-06-01 15:59:30] [INFO ] Deduced a trap composed of 67 places in 286 ms of which 4 ms to minimize.
[2024-06-01 15:59:30] [INFO ] Deduced a trap composed of 87 places in 282 ms of which 4 ms to minimize.
[2024-06-01 15:59:31] [INFO ] Deduced a trap composed of 59 places in 279 ms of which 4 ms to minimize.
[2024-06-01 15:59:31] [INFO ] Deduced a trap composed of 61 places in 256 ms of which 3 ms to minimize.
[2024-06-01 15:59:31] [INFO ] Deduced a trap composed of 93 places in 265 ms of which 4 ms to minimize.
[2024-06-01 15:59:31] [INFO ] Deduced a trap composed of 72 places in 283 ms of which 4 ms to minimize.
[2024-06-01 15:59:32] [INFO ] Deduced a trap composed of 86 places in 273 ms of which 3 ms to minimize.
[2024-06-01 15:59:32] [INFO ] Deduced a trap composed of 87 places in 236 ms of which 3 ms to minimize.
[2024-06-01 15:59:32] [INFO ] Deduced a trap composed of 68 places in 261 ms of which 3 ms to minimize.
[2024-06-01 15:59:33] [INFO ] Deduced a trap composed of 85 places in 263 ms of which 4 ms to minimize.
[2024-06-01 15:59:33] [INFO ] Deduced a trap composed of 93 places in 255 ms of which 4 ms to minimize.
[2024-06-01 15:59:33] [INFO ] Deduced a trap composed of 66 places in 256 ms of which 4 ms to minimize.
[2024-06-01 15:59:33] [INFO ] Deduced a trap composed of 54 places in 258 ms of which 4 ms to minimize.
[2024-06-01 15:59:34] [INFO ] Deduced a trap composed of 85 places in 265 ms of which 3 ms to minimize.
[2024-06-01 15:59:34] [INFO ] Deduced a trap composed of 60 places in 271 ms of which 4 ms to minimize.
[2024-06-01 15:59:34] [INFO ] Deduced a trap composed of 103 places in 262 ms of which 4 ms to minimize.
[2024-06-01 15:59:35] [INFO ] Deduced a trap composed of 60 places in 266 ms of which 4 ms to minimize.
[2024-06-01 15:59:35] [INFO ] Deduced a trap composed of 102 places in 291 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-06-01 15:59:38] [INFO ] Deduced a trap composed of 75 places in 284 ms of which 4 ms to minimize.
[2024-06-01 15:59:38] [INFO ] Deduced a trap composed of 74 places in 273 ms of which 4 ms to minimize.
[2024-06-01 15:59:38] [INFO ] Deduced a trap composed of 81 places in 262 ms of which 3 ms to minimize.
[2024-06-01 15:59:39] [INFO ] Deduced a trap composed of 68 places in 260 ms of which 4 ms to minimize.
[2024-06-01 15:59:39] [INFO ] Deduced a trap composed of 76 places in 266 ms of which 4 ms to minimize.
[2024-06-01 15:59:39] [INFO ] Deduced a trap composed of 80 places in 266 ms of which 4 ms to minimize.
[2024-06-01 15:59:39] [INFO ] Deduced a trap composed of 79 places in 264 ms of which 3 ms to minimize.
[2024-06-01 15:59:40] [INFO ] Deduced a trap composed of 68 places in 251 ms of which 3 ms to minimize.
[2024-06-01 15:59:40] [INFO ] Deduced a trap composed of 63 places in 265 ms of which 4 ms to minimize.
[2024-06-01 15:59:40] [INFO ] Deduced a trap composed of 69 places in 260 ms of which 4 ms to minimize.
[2024-06-01 15:59:41] [INFO ] Deduced a trap composed of 67 places in 276 ms of which 4 ms to minimize.
[2024-06-01 15:59:41] [INFO ] Deduced a trap composed of 64 places in 266 ms of which 4 ms to minimize.
[2024-06-01 15:59:41] [INFO ] Deduced a trap composed of 56 places in 269 ms of which 4 ms to minimize.
[2024-06-01 15:59:41] [INFO ] Deduced a trap composed of 56 places in 257 ms of which 3 ms to minimize.
[2024-06-01 15:59:42] [INFO ] Deduced a trap composed of 52 places in 273 ms of which 4 ms to minimize.
[2024-06-01 15:59:42] [INFO ] Deduced a trap composed of 63 places in 239 ms of which 4 ms to minimize.
[2024-06-01 15:59:43] [INFO ] Deduced a trap composed of 59 places in 285 ms of which 4 ms to minimize.
[2024-06-01 15:59:43] [INFO ] Deduced a trap composed of 67 places in 276 ms of which 4 ms to minimize.
[2024-06-01 15:59:43] [INFO ] Deduced a trap composed of 65 places in 270 ms of which 4 ms to minimize.
[2024-06-01 15:59:43] [INFO ] Deduced a trap composed of 70 places in 270 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 389 unsolved
SMT process timed out in 30429ms, After SMT, problems are : Problem set: 0 solved, 389 unsolved
Search for dead transitions found 0 dead transitions in 30439ms
Starting structural reductions in SI_LTL mode, iteration 1 : 209/367 places, 398/604 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 32192 ms. Remains : 209/367 places, 398/604 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0)]
Running random walk in product with property : Anderson-PT-09-LTLCardinality-04
Product exploration explored 100000 steps with 0 reset in 285 ms.
Stack based approach found an accepted trace after 738 steps with 0 reset with depth 739 and stack size 657 in 5 ms.
FORMULA Anderson-PT-09-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-09-LTLCardinality-04 finished in 32577 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((p0||F((p1||G(p0))))))'
Support contains 4 out of 367 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 367/367 places, 604/604 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 78 place count 367 transition count 526
Reduce places removed 78 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 80 rules applied. Total rules applied 158 place count 289 transition count 524
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 160 place count 287 transition count 524
Performed 71 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 71 Pre rules applied. Total rules applied 160 place count 287 transition count 453
Deduced a syphon composed of 71 places in 2 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 142 rules applied. Total rules applied 302 place count 216 transition count 453
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 307 place count 211 transition count 416
Iterating global reduction 3 with 5 rules applied. Total rules applied 312 place count 211 transition count 416
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 314 place count 210 transition count 415
Applied a total of 314 rules in 63 ms. Remains 210 /367 variables (removed 157) and now considering 415/604 (removed 189) transitions.
// Phase 1: matrix 415 rows 210 cols
[2024-06-01 15:59:49] [INFO ] Computed 20 invariants in 7 ms
[2024-06-01 15:59:49] [INFO ] Implicit Places using invariants in 502 ms returned []
[2024-06-01 15:59:49] [INFO ] Invariant cache hit.
[2024-06-01 15:59:50] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 15:59:51] [INFO ] Implicit Places using invariants and state equation in 1171 ms returned []
Implicit Place search using SMT with State Equation took 1677 ms to find 0 implicit places.
[2024-06-01 15:59:51] [INFO ] Redundant transitions in 13 ms returned []
Running 406 sub problems to find dead transitions.
[2024-06-01 15:59:51] [INFO ] Invariant cache hit.
[2024-06-01 15:59:51] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/210 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 406 unsolved
[2024-06-01 15:59:56] [INFO ] Deduced a trap composed of 64 places in 185 ms of which 3 ms to minimize.
[2024-06-01 15:59:57] [INFO ] Deduced a trap composed of 89 places in 177 ms of which 2 ms to minimize.
[2024-06-01 15:59:57] [INFO ] Deduced a trap composed of 84 places in 188 ms of which 3 ms to minimize.
[2024-06-01 15:59:57] [INFO ] Deduced a trap composed of 102 places in 177 ms of which 3 ms to minimize.
[2024-06-01 15:59:57] [INFO ] Deduced a trap composed of 69 places in 275 ms of which 4 ms to minimize.
[2024-06-01 15:59:58] [INFO ] Deduced a trap composed of 91 places in 282 ms of which 3 ms to minimize.
[2024-06-01 15:59:58] [INFO ] Deduced a trap composed of 94 places in 276 ms of which 3 ms to minimize.
[2024-06-01 15:59:58] [INFO ] Deduced a trap composed of 91 places in 187 ms of which 2 ms to minimize.
[2024-06-01 15:59:59] [INFO ] Deduced a trap composed of 87 places in 287 ms of which 4 ms to minimize.
[2024-06-01 15:59:59] [INFO ] Deduced a trap composed of 68 places in 271 ms of which 4 ms to minimize.
[2024-06-01 15:59:59] [INFO ] Deduced a trap composed of 97 places in 179 ms of which 2 ms to minimize.
[2024-06-01 15:59:59] [INFO ] Deduced a trap composed of 73 places in 228 ms of which 3 ms to minimize.
[2024-06-01 16:00:00] [INFO ] Deduced a trap composed of 101 places in 290 ms of which 3 ms to minimize.
[2024-06-01 16:00:00] [INFO ] Deduced a trap composed of 101 places in 224 ms of which 4 ms to minimize.
[2024-06-01 16:00:00] [INFO ] Deduced a trap composed of 99 places in 266 ms of which 4 ms to minimize.
[2024-06-01 16:00:00] [INFO ] Deduced a trap composed of 97 places in 173 ms of which 2 ms to minimize.
[2024-06-01 16:00:01] [INFO ] Deduced a trap composed of 63 places in 173 ms of which 2 ms to minimize.
[2024-06-01 16:00:01] [INFO ] Deduced a trap composed of 78 places in 270 ms of which 4 ms to minimize.
[2024-06-01 16:00:01] [INFO ] Deduced a trap composed of 81 places in 268 ms of which 4 ms to minimize.
[2024-06-01 16:00:01] [INFO ] Deduced a trap composed of 86 places in 177 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 406 unsolved
[2024-06-01 16:00:03] [INFO ] Deduced a trap composed of 48 places in 281 ms of which 4 ms to minimize.
[2024-06-01 16:00:03] [INFO ] Deduced a trap composed of 88 places in 265 ms of which 4 ms to minimize.
[2024-06-01 16:00:04] [INFO ] Deduced a trap composed of 80 places in 254 ms of which 4 ms to minimize.
[2024-06-01 16:00:04] [INFO ] Deduced a trap composed of 77 places in 248 ms of which 4 ms to minimize.
[2024-06-01 16:00:04] [INFO ] Deduced a trap composed of 105 places in 241 ms of which 4 ms to minimize.
[2024-06-01 16:00:04] [INFO ] Deduced a trap composed of 107 places in 245 ms of which 4 ms to minimize.
[2024-06-01 16:00:05] [INFO ] Deduced a trap composed of 35 places in 237 ms of which 4 ms to minimize.
[2024-06-01 16:00:05] [INFO ] Deduced a trap composed of 86 places in 235 ms of which 4 ms to minimize.
[2024-06-01 16:00:06] [INFO ] Deduced a trap composed of 89 places in 232 ms of which 3 ms to minimize.
[2024-06-01 16:00:06] [INFO ] Deduced a trap composed of 71 places in 180 ms of which 3 ms to minimize.
[2024-06-01 16:00:06] [INFO ] Deduced a trap composed of 89 places in 221 ms of which 3 ms to minimize.
[2024-06-01 16:00:07] [INFO ] Deduced a trap composed of 95 places in 177 ms of which 3 ms to minimize.
[2024-06-01 16:00:07] [INFO ] Deduced a trap composed of 94 places in 225 ms of which 3 ms to minimize.
[2024-06-01 16:00:07] [INFO ] Deduced a trap composed of 85 places in 225 ms of which 4 ms to minimize.
[2024-06-01 16:00:07] [INFO ] Deduced a trap composed of 64 places in 273 ms of which 4 ms to minimize.
[2024-06-01 16:00:08] [INFO ] Deduced a trap composed of 61 places in 266 ms of which 4 ms to minimize.
[2024-06-01 16:00:08] [INFO ] Deduced a trap composed of 55 places in 299 ms of which 5 ms to minimize.
[2024-06-01 16:00:08] [INFO ] Deduced a trap composed of 88 places in 218 ms of which 3 ms to minimize.
[2024-06-01 16:00:08] [INFO ] Deduced a trap composed of 70 places in 269 ms of which 4 ms to minimize.
[2024-06-01 16:00:09] [INFO ] Deduced a trap composed of 77 places in 279 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 406 unsolved
[2024-06-01 16:00:14] [INFO ] Deduced a trap composed of 53 places in 285 ms of which 4 ms to minimize.
[2024-06-01 16:00:14] [INFO ] Deduced a trap composed of 62 places in 281 ms of which 4 ms to minimize.
[2024-06-01 16:00:15] [INFO ] Deduced a trap composed of 71 places in 270 ms of which 4 ms to minimize.
[2024-06-01 16:00:15] [INFO ] Deduced a trap composed of 87 places in 277 ms of which 4 ms to minimize.
[2024-06-01 16:00:15] [INFO ] Deduced a trap composed of 63 places in 180 ms of which 2 ms to minimize.
[2024-06-01 16:00:15] [INFO ] Deduced a trap composed of 70 places in 184 ms of which 2 ms to minimize.
[2024-06-01 16:00:15] [INFO ] Deduced a trap composed of 74 places in 177 ms of which 2 ms to minimize.
[2024-06-01 16:00:16] [INFO ] Deduced a trap composed of 82 places in 265 ms of which 4 ms to minimize.
[2024-06-01 16:00:16] [INFO ] Deduced a trap composed of 84 places in 228 ms of which 4 ms to minimize.
[2024-06-01 16:00:16] [INFO ] Deduced a trap composed of 69 places in 268 ms of which 4 ms to minimize.
[2024-06-01 16:00:17] [INFO ] Deduced a trap composed of 78 places in 263 ms of which 4 ms to minimize.
[2024-06-01 16:00:17] [INFO ] Deduced a trap composed of 61 places in 282 ms of which 4 ms to minimize.
[2024-06-01 16:00:17] [INFO ] Deduced a trap composed of 102 places in 263 ms of which 4 ms to minimize.
[2024-06-01 16:00:17] [INFO ] Deduced a trap composed of 61 places in 264 ms of which 4 ms to minimize.
[2024-06-01 16:00:18] [INFO ] Deduced a trap composed of 83 places in 284 ms of which 4 ms to minimize.
[2024-06-01 16:00:18] [INFO ] Deduced a trap composed of 71 places in 231 ms of which 4 ms to minimize.
[2024-06-01 16:00:18] [INFO ] Deduced a trap composed of 107 places in 271 ms of which 3 ms to minimize.
[2024-06-01 16:00:19] [INFO ] Deduced a trap composed of 76 places in 269 ms of which 4 ms to minimize.
[2024-06-01 16:00:19] [INFO ] Deduced a trap composed of 57 places in 263 ms of which 3 ms to minimize.
[2024-06-01 16:00:19] [INFO ] Deduced a trap composed of 87 places in 277 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 406 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 210/625 variables, and 80 constraints, problems are : Problem set: 0 solved, 406 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/210 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 406/406 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 406 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/210 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 60/80 constraints. Problems are: Problem set: 0 solved, 406 unsolved
[2024-06-01 16:00:24] [INFO ] Deduced a trap composed of 44 places in 166 ms of which 2 ms to minimize.
[2024-06-01 16:00:25] [INFO ] Deduced a trap composed of 36 places in 155 ms of which 2 ms to minimize.
[2024-06-01 16:00:25] [INFO ] Deduced a trap composed of 102 places in 131 ms of which 3 ms to minimize.
[2024-06-01 16:00:26] [INFO ] Deduced a trap composed of 98 places in 131 ms of which 2 ms to minimize.
[2024-06-01 16:00:26] [INFO ] Deduced a trap composed of 63 places in 128 ms of which 3 ms to minimize.
[2024-06-01 16:00:26] [INFO ] Deduced a trap composed of 82 places in 161 ms of which 2 ms to minimize.
[2024-06-01 16:00:26] [INFO ] Deduced a trap composed of 72 places in 147 ms of which 3 ms to minimize.
[2024-06-01 16:00:26] [INFO ] Deduced a trap composed of 66 places in 163 ms of which 2 ms to minimize.
[2024-06-01 16:00:26] [INFO ] Deduced a trap composed of 51 places in 159 ms of which 2 ms to minimize.
[2024-06-01 16:00:27] [INFO ] Deduced a trap composed of 59 places in 164 ms of which 3 ms to minimize.
[2024-06-01 16:00:27] [INFO ] Deduced a trap composed of 60 places in 166 ms of which 3 ms to minimize.
[2024-06-01 16:00:27] [INFO ] Deduced a trap composed of 55 places in 155 ms of which 2 ms to minimize.
[2024-06-01 16:00:27] [INFO ] Deduced a trap composed of 55 places in 162 ms of which 2 ms to minimize.
[2024-06-01 16:00:27] [INFO ] Deduced a trap composed of 57 places in 130 ms of which 2 ms to minimize.
[2024-06-01 16:00:27] [INFO ] Deduced a trap composed of 62 places in 152 ms of which 3 ms to minimize.
[2024-06-01 16:00:27] [INFO ] Deduced a trap composed of 64 places in 154 ms of which 2 ms to minimize.
[2024-06-01 16:00:28] [INFO ] Deduced a trap composed of 60 places in 153 ms of which 3 ms to minimize.
[2024-06-01 16:00:28] [INFO ] Deduced a trap composed of 71 places in 149 ms of which 2 ms to minimize.
[2024-06-01 16:00:28] [INFO ] Deduced a trap composed of 67 places in 155 ms of which 3 ms to minimize.
[2024-06-01 16:00:28] [INFO ] Deduced a trap composed of 53 places in 158 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 406 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 210/625 variables, and 100 constraints, problems are : Problem set: 0 solved, 406 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/210 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/406 constraints, Known Traps: 80/80 constraints]
After SMT, in 60514ms problems are : Problem set: 0 solved, 406 unsolved
Search for dead transitions found 0 dead transitions in 60527ms
Starting structural reductions in SI_LTL mode, iteration 1 : 210/367 places, 415/604 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62289 ms. Remains : 210/367 places, 415/604 transitions.
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Anderson-PT-09-LTLCardinality-06
Product exploration explored 100000 steps with 104 reset in 261 ms.
Stack based approach found an accepted trace after 38 steps with 0 reset with depth 39 and stack size 39 in 0 ms.
FORMULA Anderson-PT-09-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-09-LTLCardinality-06 finished in 62661 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 367 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 367/367 places, 604/604 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 362 transition count 551
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 362 transition count 551
Applied a total of 10 rules in 10 ms. Remains 362 /367 variables (removed 5) and now considering 551/604 (removed 53) transitions.
// Phase 1: matrix 551 rows 362 cols
[2024-06-01 16:00:51] [INFO ] Computed 20 invariants in 6 ms
[2024-06-01 16:00:52] [INFO ] Implicit Places using invariants in 404 ms returned []
[2024-06-01 16:00:52] [INFO ] Invariant cache hit.
[2024-06-01 16:00:52] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 16:00:54] [INFO ] Implicit Places using invariants and state equation in 2124 ms returned []
Implicit Place search using SMT with State Equation took 2530 ms to find 0 implicit places.
Running 542 sub problems to find dead transitions.
[2024-06-01 16:00:54] [INFO ] Invariant cache hit.
[2024-06-01 16:00:54] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/361 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 542 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/361 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 542 unsolved
[2024-06-01 16:01:04] [INFO ] Deduced a trap composed of 88 places in 415 ms of which 6 ms to minimize.
[2024-06-01 16:01:04] [INFO ] Deduced a trap composed of 96 places in 417 ms of which 5 ms to minimize.
[2024-06-01 16:01:05] [INFO ] Deduced a trap composed of 148 places in 412 ms of which 6 ms to minimize.
[2024-06-01 16:01:05] [INFO ] Deduced a trap composed of 115 places in 414 ms of which 6 ms to minimize.
[2024-06-01 16:01:06] [INFO ] Deduced a trap composed of 118 places in 435 ms of which 6 ms to minimize.
[2024-06-01 16:01:06] [INFO ] Deduced a trap composed of 89 places in 385 ms of which 6 ms to minimize.
[2024-06-01 16:01:07] [INFO ] Deduced a trap composed of 152 places in 415 ms of which 5 ms to minimize.
[2024-06-01 16:01:07] [INFO ] Deduced a trap composed of 155 places in 425 ms of which 6 ms to minimize.
[2024-06-01 16:01:07] [INFO ] Deduced a trap composed of 137 places in 417 ms of which 6 ms to minimize.
[2024-06-01 16:01:08] [INFO ] Deduced a trap composed of 180 places in 408 ms of which 6 ms to minimize.
[2024-06-01 16:01:08] [INFO ] Deduced a trap composed of 110 places in 406 ms of which 6 ms to minimize.
[2024-06-01 16:01:09] [INFO ] Deduced a trap composed of 124 places in 408 ms of which 6 ms to minimize.
[2024-06-01 16:01:09] [INFO ] Deduced a trap composed of 107 places in 420 ms of which 6 ms to minimize.
[2024-06-01 16:01:10] [INFO ] Deduced a trap composed of 111 places in 404 ms of which 5 ms to minimize.
[2024-06-01 16:01:10] [INFO ] Deduced a trap composed of 108 places in 381 ms of which 5 ms to minimize.
[2024-06-01 16:01:10] [INFO ] Deduced a trap composed of 115 places in 418 ms of which 6 ms to minimize.
[2024-06-01 16:01:13] [INFO ] Deduced a trap composed of 146 places in 402 ms of which 6 ms to minimize.
[2024-06-01 16:01:14] [INFO ] Deduced a trap composed of 232 places in 442 ms of which 6 ms to minimize.
[2024-06-01 16:01:14] [INFO ] Deduced a trap composed of 116 places in 426 ms of which 6 ms to minimize.
[2024-06-01 16:01:15] [INFO ] Deduced a trap composed of 108 places in 428 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/361 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 542 unsolved
[2024-06-01 16:01:22] [INFO ] Deduced a trap composed of 102 places in 435 ms of which 6 ms to minimize.
[2024-06-01 16:01:22] [INFO ] Deduced a trap composed of 117 places in 411 ms of which 6 ms to minimize.
[2024-06-01 16:01:23] [INFO ] Deduced a trap composed of 56 places in 415 ms of which 6 ms to minimize.
[2024-06-01 16:01:23] [INFO ] Deduced a trap composed of 93 places in 423 ms of which 6 ms to minimize.
[2024-06-01 16:01:24] [INFO ] Deduced a trap composed of 184 places in 415 ms of which 5 ms to minimize.
[2024-06-01 16:01:24] [INFO ] Deduced a trap composed of 132 places in 350 ms of which 5 ms to minimize.
[2024-06-01 16:01:25] [INFO ] Deduced a trap composed of 99 places in 410 ms of which 5 ms to minimize.
SMT process timed out in 30602ms, After SMT, problems are : Problem set: 0 solved, 542 unsolved
Search for dead transitions found 0 dead transitions in 30610ms
Starting structural reductions in LTL mode, iteration 1 : 362/367 places, 551/604 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33153 ms. Remains : 362/367 places, 551/604 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-09-LTLCardinality-08
Product exploration explored 100000 steps with 0 reset in 347 ms.
Stack based approach found an accepted trace after 64 steps with 0 reset with depth 65 and stack size 65 in 0 ms.
FORMULA Anderson-PT-09-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-09-LTLCardinality-08 finished in 33620 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((G(p0)||F((G(p2)||p1)))))'
Support contains 3 out of 367 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 367/367 places, 604/604 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 367 transition count 524
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 160 place count 287 transition count 524
Performed 70 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 70 Pre rules applied. Total rules applied 160 place count 287 transition count 454
Deduced a syphon composed of 70 places in 0 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 300 place count 217 transition count 454
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 307 place count 210 transition count 399
Iterating global reduction 2 with 7 rules applied. Total rules applied 314 place count 210 transition count 399
Applied a total of 314 rules in 42 ms. Remains 210 /367 variables (removed 157) and now considering 399/604 (removed 205) transitions.
// Phase 1: matrix 399 rows 210 cols
[2024-06-01 16:01:25] [INFO ] Computed 20 invariants in 5 ms
[2024-06-01 16:01:26] [INFO ] Implicit Places using invariants in 471 ms returned []
[2024-06-01 16:01:26] [INFO ] Invariant cache hit.
[2024-06-01 16:01:26] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 16:01:26] [INFO ] Implicit Places using invariants and state equation in 801 ms returned []
Implicit Place search using SMT with State Equation took 1276 ms to find 0 implicit places.
[2024-06-01 16:01:26] [INFO ] Redundant transitions in 4 ms returned []
Running 390 sub problems to find dead transitions.
[2024-06-01 16:01:26] [INFO ] Invariant cache hit.
[2024-06-01 16:01:26] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/209 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 3 (OVERLAPS) 1/210 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 390 unsolved
[2024-06-01 16:01:38] [INFO ] Deduced a trap composed of 82 places in 288 ms of which 4 ms to minimize.
[2024-06-01 16:01:39] [INFO ] Deduced a trap composed of 85 places in 250 ms of which 4 ms to minimize.
[2024-06-01 16:01:39] [INFO ] Deduced a trap composed of 67 places in 269 ms of which 4 ms to minimize.
[2024-06-01 16:01:39] [INFO ] Deduced a trap composed of 80 places in 257 ms of which 4 ms to minimize.
[2024-06-01 16:01:39] [INFO ] Deduced a trap composed of 84 places in 251 ms of which 4 ms to minimize.
[2024-06-01 16:01:40] [INFO ] Deduced a trap composed of 72 places in 247 ms of which 4 ms to minimize.
[2024-06-01 16:01:40] [INFO ] Deduced a trap composed of 87 places in 252 ms of which 3 ms to minimize.
[2024-06-01 16:01:40] [INFO ] Deduced a trap composed of 90 places in 253 ms of which 4 ms to minimize.
[2024-06-01 16:01:40] [INFO ] Deduced a trap composed of 65 places in 251 ms of which 4 ms to minimize.
[2024-06-01 16:01:41] [INFO ] Deduced a trap composed of 82 places in 255 ms of which 4 ms to minimize.
[2024-06-01 16:01:41] [INFO ] Deduced a trap composed of 91 places in 260 ms of which 4 ms to minimize.
[2024-06-01 16:01:41] [INFO ] Deduced a trap composed of 89 places in 252 ms of which 4 ms to minimize.
[2024-06-01 16:01:42] [INFO ] Deduced a trap composed of 87 places in 268 ms of which 3 ms to minimize.
[2024-06-01 16:01:42] [INFO ] Deduced a trap composed of 94 places in 261 ms of which 4 ms to minimize.
[2024-06-01 16:01:42] [INFO ] Deduced a trap composed of 94 places in 265 ms of which 3 ms to minimize.
[2024-06-01 16:01:42] [INFO ] Deduced a trap composed of 89 places in 252 ms of which 3 ms to minimize.
[2024-06-01 16:01:43] [INFO ] Deduced a trap composed of 104 places in 259 ms of which 4 ms to minimize.
[2024-06-01 16:01:43] [INFO ] Deduced a trap composed of 94 places in 258 ms of which 3 ms to minimize.
[2024-06-01 16:01:43] [INFO ] Deduced a trap composed of 76 places in 269 ms of which 4 ms to minimize.
[2024-06-01 16:01:43] [INFO ] Deduced a trap composed of 90 places in 269 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 390 unsolved
[2024-06-01 16:01:45] [INFO ] Deduced a trap composed of 91 places in 264 ms of which 4 ms to minimize.
[2024-06-01 16:01:46] [INFO ] Deduced a trap composed of 102 places in 275 ms of which 4 ms to minimize.
[2024-06-01 16:01:46] [INFO ] Deduced a trap composed of 106 places in 259 ms of which 5 ms to minimize.
[2024-06-01 16:01:46] [INFO ] Deduced a trap composed of 60 places in 232 ms of which 4 ms to minimize.
[2024-06-01 16:01:46] [INFO ] Deduced a trap composed of 66 places in 268 ms of which 4 ms to minimize.
[2024-06-01 16:01:47] [INFO ] Deduced a trap composed of 95 places in 265 ms of which 4 ms to minimize.
[2024-06-01 16:01:47] [INFO ] Deduced a trap composed of 64 places in 262 ms of which 4 ms to minimize.
[2024-06-01 16:01:47] [INFO ] Deduced a trap composed of 55 places in 266 ms of which 4 ms to minimize.
[2024-06-01 16:01:47] [INFO ] Deduced a trap composed of 70 places in 251 ms of which 4 ms to minimize.
[2024-06-01 16:01:48] [INFO ] Deduced a trap composed of 120 places in 251 ms of which 4 ms to minimize.
[2024-06-01 16:01:48] [INFO ] Deduced a trap composed of 84 places in 272 ms of which 4 ms to minimize.
[2024-06-01 16:01:48] [INFO ] Deduced a trap composed of 94 places in 285 ms of which 4 ms to minimize.
[2024-06-01 16:01:49] [INFO ] Deduced a trap composed of 73 places in 258 ms of which 4 ms to minimize.
[2024-06-01 16:01:49] [INFO ] Deduced a trap composed of 56 places in 259 ms of which 4 ms to minimize.
[2024-06-01 16:01:49] [INFO ] Deduced a trap composed of 77 places in 271 ms of which 3 ms to minimize.
[2024-06-01 16:01:49] [INFO ] Deduced a trap composed of 89 places in 279 ms of which 3 ms to minimize.
[2024-06-01 16:01:50] [INFO ] Deduced a trap composed of 68 places in 261 ms of which 4 ms to minimize.
[2024-06-01 16:01:50] [INFO ] Deduced a trap composed of 104 places in 239 ms of which 3 ms to minimize.
[2024-06-01 16:01:50] [INFO ] Deduced a trap composed of 90 places in 246 ms of which 4 ms to minimize.
[2024-06-01 16:01:51] [INFO ] Deduced a trap composed of 122 places in 239 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 8 (OVERLAPS) 399/609 variables, 210/270 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/609 variables, 72/342 constraints. Problems are: Problem set: 0 solved, 390 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 609/609 variables, and 342 constraints, problems are : Problem set: 0 solved, 390 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 210/210 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 390/390 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/209 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 33/50 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 4 (OVERLAPS) 1/210 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 390 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 1)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 1)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 1)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 1)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 1)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 1)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 1)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 1)
(s99 0)
(s100 0)
(s101 1)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 210/609 variables, and 60 constraints, problems are : Problem set: 0 solved, 390 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/210 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/390 constraints, Known Traps: 40/40 constraints]
After SMT, in 60374ms problems are : Problem set: 0 solved, 390 unsolved
Search for dead transitions found 0 dead transitions in 60380ms
Starting structural reductions in SI_LTL mode, iteration 1 : 210/367 places, 399/604 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61710 ms. Remains : 210/367 places, 399/604 transitions.
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Anderson-PT-09-LTLCardinality-09
Product exploration explored 100000 steps with 84 reset in 277 ms.
Product exploration explored 100000 steps with 85 reset in 547 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 p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 123 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Reduction of identical properties reduced properties to check from 6 to 4
RANDOM walk for 40000 steps (8 resets) in 240 ms. (165 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 206 ms. (193 steps per ms) remains 1/1 properties
[2024-06-01 16:02:28] [INFO ] Invariant cache hit.
[2024-06-01 16:02:28] [INFO ] State equation strengthened by 72 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Real declared 194/609 variables, and 4 constraints, problems are : Problem set: 1 solved, 0 unsolved in 112 ms.
Refiners :[Positive P Invariants (semi-flows): 4/11 constraints, Generalized P Invariants (flows): 0/9 constraints, State Equation: 0/210 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 125ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p1)), (G (OR (NOT p2) p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p2 p1))), (F (NOT p1)), (F p2), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 10 factoid took 426 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 2 out of 210 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 210/210 places, 399/399 transitions.
Applied a total of 0 rules in 14 ms. Remains 210 /210 variables (removed 0) and now considering 399/399 (removed 0) transitions.
[2024-06-01 16:02:29] [INFO ] Invariant cache hit.
[2024-06-01 16:02:29] [INFO ] Implicit Places using invariants in 441 ms returned []
[2024-06-01 16:02:29] [INFO ] Invariant cache hit.
[2024-06-01 16:02:30] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 16:02:31] [INFO ] Implicit Places using invariants and state equation in 1129 ms returned []
Implicit Place search using SMT with State Equation took 1573 ms to find 0 implicit places.
[2024-06-01 16:02:31] [INFO ] Redundant transitions in 3 ms returned []
Running 390 sub problems to find dead transitions.
[2024-06-01 16:02:31] [INFO ] Invariant cache hit.
[2024-06-01 16:02:31] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/209 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 3 (OVERLAPS) 1/210 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 390 unsolved
[2024-06-01 16:02:42] [INFO ] Deduced a trap composed of 82 places in 289 ms of which 4 ms to minimize.
[2024-06-01 16:02:43] [INFO ] Deduced a trap composed of 85 places in 268 ms of which 4 ms to minimize.
[2024-06-01 16:02:43] [INFO ] Deduced a trap composed of 67 places in 282 ms of which 4 ms to minimize.
[2024-06-01 16:02:43] [INFO ] Deduced a trap composed of 80 places in 283 ms of which 4 ms to minimize.
[2024-06-01 16:02:44] [INFO ] Deduced a trap composed of 84 places in 267 ms of which 4 ms to minimize.
[2024-06-01 16:02:44] [INFO ] Deduced a trap composed of 72 places in 268 ms of which 4 ms to minimize.
[2024-06-01 16:02:44] [INFO ] Deduced a trap composed of 87 places in 310 ms of which 4 ms to minimize.
[2024-06-01 16:02:44] [INFO ] Deduced a trap composed of 90 places in 268 ms of which 4 ms to minimize.
[2024-06-01 16:02:45] [INFO ] Deduced a trap composed of 65 places in 260 ms of which 4 ms to minimize.
[2024-06-01 16:02:45] [INFO ] Deduced a trap composed of 82 places in 285 ms of which 4 ms to minimize.
[2024-06-01 16:02:45] [INFO ] Deduced a trap composed of 91 places in 259 ms of which 3 ms to minimize.
[2024-06-01 16:02:46] [INFO ] Deduced a trap composed of 89 places in 278 ms of which 4 ms to minimize.
[2024-06-01 16:02:46] [INFO ] Deduced a trap composed of 87 places in 278 ms of which 3 ms to minimize.
[2024-06-01 16:02:46] [INFO ] Deduced a trap composed of 94 places in 262 ms of which 4 ms to minimize.
[2024-06-01 16:02:46] [INFO ] Deduced a trap composed of 94 places in 273 ms of which 4 ms to minimize.
[2024-06-01 16:02:47] [INFO ] Deduced a trap composed of 89 places in 263 ms of which 3 ms to minimize.
[2024-06-01 16:02:47] [INFO ] Deduced a trap composed of 104 places in 275 ms of which 4 ms to minimize.
[2024-06-01 16:02:47] [INFO ] Deduced a trap composed of 94 places in 282 ms of which 3 ms to minimize.
[2024-06-01 16:02:48] [INFO ] Deduced a trap composed of 76 places in 283 ms of which 4 ms to minimize.
[2024-06-01 16:02:48] [INFO ] Deduced a trap composed of 90 places in 287 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 390 unsolved
[2024-06-01 16:02:50] [INFO ] Deduced a trap composed of 91 places in 200 ms of which 4 ms to minimize.
[2024-06-01 16:02:50] [INFO ] Deduced a trap composed of 102 places in 261 ms of which 4 ms to minimize.
[2024-06-01 16:02:50] [INFO ] Deduced a trap composed of 106 places in 275 ms of which 4 ms to minimize.
[2024-06-01 16:02:51] [INFO ] Deduced a trap composed of 60 places in 277 ms of which 3 ms to minimize.
[2024-06-01 16:02:51] [INFO ] Deduced a trap composed of 66 places in 272 ms of which 4 ms to minimize.
[2024-06-01 16:02:51] [INFO ] Deduced a trap composed of 95 places in 271 ms of which 4 ms to minimize.
[2024-06-01 16:02:52] [INFO ] Deduced a trap composed of 64 places in 272 ms of which 4 ms to minimize.
[2024-06-01 16:02:52] [INFO ] Deduced a trap composed of 55 places in 266 ms of which 3 ms to minimize.
[2024-06-01 16:02:52] [INFO ] Deduced a trap composed of 70 places in 255 ms of which 3 ms to minimize.
[2024-06-01 16:02:52] [INFO ] Deduced a trap composed of 120 places in 273 ms of which 3 ms to minimize.
[2024-06-01 16:02:53] [INFO ] Deduced a trap composed of 84 places in 272 ms of which 4 ms to minimize.
[2024-06-01 16:02:53] [INFO ] Deduced a trap composed of 94 places in 230 ms of which 3 ms to minimize.
[2024-06-01 16:02:53] [INFO ] Deduced a trap composed of 73 places in 269 ms of which 4 ms to minimize.
[2024-06-01 16:02:54] [INFO ] Deduced a trap composed of 56 places in 298 ms of which 3 ms to minimize.
[2024-06-01 16:02:54] [INFO ] Deduced a trap composed of 77 places in 259 ms of which 4 ms to minimize.
[2024-06-01 16:02:54] [INFO ] Deduced a trap composed of 89 places in 261 ms of which 4 ms to minimize.
[2024-06-01 16:02:55] [INFO ] Deduced a trap composed of 68 places in 260 ms of which 3 ms to minimize.
[2024-06-01 16:02:55] [INFO ] Deduced a trap composed of 104 places in 255 ms of which 3 ms to minimize.
[2024-06-01 16:02:55] [INFO ] Deduced a trap composed of 90 places in 231 ms of which 3 ms to minimize.
[2024-06-01 16:02:55] [INFO ] Deduced a trap composed of 122 places in 266 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 390 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 210/609 variables, and 60 constraints, problems are : Problem set: 0 solved, 390 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/210 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 390/390 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/209 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 33/50 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 4 (OVERLAPS) 1/210 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 390 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 210/609 variables, and 60 constraints, problems are : Problem set: 0 solved, 390 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/210 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/390 constraints, Known Traps: 40/40 constraints]
After SMT, in 60480ms problems are : Problem set: 0 solved, 390 unsolved
Search for dead transitions found 0 dead transitions in 60490ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62094 ms. Remains : 210/210 places, 399/399 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 : [(AND p0 p1), (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 146 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Reduction of identical properties reduced properties to check from 3 to 1
RANDOM walk for 5371 steps (1 resets) in 15 ms. (335 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 158 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 81 reset in 269 ms.
Product exploration explored 100000 steps with 108 reset in 409 ms.
Support contains 2 out of 210 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 210/210 places, 399/399 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 210 transition count 398
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 209 transition count 398
Applied a total of 2 rules in 19 ms. Remains 209 /210 variables (removed 1) and now considering 398/399 (removed 1) transitions.
// Phase 1: matrix 398 rows 209 cols
[2024-06-01 16:03:33] [INFO ] Computed 20 invariants in 4 ms
[2024-06-01 16:03:33] [INFO ] Implicit Places using invariants in 439 ms returned []
[2024-06-01 16:03:33] [INFO ] Invariant cache hit.
[2024-06-01 16:03:33] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 16:03:34] [INFO ] Implicit Places using invariants and state equation in 1161 ms returned []
Implicit Place search using SMT with State Equation took 1602 ms to find 0 implicit places.
[2024-06-01 16:03:34] [INFO ] Redundant transitions in 2 ms returned []
Running 389 sub problems to find dead transitions.
[2024-06-01 16:03:34] [INFO ] Invariant cache hit.
[2024-06-01 16:03:34] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 3 (OVERLAPS) 1/209 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-06-01 16:03:47] [INFO ] Deduced a trap composed of 74 places in 276 ms of which 3 ms to minimize.
[2024-06-01 16:03:47] [INFO ] Deduced a trap composed of 67 places in 271 ms of which 4 ms to minimize.
[2024-06-01 16:03:47] [INFO ] Deduced a trap composed of 81 places in 256 ms of which 4 ms to minimize.
[2024-06-01 16:03:47] [INFO ] Deduced a trap composed of 75 places in 260 ms of which 4 ms to minimize.
[2024-06-01 16:03:48] [INFO ] Deduced a trap composed of 76 places in 266 ms of which 4 ms to minimize.
[2024-06-01 16:03:48] [INFO ] Deduced a trap composed of 92 places in 261 ms of which 3 ms to minimize.
[2024-06-01 16:03:48] [INFO ] Deduced a trap composed of 67 places in 266 ms of which 4 ms to minimize.
[2024-06-01 16:03:49] [INFO ] Deduced a trap composed of 95 places in 243 ms of which 4 ms to minimize.
[2024-06-01 16:03:49] [INFO ] Deduced a trap composed of 74 places in 267 ms of which 4 ms to minimize.
[2024-06-01 16:03:49] [INFO ] Deduced a trap composed of 92 places in 278 ms of which 3 ms to minimize.
[2024-06-01 16:03:49] [INFO ] Deduced a trap composed of 75 places in 255 ms of which 3 ms to minimize.
[2024-06-01 16:03:50] [INFO ] Deduced a trap composed of 64 places in 280 ms of which 4 ms to minimize.
[2024-06-01 16:03:50] [INFO ] Deduced a trap composed of 72 places in 265 ms of which 4 ms to minimize.
[2024-06-01 16:03:50] [INFO ] Deduced a trap composed of 76 places in 261 ms of which 3 ms to minimize.
[2024-06-01 16:03:51] [INFO ] Deduced a trap composed of 74 places in 264 ms of which 4 ms to minimize.
[2024-06-01 16:03:51] [INFO ] Deduced a trap composed of 64 places in 260 ms of which 4 ms to minimize.
[2024-06-01 16:03:51] [INFO ] Deduced a trap composed of 77 places in 252 ms of which 3 ms to minimize.
[2024-06-01 16:03:51] [INFO ] Deduced a trap composed of 65 places in 267 ms of which 4 ms to minimize.
[2024-06-01 16:03:52] [INFO ] Deduced a trap composed of 65 places in 262 ms of which 5 ms to minimize.
[2024-06-01 16:03:52] [INFO ] Deduced a trap composed of 52 places in 269 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-06-01 16:03:55] [INFO ] Deduced a trap composed of 74 places in 265 ms of which 4 ms to minimize.
[2024-06-01 16:03:55] [INFO ] Deduced a trap composed of 59 places in 205 ms of which 4 ms to minimize.
[2024-06-01 16:03:55] [INFO ] Deduced a trap composed of 71 places in 268 ms of which 4 ms to minimize.
[2024-06-01 16:03:56] [INFO ] Deduced a trap composed of 64 places in 262 ms of which 3 ms to minimize.
[2024-06-01 16:03:56] [INFO ] Deduced a trap composed of 82 places in 274 ms of which 4 ms to minimize.
[2024-06-01 16:03:56] [INFO ] Deduced a trap composed of 60 places in 273 ms of which 4 ms to minimize.
[2024-06-01 16:03:57] [INFO ] Deduced a trap composed of 72 places in 197 ms of which 3 ms to minimize.
[2024-06-01 16:03:57] [INFO ] Deduced a trap composed of 85 places in 261 ms of which 4 ms to minimize.
[2024-06-01 16:03:57] [INFO ] Deduced a trap composed of 86 places in 260 ms of which 4 ms to minimize.
[2024-06-01 16:03:57] [INFO ] Deduced a trap composed of 78 places in 259 ms of which 4 ms to minimize.
[2024-06-01 16:03:58] [INFO ] Deduced a trap composed of 83 places in 255 ms of which 3 ms to minimize.
[2024-06-01 16:03:58] [INFO ] Deduced a trap composed of 78 places in 276 ms of which 4 ms to minimize.
[2024-06-01 16:03:58] [INFO ] Deduced a trap composed of 88 places in 265 ms of which 4 ms to minimize.
[2024-06-01 16:03:58] [INFO ] Deduced a trap composed of 76 places in 261 ms of which 3 ms to minimize.
[2024-06-01 16:03:59] [INFO ] Deduced a trap composed of 88 places in 257 ms of which 4 ms to minimize.
[2024-06-01 16:03:59] [INFO ] Deduced a trap composed of 85 places in 255 ms of which 3 ms to minimize.
[2024-06-01 16:03:59] [INFO ] Deduced a trap composed of 83 places in 272 ms of which 4 ms to minimize.
[2024-06-01 16:04:00] [INFO ] Deduced a trap composed of 77 places in 266 ms of which 4 ms to minimize.
[2024-06-01 16:04:00] [INFO ] Deduced a trap composed of 108 places in 265 ms of which 3 ms to minimize.
[2024-06-01 16:04:00] [INFO ] Deduced a trap composed of 99 places in 265 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 389 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 1.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 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.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 0.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 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.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 0.0)
(s78 0.0)
(s79 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 209/607 variables, and 60 constraints, problems are : Problem set: 0 solved, 389 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/209 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 389/389 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 389 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 40/57 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 4 (OVERLAPS) 1/209 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-06-01 16:04:11] [INFO ] Deduced a trap composed of 87 places in 271 ms of which 4 ms to minimize.
[2024-06-01 16:04:12] [INFO ] Deduced a trap composed of 81 places in 274 ms of which 4 ms to minimize.
[2024-06-01 16:04:12] [INFO ] Deduced a trap composed of 93 places in 278 ms of which 3 ms to minimize.
[2024-06-01 16:04:13] [INFO ] Deduced a trap composed of 87 places in 259 ms of which 3 ms to minimize.
[2024-06-01 16:04:13] [INFO ] Deduced a trap composed of 68 places in 265 ms of which 4 ms to minimize.
[2024-06-01 16:04:13] [INFO ] Deduced a trap composed of 61 places in 222 ms of which 3 ms to minimize.
[2024-06-01 16:04:14] [INFO ] Deduced a trap composed of 65 places in 199 ms of which 4 ms to minimize.
[2024-06-01 16:04:14] [INFO ] Deduced a trap composed of 64 places in 225 ms of which 3 ms to minimize.
[2024-06-01 16:04:14] [INFO ] Deduced a trap composed of 58 places in 270 ms of which 4 ms to minimize.
[2024-06-01 16:04:15] [INFO ] Deduced a trap composed of 86 places in 270 ms of which 3 ms to minimize.
[2024-06-01 16:04:15] [INFO ] Deduced a trap composed of 53 places in 274 ms of which 4 ms to minimize.
[2024-06-01 16:04:15] [INFO ] Deduced a trap composed of 59 places in 261 ms of which 4 ms to minimize.
[2024-06-01 16:04:15] [INFO ] Deduced a trap composed of 50 places in 275 ms of which 3 ms to minimize.
[2024-06-01 16:04:16] [INFO ] Deduced a trap composed of 50 places in 269 ms of which 4 ms to minimize.
[2024-06-01 16:04:16] [INFO ] Deduced a trap composed of 65 places in 273 ms of which 4 ms to minimize.
[2024-06-01 16:04:17] [INFO ] Deduced a trap composed of 63 places in 258 ms of which 4 ms to minimize.
[2024-06-01 16:04:17] [INFO ] Deduced a trap composed of 47 places in 256 ms of which 4 ms to minimize.
[2024-06-01 16:04:17] [INFO ] Deduced a trap composed of 69 places in 256 ms of which 4 ms to minimize.
[2024-06-01 16:04:17] [INFO ] Deduced a trap composed of 55 places in 253 ms of which 3 ms to minimize.
[2024-06-01 16:04:18] [INFO ] Deduced a trap composed of 47 places in 257 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-06-01 16:04:21] [INFO ] Deduced a trap composed of 46 places in 275 ms of which 3 ms to minimize.
[2024-06-01 16:04:21] [INFO ] Deduced a trap composed of 77 places in 266 ms of which 4 ms to minimize.
[2024-06-01 16:04:22] [INFO ] Deduced a trap composed of 62 places in 276 ms of which 4 ms to minimize.
[2024-06-01 16:04:22] [INFO ] Deduced a trap composed of 72 places in 268 ms of which 4 ms to minimize.
[2024-06-01 16:04:22] [INFO ] Deduced a trap composed of 60 places in 206 ms of which 4 ms to minimize.
[2024-06-01 16:04:22] [INFO ] Deduced a trap composed of 51 places in 251 ms of which 4 ms to minimize.
[2024-06-01 16:04:23] [INFO ] Deduced a trap composed of 80 places in 268 ms of which 4 ms to minimize.
[2024-06-01 16:04:23] [INFO ] Deduced a trap composed of 67 places in 266 ms of which 4 ms to minimize.
[2024-06-01 16:04:23] [INFO ] Deduced a trap composed of 48 places in 269 ms of which 4 ms to minimize.
[2024-06-01 16:04:23] [INFO ] Deduced a trap composed of 48 places in 277 ms of which 4 ms to minimize.
[2024-06-01 16:04:24] [INFO ] Deduced a trap composed of 74 places in 284 ms of which 4 ms to minimize.
[2024-06-01 16:04:24] [INFO ] Deduced a trap composed of 80 places in 260 ms of which 3 ms to minimize.
[2024-06-01 16:04:24] [INFO ] Deduced a trap composed of 66 places in 270 ms of which 4 ms to minimize.
[2024-06-01 16:04:25] [INFO ] Deduced a trap composed of 61 places in 281 ms of which 4 ms to minimize.
[2024-06-01 16:04:25] [INFO ] Deduced a trap composed of 56 places in 198 ms of which 3 ms to minimize.
[2024-06-01 16:04:25] [INFO ] Deduced a trap composed of 59 places in 272 ms of which 4 ms to minimize.
[2024-06-01 16:04:25] [INFO ] Deduced a trap composed of 80 places in 266 ms of which 4 ms to minimize.
[2024-06-01 16:04:26] [INFO ] Deduced a trap composed of 63 places in 263 ms of which 4 ms to minimize.
[2024-06-01 16:04:26] [INFO ] Deduced a trap composed of 79 places in 245 ms of which 3 ms to minimize.
[2024-06-01 16:04:26] [INFO ] Deduced a trap composed of 71 places in 273 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 389 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 209/607 variables, and 100 constraints, problems are : Problem set: 0 solved, 389 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/209 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/389 constraints, Known Traps: 80/80 constraints]
After SMT, in 60465ms problems are : Problem set: 0 solved, 389 unsolved
Search for dead transitions found 0 dead transitions in 60473ms
Starting structural reductions in SI_LTL mode, iteration 1 : 209/210 places, 398/399 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62105 ms. Remains : 209/210 places, 398/399 transitions.
Treatment of property Anderson-PT-09-LTLCardinality-09 finished in 189730 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 367 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 367/367 places, 604/604 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 367 transition count 524
Reduce places removed 80 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 81 rules applied. Total rules applied 161 place count 287 transition count 523
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 162 place count 286 transition count 523
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 72 Pre rules applied. Total rules applied 162 place count 286 transition count 451
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 306 place count 214 transition count 451
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 313 place count 207 transition count 396
Iterating global reduction 3 with 7 rules applied. Total rules applied 320 place count 207 transition count 396
Applied a total of 320 rules in 39 ms. Remains 207 /367 variables (removed 160) and now considering 396/604 (removed 208) transitions.
// Phase 1: matrix 396 rows 207 cols
[2024-06-01 16:04:35] [INFO ] Computed 20 invariants in 4 ms
[2024-06-01 16:04:35] [INFO ] Implicit Places using invariants in 435 ms returned []
[2024-06-01 16:04:35] [INFO ] Invariant cache hit.
[2024-06-01 16:04:36] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 16:04:36] [INFO ] Implicit Places using invariants and state equation in 988 ms returned []
Implicit Place search using SMT with State Equation took 1428 ms to find 0 implicit places.
[2024-06-01 16:04:36] [INFO ] Redundant transitions in 3 ms returned []
Running 387 sub problems to find dead transitions.
[2024-06-01 16:04:36] [INFO ] Invariant cache hit.
[2024-06-01 16:04:36] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/206 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 387 unsolved
[2024-06-01 16:04:42] [INFO ] Deduced a trap composed of 88 places in 263 ms of which 3 ms to minimize.
[2024-06-01 16:04:42] [INFO ] Deduced a trap composed of 73 places in 270 ms of which 4 ms to minimize.
[2024-06-01 16:04:42] [INFO ] Deduced a trap composed of 67 places in 270 ms of which 4 ms to minimize.
[2024-06-01 16:04:43] [INFO ] Deduced a trap composed of 69 places in 205 ms of which 3 ms to minimize.
[2024-06-01 16:04:43] [INFO ] Deduced a trap composed of 88 places in 265 ms of which 4 ms to minimize.
[2024-06-01 16:04:44] [INFO ] Deduced a trap composed of 76 places in 268 ms of which 4 ms to minimize.
[2024-06-01 16:04:44] [INFO ] Deduced a trap composed of 67 places in 289 ms of which 4 ms to minimize.
[2024-06-01 16:04:44] [INFO ] Deduced a trap composed of 62 places in 264 ms of which 4 ms to minimize.
[2024-06-01 16:04:44] [INFO ] Deduced a trap composed of 86 places in 263 ms of which 3 ms to minimize.
[2024-06-01 16:04:45] [INFO ] Deduced a trap composed of 64 places in 256 ms of which 4 ms to minimize.
[2024-06-01 16:04:45] [INFO ] Deduced a trap composed of 83 places in 273 ms of which 4 ms to minimize.
[2024-06-01 16:04:45] [INFO ] Deduced a trap composed of 89 places in 261 ms of which 3 ms to minimize.
[2024-06-01 16:04:46] [INFO ] Deduced a trap composed of 87 places in 264 ms of which 3 ms to minimize.
[2024-06-01 16:04:46] [INFO ] Deduced a trap composed of 96 places in 260 ms of which 3 ms to minimize.
[2024-06-01 16:04:46] [INFO ] Deduced a trap composed of 69 places in 259 ms of which 3 ms to minimize.
[2024-06-01 16:04:46] [INFO ] Deduced a trap composed of 79 places in 258 ms of which 3 ms to minimize.
[2024-06-01 16:04:47] [INFO ] Deduced a trap composed of 70 places in 263 ms of which 3 ms to minimize.
[2024-06-01 16:04:47] [INFO ] Deduced a trap composed of 66 places in 215 ms of which 4 ms to minimize.
[2024-06-01 16:04:47] [INFO ] Deduced a trap composed of 68 places in 292 ms of which 4 ms to minimize.
[2024-06-01 16:04:48] [INFO ] Deduced a trap composed of 69 places in 258 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 387 unsolved
[2024-06-01 16:04:51] [INFO ] Deduced a trap composed of 56 places in 266 ms of which 3 ms to minimize.
[2024-06-01 16:04:51] [INFO ] Deduced a trap composed of 78 places in 270 ms of which 4 ms to minimize.
[2024-06-01 16:04:51] [INFO ] Deduced a trap composed of 75 places in 261 ms of which 4 ms to minimize.
[2024-06-01 16:04:52] [INFO ] Deduced a trap composed of 81 places in 255 ms of which 3 ms to minimize.
[2024-06-01 16:04:52] [INFO ] Deduced a trap composed of 68 places in 263 ms of which 4 ms to minimize.
[2024-06-01 16:04:52] [INFO ] Deduced a trap composed of 64 places in 208 ms of which 4 ms to minimize.
[2024-06-01 16:04:52] [INFO ] Deduced a trap composed of 82 places in 259 ms of which 4 ms to minimize.
[2024-06-01 16:04:53] [INFO ] Deduced a trap composed of 61 places in 261 ms of which 4 ms to minimize.
[2024-06-01 16:04:53] [INFO ] Deduced a trap composed of 93 places in 204 ms of which 4 ms to minimize.
[2024-06-01 16:04:53] [INFO ] Deduced a trap composed of 76 places in 262 ms of which 4 ms to minimize.
[2024-06-01 16:04:53] [INFO ] Deduced a trap composed of 72 places in 266 ms of which 4 ms to minimize.
[2024-06-01 16:04:54] [INFO ] Deduced a trap composed of 78 places in 254 ms of which 3 ms to minimize.
[2024-06-01 16:04:54] [INFO ] Deduced a trap composed of 78 places in 251 ms of which 4 ms to minimize.
[2024-06-01 16:04:54] [INFO ] Deduced a trap composed of 88 places in 278 ms of which 4 ms to minimize.
[2024-06-01 16:04:55] [INFO ] Deduced a trap composed of 91 places in 269 ms of which 3 ms to minimize.
[2024-06-01 16:04:55] [INFO ] Deduced a trap composed of 95 places in 216 ms of which 3 ms to minimize.
[2024-06-01 16:04:55] [INFO ] Deduced a trap composed of 74 places in 272 ms of which 4 ms to minimize.
[2024-06-01 16:04:56] [INFO ] Deduced a trap composed of 63 places in 276 ms of which 4 ms to minimize.
[2024-06-01 16:04:56] [INFO ] Deduced a trap composed of 61 places in 270 ms of which 4 ms to minimize.
[2024-06-01 16:04:56] [INFO ] Deduced a trap composed of 64 places in 266 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 5 (OVERLAPS) 1/207 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 387 unsolved
[2024-06-01 16:05:04] [INFO ] Deduced a trap composed of 84 places in 172 ms of which 3 ms to minimize.
[2024-06-01 16:05:04] [INFO ] Deduced a trap composed of 75 places in 163 ms of which 2 ms to minimize.
[2024-06-01 16:05:04] [INFO ] Deduced a trap composed of 84 places in 200 ms of which 2 ms to minimize.
[2024-06-01 16:05:04] [INFO ] Deduced a trap composed of 73 places in 166 ms of which 2 ms to minimize.
[2024-06-01 16:05:04] [INFO ] Deduced a trap composed of 48 places in 254 ms of which 3 ms to minimize.
[2024-06-01 16:05:05] [INFO ] Deduced a trap composed of 73 places in 214 ms of which 3 ms to minimize.
[2024-06-01 16:05:05] [INFO ] Deduced a trap composed of 62 places in 256 ms of which 3 ms to minimize.
[2024-06-01 16:05:05] [INFO ] Deduced a trap composed of 68 places in 165 ms of which 3 ms to minimize.
[2024-06-01 16:05:05] [INFO ] Deduced a trap composed of 75 places in 154 ms of which 2 ms to minimize.
[2024-06-01 16:05:06] [INFO ] Deduced a trap composed of 71 places in 259 ms of which 3 ms to minimize.
[2024-06-01 16:05:06] [INFO ] Deduced a trap composed of 47 places in 266 ms of which 4 ms to minimize.
[2024-06-01 16:05:06] [INFO ] Deduced a trap composed of 72 places in 173 ms of which 2 ms to minimize.
[2024-06-01 16:05:07] [INFO ] Deduced a trap composed of 72 places in 268 ms of which 4 ms to minimize.
[2024-06-01 16:05:07] [INFO ] Deduced a trap composed of 67 places in 254 ms of which 4 ms to minimize.
SMT process timed out in 30523ms, After SMT, problems are : Problem set: 0 solved, 387 unsolved
Search for dead transitions found 0 dead transitions in 30530ms
Starting structural reductions in SI_LTL mode, iteration 1 : 207/367 places, 396/604 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 32008 ms. Remains : 207/367 places, 396/604 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-09-LTLCardinality-10
Product exploration explored 100000 steps with 99 reset in 234 ms.
Product exploration explored 100000 steps with 88 reset in 343 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)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 141 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 73 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 8357 steps (2 resets) in 21 ms. (379 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 142 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 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 207 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 207/207 places, 396/396 transitions.
Applied a total of 0 rules in 12 ms. Remains 207 /207 variables (removed 0) and now considering 396/396 (removed 0) transitions.
[2024-06-01 16:05:08] [INFO ] Invariant cache hit.
[2024-06-01 16:05:09] [INFO ] Implicit Places using invariants in 474 ms returned []
[2024-06-01 16:05:09] [INFO ] Invariant cache hit.
[2024-06-01 16:05:09] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 16:05:09] [INFO ] Implicit Places using invariants and state equation in 885 ms returned []
Implicit Place search using SMT with State Equation took 1360 ms to find 0 implicit places.
[2024-06-01 16:05:09] [INFO ] Redundant transitions in 3 ms returned []
Running 387 sub problems to find dead transitions.
[2024-06-01 16:05:09] [INFO ] Invariant cache hit.
[2024-06-01 16:05:09] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/206 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 387 unsolved
[2024-06-01 16:05:15] [INFO ] Deduced a trap composed of 88 places in 248 ms of which 3 ms to minimize.
[2024-06-01 16:05:15] [INFO ] Deduced a trap composed of 73 places in 169 ms of which 3 ms to minimize.
[2024-06-01 16:05:15] [INFO ] Deduced a trap composed of 67 places in 165 ms of which 3 ms to minimize.
[2024-06-01 16:05:16] [INFO ] Deduced a trap composed of 69 places in 261 ms of which 3 ms to minimize.
[2024-06-01 16:05:16] [INFO ] Deduced a trap composed of 88 places in 163 ms of which 3 ms to minimize.
[2024-06-01 16:05:16] [INFO ] Deduced a trap composed of 76 places in 160 ms of which 2 ms to minimize.
[2024-06-01 16:05:16] [INFO ] Deduced a trap composed of 67 places in 161 ms of which 2 ms to minimize.
[2024-06-01 16:05:17] [INFO ] Deduced a trap composed of 62 places in 168 ms of which 3 ms to minimize.
[2024-06-01 16:05:17] [INFO ] Deduced a trap composed of 86 places in 165 ms of which 2 ms to minimize.
[2024-06-01 16:05:17] [INFO ] Deduced a trap composed of 64 places in 176 ms of which 2 ms to minimize.
[2024-06-01 16:05:17] [INFO ] Deduced a trap composed of 83 places in 166 ms of which 2 ms to minimize.
[2024-06-01 16:05:17] [INFO ] Deduced a trap composed of 89 places in 171 ms of which 3 ms to minimize.
[2024-06-01 16:05:18] [INFO ] Deduced a trap composed of 87 places in 176 ms of which 2 ms to minimize.
[2024-06-01 16:05:18] [INFO ] Deduced a trap composed of 96 places in 172 ms of which 3 ms to minimize.
[2024-06-01 16:05:18] [INFO ] Deduced a trap composed of 69 places in 230 ms of which 3 ms to minimize.
[2024-06-01 16:05:18] [INFO ] Deduced a trap composed of 79 places in 271 ms of which 4 ms to minimize.
[2024-06-01 16:05:19] [INFO ] Deduced a trap composed of 70 places in 282 ms of which 4 ms to minimize.
[2024-06-01 16:05:19] [INFO ] Deduced a trap composed of 66 places in 169 ms of which 3 ms to minimize.
[2024-06-01 16:05:19] [INFO ] Deduced a trap composed of 68 places in 165 ms of which 2 ms to minimize.
[2024-06-01 16:05:19] [INFO ] Deduced a trap composed of 69 places in 163 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 387 unsolved
[2024-06-01 16:05:22] [INFO ] Deduced a trap composed of 56 places in 278 ms of which 4 ms to minimize.
[2024-06-01 16:05:22] [INFO ] Deduced a trap composed of 78 places in 224 ms of which 3 ms to minimize.
[2024-06-01 16:05:22] [INFO ] Deduced a trap composed of 75 places in 268 ms of which 4 ms to minimize.
[2024-06-01 16:05:23] [INFO ] Deduced a trap composed of 81 places in 258 ms of which 4 ms to minimize.
[2024-06-01 16:05:23] [INFO ] Deduced a trap composed of 68 places in 260 ms of which 4 ms to minimize.
[2024-06-01 16:05:23] [INFO ] Deduced a trap composed of 64 places in 256 ms of which 3 ms to minimize.
[2024-06-01 16:05:23] [INFO ] Deduced a trap composed of 82 places in 251 ms of which 4 ms to minimize.
[2024-06-01 16:05:24] [INFO ] Deduced a trap composed of 61 places in 256 ms of which 4 ms to minimize.
[2024-06-01 16:05:24] [INFO ] Deduced a trap composed of 93 places in 254 ms of which 4 ms to minimize.
[2024-06-01 16:05:24] [INFO ] Deduced a trap composed of 76 places in 259 ms of which 3 ms to minimize.
[2024-06-01 16:05:24] [INFO ] Deduced a trap composed of 72 places in 269 ms of which 4 ms to minimize.
[2024-06-01 16:05:25] [INFO ] Deduced a trap composed of 78 places in 171 ms of which 3 ms to minimize.
[2024-06-01 16:05:25] [INFO ] Deduced a trap composed of 78 places in 261 ms of which 4 ms to minimize.
[2024-06-01 16:05:25] [INFO ] Deduced a trap composed of 88 places in 195 ms of which 4 ms to minimize.
[2024-06-01 16:05:25] [INFO ] Deduced a trap composed of 91 places in 258 ms of which 4 ms to minimize.
[2024-06-01 16:05:26] [INFO ] Deduced a trap composed of 95 places in 259 ms of which 3 ms to minimize.
[2024-06-01 16:05:26] [INFO ] Deduced a trap composed of 74 places in 253 ms of which 4 ms to minimize.
[2024-06-01 16:05:26] [INFO ] Deduced a trap composed of 63 places in 255 ms of which 3 ms to minimize.
[2024-06-01 16:05:27] [INFO ] Deduced a trap composed of 61 places in 238 ms of which 3 ms to minimize.
[2024-06-01 16:05:27] [INFO ] Deduced a trap composed of 64 places in 227 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 5 (OVERLAPS) 1/207 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 387 unsolved
[2024-06-01 16:05:36] [INFO ] Deduced a trap composed of 84 places in 280 ms of which 4 ms to minimize.
[2024-06-01 16:05:36] [INFO ] Deduced a trap composed of 75 places in 261 ms of which 3 ms to minimize.
[2024-06-01 16:05:36] [INFO ] Deduced a trap composed of 84 places in 270 ms of which 4 ms to minimize.
[2024-06-01 16:05:36] [INFO ] Deduced a trap composed of 73 places in 255 ms of which 4 ms to minimize.
[2024-06-01 16:05:37] [INFO ] Deduced a trap composed of 48 places in 266 ms of which 3 ms to minimize.
[2024-06-01 16:05:37] [INFO ] Deduced a trap composed of 73 places in 238 ms of which 3 ms to minimize.
[2024-06-01 16:05:37] [INFO ] Deduced a trap composed of 62 places in 248 ms of which 3 ms to minimize.
[2024-06-01 16:05:38] [INFO ] Deduced a trap composed of 68 places in 256 ms of which 4 ms to minimize.
[2024-06-01 16:05:38] [INFO ] Deduced a trap composed of 75 places in 258 ms of which 3 ms to minimize.
[2024-06-01 16:05:38] [INFO ] Deduced a trap composed of 71 places in 247 ms of which 4 ms to minimize.
[2024-06-01 16:05:38] [INFO ] Deduced a trap composed of 47 places in 197 ms of which 3 ms to minimize.
[2024-06-01 16:05:39] [INFO ] Deduced a trap composed of 72 places in 256 ms of which 4 ms to minimize.
[2024-06-01 16:05:39] [INFO ] Deduced a trap composed of 72 places in 229 ms of which 3 ms to minimize.
[2024-06-01 16:05:39] [INFO ] Deduced a trap composed of 67 places in 252 ms of which 3 ms to minimize.
[2024-06-01 16:05:40] [INFO ] Deduced a trap composed of 66 places in 248 ms of which 4 ms to minimize.
[2024-06-01 16:05:40] [INFO ] Deduced a trap composed of 56 places in 252 ms of which 3 ms to minimize.
[2024-06-01 16:05:40] [INFO ] Deduced a trap composed of 65 places in 250 ms of which 4 ms to minimize.
SMT process timed out in 30638ms, After SMT, problems are : Problem set: 0 solved, 387 unsolved
Search for dead transitions found 0 dead transitions in 30646ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 32031 ms. Remains : 207/207 places, 396/396 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)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 170 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4963 steps (0 resets) in 20 ms. (236 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 194 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 102 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 101 reset in 273 ms.
Product exploration explored 100000 steps with 75 reset in 301 ms.
Support contains 1 out of 207 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 207/207 places, 396/396 transitions.
Applied a total of 0 rules in 11 ms. Remains 207 /207 variables (removed 0) and now considering 396/396 (removed 0) transitions.
[2024-06-01 16:05:41] [INFO ] Invariant cache hit.
[2024-06-01 16:05:42] [INFO ] Implicit Places using invariants in 338 ms returned []
[2024-06-01 16:05:42] [INFO ] Invariant cache hit.
[2024-06-01 16:05:42] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 16:05:43] [INFO ] Implicit Places using invariants and state equation in 1168 ms returned []
Implicit Place search using SMT with State Equation took 1518 ms to find 0 implicit places.
[2024-06-01 16:05:43] [INFO ] Redundant transitions in 3 ms returned []
Running 387 sub problems to find dead transitions.
[2024-06-01 16:05:43] [INFO ] Invariant cache hit.
[2024-06-01 16:05:43] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/206 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 387 unsolved
[2024-06-01 16:05:49] [INFO ] Deduced a trap composed of 88 places in 296 ms of which 4 ms to minimize.
[2024-06-01 16:05:49] [INFO ] Deduced a trap composed of 73 places in 261 ms of which 4 ms to minimize.
[2024-06-01 16:05:49] [INFO ] Deduced a trap composed of 67 places in 210 ms of which 3 ms to minimize.
[2024-06-01 16:05:50] [INFO ] Deduced a trap composed of 69 places in 265 ms of which 4 ms to minimize.
[2024-06-01 16:05:50] [INFO ] Deduced a trap composed of 88 places in 221 ms of which 3 ms to minimize.
[2024-06-01 16:05:50] [INFO ] Deduced a trap composed of 76 places in 276 ms of which 3 ms to minimize.
[2024-06-01 16:05:51] [INFO ] Deduced a trap composed of 67 places in 273 ms of which 4 ms to minimize.
[2024-06-01 16:05:51] [INFO ] Deduced a trap composed of 62 places in 274 ms of which 4 ms to minimize.
[2024-06-01 16:05:51] [INFO ] Deduced a trap composed of 86 places in 249 ms of which 4 ms to minimize.
[2024-06-01 16:05:51] [INFO ] Deduced a trap composed of 64 places in 284 ms of which 4 ms to minimize.
[2024-06-01 16:05:52] [INFO ] Deduced a trap composed of 83 places in 279 ms of which 4 ms to minimize.
[2024-06-01 16:05:52] [INFO ] Deduced a trap composed of 89 places in 194 ms of which 3 ms to minimize.
[2024-06-01 16:05:52] [INFO ] Deduced a trap composed of 87 places in 260 ms of which 3 ms to minimize.
[2024-06-01 16:05:53] [INFO ] Deduced a trap composed of 96 places in 283 ms of which 3 ms to minimize.
[2024-06-01 16:05:53] [INFO ] Deduced a trap composed of 69 places in 263 ms of which 3 ms to minimize.
[2024-06-01 16:05:53] [INFO ] Deduced a trap composed of 79 places in 257 ms of which 4 ms to minimize.
[2024-06-01 16:05:54] [INFO ] Deduced a trap composed of 70 places in 273 ms of which 4 ms to minimize.
[2024-06-01 16:05:54] [INFO ] Deduced a trap composed of 66 places in 264 ms of which 4 ms to minimize.
[2024-06-01 16:05:54] [INFO ] Deduced a trap composed of 68 places in 259 ms of which 3 ms to minimize.
[2024-06-01 16:05:54] [INFO ] Deduced a trap composed of 69 places in 268 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 387 unsolved
[2024-06-01 16:05:57] [INFO ] Deduced a trap composed of 56 places in 200 ms of which 4 ms to minimize.
[2024-06-01 16:05:58] [INFO ] Deduced a trap composed of 78 places in 258 ms of which 4 ms to minimize.
[2024-06-01 16:05:58] [INFO ] Deduced a trap composed of 75 places in 250 ms of which 4 ms to minimize.
[2024-06-01 16:05:58] [INFO ] Deduced a trap composed of 81 places in 269 ms of which 3 ms to minimize.
[2024-06-01 16:05:59] [INFO ] Deduced a trap composed of 68 places in 251 ms of which 4 ms to minimize.
[2024-06-01 16:05:59] [INFO ] Deduced a trap composed of 64 places in 260 ms of which 3 ms to minimize.
[2024-06-01 16:05:59] [INFO ] Deduced a trap composed of 82 places in 252 ms of which 4 ms to minimize.
[2024-06-01 16:05:59] [INFO ] Deduced a trap composed of 61 places in 262 ms of which 4 ms to minimize.
[2024-06-01 16:06:00] [INFO ] Deduced a trap composed of 93 places in 261 ms of which 4 ms to minimize.
[2024-06-01 16:06:00] [INFO ] Deduced a trap composed of 76 places in 261 ms of which 3 ms to minimize.
[2024-06-01 16:06:00] [INFO ] Deduced a trap composed of 72 places in 260 ms of which 3 ms to minimize.
[2024-06-01 16:06:01] [INFO ] Deduced a trap composed of 78 places in 266 ms of which 4 ms to minimize.
[2024-06-01 16:06:01] [INFO ] Deduced a trap composed of 78 places in 250 ms of which 3 ms to minimize.
[2024-06-01 16:06:01] [INFO ] Deduced a trap composed of 88 places in 265 ms of which 3 ms to minimize.
[2024-06-01 16:06:01] [INFO ] Deduced a trap composed of 91 places in 257 ms of which 4 ms to minimize.
[2024-06-01 16:06:02] [INFO ] Deduced a trap composed of 95 places in 264 ms of which 4 ms to minimize.
[2024-06-01 16:06:02] [INFO ] Deduced a trap composed of 74 places in 264 ms of which 4 ms to minimize.
[2024-06-01 16:06:02] [INFO ] Deduced a trap composed of 63 places in 263 ms of which 4 ms to minimize.
[2024-06-01 16:06:03] [INFO ] Deduced a trap composed of 61 places in 266 ms of which 4 ms to minimize.
[2024-06-01 16:06:03] [INFO ] Deduced a trap composed of 64 places in 263 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 5 (OVERLAPS) 1/207 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 387 unsolved
[2024-06-01 16:06:11] [INFO ] Deduced a trap composed of 84 places in 268 ms of which 4 ms to minimize.
[2024-06-01 16:06:11] [INFO ] Deduced a trap composed of 75 places in 261 ms of which 4 ms to minimize.
[2024-06-01 16:06:12] [INFO ] Deduced a trap composed of 84 places in 265 ms of which 4 ms to minimize.
[2024-06-01 16:06:12] [INFO ] Deduced a trap composed of 73 places in 259 ms of which 4 ms to minimize.
[2024-06-01 16:06:12] [INFO ] Deduced a trap composed of 48 places in 221 ms of which 3 ms to minimize.
[2024-06-01 16:06:12] [INFO ] Deduced a trap composed of 73 places in 275 ms of which 4 ms to minimize.
[2024-06-01 16:06:13] [INFO ] Deduced a trap composed of 62 places in 252 ms of which 3 ms to minimize.
[2024-06-01 16:06:13] [INFO ] Deduced a trap composed of 68 places in 256 ms of which 3 ms to minimize.
[2024-06-01 16:06:13] [INFO ] Deduced a trap composed of 75 places in 260 ms of which 4 ms to minimize.
[2024-06-01 16:06:13] [INFO ] Deduced a trap composed of 71 places in 230 ms of which 3 ms to minimize.
SMT process timed out in 30457ms, After SMT, problems are : Problem set: 0 solved, 387 unsolved
Search for dead transitions found 0 dead transitions in 30465ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 32009 ms. Remains : 207/207 places, 396/396 transitions.
Treatment of property Anderson-PT-09-LTLCardinality-10 finished in 98750 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(p0)||F(((!p1&&X(p2))||G(p2)))))))'
Support contains 4 out of 367 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 367/367 places, 604/604 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 360 transition count 549
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 360 transition count 549
Applied a total of 14 rules in 17 ms. Remains 360 /367 variables (removed 7) and now considering 549/604 (removed 55) transitions.
// Phase 1: matrix 549 rows 360 cols
[2024-06-01 16:06:14] [INFO ] Computed 20 invariants in 6 ms
[2024-06-01 16:06:14] [INFO ] Implicit Places using invariants in 475 ms returned []
[2024-06-01 16:06:14] [INFO ] Invariant cache hit.
[2024-06-01 16:06:14] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 16:06:16] [INFO ] Implicit Places using invariants and state equation in 1985 ms returned []
Implicit Place search using SMT with State Equation took 2466 ms to find 0 implicit places.
Running 540 sub problems to find dead transitions.
[2024-06-01 16:06:16] [INFO ] Invariant cache hit.
[2024-06-01 16:06:16] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/359 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/359 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 540 unsolved
[2024-06-01 16:06:26] [INFO ] Deduced a trap composed of 155 places in 359 ms of which 5 ms to minimize.
[2024-06-01 16:06:29] [INFO ] Deduced a trap composed of 131 places in 462 ms of which 5 ms to minimize.
[2024-06-01 16:06:30] [INFO ] Deduced a trap composed of 62 places in 349 ms of which 5 ms to minimize.
[2024-06-01 16:06:30] [INFO ] Deduced a trap composed of 158 places in 363 ms of which 6 ms to minimize.
[2024-06-01 16:06:31] [INFO ] Deduced a trap composed of 114 places in 349 ms of which 6 ms to minimize.
[2024-06-01 16:06:31] [INFO ] Deduced a trap composed of 132 places in 357 ms of which 6 ms to minimize.
[2024-06-01 16:06:31] [INFO ] Deduced a trap composed of 99 places in 344 ms of which 4 ms to minimize.
[2024-06-01 16:06:32] [INFO ] Deduced a trap composed of 182 places in 356 ms of which 6 ms to minimize.
[2024-06-01 16:06:32] [INFO ] Deduced a trap composed of 137 places in 349 ms of which 4 ms to minimize.
[2024-06-01 16:06:32] [INFO ] Deduced a trap composed of 136 places in 351 ms of which 5 ms to minimize.
[2024-06-01 16:06:33] [INFO ] Deduced a trap composed of 128 places in 349 ms of which 6 ms to minimize.
[2024-06-01 16:06:33] [INFO ] Deduced a trap composed of 146 places in 408 ms of which 6 ms to minimize.
[2024-06-01 16:06:34] [INFO ] Deduced a trap composed of 169 places in 417 ms of which 6 ms to minimize.
[2024-06-01 16:06:34] [INFO ] Deduced a trap composed of 171 places in 392 ms of which 6 ms to minimize.
[2024-06-01 16:06:34] [INFO ] Deduced a trap composed of 132 places in 402 ms of which 5 ms to minimize.
[2024-06-01 16:06:35] [INFO ] Deduced a trap composed of 163 places in 394 ms of which 6 ms to minimize.
[2024-06-01 16:06:35] [INFO ] Deduced a trap composed of 97 places in 409 ms of which 6 ms to minimize.
[2024-06-01 16:06:36] [INFO ] Deduced a trap composed of 115 places in 406 ms of which 5 ms to minimize.
[2024-06-01 16:06:36] [INFO ] Deduced a trap composed of 203 places in 409 ms of which 6 ms to minimize.
[2024-06-01 16:06:37] [INFO ] Deduced a trap composed of 214 places in 404 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/359 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 540 unsolved
[2024-06-01 16:06:41] [INFO ] Deduced a trap composed of 168 places in 405 ms of which 5 ms to minimize.
[2024-06-01 16:06:41] [INFO ] Deduced a trap composed of 97 places in 347 ms of which 6 ms to minimize.
[2024-06-01 16:06:42] [INFO ] Deduced a trap composed of 115 places in 450 ms of which 6 ms to minimize.
[2024-06-01 16:06:42] [INFO ] Deduced a trap composed of 172 places in 404 ms of which 5 ms to minimize.
[2024-06-01 16:06:42] [INFO ] Deduced a trap composed of 147 places in 425 ms of which 6 ms to minimize.
[2024-06-01 16:06:43] [INFO ] Deduced a trap composed of 114 places in 429 ms of which 6 ms to minimize.
[2024-06-01 16:06:43] [INFO ] Deduced a trap composed of 194 places in 417 ms of which 6 ms to minimize.
[2024-06-01 16:06:44] [INFO ] Deduced a trap composed of 140 places in 442 ms of which 6 ms to minimize.
[2024-06-01 16:06:44] [INFO ] Deduced a trap composed of 132 places in 430 ms of which 6 ms to minimize.
[2024-06-01 16:06:45] [INFO ] Deduced a trap composed of 240 places in 398 ms of which 5 ms to minimize.
[2024-06-01 16:06:45] [INFO ] Deduced a trap composed of 156 places in 422 ms of which 6 ms to minimize.
[2024-06-01 16:06:45] [INFO ] Deduced a trap composed of 166 places in 412 ms of which 6 ms to minimize.
[2024-06-01 16:06:46] [INFO ] Deduced a trap composed of 121 places in 421 ms of which 5 ms to minimize.
[2024-06-01 16:06:46] [INFO ] Deduced a trap composed of 164 places in 413 ms of which 5 ms to minimize.
[2024-06-01 16:06:47] [INFO ] Deduced a trap composed of 141 places in 411 ms of which 6 ms to minimize.
SMT process timed out in 30661ms, After SMT, problems are : Problem set: 0 solved, 540 unsolved
Search for dead transitions found 0 dead transitions in 30673ms
Starting structural reductions in LTL mode, iteration 1 : 360/367 places, 549/604 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33159 ms. Remains : 360/367 places, 549/604 transitions.
Stuttering acceptance computed with spot in 405 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : Anderson-PT-09-LTLCardinality-11
Product exploration explored 100000 steps with 22 reset in 334 ms.
Stack based approach found an accepted trace after 550 steps with 1 reset with depth 527 and stack size 360 in 2 ms.
FORMULA Anderson-PT-09-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-09-LTLCardinality-11 finished in 33937 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(p1))))'
Support contains 3 out of 367 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 367/367 places, 604/604 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 361 transition count 566
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 361 transition count 566
Applied a total of 12 rules in 17 ms. Remains 361 /367 variables (removed 6) and now considering 566/604 (removed 38) transitions.
// Phase 1: matrix 566 rows 361 cols
[2024-06-01 16:06:48] [INFO ] Computed 20 invariants in 6 ms
[2024-06-01 16:06:48] [INFO ] Implicit Places using invariants in 614 ms returned []
[2024-06-01 16:06:48] [INFO ] Invariant cache hit.
[2024-06-01 16:06:49] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 16:06:51] [INFO ] Implicit Places using invariants and state equation in 2596 ms returned []
Implicit Place search using SMT with State Equation took 3212 ms to find 0 implicit places.
Running 557 sub problems to find dead transitions.
[2024-06-01 16:06:51] [INFO ] Invariant cache hit.
[2024-06-01 16:06:51] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/361 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/361 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 557 unsolved
[2024-06-01 16:07:02] [INFO ] Deduced a trap composed of 72 places in 415 ms of which 6 ms to minimize.
[2024-06-01 16:07:02] [INFO ] Deduced a trap composed of 101 places in 274 ms of which 3 ms to minimize.
[2024-06-01 16:07:03] [INFO ] Deduced a trap composed of 183 places in 277 ms of which 4 ms to minimize.
[2024-06-01 16:07:03] [INFO ] Deduced a trap composed of 203 places in 307 ms of which 4 ms to minimize.
[2024-06-01 16:07:04] [INFO ] Deduced a trap composed of 193 places in 344 ms of which 6 ms to minimize.
[2024-06-01 16:07:04] [INFO ] Deduced a trap composed of 149 places in 384 ms of which 6 ms to minimize.
[2024-06-01 16:07:05] [INFO ] Deduced a trap composed of 143 places in 411 ms of which 5 ms to minimize.
[2024-06-01 16:07:05] [INFO ] Deduced a trap composed of 244 places in 396 ms of which 5 ms to minimize.
[2024-06-01 16:07:05] [INFO ] Deduced a trap composed of 105 places in 395 ms of which 5 ms to minimize.
[2024-06-01 16:07:06] [INFO ] Deduced a trap composed of 149 places in 401 ms of which 6 ms to minimize.
[2024-06-01 16:07:06] [INFO ] Deduced a trap composed of 184 places in 395 ms of which 5 ms to minimize.
[2024-06-01 16:07:07] [INFO ] Deduced a trap composed of 227 places in 412 ms of which 6 ms to minimize.
[2024-06-01 16:07:07] [INFO ] Deduced a trap composed of 178 places in 402 ms of which 5 ms to minimize.
[2024-06-01 16:07:07] [INFO ] Deduced a trap composed of 188 places in 415 ms of which 5 ms to minimize.
[2024-06-01 16:07:08] [INFO ] Deduced a trap composed of 189 places in 412 ms of which 6 ms to minimize.
[2024-06-01 16:07:08] [INFO ] Deduced a trap composed of 162 places in 408 ms of which 6 ms to minimize.
[2024-06-01 16:07:09] [INFO ] Deduced a trap composed of 156 places in 396 ms of which 5 ms to minimize.
[2024-06-01 16:07:09] [INFO ] Deduced a trap composed of 157 places in 413 ms of which 5 ms to minimize.
[2024-06-01 16:07:10] [INFO ] Deduced a trap composed of 119 places in 417 ms of which 6 ms to minimize.
[2024-06-01 16:07:10] [INFO ] Deduced a trap composed of 97 places in 417 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/361 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 557 unsolved
[2024-06-01 16:07:14] [INFO ] Deduced a trap composed of 155 places in 431 ms of which 6 ms to minimize.
[2024-06-01 16:07:14] [INFO ] Deduced a trap composed of 125 places in 424 ms of which 6 ms to minimize.
[2024-06-01 16:07:14] [INFO ] Deduced a trap composed of 146 places in 411 ms of which 5 ms to minimize.
[2024-06-01 16:07:15] [INFO ] Deduced a trap composed of 184 places in 403 ms of which 6 ms to minimize.
[2024-06-01 16:07:15] [INFO ] Deduced a trap composed of 85 places in 421 ms of which 5 ms to minimize.
[2024-06-01 16:07:16] [INFO ] Deduced a trap composed of 140 places in 424 ms of which 6 ms to minimize.
[2024-06-01 16:07:16] [INFO ] Deduced a trap composed of 198 places in 422 ms of which 6 ms to minimize.
[2024-06-01 16:07:17] [INFO ] Deduced a trap composed of 214 places in 435 ms of which 5 ms to minimize.
[2024-06-01 16:07:17] [INFO ] Deduced a trap composed of 65 places in 392 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 361/927 variables, and 49 constraints, problems are : Problem set: 0 solved, 557 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/361 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 557/557 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 557 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/361 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/361 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/361 variables, 29/49 constraints. Problems are: Problem set: 0 solved, 557 unsolved
[2024-06-01 16:07:26] [INFO ] Deduced a trap composed of 71 places in 354 ms of which 5 ms to minimize.
[2024-06-01 16:07:27] [INFO ] Deduced a trap composed of 144 places in 431 ms of which 5 ms to minimize.
[2024-06-01 16:07:27] [INFO ] Deduced a trap composed of 123 places in 386 ms of which 5 ms to minimize.
[2024-06-01 16:07:28] [INFO ] Deduced a trap composed of 185 places in 442 ms of which 6 ms to minimize.
[2024-06-01 16:07:28] [INFO ] Deduced a trap composed of 125 places in 422 ms of which 6 ms to minimize.
[2024-06-01 16:07:28] [INFO ] Deduced a trap composed of 87 places in 426 ms of which 6 ms to minimize.
[2024-06-01 16:07:29] [INFO ] Deduced a trap composed of 123 places in 417 ms of which 6 ms to minimize.
[2024-06-01 16:07:29] [INFO ] Deduced a trap composed of 122 places in 418 ms of which 6 ms to minimize.
[2024-06-01 16:07:30] [INFO ] Deduced a trap composed of 103 places in 390 ms of which 6 ms to minimize.
[2024-06-01 16:07:30] [INFO ] Deduced a trap composed of 120 places in 333 ms of which 6 ms to minimize.
[2024-06-01 16:07:31] [INFO ] Deduced a trap composed of 114 places in 420 ms of which 6 ms to minimize.
[2024-06-01 16:07:31] [INFO ] Deduced a trap composed of 183 places in 384 ms of which 6 ms to minimize.
[2024-06-01 16:07:32] [INFO ] Deduced a trap composed of 93 places in 434 ms of which 6 ms to minimize.
[2024-06-01 16:07:32] [INFO ] Deduced a trap composed of 180 places in 401 ms of which 6 ms to minimize.
[2024-06-01 16:07:33] [INFO ] Deduced a trap composed of 158 places in 417 ms of which 5 ms to minimize.
[2024-06-01 16:07:33] [INFO ] Deduced a trap composed of 123 places in 423 ms of which 6 ms to minimize.
[2024-06-01 16:07:33] [INFO ] Deduced a trap composed of 115 places in 413 ms of which 5 ms to minimize.
[2024-06-01 16:07:34] [INFO ] Deduced a trap composed of 111 places in 418 ms of which 6 ms to minimize.
[2024-06-01 16:07:35] [INFO ] Deduced a trap composed of 240 places in 463 ms of which 32 ms to minimize.
[2024-06-01 16:07:35] [INFO ] Deduced a trap composed of 190 places in 412 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 20/69 constraints. Problems are: Problem set: 0 solved, 557 unsolved
[2024-06-01 16:07:40] [INFO ] Deduced a trap composed of 117 places in 416 ms of which 6 ms to minimize.
[2024-06-01 16:07:41] [INFO ] Deduced a trap composed of 91 places in 409 ms of which 6 ms to minimize.
[2024-06-01 16:07:42] [INFO ] Deduced a trap composed of 235 places in 403 ms of which 5 ms to minimize.
[2024-06-01 16:07:43] [INFO ] Deduced a trap composed of 141 places in 413 ms of which 6 ms to minimize.
[2024-06-01 16:07:43] [INFO ] Deduced a trap composed of 124 places in 392 ms of which 5 ms to minimize.
[2024-06-01 16:07:43] [INFO ] Deduced a trap composed of 145 places in 417 ms of which 6 ms to minimize.
[2024-06-01 16:07:44] [INFO ] Deduced a trap composed of 113 places in 421 ms of which 5 ms to minimize.
[2024-06-01 16:07:44] [INFO ] Deduced a trap composed of 151 places in 411 ms of which 5 ms to minimize.
[2024-06-01 16:07:45] [INFO ] Deduced a trap composed of 138 places in 410 ms of which 6 ms to minimize.
[2024-06-01 16:07:45] [INFO ] Deduced a trap composed of 155 places in 413 ms of which 6 ms to minimize.
[2024-06-01 16:07:46] [INFO ] Deduced a trap composed of 112 places in 446 ms of which 6 ms to minimize.
[2024-06-01 16:07:46] [INFO ] Deduced a trap composed of 227 places in 434 ms of which 5 ms to minimize.
[2024-06-01 16:07:47] [INFO ] Deduced a trap composed of 223 places in 418 ms of which 5 ms to minimize.
[2024-06-01 16:07:47] [INFO ] Deduced a trap composed of 135 places in 418 ms of which 6 ms to minimize.
[2024-06-01 16:07:48] [INFO ] Deduced a trap composed of 176 places in 437 ms of which 6 ms to minimize.
[2024-06-01 16:07:48] [INFO ] Deduced a trap composed of 239 places in 355 ms of which 6 ms to minimize.
[2024-06-01 16:07:49] [INFO ] Deduced a trap composed of 240 places in 436 ms of which 6 ms to minimize.
[2024-06-01 16:07:49] [INFO ] Deduced a trap composed of 157 places in 396 ms of which 5 ms to minimize.
[2024-06-01 16:07:50] [INFO ] Deduced a trap composed of 191 places in 434 ms of which 5 ms to minimize.
[2024-06-01 16:07:50] [INFO ] Deduced a trap composed of 154 places in 307 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 20/89 constraints. Problems are: Problem set: 0 solved, 557 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 361/927 variables, and 89 constraints, problems are : Problem set: 0 solved, 557 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/361 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/557 constraints, Known Traps: 69/69 constraints]
After SMT, in 60353ms problems are : Problem set: 0 solved, 557 unsolved
Search for dead transitions found 0 dead transitions in 60360ms
Starting structural reductions in LTL mode, iteration 1 : 361/367 places, 566/604 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63592 ms. Remains : 361/367 places, 566/604 transitions.
Stuttering acceptance computed with spot in 119 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Anderson-PT-09-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Anderson-PT-09-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-09-LTLCardinality-14 finished in 63735 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((G(p0)||F((G(p2)||p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2024-06-01 16:07:52] [INFO ] Flatten gal took : 78 ms
[2024-06-01 16:07:52] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2024-06-01 16:07:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 367 places, 604 transitions and 2102 arcs took 16 ms.
Total runtime 596449 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA Anderson-PT-09-LTLCardinality-09 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : Anderson-PT-09-LTLCardinality-10

BK_STOP 1717258611488

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name Anderson-PT-09-LTLCardinality-09
ltl formula formula --ltl=/tmp/2969/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 367 places, 604 transitions and 2102 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.100 real 0.030 user 0.040 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2969/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2969/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2969/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2969/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 368 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 368, there are 637 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~75 levels ~10000 states ~21236 transitions
pnml2lts-mc( 2/ 4): ~75 levels ~20000 states ~45864 transitions
pnml2lts-mc( 2/ 4): ~75 levels ~40000 states ~92600 transitions
pnml2lts-mc( 2/ 4): ~75 levels ~80000 states ~176356 transitions
pnml2lts-mc( 2/ 4): ~75 levels ~160000 states ~368784 transitions
pnml2lts-mc( 2/ 4): ~75 levels ~320000 states ~741316 transitions
pnml2lts-mc( 2/ 4): ~75 levels ~640000 states ~1470240 transitions
pnml2lts-mc( 2/ 4): ~75 levels ~1280000 states ~3283628 transitions
pnml2lts-mc( 1/ 4): ~6285 levels ~2560000 states ~6281384 transitions
pnml2lts-mc( 1/ 4): ~6285 levels ~5120000 states ~12609176 transitions
pnml2lts-mc( 2/ 4): ~75 levels ~10240000 states ~27331212 transitions
pnml2lts-mc( 2/ 4): ~75 levels ~20480000 states ~58242944 transitions
pnml2lts-mc( 2/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33443336
pnml2lts-mc( 0/ 4): unique states count: 33507685
pnml2lts-mc( 0/ 4): unique transitions count: 93794893
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 60157789
pnml2lts-mc( 0/ 4): - claim found count: 70531
pnml2lts-mc( 0/ 4): - claim success count: 33508634
pnml2lts-mc( 0/ 4): - cum. max stack depth: 54660
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33508634 states 93800197 transitions, fanout: 2.799
pnml2lts-mc( 0/ 4): Total exploration time 418.760 sec (418.730 sec minimum, 418.745 sec on average)
pnml2lts-mc( 0/ 4): States per second: 80019, Transitions per second: 223995
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 313.2MB, 9.8 B/state, compr.: 0.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/89.0%
pnml2lts-mc( 0/ 4): Stored 616 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 313.2MB (~256.0MB paged-in)
ltl formula name Anderson-PT-09-LTLCardinality-10
ltl formula formula --ltl=/tmp/2969/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 367 places, 604 transitions and 2102 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.090 real 0.030 user 0.020 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2969/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2969/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2969/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2969/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 369 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 368, there are 609 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~2166 levels ~10000 states ~24880 transitions
pnml2lts-mc( 0/ 4): ~4112 levels ~20000 states ~51284 transitions
pnml2lts-mc( 2/ 4): ~8191 levels ~40000 states ~108828 transitions
pnml2lts-mc( 2/ 4): ~15499 levels ~80000 states ~238452 transitions
pnml2lts-mc( 0/ 4): ~34046 levels ~160000 states ~434988 transitions
pnml2lts-mc( 0/ 4): ~68045 levels ~320000 states ~887384 transitions
pnml2lts-mc( 0/ 4): ~135373 levels ~640000 states ~1773624 transitions
pnml2lts-mc( 0/ 4): ~267603 levels ~1280000 states ~3597684 transitions
pnml2lts-mc( 0/ 4): ~532159 levels ~2560000 states ~7242012 transitions
pnml2lts-mc( 0/ 4): ~1058651 levels ~5120000 states ~14716432 transitions
pnml2lts-mc( 1/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 37825
pnml2lts-mc( 0/ 4): unique states count: 8141304
pnml2lts-mc( 0/ 4): unique transitions count: 24218204
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 41920
pnml2lts-mc( 0/ 4): - claim found count: 10415079
pnml2lts-mc( 0/ 4): - claim success count: 8141313
pnml2lts-mc( 0/ 4): - cum. max stack depth: 6587021
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 8141323 states 24218266 transitions, fanout: 2.975
pnml2lts-mc( 0/ 4): Total exploration time 118.740 sec (118.720 sec minimum, 118.725 sec on average)
pnml2lts-mc( 0/ 4): States per second: 68564, Transitions per second: 203960
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 159.9MB, 13.3 B/state, compr.: 0.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 37.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 616 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 159.9MB (~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-09"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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