About the Execution of GreatSPN+red for Peterson-PT-3
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 524.363 | 248789.00 | 305590.00 | 978.50 | FFFFFFFFFFFFFTFF | 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.r267-smll-171654406000260.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is Peterson-PT-3, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r267-smll-171654406000260
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 27K Apr 12 02:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 143K Apr 12 02:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 27K Apr 12 02:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 134K Apr 12 02:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 17K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 108K Apr 12 02:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 511K Apr 12 02:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 71K Apr 12 02:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 344K Apr 12 02:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.5K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 12K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 143K 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 Peterson-PT-3-LTLFireability-00
FORMULA_NAME Peterson-PT-3-LTLFireability-01
FORMULA_NAME Peterson-PT-3-LTLFireability-02
FORMULA_NAME Peterson-PT-3-LTLFireability-03
FORMULA_NAME Peterson-PT-3-LTLFireability-04
FORMULA_NAME Peterson-PT-3-LTLFireability-05
FORMULA_NAME Peterson-PT-3-LTLFireability-06
FORMULA_NAME Peterson-PT-3-LTLFireability-07
FORMULA_NAME Peterson-PT-3-LTLFireability-08
FORMULA_NAME Peterson-PT-3-LTLFireability-09
FORMULA_NAME Peterson-PT-3-LTLFireability-10
FORMULA_NAME Peterson-PT-3-LTLFireability-11
FORMULA_NAME Peterson-PT-3-LTLFireability-12
FORMULA_NAME Peterson-PT-3-LTLFireability-13
FORMULA_NAME Peterson-PT-3-LTLFireability-14
FORMULA_NAME Peterson-PT-3-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716768490312
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-PT-3
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 00:08:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-27 00:08:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 00:08:12] [INFO ] Load time of PNML (sax parser for PT used): 135 ms
[2024-05-27 00:08:12] [INFO ] Transformed 244 places.
[2024-05-27 00:08:12] [INFO ] Transformed 332 transitions.
[2024-05-27 00:08:12] [INFO ] Found NUPN structural information;
[2024-05-27 00:08:12] [INFO ] Parsed PT model containing 244 places and 332 transitions and 1016 arcs in 313 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 166 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Peterson-PT-3-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-3-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 222 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 26 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-05-27 00:08:12] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2024-05-27 00:08:13] [INFO ] Computed 15 invariants in 22 ms
[2024-05-27 00:08:13] [INFO ] Implicit Places using invariants in 488 ms returned []
[2024-05-27 00:08:13] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-27 00:08:13] [INFO ] Invariant cache hit.
[2024-05-27 00:08:13] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-27 00:08:13] [INFO ] Implicit Places using invariants and state equation in 471 ms returned []
Implicit Place search using SMT with State Equation took 1007 ms to find 0 implicit places.
Running 328 sub problems to find dead transitions.
[2024-05-27 00:08:14] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-27 00:08:14] [INFO ] Invariant cache hit.
[2024-05-27 00:08:14] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 240/240 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 5/245 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 2/247 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-27 00:08:16] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 14 ms to minimize.
[2024-05-27 00:08:18] [INFO ] Deduced a trap composed of 89 places in 73 ms of which 3 ms to minimize.
[2024-05-27 00:08:18] [INFO ] Deduced a trap composed of 97 places in 82 ms of which 2 ms to minimize.
[2024-05-27 00:08:18] [INFO ] Deduced a trap composed of 53 places in 60 ms of which 1 ms to minimize.
[2024-05-27 00:08:19] [INFO ] Deduced a trap composed of 38 places in 73 ms of which 1 ms to minimize.
[2024-05-27 00:08:19] [INFO ] Deduced a trap composed of 35 places in 65 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 6/253 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-27 00:08:24] [INFO ] Deduced a trap composed of 50 places in 102 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-27 00:08:25] [INFO ] Deduced a trap composed of 53 places in 70 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 7 (OVERLAPS) 4/244 variables, 6/261 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 4/265 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/244 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-27 00:08:32] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 3 ms to minimize.
[2024-05-27 00:08:32] [INFO ] Deduced a trap composed of 34 places in 78 ms of which 2 ms to minimize.
[2024-05-27 00:08:32] [INFO ] Deduced a trap composed of 52 places in 84 ms of which 2 ms to minimize.
[2024-05-27 00:08:32] [INFO ] Deduced a trap composed of 34 places in 84 ms of which 1 ms to minimize.
[2024-05-27 00:08:32] [INFO ] Deduced a trap composed of 52 places in 64 ms of which 4 ms to minimize.
[2024-05-27 00:08:32] [INFO ] Deduced a trap composed of 49 places in 93 ms of which 1 ms to minimize.
[2024-05-27 00:08:33] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 2 ms to minimize.
[2024-05-27 00:08:33] [INFO ] Deduced a trap composed of 45 places in 130 ms of which 3 ms to minimize.
[2024-05-27 00:08:33] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 2 ms to minimize.
[2024-05-27 00:08:33] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 2 ms to minimize.
[2024-05-27 00:08:33] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 3 ms to minimize.
[2024-05-27 00:08:33] [INFO ] Deduced a trap composed of 12 places in 135 ms of which 2 ms to minimize.
[2024-05-27 00:08:33] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 2 ms to minimize.
[2024-05-27 00:08:33] [INFO ] Deduced a trap composed of 45 places in 95 ms of which 3 ms to minimize.
[2024-05-27 00:08:33] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 2 ms to minimize.
[2024-05-27 00:08:34] [INFO ] Deduced a trap composed of 38 places in 68 ms of which 2 ms to minimize.
[2024-05-27 00:08:34] [INFO ] Deduced a trap composed of 38 places in 65 ms of which 1 ms to minimize.
[2024-05-27 00:08:34] [INFO ] Deduced a trap composed of 27 places in 133 ms of which 2 ms to minimize.
[2024-05-27 00:08:34] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 3 ms to minimize.
[2024-05-27 00:08:34] [INFO ] Deduced a trap composed of 29 places in 97 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/244 variables, 20/287 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-27 00:08:35] [INFO ] Deduced a trap composed of 31 places in 125 ms of which 3 ms to minimize.
[2024-05-27 00:08:35] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 2 ms to minimize.
[2024-05-27 00:08:35] [INFO ] Deduced a trap composed of 37 places in 88 ms of which 3 ms to minimize.
[2024-05-27 00:08:35] [INFO ] Deduced a trap composed of 56 places in 70 ms of which 2 ms to minimize.
[2024-05-27 00:08:35] [INFO ] Deduced a trap composed of 81 places in 67 ms of which 2 ms to minimize.
[2024-05-27 00:08:35] [INFO ] Deduced a trap composed of 83 places in 71 ms of which 2 ms to minimize.
[2024-05-27 00:08:35] [INFO ] Deduced a trap composed of 48 places in 81 ms of which 7 ms to minimize.
[2024-05-27 00:08:35] [INFO ] Deduced a trap composed of 45 places in 51 ms of which 2 ms to minimize.
[2024-05-27 00:08:36] [INFO ] Deduced a trap composed of 30 places in 83 ms of which 2 ms to minimize.
[2024-05-27 00:08:36] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 2 ms to minimize.
[2024-05-27 00:08:36] [INFO ] Deduced a trap composed of 61 places in 116 ms of which 3 ms to minimize.
[2024-05-27 00:08:36] [INFO ] Deduced a trap composed of 56 places in 87 ms of which 3 ms to minimize.
[2024-05-27 00:08:36] [INFO ] Deduced a trap composed of 26 places in 101 ms of which 2 ms to minimize.
[2024-05-27 00:08:36] [INFO ] Deduced a trap composed of 49 places in 78 ms of which 2 ms to minimize.
[2024-05-27 00:08:36] [INFO ] Deduced a trap composed of 73 places in 103 ms of which 2 ms to minimize.
[2024-05-27 00:08:36] [INFO ] Deduced a trap composed of 74 places in 78 ms of which 2 ms to minimize.
[2024-05-27 00:08:37] [INFO ] Deduced a trap composed of 49 places in 66 ms of which 2 ms to minimize.
[2024-05-27 00:08:37] [INFO ] Deduced a trap composed of 49 places in 72 ms of which 2 ms to minimize.
[2024-05-27 00:08:37] [INFO ] Deduced a trap composed of 56 places in 69 ms of which 2 ms to minimize.
[2024-05-27 00:08:37] [INFO ] Deduced a trap composed of 86 places in 81 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/244 variables, 20/307 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-27 00:08:38] [INFO ] Deduced a trap composed of 45 places in 59 ms of which 2 ms to minimize.
[2024-05-27 00:08:38] [INFO ] Deduced a trap composed of 56 places in 66 ms of which 2 ms to minimize.
[2024-05-27 00:08:38] [INFO ] Deduced a trap composed of 69 places in 69 ms of which 2 ms to minimize.
[2024-05-27 00:08:38] [INFO ] Deduced a trap composed of 73 places in 76 ms of which 1 ms to minimize.
[2024-05-27 00:08:38] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 1 ms to minimize.
[2024-05-27 00:08:39] [INFO ] Deduced a trap composed of 30 places in 85 ms of which 2 ms to minimize.
[2024-05-27 00:08:39] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 2 ms to minimize.
[2024-05-27 00:08:39] [INFO ] Deduced a trap composed of 38 places in 83 ms of which 2 ms to minimize.
[2024-05-27 00:08:39] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 7 ms to minimize.
[2024-05-27 00:08:40] [INFO ] Deduced a trap composed of 42 places in 57 ms of which 2 ms to minimize.
[2024-05-27 00:08:40] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 2 ms to minimize.
[2024-05-27 00:08:40] [INFO ] Deduced a trap composed of 50 places in 76 ms of which 2 ms to minimize.
[2024-05-27 00:08:41] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 12 (INCLUDED_ONLY) 0/244 variables, 13/320 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 244/552 variables, and 320 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30044 ms.
Refiners :[Domain max(s): 244/244 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/244 constraints, ReadFeed: 0/57 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 61/61 constraints]
Escalating to Integer solving :Problem set: 0 solved, 328 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 240/240 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 5/245 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 2/247 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 59/306 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 5 (OVERLAPS) 4/244 variables, 6/312 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 4/316 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/244 variables, 2/318 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 2/320 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-27 00:08:49] [INFO ] Deduced a trap composed of 68 places in 74 ms of which 3 ms to minimize.
[2024-05-27 00:08:49] [INFO ] Deduced a trap composed of 49 places in 111 ms of which 2 ms to minimize.
[2024-05-27 00:08:50] [INFO ] Deduced a trap composed of 85 places in 84 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/244 variables, 3/323 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-27 00:08:53] [INFO ] Deduced a trap composed of 79 places in 76 ms of which 2 ms to minimize.
[2024-05-27 00:08:53] [INFO ] Deduced a trap composed of 74 places in 73 ms of which 2 ms to minimize.
[2024-05-27 00:08:54] [INFO ] Deduced a trap composed of 59 places in 109 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/244 variables, 3/326 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-27 00:08:56] [INFO ] Deduced a trap composed of 41 places in 57 ms of which 1 ms to minimize.
[2024-05-27 00:08:57] [INFO ] Deduced a trap composed of 44 places in 68 ms of which 2 ms to minimize.
[2024-05-27 00:08:57] [INFO ] Deduced a trap composed of 49 places in 56 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/244 variables, 3/329 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/244 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 13 (OVERLAPS) 308/552 variables, 244/573 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/552 variables, 57/630 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/552 variables, 328/958 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 552/552 variables, and 958 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30029 ms.
Refiners :[Domain max(s): 244/244 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 244/244 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 70/70 constraints]
After SMT, in 60294ms problems are : Problem set: 0 solved, 328 unsolved
Search for dead transitions found 0 dead transitions in 60335ms
Finished structural reductions in LTL mode , in 1 iterations and 61437 ms. Remains : 244/244 places, 332/332 transitions.
Support contains 222 out of 244 places after structural reductions.
[2024-05-27 00:09:14] [INFO ] Flatten gal took : 82 ms
[2024-05-27 00:09:14] [INFO ] Flatten gal took : 44 ms
[2024-05-27 00:09:14] [INFO ] Input system was already deterministic with 332 transitions.
Reduction of identical properties reduced properties to check from 27 to 25
RANDOM walk for 40000 steps (8 resets) in 2661 ms. (15 steps per ms) remains 5/25 properties
BEST_FIRST walk for 40004 steps (8 resets) in 411 ms. (97 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 54 ms. (727 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 5/5 properties
[2024-05-27 00:09:16] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-27 00:09:16] [INFO ] Invariant cache hit.
[2024-05-27 00:09:16] [INFO ] State equation strengthened by 57 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 214/230 variables, 8/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 214/240 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/230 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 2/232 variables, 2/242 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/232 variables, 2/244 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/232 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 308/540 variables, 232/476 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/540 variables, 57/533 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/540 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 12/552 variables, 12/545 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/552 variables, 12/557 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/552 variables, 3/560 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-27 00:09:16] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 2 ms to minimize.
[2024-05-27 00:09:16] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 1 ms to minimize.
[2024-05-27 00:09:16] [INFO ] Deduced a trap composed of 35 places in 98 ms of which 2 ms to minimize.
[2024-05-27 00:09:16] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 2 ms to minimize.
[2024-05-27 00:09:17] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/552 variables, 5/565 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/552 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 0/552 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 552/552 variables, and 565 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1239 ms.
Refiners :[Domain max(s): 244/244 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 244/244 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 214/230 variables, 8/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 214/240 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/230 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 2/232 variables, 2/242 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/232 variables, 2/244 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/232 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 308/540 variables, 232/476 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/540 variables, 57/533 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/540 variables, 4/537 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/540 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 12/552 variables, 12/549 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/552 variables, 12/561 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/552 variables, 3/564 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/552 variables, 1/565 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/552 variables, 5/570 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-27 00:09:17] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 3 ms to minimize.
[2024-05-27 00:09:18] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 2 ms to minimize.
[2024-05-27 00:09:18] [INFO ] Deduced a trap composed of 9 places in 126 ms of which 3 ms to minimize.
[2024-05-27 00:09:18] [INFO ] Deduced a trap composed of 45 places in 100 ms of which 2 ms to minimize.
[2024-05-27 00:09:18] [INFO ] Deduced a trap composed of 45 places in 84 ms of which 2 ms to minimize.
[2024-05-27 00:09:18] [INFO ] Deduced a trap composed of 37 places in 82 ms of which 2 ms to minimize.
[2024-05-27 00:09:18] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 3 ms to minimize.
[2024-05-27 00:09:18] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 3 ms to minimize.
[2024-05-27 00:09:18] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 2 ms to minimize.
[2024-05-27 00:09:19] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 3 ms to minimize.
[2024-05-27 00:09:19] [INFO ] Deduced a trap composed of 61 places in 98 ms of which 2 ms to minimize.
[2024-05-27 00:09:19] [INFO ] Deduced a trap composed of 49 places in 99 ms of which 2 ms to minimize.
[2024-05-27 00:09:19] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 2 ms to minimize.
[2024-05-27 00:09:19] [INFO ] Deduced a trap composed of 38 places in 95 ms of which 2 ms to minimize.
[2024-05-27 00:09:19] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 2 ms to minimize.
[2024-05-27 00:09:19] [INFO ] Deduced a trap composed of 41 places in 98 ms of which 2 ms to minimize.
[2024-05-27 00:09:19] [INFO ] Deduced a trap composed of 52 places in 90 ms of which 2 ms to minimize.
[2024-05-27 00:09:19] [INFO ] Deduced a trap composed of 49 places in 105 ms of which 3 ms to minimize.
[2024-05-27 00:09:20] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 2 ms to minimize.
[2024-05-27 00:09:20] [INFO ] Deduced a trap composed of 49 places in 58 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/552 variables, 20/590 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-27 00:09:20] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 1 ms to minimize.
[2024-05-27 00:09:20] [INFO ] Deduced a trap composed of 42 places in 56 ms of which 1 ms to minimize.
[2024-05-27 00:09:20] [INFO ] Deduced a trap composed of 49 places in 78 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/552 variables, 3/593 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-27 00:09:20] [INFO ] Deduced a trap composed of 56 places in 80 ms of which 2 ms to minimize.
[2024-05-27 00:09:20] [INFO ] Deduced a trap composed of 55 places in 83 ms of which 2 ms to minimize.
[2024-05-27 00:09:20] [INFO ] Deduced a trap composed of 34 places in 78 ms of which 2 ms to minimize.
[2024-05-27 00:09:21] [INFO ] Deduced a trap composed of 53 places in 70 ms of which 1 ms to minimize.
[2024-05-27 00:09:21] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 2 ms to minimize.
[2024-05-27 00:09:21] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/552 variables, 6/599 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-27 00:09:21] [INFO ] Deduced a trap composed of 55 places in 89 ms of which 2 ms to minimize.
[2024-05-27 00:09:21] [INFO ] Deduced a trap composed of 52 places in 93 ms of which 2 ms to minimize.
[2024-05-27 00:09:21] [INFO ] Deduced a trap composed of 56 places in 85 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/552 variables, 3/602 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/552 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-27 00:09:22] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 552/552 variables, and 603 constraints, problems are : Problem set: 0 solved, 5 unsolved in 5007 ms.
Refiners :[Domain max(s): 244/244 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 244/244 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 38/38 constraints]
After SMT, in 6259ms problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 16 out of 244 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 86 rules applied. Total rules applied 86 place count 244 transition count 246
Reduce places removed 86 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 89 rules applied. Total rules applied 175 place count 158 transition count 243
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 178 place count 155 transition count 243
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 45 Pre rules applied. Total rules applied 178 place count 155 transition count 198
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 268 place count 110 transition count 198
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 282 place count 103 transition count 191
Applied a total of 282 rules in 64 ms. Remains 103 /244 variables (removed 141) and now considering 191/332 (removed 141) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 103/244 places, 191/332 transitions.
RANDOM walk for 40000 steps (8 resets) in 520 ms. (76 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 4/4 properties
[2024-05-27 00:09:22] [INFO ] Flow matrix only has 167 transitions (discarded 24 similar events)
// Phase 1: matrix 167 rows 103 cols
[2024-05-27 00:09:22] [INFO ] Computed 15 invariants in 2 ms
[2024-05-27 00:09:22] [INFO ] State equation strengthened by 57 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 73/88 variables, 8/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 73/97 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 3/91 variables, 3/100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 3/103 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/91 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 167/258 variables, 91/194 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 57/251 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/258 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 12/270 variables, 12/263 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/270 variables, 12/275 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/270 variables, 3/278 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/270 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/270 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 270/270 variables, and 278 constraints, problems are : Problem set: 0 solved, 4 unsolved in 257 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 103/103 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 73/88 variables, 8/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 73/97 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 3/91 variables, 3/100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 3/103 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/91 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 167/258 variables, 91/194 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 57/251 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/258 variables, 3/254 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/258 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 12/270 variables, 12/266 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/270 variables, 12/278 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/270 variables, 3/281 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/270 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-27 00:09:23] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-05-27 00:09:23] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-05-27 00:09:23] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 2 ms to minimize.
[2024-05-27 00:09:23] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 1 ms to minimize.
[2024-05-27 00:09:23] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 1 ms to minimize.
[2024-05-27 00:09:23] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 2 ms to minimize.
[2024-05-27 00:09:23] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-05-27 00:09:23] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-27 00:09:23] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 2 ms to minimize.
[2024-05-27 00:09:23] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-05-27 00:09:23] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-05-27 00:09:24] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-27 00:09:24] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 2 ms to minimize.
[2024-05-27 00:09:24] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-27 00:09:24] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 2 ms to minimize.
[2024-05-27 00:09:24] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/270 variables, 16/298 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-27 00:09:24] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-05-27 00:09:24] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/270 variables, 2/300 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/270 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/270 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 270/270 variables, and 300 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1553 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 103/103 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 18/18 constraints]
After SMT, in 1823ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 1 properties in 830 ms.
Support contains 4 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 191/191 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 103 transition count 190
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 102 transition count 189
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 101 transition count 189
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 4 place count 101 transition count 184
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 14 place count 96 transition count 184
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 20 place count 93 transition count 181
Applied a total of 20 rules in 24 ms. Remains 93 /103 variables (removed 10) and now considering 181/191 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 93/103 places, 181/191 transitions.
RANDOM walk for 40000 steps (8 resets) in 246 ms. (161 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 42 ms. (930 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 121858 steps, run visited all 3 properties in 425 ms. (steps per millisecond=286 )
Probabilistic random walk after 121858 steps, saw 24544 distinct states, run finished after 430 ms. (steps per millisecond=283 ) properties seen :3
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 16 out of 244 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 94 transitions
Trivial Post-agglo rules discarded 94 transitions
Performed 94 trivial Post agglomeration. Transition count delta: 94
Iterating post reduction 0 with 94 rules applied. Total rules applied 94 place count 244 transition count 238
Reduce places removed 94 places and 0 transitions.
Iterating post reduction 1 with 94 rules applied. Total rules applied 188 place count 150 transition count 238
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 42 Pre rules applied. Total rules applied 188 place count 150 transition count 196
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 272 place count 108 transition count 196
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 280 place count 104 transition count 192
Applied a total of 280 rules in 28 ms. Remains 104 /244 variables (removed 140) and now considering 192/332 (removed 140) transitions.
[2024-05-27 00:09:26] [INFO ] Flow matrix only has 168 transitions (discarded 24 similar events)
// Phase 1: matrix 168 rows 104 cols
[2024-05-27 00:09:26] [INFO ] Computed 15 invariants in 4 ms
[2024-05-27 00:09:26] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-05-27 00:09:26] [INFO ] Flow matrix only has 168 transitions (discarded 24 similar events)
[2024-05-27 00:09:26] [INFO ] Invariant cache hit.
[2024-05-27 00:09:26] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-27 00:09:26] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
[2024-05-27 00:09:26] [INFO ] Redundant transitions in 8 ms returned []
Running 188 sub problems to find dead transitions.
[2024-05-27 00:09:26] [INFO ] Flow matrix only has 168 transitions (discarded 24 similar events)
[2024-05-27 00:09:26] [INFO ] Invariant cache hit.
[2024-05-27 00:09:26] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 3/103 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (OVERLAPS) 4/104 variables, 8/111 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 4/115 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 4/119 constraints. Problems are: Problem set: 0 solved, 188 unsolved
[2024-05-27 00:09:28] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 1 ms to minimize.
[2024-05-27 00:09:28] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 2 ms to minimize.
[2024-05-27 00:09:28] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-05-27 00:09:29] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 2 ms to minimize.
[2024-05-27 00:09:29] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-05-27 00:09:29] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 2 ms to minimize.
[2024-05-27 00:09:29] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 1 ms to minimize.
[2024-05-27 00:09:29] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-27 00:09:29] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-05-27 00:09:29] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-27 00:09:29] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 2 ms to minimize.
[2024-05-27 00:09:29] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 1 ms to minimize.
[2024-05-27 00:09:29] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 2 ms to minimize.
[2024-05-27 00:09:29] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2024-05-27 00:09:29] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
[2024-05-27 00:09:29] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-27 00:09:29] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 2 ms to minimize.
[2024-05-27 00:09:29] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
[2024-05-27 00:09:29] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2024-05-27 00:09:29] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 20/139 constraints. Problems are: Problem set: 0 solved, 188 unsolved
[2024-05-27 00:09:30] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
[2024-05-27 00:09:30] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 2 ms to minimize.
[2024-05-27 00:09:30] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2024-05-27 00:09:30] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-05-27 00:09:30] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 2 ms to minimize.
[2024-05-27 00:09:30] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
[2024-05-27 00:09:31] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-27 00:09:31] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 1 ms to minimize.
[2024-05-27 00:09:31] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2024-05-27 00:09:31] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 2 ms to minimize.
[2024-05-27 00:09:31] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-05-27 00:09:31] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 1 ms to minimize.
[2024-05-27 00:09:31] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 2 ms to minimize.
[2024-05-27 00:09:31] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-05-27 00:09:31] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-27 00:09:31] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-27 00:09:31] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-27 00:09:31] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 0 ms to minimize.
[2024-05-27 00:09:31] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-27 00:09:31] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 20/159 constraints. Problems are: Problem set: 0 solved, 188 unsolved
[2024-05-27 00:09:32] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-27 00:09:32] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 2 ms to minimize.
[2024-05-27 00:09:32] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 2 ms to minimize.
[2024-05-27 00:09:32] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-05-27 00:09:32] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-05-27 00:09:32] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-27 00:09:32] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-27 00:09:32] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-27 00:09:32] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 2 ms to minimize.
[2024-05-27 00:09:33] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-05-27 00:09:33] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 1 ms to minimize.
[2024-05-27 00:09:33] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 2 ms to minimize.
[2024-05-27 00:09:33] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 13/172 constraints. Problems are: Problem set: 0 solved, 188 unsolved
[2024-05-27 00:09:33] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
[2024-05-27 00:09:33] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 1 ms to minimize.
[2024-05-27 00:09:34] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
[2024-05-27 00:09:34] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-27 00:09:34] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/104 variables, 5/177 constraints. Problems are: Problem set: 0 solved, 188 unsolved
[2024-05-27 00:09:36] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/104 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 188 unsolved
[2024-05-27 00:09:36] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-27 00:09:37] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-27 00:09:37] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/104 variables, 3/181 constraints. Problems are: Problem set: 0 solved, 188 unsolved
[2024-05-27 00:09:37] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-05-27 00:09:38] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-05-27 00:09:38] [INFO ] Deduced a trap composed of 35 places in 65 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/104 variables, 3/184 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/104 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 14 (OVERLAPS) 168/272 variables, 104/288 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/272 variables, 57/345 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/272 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 17 (OVERLAPS) 0/272 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 188 unsolved
No progress, stopping.
After SMT solving in domain Real declared 272/272 variables, and 345 constraints, problems are : Problem set: 0 solved, 188 unsolved in 23014 ms.
Refiners :[Domain max(s): 104/104 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 104/104 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 65/65 constraints]
Escalating to Integer solving :Problem set: 0 solved, 188 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 3/103 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 60/163 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (OVERLAPS) 4/104 variables, 8/171 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 4/175 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 4/179 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 5/184 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 9 (OVERLAPS) 168/272 variables, 104/288 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 57/345 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 188/533 constraints. Problems are: Problem set: 0 solved, 188 unsolved
[2024-05-27 00:09:57] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/272 variables, 1/534 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/272 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 14 (OVERLAPS) 0/272 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 188 unsolved
No progress, stopping.
After SMT solving in domain Int declared 272/272 variables, and 534 constraints, problems are : Problem set: 0 solved, 188 unsolved in 20286 ms.
Refiners :[Domain max(s): 104/104 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 104/104 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 66/66 constraints]
After SMT, in 43354ms problems are : Problem set: 0 solved, 188 unsolved
Search for dead transitions found 0 dead transitions in 43357ms
Starting structural reductions in SI_LTL mode, iteration 1 : 104/244 places, 192/332 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 43783 ms. Remains : 104/244 places, 192/332 transitions.
Stuttering acceptance computed with spot in 248 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Peterson-PT-3-LTLFireability-00
Product exploration explored 100000 steps with 9639 reset in 429 ms.
Stack based approach found an accepted trace after 52 steps with 4 reset with depth 8 and stack size 8 in 1 ms.
FORMULA Peterson-PT-3-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-3-LTLFireability-00 finished in 44552 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(X(X(G(p1))))))'
Support contains 76 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 12 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-05-27 00:10:11] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2024-05-27 00:10:11] [INFO ] Computed 15 invariants in 2 ms
[2024-05-27 00:10:11] [INFO ] Implicit Places using invariants in 172 ms returned [230, 231, 232, 233]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 174 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 7 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 194 ms. Remains : 240/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 214 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : Peterson-PT-3-LTLFireability-01
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA Peterson-PT-3-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-3-LTLFireability-01 finished in 429 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&(G(p1)||G(p2)))))'
Support contains 56 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 4 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-05-27 00:10:11] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-27 00:10:11] [INFO ] Invariant cache hit.
[2024-05-27 00:10:11] [INFO ] Implicit Places using invariants in 195 ms returned []
[2024-05-27 00:10:11] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-27 00:10:11] [INFO ] Invariant cache hit.
[2024-05-27 00:10:11] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-27 00:10:12] [INFO ] Implicit Places using invariants and state equation in 460 ms returned []
Implicit Place search using SMT with State Equation took 658 ms to find 0 implicit places.
Running 328 sub problems to find dead transitions.
[2024-05-27 00:10:12] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-27 00:10:12] [INFO ] Invariant cache hit.
[2024-05-27 00:10:12] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 240/240 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 5/245 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 2/247 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-27 00:10:14] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-27 00:10:14] [INFO ] Deduced a trap composed of 89 places in 51 ms of which 2 ms to minimize.
[2024-05-27 00:10:15] [INFO ] Deduced a trap composed of 97 places in 58 ms of which 2 ms to minimize.
[2024-05-27 00:10:15] [INFO ] Deduced a trap composed of 53 places in 47 ms of which 1 ms to minimize.
[2024-05-27 00:10:16] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 1 ms to minimize.
[2024-05-27 00:10:16] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 6/253 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-27 00:10:20] [INFO ] Deduced a trap composed of 50 places in 60 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-27 00:10:22] [INFO ] Deduced a trap composed of 53 places in 52 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 7 (OVERLAPS) 4/244 variables, 6/261 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 4/265 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/244 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-27 00:10:28] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 2 ms to minimize.
[2024-05-27 00:10:28] [INFO ] Deduced a trap composed of 34 places in 81 ms of which 2 ms to minimize.
[2024-05-27 00:10:28] [INFO ] Deduced a trap composed of 52 places in 73 ms of which 1 ms to minimize.
[2024-05-27 00:10:28] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 2 ms to minimize.
[2024-05-27 00:10:28] [INFO ] Deduced a trap composed of 52 places in 65 ms of which 2 ms to minimize.
[2024-05-27 00:10:28] [INFO ] Deduced a trap composed of 49 places in 76 ms of which 2 ms to minimize.
[2024-05-27 00:10:28] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 3 ms to minimize.
[2024-05-27 00:10:29] [INFO ] Deduced a trap composed of 45 places in 125 ms of which 3 ms to minimize.
[2024-05-27 00:10:29] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 2 ms to minimize.
[2024-05-27 00:10:29] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2024-05-27 00:10:29] [INFO ] Deduced a trap composed of 27 places in 108 ms of which 3 ms to minimize.
[2024-05-27 00:10:29] [INFO ] Deduced a trap composed of 12 places in 104 ms of which 3 ms to minimize.
[2024-05-27 00:10:29] [INFO ] Deduced a trap composed of 20 places in 108 ms of which 3 ms to minimize.
[2024-05-27 00:10:29] [INFO ] Deduced a trap composed of 45 places in 95 ms of which 3 ms to minimize.
[2024-05-27 00:10:29] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 2 ms to minimize.
[2024-05-27 00:10:29] [INFO ] Deduced a trap composed of 38 places in 65 ms of which 2 ms to minimize.
[2024-05-27 00:10:30] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 2 ms to minimize.
[2024-05-27 00:10:30] [INFO ] Deduced a trap composed of 27 places in 114 ms of which 3 ms to minimize.
[2024-05-27 00:10:30] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 3 ms to minimize.
[2024-05-27 00:10:30] [INFO ] Deduced a trap composed of 29 places in 111 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/244 variables, 20/287 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-27 00:10:30] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 3 ms to minimize.
[2024-05-27 00:10:31] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 2 ms to minimize.
[2024-05-27 00:10:31] [INFO ] Deduced a trap composed of 37 places in 94 ms of which 2 ms to minimize.
[2024-05-27 00:10:31] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 1 ms to minimize.
[2024-05-27 00:10:31] [INFO ] Deduced a trap composed of 81 places in 70 ms of which 2 ms to minimize.
[2024-05-27 00:10:31] [INFO ] Deduced a trap composed of 83 places in 72 ms of which 2 ms to minimize.
[2024-05-27 00:10:31] [INFO ] Deduced a trap composed of 48 places in 65 ms of which 1 ms to minimize.
[2024-05-27 00:10:31] [INFO ] Deduced a trap composed of 45 places in 50 ms of which 2 ms to minimize.
[2024-05-27 00:10:31] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 2 ms to minimize.
[2024-05-27 00:10:31] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 2 ms to minimize.
[2024-05-27 00:10:32] [INFO ] Deduced a trap composed of 61 places in 103 ms of which 3 ms to minimize.
[2024-05-27 00:10:32] [INFO ] Deduced a trap composed of 56 places in 94 ms of which 3 ms to minimize.
[2024-05-27 00:10:32] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 2 ms to minimize.
[2024-05-27 00:10:32] [INFO ] Deduced a trap composed of 49 places in 80 ms of which 2 ms to minimize.
[2024-05-27 00:10:32] [INFO ] Deduced a trap composed of 73 places in 103 ms of which 3 ms to minimize.
[2024-05-27 00:10:32] [INFO ] Deduced a trap composed of 74 places in 69 ms of which 2 ms to minimize.
[2024-05-27 00:10:32] [INFO ] Deduced a trap composed of 49 places in 74 ms of which 2 ms to minimize.
[2024-05-27 00:10:32] [INFO ] Deduced a trap composed of 49 places in 77 ms of which 2 ms to minimize.
[2024-05-27 00:10:32] [INFO ] Deduced a trap composed of 56 places in 73 ms of which 2 ms to minimize.
[2024-05-27 00:10:33] [INFO ] Deduced a trap composed of 86 places in 81 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/244 variables, 20/307 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-27 00:10:33] [INFO ] Deduced a trap composed of 45 places in 50 ms of which 1 ms to minimize.
[2024-05-27 00:10:33] [INFO ] Deduced a trap composed of 56 places in 74 ms of which 2 ms to minimize.
[2024-05-27 00:10:34] [INFO ] Deduced a trap composed of 69 places in 71 ms of which 2 ms to minimize.
[2024-05-27 00:10:34] [INFO ] Deduced a trap composed of 73 places in 80 ms of which 2 ms to minimize.
[2024-05-27 00:10:34] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 1 ms to minimize.
[2024-05-27 00:10:34] [INFO ] Deduced a trap composed of 30 places in 86 ms of which 2 ms to minimize.
[2024-05-27 00:10:35] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 3 ms to minimize.
[2024-05-27 00:10:35] [INFO ] Deduced a trap composed of 38 places in 85 ms of which 2 ms to minimize.
[2024-05-27 00:10:35] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 2 ms to minimize.
[2024-05-27 00:10:35] [INFO ] Deduced a trap composed of 42 places in 56 ms of which 2 ms to minimize.
[2024-05-27 00:10:36] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 2 ms to minimize.
[2024-05-27 00:10:36] [INFO ] Deduced a trap composed of 50 places in 75 ms of which 2 ms to minimize.
[2024-05-27 00:10:37] [INFO ] Deduced a trap composed of 20 places in 108 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/244 variables, 13/320 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-27 00:10:41] [INFO ] Deduced a trap composed of 49 places in 89 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 244/552 variables, and 321 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30026 ms.
Refiners :[Domain max(s): 244/244 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/244 constraints, ReadFeed: 0/57 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 62/62 constraints]
Escalating to Integer solving :Problem set: 0 solved, 328 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 240/240 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 5/245 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 2/247 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 60/307 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 5 (OVERLAPS) 4/244 variables, 6/313 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 4/317 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/244 variables, 2/319 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 2/321 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-27 00:10:47] [INFO ] Deduced a trap composed of 41 places in 56 ms of which 2 ms to minimize.
[2024-05-27 00:10:48] [INFO ] Deduced a trap composed of 86 places in 73 ms of which 2 ms to minimize.
[2024-05-27 00:10:48] [INFO ] Deduced a trap composed of 59 places in 102 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/244 variables, 3/324 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-27 00:10:51] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 2 ms to minimize.
[2024-05-27 00:10:51] [INFO ] Deduced a trap composed of 44 places in 66 ms of which 2 ms to minimize.
[2024-05-27 00:10:51] [INFO ] Deduced a trap composed of 85 places in 111 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/244 variables, 3/327 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-27 00:10:56] [INFO ] Deduced a trap composed of 49 places in 61 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/244 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/244 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 13 (OVERLAPS) 308/552 variables, 244/572 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/552 variables, 57/629 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/552 variables, 328/957 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 552/552 variables, and 957 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30013 ms.
Refiners :[Domain max(s): 244/244 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 244/244 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 69/69 constraints]
After SMT, in 60112ms problems are : Problem set: 0 solved, 328 unsolved
Search for dead transitions found 0 dead transitions in 60116ms
Finished structural reductions in LTL mode , in 1 iterations and 60781 ms. Remains : 244/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 222 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p2) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p1)]
Running random walk in product with property : Peterson-PT-3-LTLFireability-02
Entered a terminal (fully accepting) state of product in 14 steps with 0 reset in 0 ms.
FORMULA Peterson-PT-3-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-3-LTLFireability-02 finished in 61023 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U ((X(!p2)||p1) U p3))))'
Support contains 72 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 5 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-05-27 00:11:12] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-27 00:11:12] [INFO ] Invariant cache hit.
[2024-05-27 00:11:12] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-05-27 00:11:12] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-27 00:11:12] [INFO ] Invariant cache hit.
[2024-05-27 00:11:12] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-27 00:11:13] [INFO ] Implicit Places using invariants and state equation in 409 ms returned []
Implicit Place search using SMT with State Equation took 587 ms to find 0 implicit places.
Running 328 sub problems to find dead transitions.
[2024-05-27 00:11:13] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-27 00:11:13] [INFO ] Invariant cache hit.
[2024-05-27 00:11:13] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 240/240 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 5/245 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 2/247 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-27 00:11:15] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-05-27 00:11:15] [INFO ] Deduced a trap composed of 89 places in 54 ms of which 2 ms to minimize.
[2024-05-27 00:11:15] [INFO ] Deduced a trap composed of 97 places in 64 ms of which 1 ms to minimize.
[2024-05-27 00:11:15] [INFO ] Deduced a trap composed of 53 places in 56 ms of which 2 ms to minimize.
[2024-05-27 00:11:16] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 2 ms to minimize.
[2024-05-27 00:11:16] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 6/253 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-27 00:11:20] [INFO ] Deduced a trap composed of 50 places in 63 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-27 00:11:22] [INFO ] Deduced a trap composed of 53 places in 54 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 7 (OVERLAPS) 4/244 variables, 6/261 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 4/265 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/244 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-27 00:11:28] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 3 ms to minimize.
[2024-05-27 00:11:29] [INFO ] Deduced a trap composed of 34 places in 78 ms of which 2 ms to minimize.
[2024-05-27 00:11:29] [INFO ] Deduced a trap composed of 52 places in 69 ms of which 1 ms to minimize.
[2024-05-27 00:11:29] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 1 ms to minimize.
[2024-05-27 00:11:29] [INFO ] Deduced a trap composed of 52 places in 68 ms of which 2 ms to minimize.
[2024-05-27 00:11:29] [INFO ] Deduced a trap composed of 49 places in 75 ms of which 2 ms to minimize.
[2024-05-27 00:11:29] [INFO ] Deduced a trap composed of 16 places in 123 ms of which 2 ms to minimize.
[2024-05-27 00:11:29] [INFO ] Deduced a trap composed of 45 places in 133 ms of which 2 ms to minimize.
[2024-05-27 00:11:29] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 2 ms to minimize.
[2024-05-27 00:11:29] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 2 ms to minimize.
[2024-05-27 00:11:29] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 2 ms to minimize.
[2024-05-27 00:11:30] [INFO ] Deduced a trap composed of 12 places in 114 ms of which 3 ms to minimize.
[2024-05-27 00:11:30] [INFO ] Deduced a trap composed of 20 places in 102 ms of which 2 ms to minimize.
[2024-05-27 00:11:30] [INFO ] Deduced a trap composed of 45 places in 97 ms of which 2 ms to minimize.
[2024-05-27 00:11:30] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 2 ms to minimize.
[2024-05-27 00:11:30] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 1 ms to minimize.
[2024-05-27 00:11:30] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 2 ms to minimize.
[2024-05-27 00:11:30] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 3 ms to minimize.
[2024-05-27 00:11:30] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 3 ms to minimize.
[2024-05-27 00:11:30] [INFO ] Deduced a trap composed of 29 places in 108 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/244 variables, 20/287 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-27 00:11:31] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 3 ms to minimize.
[2024-05-27 00:11:31] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 2 ms to minimize.
[2024-05-27 00:11:31] [INFO ] Deduced a trap composed of 37 places in 97 ms of which 2 ms to minimize.
[2024-05-27 00:11:31] [INFO ] Deduced a trap composed of 56 places in 66 ms of which 2 ms to minimize.
[2024-05-27 00:11:31] [INFO ] Deduced a trap composed of 81 places in 64 ms of which 2 ms to minimize.
[2024-05-27 00:11:32] [INFO ] Deduced a trap composed of 83 places in 75 ms of which 2 ms to minimize.
[2024-05-27 00:11:32] [INFO ] Deduced a trap composed of 48 places in 69 ms of which 2 ms to minimize.
[2024-05-27 00:11:32] [INFO ] Deduced a trap composed of 45 places in 48 ms of which 1 ms to minimize.
[2024-05-27 00:11:32] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 2 ms to minimize.
[2024-05-27 00:11:32] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 2 ms to minimize.
[2024-05-27 00:11:32] [INFO ] Deduced a trap composed of 61 places in 103 ms of which 2 ms to minimize.
[2024-05-27 00:11:32] [INFO ] Deduced a trap composed of 56 places in 96 ms of which 2 ms to minimize.
[2024-05-27 00:11:32] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 2 ms to minimize.
[2024-05-27 00:11:32] [INFO ] Deduced a trap composed of 49 places in 74 ms of which 2 ms to minimize.
[2024-05-27 00:11:32] [INFO ] Deduced a trap composed of 73 places in 109 ms of which 2 ms to minimize.
[2024-05-27 00:11:33] [INFO ] Deduced a trap composed of 74 places in 67 ms of which 2 ms to minimize.
[2024-05-27 00:11:33] [INFO ] Deduced a trap composed of 49 places in 81 ms of which 1 ms to minimize.
[2024-05-27 00:11:33] [INFO ] Deduced a trap composed of 49 places in 77 ms of which 2 ms to minimize.
[2024-05-27 00:11:33] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 1 ms to minimize.
[2024-05-27 00:11:33] [INFO ] Deduced a trap composed of 86 places in 72 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/244 variables, 20/307 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-27 00:11:34] [INFO ] Deduced a trap composed of 45 places in 52 ms of which 2 ms to minimize.
[2024-05-27 00:11:34] [INFO ] Deduced a trap composed of 56 places in 71 ms of which 2 ms to minimize.
[2024-05-27 00:11:34] [INFO ] Deduced a trap composed of 69 places in 70 ms of which 2 ms to minimize.
[2024-05-27 00:11:35] [INFO ] Deduced a trap composed of 73 places in 79 ms of which 2 ms to minimize.
[2024-05-27 00:11:35] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 1 ms to minimize.
[2024-05-27 00:11:35] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 2 ms to minimize.
[2024-05-27 00:11:35] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 2 ms to minimize.
[2024-05-27 00:11:35] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 2 ms to minimize.
[2024-05-27 00:11:36] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-27 00:11:36] [INFO ] Deduced a trap composed of 42 places in 57 ms of which 2 ms to minimize.
[2024-05-27 00:11:36] [INFO ] Deduced a trap composed of 27 places in 94 ms of which 2 ms to minimize.
[2024-05-27 00:11:36] [INFO ] Deduced a trap composed of 50 places in 74 ms of which 2 ms to minimize.
[2024-05-27 00:11:37] [INFO ] Deduced a trap composed of 20 places in 91 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/244 variables, 13/320 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-27 00:11:41] [INFO ] Deduced a trap composed of 49 places in 110 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 244/552 variables, and 321 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30011 ms.
Refiners :[Domain max(s): 244/244 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/244 constraints, ReadFeed: 0/57 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 62/62 constraints]
Escalating to Integer solving :Problem set: 0 solved, 328 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 240/240 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 5/245 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 2/247 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 60/307 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 5 (OVERLAPS) 4/244 variables, 6/313 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 4/317 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/244 variables, 2/319 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 2/321 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-27 00:11:48] [INFO ] Deduced a trap composed of 41 places in 54 ms of which 1 ms to minimize.
[2024-05-27 00:11:48] [INFO ] Deduced a trap composed of 86 places in 71 ms of which 1 ms to minimize.
[2024-05-27 00:11:49] [INFO ] Deduced a trap composed of 59 places in 97 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/244 variables, 3/324 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-27 00:11:52] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 2 ms to minimize.
[2024-05-27 00:11:52] [INFO ] Deduced a trap composed of 44 places in 70 ms of which 2 ms to minimize.
[2024-05-27 00:11:52] [INFO ] Deduced a trap composed of 85 places in 91 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/244 variables, 3/327 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-27 00:11:57] [INFO ] Deduced a trap composed of 49 places in 61 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/244 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/244 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 13 (OVERLAPS) 308/552 variables, 244/572 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/552 variables, 57/629 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/552 variables, 328/957 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 552/552 variables, and 957 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30014 ms.
Refiners :[Domain max(s): 244/244 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 244/244 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 69/69 constraints]
After SMT, in 60080ms problems are : Problem set: 0 solved, 328 unsolved
Search for dead transitions found 0 dead transitions in 60084ms
Finished structural reductions in LTL mode , in 1 iterations and 60677 ms. Remains : 244/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 225 ms :[(OR (NOT p3) p2), true, (NOT p3), (NOT p3), (NOT p3)]
Running random walk in product with property : Peterson-PT-3-LTLFireability-03
Product exploration explored 100000 steps with 3785 reset in 530 ms.
Stack based approach found an accepted trace after 142 steps with 7 reset with depth 16 and stack size 16 in 1 ms.
FORMULA Peterson-PT-3-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-3-LTLFireability-03 finished in 61459 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))||G(p2))))'
Support contains 100 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 3 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-05-27 00:12:13] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-27 00:12:13] [INFO ] Invariant cache hit.
[2024-05-27 00:12:14] [INFO ] Implicit Places using invariants in 184 ms returned [230, 231, 232, 233]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 187 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 12 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 205 ms. Remains : 240/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 371 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : Peterson-PT-3-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Peterson-PT-3-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-3-LTLFireability-04 finished in 595 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(G(p0))&&G(p1)))))'
Support contains 88 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 2 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-05-27 00:12:14] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-27 00:12:14] [INFO ] Invariant cache hit.
[2024-05-27 00:12:14] [INFO ] Implicit Places using invariants in 172 ms returned [230, 231, 232, 233]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 187 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 2 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 192 ms. Remains : 240/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 167 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Peterson-PT-3-LTLFireability-05
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Peterson-PT-3-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-3-LTLFireability-05 finished in 375 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&&X(G(p1))))))'
Support contains 64 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 2 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-05-27 00:12:14] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-27 00:12:14] [INFO ] Invariant cache hit.
[2024-05-27 00:12:15] [INFO ] Implicit Places using invariants in 120 ms returned [230, 231, 232, 233]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 125 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 3 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 130 ms. Remains : 240/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Peterson-PT-3-LTLFireability-06
Product exploration explored 100000 steps with 0 reset in 417 ms.
Stack based approach found an accepted trace after 102 steps with 0 reset with depth 103 and stack size 103 in 0 ms.
FORMULA Peterson-PT-3-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-3-LTLFireability-06 finished in 702 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 40 out of 244 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 244 transition count 272
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 120 place count 184 transition count 272
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 120 place count 184 transition count 224
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 216 place count 136 transition count 224
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 240 place count 124 transition count 212
Applied a total of 240 rules in 21 ms. Remains 124 /244 variables (removed 120) and now considering 212/332 (removed 120) transitions.
[2024-05-27 00:12:15] [INFO ] Flow matrix only has 188 transitions (discarded 24 similar events)
// Phase 1: matrix 188 rows 124 cols
[2024-05-27 00:12:15] [INFO ] Computed 15 invariants in 1 ms
[2024-05-27 00:12:15] [INFO ] Implicit Places using invariants in 119 ms returned [117, 118, 119, 120]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 119 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 120/244 places, 212/332 transitions.
Applied a total of 0 rules in 7 ms. Remains 120 /120 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 147 ms. Remains : 120/244 places, 212/332 transitions.
Stuttering acceptance computed with spot in 34 ms :[p0]
Running random walk in product with property : Peterson-PT-3-LTLFireability-07
Product exploration explored 100000 steps with 0 reset in 442 ms.
Stack based approach found an accepted trace after 214 steps with 0 reset with depth 215 and stack size 210 in 1 ms.
FORMULA Peterson-PT-3-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-3-LTLFireability-07 finished in 637 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(p0))))'
Support contains 1 out of 244 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 94 transitions
Trivial Post-agglo rules discarded 94 transitions
Performed 94 trivial Post agglomeration. Transition count delta: 94
Iterating post reduction 0 with 94 rules applied. Total rules applied 94 place count 244 transition count 238
Reduce places removed 94 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 95 rules applied. Total rules applied 189 place count 150 transition count 237
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 190 place count 149 transition count 237
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 190 place count 149 transition count 189
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 286 place count 101 transition count 189
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 308 place count 90 transition count 178
Applied a total of 308 rules in 24 ms. Remains 90 /244 variables (removed 154) and now considering 178/332 (removed 154) transitions.
[2024-05-27 00:12:16] [INFO ] Flow matrix only has 154 transitions (discarded 24 similar events)
// Phase 1: matrix 154 rows 90 cols
[2024-05-27 00:12:16] [INFO ] Computed 15 invariants in 1 ms
[2024-05-27 00:12:16] [INFO ] Implicit Places using invariants in 153 ms returned [83, 84, 85, 86]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 154 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 86/244 places, 178/332 transitions.
Applied a total of 0 rules in 6 ms. Remains 86 /86 variables (removed 0) and now considering 178/178 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 184 ms. Remains : 86/244 places, 178/332 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : Peterson-PT-3-LTLFireability-09
Product exploration explored 100000 steps with 0 reset in 125 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 0 ms.
FORMULA Peterson-PT-3-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-3-LTLFireability-09 finished in 356 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 1 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 3 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-05-27 00:12:16] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2024-05-27 00:12:16] [INFO ] Computed 15 invariants in 2 ms
[2024-05-27 00:12:16] [INFO ] Implicit Places using invariants in 202 ms returned [230, 231, 232, 233]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 203 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 3 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 209 ms. Remains : 240/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 173 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-PT-3-LTLFireability-10
Product exploration explored 100000 steps with 0 reset in 126 ms.
Stack based approach found an accepted trace after 68 steps with 0 reset with depth 69 and stack size 69 in 0 ms.
FORMULA Peterson-PT-3-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-3-LTLFireability-10 finished in 521 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 244 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 93 transitions
Trivial Post-agglo rules discarded 93 transitions
Performed 93 trivial Post agglomeration. Transition count delta: 93
Iterating post reduction 0 with 93 rules applied. Total rules applied 93 place count 244 transition count 239
Reduce places removed 93 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 94 rules applied. Total rules applied 187 place count 151 transition count 238
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 188 place count 150 transition count 238
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 188 place count 150 transition count 191
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 282 place count 103 transition count 191
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 306 place count 91 transition count 179
Applied a total of 306 rules in 17 ms. Remains 91 /244 variables (removed 153) and now considering 179/332 (removed 153) transitions.
[2024-05-27 00:12:17] [INFO ] Flow matrix only has 155 transitions (discarded 24 similar events)
// Phase 1: matrix 155 rows 91 cols
[2024-05-27 00:12:17] [INFO ] Computed 15 invariants in 1 ms
[2024-05-27 00:12:17] [INFO ] Implicit Places using invariants in 145 ms returned [83, 84, 85, 86]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 147 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 87/244 places, 179/332 transitions.
Applied a total of 0 rules in 5 ms. Remains 87 /87 variables (removed 0) and now considering 179/179 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 169 ms. Remains : 87/244 places, 179/332 transitions.
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Peterson-PT-3-LTLFireability-11
Product exploration explored 100000 steps with 0 reset in 138 ms.
Stack based approach found an accepted trace after 174 steps with 0 reset with depth 175 and stack size 125 in 1 ms.
FORMULA Peterson-PT-3-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-3-LTLFireability-11 finished in 432 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0 U G((p1||G(p2)))))))'
Support contains 4 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 2 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-05-27 00:12:17] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2024-05-27 00:12:17] [INFO ] Computed 15 invariants in 1 ms
[2024-05-27 00:12:17] [INFO ] Implicit Places using invariants in 195 ms returned [230, 231, 232, 233]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 198 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 2 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 202 ms. Remains : 240/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 251 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true, (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Peterson-PT-3-LTLFireability-12
Entered a terminal (fully accepting) state of product in 69 steps with 0 reset in 0 ms.
FORMULA Peterson-PT-3-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-3-LTLFireability-12 finished in 476 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||(F(p0)&&X(p1)))))'
Support contains 2 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 2 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-05-27 00:12:18] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-27 00:12:18] [INFO ] Invariant cache hit.
[2024-05-27 00:12:18] [INFO ] Implicit Places using invariants in 196 ms returned [230, 231, 232, 233]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 197 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 2 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 202 ms. Remains : 240/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Peterson-PT-3-LTLFireability-13
Product exploration explored 100000 steps with 50000 reset in 151 ms.
Product exploration explored 100000 steps with 50000 reset in 180 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 18 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Peterson-PT-3-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-PT-3-LTLFireability-13 finished in 692 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&F(p1))))'
Support contains 3 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 2 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-05-27 00:12:18] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-27 00:12:18] [INFO ] Invariant cache hit.
[2024-05-27 00:12:18] [INFO ] Implicit Places using invariants in 185 ms returned [230, 231, 232, 233]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 186 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 2 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 192 ms. Remains : 240/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Peterson-PT-3-LTLFireability-15
Entered a terminal (fully accepting) state of product in 240 steps with 0 reset in 1 ms.
FORMULA Peterson-PT-3-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-3-LTLFireability-15 finished in 327 ms.
All properties solved by simple procedures.
Total runtime 246985 ms.
ITS solved all properties within timeout
BK_STOP 1716768739101
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
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="Peterson-PT-3"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is Peterson-PT-3, 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 r267-smll-171654406000260"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-3.tgz
mv Peterson-PT-3 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 ;