About the Execution of ITS-Tools for SieveSingleMsgMbox-PT-d2m96
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
1811.695 | 856723.00 | 1110538.00 | 2317.90 | FTFTTFFTTFFTFFFF | normal |
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.r378-smll-171683810800140.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 itstools
Input is SieveSingleMsgMbox-PT-d2m96, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r378-smll-171683810800140
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 16:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 19:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Apr 12 19:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Apr 12 19:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 12 19:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.1M May 18 16:43 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 SieveSingleMsgMbox-PT-d2m96-LTLFireability-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLFireability-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLFireability-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLFireability-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLFireability-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLFireability-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLFireability-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLFireability-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLFireability-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLFireability-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLFireability-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLFireability-11
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLFireability-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLFireability-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLFireability-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716953284652
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d2m96
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-29 03:28:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 03:28:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 03:28:08] [INFO ] Load time of PNML (sax parser for PT used): 514 ms
[2024-05-29 03:28:08] [INFO ] Transformed 2398 places.
[2024-05-29 03:28:08] [INFO ] Transformed 1954 transitions.
[2024-05-29 03:28:08] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 772 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 1984 places in 36 ms
Reduce places removed 1984 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 414 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 414/414 places, 1954/1954 transitions.
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 828 transitions
Reduce isomorphic transitions removed 828 transitions.
Iterating post reduction 0 with 853 rules applied. Total rules applied 853 place count 389 transition count 1126
Discarding 97 places :
Symmetric choice reduction at 1 with 97 rule applications. Total rules 950 place count 292 transition count 705
Iterating global reduction 1 with 97 rules applied. Total rules applied 1047 place count 292 transition count 705
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 1057 place count 292 transition count 695
Discarding 69 places :
Symmetric choice reduction at 2 with 69 rule applications. Total rules 1126 place count 223 transition count 626
Iterating global reduction 2 with 69 rules applied. Total rules applied 1195 place count 223 transition count 626
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 1223 place count 223 transition count 598
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 1249 place count 197 transition count 567
Iterating global reduction 3 with 26 rules applied. Total rules applied 1275 place count 197 transition count 567
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Iterating post reduction 3 with 52 rules applied. Total rules applied 1327 place count 197 transition count 515
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1332 place count 192 transition count 507
Iterating global reduction 4 with 5 rules applied. Total rules applied 1337 place count 192 transition count 507
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1342 place count 187 transition count 502
Iterating global reduction 4 with 5 rules applied. Total rules applied 1347 place count 187 transition count 502
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1349 place count 185 transition count 499
Iterating global reduction 4 with 2 rules applied. Total rules applied 1351 place count 185 transition count 499
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1353 place count 183 transition count 497
Iterating global reduction 4 with 2 rules applied. Total rules applied 1355 place count 183 transition count 497
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1357 place count 181 transition count 495
Iterating global reduction 4 with 2 rules applied. Total rules applied 1359 place count 181 transition count 495
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1360 place count 180 transition count 494
Iterating global reduction 4 with 1 rules applied. Total rules applied 1361 place count 180 transition count 494
Applied a total of 1361 rules in 200 ms. Remains 180 /414 variables (removed 234) and now considering 494/1954 (removed 1460) transitions.
// Phase 1: matrix 494 rows 180 cols
[2024-05-29 03:28:08] [INFO ] Computed 5 invariants in 31 ms
[2024-05-29 03:28:09] [INFO ] Implicit Places using invariants in 547 ms returned []
[2024-05-29 03:28:09] [INFO ] Invariant cache hit.
[2024-05-29 03:28:09] [INFO ] State equation strengthened by 354 read => feed constraints.
[2024-05-29 03:28:10] [INFO ] Implicit Places using invariants and state equation in 1328 ms returned []
Implicit Place search using SMT with State Equation took 1929 ms to find 0 implicit places.
Running 493 sub problems to find dead transitions.
[2024-05-29 03:28:10] [INFO ] Invariant cache hit.
[2024-05-29 03:28:10] [INFO ] State equation strengthened by 354 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 3 (OVERLAPS) 1/180 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 493 unsolved
[2024-05-29 03:28:23] [INFO ] Deduced a trap composed of 60 places in 177 ms of which 36 ms to minimize.
[2024-05-29 03:28:24] [INFO ] Deduced a trap composed of 60 places in 123 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 6 (OVERLAPS) 494/674 variables, 180/187 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/674 variables, 354/541 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/674 variables, 0/541 constraints. Problems are: Problem set: 0 solved, 493 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 674/674 variables, and 541 constraints, problems are : Problem set: 0 solved, 493 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 180/180 constraints, ReadFeed: 354/354 constraints, PredecessorRefiner: 493/493 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 493 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 3 (OVERLAPS) 1/180 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 6 (OVERLAPS) 494/674 variables, 180/187 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/674 variables, 354/541 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/674 variables, 493/1034 constraints. Problems are: Problem set: 0 solved, 493 unsolved
[2024-05-29 03:29:06] [INFO ] Deduced a trap composed of 52 places in 49 ms of which 2 ms to minimize.
[2024-05-29 03:29:06] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 2 ms to minimize.
Problem TDEAD57 is UNSAT
[2024-05-29 03:29:08] [INFO ] Deduced a trap composed of 57 places in 86 ms of which 3 ms to minimize.
Problem TDEAD61 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 674/674 variables, and 1037 constraints, problems are : Problem set: 2 solved, 491 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 180/180 constraints, ReadFeed: 354/354 constraints, PredecessorRefiner: 493/493 constraints, Known Traps: 5/5 constraints]
After SMT, in 62182ms problems are : Problem set: 2 solved, 491 unsolved
Search for dead transitions found 2 dead transitions in 62231ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in LTL mode, iteration 1 : 180/414 places, 492/1954 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 178 transition count 492
Applied a total of 2 rules in 9 ms. Remains 178 /180 variables (removed 2) and now considering 492/492 (removed 0) transitions.
// Phase 1: matrix 492 rows 178 cols
[2024-05-29 03:29:12] [INFO ] Computed 4 invariants in 6 ms
[2024-05-29 03:29:13] [INFO ] Implicit Places using invariants in 231 ms returned []
[2024-05-29 03:29:13] [INFO ] Invariant cache hit.
[2024-05-29 03:29:13] [INFO ] State equation strengthened by 353 read => feed constraints.
[2024-05-29 03:29:14] [INFO ] Implicit Places using invariants and state equation in 998 ms returned []
Implicit Place search using SMT with State Equation took 1232 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 178/414 places, 492/1954 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 65642 ms. Remains : 178/414 places, 492/1954 transitions.
Support contains 28 out of 178 places after structural reductions.
[2024-05-29 03:29:14] [INFO ] Flatten gal took : 136 ms
[2024-05-29 03:29:14] [INFO ] Flatten gal took : 77 ms
[2024-05-29 03:29:14] [INFO ] Input system was already deterministic with 492 transitions.
RANDOM walk for 40000 steps (8937 resets) in 3222 ms. (12 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (176 resets) in 47 ms. (83 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (192 resets) in 39 ms. (100 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (181 resets) in 29 ms. (133 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (188 resets) in 47 ms. (83 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (189 resets) in 47 ms. (83 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (401 resets) in 79 ms. (50 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (179 resets) in 23 ms. (166 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (182 resets) in 20 ms. (190 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (190 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (180 resets) in 18 ms. (210 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (201 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (183 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (417 resets) in 25 ms. (153 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (195 resets) in 23 ms. (166 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (191 resets) in 18 ms. (210 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (414 resets) in 32 ms. (121 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (197 resets) in 18 ms. (210 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (203 resets) in 23 ms. (166 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (415 resets) in 21 ms. (181 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (176 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (195 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (182 resets) in 24 ms. (160 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (195 resets) in 19 ms. (200 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (418 resets) in 23 ms. (166 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (201 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (186 resets) in 18 ms. (210 steps per ms) remains 26/26 properties
Interrupted probabilistic random walk after 189488 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :10 out of 26
Probabilistic random walk after 189488 steps, saw 89978 distinct states, run finished after 3018 ms. (steps per millisecond=62 ) properties seen :10
[2024-05-29 03:29:19] [INFO ] Invariant cache hit.
[2024-05-29 03:29:19] [INFO ] State equation strengthened by 353 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 78/97 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 4/101 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Problem AtomicPropp24 is UNSAT
At refinement iteration 5 (OVERLAPS) 37/138 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 15 unsolved
[2024-05-29 03:29:19] [INFO ] Deduced a trap composed of 58 places in 102 ms of which 3 ms to minimize.
[2024-05-29 03:29:19] [INFO ] Deduced a trap composed of 59 places in 88 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 2/6 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 363/501 variables, 138/144 constraints. Problems are: Problem set: 1 solved, 15 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/501 variables, 224/368 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/501 variables, 0/368 constraints. Problems are: Problem set: 1 solved, 15 unsolved
Problem AtomicPropp25 is UNSAT
At refinement iteration 11 (OVERLAPS) 169/670 variables, 40/408 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/670 variables, 129/537 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/670 variables, 0/537 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 14 (OVERLAPS) 0/670 variables, 0/537 constraints. Problems are: Problem set: 2 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 670/670 variables, and 537 constraints, problems are : Problem set: 2 solved, 14 unsolved in 2137 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 178/178 constraints, ReadFeed: 353/353 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 2 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 78/94 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 4/98 variables, 1/3 constraints. Problems are: Problem set: 2 solved, 14 unsolved
[2024-05-29 03:29:21] [INFO ] Deduced a trap composed of 53 places in 44 ms of which 1 ms to minimize.
[2024-05-29 03:29:21] [INFO ] Deduced a trap composed of 49 places in 53 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 2/5 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 37/135 variables, 1/6 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 2/8 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 0/8 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 318/453 variables, 135/143 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/453 variables, 179/322 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/453 variables, 2/324 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/453 variables, 0/324 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 13 (OVERLAPS) 217/670 variables, 43/367 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/670 variables, 174/541 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/670 variables, 12/553 constraints. Problems are: Problem set: 2 solved, 14 unsolved
[2024-05-29 03:29:24] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/670 variables, 1/554 constraints. Problems are: Problem set: 2 solved, 14 unsolved
[2024-05-29 03:29:25] [INFO ] Deduced a trap composed of 52 places in 59 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/670 variables, 1/555 constraints. Problems are: Problem set: 2 solved, 14 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 670/670 variables, and 555 constraints, problems are : Problem set: 2 solved, 14 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 178/178 constraints, ReadFeed: 353/353 constraints, PredecessorRefiner: 14/16 constraints, Known Traps: 6/6 constraints]
After SMT, in 7259ms problems are : Problem set: 2 solved, 14 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 16 out of 178 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 178/178 places, 492/492 transitions.
Graph (complete) has 770 edges and 178 vertex of which 177 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 177 transition count 490
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 13 place count 167 transition count 340
Iterating global reduction 1 with 10 rules applied. Total rules applied 23 place count 167 transition count 340
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 33 place count 157 transition count 330
Iterating global reduction 1 with 10 rules applied. Total rules applied 43 place count 157 transition count 330
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 48 place count 157 transition count 325
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 52 place count 153 transition count 317
Iterating global reduction 2 with 4 rules applied. Total rules applied 56 place count 153 transition count 317
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 58 place count 153 transition count 315
Applied a total of 58 rules in 136 ms. Remains 153 /178 variables (removed 25) and now considering 315/492 (removed 177) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 136 ms. Remains : 153/178 places, 315/492 transitions.
RANDOM walk for 40000 steps (9056 resets) in 835 ms. (47 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (1875 resets) in 230 ms. (173 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (1843 resets) in 224 ms. (177 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (4135 resets) in 305 ms. (130 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (1916 resets) in 240 ms. (165 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (1941 resets) in 213 ms. (186 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (1910 resets) in 220 ms. (181 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (4178 resets) in 229 ms. (173 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (1896 resets) in 228 ms. (174 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (4191 resets) in 316 ms. (126 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (1918 resets) in 195 ms. (204 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (1883 resets) in 95 ms. (416 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (1854 resets) in 79 ms. (500 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (1921 resets) in 79 ms. (500 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (4108 resets) in 109 ms. (363 steps per ms) remains 14/14 properties
Interrupted probabilistic random walk after 252611 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :2 out of 14
Probabilistic random walk after 252611 steps, saw 110726 distinct states, run finished after 3001 ms. (steps per millisecond=84 ) properties seen :2
// Phase 1: matrix 315 rows 153 cols
[2024-05-29 03:29:30] [INFO ] Computed 3 invariants in 6 ms
[2024-05-29 03:29:30] [INFO ] State equation strengthened by 199 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 74/88 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 4/92 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 263/355 variables, 92/95 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 147/242 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 113/468 variables, 61/303 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/468 variables, 52/355 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/468 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 0/468 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 468/468 variables, and 355 constraints, problems are : Problem set: 0 solved, 12 unsolved in 1034 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 153/153 constraints, ReadFeed: 199/199 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 74/88 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 4/92 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-29 03:29:32] [INFO ] Deduced a trap composed of 50 places in 35 ms of which 2 ms to minimize.
[2024-05-29 03:29:32] [INFO ] Deduced a trap composed of 51 places in 37 ms of which 1 ms to minimize.
[2024-05-29 03:29:32] [INFO ] Deduced a trap composed of 46 places in 35 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 263/355 variables, 92/98 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 147/245 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 113/468 variables, 61/306 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/468 variables, 52/358 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/468 variables, 12/370 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-29 03:29:34] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/468 variables, 1/371 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/468 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (OVERLAPS) 0/468 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 468/468 variables, and 371 constraints, problems are : Problem set: 0 solved, 12 unsolved in 4318 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 153/153 constraints, ReadFeed: 199/199 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 4/4 constraints]
After SMT, in 5414ms problems are : Problem set: 0 solved, 12 unsolved
Parikh walk visited 0 properties in 33028 ms.
Support contains 14 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 315/315 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 151 transition count 285
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 151 transition count 285
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 149 transition count 283
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 149 transition count 283
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 149 transition count 282
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 147 transition count 278
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 147 transition count 278
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 14 place count 147 transition count 277
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 146 transition count 276
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 146 transition count 276
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 145 transition count 275
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 145 transition count 275
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 144 transition count 274
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 144 transition count 274
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 28 place count 144 transition count 266
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 29 place count 143 transition count 265
Iterating global reduction 3 with 1 rules applied. Total rules applied 30 place count 143 transition count 265
Applied a total of 30 rules in 57 ms. Remains 143 /153 variables (removed 10) and now considering 265/315 (removed 50) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 143/153 places, 265/315 transitions.
RANDOM walk for 40000 steps (9046 resets) in 305 ms. (130 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (1938 resets) in 107 ms. (370 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (1939 resets) in 109 ms. (363 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (4055 resets) in 150 ms. (264 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (1922 resets) in 140 ms. (283 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (1878 resets) in 113 ms. (350 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (4138 resets) in 230 ms. (173 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (1942 resets) in 114 ms. (347 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (4134 resets) in 95 ms. (416 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (1844 resets) in 69 ms. (571 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (1825 resets) in 67 ms. (588 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (1859 resets) in 68 ms. (579 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (4109 resets) in 94 ms. (421 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 224867 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :0 out of 12
Probabilistic random walk after 224867 steps, saw 97400 distinct states, run finished after 3001 ms. (steps per millisecond=74 ) properties seen :0
// Phase 1: matrix 265 rows 143 cols
[2024-05-29 03:30:13] [INFO ] Computed 3 invariants in 2 ms
[2024-05-29 03:30:13] [INFO ] State equation strengthened by 158 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 71/85 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 4/89 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 245/334 variables, 89/92 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/334 variables, 138/230 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/334 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 74/408 variables, 54/284 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/408 variables, 20/304 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/408 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 0/408 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 304 constraints, problems are : Problem set: 0 solved, 12 unsolved in 971 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 158/158 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 71/85 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 4/89 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 245/334 variables, 89/92 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/334 variables, 138/230 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/334 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 74/408 variables, 54/284 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/408 variables, 20/304 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/408 variables, 12/316 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-29 03:30:15] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/408 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/408 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (OVERLAPS) 0/408 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 317 constraints, problems are : Problem set: 0 solved, 12 unsolved in 4621 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 158/158 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 1/1 constraints]
After SMT, in 5625ms problems are : Problem set: 0 solved, 12 unsolved
Parikh walk visited 0 properties in 33400 ms.
Support contains 14 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 265/265 transitions.
Applied a total of 0 rules in 18 ms. Remains 143 /143 variables (removed 0) and now considering 265/265 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 143/143 places, 265/265 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 265/265 transitions.
Applied a total of 0 rules in 23 ms. Remains 143 /143 variables (removed 0) and now considering 265/265 (removed 0) transitions.
[2024-05-29 03:30:52] [INFO ] Invariant cache hit.
[2024-05-29 03:30:52] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-05-29 03:30:52] [INFO ] Invariant cache hit.
[2024-05-29 03:30:52] [INFO ] State equation strengthened by 158 read => feed constraints.
[2024-05-29 03:30:52] [INFO ] Implicit Places using invariants and state equation in 782 ms returned []
Implicit Place search using SMT with State Equation took 919 ms to find 0 implicit places.
[2024-05-29 03:30:53] [INFO ] Redundant transitions in 26 ms returned []
Running 264 sub problems to find dead transitions.
[2024-05-29 03:30:53] [INFO ] Invariant cache hit.
[2024-05-29 03:30:53] [INFO ] State equation strengthened by 158 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (OVERLAPS) 1/143 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 264 unsolved
Problem TDEAD54 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD241 is UNSAT
At refinement iteration 4 (OVERLAPS) 265/408 variables, 143/146 constraints. Problems are: Problem set: 3 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/408 variables, 158/304 constraints. Problems are: Problem set: 3 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 0/304 constraints. Problems are: Problem set: 3 solved, 261 unsolved
At refinement iteration 7 (OVERLAPS) 0/408 variables, 0/304 constraints. Problems are: Problem set: 3 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 304 constraints, problems are : Problem set: 3 solved, 261 unsolved in 17538 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 158/158 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 261 unsolved
At refinement iteration 2 (OVERLAPS) 1/140 variables, 2/3 constraints. Problems are: Problem set: 3 solved, 261 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 261 unsolved
At refinement iteration 4 (OVERLAPS) 264/404 variables, 140/143 constraints. Problems are: Problem set: 3 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/404 variables, 157/300 constraints. Problems are: Problem set: 3 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/404 variables, 23/323 constraints. Problems are: Problem set: 3 solved, 261 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/404 variables, 0/323 constraints. Problems are: Problem set: 3 solved, 261 unsolved
At refinement iteration 8 (OVERLAPS) 4/408 variables, 3/326 constraints. Problems are: Problem set: 3 solved, 261 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/408 variables, 1/327 constraints. Problems are: Problem set: 3 solved, 261 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/408 variables, 238/565 constraints. Problems are: Problem set: 3 solved, 261 unsolved
[2024-05-29 03:31:34] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 1 ms to minimize.
[2024-05-29 03:31:35] [INFO ] Deduced a trap composed of 51 places in 40 ms of which 1 ms to minimize.
Problem TDEAD244 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/408 variables, 2/567 constraints. Problems are: Problem set: 4 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 408/408 variables, and 567 constraints, problems are : Problem set: 4 solved, 260 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 158/158 constraints, PredecessorRefiner: 261/264 constraints, Known Traps: 2/2 constraints]
After SMT, in 48398ms problems are : Problem set: 4 solved, 260 unsolved
Search for dead transitions found 4 dead transitions in 48404ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 143/143 places, 261/265 transitions.
Graph (complete) has 494 edges and 143 vertex of which 139 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 24 ms. Remains 139 /143 variables (removed 4) and now considering 261/261 (removed 0) transitions.
// Phase 1: matrix 261 rows 139 cols
[2024-05-29 03:31:41] [INFO ] Computed 3 invariants in 2 ms
[2024-05-29 03:31:41] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-05-29 03:31:41] [INFO ] Invariant cache hit.
[2024-05-29 03:31:41] [INFO ] State equation strengthened by 157 read => feed constraints.
[2024-05-29 03:31:42] [INFO ] Implicit Places using invariants and state equation in 738 ms returned []
Implicit Place search using SMT with State Equation took 909 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 139/143 places, 261/265 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 50319 ms. Remains : 139/143 places, 261/265 transitions.
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 33 stabilizing places and 60 stable transitions
Graph (complete) has 832 edges and 178 vertex of which 177 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.12 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(F(p0)) U !p1)))'
Support contains 3 out of 178 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 178/178 places, 492/492 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 156 transition count 231
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 156 transition count 231
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 66 place count 134 transition count 209
Iterating global reduction 0 with 22 rules applied. Total rules applied 88 place count 134 transition count 209
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 104 place count 134 transition count 193
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 115 place count 123 transition count 172
Iterating global reduction 1 with 11 rules applied. Total rules applied 126 place count 123 transition count 172
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 132 place count 123 transition count 166
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 136 place count 119 transition count 162
Iterating global reduction 2 with 4 rules applied. Total rules applied 140 place count 119 transition count 162
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 144 place count 115 transition count 158
Iterating global reduction 2 with 4 rules applied. Total rules applied 148 place count 115 transition count 158
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 151 place count 112 transition count 155
Iterating global reduction 2 with 3 rules applied. Total rules applied 154 place count 112 transition count 155
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 157 place count 112 transition count 152
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 160 place count 109 transition count 149
Iterating global reduction 3 with 3 rules applied. Total rules applied 163 place count 109 transition count 149
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 164 place count 108 transition count 146
Iterating global reduction 3 with 1 rules applied. Total rules applied 165 place count 108 transition count 146
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 166 place count 107 transition count 145
Iterating global reduction 3 with 1 rules applied. Total rules applied 167 place count 107 transition count 145
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 168 place count 106 transition count 144
Iterating global reduction 3 with 1 rules applied. Total rules applied 169 place count 106 transition count 144
Applied a total of 169 rules in 52 ms. Remains 106 /178 variables (removed 72) and now considering 144/492 (removed 348) transitions.
// Phase 1: matrix 144 rows 106 cols
[2024-05-29 03:31:42] [INFO ] Computed 4 invariants in 1 ms
[2024-05-29 03:31:42] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-29 03:31:42] [INFO ] Invariant cache hit.
[2024-05-29 03:31:42] [INFO ] State equation strengthened by 69 read => feed constraints.
[2024-05-29 03:31:43] [INFO ] Implicit Places using invariants and state equation in 298 ms returned []
Implicit Place search using SMT with State Equation took 399 ms to find 0 implicit places.
[2024-05-29 03:31:43] [INFO ] Redundant transitions in 3 ms returned []
Running 143 sub problems to find dead transitions.
[2024-05-29 03:31:43] [INFO ] Invariant cache hit.
[2024-05-29 03:31:43] [INFO ] State equation strengthened by 69 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (OVERLAPS) 1/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 143 unsolved
[2024-05-29 03:31:45] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 143 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD128 is UNSAT
At refinement iteration 6 (OVERLAPS) 144/250 variables, 106/111 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/250 variables, 69/180 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 0/180 constraints. Problems are: Problem set: 3 solved, 140 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/250 variables, 0/180 constraints. Problems are: Problem set: 3 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Real declared 250/250 variables, and 180 constraints, problems are : Problem set: 3 solved, 140 unsolved in 8467 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 106/106 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 3 solved, 140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 5 (OVERLAPS) 1/104 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 8 (OVERLAPS) 143/247 variables, 104/109 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/247 variables, 68/177 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/247 variables, 27/204 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/247 variables, 0/204 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 12 (OVERLAPS) 3/250 variables, 2/206 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/250 variables, 1/207 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/250 variables, 113/320 constraints. Problems are: Problem set: 3 solved, 140 unsolved
[2024-05-29 03:31:58] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 2 ms to minimize.
Problem TDEAD131 is UNSAT
At refinement iteration 15 (INCLUDED_ONLY) 0/250 variables, 1/321 constraints. Problems are: Problem set: 4 solved, 139 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/250 variables, 0/321 constraints. Problems are: Problem set: 4 solved, 139 unsolved
At refinement iteration 17 (OVERLAPS) 0/250 variables, 0/321 constraints. Problems are: Problem set: 4 solved, 139 unsolved
No progress, stopping.
After SMT solving in domain Int declared 250/250 variables, and 321 constraints, problems are : Problem set: 4 solved, 139 unsolved in 16485 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 106/106 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 140/143 constraints, Known Traps: 2/2 constraints]
After SMT, in 25116ms problems are : Problem set: 4 solved, 139 unsolved
Search for dead transitions found 4 dead transitions in 25118ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 106/178 places, 140/492 transitions.
Graph (complete) has 349 edges and 106 vertex of which 102 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 102 /106 variables (removed 4) and now considering 140/140 (removed 0) transitions.
// Phase 1: matrix 140 rows 102 cols
[2024-05-29 03:32:08] [INFO ] Computed 4 invariants in 1 ms
[2024-05-29 03:32:08] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-29 03:32:08] [INFO ] Invariant cache hit.
[2024-05-29 03:32:08] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-29 03:32:08] [INFO ] Implicit Places using invariants and state equation in 429 ms returned []
Implicit Place search using SMT with State Equation took 521 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 102/178 places, 140/492 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 26107 ms. Remains : 102/178 places, 140/492 transitions.
Stuttering acceptance computed with spot in 448 ms :[p1, (NOT p0), (NOT p0), p1]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLFireability-00
Product exploration explored 100000 steps with 22287 reset in 671 ms.
Product exploration explored 100000 steps with 22499 reset in 338 ms.
Computed a total of 17 stabilizing places and 23 stable transitions
Graph (complete) has 345 edges and 102 vertex of which 101 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 17 stabilizing places and 23 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 116 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 194 ms :[p1, (NOT p0), (NOT p0), p1]
RANDOM walk for 40000 steps (8988 resets) in 633 ms. (63 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1894 resets) in 478 ms. (83 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1900 resets) in 255 ms. (156 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1894 resets) in 254 ms. (156 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 1978737 steps, run timeout after 3001 ms. (steps per millisecond=659 ) properties seen :2 out of 3
Probabilistic random walk after 1978737 steps, saw 842063 distinct states, run finished after 3001 ms. (steps per millisecond=659 ) properties seen :2
[2024-05-29 03:32:14] [INFO ] Invariant cache hit.
[2024-05-29 03:32:14] [INFO ] State equation strengthened by 68 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) 58/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/71 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/75 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 111/186 variables, 75/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 39/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 56/242 variables, 27/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/242 variables, 29/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/242 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/242 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 174 constraints, problems are : Problem set: 0 solved, 1 unsolved in 194 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 58/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/71 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/75 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 111/186 variables, 75/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 39/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 56/242 variables, 27/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/242 variables, 29/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/242 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/242 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/242 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 242/242 variables, and 175 constraints, problems are : Problem set: 0 solved, 1 unsolved in 416 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 622ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 52 ms.
Support contains 2 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 140/140 transitions.
Graph (complete) has 310 edges and 102 vertex of which 101 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 101 transition count 138
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 100 transition count 126
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 100 transition count 126
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 99 transition count 125
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 99 transition count 125
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 99 transition count 124
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 98 transition count 122
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 98 transition count 122
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 98 transition count 121
Applied a total of 11 rules in 25 ms. Remains 98 /102 variables (removed 4) and now considering 121/140 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 98/102 places, 121/140 transitions.
RANDOM walk for 40000 steps (8978 resets) in 163 ms. (243 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (1862 resets) in 85 ms. (465 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2163885 steps, run timeout after 3001 ms. (steps per millisecond=721 ) properties seen :0 out of 1
Probabilistic random walk after 2163885 steps, saw 959302 distinct states, run finished after 3001 ms. (steps per millisecond=721 ) properties seen :0
// Phase 1: matrix 121 rows 98 cols
[2024-05-29 03:32:17] [INFO ] Computed 3 invariants in 2 ms
[2024-05-29 03:32:17] [INFO ] State equation strengthened by 53 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) 80/82 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 131/213 variables, 90/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 41/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/219 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 6/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 154 constraints, problems are : Problem set: 0 solved, 1 unsolved in 121 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 80/82 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 131/213 variables, 90/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 41/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/219 variables, 2/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/219 variables, 6/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/219 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/219 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 155 constraints, problems are : Problem set: 0 solved, 1 unsolved in 276 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 408ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 510 ms.
Support contains 2 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 121/121 transitions.
Applied a total of 0 rules in 5 ms. Remains 98 /98 variables (removed 0) and now considering 121/121 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 98/98 places, 121/121 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 121/121 transitions.
Applied a total of 0 rules in 4 ms. Remains 98 /98 variables (removed 0) and now considering 121/121 (removed 0) transitions.
[2024-05-29 03:32:18] [INFO ] Invariant cache hit.
[2024-05-29 03:32:18] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-29 03:32:18] [INFO ] Invariant cache hit.
[2024-05-29 03:32:19] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-05-29 03:32:19] [INFO ] Implicit Places using invariants and state equation in 321 ms returned []
Implicit Place search using SMT with State Equation took 424 ms to find 0 implicit places.
[2024-05-29 03:32:19] [INFO ] Redundant transitions in 5 ms returned []
Running 120 sub problems to find dead transitions.
[2024-05-29 03:32:19] [INFO ] Invariant cache hit.
[2024-05-29 03:32:19] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 121/219 variables, 98/101 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 53/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 154 constraints, problems are : Problem set: 0 solved, 120 unsolved in 5736 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 121/219 variables, 98/101 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 53/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 120/274 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (OVERLAPS) 0/219 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 274 constraints, problems are : Problem set: 0 solved, 120 unsolved in 9552 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
After SMT, in 15457ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 15459ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15899 ms. Remains : 98/98 places, 121/121 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 98 transition count 114
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 92 transition count 114
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 13 place count 92 transition count 99
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 43 place count 77 transition count 99
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 55 place count 71 transition count 93
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 70 transition count 102
Applied a total of 57 rules in 24 ms. Remains 70 /98 variables (removed 28) and now considering 102/121 (removed 19) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 102 rows 70 cols
[2024-05-29 03:32:34] [INFO ] Computed 3 invariants in 1 ms
[2024-05-29 03:32:34] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-29 03:32:34] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 03:32:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-29 03:32:34] [INFO ] After 57ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-29 03:32:34] [INFO ] After 76ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-29 03:32:34] [INFO ] After 125ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 264 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F p1)]
Knowledge based reduction with 7 factoid took 160 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 146 ms :[p1, (NOT p0), (NOT p0), p1]
Stuttering acceptance computed with spot in 208 ms :[p1, (NOT p0), (NOT p0), p1]
Support contains 3 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 140/140 transitions.
Applied a total of 0 rules in 9 ms. Remains 102 /102 variables (removed 0) and now considering 140/140 (removed 0) transitions.
// Phase 1: matrix 140 rows 102 cols
[2024-05-29 03:32:35] [INFO ] Computed 4 invariants in 2 ms
[2024-05-29 03:32:35] [INFO ] Implicit Places using invariants in 173 ms returned []
[2024-05-29 03:32:35] [INFO ] Invariant cache hit.
[2024-05-29 03:32:35] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-29 03:32:36] [INFO ] Implicit Places using invariants and state equation in 473 ms returned []
Implicit Place search using SMT with State Equation took 649 ms to find 0 implicit places.
[2024-05-29 03:32:36] [INFO ] Redundant transitions in 1 ms returned []
Running 139 sub problems to find dead transitions.
[2024-05-29 03:32:36] [INFO ] Invariant cache hit.
[2024-05-29 03:32:36] [INFO ] State equation strengthened by 68 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 5 (OVERLAPS) 140/242 variables, 102/106 constraints. Problems are: Problem set: 0 solved, 139 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 68/174 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 8 (OVERLAPS) 0/242 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 139 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 174 constraints, problems are : Problem set: 0 solved, 139 unsolved in 7088 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 139/139 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 139 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 5 (OVERLAPS) 140/242 variables, 102/106 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 68/174 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 139/313 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 9 (OVERLAPS) 0/242 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 139 unsolved
No progress, stopping.
After SMT solving in domain Int declared 242/242 variables, and 313 constraints, problems are : Problem set: 0 solved, 139 unsolved in 11113 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 139/139 constraints, Known Traps: 0/0 constraints]
After SMT, in 18499ms problems are : Problem set: 0 solved, 139 unsolved
Search for dead transitions found 0 dead transitions in 18502ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 19168 ms. Remains : 102/102 places, 140/140 transitions.
Computed a total of 17 stabilizing places and 23 stable transitions
Graph (complete) has 345 edges and 102 vertex of which 101 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 17 stabilizing places and 23 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 102 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 162 ms :[p1, (NOT p0), (NOT p0), p1]
RANDOM walk for 40000 steps (9031 resets) in 481 ms. (82 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1873 resets) in 236 ms. (168 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1882 resets) in 76 ms. (519 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1917 resets) in 111 ms. (357 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 1756865 steps, run timeout after 3001 ms. (steps per millisecond=585 ) properties seen :2 out of 3
Probabilistic random walk after 1756865 steps, saw 748086 distinct states, run finished after 3001 ms. (steps per millisecond=585 ) properties seen :2
[2024-05-29 03:32:58] [INFO ] Invariant cache hit.
[2024-05-29 03:32:58] [INFO ] State equation strengthened by 68 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) 58/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/71 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/75 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 111/186 variables, 75/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 39/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 56/242 variables, 27/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/242 variables, 29/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/242 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/242 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 174 constraints, problems are : Problem set: 0 solved, 1 unsolved in 146 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 58/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/71 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/75 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 111/186 variables, 75/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 39/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 56/242 variables, 27/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/242 variables, 29/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/242 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/242 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/242 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 242/242 variables, and 175 constraints, problems are : Problem set: 0 solved, 1 unsolved in 265 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 420ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 32 ms.
Support contains 2 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 140/140 transitions.
Graph (complete) has 310 edges and 102 vertex of which 101 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 101 transition count 138
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 100 transition count 126
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 100 transition count 126
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 99 transition count 125
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 99 transition count 125
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 99 transition count 124
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 98 transition count 122
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 98 transition count 122
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 98 transition count 121
Applied a total of 11 rules in 41 ms. Remains 98 /102 variables (removed 4) and now considering 121/140 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 98/102 places, 121/140 transitions.
RANDOM walk for 40000 steps (8966 resets) in 135 ms. (294 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1950 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2022551 steps, run timeout after 3001 ms. (steps per millisecond=673 ) properties seen :0 out of 1
Probabilistic random walk after 2022551 steps, saw 894917 distinct states, run finished after 3001 ms. (steps per millisecond=673 ) properties seen :0
// Phase 1: matrix 121 rows 98 cols
[2024-05-29 03:33:01] [INFO ] Computed 3 invariants in 1 ms
[2024-05-29 03:33:01] [INFO ] State equation strengthened by 53 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) 80/82 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 131/213 variables, 90/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 41/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/219 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 6/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 154 constraints, problems are : Problem set: 0 solved, 1 unsolved in 124 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 80/82 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 131/213 variables, 90/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 41/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/219 variables, 2/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/219 variables, 6/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/219 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/219 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 155 constraints, problems are : Problem set: 0 solved, 1 unsolved in 200 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 332ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 295 ms.
Support contains 2 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 121/121 transitions.
Applied a total of 0 rules in 3 ms. Remains 98 /98 variables (removed 0) and now considering 121/121 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 98/98 places, 121/121 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 121/121 transitions.
Applied a total of 0 rules in 4 ms. Remains 98 /98 variables (removed 0) and now considering 121/121 (removed 0) transitions.
[2024-05-29 03:33:02] [INFO ] Invariant cache hit.
[2024-05-29 03:33:02] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-29 03:33:02] [INFO ] Invariant cache hit.
[2024-05-29 03:33:02] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-05-29 03:33:03] [INFO ] Implicit Places using invariants and state equation in 357 ms returned []
Implicit Place search using SMT with State Equation took 466 ms to find 0 implicit places.
[2024-05-29 03:33:03] [INFO ] Redundant transitions in 1 ms returned []
Running 120 sub problems to find dead transitions.
[2024-05-29 03:33:03] [INFO ] Invariant cache hit.
[2024-05-29 03:33:03] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 121/219 variables, 98/101 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 53/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 154 constraints, problems are : Problem set: 0 solved, 120 unsolved in 5582 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 121/219 variables, 98/101 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 53/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 120/274 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (OVERLAPS) 0/219 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 274 constraints, problems are : Problem set: 0 solved, 120 unsolved in 10381 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
After SMT, in 16164ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 16166ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16644 ms. Remains : 98/98 places, 121/121 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 98 transition count 114
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 92 transition count 114
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 13 place count 92 transition count 99
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 43 place count 77 transition count 99
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 55 place count 71 transition count 93
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 70 transition count 102
Applied a total of 57 rules in 13 ms. Remains 70 /98 variables (removed 28) and now considering 102/121 (removed 19) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 102 rows 70 cols
[2024-05-29 03:33:19] [INFO ] Computed 3 invariants in 1 ms
[2024-05-29 03:33:19] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-29 03:33:19] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 03:33:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-29 03:33:19] [INFO ] After 82ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-29 03:33:19] [INFO ] After 109ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-29 03:33:19] [INFO ] After 175ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 295 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F p1)]
Knowledge based reduction with 7 factoid took 223 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 205 ms :[p1, (NOT p0), (NOT p0), p1]
Stuttering acceptance computed with spot in 216 ms :[p1, (NOT p0), (NOT p0), p1]
Stuttering acceptance computed with spot in 215 ms :[p1, (NOT p0), (NOT p0), p1]
Product exploration explored 100000 steps with 22385 reset in 343 ms.
Product exploration explored 100000 steps with 22551 reset in 368 ms.
Built C files in :
/tmp/ltsmin13345864948478423381
[2024-05-29 03:33:21] [INFO ] Computing symmetric may disable matrix : 140 transitions.
[2024-05-29 03:33:21] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 03:33:21] [INFO ] Computing symmetric may enable matrix : 140 transitions.
[2024-05-29 03:33:21] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 03:33:21] [INFO ] Computing Do-Not-Accords matrix : 140 transitions.
[2024-05-29 03:33:21] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 03:33:21] [INFO ] Built C files in 81ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13345864948478423381
Running compilation step : cd /tmp/ltsmin13345864948478423381;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1308 ms.
Running link step : cd /tmp/ltsmin13345864948478423381;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 72 ms.
Running LTSmin : cd /tmp/ltsmin13345864948478423381;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7621762778538760687.hoa' '--buchi-type=spotba'
LTSmin run took 538 ms.
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-00 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLFireability-00 finished in 100574 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&&(!p1||G(p2)))) U !p2)))'
Support contains 4 out of 178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 492/492 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 157 transition count 246
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 157 transition count 246
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 63 place count 136 transition count 225
Iterating global reduction 0 with 21 rules applied. Total rules applied 84 place count 136 transition count 225
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 103 place count 136 transition count 206
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 114 place count 125 transition count 185
Iterating global reduction 1 with 11 rules applied. Total rules applied 125 place count 125 transition count 185
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 131 place count 125 transition count 179
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 135 place count 121 transition count 175
Iterating global reduction 2 with 4 rules applied. Total rules applied 139 place count 121 transition count 175
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 143 place count 117 transition count 171
Iterating global reduction 2 with 4 rules applied. Total rules applied 147 place count 117 transition count 171
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 150 place count 114 transition count 168
Iterating global reduction 2 with 3 rules applied. Total rules applied 153 place count 114 transition count 168
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 157 place count 114 transition count 164
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 160 place count 111 transition count 161
Iterating global reduction 3 with 3 rules applied. Total rules applied 163 place count 111 transition count 161
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 164 place count 110 transition count 158
Iterating global reduction 3 with 1 rules applied. Total rules applied 165 place count 110 transition count 158
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 166 place count 109 transition count 157
Iterating global reduction 3 with 1 rules applied. Total rules applied 167 place count 109 transition count 157
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 168 place count 108 transition count 156
Iterating global reduction 3 with 1 rules applied. Total rules applied 169 place count 108 transition count 156
Applied a total of 169 rules in 21 ms. Remains 108 /178 variables (removed 70) and now considering 156/492 (removed 336) transitions.
// Phase 1: matrix 156 rows 108 cols
[2024-05-29 03:33:23] [INFO ] Computed 4 invariants in 3 ms
[2024-05-29 03:33:23] [INFO ] Implicit Places using invariants in 201 ms returned []
[2024-05-29 03:33:23] [INFO ] Invariant cache hit.
[2024-05-29 03:33:23] [INFO ] State equation strengthened by 81 read => feed constraints.
[2024-05-29 03:33:24] [INFO ] Implicit Places using invariants and state equation in 663 ms returned []
Implicit Place search using SMT with State Equation took 868 ms to find 0 implicit places.
Running 155 sub problems to find dead transitions.
[2024-05-29 03:33:24] [INFO ] Invariant cache hit.
[2024-05-29 03:33:24] [INFO ] State equation strengthened by 81 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (OVERLAPS) 1/108 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-05-29 03:33:27] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 155 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD139 is UNSAT
At refinement iteration 6 (OVERLAPS) 156/264 variables, 108/113 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/264 variables, 81/194 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/264 variables, 0/194 constraints. Problems are: Problem set: 3 solved, 152 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/264 variables, 0/194 constraints. Problems are: Problem set: 3 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 264/264 variables, and 194 constraints, problems are : Problem set: 3 solved, 152 unsolved in 10558 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 108/108 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 3 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 5 (OVERLAPS) 1/106 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 8 (OVERLAPS) 155/261 variables, 106/111 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 80/191 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/261 variables, 28/219 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/261 variables, 0/219 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 12 (OVERLAPS) 3/264 variables, 2/221 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/264 variables, 1/222 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/264 variables, 124/346 constraints. Problems are: Problem set: 3 solved, 152 unsolved
[2024-05-29 03:33:46] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
Problem TDEAD142 is UNSAT
At refinement iteration 15 (INCLUDED_ONLY) 0/264 variables, 1/347 constraints. Problems are: Problem set: 4 solved, 151 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/264 variables, 0/347 constraints. Problems are: Problem set: 4 solved, 151 unsolved
At refinement iteration 17 (OVERLAPS) 0/264 variables, 0/347 constraints. Problems are: Problem set: 4 solved, 151 unsolved
No progress, stopping.
After SMT solving in domain Int declared 264/264 variables, and 347 constraints, problems are : Problem set: 4 solved, 151 unsolved in 21464 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 108/108 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 152/155 constraints, Known Traps: 2/2 constraints]
After SMT, in 32311ms problems are : Problem set: 4 solved, 151 unsolved
Search for dead transitions found 4 dead transitions in 32314ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in LTL mode, iteration 1 : 108/178 places, 152/492 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 104 transition count 152
Applied a total of 4 rules in 1 ms. Remains 104 /108 variables (removed 4) and now considering 152/152 (removed 0) transitions.
// Phase 1: matrix 152 rows 104 cols
[2024-05-29 03:33:56] [INFO ] Computed 4 invariants in 1 ms
[2024-05-29 03:33:56] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-05-29 03:33:56] [INFO ] Invariant cache hit.
[2024-05-29 03:33:56] [INFO ] State equation strengthened by 80 read => feed constraints.
[2024-05-29 03:33:56] [INFO ] Implicit Places using invariants and state equation in 463 ms returned []
Implicit Place search using SMT with State Equation took 565 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 104/178 places, 152/492 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 33770 ms. Remains : 104/178 places, 152/492 transitions.
Stuttering acceptance computed with spot in 175 ms :[p2, p2, (OR p0 (AND p1 (NOT p2))), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLFireability-01
Product exploration explored 100000 steps with 50000 reset in 283 ms.
Product exploration explored 100000 steps with 50000 reset in 297 ms.
Computed a total of 17 stabilizing places and 24 stable transitions
Graph (complete) has 360 edges and 104 vertex of which 103 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 17 stabilizing places and 24 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 p0))), (X (NOT (AND p2 (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) p1))))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (OR (AND (NOT p2) p1) p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (OR (AND p2 p0) (AND p2 p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 14 factoid took 16 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLFireability-01 finished in 34576 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p1))||p0)))'
Support contains 4 out of 178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 492/492 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 156 transition count 217
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 156 transition count 217
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 66 place count 134 transition count 195
Iterating global reduction 0 with 22 rules applied. Total rules applied 88 place count 134 transition count 195
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 101 place count 134 transition count 182
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 113 place count 122 transition count 159
Iterating global reduction 1 with 12 rules applied. Total rules applied 125 place count 122 transition count 159
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 132 place count 122 transition count 152
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 136 place count 118 transition count 148
Iterating global reduction 2 with 4 rules applied. Total rules applied 140 place count 118 transition count 148
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 144 place count 114 transition count 144
Iterating global reduction 2 with 4 rules applied. Total rules applied 148 place count 114 transition count 144
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 151 place count 111 transition count 141
Iterating global reduction 2 with 3 rules applied. Total rules applied 154 place count 111 transition count 141
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 156 place count 111 transition count 139
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 159 place count 108 transition count 136
Iterating global reduction 3 with 3 rules applied. Total rules applied 162 place count 108 transition count 136
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 163 place count 107 transition count 133
Iterating global reduction 3 with 1 rules applied. Total rules applied 164 place count 107 transition count 133
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 165 place count 106 transition count 132
Iterating global reduction 3 with 1 rules applied. Total rules applied 166 place count 106 transition count 132
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 167 place count 105 transition count 131
Iterating global reduction 3 with 1 rules applied. Total rules applied 168 place count 105 transition count 131
Applied a total of 168 rules in 17 ms. Remains 105 /178 variables (removed 73) and now considering 131/492 (removed 361) transitions.
// Phase 1: matrix 131 rows 105 cols
[2024-05-29 03:33:57] [INFO ] Computed 4 invariants in 2 ms
[2024-05-29 03:33:57] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-05-29 03:33:57] [INFO ] Invariant cache hit.
[2024-05-29 03:33:57] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-29 03:33:58] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
Running 130 sub problems to find dead transitions.
[2024-05-29 03:33:58] [INFO ] Invariant cache hit.
[2024-05-29 03:33:58] [INFO ] State equation strengthened by 58 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-05-29 03:33:59] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 130 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD115 is UNSAT
At refinement iteration 6 (OVERLAPS) 131/236 variables, 105/110 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 58/168 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 0/168 constraints. Problems are: Problem set: 3 solved, 127 unsolved
[2024-05-29 03:34:01] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 1 ms to minimize.
[2024-05-29 03:34:02] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/236 variables, 2/170 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 0/170 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 11 (OVERLAPS) 0/236 variables, 0/170 constraints. Problems are: Problem set: 3 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Real declared 236/236 variables, and 170 constraints, problems are : Problem set: 3 solved, 127 unsolved in 6312 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 105/105 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 3 solved, 127 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 2 (OVERLAPS) 1/102 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 5 (OVERLAPS) 1/103 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 3/7 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 8 (OVERLAPS) 130/233 variables, 103/110 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/233 variables, 57/167 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/233 variables, 27/194 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/233 variables, 0/194 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 12 (OVERLAPS) 3/236 variables, 2/196 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/236 variables, 1/197 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/236 variables, 100/297 constraints. Problems are: Problem set: 3 solved, 127 unsolved
[2024-05-29 03:34:10] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
Problem TDEAD118 is UNSAT
At refinement iteration 15 (INCLUDED_ONLY) 0/236 variables, 1/298 constraints. Problems are: Problem set: 4 solved, 126 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/236 variables, 0/298 constraints. Problems are: Problem set: 4 solved, 126 unsolved
At refinement iteration 17 (OVERLAPS) 0/236 variables, 0/298 constraints. Problems are: Problem set: 4 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Int declared 236/236 variables, and 298 constraints, problems are : Problem set: 4 solved, 126 unsolved in 16261 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 105/105 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 127/130 constraints, Known Traps: 4/4 constraints]
After SMT, in 22703ms problems are : Problem set: 4 solved, 126 unsolved
Search for dead transitions found 4 dead transitions in 22705ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in LTL mode, iteration 1 : 105/178 places, 127/492 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 101 transition count 127
Applied a total of 4 rules in 2 ms. Remains 101 /105 variables (removed 4) and now considering 127/127 (removed 0) transitions.
// Phase 1: matrix 127 rows 101 cols
[2024-05-29 03:34:20] [INFO ] Computed 4 invariants in 1 ms
[2024-05-29 03:34:20] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-29 03:34:20] [INFO ] Invariant cache hit.
[2024-05-29 03:34:21] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-29 03:34:21] [INFO ] Implicit Places using invariants and state equation in 327 ms returned []
Implicit Place search using SMT with State Equation took 437 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 101/178 places, 127/492 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 23544 ms. Remains : 101/178 places, 127/492 transitions.
Stuttering acceptance computed with spot in 134 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLFireability-03
Product exploration explored 100000 steps with 50000 reset in 177 ms.
Product exploration explored 100000 steps with 50000 reset in 184 ms.
Computed a total of 17 stabilizing places and 22 stable transitions
Graph (complete) has 331 edges and 101 vertex of which 100 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 17 stabilizing places and 22 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 14 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLFireability-03 finished in 24078 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)||(G(p2)&&p1))))'
Support contains 4 out of 178 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 178/178 places, 492/492 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 156 transition count 218
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 156 transition count 218
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 66 place count 134 transition count 196
Iterating global reduction 0 with 22 rules applied. Total rules applied 88 place count 134 transition count 196
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 103 place count 134 transition count 181
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 114 place count 123 transition count 159
Iterating global reduction 1 with 11 rules applied. Total rules applied 125 place count 123 transition count 159
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 131 place count 123 transition count 153
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 134 place count 120 transition count 150
Iterating global reduction 2 with 3 rules applied. Total rules applied 137 place count 120 transition count 150
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 140 place count 117 transition count 147
Iterating global reduction 2 with 3 rules applied. Total rules applied 143 place count 117 transition count 147
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 145 place count 115 transition count 145
Iterating global reduction 2 with 2 rules applied. Total rules applied 147 place count 115 transition count 145
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 149 place count 115 transition count 143
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 151 place count 113 transition count 141
Iterating global reduction 3 with 2 rules applied. Total rules applied 153 place count 113 transition count 141
Applied a total of 153 rules in 42 ms. Remains 113 /178 variables (removed 65) and now considering 141/492 (removed 351) transitions.
// Phase 1: matrix 141 rows 113 cols
[2024-05-29 03:34:21] [INFO ] Computed 4 invariants in 2 ms
[2024-05-29 03:34:22] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-05-29 03:34:22] [INFO ] Invariant cache hit.
[2024-05-29 03:34:22] [INFO ] State equation strengthened by 62 read => feed constraints.
[2024-05-29 03:34:22] [INFO ] Implicit Places using invariants and state equation in 515 ms returned []
Implicit Place search using SMT with State Equation took 693 ms to find 0 implicit places.
[2024-05-29 03:34:22] [INFO ] Redundant transitions in 1 ms returned []
Running 140 sub problems to find dead transitions.
[2024-05-29 03:34:22] [INFO ] Invariant cache hit.
[2024-05-29 03:34:22] [INFO ] State equation strengthened by 62 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (OVERLAPS) 1/113 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-05-29 03:34:25] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 140 unsolved
Problem TDEAD43 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD125 is UNSAT
At refinement iteration 6 (OVERLAPS) 141/254 variables, 113/118 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 62/180 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 0/180 constraints. Problems are: Problem set: 3 solved, 137 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/254 variables, 0/180 constraints. Problems are: Problem set: 3 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Real declared 254/254 variables, and 180 constraints, problems are : Problem set: 3 solved, 137 unsolved in 8497 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 3 solved, 137 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 2 (OVERLAPS) 1/110 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 5 (OVERLAPS) 1/111 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 8 (OVERLAPS) 140/251 variables, 111/116 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 61/177 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/251 variables, 30/207 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/251 variables, 0/207 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 12 (OVERLAPS) 3/254 variables, 2/209 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/254 variables, 1/210 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/254 variables, 107/317 constraints. Problems are: Problem set: 3 solved, 137 unsolved
[2024-05-29 03:34:39] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-29 03:34:39] [INFO ] Deduced a trap composed of 41 places in 31 ms of which 1 ms to minimize.
Problem TDEAD128 is UNSAT
At refinement iteration 15 (INCLUDED_ONLY) 0/254 variables, 2/319 constraints. Problems are: Problem set: 4 solved, 136 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/254 variables, 0/319 constraints. Problems are: Problem set: 4 solved, 136 unsolved
At refinement iteration 17 (OVERLAPS) 0/254 variables, 0/319 constraints. Problems are: Problem set: 4 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 254/254 variables, and 319 constraints, problems are : Problem set: 4 solved, 136 unsolved in 18900 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 137/140 constraints, Known Traps: 3/3 constraints]
After SMT, in 27626ms problems are : Problem set: 4 solved, 136 unsolved
Search for dead transitions found 4 dead transitions in 27629ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 113/178 places, 137/492 transitions.
Graph (complete) has 361 edges and 113 vertex of which 109 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.6 ms
Discarding 4 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 10 ms. Remains 109 /113 variables (removed 4) and now considering 137/137 (removed 0) transitions.
// Phase 1: matrix 137 rows 109 cols
[2024-05-29 03:34:50] [INFO ] Computed 4 invariants in 2 ms
[2024-05-29 03:34:50] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-29 03:34:50] [INFO ] Invariant cache hit.
[2024-05-29 03:34:50] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-05-29 03:34:50] [INFO ] Implicit Places using invariants and state equation in 323 ms returned []
Implicit Place search using SMT with State Equation took 431 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 109/178 places, 137/492 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 28818 ms. Remains : 109/178 places, 137/492 transitions.
Stuttering acceptance computed with spot in 94 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLFireability-05
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLFireability-05 finished in 28932 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(G(p1))))'
Support contains 3 out of 178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 492/492 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 156 transition count 231
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 156 transition count 231
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 66 place count 134 transition count 209
Iterating global reduction 0 with 22 rules applied. Total rules applied 88 place count 134 transition count 209
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 105 place count 134 transition count 192
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 116 place count 123 transition count 171
Iterating global reduction 1 with 11 rules applied. Total rules applied 127 place count 123 transition count 171
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 133 place count 123 transition count 165
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 136 place count 120 transition count 162
Iterating global reduction 2 with 3 rules applied. Total rules applied 139 place count 120 transition count 162
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 142 place count 117 transition count 159
Iterating global reduction 2 with 3 rules applied. Total rules applied 145 place count 117 transition count 159
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 147 place count 115 transition count 157
Iterating global reduction 2 with 2 rules applied. Total rules applied 149 place count 115 transition count 157
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 151 place count 113 transition count 155
Iterating global reduction 2 with 2 rules applied. Total rules applied 153 place count 113 transition count 155
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 154 place count 112 transition count 152
Iterating global reduction 2 with 1 rules applied. Total rules applied 155 place count 112 transition count 152
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 156 place count 111 transition count 151
Iterating global reduction 2 with 1 rules applied. Total rules applied 157 place count 111 transition count 151
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 158 place count 110 transition count 150
Iterating global reduction 2 with 1 rules applied. Total rules applied 159 place count 110 transition count 150
Applied a total of 159 rules in 18 ms. Remains 110 /178 variables (removed 68) and now considering 150/492 (removed 342) transitions.
// Phase 1: matrix 150 rows 110 cols
[2024-05-29 03:34:50] [INFO ] Computed 4 invariants in 1 ms
[2024-05-29 03:34:50] [INFO ] Implicit Places using invariants in 142 ms returned []
[2024-05-29 03:34:50] [INFO ] Invariant cache hit.
[2024-05-29 03:34:51] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-29 03:34:51] [INFO ] Implicit Places using invariants and state equation in 492 ms returned []
Implicit Place search using SMT with State Equation took 637 ms to find 0 implicit places.
Running 149 sub problems to find dead transitions.
[2024-05-29 03:34:51] [INFO ] Invariant cache hit.
[2024-05-29 03:34:51] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (OVERLAPS) 1/110 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 149 unsolved
[2024-05-29 03:34:53] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 149 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD133 is UNSAT
At refinement iteration 6 (OVERLAPS) 150/260 variables, 110/115 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/260 variables, 74/189 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/260 variables, 0/189 constraints. Problems are: Problem set: 3 solved, 146 unsolved
[2024-05-29 03:34:58] [INFO ] Deduced a trap composed of 35 places in 91 ms of which 3 ms to minimize.
[2024-05-29 03:34:58] [INFO ] Deduced a trap composed of 32 places in 128 ms of which 3 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/260 variables, 2/191 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/260 variables, 0/191 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 11 (OVERLAPS) 0/260 variables, 0/191 constraints. Problems are: Problem set: 3 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 260/260 variables, and 191 constraints, problems are : Problem set: 3 solved, 146 unsolved in 11672 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 110/110 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 3 solved, 146 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 1/107 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 5 (OVERLAPS) 1/108 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 3/7 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 8 (OVERLAPS) 149/257 variables, 108/115 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/257 variables, 73/188 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/257 variables, 28/216 constraints. Problems are: Problem set: 3 solved, 146 unsolved
[2024-05-29 03:35:09] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/257 variables, 1/217 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/257 variables, 0/217 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 13 (OVERLAPS) 3/260 variables, 2/219 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/260 variables, 1/220 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/260 variables, 118/338 constraints. Problems are: Problem set: 3 solved, 146 unsolved
[2024-05-29 03:35:16] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
Problem TDEAD136 is UNSAT
At refinement iteration 16 (INCLUDED_ONLY) 0/260 variables, 1/339 constraints. Problems are: Problem set: 4 solved, 145 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/260 variables, 0/339 constraints. Problems are: Problem set: 4 solved, 145 unsolved
At refinement iteration 18 (OVERLAPS) 0/260 variables, 0/339 constraints. Problems are: Problem set: 4 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Int declared 260/260 variables, and 339 constraints, problems are : Problem set: 4 solved, 145 unsolved in 25618 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 110/110 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 146/149 constraints, Known Traps: 5/5 constraints]
After SMT, in 37444ms problems are : Problem set: 4 solved, 145 unsolved
Search for dead transitions found 4 dead transitions in 37446ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in LTL mode, iteration 1 : 110/178 places, 146/492 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 106 transition count 146
Applied a total of 4 rules in 2 ms. Remains 106 /110 variables (removed 4) and now considering 146/146 (removed 0) transitions.
// Phase 1: matrix 146 rows 106 cols
[2024-05-29 03:35:28] [INFO ] Computed 4 invariants in 1 ms
[2024-05-29 03:35:28] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-05-29 03:35:28] [INFO ] Invariant cache hit.
[2024-05-29 03:35:29] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-29 03:35:29] [INFO ] Implicit Places using invariants and state equation in 345 ms returned []
Implicit Place search using SMT with State Equation took 447 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 106/178 places, 146/492 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 38551 ms. Remains : 106/178 places, 146/492 transitions.
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLFireability-06
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLFireability-06 finished in 38705 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 492/492 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 155 transition count 202
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 155 transition count 202
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 69 place count 132 transition count 179
Iterating global reduction 0 with 23 rules applied. Total rules applied 92 place count 132 transition count 179
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 105 place count 132 transition count 166
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 117 place count 120 transition count 143
Iterating global reduction 1 with 12 rules applied. Total rules applied 129 place count 120 transition count 143
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 137 place count 120 transition count 135
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 141 place count 116 transition count 131
Iterating global reduction 2 with 4 rules applied. Total rules applied 145 place count 116 transition count 131
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 149 place count 112 transition count 127
Iterating global reduction 2 with 4 rules applied. Total rules applied 153 place count 112 transition count 127
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 156 place count 109 transition count 124
Iterating global reduction 2 with 3 rules applied. Total rules applied 159 place count 109 transition count 124
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 161 place count 109 transition count 122
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 164 place count 106 transition count 119
Iterating global reduction 3 with 3 rules applied. Total rules applied 167 place count 106 transition count 119
Applied a total of 167 rules in 13 ms. Remains 106 /178 variables (removed 72) and now considering 119/492 (removed 373) transitions.
// Phase 1: matrix 119 rows 106 cols
[2024-05-29 03:35:29] [INFO ] Computed 4 invariants in 1 ms
[2024-05-29 03:35:29] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-05-29 03:35:29] [INFO ] Invariant cache hit.
[2024-05-29 03:35:29] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-29 03:35:29] [INFO ] Implicit Places using invariants and state equation in 351 ms returned []
Implicit Place search using SMT with State Equation took 477 ms to find 0 implicit places.
Running 118 sub problems to find dead transitions.
[2024-05-29 03:35:29] [INFO ] Invariant cache hit.
[2024-05-29 03:35:29] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (OVERLAPS) 1/106 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-29 03:35:32] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 118 unsolved
Problem TDEAD44 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD106 is UNSAT
At refinement iteration 6 (OVERLAPS) 119/225 variables, 106/111 constraints. Problems are: Problem set: 3 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/225 variables, 45/156 constraints. Problems are: Problem set: 3 solved, 115 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/225 variables, 0/156 constraints. Problems are: Problem set: 3 solved, 115 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/225 variables, 0/156 constraints. Problems are: Problem set: 3 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 225/225 variables, and 156 constraints, problems are : Problem set: 3 solved, 115 unsolved in 8059 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 106/106 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 3 solved, 115 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 115 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 115 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 2/3 constraints. Problems are: Problem set: 3 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 115 unsolved
At refinement iteration 4 (OVERLAPS) 1/104 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 115 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 115 unsolved
At refinement iteration 7 (OVERLAPS) 118/222 variables, 104/109 constraints. Problems are: Problem set: 3 solved, 115 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 44/153 constraints. Problems are: Problem set: 3 solved, 115 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/222 variables, 28/181 constraints. Problems are: Problem set: 3 solved, 115 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 0/181 constraints. Problems are: Problem set: 3 solved, 115 unsolved
At refinement iteration 11 (OVERLAPS) 3/225 variables, 2/183 constraints. Problems are: Problem set: 3 solved, 115 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/225 variables, 1/184 constraints. Problems are: Problem set: 3 solved, 115 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/225 variables, 87/271 constraints. Problems are: Problem set: 3 solved, 115 unsolved
[2024-05-29 03:35:46] [INFO ] Deduced a trap composed of 43 places in 50 ms of which 2 ms to minimize.
[2024-05-29 03:35:46] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 2 ms to minimize.
Problem TDEAD109 is UNSAT
At refinement iteration 14 (INCLUDED_ONLY) 0/225 variables, 2/273 constraints. Problems are: Problem set: 4 solved, 114 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/225 variables, 0/273 constraints. Problems are: Problem set: 4 solved, 114 unsolved
At refinement iteration 16 (OVERLAPS) 0/225 variables, 0/273 constraints. Problems are: Problem set: 4 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Int declared 225/225 variables, and 273 constraints, problems are : Problem set: 4 solved, 114 unsolved in 18697 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 106/106 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 115/118 constraints, Known Traps: 3/3 constraints]
After SMT, in 26920ms problems are : Problem set: 4 solved, 114 unsolved
Search for dead transitions found 4 dead transitions in 26921ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in LTL mode, iteration 1 : 106/178 places, 115/492 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 102 transition count 115
Applied a total of 4 rules in 2 ms. Remains 102 /106 variables (removed 4) and now considering 115/115 (removed 0) transitions.
// Phase 1: matrix 115 rows 102 cols
[2024-05-29 03:35:56] [INFO ] Computed 4 invariants in 1 ms
[2024-05-29 03:35:56] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-29 03:35:56] [INFO ] Invariant cache hit.
[2024-05-29 03:35:57] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-29 03:35:57] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 378 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 102/178 places, 115/492 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 27794 ms. Remains : 102/178 places, 115/492 transitions.
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLFireability-07
Product exploration explored 100000 steps with 22397 reset in 371 ms.
Product exploration explored 100000 steps with 22554 reset in 265 ms.
Computed a total of 27 stabilizing places and 35 stable transitions
Graph (complete) has 323 edges and 102 vertex of which 101 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 27 stabilizing places and 35 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 89 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8943 resets) in 153 ms. (259 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (4087 resets) in 58 ms. (678 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2150368 steps, run timeout after 3001 ms. (steps per millisecond=716 ) properties seen :0 out of 1
Probabilistic random walk after 2150368 steps, saw 1002840 distinct states, run finished after 3001 ms. (steps per millisecond=716 ) properties seen :0
[2024-05-29 03:36:01] [INFO ] Invariant cache hit.
[2024-05-29 03:36:01] [INFO ] State equation strengthened by 44 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) 57/59 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/78 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 100/178 variables, 78/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 29/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 39/217 variables, 24/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/217 variables, 15/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 03:36:01] [INFO ] Deduced a trap composed of 34 places in 30 ms of which 1 ms to minimize.
Problem apf0 is UNSAT
After SMT solving in domain Real declared 217/217 variables, and 151 constraints, problems are : Problem set: 1 solved, 0 unsolved in 143 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 149ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [p0, (X (X p0)), (G p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 13 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLFireability-07 finished in 32071 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(X(F(p0))))))'
Support contains 2 out of 178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 492/492 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 155 transition count 216
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 155 transition count 216
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 69 place count 132 transition count 193
Iterating global reduction 0 with 23 rules applied. Total rules applied 92 place count 132 transition count 193
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 107 place count 132 transition count 178
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 119 place count 120 transition count 155
Iterating global reduction 1 with 12 rules applied. Total rules applied 131 place count 120 transition count 155
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 138 place count 120 transition count 148
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 142 place count 116 transition count 144
Iterating global reduction 2 with 4 rules applied. Total rules applied 146 place count 116 transition count 144
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 150 place count 112 transition count 140
Iterating global reduction 2 with 4 rules applied. Total rules applied 154 place count 112 transition count 140
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 157 place count 109 transition count 137
Iterating global reduction 2 with 3 rules applied. Total rules applied 160 place count 109 transition count 137
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 162 place count 109 transition count 135
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 165 place count 106 transition count 132
Iterating global reduction 3 with 3 rules applied. Total rules applied 168 place count 106 transition count 132
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 169 place count 105 transition count 129
Iterating global reduction 3 with 1 rules applied. Total rules applied 170 place count 105 transition count 129
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 171 place count 104 transition count 128
Iterating global reduction 3 with 1 rules applied. Total rules applied 172 place count 104 transition count 128
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 173 place count 103 transition count 127
Iterating global reduction 3 with 1 rules applied. Total rules applied 174 place count 103 transition count 127
Applied a total of 174 rules in 15 ms. Remains 103 /178 variables (removed 75) and now considering 127/492 (removed 365) transitions.
// Phase 1: matrix 127 rows 103 cols
[2024-05-29 03:36:01] [INFO ] Computed 4 invariants in 1 ms
[2024-05-29 03:36:01] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-29 03:36:01] [INFO ] Invariant cache hit.
[2024-05-29 03:36:01] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-29 03:36:01] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 402 ms to find 0 implicit places.
Running 126 sub problems to find dead transitions.
[2024-05-29 03:36:01] [INFO ] Invariant cache hit.
[2024-05-29 03:36:01] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-29 03:36:04] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 126 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD112 is UNSAT
At refinement iteration 6 (OVERLAPS) 127/230 variables, 103/108 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/230 variables, 56/164 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 0/164 constraints. Problems are: Problem set: 3 solved, 123 unsolved
[2024-05-29 03:36:08] [INFO ] Deduced a trap composed of 33 places in 89 ms of which 4 ms to minimize.
[2024-05-29 03:36:08] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/230 variables, 2/166 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/230 variables, 0/166 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 11 (OVERLAPS) 0/230 variables, 0/166 constraints. Problems are: Problem set: 3 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 230/230 variables, and 166 constraints, problems are : Problem set: 3 solved, 123 unsolved in 10623 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 103/103 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 3 solved, 123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 2 (OVERLAPS) 1/100 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 5 (OVERLAPS) 1/101 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 3/7 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 8 (OVERLAPS) 126/227 variables, 101/108 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/227 variables, 55/163 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 26/189 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/227 variables, 0/189 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 12 (OVERLAPS) 3/230 variables, 2/191 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/230 variables, 1/192 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/230 variables, 97/289 constraints. Problems are: Problem set: 3 solved, 123 unsolved
[2024-05-29 03:36:19] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 1 ms to minimize.
Problem TDEAD115 is UNSAT
At refinement iteration 15 (INCLUDED_ONLY) 0/230 variables, 1/290 constraints. Problems are: Problem set: 4 solved, 122 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/230 variables, 0/290 constraints. Problems are: Problem set: 4 solved, 122 unsolved
At refinement iteration 17 (OVERLAPS) 0/230 variables, 0/290 constraints. Problems are: Problem set: 4 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 230/230 variables, and 290 constraints, problems are : Problem set: 4 solved, 122 unsolved in 15640 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 103/103 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 123/126 constraints, Known Traps: 4/4 constraints]
After SMT, in 26421ms problems are : Problem set: 4 solved, 122 unsolved
Search for dead transitions found 4 dead transitions in 26423ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in LTL mode, iteration 1 : 103/178 places, 123/492 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 99 transition count 123
Applied a total of 4 rules in 1 ms. Remains 99 /103 variables (removed 4) and now considering 123/123 (removed 0) transitions.
// Phase 1: matrix 123 rows 99 cols
[2024-05-29 03:36:28] [INFO ] Computed 4 invariants in 1 ms
[2024-05-29 03:36:28] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-29 03:36:28] [INFO ] Invariant cache hit.
[2024-05-29 03:36:28] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-29 03:36:28] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 367 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 99/178 places, 123/492 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 27210 ms. Remains : 99/178 places, 123/492 transitions.
Stuttering acceptance computed with spot in 211 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLFireability-08
Product exploration explored 100000 steps with 26648 reset in 346 ms.
Product exploration explored 100000 steps with 26722 reset in 382 ms.
Computed a total of 17 stabilizing places and 22 stable transitions
Graph (complete) has 323 edges and 99 vertex of which 98 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 17 stabilizing places and 22 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 104 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (9019 resets) in 91 ms. (434 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1943 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 3252 steps, run visited all 1 properties in 9 ms. (steps per millisecond=361 )
Probabilistic random walk after 3252 steps, saw 1669 distinct states, run finished after 19 ms. (steps per millisecond=171 ) properties seen :1
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 112 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 178 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 99 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 123/123 transitions.
Applied a total of 0 rules in 1 ms. Remains 99 /99 variables (removed 0) and now considering 123/123 (removed 0) transitions.
[2024-05-29 03:36:30] [INFO ] Invariant cache hit.
[2024-05-29 03:36:30] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-29 03:36:30] [INFO ] Invariant cache hit.
[2024-05-29 03:36:30] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-29 03:36:30] [INFO ] Implicit Places using invariants and state equation in 315 ms returned []
Implicit Place search using SMT with State Equation took 423 ms to find 0 implicit places.
Running 122 sub problems to find dead transitions.
[2024-05-29 03:36:30] [INFO ] Invariant cache hit.
[2024-05-29 03:36:30] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 1/99 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (OVERLAPS) 123/222 variables, 99/103 constraints. Problems are: Problem set: 0 solved, 122 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 55/158 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (OVERLAPS) 0/222 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 158 constraints, problems are : Problem set: 0 solved, 122 unsolved in 5552 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 99/99 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 1/99 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (OVERLAPS) 123/222 variables, 99/103 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 55/158 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 122/280 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (OVERLAPS) 0/222 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 280 constraints, problems are : Problem set: 0 solved, 122 unsolved in 8174 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 99/99 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints]
After SMT, in 13837ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 13839ms
Finished structural reductions in LTL mode , in 1 iterations and 14263 ms. Remains : 99/99 places, 123/123 transitions.
Computed a total of 17 stabilizing places and 22 stable transitions
Graph (complete) has 323 edges and 99 vertex of which 98 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 17 stabilizing places and 22 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 81 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 212 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8922 resets) in 173 ms. (229 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1896 resets) in 71 ms. (555 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 3252 steps, run visited all 1 properties in 11 ms. (steps per millisecond=295 )
Probabilistic random walk after 3252 steps, saw 1669 distinct states, run finished after 11 ms. (steps per millisecond=295 ) properties seen :1
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 123 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 225 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 240 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 243 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 26658 reset in 139 ms.
Product exploration explored 100000 steps with 26678 reset in 249 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 236 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 99 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 99/99 places, 123/123 transitions.
Applied a total of 0 rules in 6 ms. Remains 99 /99 variables (removed 0) and now considering 123/123 (removed 0) transitions.
[2024-05-29 03:36:47] [INFO ] Redundant transitions in 0 ms returned []
Running 122 sub problems to find dead transitions.
[2024-05-29 03:36:47] [INFO ] Invariant cache hit.
[2024-05-29 03:36:47] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 1/99 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (OVERLAPS) 123/222 variables, 99/103 constraints. Problems are: Problem set: 0 solved, 122 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 55/158 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (OVERLAPS) 0/222 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 158 constraints, problems are : Problem set: 0 solved, 122 unsolved in 4151 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 99/99 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 1/99 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (OVERLAPS) 123/222 variables, 99/103 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 55/158 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 122/280 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (OVERLAPS) 0/222 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 280 constraints, problems are : Problem set: 0 solved, 122 unsolved in 9382 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 99/99 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints]
After SMT, in 13730ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 13733ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 13749 ms. Remains : 99/99 places, 123/123 transitions.
Built C files in :
/tmp/ltsmin5899738924928446669
[2024-05-29 03:37:00] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5899738924928446669
Running compilation step : cd /tmp/ltsmin5899738924928446669;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 408 ms.
Running link step : cd /tmp/ltsmin5899738924928446669;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin5899738924928446669;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13497916696150041236.hoa' '--buchi-type=spotba'
LTSmin run took 134 ms.
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-08 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLFireability-08 finished in 59962 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(X((!(!G(F(p0)) U !X(p1))&&F(!p1)))))'
Support contains 4 out of 178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 492/492 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 156 transition count 217
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 156 transition count 217
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 66 place count 134 transition count 195
Iterating global reduction 0 with 22 rules applied. Total rules applied 88 place count 134 transition count 195
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 102 place count 134 transition count 181
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 113 place count 123 transition count 160
Iterating global reduction 1 with 11 rules applied. Total rules applied 124 place count 123 transition count 160
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 131 place count 123 transition count 153
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 134 place count 120 transition count 150
Iterating global reduction 2 with 3 rules applied. Total rules applied 137 place count 120 transition count 150
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 140 place count 117 transition count 147
Iterating global reduction 2 with 3 rules applied. Total rules applied 143 place count 117 transition count 147
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 145 place count 115 transition count 145
Iterating global reduction 2 with 2 rules applied. Total rules applied 147 place count 115 transition count 145
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 149 place count 115 transition count 143
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 151 place count 113 transition count 141
Iterating global reduction 3 with 2 rules applied. Total rules applied 153 place count 113 transition count 141
Applied a total of 153 rules in 18 ms. Remains 113 /178 variables (removed 65) and now considering 141/492 (removed 351) transitions.
// Phase 1: matrix 141 rows 113 cols
[2024-05-29 03:37:01] [INFO ] Computed 4 invariants in 1 ms
[2024-05-29 03:37:01] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-05-29 03:37:01] [INFO ] Invariant cache hit.
[2024-05-29 03:37:01] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-05-29 03:37:01] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 421 ms to find 0 implicit places.
Running 140 sub problems to find dead transitions.
[2024-05-29 03:37:01] [INFO ] Invariant cache hit.
[2024-05-29 03:37:01] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (OVERLAPS) 1/113 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-05-29 03:37:03] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 140 unsolved
Problem TDEAD44 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD126 is UNSAT
At refinement iteration 6 (OVERLAPS) 141/254 variables, 113/118 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 61/179 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 0/179 constraints. Problems are: Problem set: 3 solved, 137 unsolved
[2024-05-29 03:37:07] [INFO ] Deduced a trap composed of 34 places in 82 ms of which 2 ms to minimize.
[2024-05-29 03:37:07] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/254 variables, 2/181 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/254 variables, 0/181 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 11 (OVERLAPS) 0/254 variables, 0/181 constraints. Problems are: Problem set: 3 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Real declared 254/254 variables, and 181 constraints, problems are : Problem set: 3 solved, 137 unsolved in 8033 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 113/113 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 3 solved, 137 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 2 (OVERLAPS) 1/110 variables, 2/3 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 4 (OVERLAPS) 1/111 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 3/7 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 7 (OVERLAPS) 140/251 variables, 111/118 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 60/178 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 30/208 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/251 variables, 0/208 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 11 (OVERLAPS) 3/254 variables, 2/210 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/254 variables, 1/211 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/254 variables, 107/318 constraints. Problems are: Problem set: 3 solved, 137 unsolved
[2024-05-29 03:37:17] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 0 ms to minimize.
[2024-05-29 03:37:17] [INFO ] Deduced a trap composed of 43 places in 32 ms of which 1 ms to minimize.
Problem TDEAD129 is UNSAT
At refinement iteration 14 (INCLUDED_ONLY) 0/254 variables, 2/320 constraints. Problems are: Problem set: 4 solved, 136 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/254 variables, 0/320 constraints. Problems are: Problem set: 4 solved, 136 unsolved
At refinement iteration 16 (OVERLAPS) 0/254 variables, 0/320 constraints. Problems are: Problem set: 4 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 254/254 variables, and 320 constraints, problems are : Problem set: 4 solved, 136 unsolved in 21711 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 113/113 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 137/140 constraints, Known Traps: 5/5 constraints]
After SMT, in 29898ms problems are : Problem set: 4 solved, 136 unsolved
Search for dead transitions found 4 dead transitions in 29900ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in LTL mode, iteration 1 : 113/178 places, 137/492 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 109 transition count 137
Applied a total of 4 rules in 3 ms. Remains 109 /113 variables (removed 4) and now considering 137/137 (removed 0) transitions.
// Phase 1: matrix 137 rows 109 cols
[2024-05-29 03:37:31] [INFO ] Computed 4 invariants in 1 ms
[2024-05-29 03:37:31] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-29 03:37:31] [INFO ] Invariant cache hit.
[2024-05-29 03:37:32] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-29 03:37:32] [INFO ] Implicit Places using invariants and state equation in 315 ms returned []
Implicit Place search using SMT with State Equation took 423 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 109/178 places, 137/492 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30766 ms. Remains : 109/178 places, 137/492 transitions.
Stuttering acceptance computed with spot in 296 ms :[true, true, (NOT p1), p1, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLFireability-09
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLFireability-09 finished in 31086 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&&X(p1)))&&F(G(p2)))))'
Support contains 5 out of 178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 492/492 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 156 transition count 231
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 156 transition count 231
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 66 place count 134 transition count 209
Iterating global reduction 0 with 22 rules applied. Total rules applied 88 place count 134 transition count 209
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 105 place count 134 transition count 192
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 116 place count 123 transition count 171
Iterating global reduction 1 with 11 rules applied. Total rules applied 127 place count 123 transition count 171
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 133 place count 123 transition count 165
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 136 place count 120 transition count 162
Iterating global reduction 2 with 3 rules applied. Total rules applied 139 place count 120 transition count 162
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 142 place count 117 transition count 159
Iterating global reduction 2 with 3 rules applied. Total rules applied 145 place count 117 transition count 159
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 148 place count 114 transition count 156
Iterating global reduction 2 with 3 rules applied. Total rules applied 151 place count 114 transition count 156
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 154 place count 114 transition count 153
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 157 place count 111 transition count 150
Iterating global reduction 3 with 3 rules applied. Total rules applied 160 place count 111 transition count 150
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 161 place count 110 transition count 147
Iterating global reduction 3 with 1 rules applied. Total rules applied 162 place count 110 transition count 147
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 163 place count 109 transition count 146
Iterating global reduction 3 with 1 rules applied. Total rules applied 164 place count 109 transition count 146
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 165 place count 108 transition count 145
Iterating global reduction 3 with 1 rules applied. Total rules applied 166 place count 108 transition count 145
Applied a total of 166 rules in 36 ms. Remains 108 /178 variables (removed 70) and now considering 145/492 (removed 347) transitions.
// Phase 1: matrix 145 rows 108 cols
[2024-05-29 03:37:32] [INFO ] Computed 4 invariants in 2 ms
[2024-05-29 03:37:32] [INFO ] Implicit Places using invariants in 141 ms returned []
[2024-05-29 03:37:32] [INFO ] Invariant cache hit.
[2024-05-29 03:37:32] [INFO ] State equation strengthened by 70 read => feed constraints.
[2024-05-29 03:37:33] [INFO ] Implicit Places using invariants and state equation in 525 ms returned []
Implicit Place search using SMT with State Equation took 672 ms to find 0 implicit places.
Running 144 sub problems to find dead transitions.
[2024-05-29 03:37:33] [INFO ] Invariant cache hit.
[2024-05-29 03:37:33] [INFO ] State equation strengthened by 70 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (OVERLAPS) 1/108 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-29 03:37:36] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD128 is UNSAT
At refinement iteration 6 (OVERLAPS) 145/253 variables, 108/113 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/253 variables, 70/183 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/253 variables, 0/183 constraints. Problems are: Problem set: 3 solved, 141 unsolved
[2024-05-29 03:37:41] [INFO ] Deduced a trap composed of 34 places in 86 ms of which 3 ms to minimize.
[2024-05-29 03:37:41] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/253 variables, 2/185 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/253 variables, 0/185 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 11 (OVERLAPS) 0/253 variables, 0/185 constraints. Problems are: Problem set: 3 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Real declared 253/253 variables, and 185 constraints, problems are : Problem set: 3 solved, 141 unsolved in 12373 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 108/108 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 3 solved, 141 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 5 (OVERLAPS) 1/106 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 3/7 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 8 (OVERLAPS) 144/250 variables, 106/113 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/250 variables, 69/182 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/250 variables, 28/210 constraints. Problems are: Problem set: 3 solved, 141 unsolved
[2024-05-29 03:37:51] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/250 variables, 1/211 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/250 variables, 0/211 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 13 (OVERLAPS) 3/253 variables, 2/213 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/253 variables, 1/214 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/253 variables, 113/327 constraints. Problems are: Problem set: 3 solved, 141 unsolved
[2024-05-29 03:37:59] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 1 ms to minimize.
Problem TDEAD131 is UNSAT
At refinement iteration 16 (INCLUDED_ONLY) 0/253 variables, 1/328 constraints. Problems are: Problem set: 4 solved, 140 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/253 variables, 0/328 constraints. Problems are: Problem set: 4 solved, 140 unsolved
At refinement iteration 18 (OVERLAPS) 0/253 variables, 0/328 constraints. Problems are: Problem set: 4 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Int declared 253/253 variables, and 328 constraints, problems are : Problem set: 4 solved, 140 unsolved in 24426 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 108/108 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 141/144 constraints, Known Traps: 5/5 constraints]
After SMT, in 37066ms problems are : Problem set: 4 solved, 140 unsolved
Search for dead transitions found 4 dead transitions in 37069ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in LTL mode, iteration 1 : 108/178 places, 141/492 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 104 transition count 141
Applied a total of 4 rules in 1 ms. Remains 104 /108 variables (removed 4) and now considering 141/141 (removed 0) transitions.
// Phase 1: matrix 141 rows 104 cols
[2024-05-29 03:38:10] [INFO ] Computed 4 invariants in 1 ms
[2024-05-29 03:38:10] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-29 03:38:10] [INFO ] Invariant cache hit.
[2024-05-29 03:38:10] [INFO ] State equation strengthened by 69 read => feed constraints.
[2024-05-29 03:38:10] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 405 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 104/178 places, 141/492 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 38184 ms. Remains : 104/178 places, 141/492 transitions.
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLFireability-10
Product exploration explored 100000 steps with 37371 reset in 194 ms.
Product exploration explored 100000 steps with 37273 reset in 204 ms.
Computed a total of 17 stabilizing places and 23 stable transitions
Graph (complete) has 350 edges and 104 vertex of which 103 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 17 stabilizing places and 23 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X p2)), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 133 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1)]
RANDOM walk for 40000 steps (8905 resets) in 255 ms. (156 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1890 resets) in 112 ms. (354 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1874 resets) in 90 ms. (439 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1864 resets) in 166 ms. (239 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (4096 resets) in 178 ms. (223 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1858 resets) in 155 ms. (256 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 119192 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :1 out of 5
Probabilistic random walk after 119192 steps, saw 52950 distinct states, run finished after 3001 ms. (steps per millisecond=39 ) properties seen :1
[2024-05-29 03:38:15] [INFO ] Invariant cache hit.
[2024-05-29 03:38:15] [INFO ] State equation strengthened by 69 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 60/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 11/74 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 4/78 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 124/202 variables, 78/82 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 52/134 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf1 is UNSAT
At refinement iteration 10 (OVERLAPS) 43/245 variables, 26/160 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/245 variables, 17/177 constraints. Problems are: Problem set: 1 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/245 variables, 0/177 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/245 variables, 0/177 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 245/245 variables, and 177 constraints, problems are : Problem set: 1 solved, 3 unsolved in 264 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 60/63 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 11/74 variables, 2/3 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 4/78 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 124/202 variables, 78/82 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 52/134 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/134 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 43/245 variables, 26/160 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/245 variables, 17/177 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/245 variables, 3/180 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/245 variables, 0/180 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/245 variables, 0/180 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 245/245 variables, and 180 constraints, problems are : Problem set: 1 solved, 3 unsolved in 444 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 720ms problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 11917 ms.
Support contains 3 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 141/141 transitions.
Graph (complete) has 314 edges and 104 vertex of which 103 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 103 transition count 139
Applied a total of 3 rules in 6 ms. Remains 103 /104 variables (removed 1) and now considering 139/141 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 103/104 places, 139/141 transitions.
RANDOM walk for 40000 steps (8960 resets) in 344 ms. (115 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1851 resets) in 199 ms. (200 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1876 resets) in 63 ms. (625 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1867 resets) in 117 ms. (339 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 368939 steps, run timeout after 3001 ms. (steps per millisecond=122 ) properties seen :0 out of 3
Probabilistic random walk after 368939 steps, saw 159433 distinct states, run finished after 3001 ms. (steps per millisecond=122 ) properties seen :0
// Phase 1: matrix 139 rows 103 cols
[2024-05-29 03:38:31] [INFO ] Computed 3 invariants in 1 ms
[2024-05-29 03:38:31] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 96/99 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 24/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 137/236 variables, 94/121 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 43/165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 6/242 variables, 2/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 6/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/242 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 173 constraints, problems are : Problem set: 0 solved, 3 unsolved in 201 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 103/103 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 96/99 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 24/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 137/236 variables, 94/121 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 43/165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 3/168 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 6/242 variables, 2/170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 6/176 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/242 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/242 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 242/242 variables, and 176 constraints, problems are : Problem set: 0 solved, 3 unsolved in 388 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 103/103 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 601ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 18496 ms.
Support contains 3 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 139/139 transitions.
Applied a total of 0 rules in 3 ms. Remains 103 /103 variables (removed 0) and now considering 139/139 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 103/103 places, 139/139 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 139/139 transitions.
Applied a total of 0 rules in 3 ms. Remains 103 /103 variables (removed 0) and now considering 139/139 (removed 0) transitions.
[2024-05-29 03:38:50] [INFO ] Invariant cache hit.
[2024-05-29 03:38:50] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-29 03:38:50] [INFO ] Invariant cache hit.
[2024-05-29 03:38:50] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-29 03:38:50] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 411 ms to find 0 implicit places.
[2024-05-29 03:38:50] [INFO ] Redundant transitions in 1 ms returned []
Running 138 sub problems to find dead transitions.
[2024-05-29 03:38:50] [INFO ] Invariant cache hit.
[2024-05-29 03:38:50] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (OVERLAPS) 139/242 variables, 103/106 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 67/173 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (OVERLAPS) 0/242 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 173 constraints, problems are : Problem set: 0 solved, 138 unsolved in 5476 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 103/103 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 138 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (OVERLAPS) 139/242 variables, 103/106 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 67/173 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 138/311 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (OVERLAPS) 0/242 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Int declared 242/242 variables, and 311 constraints, problems are : Problem set: 0 solved, 138 unsolved in 8368 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 103/103 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 0/0 constraints]
After SMT, in 13988ms problems are : Problem set: 0 solved, 138 unsolved
Search for dead transitions found 0 dead transitions in 13991ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14411 ms. Remains : 103/103 places, 139/139 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 103 transition count 132
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 97 transition count 132
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 13 place count 97 transition count 117
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 43 place count 82 transition count 117
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 57 place count 75 transition count 110
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 59 place count 74 transition count 119
Applied a total of 59 rules in 16 ms. Remains 74 /103 variables (removed 29) and now considering 119/139 (removed 20) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 119 rows 74 cols
[2024-05-29 03:39:04] [INFO ] Computed 3 invariants in 1 ms
[2024-05-29 03:39:04] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-29 03:39:04] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 03:39:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-29 03:39:04] [INFO ] After 93ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-29 03:39:04] [INFO ] After 161ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-29 03:39:05] [INFO ] After 280ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 419 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X p2)), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 187 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 15 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 261 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1), false, false]
Stuttering acceptance computed with spot in 273 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1), false, false]
Support contains 5 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 141/141 transitions.
Applied a total of 0 rules in 5 ms. Remains 104 /104 variables (removed 0) and now considering 141/141 (removed 0) transitions.
// Phase 1: matrix 141 rows 104 cols
[2024-05-29 03:39:05] [INFO ] Computed 4 invariants in 1 ms
[2024-05-29 03:39:05] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-05-29 03:39:05] [INFO ] Invariant cache hit.
[2024-05-29 03:39:06] [INFO ] State equation strengthened by 69 read => feed constraints.
[2024-05-29 03:39:06] [INFO ] Implicit Places using invariants and state equation in 455 ms returned []
Implicit Place search using SMT with State Equation took 609 ms to find 0 implicit places.
[2024-05-29 03:39:06] [INFO ] Redundant transitions in 0 ms returned []
Running 140 sub problems to find dead transitions.
[2024-05-29 03:39:06] [INFO ] Invariant cache hit.
[2024-05-29 03:39:06] [INFO ] State equation strengthened by 69 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (OVERLAPS) 1/104 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (OVERLAPS) 141/245 variables, 104/108 constraints. Problems are: Problem set: 0 solved, 140 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 69/177 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 8 (OVERLAPS) 0/245 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Real declared 245/245 variables, and 177 constraints, problems are : Problem set: 0 solved, 140 unsolved in 7491 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (OVERLAPS) 1/104 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (OVERLAPS) 141/245 variables, 104/108 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 69/177 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 140/317 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 9 (OVERLAPS) 0/245 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Int declared 245/245 variables, and 317 constraints, problems are : Problem set: 0 solved, 140 unsolved in 12229 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 0/0 constraints]
After SMT, in 19934ms problems are : Problem set: 0 solved, 140 unsolved
Search for dead transitions found 0 dead transitions in 19937ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 20560 ms. Remains : 104/104 places, 141/141 transitions.
Computed a total of 17 stabilizing places and 23 stable transitions
Graph (complete) has 350 edges and 104 vertex of which 103 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 17 stabilizing places and 23 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X p0), (X (NOT (AND (NOT p2) p0 p1))), (X (AND p2 p0 p1)), (X p1), (X (X p2)), (X (X p0)), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (AND p2 p0 p1))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 188 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter insensitive) to 6 states, 15 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 293 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1), false, false]
RANDOM walk for 40000 steps (8969 resets) in 1043 ms. (38 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1847 resets) in 126 ms. (314 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (4111 resets) in 371 ms. (107 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1918 resets) in 219 ms. (181 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (4123 resets) in 347 ms. (114 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (4116 resets) in 237 ms. (168 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1905 resets) in 257 ms. (155 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 328086 steps, run timeout after 3007 ms. (steps per millisecond=109 ) properties seen :3 out of 6
Probabilistic random walk after 328086 steps, saw 141245 distinct states, run finished after 3008 ms. (steps per millisecond=109 ) properties seen :3
[2024-05-29 03:39:30] [INFO ] Invariant cache hit.
[2024-05-29 03:39:30] [INFO ] State equation strengthened by 69 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 60/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 11/74 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 4/78 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 124/202 variables, 78/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 52/134 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 43/245 variables, 26/160 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/245 variables, 17/177 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/245 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/245 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 245/245 variables, and 177 constraints, problems are : Problem set: 0 solved, 3 unsolved in 229 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 60/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 11/74 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 4/78 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 124/202 variables, 78/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 52/134 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 43/245 variables, 26/160 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/245 variables, 17/177 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/245 variables, 3/180 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/245 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/245 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 245/245 variables, and 180 constraints, problems are : Problem set: 0 solved, 3 unsolved in 483 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 731ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 13716 ms.
Support contains 3 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 141/141 transitions.
Graph (complete) has 314 edges and 104 vertex of which 103 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 103 transition count 139
Applied a total of 3 rules in 4 ms. Remains 103 /104 variables (removed 1) and now considering 139/141 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 103/104 places, 139/141 transitions.
RANDOM walk for 40000 steps (8971 resets) in 467 ms. (85 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1898 resets) in 117 ms. (339 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1840 resets) in 158 ms. (251 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1859 resets) in 58 ms. (678 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 385583 steps, run timeout after 3003 ms. (steps per millisecond=128 ) properties seen :0 out of 3
Probabilistic random walk after 385583 steps, saw 166549 distinct states, run finished after 3003 ms. (steps per millisecond=128 ) properties seen :0
// Phase 1: matrix 139 rows 103 cols
[2024-05-29 03:39:48] [INFO ] Computed 3 invariants in 1 ms
[2024-05-29 03:39:48] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 96/99 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 24/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 137/236 variables, 94/121 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 43/165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 6/242 variables, 2/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 6/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/242 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 173 constraints, problems are : Problem set: 0 solved, 3 unsolved in 208 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 103/103 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 96/99 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 24/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 137/236 variables, 94/121 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 43/165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 3/168 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 6/242 variables, 2/170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 6/176 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/242 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/242 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 242/242 variables, and 176 constraints, problems are : Problem set: 0 solved, 3 unsolved in 383 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 103/103 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 610ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 19077 ms.
Support contains 3 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 139/139 transitions.
Applied a total of 0 rules in 6 ms. Remains 103 /103 variables (removed 0) and now considering 139/139 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 103/103 places, 139/139 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 139/139 transitions.
Applied a total of 0 rules in 3 ms. Remains 103 /103 variables (removed 0) and now considering 139/139 (removed 0) transitions.
[2024-05-29 03:40:08] [INFO ] Invariant cache hit.
[2024-05-29 03:40:08] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-29 03:40:08] [INFO ] Invariant cache hit.
[2024-05-29 03:40:08] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-29 03:40:08] [INFO ] Implicit Places using invariants and state equation in 308 ms returned []
Implicit Place search using SMT with State Equation took 412 ms to find 0 implicit places.
[2024-05-29 03:40:08] [INFO ] Redundant transitions in 1 ms returned []
Running 138 sub problems to find dead transitions.
[2024-05-29 03:40:08] [INFO ] Invariant cache hit.
[2024-05-29 03:40:08] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (OVERLAPS) 139/242 variables, 103/106 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 67/173 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (OVERLAPS) 0/242 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 173 constraints, problems are : Problem set: 0 solved, 138 unsolved in 6527 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 103/103 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 138 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (OVERLAPS) 139/242 variables, 103/106 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 67/173 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 138/311 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (OVERLAPS) 0/242 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Int declared 242/242 variables, and 311 constraints, problems are : Problem set: 0 solved, 138 unsolved in 11167 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 103/103 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 0/0 constraints]
After SMT, in 17833ms problems are : Problem set: 0 solved, 138 unsolved
Search for dead transitions found 0 dead transitions in 17834ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18256 ms. Remains : 103/103 places, 139/139 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 103 transition count 132
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 97 transition count 132
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 13 place count 97 transition count 117
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 43 place count 82 transition count 117
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 57 place count 75 transition count 110
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 59 place count 74 transition count 119
Applied a total of 59 rules in 6 ms. Remains 74 /103 variables (removed 29) and now considering 119/139 (removed 20) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 119 rows 74 cols
[2024-05-29 03:40:26] [INFO ] Computed 3 invariants in 1 ms
[2024-05-29 03:40:26] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-29 03:40:26] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 03:40:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-29 03:40:26] [INFO ] After 138ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-29 03:40:27] [INFO ] After 243ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-29 03:40:27] [INFO ] After 389ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 501 ms.
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X p0), (X (NOT (AND (NOT p2) p0 p1))), (X (AND p2 p0 p1)), (X p1), (X (X p2)), (X (X p0)), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (AND p2 p0 p1))), (X (X p1))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT (AND p1 p2 p0))), (F (NOT (OR (NOT p1) p2 (NOT p0))))]
Knowledge based reduction with 11 factoid took 390 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter insensitive) to 6 states, 15 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 330 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1), false, false]
Stuttering acceptance computed with spot in 326 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1), false, false]
Stuttering acceptance computed with spot in 325 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1), false, false]
Product exploration explored 100000 steps with 22489 reset in 307 ms.
Product exploration explored 100000 steps with 22321 reset in 323 ms.
Built C files in :
/tmp/ltsmin1937191472627557796
[2024-05-29 03:40:29] [INFO ] Computing symmetric may disable matrix : 141 transitions.
[2024-05-29 03:40:29] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 03:40:29] [INFO ] Computing symmetric may enable matrix : 141 transitions.
[2024-05-29 03:40:29] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 03:40:29] [INFO ] Computing Do-Not-Accords matrix : 141 transitions.
[2024-05-29 03:40:29] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 03:40:29] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1937191472627557796
Running compilation step : cd /tmp/ltsmin1937191472627557796;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 773 ms.
Running link step : cd /tmp/ltsmin1937191472627557796;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin1937191472627557796;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8163186235762416471.hoa' '--buchi-type=spotba'
LTSmin run took 5345 ms.
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLFireability-10 finished in 182804 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0))||G(p1))))'
Support contains 3 out of 178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 492/492 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 156 transition count 231
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 156 transition count 231
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 66 place count 134 transition count 209
Iterating global reduction 0 with 22 rules applied. Total rules applied 88 place count 134 transition count 209
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 105 place count 134 transition count 192
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 116 place count 123 transition count 171
Iterating global reduction 1 with 11 rules applied. Total rules applied 127 place count 123 transition count 171
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 133 place count 123 transition count 165
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 136 place count 120 transition count 162
Iterating global reduction 2 with 3 rules applied. Total rules applied 139 place count 120 transition count 162
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 142 place count 117 transition count 159
Iterating global reduction 2 with 3 rules applied. Total rules applied 145 place count 117 transition count 159
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 147 place count 115 transition count 157
Iterating global reduction 2 with 2 rules applied. Total rules applied 149 place count 115 transition count 157
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 151 place count 113 transition count 155
Iterating global reduction 2 with 2 rules applied. Total rules applied 153 place count 113 transition count 155
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 154 place count 112 transition count 152
Iterating global reduction 2 with 1 rules applied. Total rules applied 155 place count 112 transition count 152
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 156 place count 111 transition count 151
Iterating global reduction 2 with 1 rules applied. Total rules applied 157 place count 111 transition count 151
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 158 place count 110 transition count 150
Iterating global reduction 2 with 1 rules applied. Total rules applied 159 place count 110 transition count 150
Applied a total of 159 rules in 12 ms. Remains 110 /178 variables (removed 68) and now considering 150/492 (removed 342) transitions.
// Phase 1: matrix 150 rows 110 cols
[2024-05-29 03:40:35] [INFO ] Computed 4 invariants in 1 ms
[2024-05-29 03:40:35] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-29 03:40:35] [INFO ] Invariant cache hit.
[2024-05-29 03:40:35] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-29 03:40:35] [INFO ] Implicit Places using invariants and state equation in 345 ms returned []
Implicit Place search using SMT with State Equation took 435 ms to find 0 implicit places.
Running 149 sub problems to find dead transitions.
[2024-05-29 03:40:35] [INFO ] Invariant cache hit.
[2024-05-29 03:40:35] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (OVERLAPS) 1/110 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 149 unsolved
[2024-05-29 03:40:38] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 149 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD133 is UNSAT
At refinement iteration 6 (OVERLAPS) 150/260 variables, 110/115 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/260 variables, 74/189 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/260 variables, 0/189 constraints. Problems are: Problem set: 3 solved, 146 unsolved
[2024-05-29 03:40:43] [INFO ] Deduced a trap composed of 35 places in 77 ms of which 2 ms to minimize.
[2024-05-29 03:40:43] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/260 variables, 2/191 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/260 variables, 0/191 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 11 (OVERLAPS) 0/260 variables, 0/191 constraints. Problems are: Problem set: 3 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 260/260 variables, and 191 constraints, problems are : Problem set: 3 solved, 146 unsolved in 12084 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 110/110 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 3 solved, 146 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 1/107 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 5 (OVERLAPS) 1/108 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 3/7 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 8 (OVERLAPS) 149/257 variables, 108/115 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/257 variables, 73/188 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/257 variables, 28/216 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/257 variables, 0/216 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 12 (OVERLAPS) 3/260 variables, 2/218 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/260 variables, 1/219 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/260 variables, 118/337 constraints. Problems are: Problem set: 3 solved, 146 unsolved
[2024-05-29 03:40:55] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 1 ms to minimize.
Problem TDEAD136 is UNSAT
At refinement iteration 15 (INCLUDED_ONLY) 0/260 variables, 1/338 constraints. Problems are: Problem set: 4 solved, 145 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/260 variables, 0/338 constraints. Problems are: Problem set: 4 solved, 145 unsolved
At refinement iteration 17 (OVERLAPS) 0/260 variables, 0/338 constraints. Problems are: Problem set: 4 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Int declared 260/260 variables, and 338 constraints, problems are : Problem set: 4 solved, 145 unsolved in 18074 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 110/110 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 146/149 constraints, Known Traps: 4/4 constraints]
After SMT, in 30423ms problems are : Problem set: 4 solved, 145 unsolved
Search for dead transitions found 4 dead transitions in 30429ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in LTL mode, iteration 1 : 110/178 places, 146/492 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 106 transition count 146
Applied a total of 4 rules in 2 ms. Remains 106 /110 variables (removed 4) and now considering 146/146 (removed 0) transitions.
// Phase 1: matrix 146 rows 106 cols
[2024-05-29 03:41:06] [INFO ] Computed 4 invariants in 1 ms
[2024-05-29 03:41:06] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-05-29 03:41:06] [INFO ] Invariant cache hit.
[2024-05-29 03:41:06] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-29 03:41:06] [INFO ] Implicit Places using invariants and state equation in 567 ms returned []
Implicit Place search using SMT with State Equation took 695 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 106/178 places, 146/492 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31573 ms. Remains : 106/178 places, 146/492 transitions.
Stuttering acceptance computed with spot in 187 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLFireability-11
Product exploration explored 100000 steps with 33333 reset in 163 ms.
Product exploration explored 100000 steps with 33333 reset in 172 ms.
Computed a total of 17 stabilizing places and 23 stable transitions
Graph (complete) has 358 edges and 106 vertex of which 105 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 17 stabilizing places and 23 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 20 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLFireability-11 finished in 32138 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 178 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 178/178 places, 492/492 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 155 transition count 216
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 155 transition count 216
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 69 place count 132 transition count 193
Iterating global reduction 0 with 23 rules applied. Total rules applied 92 place count 132 transition count 193
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 107 place count 132 transition count 178
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 119 place count 120 transition count 155
Iterating global reduction 1 with 12 rules applied. Total rules applied 131 place count 120 transition count 155
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 138 place count 120 transition count 148
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 142 place count 116 transition count 144
Iterating global reduction 2 with 4 rules applied. Total rules applied 146 place count 116 transition count 144
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 150 place count 112 transition count 140
Iterating global reduction 2 with 4 rules applied. Total rules applied 154 place count 112 transition count 140
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 157 place count 109 transition count 137
Iterating global reduction 2 with 3 rules applied. Total rules applied 160 place count 109 transition count 137
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 162 place count 109 transition count 135
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 165 place count 106 transition count 132
Iterating global reduction 3 with 3 rules applied. Total rules applied 168 place count 106 transition count 132
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 169 place count 105 transition count 129
Iterating global reduction 3 with 1 rules applied. Total rules applied 170 place count 105 transition count 129
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 171 place count 104 transition count 128
Iterating global reduction 3 with 1 rules applied. Total rules applied 172 place count 104 transition count 128
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 173 place count 103 transition count 127
Iterating global reduction 3 with 1 rules applied. Total rules applied 174 place count 103 transition count 127
Applied a total of 174 rules in 23 ms. Remains 103 /178 variables (removed 75) and now considering 127/492 (removed 365) transitions.
// Phase 1: matrix 127 rows 103 cols
[2024-05-29 03:41:07] [INFO ] Computed 4 invariants in 1 ms
[2024-05-29 03:41:07] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-05-29 03:41:07] [INFO ] Invariant cache hit.
[2024-05-29 03:41:07] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-29 03:41:08] [INFO ] Implicit Places using invariants and state equation in 403 ms returned []
Implicit Place search using SMT with State Equation took 524 ms to find 0 implicit places.
[2024-05-29 03:41:08] [INFO ] Redundant transitions in 0 ms returned []
Running 126 sub problems to find dead transitions.
[2024-05-29 03:41:08] [INFO ] Invariant cache hit.
[2024-05-29 03:41:08] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-29 03:41:10] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 126 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD112 is UNSAT
At refinement iteration 6 (OVERLAPS) 127/230 variables, 103/108 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/230 variables, 56/164 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 0/164 constraints. Problems are: Problem set: 3 solved, 123 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/230 variables, 0/164 constraints. Problems are: Problem set: 3 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 230/230 variables, and 164 constraints, problems are : Problem set: 3 solved, 123 unsolved in 6602 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 103/103 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 3 solved, 123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 2 (OVERLAPS) 1/100 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 5 (OVERLAPS) 1/101 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 8 (OVERLAPS) 126/227 variables, 101/106 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/227 variables, 55/161 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 26/187 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/227 variables, 0/187 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 12 (OVERLAPS) 3/230 variables, 2/189 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/230 variables, 1/190 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/230 variables, 97/287 constraints. Problems are: Problem set: 3 solved, 123 unsolved
[2024-05-29 03:41:21] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
Problem TDEAD115 is UNSAT
At refinement iteration 15 (INCLUDED_ONLY) 0/230 variables, 1/288 constraints. Problems are: Problem set: 4 solved, 122 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/230 variables, 0/288 constraints. Problems are: Problem set: 4 solved, 122 unsolved
At refinement iteration 17 (OVERLAPS) 0/230 variables, 0/288 constraints. Problems are: Problem set: 4 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 230/230 variables, and 288 constraints, problems are : Problem set: 4 solved, 122 unsolved in 14431 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 103/103 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 123/126 constraints, Known Traps: 2/2 constraints]
After SMT, in 21156ms problems are : Problem set: 4 solved, 122 unsolved
Search for dead transitions found 4 dead transitions in 21158ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 103/178 places, 123/492 transitions.
Graph (complete) has 327 edges and 103 vertex of which 99 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 99 /103 variables (removed 4) and now considering 123/123 (removed 0) transitions.
// Phase 1: matrix 123 rows 99 cols
[2024-05-29 03:41:29] [INFO ] Computed 4 invariants in 1 ms
[2024-05-29 03:41:29] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-29 03:41:29] [INFO ] Invariant cache hit.
[2024-05-29 03:41:29] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-29 03:41:29] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 99/178 places, 123/492 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 22066 ms. Remains : 99/178 places, 123/492 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLFireability-12
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLFireability-12 finished in 22154 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 178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 492/492 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 155 transition count 216
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 155 transition count 216
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 69 place count 132 transition count 193
Iterating global reduction 0 with 23 rules applied. Total rules applied 92 place count 132 transition count 193
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 107 place count 132 transition count 178
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 119 place count 120 transition count 155
Iterating global reduction 1 with 12 rules applied. Total rules applied 131 place count 120 transition count 155
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 138 place count 120 transition count 148
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 142 place count 116 transition count 144
Iterating global reduction 2 with 4 rules applied. Total rules applied 146 place count 116 transition count 144
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 150 place count 112 transition count 140
Iterating global reduction 2 with 4 rules applied. Total rules applied 154 place count 112 transition count 140
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 157 place count 109 transition count 137
Iterating global reduction 2 with 3 rules applied. Total rules applied 160 place count 109 transition count 137
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 162 place count 109 transition count 135
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 165 place count 106 transition count 132
Iterating global reduction 3 with 3 rules applied. Total rules applied 168 place count 106 transition count 132
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 169 place count 105 transition count 129
Iterating global reduction 3 with 1 rules applied. Total rules applied 170 place count 105 transition count 129
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 171 place count 104 transition count 128
Iterating global reduction 3 with 1 rules applied. Total rules applied 172 place count 104 transition count 128
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 173 place count 103 transition count 127
Iterating global reduction 3 with 1 rules applied. Total rules applied 174 place count 103 transition count 127
Applied a total of 174 rules in 11 ms. Remains 103 /178 variables (removed 75) and now considering 127/492 (removed 365) transitions.
// Phase 1: matrix 127 rows 103 cols
[2024-05-29 03:41:29] [INFO ] Computed 4 invariants in 1 ms
[2024-05-29 03:41:29] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-05-29 03:41:29] [INFO ] Invariant cache hit.
[2024-05-29 03:41:29] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-29 03:41:30] [INFO ] Implicit Places using invariants and state equation in 433 ms returned []
Implicit Place search using SMT with State Equation took 534 ms to find 0 implicit places.
Running 126 sub problems to find dead transitions.
[2024-05-29 03:41:30] [INFO ] Invariant cache hit.
[2024-05-29 03:41:30] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-29 03:41:32] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 126 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD112 is UNSAT
At refinement iteration 6 (OVERLAPS) 127/230 variables, 103/108 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/230 variables, 56/164 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 0/164 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 9 (OVERLAPS) 0/230 variables, 0/164 constraints. Problems are: Problem set: 3 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 230/230 variables, and 164 constraints, problems are : Problem set: 3 solved, 123 unsolved in 8122 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 103/103 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 3 solved, 123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 2 (OVERLAPS) 1/100 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 5 (OVERLAPS) 1/101 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 8 (OVERLAPS) 126/227 variables, 101/106 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/227 variables, 55/161 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 26/187 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/227 variables, 0/187 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 12 (OVERLAPS) 3/230 variables, 2/189 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/230 variables, 1/190 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/230 variables, 97/287 constraints. Problems are: Problem set: 3 solved, 123 unsolved
[2024-05-29 03:41:45] [INFO ] Deduced a trap composed of 23 places in 22 ms of which 0 ms to minimize.
Problem TDEAD115 is UNSAT
At refinement iteration 15 (INCLUDED_ONLY) 0/230 variables, 1/288 constraints. Problems are: Problem set: 4 solved, 122 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/230 variables, 0/288 constraints. Problems are: Problem set: 4 solved, 122 unsolved
At refinement iteration 17 (OVERLAPS) 0/230 variables, 0/288 constraints. Problems are: Problem set: 4 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 230/230 variables, and 288 constraints, problems are : Problem set: 4 solved, 122 unsolved in 15887 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 103/103 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 123/126 constraints, Known Traps: 2/2 constraints]
After SMT, in 24207ms problems are : Problem set: 4 solved, 122 unsolved
Search for dead transitions found 4 dead transitions in 24210ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in LTL mode, iteration 1 : 103/178 places, 123/492 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 99 transition count 123
Applied a total of 4 rules in 1 ms. Remains 99 /103 variables (removed 4) and now considering 123/123 (removed 0) transitions.
// Phase 1: matrix 123 rows 99 cols
[2024-05-29 03:41:54] [INFO ] Computed 4 invariants in 1 ms
[2024-05-29 03:41:54] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-29 03:41:54] [INFO ] Invariant cache hit.
[2024-05-29 03:41:54] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-29 03:41:54] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 99/178 places, 123/492 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 25090 ms. Remains : 99/178 places, 123/492 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLFireability-13
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLFireability-13 finished in 25181 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||F(p1)))))'
Support contains 4 out of 178 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 178/178 places, 492/492 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 156 transition count 217
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 156 transition count 217
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 66 place count 134 transition count 195
Iterating global reduction 0 with 22 rules applied. Total rules applied 88 place count 134 transition count 195
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 101 place count 134 transition count 182
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 113 place count 122 transition count 159
Iterating global reduction 1 with 12 rules applied. Total rules applied 125 place count 122 transition count 159
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 132 place count 122 transition count 152
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 136 place count 118 transition count 148
Iterating global reduction 2 with 4 rules applied. Total rules applied 140 place count 118 transition count 148
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 144 place count 114 transition count 144
Iterating global reduction 2 with 4 rules applied. Total rules applied 148 place count 114 transition count 144
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 151 place count 111 transition count 141
Iterating global reduction 2 with 3 rules applied. Total rules applied 154 place count 111 transition count 141
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 156 place count 111 transition count 139
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 159 place count 108 transition count 136
Iterating global reduction 3 with 3 rules applied. Total rules applied 162 place count 108 transition count 136
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 163 place count 107 transition count 133
Iterating global reduction 3 with 1 rules applied. Total rules applied 164 place count 107 transition count 133
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 165 place count 106 transition count 132
Iterating global reduction 3 with 1 rules applied. Total rules applied 166 place count 106 transition count 132
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 167 place count 105 transition count 131
Iterating global reduction 3 with 1 rules applied. Total rules applied 168 place count 105 transition count 131
Applied a total of 168 rules in 28 ms. Remains 105 /178 variables (removed 73) and now considering 131/492 (removed 361) transitions.
// Phase 1: matrix 131 rows 105 cols
[2024-05-29 03:41:54] [INFO ] Computed 4 invariants in 1 ms
[2024-05-29 03:41:55] [INFO ] Implicit Places using invariants in 150 ms returned []
[2024-05-29 03:41:55] [INFO ] Invariant cache hit.
[2024-05-29 03:41:55] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-29 03:41:55] [INFO ] Implicit Places using invariants and state equation in 354 ms returned []
Implicit Place search using SMT with State Equation took 507 ms to find 0 implicit places.
[2024-05-29 03:41:55] [INFO ] Redundant transitions in 0 ms returned []
Running 130 sub problems to find dead transitions.
[2024-05-29 03:41:55] [INFO ] Invariant cache hit.
[2024-05-29 03:41:55] [INFO ] State equation strengthened by 58 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-05-29 03:41:56] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 130 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD115 is UNSAT
At refinement iteration 6 (OVERLAPS) 131/236 variables, 105/110 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 58/168 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 0/168 constraints. Problems are: Problem set: 3 solved, 127 unsolved
[2024-05-29 03:41:59] [INFO ] Deduced a trap composed of 33 places in 83 ms of which 2 ms to minimize.
[2024-05-29 03:41:59] [INFO ] Deduced a trap composed of 31 places in 103 ms of which 3 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/236 variables, 2/170 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 0/170 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 11 (OVERLAPS) 0/236 variables, 0/170 constraints. Problems are: Problem set: 3 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Real declared 236/236 variables, and 170 constraints, problems are : Problem set: 3 solved, 127 unsolved in 6221 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 105/105 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 3 solved, 127 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 2 (OVERLAPS) 1/102 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 5 (OVERLAPS) 1/103 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 3/7 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 8 (OVERLAPS) 130/233 variables, 103/110 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/233 variables, 57/167 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/233 variables, 27/194 constraints. Problems are: Problem set: 3 solved, 127 unsolved
[2024-05-29 03:42:05] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/233 variables, 1/195 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/233 variables, 0/195 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 13 (OVERLAPS) 3/236 variables, 2/197 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/236 variables, 1/198 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/236 variables, 100/298 constraints. Problems are: Problem set: 3 solved, 127 unsolved
[2024-05-29 03:42:11] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 0 ms to minimize.
Problem TDEAD118 is UNSAT
At refinement iteration 16 (INCLUDED_ONLY) 0/236 variables, 1/299 constraints. Problems are: Problem set: 4 solved, 126 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/236 variables, 0/299 constraints. Problems are: Problem set: 4 solved, 126 unsolved
At refinement iteration 18 (OVERLAPS) 0/236 variables, 0/299 constraints. Problems are: Problem set: 4 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Int declared 236/236 variables, and 299 constraints, problems are : Problem set: 4 solved, 126 unsolved in 19132 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 105/105 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 127/130 constraints, Known Traps: 5/5 constraints]
After SMT, in 25480ms problems are : Problem set: 4 solved, 126 unsolved
Search for dead transitions found 4 dead transitions in 25482ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 105/178 places, 127/492 transitions.
Graph (complete) has 335 edges and 105 vertex of which 101 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 101 /105 variables (removed 4) and now considering 127/127 (removed 0) transitions.
// Phase 1: matrix 127 rows 101 cols
[2024-05-29 03:42:20] [INFO ] Computed 4 invariants in 1 ms
[2024-05-29 03:42:20] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-29 03:42:20] [INFO ] Invariant cache hit.
[2024-05-29 03:42:21] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-29 03:42:21] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 101/178 places, 127/492 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 26369 ms. Remains : 101/178 places, 127/492 transitions.
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLFireability-14
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLFireability-14 finished in 26458 ms.
All properties solved by simple procedures.
Total runtime 853997 ms.
BK_STOP 1716954141375
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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="SieveSingleMsgMbox-PT-d2m96"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is SieveSingleMsgMbox-PT-d2m96, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r378-smll-171683810800140"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d2m96.tgz
mv SieveSingleMsgMbox-PT-d2m96 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;