About the Execution of ITS-Tools for ShieldPPPt-PT-040B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1447.716 | 693254.00 | 880369.00 | 1458.00 | FTTTTFTFFFFFTTTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r356-tall-171683761600667.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is ShieldPPPt-PT-040B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683761600667
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.5K Apr 11 14:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 11 14:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 762K May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldPPPt-PT-040B-LTLCardinality-00
FORMULA_NAME ShieldPPPt-PT-040B-LTLCardinality-01
FORMULA_NAME ShieldPPPt-PT-040B-LTLCardinality-02
FORMULA_NAME ShieldPPPt-PT-040B-LTLCardinality-03
FORMULA_NAME ShieldPPPt-PT-040B-LTLCardinality-04
FORMULA_NAME ShieldPPPt-PT-040B-LTLCardinality-05
FORMULA_NAME ShieldPPPt-PT-040B-LTLCardinality-06
FORMULA_NAME ShieldPPPt-PT-040B-LTLCardinality-07
FORMULA_NAME ShieldPPPt-PT-040B-LTLCardinality-08
FORMULA_NAME ShieldPPPt-PT-040B-LTLCardinality-09
FORMULA_NAME ShieldPPPt-PT-040B-LTLCardinality-10
FORMULA_NAME ShieldPPPt-PT-040B-LTLCardinality-11
FORMULA_NAME ShieldPPPt-PT-040B-LTLCardinality-12
FORMULA_NAME ShieldPPPt-PT-040B-LTLCardinality-13
FORMULA_NAME ShieldPPPt-PT-040B-LTLCardinality-14
FORMULA_NAME ShieldPPPt-PT-040B-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1717020193132
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-040B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-29 22:03:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 22:03:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 22:03:14] [INFO ] Load time of PNML (sax parser for PT used): 196 ms
[2024-05-29 22:03:14] [INFO ] Transformed 3123 places.
[2024-05-29 22:03:14] [INFO ] Transformed 2843 transitions.
[2024-05-29 22:03:14] [INFO ] Found NUPN structural information;
[2024-05-29 22:03:14] [INFO ] Parsed PT model containing 3123 places and 2843 transitions and 7126 arcs in 439 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ShieldPPPt-PT-040B-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-040B-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-040B-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-040B-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-040B-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-040B-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-040B-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 3123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3123/3123 places, 2843/2843 transitions.
Discarding 431 places :
Symmetric choice reduction at 0 with 431 rule applications. Total rules 431 place count 2692 transition count 2412
Iterating global reduction 0 with 431 rules applied. Total rules applied 862 place count 2692 transition count 2412
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 863 place count 2691 transition count 2411
Iterating global reduction 0 with 1 rules applied. Total rules applied 864 place count 2691 transition count 2411
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 865 place count 2690 transition count 2410
Iterating global reduction 0 with 1 rules applied. Total rules applied 866 place count 2690 transition count 2410
Applied a total of 866 rules in 1210 ms. Remains 2690 /3123 variables (removed 433) and now considering 2410/2843 (removed 433) transitions.
// Phase 1: matrix 2410 rows 2690 cols
[2024-05-29 22:03:16] [INFO ] Computed 441 invariants in 41 ms
[2024-05-29 22:03:17] [INFO ] Implicit Places using invariants in 1151 ms returned []
[2024-05-29 22:03:17] [INFO ] Invariant cache hit.
[2024-05-29 22:03:19] [INFO ] Implicit Places using invariants and state equation in 2287 ms returned []
Implicit Place search using SMT with State Equation took 3481 ms to find 0 implicit places.
Running 2409 sub problems to find dead transitions.
[2024-05-29 22:03:19] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2689/5100 variables, and 0 constraints, problems are : Problem set: 0 solved, 2409 unsolved in 30066 ms.
Refiners :[Positive P Invariants (semi-flows): 0/441 constraints, State Equation: 0/2690 constraints, PredecessorRefiner: 2409/2409 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2689/5100 variables, and 0 constraints, problems are : Problem set: 0 solved, 2409 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 0/441 constraints, State Equation: 0/2690 constraints, PredecessorRefiner: 0/2409 constraints, Known Traps: 0/0 constraints]
After SMT, in 60981ms problems are : Problem set: 0 solved, 2409 unsolved
Search for dead transitions found 0 dead transitions in 61031ms
Starting structural reductions in LTL mode, iteration 1 : 2690/3123 places, 2410/2843 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65765 ms. Remains : 2690/3123 places, 2410/2843 transitions.
Support contains 32 out of 2690 places after structural reductions.
[2024-05-29 22:04:21] [INFO ] Flatten gal took : 164 ms
[2024-05-29 22:04:21] [INFO ] Flatten gal took : 97 ms
[2024-05-29 22:04:21] [INFO ] Input system was already deterministic with 2410 transitions.
Support contains 29 out of 2690 places (down from 32) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 2082 ms. (19 steps per ms) remains 4/17 properties
BEST_FIRST walk for 40002 steps (8 resets) in 278 ms. (143 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 4/4 properties
[2024-05-29 22:04:22] [INFO ] Invariant cache hit.
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) 138/146 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2544/2690 variables, 432/441 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2690 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 2410/5100 variables, 2690/3131 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5100 variables, 0/3131 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/5100 variables, 0/3131 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5100/5100 variables, and 3131 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1734 ms.
Refiners :[Positive P Invariants (semi-flows): 441/441 constraints, State Equation: 2690/2690 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) 138/146 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2544/2690 variables, 432/441 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 22:04:24] [INFO ] Deduced a trap composed of 20 places in 262 ms of which 42 ms to minimize.
[2024-05-29 22:04:25] [INFO ] Deduced a trap composed of 24 places in 224 ms of which 5 ms to minimize.
[2024-05-29 22:04:25] [INFO ] Deduced a trap composed of 21 places in 226 ms of which 4 ms to minimize.
[2024-05-29 22:04:25] [INFO ] Deduced a trap composed of 23 places in 186 ms of which 5 ms to minimize.
[2024-05-29 22:04:25] [INFO ] Deduced a trap composed of 18 places in 203 ms of which 4 ms to minimize.
[2024-05-29 22:04:26] [INFO ] Deduced a trap composed of 32 places in 191 ms of which 4 ms to minimize.
[2024-05-29 22:04:26] [INFO ] Deduced a trap composed of 19 places in 166 ms of which 4 ms to minimize.
[2024-05-29 22:04:26] [INFO ] Deduced a trap composed of 26 places in 167 ms of which 4 ms to minimize.
[2024-05-29 22:04:26] [INFO ] Deduced a trap composed of 33 places in 158 ms of which 3 ms to minimize.
[2024-05-29 22:04:26] [INFO ] Deduced a trap composed of 20 places in 156 ms of which 3 ms to minimize.
[2024-05-29 22:04:27] [INFO ] Deduced a trap composed of 22 places in 158 ms of which 4 ms to minimize.
[2024-05-29 22:04:27] [INFO ] Deduced a trap composed of 30 places in 139 ms of which 3 ms to minimize.
[2024-05-29 22:04:27] [INFO ] Deduced a trap composed of 31 places in 143 ms of which 3 ms to minimize.
[2024-05-29 22:04:27] [INFO ] Deduced a trap composed of 37 places in 141 ms of which 3 ms to minimize.
[2024-05-29 22:04:27] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 3 ms to minimize.
[2024-05-29 22:04:27] [INFO ] Deduced a trap composed of 31 places in 126 ms of which 3 ms to minimize.
[2024-05-29 22:04:28] [INFO ] Deduced a trap composed of 34 places in 121 ms of which 3 ms to minimize.
[2024-05-29 22:04:28] [INFO ] Deduced a trap composed of 27 places in 118 ms of which 3 ms to minimize.
[2024-05-29 22:04:28] [INFO ] Deduced a trap composed of 36 places in 127 ms of which 2 ms to minimize.
[2024-05-29 22:04:28] [INFO ] Deduced a trap composed of 41 places in 115 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/2690 variables, 20/461 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 22:04:28] [INFO ] Deduced a trap composed of 37 places in 109 ms of which 3 ms to minimize.
[2024-05-29 22:04:28] [INFO ] Deduced a trap composed of 38 places in 100 ms of which 2 ms to minimize.
[2024-05-29 22:04:28] [INFO ] Deduced a trap composed of 43 places in 92 ms of which 2 ms to minimize.
[2024-05-29 22:04:29] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 2 ms to minimize.
SMT process timed out in 6800ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 8 out of 2690 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2690/2690 places, 2410/2410 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 555 transitions
Trivial Post-agglo rules discarded 555 transitions
Performed 555 trivial Post agglomeration. Transition count delta: 555
Iterating post reduction 0 with 555 rules applied. Total rules applied 555 place count 2690 transition count 1855
Reduce places removed 555 places and 0 transitions.
Iterating post reduction 1 with 555 rules applied. Total rules applied 1110 place count 2135 transition count 1855
Performed 315 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 315 Pre rules applied. Total rules applied 1110 place count 2135 transition count 1540
Deduced a syphon composed of 315 places in 2 ms
Reduce places removed 315 places and 0 transitions.
Iterating global reduction 2 with 630 rules applied. Total rules applied 1740 place count 1820 transition count 1540
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 1744 place count 1816 transition count 1536
Iterating global reduction 2 with 4 rules applied. Total rules applied 1748 place count 1816 transition count 1536
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 1748 place count 1816 transition count 1533
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 1754 place count 1813 transition count 1533
Performed 683 Post agglomeration using F-continuation condition.Transition count delta: 683
Deduced a syphon composed of 683 places in 7 ms
Reduce places removed 683 places and 0 transitions.
Iterating global reduction 2 with 1366 rules applied. Total rules applied 3120 place count 1130 transition count 850
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3121 place count 1130 transition count 849
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3123 place count 1129 transition count 848
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3325 place count 1028 transition count 848
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 2 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 3361 place count 1010 transition count 848
Partial Free-agglomeration rule applied 118 times.
Drop transitions (Partial Free agglomeration) removed 118 transitions
Iterating global reduction 3 with 118 rules applied. Total rules applied 3479 place count 1010 transition count 848
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 3480 place count 1009 transition count 847
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3481 place count 1008 transition count 847
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 3481 place count 1008 transition count 845
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 3485 place count 1006 transition count 845
Applied a total of 3485 rules in 748 ms. Remains 1006 /2690 variables (removed 1684) and now considering 845/2410 (removed 1565) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 749 ms. Remains : 1006/2690 places, 845/2410 transitions.
RANDOM walk for 40000 steps (8 resets) in 710 ms. (56 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 372 ms. (107 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 530 ms. (75 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 399 ms. (100 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 203 ms. (196 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 136208 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :0 out of 4
Probabilistic random walk after 136208 steps, saw 110256 distinct states, run finished after 3004 ms. (steps per millisecond=45 ) properties seen :0
// Phase 1: matrix 845 rows 1006 cols
[2024-05-29 22:04:33] [INFO ] Computed 440 invariants in 3 ms
[2024-05-29 22:04:33] [INFO ] State equation strengthened by 4 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) 21/29 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2/31 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 44/75 variables, 31/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 134/209 variables, 64/105 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 19/124 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/209 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/209 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 10/219 variables, 10/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/219 variables, 10/146 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/219 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 20/239 variables, 10/156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/239 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 179/418 variables, 97/253 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/418 variables, 31/284 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/418 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 6/424 variables, 6/290 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/424 variables, 6/296 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/424 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 12/436 variables, 6/302 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/436 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 293/729 variables, 151/453 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/729 variables, 47/500 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/729 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (OVERLAPS) 18/747 variables, 19/519 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/747 variables, 18/537 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/747 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (OVERLAPS) 34/781 variables, 17/554 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/781 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (OVERLAPS) 317/1098 variables, 190/744 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1098 variables, 50/794 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1098 variables, 0/794 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (OVERLAPS) 13/1111 variables, 24/818 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1111 variables, 13/831 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1111 variables, 0/831 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 38 (OVERLAPS) 4/1115 variables, 2/833 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1115 variables, 0/833 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 40 (OVERLAPS) 223/1338 variables, 122/955 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1338 variables, 38/993 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1338 variables, 0/993 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 43 (OVERLAPS) 14/1352 variables, 19/1012 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1352 variables, 14/1026 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1352 variables, 0/1026 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 46 (OVERLAPS) 18/1370 variables, 9/1035 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1370 variables, 0/1035 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 48 (OVERLAPS) 153/1523 variables, 100/1135 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1523 variables, 34/1169 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1523 variables, 0/1169 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 51 (OVERLAPS) 2/1525 variables, 4/1173 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1525 variables, 2/1175 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1525 variables, 0/1175 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 54 (OVERLAPS) 109/1634 variables, 57/1232 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1634 variables, 16/1248 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1634 variables, 0/1248 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 57 (OVERLAPS) 9/1643 variables, 12/1260 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1643 variables, 9/1269 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1643 variables, 0/1269 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 60 (OVERLAPS) 12/1655 variables, 6/1275 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1655 variables, 0/1275 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 62 (OVERLAPS) 72/1727 variables, 49/1324 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1727 variables, 17/1341 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1727 variables, 0/1341 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 65 (OVERLAPS) 49/1776 variables, 29/1370 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1776 variables, 10/1380 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1776 variables, 0/1380 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 68 (OVERLAPS) 2/1778 variables, 4/1384 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1778 variables, 2/1386 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1778 variables, 0/1386 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 71 (OVERLAPS) 15/1793 variables, 8/1394 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1793 variables, 4/1398 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1793 variables, 1/1399 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1793 variables, 0/1399 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 75 (OVERLAPS) 26/1819 variables, 14/1413 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1819 variables, 3/1416 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1819 variables, 0/1416 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 78 (OVERLAPS) 2/1821 variables, 4/1420 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1821 variables, 2/1422 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1821 variables, 0/1422 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 81 (OVERLAPS) 10/1831 variables, 6/1428 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/1831 variables, 3/1431 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/1831 variables, 0/1431 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 84 (OVERLAPS) 16/1847 variables, 8/1439 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/1847 variables, 3/1442 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/1847 variables, 1/1443 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1847 variables, 0/1443 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 88 (OVERLAPS) 1/1848 variables, 1/1444 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/1848 variables, 1/1445 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/1848 variables, 0/1445 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 91 (OVERLAPS) 1/1849 variables, 1/1446 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/1849 variables, 1/1447 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/1849 variables, 0/1447 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 94 (OVERLAPS) 2/1851 variables, 2/1449 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/1851 variables, 1/1450 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/1851 variables, 0/1450 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 97 (OVERLAPS) 0/1851 variables, 0/1450 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1851/1851 variables, and 1450 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2617 ms.
Refiners :[Positive P Invariants (semi-flows): 440/440 constraints, State Equation: 1006/1006 constraints, ReadFeed: 4/4 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) 21/29 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2/31 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 44/75 variables, 31/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 134/209 variables, 64/105 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 19/124 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/209 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/209 variables, 4/130 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 22:04:36] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-05-29 22:04:36] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/209 variables, 2/132 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/209 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 10/219 variables, 10/142 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/219 variables, 10/152 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/219 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 20/239 variables, 10/162 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/239 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 179/418 variables, 97/259 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/418 variables, 31/290 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/418 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 6/424 variables, 6/296 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/424 variables, 6/302 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/424 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 12/436 variables, 6/308 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/436 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (OVERLAPS) 293/729 variables, 151/459 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/729 variables, 47/506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/729 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (OVERLAPS) 18/747 variables, 19/525 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/747 variables, 18/543 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 22:04:36] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 2 ms to minimize.
At refinement iteration 31 (INCLUDED_ONLY) 0/747 variables, 1/544 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/747 variables, 0/544 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (OVERLAPS) 34/781 variables, 17/561 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/781 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (OVERLAPS) 317/1098 variables, 190/751 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1098 variables, 50/801 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 22:04:37] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 2 ms to minimize.
[2024-05-29 22:04:37] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 3 ms to minimize.
[2024-05-29 22:04:37] [INFO ] Deduced a trap composed of 5 places in 82 ms of which 1 ms to minimize.
At refinement iteration 37 (INCLUDED_ONLY) 0/1098 variables, 3/804 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1098 variables, 0/804 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 39 (OVERLAPS) 13/1111 variables, 24/828 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1111 variables, 13/841 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1111 variables, 0/841 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 42 (OVERLAPS) 4/1115 variables, 2/843 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1115 variables, 0/843 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 44 (OVERLAPS) 223/1338 variables, 122/965 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1338 variables, 38/1003 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1338 variables, 0/1003 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 47 (OVERLAPS) 14/1352 variables, 19/1022 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1352 variables, 14/1036 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1352 variables, 0/1036 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 50 (OVERLAPS) 18/1370 variables, 9/1045 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1370 variables, 0/1045 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 52 (OVERLAPS) 153/1523 variables, 100/1145 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1523 variables, 34/1179 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1523 variables, 0/1179 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 55 (OVERLAPS) 2/1525 variables, 4/1183 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1525 variables, 2/1185 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1525 variables, 0/1185 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 58 (OVERLAPS) 109/1634 variables, 57/1242 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1634 variables, 16/1258 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 22:04:38] [INFO ] Deduced a trap composed of 6 places in 117 ms of which 2 ms to minimize.
[2024-05-29 22:04:38] [INFO ] Deduced a trap composed of 6 places in 120 ms of which 3 ms to minimize.
At refinement iteration 60 (INCLUDED_ONLY) 0/1634 variables, 2/1260 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1634 variables, 0/1260 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 62 (OVERLAPS) 9/1643 variables, 12/1272 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1643 variables, 9/1281 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1643 variables, 0/1281 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 65 (OVERLAPS) 12/1655 variables, 6/1287 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1655 variables, 0/1287 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 67 (OVERLAPS) 72/1727 variables, 49/1336 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1727 variables, 17/1353 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1727 variables, 0/1353 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 70 (OVERLAPS) 49/1776 variables, 29/1382 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1776 variables, 10/1392 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1776 variables, 0/1392 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 73 (OVERLAPS) 2/1778 variables, 4/1396 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1778 variables, 2/1398 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1778 variables, 0/1398 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 76 (OVERLAPS) 15/1793 variables, 8/1406 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1793 variables, 4/1410 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1793 variables, 1/1411 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1793 variables, 0/1411 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 80 (OVERLAPS) 26/1819 variables, 14/1425 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1819 variables, 3/1428 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/1819 variables, 0/1428 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 83 (OVERLAPS) 2/1821 variables, 4/1432 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1821 variables, 2/1434 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/1821 variables, 0/1434 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 86 (OVERLAPS) 10/1831 variables, 6/1440 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1831 variables, 3/1443 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/1831 variables, 0/1443 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 89 (OVERLAPS) 16/1847 variables, 8/1451 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/1847 variables, 3/1454 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/1847 variables, 1/1455 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/1847 variables, 0/1455 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 93 (OVERLAPS) 1/1848 variables, 1/1456 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/1848 variables, 1/1457 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/1848 variables, 0/1457 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 96 (OVERLAPS) 1/1849 variables, 1/1458 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/1849 variables, 1/1459 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/1849 variables, 0/1459 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 99 (OVERLAPS) 2/1851 variables, 2/1461 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/1851 variables, 1/1462 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/1851 variables, 0/1462 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 102 (OVERLAPS) 0/1851 variables, 0/1462 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1851/1851 variables, and 1462 constraints, problems are : Problem set: 0 solved, 4 unsolved in 4306 ms.
Refiners :[Positive P Invariants (semi-flows): 440/440 constraints, State Equation: 1006/1006 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 8/8 constraints]
After SMT, in 6958ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 420 ms.
Support contains 8 out of 1006 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1006/1006 places, 845/845 transitions.
Applied a total of 0 rules in 30 ms. Remains 1006 /1006 variables (removed 0) and now considering 845/845 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 1006/1006 places, 845/845 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1006/1006 places, 845/845 transitions.
Applied a total of 0 rules in 42 ms. Remains 1006 /1006 variables (removed 0) and now considering 845/845 (removed 0) transitions.
[2024-05-29 22:04:41] [INFO ] Invariant cache hit.
[2024-05-29 22:04:41] [INFO ] Implicit Places using invariants in 496 ms returned [989, 993]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 498 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1004/1006 places, 845/845 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1002 transition count 843
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1002 transition count 843
Applied a total of 4 rules in 38 ms. Remains 1002 /1004 variables (removed 2) and now considering 843/845 (removed 2) transitions.
// Phase 1: matrix 843 rows 1002 cols
[2024-05-29 22:04:41] [INFO ] Computed 438 invariants in 7 ms
[2024-05-29 22:04:42] [INFO ] Implicit Places using invariants in 525 ms returned []
[2024-05-29 22:04:42] [INFO ] Invariant cache hit.
[2024-05-29 22:04:42] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 22:04:43] [INFO ] Implicit Places using invariants and state equation in 1012 ms returned []
Implicit Place search using SMT with State Equation took 1542 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1002/1006 places, 843/845 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2120 ms. Remains : 1002/1006 places, 843/845 transitions.
RANDOM walk for 40000 steps (8 resets) in 324 ms. (123 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 207 ms. (192 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 194 ms. (205 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 198 ms. (201 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 201 ms. (198 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 139349 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :0 out of 4
Probabilistic random walk after 139349 steps, saw 111981 distinct states, run finished after 3001 ms. (steps per millisecond=46 ) properties seen :0
[2024-05-29 22:04:46] [INFO ] Invariant cache hit.
[2024-05-29 22:04:46] [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) 21/29 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2/31 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 44/75 variables, 31/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 134/209 variables, 64/105 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 19/124 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/209 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/209 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 10/219 variables, 10/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/219 variables, 10/146 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/219 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 20/239 variables, 10/156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/239 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 179/418 variables, 97/253 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/418 variables, 31/284 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/418 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 6/424 variables, 6/290 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/424 variables, 6/296 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/424 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 12/436 variables, 6/302 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/436 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 293/729 variables, 151/453 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/729 variables, 47/500 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/729 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (OVERLAPS) 18/747 variables, 19/519 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/747 variables, 18/537 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/747 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (OVERLAPS) 34/781 variables, 17/554 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/781 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (OVERLAPS) 317/1098 variables, 190/744 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1098 variables, 50/794 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1098 variables, 0/794 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (OVERLAPS) 13/1111 variables, 24/818 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1111 variables, 13/831 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1111 variables, 0/831 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 38 (OVERLAPS) 4/1115 variables, 2/833 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1115 variables, 0/833 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 40 (OVERLAPS) 223/1338 variables, 122/955 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1338 variables, 38/993 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1338 variables, 0/993 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 43 (OVERLAPS) 14/1352 variables, 19/1012 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1352 variables, 14/1026 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1352 variables, 0/1026 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 46 (OVERLAPS) 18/1370 variables, 9/1035 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1370 variables, 0/1035 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 48 (OVERLAPS) 153/1523 variables, 100/1135 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1523 variables, 34/1169 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1523 variables, 0/1169 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 51 (OVERLAPS) 2/1525 variables, 4/1173 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1525 variables, 2/1175 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1525 variables, 0/1175 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 54 (OVERLAPS) 109/1634 variables, 57/1232 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1634 variables, 16/1248 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1634 variables, 0/1248 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 57 (OVERLAPS) 9/1643 variables, 12/1260 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1643 variables, 9/1269 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1643 variables, 0/1269 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 60 (OVERLAPS) 12/1655 variables, 6/1275 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1655 variables, 0/1275 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 62 (OVERLAPS) 72/1727 variables, 49/1324 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1727 variables, 17/1341 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1727 variables, 0/1341 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 65 (OVERLAPS) 49/1776 variables, 29/1370 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1776 variables, 10/1380 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1776 variables, 0/1380 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 68 (OVERLAPS) 2/1778 variables, 4/1384 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1778 variables, 2/1386 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1778 variables, 0/1386 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 71 (OVERLAPS) 14/1792 variables, 8/1394 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1792 variables, 4/1398 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1792 variables, 0/1398 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 74 (OVERLAPS) 24/1816 variables, 12/1410 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1816 variables, 2/1412 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1816 variables, 0/1412 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 77 (OVERLAPS) 2/1818 variables, 4/1416 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1818 variables, 2/1418 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1818 variables, 0/1418 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 80 (OVERLAPS) 10/1828 variables, 6/1424 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1828 variables, 3/1427 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/1828 variables, 0/1427 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 83 (OVERLAPS) 15/1843 variables, 8/1435 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1843 variables, 4/1439 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/1843 variables, 0/1439 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 86 (OVERLAPS) 2/1845 variables, 2/1441 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1845 variables, 1/1442 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/1845 variables, 0/1442 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 89 (OVERLAPS) 0/1845 variables, 0/1442 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1845/1845 variables, and 1442 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2416 ms.
Refiners :[Positive P Invariants (semi-flows): 438/438 constraints, State Equation: 1002/1002 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) 21/29 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2/31 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 44/75 variables, 31/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 134/209 variables, 64/105 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 19/124 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/209 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/209 variables, 4/130 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 22:04:48] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/209 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/209 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 10/219 variables, 10/141 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/219 variables, 10/151 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/219 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 20/239 variables, 10/161 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/239 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 179/418 variables, 97/258 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/418 variables, 31/289 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/418 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 6/424 variables, 6/295 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/424 variables, 6/301 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/424 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 12/436 variables, 6/307 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/436 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (OVERLAPS) 293/729 variables, 151/458 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/729 variables, 47/505 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/729 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (OVERLAPS) 18/747 variables, 19/524 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/747 variables, 18/542 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/747 variables, 0/542 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (OVERLAPS) 34/781 variables, 17/559 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/781 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (OVERLAPS) 317/1098 variables, 190/749 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1098 variables, 50/799 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1098 variables, 0/799 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (OVERLAPS) 13/1111 variables, 24/823 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1111 variables, 13/836 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1111 variables, 0/836 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 40 (OVERLAPS) 4/1115 variables, 2/838 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1115 variables, 0/838 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 42 (OVERLAPS) 223/1338 variables, 122/960 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1338 variables, 38/998 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 22:04:49] [INFO ] Deduced a trap composed of 5 places in 111 ms of which 6 ms to minimize.
At refinement iteration 44 (INCLUDED_ONLY) 0/1338 variables, 1/999 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1338 variables, 0/999 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 46 (OVERLAPS) 14/1352 variables, 19/1018 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1352 variables, 14/1032 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1352 variables, 0/1032 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 49 (OVERLAPS) 18/1370 variables, 9/1041 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 22:04:50] [INFO ] Deduced a trap composed of 6 places in 114 ms of which 2 ms to minimize.
At refinement iteration 50 (INCLUDED_ONLY) 0/1370 variables, 1/1042 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1370 variables, 0/1042 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 52 (OVERLAPS) 153/1523 variables, 100/1142 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1523 variables, 34/1176 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1523 variables, 0/1176 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 55 (OVERLAPS) 2/1525 variables, 4/1180 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1525 variables, 2/1182 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1525 variables, 0/1182 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 58 (OVERLAPS) 109/1634 variables, 57/1239 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1634 variables, 16/1255 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1634 variables, 0/1255 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 61 (OVERLAPS) 9/1643 variables, 12/1267 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1643 variables, 9/1276 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1643 variables, 0/1276 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 64 (OVERLAPS) 12/1655 variables, 6/1282 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1655 variables, 0/1282 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 66 (OVERLAPS) 72/1727 variables, 49/1331 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1727 variables, 17/1348 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1727 variables, 0/1348 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 69 (OVERLAPS) 49/1776 variables, 29/1377 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1776 variables, 10/1387 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1776 variables, 0/1387 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 72 (OVERLAPS) 2/1778 variables, 4/1391 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1778 variables, 2/1393 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1778 variables, 0/1393 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 75 (OVERLAPS) 14/1792 variables, 8/1401 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1792 variables, 4/1405 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1792 variables, 0/1405 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 78 (OVERLAPS) 24/1816 variables, 12/1417 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1816 variables, 2/1419 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1816 variables, 0/1419 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 81 (OVERLAPS) 2/1818 variables, 4/1423 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/1818 variables, 2/1425 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/1818 variables, 0/1425 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 84 (OVERLAPS) 10/1828 variables, 6/1431 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/1828 variables, 3/1434 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 22:04:51] [INFO ] Deduced a trap composed of 6 places in 141 ms of which 3 ms to minimize.
At refinement iteration 86 (INCLUDED_ONLY) 0/1828 variables, 1/1435 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1828 variables, 0/1435 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 88 (OVERLAPS) 15/1843 variables, 8/1443 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/1843 variables, 4/1447 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/1843 variables, 0/1447 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 91 (OVERLAPS) 2/1845 variables, 2/1449 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/1845 variables, 1/1450 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/1845 variables, 0/1450 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 94 (OVERLAPS) 0/1845 variables, 0/1450 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1845/1845 variables, and 1450 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3700 ms.
Refiners :[Positive P Invariants (semi-flows): 438/438 constraints, State Equation: 1002/1002 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 4/4 constraints]
After SMT, in 6125ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 404 ms.
Support contains 8 out of 1002 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1002/1002 places, 843/843 transitions.
Applied a total of 0 rules in 35 ms. Remains 1002 /1002 variables (removed 0) and now considering 843/843 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 1002/1002 places, 843/843 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1002/1002 places, 843/843 transitions.
Applied a total of 0 rules in 22 ms. Remains 1002 /1002 variables (removed 0) and now considering 843/843 (removed 0) transitions.
[2024-05-29 22:04:52] [INFO ] Invariant cache hit.
[2024-05-29 22:04:53] [INFO ] Implicit Places using invariants in 491 ms returned []
[2024-05-29 22:04:53] [INFO ] Invariant cache hit.
[2024-05-29 22:04:53] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 22:04:54] [INFO ] Implicit Places using invariants and state equation in 992 ms returned []
Implicit Place search using SMT with State Equation took 1488 ms to find 0 implicit places.
[2024-05-29 22:04:54] [INFO ] Redundant transitions in 45 ms returned []
Running 838 sub problems to find dead transitions.
[2024-05-29 22:04:54] [INFO ] Invariant cache hit.
[2024-05-29 22:04:54] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/999 variables, 435/435 constraints. Problems are: Problem set: 0 solved, 838 unsolved
[2024-05-29 22:05:07] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2024-05-29 22:05:07] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
[2024-05-29 22:05:07] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
[2024-05-29 22:05:07] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
[2024-05-29 22:05:07] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 0 ms to minimize.
[2024-05-29 22:05:07] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
[2024-05-29 22:05:07] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
[2024-05-29 22:05:07] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
[2024-05-29 22:05:07] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
[2024-05-29 22:05:07] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
[2024-05-29 22:05:07] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 0 ms to minimize.
[2024-05-29 22:05:07] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
[2024-05-29 22:05:08] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 1 ms to minimize.
[2024-05-29 22:05:08] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
[2024-05-29 22:05:08] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 2 ms to minimize.
[2024-05-29 22:05:08] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2024-05-29 22:05:08] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 0 ms to minimize.
[2024-05-29 22:05:08] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
[2024-05-29 22:05:08] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 1 ms to minimize.
[2024-05-29 22:05:08] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 9 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/999 variables, 20/455 constraints. Problems are: Problem set: 0 solved, 838 unsolved
[2024-05-29 22:05:13] [INFO ] Deduced a trap composed of 5 places in 251 ms of which 4 ms to minimize.
[2024-05-29 22:05:13] [INFO ] Deduced a trap composed of 7 places in 208 ms of which 4 ms to minimize.
[2024-05-29 22:05:13] [INFO ] Deduced a trap composed of 6 places in 191 ms of which 3 ms to minimize.
[2024-05-29 22:05:13] [INFO ] Deduced a trap composed of 7 places in 194 ms of which 3 ms to minimize.
[2024-05-29 22:05:13] [INFO ] Deduced a trap composed of 6 places in 191 ms of which 3 ms to minimize.
[2024-05-29 22:05:14] [INFO ] Deduced a trap composed of 6 places in 190 ms of which 4 ms to minimize.
[2024-05-29 22:05:14] [INFO ] Deduced a trap composed of 6 places in 189 ms of which 4 ms to minimize.
[2024-05-29 22:05:14] [INFO ] Deduced a trap composed of 5 places in 206 ms of which 5 ms to minimize.
[2024-05-29 22:05:14] [INFO ] Deduced a trap composed of 6 places in 203 ms of which 3 ms to minimize.
[2024-05-29 22:05:14] [INFO ] Deduced a trap composed of 5 places in 196 ms of which 4 ms to minimize.
[2024-05-29 22:05:15] [INFO ] Deduced a trap composed of 5 places in 193 ms of which 4 ms to minimize.
[2024-05-29 22:05:15] [INFO ] Deduced a trap composed of 5 places in 187 ms of which 4 ms to minimize.
[2024-05-29 22:05:15] [INFO ] Deduced a trap composed of 5 places in 202 ms of which 4 ms to minimize.
[2024-05-29 22:05:15] [INFO ] Deduced a trap composed of 5 places in 199 ms of which 4 ms to minimize.
[2024-05-29 22:05:16] [INFO ] Deduced a trap composed of 5 places in 195 ms of which 4 ms to minimize.
[2024-05-29 22:05:16] [INFO ] Deduced a trap composed of 5 places in 200 ms of which 4 ms to minimize.
[2024-05-29 22:05:16] [INFO ] Deduced a trap composed of 5 places in 187 ms of which 4 ms to minimize.
[2024-05-29 22:05:16] [INFO ] Deduced a trap composed of 5 places in 185 ms of which 3 ms to minimize.
[2024-05-29 22:05:16] [INFO ] Deduced a trap composed of 6 places in 186 ms of which 3 ms to minimize.
[2024-05-29 22:05:17] [INFO ] Deduced a trap composed of 6 places in 187 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/999 variables, 20/475 constraints. Problems are: Problem set: 0 solved, 838 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 999/1845 variables, and 475 constraints, problems are : Problem set: 0 solved, 838 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 435/438 constraints, State Equation: 0/1002 constraints, ReadFeed: 0/2 constraints, PredecessorRefiner: 838/838 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 838 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/999 variables, 435/435 constraints. Problems are: Problem set: 0 solved, 838 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/999 variables, 40/475 constraints. Problems are: Problem set: 0 solved, 838 unsolved
[2024-05-29 22:05:26] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 2 ms to minimize.
[2024-05-29 22:05:26] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 1 ms to minimize.
[2024-05-29 22:05:26] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2024-05-29 22:05:27] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2024-05-29 22:05:27] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
[2024-05-29 22:05:27] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
[2024-05-29 22:05:27] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-29 22:05:27] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 1 ms to minimize.
[2024-05-29 22:05:27] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 0 ms to minimize.
[2024-05-29 22:05:27] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
[2024-05-29 22:05:27] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
[2024-05-29 22:05:28] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 1 ms to minimize.
[2024-05-29 22:05:28] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 1 ms to minimize.
[2024-05-29 22:05:28] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 2 ms to minimize.
[2024-05-29 22:05:28] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 1 ms to minimize.
[2024-05-29 22:05:28] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 2 ms to minimize.
[2024-05-29 22:05:28] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 1 ms to minimize.
[2024-05-29 22:05:28] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2024-05-29 22:05:29] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 1 ms to minimize.
[2024-05-29 22:05:29] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/999 variables, 20/495 constraints. Problems are: Problem set: 0 solved, 838 unsolved
[2024-05-29 22:05:30] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-05-29 22:05:31] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 1 ms to minimize.
[2024-05-29 22:05:31] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
[2024-05-29 22:05:31] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 2 ms to minimize.
[2024-05-29 22:05:31] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 1 ms to minimize.
[2024-05-29 22:05:32] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 2 ms to minimize.
[2024-05-29 22:05:32] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 2 ms to minimize.
[2024-05-29 22:05:32] [INFO ] Deduced a trap composed of 6 places in 76 ms of which 1 ms to minimize.
[2024-05-29 22:05:32] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 1 ms to minimize.
[2024-05-29 22:05:32] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 2 ms to minimize.
[2024-05-29 22:05:32] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 1 ms to minimize.
[2024-05-29 22:05:33] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 2 ms to minimize.
[2024-05-29 22:05:33] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 2 ms to minimize.
[2024-05-29 22:05:33] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 1 ms to minimize.
[2024-05-29 22:05:33] [INFO ] Deduced a trap composed of 5 places in 82 ms of which 2 ms to minimize.
[2024-05-29 22:05:33] [INFO ] Deduced a trap composed of 6 places in 86 ms of which 2 ms to minimize.
[2024-05-29 22:05:33] [INFO ] Deduced a trap composed of 6 places in 88 ms of which 2 ms to minimize.
[2024-05-29 22:05:34] [INFO ] Deduced a trap composed of 6 places in 87 ms of which 2 ms to minimize.
[2024-05-29 22:05:34] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 2 ms to minimize.
[2024-05-29 22:05:34] [INFO ] Deduced a trap composed of 8 places in 97 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/999 variables, 20/515 constraints. Problems are: Problem set: 0 solved, 838 unsolved
[2024-05-29 22:05:35] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 1 ms to minimize.
[2024-05-29 22:05:36] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 0 ms to minimize.
[2024-05-29 22:05:36] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
[2024-05-29 22:05:36] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
[2024-05-29 22:05:36] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2024-05-29 22:05:36] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 0 ms to minimize.
[2024-05-29 22:05:36] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2024-05-29 22:05:36] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2024-05-29 22:05:36] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 1 ms to minimize.
[2024-05-29 22:05:36] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 1 ms to minimize.
[2024-05-29 22:05:37] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2024-05-29 22:05:37] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 1 ms to minimize.
[2024-05-29 22:05:37] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 1 ms to minimize.
[2024-05-29 22:05:37] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 1 ms to minimize.
[2024-05-29 22:05:37] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
[2024-05-29 22:05:37] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 2 ms to minimize.
[2024-05-29 22:05:38] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 2 ms to minimize.
[2024-05-29 22:05:38] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 1 ms to minimize.
[2024-05-29 22:05:38] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 1 ms to minimize.
[2024-05-29 22:05:38] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/999 variables, 20/535 constraints. Problems are: Problem set: 0 solved, 838 unsolved
[2024-05-29 22:05:42] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 2 ms to minimize.
[2024-05-29 22:05:42] [INFO ] Deduced a trap composed of 6 places in 100 ms of which 2 ms to minimize.
[2024-05-29 22:05:42] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 3 ms to minimize.
[2024-05-29 22:05:42] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 2 ms to minimize.
[2024-05-29 22:05:42] [INFO ] Deduced a trap composed of 6 places in 105 ms of which 2 ms to minimize.
[2024-05-29 22:05:43] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 3 ms to minimize.
[2024-05-29 22:05:43] [INFO ] Deduced a trap composed of 6 places in 114 ms of which 3 ms to minimize.
[2024-05-29 22:05:43] [INFO ] Deduced a trap composed of 5 places in 124 ms of which 2 ms to minimize.
[2024-05-29 22:05:43] [INFO ] Deduced a trap composed of 6 places in 122 ms of which 3 ms to minimize.
[2024-05-29 22:05:44] [INFO ] Deduced a trap composed of 7 places in 116 ms of which 2 ms to minimize.
[2024-05-29 22:05:44] [INFO ] Deduced a trap composed of 6 places in 116 ms of which 3 ms to minimize.
[2024-05-29 22:05:44] [INFO ] Deduced a trap composed of 6 places in 109 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/999 variables, 12/547 constraints. Problems are: Problem set: 0 solved, 838 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 0)
(s2 1)
(s3 0)
(s4 1)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 1)
(s12 0)
(s13 1)
(s14 0)
(s15 0)
(s16 1)
(s17 0)
(s18 1)
(s19 0)
(s20 1)
(s21 0)
(s22 1)
(s23 0)
(s24 1)
(s25 0)
(s26 1)
(s27 1)
(s28 0)
(s29 0)
(s30 0)
(s31 1)
(s32 0)
(s33 1)
(s34 0)
(s35 0)
(s36 1)
(s37 0)
(s38 1)
(s39 0)
(s40 0)
(s41 1)
(s42 0)
(s43 1)
(s44 0)
(s45 1)
(s46 0)
(s47 1)
(s48 0)
(s49 1)
(s50 0)
(s51 1)
(s52 1)
(s53 0)
(s54 0)
(s55 0)
(s56 1)
(s57 0)
(s58 1)
(s59 0)
(s60 0)
(s61 1)
(s62 0)
(s63 1)
(s64 0)
(s65 0)
(s66 1)
(s67 0)
(s68 1)
(s69 0)
(s70 1)
(s71 0)
(s72 1)
(s73 0)
(s74 1)
(s75 0)
(s76 1)
(s77 1)
(s78 0)
(s79 0)
(s80 0)
(s81 1)
(s82 0)
(s83 1)
(s84 0)
(s85 0)
(s86 1)
(s87 0)
(s88 1)
(s89 0)
(s90 0)
(s91 1)
(s92 0)
(s93 1)
(s94 1)
(s95 0)
(s96 0)
(s97 0)
(s98 1)
(s99 0)
(s100 1)
(s101 0)
(s102 1)
(s103 1)
(s104 0)
(s105 0)
(s106 0)
(s107 1)
(s108 0)
(s109 1)
(s110 0)
(s111 0)
(s112 1)
(s113 0)
(s114 1)
(s115 0)
(s116 0)
(s117 1)
(s118 0)
(s119 1)
(s120 0)
(s121 1)
(s122 0)
(s123 1)
(s124 0)
(s125 1)
(s126 0)
(s127 1)
(s128 1)
(s129 0)
(s130 0)
(s131 0)
(s132 1)
(s133 0)
(s134 1)
(s135 0)
(s136 0)
(s137 1)
(s138 0)
(s139 1)
(s140 0)
(s141 0)
(s142 1)
(s143 0)
(s144 1)
(s145 0)
(s146 1)
(s147 0)
(s148 1)
(s149 0)
(s150 1)
(s151 0)
(s152 1)
(s153 1)
(s154 0)
(s155 0)
(s156 0)
(s157 1)
(s158 0)
(s159 1)
(s160 0)
(s161 0)
(s162 1)
(s163 0)
(s164 1)
(s165 0)
(s166 0)
(s167 1)
(s168 0)
(s169 1)
(s170 0)
(s171 1)
(s172 0)
(s173 1)
(s174 1)
(s175 0)
(s176 0)
(s177 0)
(s178 1)
(s179 1)
(s180 0)
(s181 0)
(s182 0)
(s183 1)
(s184 0)
(s185 1)
(s186 0)
(s187 0)
(s188 1)
(s189 0)
(s190 1)
(s191 0)
(s192 0)
(s193 1)
(s194 0)
(s195 1)
(s196 0)
(s197 1)
(s198 0)
(s199 1)
(s200 0)
(s201 1)
(s202 0)
(s203 1)
(s204 1)
(s205 0)
(s206 0)
(s207 0)
(s208 1)
(s209 0)
(s210 1)
(s211 0)
(s212 0)
(s213 1)
(s214 0)
(s215 1)
(s216 0)
(s217 0)
(s218 1)
(s219 0)
(s220 1)
(s221 0)
(s222 1)
(s223 0)
(s224 1)
(s225 0)
(s226 1)
(s227 0)
(s228 1)
(s229 1)
(s230 0)
(s231 0)
(s232 0)
(s233 1)
(s234 0)
(s235 1)
(s236 0)
(s237 0)
(s238 1)
(s239 0)
(s240 1)
(s241 0)
(s242 0)
(s243 1)
(s244 0)
(s245 1)
(s246 0)
(s247 1)
(s248 0)
(s249 1)
(s250 0)
(s251 1)
(s252 0)
(s253 1)
(s254 1)
(s255 0)
(s256 1)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 1)
(s265 0)
(s266 1)
(s267 0)
(s268 0)
(s269 1)
(s270 0)
(s271 1)
(s272 0)
(s273 1)
(s274 0)
(s275 1)
(s276 0)
(s277 1)
(s278 0)
(s279 1)
(s280 1)
(s281 0)
(s282 0)
(s283 0)
(s284 1)
(s285 0)
(s286 1)
(s287 0)
(s288 0)
(s289 1)
(s290 0)
(s291 1)
(s292 0)
(s293 0)
(s294 1)
(s295 0)
(s296 1)
(s297 0)
(s298 1)
(s299 0)
(s300 1)
(s301 0)
(s302 1)
(s303 0)
(s304 1)
(s305 1)
(s306 0)
(s307 0)
(s308 0)
(s309 1)
(s310 0)
(s311 1)
(s312 0)
(s313 0)
(s314 1)
(s315 0)
(s316 1)
(s317 0)
(s318 0)
(s319 1)
(s320 0)
(s321 1)
(s322 0)
(s323 1)
(s324 0)
(s325 1)
(s326 0)
(s327 1)
(s328 0)
(s329 1)
(s330 1)
(s331 0)
(s332 0)
(s333 0)
(s334 1)
(s335 0)
(s336 1)
(s337 0)
(s338 0)
(s339 1)
(s340 0)
(s341 1)
(s342 0)
(s343 0)
(s344 1)
(s345 0)
(s346 1)
(s347 0)
(s348 1)
(s349 0)
(s350 1)
(s351 0)
(s352 1)
(s353 0)
(s354 1)
(s355 1)
(s356 0)
(s357 0)
(s358 0)
(s359 1)
(s360 0)
(s361 1)
(s362 0)
(s363 0)
(s364 1)
(s365 0)
(s366 1)
(s367 0)
(s368 0)
(s369 1)
(s370 0)
(s371 1)
(s372 0)
(s373 1)
(s374 0)
(s375 1)
(s376 0)
(s377 1)
(s378 0)
(s379 1)
(s380 1)
(s381 0)
(s382 0)
(s383 0)
(s384 1)
(s385 0)
(s386 1)
(s387 0)
(s388 0)
(s389 1)
(s390 0)
(s391 1)
(s392 0)
(s393 0)
(s394 1)
(s395 0)
(s396 1)
(s397 0)
(s398 1)
(s399 0)
(s400 1)
(s401 0)
(s402 1)
(s403 0)
(s404 1)
(s405 1)
(s406 0)
(s407 0)
(s408 0)
(s409 1)
(s410 0)
(s411 1)
(s412 0)
(s413 0)
(s414 1)
(s415 0)
(s416 1)
(s417 0)
(s418 0)
(s419 1)
(s420 0)
(s421 1)
(s422 0)
(s423 1)
(s424 0)
(s425 1)
(s426 1)
(s427 0)
(s428 0)
(s429 0)
(s430 1)
(s431 1)
(s432 0)
(s433 timeout
0)
(s434 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 999/1845 variables, and 547 constraints, problems are : Problem set: 0 solved, 838 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 435/438 constraints, State Equation: 0/1002 constraints, ReadFeed: 0/2 constraints, PredecessorRefiner: 0/838 constraints, Known Traps: 112/112 constraints]
After SMT, in 60185ms problems are : Problem set: 0 solved, 838 unsolved
Search for dead transitions found 0 dead transitions in 60193ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61761 ms. Remains : 1002/1002 places, 843/843 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 235 times.
Drop transitions (Partial Free agglomeration) removed 235 transitions
Iterating global reduction 0 with 235 rules applied. Total rules applied 235 place count 1002 transition count 843
Applied a total of 235 rules in 53 ms. Remains 1002 /1002 variables (removed 0) and now considering 843/843 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 843 rows 1002 cols
[2024-05-29 22:05:54] [INFO ] Computed 438 invariants in 8 ms
[2024-05-29 22:05:54] [INFO ] After 178ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 22:05:55] [INFO ] [Nat]Absence check using 438 positive place invariants in 59 ms returned sat
[2024-05-29 22:05:55] [INFO ] After 443ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 22:05:55] [INFO ] State equation strengthened by 230 read => feed constraints.
[2024-05-29 22:05:56] [INFO ] After 325ms SMT Verify possible using 230 Read/Feed constraints in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-29 22:05:56] [INFO ] Deduced a trap composed of 7 places in 156 ms of which 3 ms to minimize.
[2024-05-29 22:05:56] [INFO ] Deduced a trap composed of 9 places in 149 ms of which 3 ms to minimize.
[2024-05-29 22:05:56] [INFO ] Deduced a trap composed of 5 places in 146 ms of which 4 ms to minimize.
[2024-05-29 22:05:56] [INFO ] Deduced a trap composed of 5 places in 135 ms of which 2 ms to minimize.
[2024-05-29 22:05:56] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 791 ms
[2024-05-29 22:05:57] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 2 ms to minimize.
[2024-05-29 22:05:57] [INFO ] Deduced a trap composed of 5 places in 142 ms of which 3 ms to minimize.
[2024-05-29 22:05:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 403 ms
TRAPS : Iteration 1
[2024-05-29 22:05:57] [INFO ] Deduced a trap composed of 5 places in 148 ms of which 3 ms to minimize.
[2024-05-29 22:05:57] [INFO ] Deduced a trap composed of 3 places in 143 ms of which 2 ms to minimize.
[2024-05-29 22:05:58] [INFO ] Deduced a trap composed of 5 places in 140 ms of which 3 ms to minimize.
[2024-05-29 22:05:58] [INFO ] Deduced a trap composed of 5 places in 139 ms of which 2 ms to minimize.
[2024-05-29 22:05:58] [INFO ] Deduced a trap composed of 5 places in 144 ms of which 2 ms to minimize.
[2024-05-29 22:05:58] [INFO ] Deduced a trap composed of 5 places in 135 ms of which 3 ms to minimize.
[2024-05-29 22:05:58] [INFO ] Deduced a trap composed of 5 places in 132 ms of which 3 ms to minimize.
[2024-05-29 22:05:58] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1302 ms
TRAPS : Iteration 2
[2024-05-29 22:05:59] [INFO ] Deduced a trap composed of 5 places in 146 ms of which 3 ms to minimize.
[2024-05-29 22:05:59] [INFO ] Deduced a trap composed of 7 places in 151 ms of which 2 ms to minimize.
[2024-05-29 22:05:59] [INFO ] Deduced a trap composed of 5 places in 148 ms of which 2 ms to minimize.
[2024-05-29 22:05:59] [INFO ] Deduced a trap composed of 7 places in 151 ms of which 3 ms to minimize.
[2024-05-29 22:05:59] [INFO ] Deduced a trap composed of 7 places in 148 ms of which 3 ms to minimize.
[2024-05-29 22:06:00] [INFO ] Deduced a trap composed of 5 places in 157 ms of which 3 ms to minimize.
[2024-05-29 22:06:00] [INFO ] Deduced a trap composed of 7 places in 154 ms of which 3 ms to minimize.
[2024-05-29 22:06:00] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1408 ms
TRAPS : Iteration 3
[2024-05-29 22:06:00] [INFO ] After 5207ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-29 22:06:01] [INFO ] After 6151ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 6409 ms.
Computed a total of 638 stabilizing places and 638 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((p0&&X(X(G(p1))))))'
Support contains 4 out of 2690 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2690/2690 places, 2410/2410 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 2682 transition count 2402
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 2682 transition count 2402
Applied a total of 16 rules in 353 ms. Remains 2682 /2690 variables (removed 8) and now considering 2402/2410 (removed 8) transitions.
// Phase 1: matrix 2402 rows 2682 cols
[2024-05-29 22:06:01] [INFO ] Computed 441 invariants in 18 ms
[2024-05-29 22:06:02] [INFO ] Implicit Places using invariants in 839 ms returned []
[2024-05-29 22:06:02] [INFO ] Invariant cache hit.
[2024-05-29 22:06:04] [INFO ] Implicit Places using invariants and state equation in 2373 ms returned []
Implicit Place search using SMT with State Equation took 3214 ms to find 0 implicit places.
Running 2401 sub problems to find dead transitions.
[2024-05-29 22:06:05] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2681/5084 variables, and 0 constraints, problems are : Problem set: 0 solved, 2401 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 0/441 constraints, State Equation: 0/2682 constraints, PredecessorRefiner: 2401/2401 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2401 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2681/5084 variables, and 0 constraints, problems are : Problem set: 0 solved, 2401 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 0/441 constraints, State Equation: 0/2682 constraints, PredecessorRefiner: 0/2401 constraints, Known Traps: 0/0 constraints]
After SMT, in 60652ms problems are : Problem set: 0 solved, 2401 unsolved
Search for dead transitions found 0 dead transitions in 60678ms
Starting structural reductions in LTL mode, iteration 1 : 2682/2690 places, 2402/2410 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64252 ms. Remains : 2682/2690 places, 2402/2410 transitions.
Stuttering acceptance computed with spot in 324 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-040B-LTLCardinality-00
Product exploration explored 100000 steps with 0 reset in 829 ms.
Stack based approach found an accepted trace after 3478 steps with 0 reset with depth 3479 and stack size 3479 in 33 ms.
FORMULA ShieldPPPt-PT-040B-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-040B-LTLCardinality-00 finished in 65525 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 2690 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2690/2690 places, 2410/2410 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 2681 transition count 2401
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 2681 transition count 2401
Applied a total of 18 rules in 358 ms. Remains 2681 /2690 variables (removed 9) and now considering 2401/2410 (removed 9) transitions.
// Phase 1: matrix 2401 rows 2681 cols
[2024-05-29 22:07:07] [INFO ] Computed 441 invariants in 13 ms
[2024-05-29 22:07:08] [INFO ] Implicit Places using invariants in 833 ms returned []
[2024-05-29 22:07:08] [INFO ] Invariant cache hit.
[2024-05-29 22:07:10] [INFO ] Implicit Places using invariants and state equation in 2355 ms returned []
Implicit Place search using SMT with State Equation took 3198 ms to find 0 implicit places.
Running 2400 sub problems to find dead transitions.
[2024-05-29 22:07:10] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2680/5082 variables, and 0 constraints, problems are : Problem set: 0 solved, 2400 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 0/441 constraints, State Equation: 0/2681 constraints, PredecessorRefiner: 2400/2400 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2680/5082 variables, and 0 constraints, problems are : Problem set: 0 solved, 2400 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/441 constraints, State Equation: 0/2681 constraints, PredecessorRefiner: 0/2400 constraints, Known Traps: 0/0 constraints]
After SMT, in 60692ms problems are : Problem set: 0 solved, 2400 unsolved
Search for dead transitions found 0 dead transitions in 60713ms
Starting structural reductions in LTL mode, iteration 1 : 2681/2690 places, 2401/2410 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64278 ms. Remains : 2681/2690 places, 2401/2410 transitions.
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-040B-LTLCardinality-01
Product exploration explored 100000 steps with 33333 reset in 456 ms.
Product exploration explored 100000 steps with 33333 reset in 477 ms.
Computed a total of 638 stabilizing places and 638 stable transitions
Computed a total of 638 stabilizing places and 638 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 21 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-040B-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-040B-LTLCardinality-01 finished in 65430 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(p1)))'
Support contains 4 out of 2690 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2690/2690 places, 2410/2410 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 2682 transition count 2402
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 2682 transition count 2402
Applied a total of 16 rules in 326 ms. Remains 2682 /2690 variables (removed 8) and now considering 2402/2410 (removed 8) transitions.
// Phase 1: matrix 2402 rows 2682 cols
[2024-05-29 22:08:12] [INFO ] Computed 441 invariants in 15 ms
[2024-05-29 22:08:13] [INFO ] Implicit Places using invariants in 799 ms returned []
[2024-05-29 22:08:13] [INFO ] Invariant cache hit.
[2024-05-29 22:08:15] [INFO ] Implicit Places using invariants and state equation in 2150 ms returned []
Implicit Place search using SMT with State Equation took 2950 ms to find 0 implicit places.
Running 2401 sub problems to find dead transitions.
[2024-05-29 22:08:15] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2681/5084 variables, and 0 constraints, problems are : Problem set: 0 solved, 2401 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/441 constraints, State Equation: 0/2682 constraints, PredecessorRefiner: 2401/2401 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2401 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2681/5084 variables, and 0 constraints, problems are : Problem set: 0 solved, 2401 unsolved in 30068 ms.
Refiners :[Positive P Invariants (semi-flows): 0/441 constraints, State Equation: 0/2682 constraints, PredecessorRefiner: 0/2401 constraints, Known Traps: 0/0 constraints]
After SMT, in 60735ms problems are : Problem set: 0 solved, 2401 unsolved
Search for dead transitions found 0 dead transitions in 60757ms
Starting structural reductions in LTL mode, iteration 1 : 2682/2690 places, 2402/2410 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64042 ms. Remains : 2682/2690 places, 2402/2410 transitions.
Stuttering acceptance computed with spot in 158 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-040B-LTLCardinality-02
Product exploration explored 100000 steps with 50000 reset in 594 ms.
Product exploration explored 100000 steps with 50000 reset in 604 ms.
Computed a total of 638 stabilizing places and 638 stable transitions
Computed a total of 638 stabilizing places and 638 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 16 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-040B-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-040B-LTLCardinality-02 finished in 65477 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 2690 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2690/2690 places, 2410/2410 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 2682 transition count 2402
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 2682 transition count 2402
Applied a total of 16 rules in 323 ms. Remains 2682 /2690 variables (removed 8) and now considering 2402/2410 (removed 8) transitions.
// Phase 1: matrix 2402 rows 2682 cols
[2024-05-29 22:09:18] [INFO ] Computed 441 invariants in 10 ms
[2024-05-29 22:09:19] [INFO ] Implicit Places using invariants in 866 ms returned []
[2024-05-29 22:09:19] [INFO ] Invariant cache hit.
[2024-05-29 22:09:21] [INFO ] Implicit Places using invariants and state equation in 2284 ms returned []
Implicit Place search using SMT with State Equation took 3169 ms to find 0 implicit places.
Running 2401 sub problems to find dead transitions.
[2024-05-29 22:09:21] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2681/5084 variables, and 0 constraints, problems are : Problem set: 0 solved, 2401 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/441 constraints, State Equation: 0/2682 constraints, PredecessorRefiner: 2401/2401 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2401 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 1)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 1)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 1)
(s760 1)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 1)
(s771 1)
(s772 1)
(s773 1)
(s774 1)
(s775 1)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 1)
(s800 1)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 1)
(s809 1)
(s810 1)
(s811 1)
(s812 1)
(s813 1)
(s814 1)
(s815 1)
(s816 1)
(s817 1)
(s818 1)
(s819 1)
(s820 1)
(s821 1)
(s822 1)
(s823 1)
(s824 1)
(s825 1)
(s826 1)
(s827 1)
(s828 1)
(s829 1)
(s830 1)
(s831 1)
(s832 1)
(s833 1)
(s834 1)
(s835 1)
(s836 1)
(s837 1)
(s838 1)
(s839 1)
(s840 1)
(s841 1)
(s842 1)
(s843 1)
(s844 1)
(s845 1)
(s846 1)
(s847 1)
(s848 1)
(s849 1)
(s850 1)
(s851 1)
(s852 1)
(s853 1)
(s854 1)
(s855 1)
(s856 1)
(s857 1)
(s858 1)
(s859 1)
(s860 1)
(s861 1)
(s862 1)
(s863 1)
(s864 1)
(s865 1)
(s866 1)
(s867 1)
(s868 1)
(s869 1)
(s870 1)
(s871 1)
(s872 1)
(s873 1)
(s874 1)
(s875 1)
(s876 1)
(s877 1)
(s878 1)
(s879 1)
(s880 1)
(s881 1)
(s882 1)
(s883 1)
(s884 1)
(s885 1)
(s886 1)
(s887 1)
(s888 1)
(s889 1)
(s890 1)
(s891 1)
(s892 1)
(s893 1)
(s894 1)
(s895 1)
(s896 1)
(s897 1)
(s898 1)
(s899 1)
(s900 1)
(s901 1)
(s902 1)
(s903 1)
(s904 1)
(s905 1)
(s906 1)
(s907 1)
(s908 1)
(s909 1)
(s910 1)
(s911 1)
(s912 1)
(s913 1)
(s914 1)
(s915 1)
(s916 1)
(s917 1)
(s918 1)
(s919 1)
(s920 1)
(s921 1)
(s922 1)
(s923 1)
(s924 1)
(s925 1)
(s926 1)
(s927 1)
(s928 1)
(s929 1)
(s930 1)
(s931 1)
(s932 1)
(s933 1)
(s934 1)
(s935 1)
(s936 1)
(s937 1)
(s938 1)
(s939 1)
(s940 1)
(s941 1)
(s942 1)
(s943 1)
(s944 1)
(s945 1)
(s946 1)
(s947 1)
(s948 1)
(s949 1)
(s950 1)
(s951 1)
(s952 1)
(s953 1)
(s954 1)
(s955 1)
(s956 1)
(s957 1)
(s958 1)
(s959 1)
(s960 1)
(s961 1)
(s962 1)
(s963 1)
(s964 1)
(s965 1)
(s966 1)
(s967 1)
(s968 1)
(s969 1)
(s970 1)
(s971 1)
(s972 1)
(s973 1)
(s974 1)
(s975 1)
(s976 1)
(s977 1)
(s978 1)
(s979 1)
(s980 1)
(s981 1)
(s982 1)
(s983 1)
(s984 1)
(s985 1)
(s986 1)
(s987 1)
(s988 1)
(s989 1)
(s990 1)
(s991 1)
(s992 1)
(s993 1)
(s994 1)
(s995 1)
(s996 1)
(s997 1)
(s998 1)
(s999 1)
(s1000 1)
(s1001 1)
(s1002 1)
(s1003 1)
(s1004 1)
(s1005 1)
(s1006 1)
(s1007 1)
(s1008 1)
(s1009 1)
(s1010 1)
(s1011 1)
(s1012 1)
(s1013 1)
(s1014 1)
(s1015 1)
(s1016 1)
(s1017 1)
(s1018 1)
(s1019 1)
(s1020 1)
(s1021 1)
(s1022 1)
(s1023 1)
(s1024 1)
(s1025 1)
(s1026 1)
(s1027 1)
(s1028 1)
(s1029 1)
(s1030 1)
(s1031 1)
(s1032 1)
(s1033 1)
(s1034 1)
(s1035 1)
(s1036 1)
(s1037 1)
(s1038 1)
(s1039 1)
(s1040 1)
(s1041 1)
(s1042 1)
(s1043 1)
(s1044 1)
(s1045 1)
(s1046 1)
(s1047 1)
(s1048 1)
(s1049 1)
(s1050 1)
(s1051 1)
(s1052 1)
(s1053 1)
(s1054 1)
(s1055 1)
(s1056 1)
(s1057 1)
(s1058 1)
(s1059 1)
(s1060 1)
(s1061 1)
(s1062 1)
(s1063 1)
(s1064 1)
(s1065 1)
(s1066 1)
(s1067 1)
(s1068 1)
(s1069 1)
(s1070 1)
(s1071 1)
(s1072 1)
(s1073 1)
(s1074 1)
(s1075 1)
(s1076 1)
(s1077 1)
(s1078 1)
(s1079 1)
(s1080 1)
(s1081 1)
(s1082 1)
(s1083 1)
(s1084 1)
(s1085 1)
(s1086 1)
(s1087 1)
(s1088 1)
(s1089 1)
(s1090 1)
(s1091 1)
(s1092 1)
(s1093 1)
(s1094 1)
(s1095 1)
(s1096 1)
(s1097 1)
(s1098 1)
(s1099 1)
(s1100 1)
(s1101 timeout
1 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2681/5084 variables, and 0 constraints, problems are : Problem set: 0 solved, 2401 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 0/441 constraints, State Equation: 0/2682 constraints, PredecessorRefiner: 0/2401 constraints, Known Traps: 0/0 constraints]
After SMT, in 60650ms problems are : Problem set: 0 solved, 2401 unsolved
Search for dead transitions found 0 dead transitions in 60669ms
Starting structural reductions in LTL mode, iteration 1 : 2682/2690 places, 2402/2410 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64168 ms. Remains : 2682/2690 places, 2402/2410 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : ShieldPPPt-PT-040B-LTLCardinality-04
Product exploration explored 100000 steps with 50000 reset in 584 ms.
Product exploration explored 100000 steps with 50000 reset in 584 ms.
Computed a total of 638 stabilizing places and 638 stable transitions
Computed a total of 638 stabilizing places and 638 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 10 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-040B-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-040B-LTLCardinality-04 finished in 65488 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1)&&F((!p1 U (p2||G(!p1)))))))'
Support contains 6 out of 2690 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2690/2690 places, 2410/2410 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 553 transitions
Trivial Post-agglo rules discarded 553 transitions
Performed 553 trivial Post agglomeration. Transition count delta: 553
Iterating post reduction 0 with 553 rules applied. Total rules applied 553 place count 2689 transition count 1856
Reduce places removed 553 places and 0 transitions.
Iterating post reduction 1 with 553 rules applied. Total rules applied 1106 place count 2136 transition count 1856
Performed 315 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 315 Pre rules applied. Total rules applied 1106 place count 2136 transition count 1541
Deduced a syphon composed of 315 places in 18 ms
Reduce places removed 315 places and 0 transitions.
Iterating global reduction 2 with 630 rules applied. Total rules applied 1736 place count 1821 transition count 1541
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 1743 place count 1814 transition count 1534
Iterating global reduction 2 with 7 rules applied. Total rules applied 1750 place count 1814 transition count 1534
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 1750 place count 1814 transition count 1528
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 1762 place count 1808 transition count 1528
Performed 679 Post agglomeration using F-continuation condition.Transition count delta: 679
Deduced a syphon composed of 679 places in 1 ms
Reduce places removed 679 places and 0 transitions.
Iterating global reduction 2 with 1358 rules applied. Total rules applied 3120 place count 1129 transition count 849
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3121 place count 1129 transition count 848
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3123 place count 1128 transition count 847
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3325 place count 1027 transition count 847
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 3357 place count 1011 transition count 847
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3359 place count 1009 transition count 845
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3360 place count 1008 transition count 845
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 3360 place count 1008 transition count 843
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 3364 place count 1006 transition count 843
Applied a total of 3364 rules in 626 ms. Remains 1006 /2690 variables (removed 1684) and now considering 843/2410 (removed 1567) transitions.
// Phase 1: matrix 843 rows 1006 cols
[2024-05-29 22:10:23] [INFO ] Computed 440 invariants in 5 ms
[2024-05-29 22:10:24] [INFO ] Implicit Places using invariants in 517 ms returned [989, 993]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 519 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1004/2690 places, 843/2410 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1002 transition count 841
Applied a total of 4 rules in 39 ms. Remains 1002 /1004 variables (removed 2) and now considering 841/843 (removed 2) transitions.
// Phase 1: matrix 841 rows 1002 cols
[2024-05-29 22:10:24] [INFO ] Computed 438 invariants in 3 ms
[2024-05-29 22:10:24] [INFO ] Implicit Places using invariants in 508 ms returned []
[2024-05-29 22:10:24] [INFO ] Invariant cache hit.
[2024-05-29 22:10:25] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 22:10:25] [INFO ] Implicit Places using invariants and state equation in 872 ms returned []
Implicit Place search using SMT with State Equation took 1382 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1002/2690 places, 841/2410 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2567 ms. Remains : 1002/2690 places, 841/2410 transitions.
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (NOT p1), (NOT p0), (AND p1 (NOT p2))]
Running random walk in product with property : ShieldPPPt-PT-040B-LTLCardinality-05
Product exploration explored 100000 steps with 1 reset in 724 ms.
Stack based approach found an accepted trace after 25 steps with 0 reset with depth 26 and stack size 26 in 1 ms.
FORMULA ShieldPPPt-PT-040B-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-040B-LTLCardinality-05 finished in 3476 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X(p1)))))'
Support contains 3 out of 2690 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2690/2690 places, 2410/2410 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 2684 transition count 2404
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 2684 transition count 2404
Applied a total of 12 rules in 337 ms. Remains 2684 /2690 variables (removed 6) and now considering 2404/2410 (removed 6) transitions.
// Phase 1: matrix 2404 rows 2684 cols
[2024-05-29 22:10:27] [INFO ] Computed 441 invariants in 12 ms
[2024-05-29 22:10:27] [INFO ] Implicit Places using invariants in 814 ms returned []
[2024-05-29 22:10:27] [INFO ] Invariant cache hit.
[2024-05-29 22:10:30] [INFO ] Implicit Places using invariants and state equation in 2210 ms returned []
Implicit Place search using SMT with State Equation took 3028 ms to find 0 implicit places.
Running 2403 sub problems to find dead transitions.
[2024-05-29 22:10:30] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2683/5088 variables, and 0 constraints, problems are : Problem set: 0 solved, 2403 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 0/441 constraints, State Equation: 0/2684 constraints, PredecessorRefiner: 2403/2403 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2403 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2683/5088 variables, and 0 constraints, problems are : Problem set: 0 solved, 2403 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 0/441 constraints, State Equation: 0/2684 constraints, PredecessorRefiner: 0/2403 constraints, Known Traps: 0/0 constraints]
After SMT, in 60708ms problems are : Problem set: 0 solved, 2403 unsolved
Search for dead transitions found 0 dead transitions in 60736ms
Starting structural reductions in LTL mode, iteration 1 : 2684/2690 places, 2404/2410 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64110 ms. Remains : 2684/2690 places, 2404/2410 transitions.
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-040B-LTLCardinality-06
Product exploration explored 100000 steps with 50000 reset in 597 ms.
Product exploration explored 100000 steps with 50000 reset in 603 ms.
Computed a total of 638 stabilizing places and 638 stable transitions
Computed a total of 638 stabilizing places and 638 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 19 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-040B-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-040B-LTLCardinality-06 finished in 65525 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(p0)&&G(p1)))))'
Support contains 4 out of 2690 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2690/2690 places, 2410/2410 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 2681 transition count 2401
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 2681 transition count 2401
Applied a total of 18 rules in 337 ms. Remains 2681 /2690 variables (removed 9) and now considering 2401/2410 (removed 9) transitions.
// Phase 1: matrix 2401 rows 2681 cols
[2024-05-29 22:11:32] [INFO ] Computed 441 invariants in 13 ms
[2024-05-29 22:11:33] [INFO ] Implicit Places using invariants in 823 ms returned []
[2024-05-29 22:11:33] [INFO ] Invariant cache hit.
[2024-05-29 22:11:35] [INFO ] Implicit Places using invariants and state equation in 2297 ms returned []
Implicit Place search using SMT with State Equation took 3127 ms to find 0 implicit places.
Running 2400 sub problems to find dead transitions.
[2024-05-29 22:11:35] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 timeout
1.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2680/5082 variables, and 0 constraints, problems are : Problem set: 0 solved, 2400 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 0/441 constraints, State Equation: 0/2681 constraints, PredecessorRefiner: 2400/2400 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2400 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 1)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 1)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 1)
(s760 1)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 1)
(s771 1)
(s772 1)
(s773 1)
(s774 1)
(s775 1)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 1)
(s800 1)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 1)
(s809 1)
(s810 1)
(s811 1)
(s812 1)
(s813 1)
(s814 1)
(s815 1)
(s816 1)
(s817 1)
(s818 1)
(s819 1)
(s820 1)
(s821 1)
(s822 1)
(s823 1)
(s824 1)
(s825 1)
(s826 1)
(s827 1)
(s828 1)
(s829 1)
(s830 1)
(s831 1)
(s832 1)
(s833 1)
(s834 1)
(s835 1)
(s836 1)
(s837 1)
(s838 1)
(s839 1)
(s840 1)
(s841 1)
(s842 1)
(s843 1)
(s844 1)
(s845 1)
(s846 1)
(s847 1)
(s848 1)
(s849 1)
(s850 1)
(s851 1)
(s852 1)
(s853 1)
(s854 1)
(s855 1)
(s856 1)
(s857 1)
(s858 1)
(s859 1)
(s860 1)
(s861 1)
(s862 1)
(s863 1)
(s864 1)
(s865 1)
(s866 1)
(s867 1)
(s868 1)
(s869 1)
(s870 1)
(s871 1)
(s872 1)
(s873 1)
(s874 1)
(s875 1)
(s876 1)
(s877 1)
(s878 1)
(s879 1)
(s880 1)
(s881 1)
(s882 1)
(s883 1)
(s884 1)
(s885 1)
(s886 1)
(s887 1)
(s888 1)
(s889 1)
(s890 1)
(s891 1)
(s892 1)
(s893 1)
(s894 1)
(s895 1)
(s896 1)
(s897 1)
(s898 1)
(s899 1)
(s900 1)
(s901 1)
(s902 1)
(s903 1)
(s904 1)
(s905 1)
(s906 1)
(s907 1)
(s908 1)
(s909 1)
(s910 1)
(s911 1)
(s912 1)
(s913 1)
(s914 1)
(s915 1)
(s916 1)
(s917 1)
(s918 1)
(s919 1)
(s920 1)
(s921 1)
(s922 1)
(s923 1)
(s924 1)
(s925 1)
(s926 1)
(s927 1)
(s928 1)
(s929 1)
(s930 1)
(s931 1)
(s932 1)
(s933 1)
(s934 1)
(s935 1)
(s936 1)
(s937 1)
(s938 1)
(s939 1)
(s940 1)
(s941 1)
(s942 1)
(s943 1)
(s944 1)
(s945 1)
(s946 1)
(s947 1)
(s948 1)
(s949 1)
(s950 1)
(s951 1)
(s952 1)
(s953 1)
(s954 1)
(s955 1)
(s956 1)
(s957 1)
(s958 1)
(s959 1)
(s960 1)
(s961 1)
(s962 1)
(s963 1)
(s964 1)
(s965 1)
(s966 1)
(s967 1)
(s968 1)
(s969 1)
(s970 1)
(s971 1)
(s972 1)
(s973 1)
(s974 1)
(s975 1)
(s976 1)
(s977 1)
(s978 1)
(s979 1)
(s980 1)
(s981 1)
(s982 1)
(s983 1)
(s984 1)
(s985 1)
(s986 1)
(s987 1)
(s988 1)
(s989 1)
(s990 1)
(s991 1)
(s992 1)
(s993 1)
(s994 1)
(s995 1)
(s996 1)
(s997 1)
(s998 1)
(s999 1)
(s1000 1)
(s1001 1)
(s1002 1)
(s1003 1)
(s1004 1)
(s1005 1)
(s1006 1)
(s1007 1)
(s1008 1)
(s1009 1)
(s1010 1)
(s1011 1)
(s1012 1)
(s1013 1)
(s1014 1)
(s1015 1)
(s1016 1)
(s1017 1)
(s1018 1)
(s1019 1)
(s1020 1)
(s1021 1)
(s1022 1)
(s1023 1)
(s1024 1)
(s1025 1)
(s1026 1)
(s1027 1)
(s1028 1)
(s1029 1)
(s1030 1)
(s1031 1)
(s1032 1)
(s1033 1)
(s1034 1)
(s1035 1)
(s1036 1)
(s1037 1)
(s1038 1)
(s1039 1)
(s1040 1)
(s1041 1)
(s1042 1)
(s1043 1)
(s1044 1)
(s1045 1)
(s1046 1)
(s1047 1)
(s1048 1)
(s1049 1)
(s1050 1)
(s1051 1)
(s1052 1)
(s1053 1)
(s1054 1)
(s1055 1)
(s1056 1)
(s1057 1)
(s1058 1)
(s1059 1)
(s1060 1)
(s1061 1)
(s1062 1)
(s1063 1)
(s1064 1)
(s1065 1)
(s1066 1)
(s1067 1)
(s1068 1)
(s1069 1)
(s1070 1)
(s1071 1)
(s1072 1)
(s1073 1)
(s1074 1)
(s1075 1)
(s1076 1)
(s1077 1)
(s1078 1)
(s1079 1)
(s1080 1)
(s1081 1)
(s1082 1)
(s1083 1)
(s1084 1)
(s1085 1)
(s1086 1)
(s1087 1)
(s1088 1)
(s1089 1)
(s1090 1)
(s1091 1)
(s1092 1)
(s1093 1)
(s1094 1)
(s1095 1)
(s1096 1)
(s1097 1)
(s1098 1)
(s1099 1)
(s1100 1)
(s1101 1)
(s1102 1)
(s1103 1)
(s1104 1)
(s1105 1)
(s1106 1)
(s1107 1)
(s1108 1)
(s1109 1)
(s1110 1)
(s1111 1)
(s1112 1)
(s1113 1)
(s1114 1)
(s1115 1)
(s1116 1)
(s1117 1)
(s1118 1)
(s1119 1)
(s1120 1)
(s1121 1)
(s1122 1)
(s1123 1)
(s1124 1)
(s1125 1)
(s1126 1)
(s1127 1)
(s1128 1)
(s1129 1)
(s1130 1)
(s1131 1)
(s1132 1)
(s1133 1)
(s1134 1)
(s1135 1)
(s1136 1)
(s1137 1)
(s1138 1)
(s1139 1)
(s1140 1)
(s1141 1)
(s1142 1)
(s1143 1)
(s1144 1)
(s1145 1)
(s1146 1)
(s1147 1)
(s1148 1)
(s1149 1)
(s1150 1)
(s1151 1)
(s1152 1)
(s1153 1)
(s1154 1)
(s1155 1)
(s1156 1)
(s1157 1)
(s1158 1)
(s1159 1)
(s1160 1)
(s1161 1)
(s1162 1)
(s1163 1)
(s1164 1)
(s1165 1)
(s1166 1)
(s1167 1)
(s1168 1)
(s1169 1)
(s1170 1)
(s1171 1)
(s1172 1)
(s1173 1)
(s1174 1)
(s1175 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2680/5082 variables, and 0 constraints, problems are : Problem set: 0 solved, 2400 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 0/441 constraints, State Equation: 0/2681 constraints, PredecessorRefiner: 0/2400 constraints, Known Traps: 0/0 constraints]
After SMT, in 60652ms problems are : Problem set: 0 solved, 2400 unsolved
Search for dead transitions found 0 dead transitions in 60675ms
Starting structural reductions in LTL mode, iteration 1 : 2681/2690 places, 2401/2410 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64148 ms. Remains : 2681/2690 places, 2401/2410 transitions.
Stuttering acceptance computed with spot in 208 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-040B-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA ShieldPPPt-PT-040B-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-040B-LTLCardinality-10 finished in 64382 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&&X(p1))))'
Support contains 2 out of 2690 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2690/2690 places, 2410/2410 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 2681 transition count 2401
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 2681 transition count 2401
Applied a total of 18 rules in 324 ms. Remains 2681 /2690 variables (removed 9) and now considering 2401/2410 (removed 9) transitions.
[2024-05-29 22:12:37] [INFO ] Invariant cache hit.
[2024-05-29 22:12:37] [INFO ] Implicit Places using invariants in 786 ms returned []
[2024-05-29 22:12:37] [INFO ] Invariant cache hit.
[2024-05-29 22:12:40] [INFO ] Implicit Places using invariants and state equation in 2226 ms returned []
Implicit Place search using SMT with State Equation took 3049 ms to find 0 implicit places.
Running 2400 sub problems to find dead transitions.
[2024-05-29 22:12:40] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2680/5082 variables, and 0 constraints, problems are : Problem set: 0 solved, 2400 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 0/441 constraints, State Equation: 0/2681 constraints, PredecessorRefiner: 2400/2400 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2680/5082 variables, and 0 constraints, problems are : Problem set: 0 solved, 2400 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 0/441 constraints, State Equation: 0/2681 constraints, PredecessorRefiner: 0/2400 constraints, Known Traps: 0/0 constraints]
After SMT, in 60627ms problems are : Problem set: 0 solved, 2400 unsolved
Search for dead transitions found 0 dead transitions in 60648ms
Starting structural reductions in LTL mode, iteration 1 : 2681/2690 places, 2401/2410 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64027 ms. Remains : 2681/2690 places, 2401/2410 transitions.
Stuttering acceptance computed with spot in 143 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : ShieldPPPt-PT-040B-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-040B-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-040B-LTLCardinality-11 finished in 64201 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U ((p1&&X(p0))||X(G(p0)))))'
Support contains 2 out of 2690 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2690/2690 places, 2410/2410 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 2681 transition count 2401
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 2681 transition count 2401
Applied a total of 18 rules in 328 ms. Remains 2681 /2690 variables (removed 9) and now considering 2401/2410 (removed 9) transitions.
[2024-05-29 22:13:41] [INFO ] Invariant cache hit.
[2024-05-29 22:13:42] [INFO ] Implicit Places using invariants in 818 ms returned []
[2024-05-29 22:13:42] [INFO ] Invariant cache hit.
[2024-05-29 22:13:44] [INFO ] Implicit Places using invariants and state equation in 2172 ms returned []
Implicit Place search using SMT with State Equation took 2998 ms to find 0 implicit places.
Running 2400 sub problems to find dead transitions.
[2024-05-29 22:13:44] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2680/5082 variables, and 0 constraints, problems are : Problem set: 0 solved, 2400 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 0/441 constraints, State Equation: 0/2681 constraints, PredecessorRefiner: 2400/2400 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2680/5082 variables, and 0 constraints, problems are : Problem set: 0 solved, 2400 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 0/441 constraints, State Equation: 0/2681 constraints, PredecessorRefiner: 0/2400 constraints, Known Traps: 0/0 constraints]
After SMT, in 60671ms problems are : Problem set: 0 solved, 2400 unsolved
Search for dead transitions found 0 dead transitions in 60692ms
Starting structural reductions in LTL mode, iteration 1 : 2681/2690 places, 2401/2410 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64034 ms. Remains : 2681/2690 places, 2401/2410 transitions.
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : ShieldPPPt-PT-040B-LTLCardinality-14
Product exploration explored 100000 steps with 50000 reset in 612 ms.
Product exploration explored 100000 steps with 50000 reset in 611 ms.
Computed a total of 638 stabilizing places and 638 stable transitions
Computed a total of 638 stabilizing places and 638 stable transitions
Detected a total of 638/2681 stabilizing places and 638/2401 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) p0))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 21 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-040B-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-040B-LTLCardinality-14 finished in 65454 ms.
All properties solved by simple procedures.
Total runtime 692051 ms.
BK_STOP 1717020886386
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPt-PT-040B"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is ShieldPPPt-PT-040B, 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 r356-tall-171683761600667"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-040B.tgz
mv ShieldPPPt-PT-040B 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 '
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 ;