About the Execution of GreatSPN+red for ShieldPPPs-PT-010A
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 12238.151 | 3600000.00 | 7611890.00 | 5768.50 | F??FTTFTFF?T?FFF | 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.r355-tall-171683758800435.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is ShieldPPPs-PT-010A, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r355-tall-171683758800435
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K 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.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.0K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 19 16:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K Apr 13 11:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Apr 13 11:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 13 11:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 104K Apr 13 11:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 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 88K 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 ShieldPPPs-PT-010A-LTLCardinality-00
FORMULA_NAME ShieldPPPs-PT-010A-LTLCardinality-01
FORMULA_NAME ShieldPPPs-PT-010A-LTLCardinality-02
FORMULA_NAME ShieldPPPs-PT-010A-LTLCardinality-03
FORMULA_NAME ShieldPPPs-PT-010A-LTLCardinality-04
FORMULA_NAME ShieldPPPs-PT-010A-LTLCardinality-05
FORMULA_NAME ShieldPPPs-PT-010A-LTLCardinality-06
FORMULA_NAME ShieldPPPs-PT-010A-LTLCardinality-07
FORMULA_NAME ShieldPPPs-PT-010A-LTLCardinality-08
FORMULA_NAME ShieldPPPs-PT-010A-LTLCardinality-09
FORMULA_NAME ShieldPPPs-PT-010A-LTLCardinality-10
FORMULA_NAME ShieldPPPs-PT-010A-LTLCardinality-11
FORMULA_NAME ShieldPPPs-PT-010A-LTLCardinality-12
FORMULA_NAME ShieldPPPs-PT-010A-LTLCardinality-13
FORMULA_NAME ShieldPPPs-PT-010A-LTLCardinality-14
FORMULA_NAME ShieldPPPs-PT-010A-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1716965395126
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-010A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 06:49:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-29 06:49:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 06:49:56] [INFO ] Load time of PNML (sax parser for PT used): 87 ms
[2024-05-29 06:49:56] [INFO ] Transformed 313 places.
[2024-05-29 06:49:56] [INFO ] Transformed 263 transitions.
[2024-05-29 06:49:56] [INFO ] Found NUPN structural information;
[2024-05-29 06:49:56] [INFO ] Parsed PT model containing 313 places and 263 transitions and 1006 arcs in 189 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Initial state reduction rules removed 2 formulas.
FORMULA ShieldPPPs-PT-010A-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-010A-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-010A-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-010A-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-010A-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-010A-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-010A-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-010A-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Applied a total of 0 rules in 31 ms. Remains 313 /313 variables (removed 0) and now considering 263/263 (removed 0) transitions.
// Phase 1: matrix 263 rows 313 cols
[2024-05-29 06:49:56] [INFO ] Computed 111 invariants in 27 ms
[2024-05-29 06:49:57] [INFO ] Implicit Places using invariants in 373 ms returned []
[2024-05-29 06:49:57] [INFO ] Invariant cache hit.
[2024-05-29 06:49:57] [INFO ] Implicit Places using invariants and state equation in 355 ms returned []
Implicit Place search using SMT with State Equation took 760 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2024-05-29 06:49:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 111/423 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (OVERLAPS) 263/576 variables, 313/737 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-29 06:50:03] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 11 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/576 variables, 1/738 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-29 06:50:07] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 3 ms to minimize.
[2024-05-29 06:50:07] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 3 ms to minimize.
[2024-05-29 06:50:08] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-29 06:50:08] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-05-29 06:50:08] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-29 06:50:08] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-29 06:50:09] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 7/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 9 (OVERLAPS) 0/576 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 576/576 variables, and 745 constraints, problems are : Problem set: 0 solved, 262 unsolved in 19082 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 111/423 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 8/432 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (OVERLAPS) 263/576 variables, 313/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 262/1007 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-29 06:50:24] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 1/1008 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 576/576 variables, and 1008 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30016 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 9/9 constraints]
After SMT, in 49190ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 49210ms
Finished structural reductions in LTL mode , in 1 iterations and 50034 ms. Remains : 313/313 places, 263/263 transitions.
Support contains 22 out of 313 places after structural reductions.
[2024-05-29 06:50:46] [INFO ] Flatten gal took : 52 ms
[2024-05-29 06:50:46] [INFO ] Flatten gal took : 23 ms
[2024-05-29 06:50:46] [INFO ] Input system was already deterministic with 263 transitions.
RANDOM walk for 2037 steps (0 resets) in 205 ms. (9 steps per ms) remains 0/12 properties
FORMULA ShieldPPPs-PT-010A-LTLCardinality-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Applied a total of 0 rules in 8 ms. Remains 313 /313 variables (removed 0) and now considering 263/263 (removed 0) transitions.
[2024-05-29 06:50:47] [INFO ] Invariant cache hit.
[2024-05-29 06:50:47] [INFO ] Implicit Places using invariants in 173 ms returned []
[2024-05-29 06:50:47] [INFO ] Invariant cache hit.
[2024-05-29 06:50:47] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 441 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2024-05-29 06:50:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 111/423 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (OVERLAPS) 263/576 variables, 313/737 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-29 06:50:53] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/576 variables, 1/738 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-29 06:50:57] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-29 06:50:57] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2024-05-29 06:50:57] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-29 06:50:57] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-29 06:50:58] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-29 06:50:58] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-29 06:50:59] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 7/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 9 (OVERLAPS) 0/576 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 576/576 variables, and 745 constraints, problems are : Problem set: 0 solved, 262 unsolved in 18254 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 111/423 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 8/432 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (OVERLAPS) 263/576 variables, 313/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 262/1007 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-29 06:51:14] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-29 06:51:24] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 2/1009 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 576/576 variables, and 1009 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30021 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 10/10 constraints]
After SMT, in 48320ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 48323ms
Finished structural reductions in LTL mode , in 1 iterations and 48773 ms. Remains : 313/313 places, 263/263 transitions.
Stuttering acceptance computed with spot in 233 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-010A-LTLCardinality-01
Product exploration explored 100000 steps with 673 reset in 480 ms.
Product exploration explored 100000 steps with 683 reset in 512 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 6 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 135 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 263/263 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 311 transition count 261
Applied a total of 4 rules in 54 ms. Remains 311 /313 variables (removed 2) and now considering 261/263 (removed 2) transitions.
// Phase 1: matrix 261 rows 311 cols
[2024-05-29 06:51:37] [INFO ] Computed 111 invariants in 2 ms
[2024-05-29 06:51:38] [INFO ] Implicit Places using invariants in 225 ms returned []
[2024-05-29 06:51:38] [INFO ] Invariant cache hit.
[2024-05-29 06:51:38] [INFO ] Implicit Places using invariants and state equation in 356 ms returned []
Implicit Place search using SMT with State Equation took 609 ms to find 0 implicit places.
[2024-05-29 06:51:38] [INFO ] Redundant transitions in 16 ms returned []
Running 260 sub problems to find dead transitions.
[2024-05-29 06:51:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/572 variables, 311/733 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 06:51:46] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 1/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 06:51:50] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-29 06:51:51] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/572 variables, 2/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 736 constraints, problems are : Problem set: 0 solved, 260 unsolved in 19914 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 3/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/572 variables, 311/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 260/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 06:52:24] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
[2024-05-29 06:52:26] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 998 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30014 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 5/5 constraints]
After SMT, in 50015ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 50021ms
Starting structural reductions in SI_LTL mode, iteration 1 : 311/313 places, 261/263 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 50733 ms. Remains : 311/313 places, 261/263 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 186 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 137 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 702 reset in 340 ms.
Product exploration explored 100000 steps with 717 reset in 413 ms.
Support contains 2 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 261/261 transitions.
Applied a total of 0 rules in 11 ms. Remains 311 /311 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2024-05-29 06:52:29] [INFO ] Invariant cache hit.
[2024-05-29 06:52:30] [INFO ] Implicit Places using invariants in 250 ms returned []
[2024-05-29 06:52:30] [INFO ] Invariant cache hit.
[2024-05-29 06:52:30] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 523 ms to find 0 implicit places.
[2024-05-29 06:52:30] [INFO ] Redundant transitions in 3 ms returned []
Running 260 sub problems to find dead transitions.
[2024-05-29 06:52:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/572 variables, 311/733 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 06:52:37] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 1/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 06:52:41] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-29 06:52:42] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/572 variables, 2/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 736 constraints, problems are : Problem set: 0 solved, 260 unsolved in 18885 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 3/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/572 variables, 311/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 260/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 06:53:15] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 2 ms to minimize.
[2024-05-29 06:53:16] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 998 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30014 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 5/5 constraints]
After SMT, in 48932ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 48934ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 49484 ms. Remains : 311/311 places, 261/261 transitions.
Treatment of property ShieldPPPs-PT-010A-LTLCardinality-01 finished in 152305 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(!p0))||(F(!p0)&&G((F(p1)&&F(p0)))))))'
Support contains 3 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Applied a total of 0 rules in 4 ms. Remains 313 /313 variables (removed 0) and now considering 263/263 (removed 0) transitions.
// Phase 1: matrix 263 rows 313 cols
[2024-05-29 06:53:19] [INFO ] Computed 111 invariants in 3 ms
[2024-05-29 06:53:19] [INFO ] Implicit Places using invariants in 170 ms returned []
[2024-05-29 06:53:19] [INFO ] Invariant cache hit.
[2024-05-29 06:53:19] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 425 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2024-05-29 06:53:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 111/423 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (OVERLAPS) 263/576 variables, 313/737 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-29 06:53:25] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/576 variables, 1/738 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-29 06:53:29] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 11 ms to minimize.
[2024-05-29 06:53:29] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-05-29 06:53:30] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-05-29 06:53:30] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-29 06:53:30] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-29 06:53:30] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-29 06:53:31] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 7/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 9 (OVERLAPS) 0/576 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 576/576 variables, and 745 constraints, problems are : Problem set: 0 solved, 262 unsolved in 18037 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 111/423 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 8/432 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (OVERLAPS) 263/576 variables, 313/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 262/1007 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-29 06:53:45] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 1/1008 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 576/576 variables, and 1008 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30021 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 9/9 constraints]
After SMT, in 48094ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 48097ms
Finished structural reductions in LTL mode , in 1 iterations and 48527 ms. Remains : 313/313 places, 263/263 transitions.
Stuttering acceptance computed with spot in 199 ms :[p0, p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-010A-LTLCardinality-02
Product exploration explored 100000 steps with 3109 reset in 320 ms.
Product exploration explored 100000 steps with 3148 reset in 355 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 97 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 1723 steps (0 resets) in 28 ms. (59 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 268 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 90 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
[2024-05-29 06:54:09] [INFO ] Invariant cache hit.
[2024-05-29 06:54:09] [INFO ] [Real]Absence check using 111 positive place invariants in 38 ms returned sat
[2024-05-29 06:54:10] [INFO ] [Real]Absence check using state equation in 360 ms returned sat
[2024-05-29 06:54:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 06:54:10] [INFO ] [Nat]Absence check using 111 positive place invariants in 28 ms returned sat
[2024-05-29 06:54:10] [INFO ] [Nat]Absence check using state equation in 251 ms returned sat
[2024-05-29 06:54:10] [INFO ] Computed and/alt/rep : 262/723/262 causal constraints (skipped 0 transitions) in 16 ms.
[2024-05-29 06:54:12] [INFO ] Added : 242 causal constraints over 49 iterations in 2001 ms. Result :sat
Could not prove EG (AND p0 (NOT p1))
Support contains 3 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 311 transition count 261
Applied a total of 4 rules in 17 ms. Remains 311 /313 variables (removed 2) and now considering 261/263 (removed 2) transitions.
// Phase 1: matrix 261 rows 311 cols
[2024-05-29 06:54:12] [INFO ] Computed 111 invariants in 3 ms
[2024-05-29 06:54:12] [INFO ] Implicit Places using invariants in 172 ms returned []
[2024-05-29 06:54:12] [INFO ] Invariant cache hit.
[2024-05-29 06:54:13] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 433 ms to find 0 implicit places.
[2024-05-29 06:54:13] [INFO ] Redundant transitions in 3 ms returned []
Running 260 sub problems to find dead transitions.
[2024-05-29 06:54:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/572 variables, 311/733 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 06:54:20] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 1/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 06:54:24] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-29 06:54:25] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/572 variables, 2/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 736 constraints, problems are : Problem set: 0 solved, 260 unsolved in 19519 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 3/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/572 variables, 311/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 260/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 06:54:58] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2024-05-29 06:55:00] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 998 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30016 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 5/5 constraints]
After SMT, in 49568ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 49574ms
Starting structural reductions in SI_LTL mode, iteration 1 : 311/313 places, 261/263 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 50037 ms. Remains : 311/313 places, 261/263 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 95 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 1793 steps (0 resets) in 24 ms. (71 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 203 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 177 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
[2024-05-29 06:55:03] [INFO ] Invariant cache hit.
[2024-05-29 06:55:03] [INFO ] [Real]Absence check using 111 positive place invariants in 29 ms returned sat
[2024-05-29 06:55:03] [INFO ] [Real]Absence check using state equation in 262 ms returned sat
[2024-05-29 06:55:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 06:55:03] [INFO ] [Nat]Absence check using 111 positive place invariants in 30 ms returned sat
[2024-05-29 06:55:04] [INFO ] [Nat]Absence check using state equation in 287 ms returned sat
[2024-05-29 06:55:04] [INFO ] Computed and/alt/rep : 260/727/260 causal constraints (skipped 0 transitions) in 21 ms.
[2024-05-29 06:55:06] [INFO ] Added : 202 causal constraints over 41 iterations in 1977 ms. Result :sat
Could not prove EG (AND p0 (NOT p1))
Stuttering acceptance computed with spot in 94 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 5896 reset in 309 ms.
Product exploration explored 100000 steps with 6336 reset in 345 ms.
Support contains 3 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 261/261 transitions.
Applied a total of 0 rules in 26 ms. Remains 311 /311 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2024-05-29 06:55:06] [INFO ] Invariant cache hit.
[2024-05-29 06:55:07] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-05-29 06:55:07] [INFO ] Invariant cache hit.
[2024-05-29 06:55:07] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 440 ms to find 0 implicit places.
[2024-05-29 06:55:07] [INFO ] Redundant transitions in 1 ms returned []
Running 260 sub problems to find dead transitions.
[2024-05-29 06:55:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/572 variables, 311/733 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 06:55:14] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 1/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 06:55:18] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-29 06:55:20] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/572 variables, 2/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 736 constraints, problems are : Problem set: 0 solved, 260 unsolved in 19269 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 3/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/572 variables, 311/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 260/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 06:55:52] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 2 ms to minimize.
[2024-05-29 06:55:54] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 998 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30015 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 5/5 constraints]
After SMT, in 49315ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 49319ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 49791 ms. Remains : 311/311 places, 261/261 transitions.
Treatment of property ShieldPPPs-PT-010A-LTLCardinality-02 finished in 157310 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&&F(p1))))'
Support contains 3 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Applied a total of 0 rules in 2 ms. Remains 313 /313 variables (removed 0) and now considering 263/263 (removed 0) transitions.
// Phase 1: matrix 263 rows 313 cols
[2024-05-29 06:55:56] [INFO ] Computed 111 invariants in 2 ms
[2024-05-29 06:55:56] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-05-29 06:55:56] [INFO ] Invariant cache hit.
[2024-05-29 06:55:57] [INFO ] Implicit Places using invariants and state equation in 323 ms returned []
Implicit Place search using SMT with State Equation took 489 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2024-05-29 06:55:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 111/423 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (OVERLAPS) 263/576 variables, 313/737 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-29 06:56:03] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/576 variables, 1/738 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-29 06:56:06] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-05-29 06:56:07] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-05-29 06:56:07] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-29 06:56:07] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-29 06:56:07] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-29 06:56:07] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-29 06:56:09] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 7/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 9 (OVERLAPS) 0/576 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 576/576 variables, and 745 constraints, problems are : Problem set: 0 solved, 262 unsolved in 18626 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 111/423 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 8/432 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (OVERLAPS) 263/576 variables, 313/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 262/1007 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-29 06:56:24] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-29 06:56:34] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 2/1009 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 576/576 variables, and 1009 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30018 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 10/10 constraints]
After SMT, in 48683ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 48685ms
Finished structural reductions in LTL mode , in 1 iterations and 49177 ms. Remains : 313/313 places, 263/263 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 : ShieldPPPs-PT-010A-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldPPPs-PT-010A-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-010A-LTLCardinality-09 finished in 49338 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 4 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Applied a total of 0 rules in 5 ms. Remains 313 /313 variables (removed 0) and now considering 263/263 (removed 0) transitions.
[2024-05-29 06:56:46] [INFO ] Invariant cache hit.
[2024-05-29 06:56:46] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-05-29 06:56:46] [INFO ] Invariant cache hit.
[2024-05-29 06:56:46] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 439 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2024-05-29 06:56:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 111/423 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (OVERLAPS) 263/576 variables, 313/737 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-29 06:56:52] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/576 variables, 1/738 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-29 06:56:56] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-05-29 06:56:56] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2024-05-29 06:56:56] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-05-29 06:56:56] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2024-05-29 06:56:56] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-05-29 06:56:57] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-05-29 06:56:58] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 7/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 9 (OVERLAPS) 0/576 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 576/576 variables, and 745 constraints, problems are : Problem set: 0 solved, 262 unsolved in 18113 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 111/423 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 8/432 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (OVERLAPS) 263/576 variables, 313/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 262/1007 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-29 06:57:12] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 1/1008 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 576/576 variables, and 1008 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30019 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 9/9 constraints]
After SMT, in 48163ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 48166ms
Finished structural reductions in LTL mode , in 1 iterations and 48610 ms. Remains : 313/313 places, 263/263 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-010A-LTLCardinality-10
Product exploration explored 100000 steps with 2444 reset in 314 ms.
Product exploration explored 100000 steps with 2517 reset in 364 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 107 steps (0 resets) in 4 ms. (21 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
[2024-05-29 06:57:35] [INFO ] Invariant cache hit.
[2024-05-29 06:57:36] [INFO ] [Real]Absence check using 111 positive place invariants in 29 ms returned sat
[2024-05-29 06:57:36] [INFO ] [Real]Absence check using state equation in 295 ms returned sat
[2024-05-29 06:57:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 06:57:36] [INFO ] [Nat]Absence check using 111 positive place invariants in 25 ms returned sat
[2024-05-29 06:57:36] [INFO ] [Nat]Absence check using state equation in 279 ms returned sat
[2024-05-29 06:57:36] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-05-29 06:57:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2024-05-29 06:57:36] [INFO ] Computed and/alt/rep : 262/723/262 causal constraints (skipped 0 transitions) in 16 ms.
[2024-05-29 06:57:42] [INFO ] Added : 262 causal constraints over 53 iterations in 5617 ms. Result :unknown
Could not prove EG (NOT p0)
Support contains 4 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 311 transition count 261
Applied a total of 4 rules in 17 ms. Remains 311 /313 variables (removed 2) and now considering 261/263 (removed 2) transitions.
// Phase 1: matrix 261 rows 311 cols
[2024-05-29 06:57:42] [INFO ] Computed 111 invariants in 2 ms
[2024-05-29 06:57:42] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-05-29 06:57:42] [INFO ] Invariant cache hit.
[2024-05-29 06:57:43] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 410 ms to find 0 implicit places.
[2024-05-29 06:57:43] [INFO ] Redundant transitions in 0 ms returned []
Running 260 sub problems to find dead transitions.
[2024-05-29 06:57:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/572 variables, 311/733 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 06:57:50] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 1/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 06:57:54] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-29 06:57:55] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/572 variables, 2/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 736 constraints, problems are : Problem set: 0 solved, 260 unsolved in 19288 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 3/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/572 variables, 311/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 260/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 06:58:28] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 0 ms to minimize.
[2024-05-29 06:58:30] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 998 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30021 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 5/5 constraints]
After SMT, in 49343ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 49346ms
Starting structural reductions in SI_LTL mode, iteration 1 : 311/313 places, 261/263 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 49778 ms. Remains : 311/313 places, 261/263 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 118 steps (0 resets) in 7 ms. (14 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
[2024-05-29 06:58:32] [INFO ] Invariant cache hit.
[2024-05-29 06:58:32] [INFO ] [Real]Absence check using 111 positive place invariants in 29 ms returned sat
[2024-05-29 06:58:33] [INFO ] [Real]Absence check using state equation in 237 ms returned sat
[2024-05-29 06:58:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 06:58:33] [INFO ] [Nat]Absence check using 111 positive place invariants in 26 ms returned sat
[2024-05-29 06:58:33] [INFO ] [Nat]Absence check using state equation in 207 ms returned sat
[2024-05-29 06:58:33] [INFO ] Computed and/alt/rep : 260/727/260 causal constraints (skipped 0 transitions) in 17 ms.
[2024-05-29 06:58:36] [INFO ] Added : 259 causal constraints over 55 iterations in 3183 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2466 reset in 356 ms.
Product exploration explored 100000 steps with 2388 reset in 385 ms.
Support contains 4 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 261/261 transitions.
Applied a total of 0 rules in 8 ms. Remains 311 /311 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2024-05-29 06:58:37] [INFO ] Invariant cache hit.
[2024-05-29 06:58:37] [INFO ] Implicit Places using invariants in 160 ms returned []
[2024-05-29 06:58:37] [INFO ] Invariant cache hit.
[2024-05-29 06:58:38] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 453 ms to find 0 implicit places.
[2024-05-29 06:58:38] [INFO ] Redundant transitions in 1 ms returned []
Running 260 sub problems to find dead transitions.
[2024-05-29 06:58:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/572 variables, 311/733 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 06:58:45] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 1/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 06:58:49] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-29 06:58:50] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/572 variables, 2/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 736 constraints, problems are : Problem set: 0 solved, 260 unsolved in 19395 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 3/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/572 variables, 311/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 260/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 06:59:23] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2024-05-29 06:59:25] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 998 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30011 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 5/5 constraints]
After SMT, in 49442ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 49445ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 49911 ms. Remains : 311/311 places, 261/261 transitions.
Treatment of property ShieldPPPs-PT-010A-LTLCardinality-10 finished in 161505 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 1 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Applied a total of 0 rules in 2 ms. Remains 313 /313 variables (removed 0) and now considering 263/263 (removed 0) transitions.
// Phase 1: matrix 263 rows 313 cols
[2024-05-29 06:59:27] [INFO ] Computed 111 invariants in 1 ms
[2024-05-29 06:59:27] [INFO ] Implicit Places using invariants in 180 ms returned []
[2024-05-29 06:59:27] [INFO ] Invariant cache hit.
[2024-05-29 06:59:28] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 424 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2024-05-29 06:59:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 111/423 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (OVERLAPS) 263/576 variables, 313/737 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-29 06:59:33] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/576 variables, 1/738 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-29 06:59:37] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-29 06:59:37] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-29 06:59:38] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-29 06:59:38] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-29 06:59:38] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 0 ms to minimize.
[2024-05-29 06:59:38] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-29 06:59:39] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 7/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 9 (OVERLAPS) 0/576 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 576/576 variables, and 745 constraints, problems are : Problem set: 0 solved, 262 unsolved in 18278 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 111/423 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 8/432 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (OVERLAPS) 263/576 variables, 313/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 262/1007 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-29 06:59:54] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 1/1008 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 576/576 variables, and 1008 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30019 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 9/9 constraints]
After SMT, in 48327ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 48330ms
Finished structural reductions in LTL mode , in 1 iterations and 48757 ms. Remains : 313/313 places, 263/263 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-010A-LTLCardinality-12
Product exploration explored 100000 steps with 266 reset in 375 ms.
Product exploration explored 100000 steps with 264 reset in 412 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 86 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 1451 steps (0 resets) in 19 ms. (72 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 113 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-29 07:00:17] [INFO ] Invariant cache hit.
[2024-05-29 07:00:18] [INFO ] [Real]Absence check using 111 positive place invariants in 25 ms returned sat
[2024-05-29 07:00:18] [INFO ] [Real]Absence check using state equation in 245 ms returned sat
[2024-05-29 07:00:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 07:00:18] [INFO ] [Nat]Absence check using 111 positive place invariants in 24 ms returned sat
[2024-05-29 07:00:18] [INFO ] [Nat]Absence check using state equation in 185 ms returned sat
[2024-05-29 07:00:18] [INFO ] Computed and/alt/rep : 262/723/262 causal constraints (skipped 0 transitions) in 15 ms.
[2024-05-29 07:00:21] [INFO ] Added : 259 causal constraints over 60 iterations in 3262 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Applied a total of 0 rules in 5 ms. Remains 313 /313 variables (removed 0) and now considering 263/263 (removed 0) transitions.
[2024-05-29 07:00:21] [INFO ] Invariant cache hit.
[2024-05-29 07:00:22] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-05-29 07:00:22] [INFO ] Invariant cache hit.
[2024-05-29 07:00:22] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 430 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2024-05-29 07:00:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 111/423 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (OVERLAPS) 263/576 variables, 313/737 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-29 07:00:27] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/576 variables, 1/738 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-29 07:00:31] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-05-29 07:00:32] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-05-29 07:00:32] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-29 07:00:32] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-05-29 07:00:32] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-29 07:00:32] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-29 07:00:33] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 7/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 9 (OVERLAPS) 0/576 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 576/576 variables, and 745 constraints, problems are : Problem set: 0 solved, 262 unsolved in 18040 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 111/423 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 8/432 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (OVERLAPS) 263/576 variables, 313/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 262/1007 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-29 07:00:48] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 1/1008 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 576/576 variables, and 1008 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30018 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 9/9 constraints]
After SMT, in 48089ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 48092ms
Finished structural reductions in LTL mode , in 1 iterations and 48529 ms. Remains : 313/313 places, 263/263 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 78 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 1233 steps (0 resets) in 18 ms. (64 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 81 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-29 07:01:10] [INFO ] Invariant cache hit.
[2024-05-29 07:01:11] [INFO ] [Real]Absence check using 111 positive place invariants in 26 ms returned sat
[2024-05-29 07:01:11] [INFO ] [Real]Absence check using state equation in 243 ms returned sat
[2024-05-29 07:01:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 07:01:11] [INFO ] [Nat]Absence check using 111 positive place invariants in 23 ms returned sat
[2024-05-29 07:01:11] [INFO ] [Nat]Absence check using state equation in 188 ms returned sat
[2024-05-29 07:01:11] [INFO ] Computed and/alt/rep : 262/723/262 causal constraints (skipped 0 transitions) in 16 ms.
[2024-05-29 07:01:15] [INFO ] Added : 259 causal constraints over 60 iterations in 3293 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 266 reset in 366 ms.
Product exploration explored 100000 steps with 260 reset in 405 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 313 transition count 263
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 28 ms. Remains 313 /313 variables (removed 0) and now considering 263/263 (removed 0) transitions.
[2024-05-29 07:01:16] [INFO ] Redundant transitions in 1 ms returned []
Running 262 sub problems to find dead transitions.
// Phase 1: matrix 263 rows 313 cols
[2024-05-29 07:01:16] [INFO ] Computed 111 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 111/423 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-29 07:01:20] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD87 is UNSAT
[2024-05-29 07:01:20] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
Problem TDEAD88 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 2/426 constraints. Problems are: Problem set: 2 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 0/426 constraints. Problems are: Problem set: 2 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 263/576 variables, 313/739 constraints. Problems are: Problem set: 2 solved, 260 unsolved
[2024-05-29 07:01:25] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 1/740 constraints. Problems are: Problem set: 2 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 0/740 constraints. Problems are: Problem set: 2 solved, 260 unsolved
At refinement iteration 9 (OVERLAPS) 0/576 variables, 0/740 constraints. Problems are: Problem set: 2 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 576/576 variables, and 740 constraints, problems are : Problem set: 2 solved, 260 unsolved in 16776 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 2 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 2 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 2 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 3/313 variables, 111/421 constraints. Problems are: Problem set: 2 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 3/424 constraints. Problems are: Problem set: 2 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 3/427 constraints. Problems are: Problem set: 2 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 0/427 constraints. Problems are: Problem set: 2 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 263/576 variables, 313/740 constraints. Problems are: Problem set: 2 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 260/1000 constraints. Problems are: Problem set: 2 solved, 260 unsolved
[2024-05-29 07:01:39] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2024-05-29 07:01:40] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 2/1002 constraints. Problems are: Problem set: 2 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 576/576 variables, and 1002 constraints, problems are : Problem set: 2 solved, 260 unsolved in 30012 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 260/262 constraints, Known Traps: 5/5 constraints]
After SMT, in 46820ms problems are : Problem set: 2 solved, 260 unsolved
Search for dead transitions found 2 dead transitions in 46824ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 313/313 places, 261/263 transitions.
Graph (complete) has 822 edges and 313 vertex of which 311 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 18 ms. Remains 311 /313 variables (removed 2) and now considering 261/261 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 311/313 places, 261/263 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 46884 ms. Remains : 311/313 places, 261/263 transitions.
Support contains 1 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Applied a total of 0 rules in 5 ms. Remains 313 /313 variables (removed 0) and now considering 263/263 (removed 0) transitions.
// Phase 1: matrix 263 rows 313 cols
[2024-05-29 07:02:03] [INFO ] Computed 111 invariants in 1 ms
[2024-05-29 07:02:03] [INFO ] Implicit Places using invariants in 277 ms returned []
[2024-05-29 07:02:03] [INFO ] Invariant cache hit.
[2024-05-29 07:02:03] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 539 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2024-05-29 07:02:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 111/423 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (OVERLAPS) 263/576 variables, 313/737 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-29 07:02:09] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/576 variables, 1/738 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-29 07:02:12] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-05-29 07:02:13] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
[2024-05-29 07:02:13] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2024-05-29 07:02:13] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 0 ms to minimize.
[2024-05-29 07:02:13] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-29 07:02:13] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-29 07:02:15] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 7/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 9 (OVERLAPS) 0/576 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 576/576 variables, and 745 constraints, problems are : Problem set: 0 solved, 262 unsolved in 17864 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 111/423 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 8/432 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (OVERLAPS) 263/576 variables, 313/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 262/1007 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-29 07:02:29] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 1/1008 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 576/576 variables, and 1008 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30022 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 9/9 constraints]
After SMT, in 47942ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 47944ms
Finished structural reductions in LTL mode , in 1 iterations and 48502 ms. Remains : 313/313 places, 263/263 transitions.
Treatment of property ShieldPPPs-PT-010A-LTLCardinality-12 finished in 204044 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||G(p1)))'
Support contains 5 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 311 transition count 261
Applied a total of 4 rules in 28 ms. Remains 311 /313 variables (removed 2) and now considering 261/263 (removed 2) transitions.
// Phase 1: matrix 261 rows 311 cols
[2024-05-29 07:02:51] [INFO ] Computed 111 invariants in 2 ms
[2024-05-29 07:02:51] [INFO ] Implicit Places using invariants in 255 ms returned []
[2024-05-29 07:02:51] [INFO ] Invariant cache hit.
[2024-05-29 07:02:52] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 545 ms to find 0 implicit places.
[2024-05-29 07:02:52] [INFO ] Redundant transitions in 1 ms returned []
Running 260 sub problems to find dead transitions.
[2024-05-29 07:02:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/572 variables, 311/733 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:02:59] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 1/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:03:03] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-29 07:03:04] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/572 variables, 2/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 736 constraints, problems are : Problem set: 0 solved, 260 unsolved in 18746 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 3/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/572 variables, 311/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 260/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:03:36] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 1 ms to minimize.
[2024-05-29 07:03:38] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 998 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30020 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 5/5 constraints]
After SMT, in 48800ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 48803ms
Starting structural reductions in SI_LTL mode, iteration 1 : 311/313 places, 261/263 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 49390 ms. Remains : 311/313 places, 261/263 transitions.
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-010A-LTLCardinality-14
Stuttering criterion allowed to conclude after 64016 steps with 90 reset in 264 ms.
FORMULA ShieldPPPs-PT-010A-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-010A-LTLCardinality-14 finished in 49776 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Applied a total of 0 rules in 3 ms. Remains 313 /313 variables (removed 0) and now considering 263/263 (removed 0) transitions.
// Phase 1: matrix 263 rows 313 cols
[2024-05-29 07:03:41] [INFO ] Computed 111 invariants in 1 ms
[2024-05-29 07:03:41] [INFO ] Implicit Places using invariants in 263 ms returned []
[2024-05-29 07:03:41] [INFO ] Invariant cache hit.
[2024-05-29 07:03:42] [INFO ] Implicit Places using invariants and state equation in 560 ms returned []
Implicit Place search using SMT with State Equation took 866 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2024-05-29 07:03:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 111/423 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (OVERLAPS) 263/576 variables, 313/737 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-29 07:03:47] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/576 variables, 1/738 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-29 07:03:51] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-29 07:03:51] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-05-29 07:03:52] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-29 07:03:52] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-05-29 07:03:52] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 0 ms to minimize.
[2024-05-29 07:03:52] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-29 07:03:53] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 7/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 9 (OVERLAPS) 0/576 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 576/576 variables, and 745 constraints, problems are : Problem set: 0 solved, 262 unsolved in 17697 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 111/423 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 8/432 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (OVERLAPS) 263/576 variables, 313/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 262/1007 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-29 07:04:08] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 1/1008 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 576/576 variables, and 1008 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30013 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 9/9 constraints]
After SMT, in 47739ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 47742ms
Finished structural reductions in LTL mode , in 1 iterations and 48611 ms. Remains : 313/313 places, 263/263 transitions.
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-010A-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 67 steps with 0 reset in 1 ms.
FORMULA ShieldPPPs-PT-010A-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-010A-LTLCardinality-15 finished in 48762 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)))'
Found a Shortening insensitive property : ShieldPPPs-PT-010A-LTLCardinality-01
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 313 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 311 transition count 261
Applied a total of 4 rules in 11 ms. Remains 311 /313 variables (removed 2) and now considering 261/263 (removed 2) transitions.
// Phase 1: matrix 261 rows 311 cols
[2024-05-29 07:04:30] [INFO ] Computed 111 invariants in 1 ms
[2024-05-29 07:04:30] [INFO ] Implicit Places using invariants in 204 ms returned []
[2024-05-29 07:04:30] [INFO ] Invariant cache hit.
[2024-05-29 07:04:30] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 491 ms to find 0 implicit places.
Running 260 sub problems to find dead transitions.
[2024-05-29 07:04:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/572 variables, 311/733 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:04:37] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 1/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:04:42] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-29 07:04:43] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/572 variables, 2/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 736 constraints, problems are : Problem set: 0 solved, 260 unsolved in 18905 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 3/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/572 variables, 311/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 260/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:05:15] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2024-05-29 07:05:17] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 998 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30021 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 5/5 constraints]
After SMT, in 48960ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 48962ms
Starting structural reductions in LI_LTL mode, iteration 1 : 311/313 places, 261/263 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 49465 ms. Remains : 311/313 places, 261/263 transitions.
Running random walk in product with property : ShieldPPPs-PT-010A-LTLCardinality-01
Product exploration explored 100000 steps with 694 reset in 406 ms.
Product exploration explored 100000 steps with 702 reset in 421 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 60 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 261/261 transitions.
Applied a total of 0 rules in 7 ms. Remains 311 /311 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2024-05-29 07:05:21] [INFO ] Invariant cache hit.
[2024-05-29 07:05:21] [INFO ] Implicit Places using invariants in 170 ms returned []
[2024-05-29 07:05:21] [INFO ] Invariant cache hit.
[2024-05-29 07:05:21] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 456 ms to find 0 implicit places.
[2024-05-29 07:05:21] [INFO ] Redundant transitions in 1 ms returned []
Running 260 sub problems to find dead transitions.
[2024-05-29 07:05:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/572 variables, 311/733 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:05:28] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 1/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:05:32] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-29 07:05:33] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/572 variables, 2/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 736 constraints, problems are : Problem set: 0 solved, 260 unsolved in 18584 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 3/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/572 variables, 311/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 260/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:06:05] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
[2024-05-29 07:06:07] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 998 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30023 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 5/5 constraints]
After SMT, in 48636ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 48638ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 49107 ms. Remains : 311/311 places, 261/261 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 699 reset in 320 ms.
Product exploration explored 100000 steps with 712 reset in 364 ms.
Support contains 2 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 261/261 transitions.
Applied a total of 0 rules in 6 ms. Remains 311 /311 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2024-05-29 07:06:11] [INFO ] Invariant cache hit.
[2024-05-29 07:06:11] [INFO ] Implicit Places using invariants in 159 ms returned []
[2024-05-29 07:06:11] [INFO ] Invariant cache hit.
[2024-05-29 07:06:11] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 434 ms to find 0 implicit places.
[2024-05-29 07:06:11] [INFO ] Redundant transitions in 1 ms returned []
Running 260 sub problems to find dead transitions.
[2024-05-29 07:06:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/572 variables, 311/733 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:06:18] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 1/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:06:22] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
[2024-05-29 07:06:23] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/572 variables, 2/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 736 constraints, problems are : Problem set: 0 solved, 260 unsolved in 18842 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 3/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/572 variables, 311/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 260/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:06:55] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-05-29 07:06:57] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 998 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30011 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 5/5 constraints]
After SMT, in 48882ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 48884ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 49342 ms. Remains : 311/311 places, 261/261 transitions.
Treatment of property ShieldPPPs-PT-010A-LTLCardinality-01 finished in 150431 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(!p0))||(F(!p0)&&G((F(p1)&&F(p0)))))))'
Found a Shortening insensitive property : ShieldPPPs-PT-010A-LTLCardinality-02
Stuttering acceptance computed with spot in 164 ms :[p0, p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 3 out of 313 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 311 transition count 261
Applied a total of 4 rules in 9 ms. Remains 311 /313 variables (removed 2) and now considering 261/263 (removed 2) transitions.
[2024-05-29 07:07:00] [INFO ] Invariant cache hit.
[2024-05-29 07:07:01] [INFO ] Implicit Places using invariants in 170 ms returned []
[2024-05-29 07:07:01] [INFO ] Invariant cache hit.
[2024-05-29 07:07:01] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 438 ms to find 0 implicit places.
Running 260 sub problems to find dead transitions.
[2024-05-29 07:07:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/572 variables, 311/733 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:07:08] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 1/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:07:12] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-29 07:07:13] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/572 variables, 2/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 736 constraints, problems are : Problem set: 0 solved, 260 unsolved in 18628 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 3/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/572 variables, 311/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 260/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:07:45] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 2 ms to minimize.
[2024-05-29 07:07:47] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 998 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30011 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 5/5 constraints]
After SMT, in 48679ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 48682ms
Starting structural reductions in LI_LTL mode, iteration 1 : 311/313 places, 261/263 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 49129 ms. Remains : 311/313 places, 261/263 transitions.
Running random walk in product with property : ShieldPPPs-PT-010A-LTLCardinality-02
Product exploration explored 100000 steps with 3049 reset in 293 ms.
Product exploration explored 100000 steps with 3229 reset in 334 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 86 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 1578 steps (0 resets) in 14 ms. (105 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 152 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 63 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
[2024-05-29 07:07:51] [INFO ] Invariant cache hit.
[2024-05-29 07:07:51] [INFO ] [Real]Absence check using 111 positive place invariants in 29 ms returned sat
[2024-05-29 07:07:51] [INFO ] [Real]Absence check using state equation in 239 ms returned sat
[2024-05-29 07:07:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 07:07:51] [INFO ] [Nat]Absence check using 111 positive place invariants in 27 ms returned sat
[2024-05-29 07:07:51] [INFO ] [Nat]Absence check using state equation in 259 ms returned sat
[2024-05-29 07:07:51] [INFO ] Computed and/alt/rep : 260/727/260 causal constraints (skipped 0 transitions) in 14 ms.
[2024-05-29 07:07:53] [INFO ] Added : 202 causal constraints over 41 iterations in 1881 ms. Result :sat
Could not prove EG (AND p0 (NOT p1))
Support contains 3 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 261/261 transitions.
Applied a total of 0 rules in 6 ms. Remains 311 /311 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2024-05-29 07:07:53] [INFO ] Invariant cache hit.
[2024-05-29 07:07:54] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-05-29 07:07:54] [INFO ] Invariant cache hit.
[2024-05-29 07:07:54] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 468 ms to find 0 implicit places.
[2024-05-29 07:07:54] [INFO ] Redundant transitions in 1 ms returned []
Running 260 sub problems to find dead transitions.
[2024-05-29 07:07:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/572 variables, 311/733 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:08:01] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 1/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:08:05] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-05-29 07:08:06] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/572 variables, 2/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 736 constraints, problems are : Problem set: 0 solved, 260 unsolved in 18673 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 3/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/572 variables, 311/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 260/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:08:38] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
[2024-05-29 07:08:40] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 998 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30009 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 5/5 constraints]
After SMT, in 48724ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 48727ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 49209 ms. Remains : 311/311 places, 261/261 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 166 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 122 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 1918 steps (0 resets) in 16 ms. (112 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 146 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 71 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
[2024-05-29 07:08:43] [INFO ] Invariant cache hit.
[2024-05-29 07:08:43] [INFO ] [Real]Absence check using 111 positive place invariants in 28 ms returned sat
[2024-05-29 07:08:44] [INFO ] [Real]Absence check using state equation in 241 ms returned sat
[2024-05-29 07:08:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 07:08:44] [INFO ] [Nat]Absence check using 111 positive place invariants in 31 ms returned sat
[2024-05-29 07:08:44] [INFO ] [Nat]Absence check using state equation in 259 ms returned sat
[2024-05-29 07:08:44] [INFO ] Computed and/alt/rep : 260/727/260 causal constraints (skipped 0 transitions) in 15 ms.
[2024-05-29 07:08:46] [INFO ] Added : 202 causal constraints over 41 iterations in 1936 ms. Result :sat
Could not prove EG (AND p0 (NOT p1))
Stuttering acceptance computed with spot in 60 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 6158 reset in 306 ms.
Product exploration explored 100000 steps with 6041 reset in 337 ms.
Support contains 3 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 261/261 transitions.
Applied a total of 0 rules in 6 ms. Remains 311 /311 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2024-05-29 07:08:47] [INFO ] Invariant cache hit.
[2024-05-29 07:08:47] [INFO ] Implicit Places using invariants in 158 ms returned []
[2024-05-29 07:08:47] [INFO ] Invariant cache hit.
[2024-05-29 07:08:47] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 454 ms to find 0 implicit places.
[2024-05-29 07:08:47] [INFO ] Redundant transitions in 1 ms returned []
Running 260 sub problems to find dead transitions.
[2024-05-29 07:08:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/572 variables, 311/733 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:08:54] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 1/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:08:58] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 0 ms to minimize.
[2024-05-29 07:08:59] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/572 variables, 2/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 736 constraints, problems are : Problem set: 0 solved, 260 unsolved in 18203 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 3/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/572 variables, 311/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 260/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:09:31] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-05-29 07:09:33] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 998 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30017 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 5/5 constraints]
After SMT, in 48249ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 48252ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 48721 ms. Remains : 311/311 places, 261/261 transitions.
Treatment of property ShieldPPPs-PT-010A-LTLCardinality-02 finished in 155340 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)))'
Found a Shortening insensitive property : ShieldPPPs-PT-010A-LTLCardinality-10
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Support contains 4 out of 313 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 311 transition count 261
Applied a total of 4 rules in 16 ms. Remains 311 /313 variables (removed 2) and now considering 261/263 (removed 2) transitions.
[2024-05-29 07:09:36] [INFO ] Invariant cache hit.
[2024-05-29 07:09:36] [INFO ] Implicit Places using invariants in 152 ms returned []
[2024-05-29 07:09:36] [INFO ] Invariant cache hit.
[2024-05-29 07:09:36] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 428 ms to find 0 implicit places.
Running 260 sub problems to find dead transitions.
[2024-05-29 07:09:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/572 variables, 311/733 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:09:43] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 1/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:09:47] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-29 07:09:48] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/572 variables, 2/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 736 constraints, problems are : Problem set: 0 solved, 260 unsolved in 18760 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 3/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/572 variables, 311/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 260/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:10:21] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-29 07:10:23] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 998 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30015 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 5/5 constraints]
After SMT, in 48818ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 48820ms
Starting structural reductions in LI_LTL mode, iteration 1 : 311/313 places, 261/263 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 49265 ms. Remains : 311/313 places, 261/263 transitions.
Running random walk in product with property : ShieldPPPs-PT-010A-LTLCardinality-10
Product exploration explored 100000 steps with 2335 reset in 343 ms.
Product exploration explored 100000 steps with 2385 reset in 343 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 157 steps (0 resets) in 6 ms. (22 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 114 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
[2024-05-29 07:10:26] [INFO ] Invariant cache hit.
[2024-05-29 07:10:26] [INFO ] [Real]Absence check using 111 positive place invariants in 28 ms returned sat
[2024-05-29 07:10:26] [INFO ] [Real]Absence check using state equation in 225 ms returned sat
[2024-05-29 07:10:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 07:10:27] [INFO ] [Nat]Absence check using 111 positive place invariants in 26 ms returned sat
[2024-05-29 07:10:27] [INFO ] [Nat]Absence check using state equation in 211 ms returned sat
[2024-05-29 07:10:27] [INFO ] Computed and/alt/rep : 260/727/260 causal constraints (skipped 0 transitions) in 19 ms.
[2024-05-29 07:10:30] [INFO ] Added : 259 causal constraints over 55 iterations in 3096 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 4 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 261/261 transitions.
Applied a total of 0 rules in 14 ms. Remains 311 /311 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2024-05-29 07:10:30] [INFO ] Invariant cache hit.
[2024-05-29 07:10:30] [INFO ] Implicit Places using invariants in 143 ms returned []
[2024-05-29 07:10:30] [INFO ] Invariant cache hit.
[2024-05-29 07:10:30] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 389 ms to find 0 implicit places.
[2024-05-29 07:10:30] [INFO ] Redundant transitions in 1 ms returned []
Running 260 sub problems to find dead transitions.
[2024-05-29 07:10:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/572 variables, 311/733 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:10:38] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 1/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:10:42] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-29 07:10:43] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/572 variables, 2/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 736 constraints, problems are : Problem set: 0 solved, 260 unsolved in 18998 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 3/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/572 variables, 311/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 260/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:11:15] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-05-29 07:11:17] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 998 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30020 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 5/5 constraints]
After SMT, in 49047ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 49049ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 49459 ms. Remains : 311/311 places, 261/261 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 174 steps (0 resets) in 7 ms. (21 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
[2024-05-29 07:11:20] [INFO ] Invariant cache hit.
[2024-05-29 07:11:20] [INFO ] [Real]Absence check using 111 positive place invariants in 29 ms returned sat
[2024-05-29 07:11:20] [INFO ] [Real]Absence check using state equation in 230 ms returned sat
[2024-05-29 07:11:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 07:11:20] [INFO ] [Nat]Absence check using 111 positive place invariants in 25 ms returned sat
[2024-05-29 07:11:21] [INFO ] [Nat]Absence check using state equation in 200 ms returned sat
[2024-05-29 07:11:21] [INFO ] Computed and/alt/rep : 260/727/260 causal constraints (skipped 0 transitions) in 15 ms.
[2024-05-29 07:11:24] [INFO ] Added : 259 causal constraints over 55 iterations in 3175 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2355 reset in 312 ms.
Product exploration explored 100000 steps with 2433 reset in 345 ms.
Support contains 4 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 261/261 transitions.
Applied a total of 0 rules in 5 ms. Remains 311 /311 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2024-05-29 07:11:25] [INFO ] Invariant cache hit.
[2024-05-29 07:11:25] [INFO ] Implicit Places using invariants in 160 ms returned []
[2024-05-29 07:11:25] [INFO ] Invariant cache hit.
[2024-05-29 07:11:25] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 405 ms to find 0 implicit places.
[2024-05-29 07:11:25] [INFO ] Redundant transitions in 1 ms returned []
Running 260 sub problems to find dead transitions.
[2024-05-29 07:11:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/572 variables, 311/733 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:11:32] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 1/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:11:36] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-05-29 07:11:37] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/572 variables, 2/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 736 constraints, problems are : Problem set: 0 solved, 260 unsolved in 19059 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 3/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/572 variables, 311/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 260/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:12:10] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-05-29 07:12:12] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 998 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30018 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 5/5 constraints]
After SMT, in 49110ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 49113ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 49528 ms. Remains : 311/311 places, 261/261 transitions.
Treatment of property ShieldPPPs-PT-010A-LTLCardinality-10 finished in 158605 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))))'
Found a Shortening insensitive property : ShieldPPPs-PT-010A-LTLCardinality-12
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 313 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Reduce places removed 1 places and 1 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 311 transition count 261
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 310 transition count 260
Applied a total of 4 rules in 18 ms. Remains 310 /313 variables (removed 3) and now considering 260/263 (removed 3) transitions.
// Phase 1: matrix 260 rows 310 cols
[2024-05-29 07:12:14] [INFO ] Computed 111 invariants in 4 ms
[2024-05-29 07:12:14] [INFO ] Implicit Places using invariants in 161 ms returned []
[2024-05-29 07:12:14] [INFO ] Invariant cache hit.
[2024-05-29 07:12:15] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 420 ms to find 0 implicit places.
Running 258 sub problems to find dead transitions.
[2024-05-29 07:12:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 260/570 variables, 310/731 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/570 variables, 0/731 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-29 07:12:21] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-29 07:12:21] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-05-29 07:12:21] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-29 07:12:21] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-29 07:12:21] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-29 07:12:21] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-29 07:12:21] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-29 07:12:22] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-29 07:12:22] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-05-29 07:12:22] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-29 07:12:22] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-29 07:12:22] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-29 07:12:22] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-05-29 07:12:22] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
[2024-05-29 07:12:23] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
At refinement iteration 5 (OVERLAPS) 0/570 variables, 15/746 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/570 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (OVERLAPS) 0/570 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Real declared 570/570 variables, and 746 constraints, problems are : Problem set: 0 solved, 258 unsolved in 13959 ms.
Refiners :[Domain max(s): 310/310 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 310/310 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 15/436 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (OVERLAPS) 260/570 variables, 310/746 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/570 variables, 258/1004 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/570 variables, 0/1004 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-29 07:12:43] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/570 variables, 1/1005 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/570 variables, and 1005 constraints, problems are : Problem set: 0 solved, 258 unsolved in 30019 ms.
Refiners :[Domain max(s): 310/310 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 310/310 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 16/16 constraints]
After SMT, in 44003ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 44005ms
Starting structural reductions in LI_LTL mode, iteration 1 : 310/313 places, 260/263 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 44446 ms. Remains : 310/313 places, 260/263 transitions.
Running random walk in product with property : ShieldPPPs-PT-010A-LTLCardinality-12
Product exploration explored 100000 steps with 274 reset in 356 ms.
Product exploration explored 100000 steps with 277 reset in 397 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 105 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 1401 steps (0 resets) in 12 ms. (107 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 193 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-29 07:13:00] [INFO ] Invariant cache hit.
[2024-05-29 07:13:00] [INFO ] [Real]Absence check using 111 positive place invariants in 26 ms returned sat
[2024-05-29 07:13:01] [INFO ] [Real]Absence check using state equation in 276 ms returned sat
[2024-05-29 07:13:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 07:13:01] [INFO ] [Nat]Absence check using 111 positive place invariants in 31 ms returned sat
[2024-05-29 07:13:01] [INFO ] [Nat]Absence check using state equation in 192 ms returned sat
[2024-05-29 07:13:01] [INFO ] Computed and/alt/rep : 258/493/258 causal constraints (skipped 0 transitions) in 15 ms.
[2024-05-29 07:13:06] [INFO ] Added : 257 causal constraints over 53 iterations in 4771 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 310 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 310/310 places, 260/260 transitions.
Applied a total of 0 rules in 7 ms. Remains 310 /310 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2024-05-29 07:13:06] [INFO ] Invariant cache hit.
[2024-05-29 07:13:06] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-05-29 07:13:06] [INFO ] Invariant cache hit.
[2024-05-29 07:13:06] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 399 ms to find 0 implicit places.
Running 258 sub problems to find dead transitions.
[2024-05-29 07:13:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 260/570 variables, 310/731 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/570 variables, 0/731 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-29 07:13:12] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-29 07:13:12] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-05-29 07:13:13] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-29 07:13:13] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-05-29 07:13:13] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-29 07:13:13] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-29 07:13:13] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-05-29 07:13:13] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-05-29 07:13:13] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-05-29 07:13:13] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
[2024-05-29 07:13:14] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-29 07:13:14] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-29 07:13:14] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-05-29 07:13:14] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
[2024-05-29 07:13:14] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (OVERLAPS) 0/570 variables, 15/746 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/570 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (OVERLAPS) 0/570 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Real declared 570/570 variables, and 746 constraints, problems are : Problem set: 0 solved, 258 unsolved in 13857 ms.
Refiners :[Domain max(s): 310/310 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 310/310 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 15/436 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (OVERLAPS) 260/570 variables, 310/746 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/570 variables, 258/1004 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/570 variables, 0/1004 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-29 07:13:34] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/570 variables, 1/1005 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/570 variables, and 1005 constraints, problems are : Problem set: 0 solved, 258 unsolved in 30020 ms.
Refiners :[Domain max(s): 310/310 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 310/310 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 16/16 constraints]
After SMT, in 43906ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 43908ms
Finished structural reductions in LTL mode , in 1 iterations and 44316 ms. Remains : 310/310 places, 260/260 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 63 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 1466 steps (0 resets) in 21 ms. (66 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 106 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-29 07:13:51] [INFO ] Invariant cache hit.
[2024-05-29 07:13:51] [INFO ] [Real]Absence check using 111 positive place invariants in 25 ms returned sat
[2024-05-29 07:13:51] [INFO ] [Real]Absence check using state equation in 291 ms returned sat
[2024-05-29 07:13:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 07:13:51] [INFO ] [Nat]Absence check using 111 positive place invariants in 22 ms returned sat
[2024-05-29 07:13:51] [INFO ] [Nat]Absence check using state equation in 194 ms returned sat
[2024-05-29 07:13:52] [INFO ] Computed and/alt/rep : 258/493/258 causal constraints (skipped 0 transitions) in 15 ms.
[2024-05-29 07:13:57] [INFO ] Added : 257 causal constraints over 53 iterations in 5076 ms. Result :unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 276 reset in 378 ms.
Product exploration explored 100000 steps with 274 reset in 421 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 310 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 310/310 places, 260/260 transitions.
Applied a total of 0 rules in 4 ms. Remains 310 /310 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2024-05-29 07:13:58] [INFO ] Redundant transitions in 1 ms returned []
Running 258 sub problems to find dead transitions.
[2024-05-29 07:13:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 260/570 variables, 310/731 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/570 variables, 0/731 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-29 07:14:04] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-29 07:14:04] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-05-29 07:14:04] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-29 07:14:04] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2024-05-29 07:14:04] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-29 07:14:04] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-05-29 07:14:05] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-29 07:14:05] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-29 07:14:05] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-05-29 07:14:05] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-05-29 07:14:05] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-29 07:14:05] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-29 07:14:05] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2024-05-29 07:14:05] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2024-05-29 07:14:06] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
At refinement iteration 5 (OVERLAPS) 0/570 variables, 15/746 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/570 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (OVERLAPS) 0/570 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Real declared 570/570 variables, and 746 constraints, problems are : Problem set: 0 solved, 258 unsolved in 13935 ms.
Refiners :[Domain max(s): 310/310 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 310/310 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 15/436 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (OVERLAPS) 260/570 variables, 310/746 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/570 variables, 258/1004 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/570 variables, 0/1004 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-29 07:14:26] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/570 variables, 1/1005 constraints. Problems are: Problem set: 0 solved, 258 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 570/570 variables, and 1005 constraints, problems are : Problem set: 0 solved, 258 unsolved in 30016 ms.
Refiners :[Domain max(s): 310/310 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 310/310 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 16/16 constraints]
After SMT, in 43978ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 43981ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 43995 ms. Remains : 310/310 places, 260/260 transitions.
Support contains 1 out of 310 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 310/310 places, 260/260 transitions.
Applied a total of 0 rules in 3 ms. Remains 310 /310 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2024-05-29 07:14:42] [INFO ] Invariant cache hit.
[2024-05-29 07:14:42] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-05-29 07:14:42] [INFO ] Invariant cache hit.
[2024-05-29 07:14:42] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 421 ms to find 0 implicit places.
Running 258 sub problems to find dead transitions.
[2024-05-29 07:14:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 260/570 variables, 310/731 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/570 variables, 0/731 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-29 07:14:48] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-05-29 07:14:48] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-05-29 07:14:48] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
[2024-05-29 07:14:48] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-05-29 07:14:48] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-29 07:14:48] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-29 07:14:49] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-05-29 07:14:49] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-29 07:14:49] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-05-29 07:14:49] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
[2024-05-29 07:14:49] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-29 07:14:49] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 0 ms to minimize.
[2024-05-29 07:14:49] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
[2024-05-29 07:14:49] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 0 ms to minimize.
[2024-05-29 07:14:50] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
At refinement iteration 5 (OVERLAPS) 0/570 variables, 15/746 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/570 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (OVERLAPS) 0/570 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Real declared 570/570 variables, and 746 constraints, problems are : Problem set: 0 solved, 258 unsolved in 13678 ms.
Refiners :[Domain max(s): 310/310 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 310/310 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 15/436 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (OVERLAPS) 260/570 variables, 310/746 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/570 variables, 258/1004 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/570 variables, 0/1004 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-29 07:15:10] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/570 variables, 1/1005 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/570 variables, and 1005 constraints, problems are : Problem set: 0 solved, 258 unsolved in 30012 ms.
Refiners :[Domain max(s): 310/310 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 310/310 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 16/16 constraints]
After SMT, in 43726ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 43729ms
Finished structural reductions in LTL mode , in 1 iterations and 44154 ms. Remains : 310/310 places, 260/260 transitions.
Treatment of property ShieldPPPs-PT-010A-LTLCardinality-12 finished in 191805 ms.
[2024-05-29 07:15:26] [INFO ] Flatten gal took : 17 ms
[2024-05-29 07:15:26] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-29 07:15:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 313 places, 263 transitions and 1006 arcs took 5 ms.
Total runtime 1530171 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running ShieldPPPs-PT-010A
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 313
TRANSITIONS: 263
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.003s, Sys 0.002s]
SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.001s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 2827
MODEL NAME: /home/mcc/execution/412/model
313 places, 263 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPs-PT-010A"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is ShieldPPPs-PT-010A, 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 r355-tall-171683758800435"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-010A.tgz
mv ShieldPPPs-PT-010A 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 ;