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.r091-tall-171624188200699.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 DES-PT-30a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r091-tall-171624188200699
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 22 14:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 08:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Apr 12 08:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 12 08:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 12 08:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 70K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716319493095

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-30a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 19:24:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 19:24:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 19:24:54] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2024-05-21 19:24:54] [INFO ] Transformed 234 places.
[2024-05-21 19:24:54] [INFO ] Transformed 191 transitions.
[2024-05-21 19:24:54] [INFO ] Found NUPN structural information;
[2024-05-21 19:24:54] [INFO ] Parsed PT model containing 234 places and 191 transitions and 926 arcs in 178 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
FORMULA DES-PT-30a-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30a-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30a-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30a-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30a-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30a-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30a-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30a-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 177/177 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 233 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 233 transition count 176
Applied a total of 2 rules in 45 ms. Remains 233 /234 variables (removed 1) and now considering 176/177 (removed 1) transitions.
// Phase 1: matrix 176 rows 233 cols
[2024-05-21 19:24:54] [INFO ] Computed 59 invariants in 25 ms
[2024-05-21 19:24:55] [INFO ] Implicit Places using invariants in 337 ms returned [131]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 373 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 232/234 places, 176/177 transitions.
Applied a total of 0 rules in 7 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 441 ms. Remains : 232/234 places, 176/177 transitions.
Support contains 29 out of 232 places after structural reductions.
[2024-05-21 19:24:55] [INFO ] Flatten gal took : 48 ms
[2024-05-21 19:24:55] [INFO ] Flatten gal took : 22 ms
[2024-05-21 19:24:55] [INFO ] Input system was already deterministic with 176 transitions.
Support contains 25 out of 232 places (down from 29) after GAL structural reductions.
RANDOM walk for 40000 steps (885 resets) in 1176 ms. (33 steps per ms) remains 5/12 properties
BEST_FIRST walk for 40003 steps (210 resets) in 165 ms. (240 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (183 resets) in 130 ms. (305 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (183 resets) in 110 ms. (360 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (169 resets) in 128 ms. (310 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (189 resets) in 91 ms. (434 steps per ms) remains 5/5 properties
// Phase 1: matrix 176 rows 232 cols
[2024-05-21 19:24:56] [INFO ] Computed 58 invariants in 13 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 3/13 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 71/84 variables, 30/32 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 111/195 variables, 23/56 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 4/199 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 175/374 variables, 199/257 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 34/408 variables, 33/290 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/408 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/408 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 290 constraints, problems are : Problem set: 0 solved, 5 unsolved in 564 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 3/13 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 71/84 variables, 30/32 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 111/195 variables, 23/56 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 4/199 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 175/374 variables, 199/257 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 3/260 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-21 19:24:57] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 13 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/374 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/374 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 34/408 variables, 33/294 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/408 variables, 2/296 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-21 19:24:58] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
[2024-05-21 19:24:58] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/408 variables, 2/298 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-21 19:24:58] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-21 19:24:58] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/408 variables, 2/300 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/408 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 0/408 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 300 constraints, problems are : Problem set: 0 solved, 5 unsolved in 3457 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 5/5 constraints]
After SMT, in 4084ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 5579 ms.
Support contains 10 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 176/176 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 232 transition count 174
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 7 place count 232 transition count 174
Applied a total of 7 rules in 44 ms. Remains 232 /232 variables (removed 0) and now considering 174/176 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 232/232 places, 174/176 transitions.
RANDOM walk for 40000 steps (608 resets) in 424 ms. (94 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40001 steps (117 resets) in 100 ms. (396 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (113 resets) in 109 ms. (363 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (114 resets) in 109 ms. (363 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (107 resets) in 102 ms. (388 steps per ms) remains 4/4 properties
// Phase 1: matrix 174 rows 232 cols
[2024-05-21 19:25:06] [INFO ] Computed 60 invariants in 20 ms
[2024-05-21 19:25:06] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 3/11 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 80/91 variables, 33/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 111/202 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 174/376 variables, 202/262 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/376 variables, 2/264 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/376 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 30/406 variables, 30/294 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/406 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/406 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 406/406 variables, and 294 constraints, problems are : Problem set: 0 solved, 4 unsolved in 380 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 232/232 constraints, ReadFeed: 2/2 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/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 3/11 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 80/91 variables, 33/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 111/202 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 19:25:06] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 2 ms to minimize.
[2024-05-21 19:25:06] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 174/376 variables, 202/264 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/376 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/376 variables, 3/269 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 19:25:06] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 2 ms to minimize.
[2024-05-21 19:25:07] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/376 variables, 2/271 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/376 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 30/406 variables, 30/301 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/406 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 19:25:07] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-21 19:25:07] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/406 variables, 2/304 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/406 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/406 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 406/406 variables, and 304 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2206 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 232/232 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 6/6 constraints]
After SMT, in 2627ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 1 properties in 3051 ms.
Support contains 6 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 174/174 transitions.
Applied a total of 0 rules in 10 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 232/232 places, 174/174 transitions.
RANDOM walk for 40000 steps (631 resets) in 161 ms. (246 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (115 resets) in 100 ms. (396 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (120 resets) in 69 ms. (571 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (114 resets) in 67 ms. (588 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 1004579 steps, run timeout after 3001 ms. (steps per millisecond=334 ) properties seen :0 out of 3
Probabilistic random walk after 1004579 steps, saw 142191 distinct states, run finished after 3004 ms. (steps per millisecond=334 ) properties seen :0
[2024-05-21 19:25:14] [INFO ] Invariant cache hit.
[2024-05-21 19:25:14] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 2/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 82/90 variables, 34/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 112/202 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 174/376 variables, 202/262 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/376 variables, 2/264 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/376 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 30/406 variables, 30/294 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/406 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/406 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 406/406 variables, and 294 constraints, problems are : Problem set: 0 solved, 3 unsolved in 313 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 232/232 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 2/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 82/90 variables, 34/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 112/202 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 19:25:15] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 174/376 variables, 202/263 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/376 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/376 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 19:25:15] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 2 ms to minimize.
[2024-05-21 19:25:15] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/376 variables, 2/269 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/376 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 30/406 variables, 30/299 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/406 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/406 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/406 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 406/406 variables, and 300 constraints, problems are : Problem set: 0 solved, 3 unsolved in 849 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 232/232 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 3/3 constraints]
After SMT, in 1169ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 2575 ms.
Support contains 6 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 174/174 transitions.
Applied a total of 0 rules in 23 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 232/232 places, 174/174 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 174/174 transitions.
Applied a total of 0 rules in 7 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
[2024-05-21 19:25:18] [INFO ] Invariant cache hit.
[2024-05-21 19:25:18] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-05-21 19:25:18] [INFO ] Invariant cache hit.
[2024-05-21 19:25:18] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 19:25:19] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 434 ms to find 0 implicit places.
[2024-05-21 19:25:19] [INFO ] Redundant transitions in 4 ms returned []
Running 173 sub problems to find dead transitions.
[2024-05-21 19:25:19] [INFO ] Invariant cache hit.
[2024-05-21 19:25:19] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 35/47 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 13/60 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (OVERLAPS) 174/406 variables, 232/292 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 2/294 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-21 19:25:21] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 1 ms to minimize.
[2024-05-21 19:25:21] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 2/296 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-21 19:25:23] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/406 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/406 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 10 (OVERLAPS) 0/406 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Real declared 406/406 variables, and 297 constraints, problems are : Problem set: 0 solved, 173 unsolved in 9402 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 232/232 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 173 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 35/47 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 13/60 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-21 19:25:30] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-21 19:25:30] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-05-21 19:25:30] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-21 19:25:31] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/232 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 8 (OVERLAPS) 174/406 variables, 232/299 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/406 variables, 2/301 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/406 variables, 173/474 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-21 19:25:39] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-21 19:25:39] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2024-05-21 19:25:39] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-21 19:25:40] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/406 variables, 4/478 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-21 19:25:52] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 406/406 variables, and 479 constraints, problems are : Problem set: 0 solved, 173 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 232/232 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 12/12 constraints]
After SMT, in 39551ms problems are : Problem set: 0 solved, 173 unsolved
Search for dead transitions found 0 dead transitions in 39555ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40011 ms. Remains : 232/232 places, 174/174 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 232 transition count 174
Applied a total of 1 rules in 12 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 174 rows 232 cols
[2024-05-21 19:25:58] [INFO ] Computed 60 invariants in 3 ms
[2024-05-21 19:25:58] [INFO ] [Real]Absence check using 35 positive place invariants in 18 ms returned sat
[2024-05-21 19:25:58] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 18 ms returned sat
[2024-05-21 19:25:58] [INFO ] After 154ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-21 19:25:58] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-21 19:25:58] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 16 ms returned sat
[2024-05-21 19:25:59] [INFO ] After 131ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-21 19:25:59] [INFO ] After 217ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-21 19:25:59] [INFO ] After 380ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 567 ms.
Computed a total of 135 stabilizing places and 130 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' '!(F(G(p0)))'
Support contains 2 out of 232 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 15 ms. Remains 231 /232 variables (removed 1) and now considering 175/176 (removed 1) transitions.
// Phase 1: matrix 175 rows 231 cols
[2024-05-21 19:25:59] [INFO ] Computed 58 invariants in 2 ms
[2024-05-21 19:25:59] [INFO ] Implicit Places using invariants in 189 ms returned []
[2024-05-21 19:25:59] [INFO ] Invariant cache hit.
[2024-05-21 19:26:00] [INFO ] Implicit Places using invariants and state equation in 308 ms returned []
Implicit Place search using SMT with State Equation took 499 ms to find 0 implicit places.
[2024-05-21 19:26:00] [INFO ] Redundant transitions in 5 ms returned []
Running 172 sub problems to find dead transitions.
[2024-05-21 19:26:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/228 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (OVERLAPS) 2/230 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 5 (OVERLAPS) 175/405 variables, 230/288 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 19:26:03] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 1/289 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 19:26:05] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 2 ms to minimize.
[2024-05-21 19:26:05] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2024-05-21 19:26:06] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-21 19:26:06] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/405 variables, 4/293 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/405 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 9 (OVERLAPS) 1/406 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/406 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 11 (OVERLAPS) 0/406 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 172 unsolved
No progress, stopping.
After SMT solving in domain Real declared 406/406 variables, and 294 constraints, problems are : Problem set: 0 solved, 172 unsolved in 12040 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 231/231 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 172 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/228 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (OVERLAPS) 2/230 variables, 7/63 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/230 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 6 (OVERLAPS) 175/405 variables, 230/293 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/405 variables, 172/465 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 19:26:19] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-21 19:26:19] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-05-21 19:26:19] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 2 ms to minimize.
[2024-05-21 19:26:19] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/405 variables, 4/469 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/405 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 10 (OVERLAPS) 1/406 variables, 1/470 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 406/406 variables, and 470 constraints, problems are : Problem set: 0 solved, 172 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 231/231 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 9/9 constraints]
After SMT, in 42122ms problems are : Problem set: 0 solved, 172 unsolved
Search for dead transitions found 0 dead transitions in 42131ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 42660 ms. Remains : 231/232 places, 175/176 transitions.
Stuttering acceptance computed with spot in 134 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-30a-LTLCardinality-00
Stuttering criterion allowed to conclude after 43 steps with 0 reset in 2 ms.
FORMULA DES-PT-30a-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30a-LTLCardinality-00 finished in 42880 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 4 out of 232 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 8 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 232 cols
[2024-05-21 19:26:42] [INFO ] Computed 58 invariants in 2 ms
[2024-05-21 19:26:42] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-21 19:26:42] [INFO ] Invariant cache hit.
[2024-05-21 19:26:42] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
[2024-05-21 19:26:42] [INFO ] Redundant transitions in 2 ms returned []
Running 175 sub problems to find dead transitions.
[2024-05-21 19:26:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 176/408 variables, 232/290 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 19:26:45] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 1 ms to minimize.
[2024-05-21 19:26:46] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2024-05-21 19:26:46] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-21 19:26:46] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2024-05-21 19:26:46] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 2 ms to minimize.
[2024-05-21 19:26:46] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 2 ms to minimize.
[2024-05-21 19:26:46] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-21 19:26:46] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
[2024-05-21 19:26:46] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 9/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 299 constraints, problems are : Problem set: 0 solved, 175 unsolved in 7540 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 176/408 variables, 232/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 175/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 474 constraints, problems are : Problem set: 0 solved, 175 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
After SMT, in 37637ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 37639ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 38001 ms. Remains : 232/232 places, 176/176 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-30a-LTLCardinality-02
Stuttering criterion allowed to conclude after 96 steps with 1 reset in 3 ms.
FORMULA DES-PT-30a-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30a-LTLCardinality-02 finished in 38063 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((!p0&&X((!p0 U (!p1||G(!p0))))) U (G((!p0&&X((!p0 U (!p1||G(!p0))))))||(!p0&&X(((!p0 U (!p1||G(!p0)))&&X(p2)))))))))'
Support contains 5 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 2 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2024-05-21 19:27:20] [INFO ] Invariant cache hit.
[2024-05-21 19:27:20] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-05-21 19:27:20] [INFO ] Invariant cache hit.
[2024-05-21 19:27:20] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2024-05-21 19:27:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 176/408 variables, 232/290 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 19:27:23] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 2 ms to minimize.
[2024-05-21 19:27:24] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-21 19:27:24] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 2 ms to minimize.
[2024-05-21 19:27:24] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2024-05-21 19:27:24] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-05-21 19:27:24] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-05-21 19:27:24] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 2 ms to minimize.
[2024-05-21 19:27:24] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-21 19:27:24] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 9/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 299 constraints, problems are : Problem set: 0 solved, 175 unsolved in 7597 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 176/408 variables, 232/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 175/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 474 constraints, problems are : Problem set: 0 solved, 175 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
After SMT, in 37696ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 37698ms
Finished structural reductions in LTL mode , in 1 iterations and 38069 ms. Remains : 232/232 places, 176/176 transitions.
Stuttering acceptance computed with spot in 287 ms :[p0, p0, (AND p0 p1), (AND p0 (NOT p1) (NOT p2)), (AND p0 p1 (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p2))]
Running random walk in product with property : DES-PT-30a-LTLCardinality-03
Stuttering criterion allowed to conclude after 48 steps with 0 reset in 0 ms.
FORMULA DES-PT-30a-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30a-LTLCardinality-03 finished in 38385 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 232 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 15 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2024-05-21 19:27:58] [INFO ] Invariant cache hit.
[2024-05-21 19:27:58] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-05-21 19:27:58] [INFO ] Invariant cache hit.
[2024-05-21 19:27:59] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 354 ms to find 0 implicit places.
[2024-05-21 19:27:59] [INFO ] Redundant transitions in 1 ms returned []
Running 175 sub problems to find dead transitions.
[2024-05-21 19:27:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 176/408 variables, 232/290 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 19:28:01] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 2 ms to minimize.
[2024-05-21 19:28:02] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-05-21 19:28:02] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-21 19:28:02] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 3 ms to minimize.
[2024-05-21 19:28:02] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 2 ms to minimize.
[2024-05-21 19:28:02] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2024-05-21 19:28:02] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-05-21 19:28:03] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
[2024-05-21 19:28:03] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 9/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 299 constraints, problems are : Problem set: 0 solved, 175 unsolved in 7605 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 176/408 variables, 232/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 175/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 474 constraints, problems are : Problem set: 0 solved, 175 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
After SMT, in 37691ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 37693ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 38070 ms. Remains : 232/232 places, 176/176 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-30a-LTLCardinality-04
Product exploration explored 100000 steps with 6393 reset in 281 ms.
Product exploration explored 100000 steps with 6296 reset in 259 ms.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Knowledge obtained : [(NOT p0), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 62 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X p0), (X (X p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
[2024-05-21 19:28:37] [INFO ] Invariant cache hit.
[2024-05-21 19:28:38] [INFO ] [Real]Absence check using 32 positive place invariants in 6 ms returned sat
[2024-05-21 19:28:38] [INFO ] [Real]Absence check using 32 positive and 26 generalized place invariants in 24 ms returned sat
[2024-05-21 19:28:38] [INFO ] [Real]Absence check using state equation in 369 ms returned sat
[2024-05-21 19:28:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 19:28:38] [INFO ] [Nat]Absence check using 32 positive place invariants in 6 ms returned sat
[2024-05-21 19:28:38] [INFO ] [Nat]Absence check using 32 positive and 26 generalized place invariants in 12 ms returned sat
[2024-05-21 19:28:39] [INFO ] [Nat]Absence check using state equation in 653 ms returned sat
[2024-05-21 19:28:39] [INFO ] Computed and/alt/rep : 168/504/168 causal constraints (skipped 7 transitions) in 12 ms.
[2024-05-21 19:28:39] [INFO ] Added : 125 causal constraints over 25 iterations in 699 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 232 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 10 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2024-05-21 19:28:39] [INFO ] Invariant cache hit.
[2024-05-21 19:28:40] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-05-21 19:28:40] [INFO ] Invariant cache hit.
[2024-05-21 19:28:40] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
[2024-05-21 19:28:40] [INFO ] Redundant transitions in 2 ms returned []
Running 175 sub problems to find dead transitions.
[2024-05-21 19:28:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 176/408 variables, 232/290 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 19:28:43] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
[2024-05-21 19:28:43] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-05-21 19:28:43] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-21 19:28:43] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
[2024-05-21 19:28:43] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-05-21 19:28:43] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 2 ms to minimize.
[2024-05-21 19:28:43] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-21 19:28:44] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-21 19:28:44] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 9/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 299 constraints, problems are : Problem set: 0 solved, 175 unsolved in 7680 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 176/408 variables, 232/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 175/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 474 constraints, problems are : Problem set: 0 solved, 175 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
After SMT, in 37772ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 37774ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 38130 ms. Remains : 232/232 places, 176/176 transitions.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Knowledge obtained : [(NOT p0), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X p0), (X (X p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
[2024-05-21 19:29:18] [INFO ] Invariant cache hit.
[2024-05-21 19:29:18] [INFO ] [Real]Absence check using 32 positive place invariants in 6 ms returned sat
[2024-05-21 19:29:18] [INFO ] [Real]Absence check using 32 positive and 26 generalized place invariants in 23 ms returned sat
[2024-05-21 19:29:18] [INFO ] [Real]Absence check using state equation in 381 ms returned sat
[2024-05-21 19:29:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 19:29:19] [INFO ] [Nat]Absence check using 32 positive place invariants in 5 ms returned sat
[2024-05-21 19:29:19] [INFO ] [Nat]Absence check using 32 positive and 26 generalized place invariants in 12 ms returned sat
[2024-05-21 19:29:19] [INFO ] [Nat]Absence check using state equation in 648 ms returned sat
[2024-05-21 19:29:19] [INFO ] Computed and/alt/rep : 168/504/168 causal constraints (skipped 7 transitions) in 11 ms.
[2024-05-21 19:29:20] [INFO ] Added : 125 causal constraints over 25 iterations in 646 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 6240 reset in 214 ms.
Product exploration explored 100000 steps with 6341 reset in 270 ms.
Support contains 2 out of 232 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 7 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2024-05-21 19:29:20] [INFO ] Invariant cache hit.
[2024-05-21 19:29:21] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-21 19:29:21] [INFO ] Invariant cache hit.
[2024-05-21 19:29:21] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
[2024-05-21 19:29:21] [INFO ] Redundant transitions in 0 ms returned []
Running 175 sub problems to find dead transitions.
[2024-05-21 19:29:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 176/408 variables, 232/290 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 19:29:24] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2024-05-21 19:29:24] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 2 ms to minimize.
[2024-05-21 19:29:24] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-21 19:29:24] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2024-05-21 19:29:24] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-05-21 19:29:24] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-05-21 19:29:24] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-05-21 19:29:25] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-21 19:29:25] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 9/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 299 constraints, problems are : Problem set: 0 solved, 175 unsolved in 7605 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 176/408 variables, 232/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 175/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 474 constraints, problems are : Problem set: 0 solved, 175 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
After SMT, in 37685ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 37687ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 38049 ms. Remains : 232/232 places, 176/176 transitions.
Treatment of property DES-PT-30a-LTLCardinality-04 finished in 120281 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 ((X(p0)&&G(!p1))||X(G(p0))))))'
Support contains 4 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 2 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2024-05-21 19:29:59] [INFO ] Invariant cache hit.
[2024-05-21 19:29:59] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-05-21 19:29:59] [INFO ] Invariant cache hit.
[2024-05-21 19:29:59] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2024-05-21 19:29:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 176/408 variables, 232/290 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 19:30:02] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 2 ms to minimize.
[2024-05-21 19:30:02] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-21 19:30:02] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-21 19:30:02] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2024-05-21 19:30:02] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2024-05-21 19:30:02] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2024-05-21 19:30:02] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-21 19:30:03] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
[2024-05-21 19:30:03] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 9/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 299 constraints, problems are : Problem set: 0 solved, 175 unsolved in 7315 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 176/408 variables, 232/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 175/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 474 constraints, problems are : Problem set: 0 solved, 175 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
After SMT, in 37413ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 37416ms
Finished structural reductions in LTL mode , in 1 iterations and 37742 ms. Remains : 232/232 places, 176/176 transitions.
Stuttering acceptance computed with spot in 258 ms :[true, (AND p1 (NOT p0)), p1, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-30a-LTLCardinality-09
Product exploration explored 100000 steps with 2238 reset in 211 ms.
Product exploration explored 100000 steps with 2227 reset in 218 ms.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 78 ms. Reduced automaton from 7 states, 16 edges and 2 AP (stutter sensitive) to 7 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 212 ms :[true, p1, (AND p1 (NOT p0)), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (882 resets) in 212 ms. (187 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (199 resets) in 169 ms. (235 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (177 resets) in 140 ms. (283 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (174 resets) in 119 ms. (333 steps per ms) remains 3/3 properties
[2024-05-21 19:30:38] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 71/79 variables, 31/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 116/195 variables, 23/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 4/199 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 175/374 variables, 199/257 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 34/408 variables, 33/290 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/408 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/408 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 290 constraints, problems are : Problem set: 0 solved, 3 unsolved in 192 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 71/79 variables, 31/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 116/195 variables, 23/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 4/199 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 175/374 variables, 199/257 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 34/408 variables, 33/290 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/408 variables, 3/293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/408 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/408 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 293 constraints, problems are : Problem set: 0 solved, 3 unsolved in 376 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 574ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2731 ms.
Support contains 4 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 176/176 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 232 transition count 174
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 8 place count 232 transition count 174
Applied a total of 8 rules in 21 ms. Remains 232 /232 variables (removed 0) and now considering 174/176 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 232/232 places, 174/176 transitions.
RANDOM walk for 40000 steps (529 resets) in 451 ms. (88 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (107 resets) in 65 ms. (606 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (92 resets) in 67 ms. (588 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (103 resets) in 88 ms. (449 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 1121054 steps, run timeout after 3001 ms. (steps per millisecond=373 ) properties seen :0 out of 3
Probabilistic random walk after 1121054 steps, saw 156857 distinct states, run finished after 3001 ms. (steps per millisecond=373 ) properties seen :0
// Phase 1: matrix 174 rows 232 cols
[2024-05-21 19:30:44] [INFO ] Computed 60 invariants in 3 ms
[2024-05-21 19:30:44] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 5/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 77/86 variables, 33/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 116/202 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 174/376 variables, 202/262 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/376 variables, 3/265 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/376 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 30/406 variables, 30/295 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/406 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/406 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 406/406 variables, and 295 constraints, problems are : Problem set: 0 solved, 3 unsolved in 203 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 232/232 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 5/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 77/86 variables, 33/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 116/202 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 174/376 variables, 202/262 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/376 variables, 3/265 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 19:30:45] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-21 19:30:45] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
[2024-05-21 19:30:45] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-21 19:30:45] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/376 variables, 4/269 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/376 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 30/406 variables, 30/299 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/406 variables, 3/302 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/406 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/406 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 406/406 variables, and 302 constraints, problems are : Problem set: 0 solved, 3 unsolved in 647 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 232/232 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 4/4 constraints]
After SMT, in 869ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 12390 steps, including 38 resets, run visited all 3 properties in 127 ms. (steps per millisecond=97 )
Parikh walk visited 3 properties in 1473 ms.
Knowledge obtained : [(AND p1 p0), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 6 factoid took 243 ms. Reduced automaton from 7 states, 15 edges and 2 AP (stutter sensitive) to 7 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 262 ms :[true, p1, (AND p1 (NOT p0)), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 287 ms :[true, p1, (AND p1 (NOT p0)), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 2 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 232 cols
[2024-05-21 19:30:47] [INFO ] Computed 58 invariants in 8 ms
[2024-05-21 19:30:47] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-05-21 19:30:47] [INFO ] Invariant cache hit.
[2024-05-21 19:30:48] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2024-05-21 19:30:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 176/408 variables, 232/290 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 19:30:50] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2024-05-21 19:30:51] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-05-21 19:30:51] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-21 19:30:51] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2024-05-21 19:30:51] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-05-21 19:30:51] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2024-05-21 19:30:51] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 2 ms to minimize.
[2024-05-21 19:30:52] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-05-21 19:30:52] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 9/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 299 constraints, problems are : Problem set: 0 solved, 175 unsolved in 7403 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 176/408 variables, 232/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 175/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 474 constraints, problems are : Problem set: 0 solved, 175 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
After SMT, in 37496ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 37498ms
Finished structural reductions in LTL mode , in 1 iterations and 37857 ms. Remains : 232/232 places, 176/176 transitions.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 98 ms. Reduced automaton from 7 states, 15 edges and 2 AP (stutter sensitive) to 7 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 240 ms :[true, p1, (AND p1 (NOT p0)), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (898 resets) in 373 ms. (106 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (193 resets) in 106 ms. (373 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (188 resets) in 80 ms. (493 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (181 resets) in 71 ms. (555 steps per ms) remains 3/3 properties
[2024-05-21 19:31:26] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 71/79 variables, 31/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 116/195 variables, 23/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 4/199 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 175/374 variables, 199/257 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 34/408 variables, 33/290 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/408 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/408 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 290 constraints, problems are : Problem set: 0 solved, 3 unsolved in 204 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 71/79 variables, 31/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 116/195 variables, 23/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 4/199 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 175/374 variables, 199/257 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 34/408 variables, 33/290 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/408 variables, 3/293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/408 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/408 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 293 constraints, problems are : Problem set: 0 solved, 3 unsolved in 387 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 596ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2625 ms.
Support contains 4 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 176/176 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 232 transition count 174
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 8 place count 232 transition count 174
Applied a total of 8 rules in 12 ms. Remains 232 /232 variables (removed 0) and now considering 174/176 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 232/232 places, 174/176 transitions.
RANDOM walk for 40000 steps (549 resets) in 251 ms. (158 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (103 resets) in 85 ms. (465 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (91 resets) in 125 ms. (317 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (106 resets) in 113 ms. (350 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 926494 steps, run timeout after 3001 ms. (steps per millisecond=308 ) properties seen :0 out of 3
Probabilistic random walk after 926494 steps, saw 131847 distinct states, run finished after 3001 ms. (steps per millisecond=308 ) properties seen :0
// Phase 1: matrix 174 rows 232 cols
[2024-05-21 19:31:32] [INFO ] Computed 60 invariants in 4 ms
[2024-05-21 19:31:32] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 5/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 77/86 variables, 33/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 116/202 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 174/376 variables, 202/262 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/376 variables, 3/265 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/376 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 30/406 variables, 30/295 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/406 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/406 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 406/406 variables, and 295 constraints, problems are : Problem set: 0 solved, 3 unsolved in 201 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 232/232 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 5/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 77/86 variables, 33/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 116/202 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 174/376 variables, 202/262 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/376 variables, 3/265 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 19:31:33] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-21 19:31:33] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 1 ms to minimize.
[2024-05-21 19:31:33] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-21 19:31:33] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/376 variables, 4/269 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/376 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 30/406 variables, 30/299 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/406 variables, 3/302 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/406 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/406 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 406/406 variables, and 302 constraints, problems are : Problem set: 0 solved, 3 unsolved in 631 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 232/232 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 4/4 constraints]
After SMT, in 843ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 18338 steps, including 59 resets, run visited all 3 properties in 237 ms. (steps per millisecond=77 )
Parikh walk visited 3 properties in 1668 ms.
Knowledge obtained : [(AND p1 p0), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 5 factoid took 301 ms. Reduced automaton from 7 states, 15 edges and 2 AP (stutter sensitive) to 7 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 237 ms :[true, p1, (AND p1 (NOT p0)), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 241 ms :[true, p1, (AND p1 (NOT p0)), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 227 ms :[true, p1, (AND p1 (NOT p0)), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2207 reset in 209 ms.
Product exploration explored 100000 steps with 2183 reset in 231 ms.
Applying partial POR strategy [true, true, false, false, false, false, false]
Stuttering acceptance computed with spot in 256 ms :[true, p1, (AND p1 (NOT p0)), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 232 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 26 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2024-05-21 19:31:37] [INFO ] Redundant transitions in 0 ms returned []
Running 175 sub problems to find dead transitions.
// Phase 1: matrix 176 rows 232 cols
[2024-05-21 19:31:37] [INFO ] Computed 58 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 176/408 variables, 232/290 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 19:31:40] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-05-21 19:31:40] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 2/292 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 19:31:41] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-05-21 19:31:42] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-05-21 19:31:42] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 3/295 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 0/408 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 295 constraints, problems are : Problem set: 0 solved, 175 unsolved in 8704 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 176/408 variables, 232/295 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 175/470 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 19:31:55] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-05-21 19:31:55] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 2/472 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/408 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 175 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 408/408 variables, and 472 constraints, problems are : Problem set: 0 solved, 175 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 7/7 constraints]
After SMT, in 38799ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 38800ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 38834 ms. Remains : 232/232 places, 176/176 transitions.
Support contains 4 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 13 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2024-05-21 19:32:15] [INFO ] Invariant cache hit.
[2024-05-21 19:32:16] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-05-21 19:32:16] [INFO ] Invariant cache hit.
[2024-05-21 19:32:16] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2024-05-21 19:32:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 176/408 variables, 232/290 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 19:32:18] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2024-05-21 19:32:19] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-21 19:32:19] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-21 19:32:19] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2024-05-21 19:32:19] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 2 ms to minimize.
[2024-05-21 19:32:19] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 2 ms to minimize.
[2024-05-21 19:32:19] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-05-21 19:32:20] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
[2024-05-21 19:32:20] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 9/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 299 constraints, problems are : Problem set: 0 solved, 175 unsolved in 7663 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 176/408 variables, 232/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 175/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 474 constraints, problems are : Problem set: 0 solved, 175 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
After SMT, in 37747ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 37749ms
Finished structural reductions in LTL mode , in 1 iterations and 38091 ms. Remains : 232/232 places, 176/176 transitions.
Treatment of property DES-PT-30a-LTLCardinality-09 finished in 175015 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))'
Support contains 2 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 5 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2024-05-21 19:32:54] [INFO ] Invariant cache hit.
[2024-05-21 19:32:54] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-05-21 19:32:54] [INFO ] Invariant cache hit.
[2024-05-21 19:32:54] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2024-05-21 19:32:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 176/408 variables, 232/290 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 19:32:57] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2024-05-21 19:32:57] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-21 19:32:57] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-21 19:32:57] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 2 ms to minimize.
[2024-05-21 19:32:58] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-05-21 19:32:58] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 1 ms to minimize.
[2024-05-21 19:32:58] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-05-21 19:32:58] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-05-21 19:32:58] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 9/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 299 constraints, problems are : Problem set: 0 solved, 175 unsolved in 7885 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 176/408 variables, 232/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 175/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 474 constraints, problems are : Problem set: 0 solved, 175 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
After SMT, in 37984ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 37986ms
Finished structural reductions in LTL mode , in 1 iterations and 38353 ms. Remains : 232/232 places, 176/176 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : DES-PT-30a-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-30a-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30a-LTLCardinality-12 finished in 38466 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((G(p1)||p0))))'
Support contains 4 out of 232 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 14 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2024-05-21 19:33:32] [INFO ] Invariant cache hit.
[2024-05-21 19:33:32] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-05-21 19:33:32] [INFO ] Invariant cache hit.
[2024-05-21 19:33:32] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
[2024-05-21 19:33:32] [INFO ] Redundant transitions in 1 ms returned []
Running 175 sub problems to find dead transitions.
[2024-05-21 19:33:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 176/408 variables, 232/290 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 19:33:35] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
[2024-05-21 19:33:36] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 2 ms to minimize.
[2024-05-21 19:33:36] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-21 19:33:36] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2024-05-21 19:33:36] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2024-05-21 19:33:36] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 2 ms to minimize.
[2024-05-21 19:33:36] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-05-21 19:33:37] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-05-21 19:33:37] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 9/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 299 constraints, problems are : Problem set: 0 solved, 175 unsolved in 7803 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 176/408 variables, 232/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 175/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 474 constraints, problems are : Problem set: 0 solved, 175 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
After SMT, in 37886ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 37888ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 38275 ms. Remains : 232/232 places, 176/176 transitions.
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-30a-LTLCardinality-13
Stuttering criterion allowed to conclude after 47 steps with 0 reset in 1 ms.
FORMULA DES-PT-30a-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30a-LTLCardinality-13 finished in 38393 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))'
Support contains 2 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 4 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2024-05-21 19:34:10] [INFO ] Invariant cache hit.
[2024-05-21 19:34:11] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-05-21 19:34:11] [INFO ] Invariant cache hit.
[2024-05-21 19:34:11] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2024-05-21 19:34:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 176/408 variables, 232/290 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 19:34:13] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 2 ms to minimize.
[2024-05-21 19:34:14] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-05-21 19:34:14] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 2 ms to minimize.
[2024-05-21 19:34:14] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 2 ms to minimize.
[2024-05-21 19:34:14] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-05-21 19:34:14] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 2 ms to minimize.
[2024-05-21 19:34:14] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 2 ms to minimize.
[2024-05-21 19:34:15] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-05-21 19:34:15] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 9/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 299 constraints, problems are : Problem set: 0 solved, 175 unsolved in 7433 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 176/408 variables, 232/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 175/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 474 constraints, problems are : Problem set: 0 solved, 175 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
After SMT, in 37530ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 37532ms
Finished structural reductions in LTL mode , in 1 iterations and 37884 ms. Remains : 232/232 places, 176/176 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : DES-PT-30a-LTLCardinality-14
Product exploration explored 100000 steps with 50000 reset in 313 ms.
Product exploration explored 100000 steps with 50000 reset in 317 ms.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 14 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-30a-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-30a-LTLCardinality-14 finished in 38644 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)))'
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 ((X(p0)&&G(!p1))||X(G(p0))))))'
[2024-05-21 19:34:49] [INFO ] Flatten gal took : 18 ms
[2024-05-21 19:34:49] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-21 19:34:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 232 places, 176 transitions and 855 arcs took 6 ms.
Total runtime 595547 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running DES-PT-30a

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/409/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 232
TRANSITIONS: 176
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.003s, Sys 0.002s]


SAVING FILE /home/mcc/execution/409/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1752
MODEL NAME: /home/mcc/execution/409/model
232 places, 176 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA DES-PT-30a-LTLCardinality-04 CANNOT_COMPUTE
FORMULA DES-PT-30a-LTLCardinality-09 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716320357383

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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="DES-PT-30a"
export BK_EXAMINATION="LTLCardinality"
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 DES-PT-30a, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r091-tall-171624188200699"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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