fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r528-tall-171683761000419
Last Updated
July 7, 2024

About the Execution of LTSMin+red for ShieldPPPs-PT-005A

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
412.292 349696.00 746221.00 760.10 FFFTTTTTTTFFFTFT 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.r528-tall-171683761000419.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 ltsminxred
Input is ShieldPPPs-PT-005A, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683761000419
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K 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.5K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 13 11:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 186K Apr 13 11:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 13 11:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 13 11:29 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 44K 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-005A-LTLCardinality-00
FORMULA_NAME ShieldPPPs-PT-005A-LTLCardinality-01
FORMULA_NAME ShieldPPPs-PT-005A-LTLCardinality-02
FORMULA_NAME ShieldPPPs-PT-005A-LTLCardinality-03
FORMULA_NAME ShieldPPPs-PT-005A-LTLCardinality-04
FORMULA_NAME ShieldPPPs-PT-005A-LTLCardinality-05
FORMULA_NAME ShieldPPPs-PT-005A-LTLCardinality-06
FORMULA_NAME ShieldPPPs-PT-005A-LTLCardinality-07
FORMULA_NAME ShieldPPPs-PT-005A-LTLCardinality-08
FORMULA_NAME ShieldPPPs-PT-005A-LTLCardinality-09
FORMULA_NAME ShieldPPPs-PT-005A-LTLCardinality-10
FORMULA_NAME ShieldPPPs-PT-005A-LTLCardinality-11
FORMULA_NAME ShieldPPPs-PT-005A-LTLCardinality-12
FORMULA_NAME ShieldPPPs-PT-005A-LTLCardinality-13
FORMULA_NAME ShieldPPPs-PT-005A-LTLCardinality-14
FORMULA_NAME ShieldPPPs-PT-005A-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717242887066

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-005A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 11:54:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 11:54:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 11:54:48] [INFO ] Load time of PNML (sax parser for PT used): 62 ms
[2024-06-01 11:54:48] [INFO ] Transformed 158 places.
[2024-06-01 11:54:48] [INFO ] Transformed 133 transitions.
[2024-06-01 11:54:48] [INFO ] Found NUPN structural information;
[2024-06-01 11:54:48] [INFO ] Parsed PT model containing 158 places and 133 transitions and 506 arcs in 155 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA ShieldPPPs-PT-005A-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-005A-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-005A-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-005A-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-005A-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-005A-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-005A-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-005A-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 133/133 transitions.
Applied a total of 0 rules in 14 ms. Remains 158 /158 variables (removed 0) and now considering 133/133 (removed 0) transitions.
// Phase 1: matrix 133 rows 158 cols
[2024-06-01 11:54:48] [INFO ] Computed 56 invariants in 6 ms
[2024-06-01 11:54:48] [INFO ] Implicit Places using invariants in 249 ms returned []
[2024-06-01 11:54:48] [INFO ] Invariant cache hit.
[2024-06-01 11:54:49] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 452 ms to find 0 implicit places.
Running 132 sub problems to find dead transitions.
[2024-06-01 11:54:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 56/213 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (OVERLAPS) 133/291 variables, 158/372 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-06-01 11:54:51] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 7 ms to minimize.
[2024-06-01 11:54:51] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 3 ms to minimize.
[2024-06-01 11:54:51] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 3/375 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (OVERLAPS) 0/291 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 375 constraints, problems are : Problem set: 0 solved, 132 unsolved in 4391 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 56/213 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 3/217 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (OVERLAPS) 133/291 variables, 158/375 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 132/507 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 9 (OVERLAPS) 0/291 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 507 constraints, problems are : Problem set: 0 solved, 132 unsolved in 10636 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 3/3 constraints]
After SMT, in 15085ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 15104ms
Finished structural reductions in LTL mode , in 1 iterations and 15589 ms. Remains : 158/158 places, 133/133 transitions.
Support contains 23 out of 158 places after structural reductions.
[2024-06-01 11:55:04] [INFO ] Flatten gal took : 36 ms
[2024-06-01 11:55:04] [INFO ] Flatten gal took : 16 ms
[2024-06-01 11:55:04] [INFO ] Input system was already deterministic with 133 transitions.
Reduction of identical properties reduced properties to check from 13 to 12
RANDOM walk for 853 steps (0 resets) in 64 ms. (13 steps per ms) remains 0/12 properties
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' '!(F(G((X(p1)||p0))))'
Support contains 4 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 133/133 transitions.
Applied a total of 0 rules in 7 ms. Remains 158 /158 variables (removed 0) and now considering 133/133 (removed 0) transitions.
[2024-06-01 11:55:04] [INFO ] Invariant cache hit.
[2024-06-01 11:55:04] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-06-01 11:55:04] [INFO ] Invariant cache hit.
[2024-06-01 11:55:04] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
Running 132 sub problems to find dead transitions.
[2024-06-01 11:55:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 56/213 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (OVERLAPS) 133/291 variables, 158/372 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-06-01 11:55:06] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 2 ms to minimize.
[2024-06-01 11:55:07] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-06-01 11:55:07] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 3/375 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (OVERLAPS) 0/291 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 375 constraints, problems are : Problem set: 0 solved, 132 unsolved in 3916 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 56/213 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 3/217 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (OVERLAPS) 133/291 variables, 158/375 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 132/507 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 9 (OVERLAPS) 0/291 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 507 constraints, problems are : Problem set: 0 solved, 132 unsolved in 10407 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 3/3 constraints]
After SMT, in 14349ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 14351ms
Finished structural reductions in LTL mode , in 1 iterations and 14613 ms. Remains : 158/158 places, 133/133 transitions.
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-005A-LTLCardinality-00
Product exploration explored 100000 steps with 258 reset in 421 ms.
Product exploration explored 100000 steps with 255 reset in 362 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 p1), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 125 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 935 steps (1 resets) in 24 ms. (37 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 13 factoid took 355 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 133/133 transitions.
Applied a total of 0 rules in 11 ms. Remains 158 /158 variables (removed 0) and now considering 133/133 (removed 0) transitions.
[2024-06-01 11:55:21] [INFO ] Invariant cache hit.
[2024-06-01 11:55:21] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-06-01 11:55:21] [INFO ] Invariant cache hit.
[2024-06-01 11:55:21] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
Running 132 sub problems to find dead transitions.
[2024-06-01 11:55:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 56/213 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (OVERLAPS) 133/291 variables, 158/372 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-06-01 11:55:22] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-06-01 11:55:23] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-06-01 11:55:23] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 3/375 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (OVERLAPS) 0/291 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 375 constraints, problems are : Problem set: 0 solved, 132 unsolved in 3826 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 56/213 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 3/217 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (OVERLAPS) 133/291 variables, 158/375 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 132/507 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 9 (OVERLAPS) 0/291 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 507 constraints, problems are : Problem set: 0 solved, 132 unsolved in 10383 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 3/3 constraints]
After SMT, in 14234ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 14236ms
Finished structural reductions in LTL mode , in 1 iterations and 14478 ms. Remains : 158/158 places, 133/133 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 p1), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 123 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 648 steps (1 resets) in 18 ms. (34 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 13 factoid took 300 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 259 reset in 274 ms.
Product exploration explored 100000 steps with 255 reset in 288 ms.
Support contains 4 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 133/133 transitions.
Applied a total of 0 rules in 13 ms. Remains 158 /158 variables (removed 0) and now considering 133/133 (removed 0) transitions.
[2024-06-01 11:55:37] [INFO ] Invariant cache hit.
[2024-06-01 11:55:37] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-06-01 11:55:37] [INFO ] Invariant cache hit.
[2024-06-01 11:55:37] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
Running 132 sub problems to find dead transitions.
[2024-06-01 11:55:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 56/213 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (OVERLAPS) 133/291 variables, 158/372 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-06-01 11:55:38] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-06-01 11:55:39] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-06-01 11:55:39] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 3/375 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (OVERLAPS) 0/291 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 375 constraints, problems are : Problem set: 0 solved, 132 unsolved in 3899 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 56/213 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 3/217 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (OVERLAPS) 133/291 variables, 158/375 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 132/507 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 9 (OVERLAPS) 0/291 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 507 constraints, problems are : Problem set: 0 solved, 132 unsolved in 10495 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 3/3 constraints]
After SMT, in 14411ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 14413ms
Finished structural reductions in LTL mode , in 1 iterations and 14662 ms. Remains : 158/158 places, 133/133 transitions.
Treatment of property ShieldPPPs-PT-005A-LTLCardinality-00 finished in 47208 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(G(p0))||G(p1)))))'
Support contains 1 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 133/133 transitions.
Applied a total of 0 rules in 4 ms. Remains 158 /158 variables (removed 0) and now considering 133/133 (removed 0) transitions.
[2024-06-01 11:55:51] [INFO ] Invariant cache hit.
[2024-06-01 11:55:51] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-06-01 11:55:51] [INFO ] Invariant cache hit.
[2024-06-01 11:55:52] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
Running 132 sub problems to find dead transitions.
[2024-06-01 11:55:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 56/213 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (OVERLAPS) 133/291 variables, 158/372 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-06-01 11:55:53] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-06-01 11:55:54] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-06-01 11:55:54] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 3/375 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (OVERLAPS) 0/291 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 375 constraints, problems are : Problem set: 0 solved, 132 unsolved in 3837 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 56/213 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 3/217 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (OVERLAPS) 133/291 variables, 158/375 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 132/507 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 9 (OVERLAPS) 0/291 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 507 constraints, problems are : Problem set: 0 solved, 132 unsolved in 10751 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 3/3 constraints]
After SMT, in 14611ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 14613ms
Finished structural reductions in LTL mode , in 1 iterations and 14854 ms. Remains : 158/158 places, 133/133 transitions.
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPs-PT-005A-LTLCardinality-01
Stuttering criterion allowed to conclude after 754 steps with 1 reset in 6 ms.
FORMULA ShieldPPPs-PT-005A-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-005A-LTLCardinality-01 finished in 15042 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&X(p1))))'
Support contains 3 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 133/133 transitions.
Applied a total of 0 rules in 3 ms. Remains 158 /158 variables (removed 0) and now considering 133/133 (removed 0) transitions.
[2024-06-01 11:56:06] [INFO ] Invariant cache hit.
[2024-06-01 11:56:06] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-06-01 11:56:06] [INFO ] Invariant cache hit.
[2024-06-01 11:56:07] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
Running 132 sub problems to find dead transitions.
[2024-06-01 11:56:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 56/213 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (OVERLAPS) 133/291 variables, 158/372 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-06-01 11:56:08] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-06-01 11:56:09] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 2 ms to minimize.
[2024-06-01 11:56:09] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 3/375 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (OVERLAPS) 0/291 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 375 constraints, problems are : Problem set: 0 solved, 132 unsolved in 3850 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 56/213 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 3/217 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (OVERLAPS) 133/291 variables, 158/375 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 132/507 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 9 (OVERLAPS) 0/291 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 507 constraints, problems are : Problem set: 0 solved, 132 unsolved in 9962 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 3/3 constraints]
After SMT, in 13830ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 13832ms
Finished structural reductions in LTL mode , in 1 iterations and 14087 ms. Remains : 158/158 places, 133/133 transitions.
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : ShieldPPPs-PT-005A-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldPPPs-PT-005A-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-005A-LTLCardinality-02 finished in 14247 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 133/133 transitions.
Applied a total of 0 rules in 2 ms. Remains 158 /158 variables (removed 0) and now considering 133/133 (removed 0) transitions.
[2024-06-01 11:56:21] [INFO ] Invariant cache hit.
[2024-06-01 11:56:21] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-06-01 11:56:21] [INFO ] Invariant cache hit.
[2024-06-01 11:56:21] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
Running 132 sub problems to find dead transitions.
[2024-06-01 11:56:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 56/213 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (OVERLAPS) 133/291 variables, 158/372 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-06-01 11:56:23] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
[2024-06-01 11:56:23] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-06-01 11:56:23] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 3/375 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (OVERLAPS) 0/291 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 375 constraints, problems are : Problem set: 0 solved, 132 unsolved in 3938 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 56/213 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 3/217 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (OVERLAPS) 133/291 variables, 158/375 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 132/507 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 9 (OVERLAPS) 0/291 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 507 constraints, problems are : Problem set: 0 solved, 132 unsolved in 10529 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 3/3 constraints]
After SMT, in 14511ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 14512ms
Finished structural reductions in LTL mode , in 1 iterations and 14793 ms. Remains : 158/158 places, 133/133 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-005A-LTLCardinality-04
Product exploration explored 100000 steps with 50000 reset in 268 ms.
Product exploration explored 100000 steps with 50000 reset in 257 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 p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 16 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPs-PT-005A-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-005A-LTLCardinality-04 finished in 15440 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4 out of 158 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 158/158 places, 133/133 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 156 transition count 131
Applied a total of 4 rules in 27 ms. Remains 156 /158 variables (removed 2) and now considering 131/133 (removed 2) transitions.
// Phase 1: matrix 131 rows 156 cols
[2024-06-01 11:56:36] [INFO ] Computed 56 invariants in 4 ms
[2024-06-01 11:56:36] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-06-01 11:56:36] [INFO ] Invariant cache hit.
[2024-06-01 11:56:36] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
[2024-06-01 11:56:36] [INFO ] Redundant transitions in 3 ms returned []
Running 130 sub problems to find dead transitions.
[2024-06-01 11:56:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 155/155 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 1/156 variables, 56/211 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (OVERLAPS) 131/287 variables, 156/368 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-06-01 11:56:38] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/287 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-06-01 11:56:40] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/287 variables, 1/370 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/287 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 10 (OVERLAPS) 0/287 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 287/287 variables, and 370 constraints, problems are : Problem set: 0 solved, 130 unsolved in 5298 ms.
Refiners :[Domain max(s): 156/156 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 155/155 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 1/156 variables, 56/211 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (OVERLAPS) 131/287 variables, 156/370 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/287 variables, 130/500 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/287 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (OVERLAPS) 0/287 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Int declared 287/287 variables, and 500 constraints, problems are : Problem set: 0 solved, 130 unsolved in 6525 ms.
Refiners :[Domain max(s): 156/156 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 2/2 constraints]
After SMT, in 11849ms problems are : Problem set: 0 solved, 130 unsolved
Search for dead transitions found 0 dead transitions in 11851ms
Starting structural reductions in SI_LTL mode, iteration 1 : 156/158 places, 131/133 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12127 ms. Remains : 156/158 places, 131/133 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-005A-LTLCardinality-08
Product exploration explored 100000 steps with 1292 reset in 279 ms.
Product exploration explored 100000 steps with 1288 reset in 265 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 p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 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 79 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 182 steps (0 resets) in 8 ms. (20 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 96 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 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Support contains 4 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 131/131 transitions.
Applied a total of 0 rules in 9 ms. Remains 156 /156 variables (removed 0) and now considering 131/131 (removed 0) transitions.
[2024-06-01 11:56:49] [INFO ] Invariant cache hit.
[2024-06-01 11:56:49] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-06-01 11:56:49] [INFO ] Invariant cache hit.
[2024-06-01 11:56:49] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
[2024-06-01 11:56:49] [INFO ] Redundant transitions in 3 ms returned []
Running 130 sub problems to find dead transitions.
[2024-06-01 11:56:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 155/155 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 1/156 variables, 56/211 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (OVERLAPS) 131/287 variables, 156/368 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-06-01 11:56:51] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/287 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-06-01 11:56:53] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/287 variables, 1/370 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/287 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 10 (OVERLAPS) 0/287 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 287/287 variables, and 370 constraints, problems are : Problem set: 0 solved, 130 unsolved in 5236 ms.
Refiners :[Domain max(s): 156/156 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 155/155 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 1/156 variables, 56/211 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (OVERLAPS) 131/287 variables, 156/370 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/287 variables, 130/500 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/287 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (OVERLAPS) 0/287 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Int declared 287/287 variables, and 500 constraints, problems are : Problem set: 0 solved, 130 unsolved in 6610 ms.
Refiners :[Domain max(s): 156/156 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 2/2 constraints]
After SMT, in 11865ms problems are : Problem set: 0 solved, 130 unsolved
Search for dead transitions found 0 dead transitions in 11867ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 12114 ms. Remains : 156/156 places, 131/131 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 p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 92 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 96 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 222 steps (0 resets) in 6 ms. (31 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1215 reset in 220 ms.
Product exploration explored 100000 steps with 1288 reset in 238 ms.
Support contains 4 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 131/131 transitions.
Applied a total of 0 rules in 6 ms. Remains 156 /156 variables (removed 0) and now considering 131/131 (removed 0) transitions.
[2024-06-01 11:57:02] [INFO ] Invariant cache hit.
[2024-06-01 11:57:02] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-06-01 11:57:02] [INFO ] Invariant cache hit.
[2024-06-01 11:57:03] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
[2024-06-01 11:57:03] [INFO ] Redundant transitions in 2 ms returned []
Running 130 sub problems to find dead transitions.
[2024-06-01 11:57:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 155/155 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 1/156 variables, 56/211 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (OVERLAPS) 131/287 variables, 156/368 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-06-01 11:57:04] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/287 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-06-01 11:57:06] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/287 variables, 1/370 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/287 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 10 (OVERLAPS) 0/287 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 287/287 variables, and 370 constraints, problems are : Problem set: 0 solved, 130 unsolved in 5206 ms.
Refiners :[Domain max(s): 156/156 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 155/155 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 1/156 variables, 56/211 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (OVERLAPS) 131/287 variables, 156/370 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/287 variables, 130/500 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/287 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (OVERLAPS) 0/287 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Int declared 287/287 variables, and 500 constraints, problems are : Problem set: 0 solved, 130 unsolved in 6536 ms.
Refiners :[Domain max(s): 156/156 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 2/2 constraints]
After SMT, in 11758ms problems are : Problem set: 0 solved, 130 unsolved
Search for dead transitions found 0 dead transitions in 11760ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 12007 ms. Remains : 156/156 places, 131/131 transitions.
Treatment of property ShieldPPPs-PT-005A-LTLCardinality-08 finished in 38374 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 3 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 133/133 transitions.
Applied a total of 0 rules in 5 ms. Remains 158 /158 variables (removed 0) and now considering 133/133 (removed 0) transitions.
// Phase 1: matrix 133 rows 158 cols
[2024-06-01 11:57:14] [INFO ] Computed 56 invariants in 4 ms
[2024-06-01 11:57:15] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-06-01 11:57:15] [INFO ] Invariant cache hit.
[2024-06-01 11:57:15] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
Running 132 sub problems to find dead transitions.
[2024-06-01 11:57:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 56/213 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (OVERLAPS) 133/291 variables, 158/372 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-06-01 11:57:16] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-06-01 11:57:17] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 0 ms to minimize.
[2024-06-01 11:57:17] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 3/375 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (OVERLAPS) 0/291 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 375 constraints, problems are : Problem set: 0 solved, 132 unsolved in 3945 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 56/213 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 3/217 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (OVERLAPS) 133/291 variables, 158/375 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 132/507 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 9 (OVERLAPS) 0/291 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 507 constraints, problems are : Problem set: 0 solved, 132 unsolved in 10328 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 3/3 constraints]
After SMT, in 14315ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 14316ms
Finished structural reductions in LTL mode , in 1 iterations and 14670 ms. Remains : 158/158 places, 133/133 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-005A-LTLCardinality-13
Product exploration explored 100000 steps with 50000 reset in 194 ms.
Product exploration explored 100000 steps with 50000 reset in 204 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 p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 18 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPs-PT-005A-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-005A-LTLCardinality-13 finished in 15186 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 158 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 158/158 places, 133/133 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 156 transition count 131
Applied a total of 4 rules in 14 ms. Remains 156 /158 variables (removed 2) and now considering 131/133 (removed 2) transitions.
// Phase 1: matrix 131 rows 156 cols
[2024-06-01 11:57:30] [INFO ] Computed 56 invariants in 4 ms
[2024-06-01 11:57:30] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-06-01 11:57:30] [INFO ] Invariant cache hit.
[2024-06-01 11:57:30] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
[2024-06-01 11:57:30] [INFO ] Redundant transitions in 3 ms returned []
Running 130 sub problems to find dead transitions.
[2024-06-01 11:57:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 155/155 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 1/156 variables, 56/211 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (OVERLAPS) 131/287 variables, 156/368 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-06-01 11:57:32] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/287 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-06-01 11:57:33] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/287 variables, 1/370 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/287 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 10 (OVERLAPS) 0/287 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 287/287 variables, and 370 constraints, problems are : Problem set: 0 solved, 130 unsolved in 5428 ms.
Refiners :[Domain max(s): 156/156 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 155/155 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 1/156 variables, 56/211 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (OVERLAPS) 131/287 variables, 156/370 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/287 variables, 130/500 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/287 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (OVERLAPS) 0/287 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Int declared 287/287 variables, and 500 constraints, problems are : Problem set: 0 solved, 130 unsolved in 6476 ms.
Refiners :[Domain max(s): 156/156 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 2/2 constraints]
After SMT, in 11922ms problems are : Problem set: 0 solved, 130 unsolved
Search for dead transitions found 0 dead transitions in 11923ms
Starting structural reductions in SI_LTL mode, iteration 1 : 156/158 places, 131/133 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12171 ms. Remains : 156/158 places, 131/133 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-005A-LTLCardinality-14
Stuttering criterion allowed to conclude after 396 steps with 0 reset in 1 ms.
FORMULA ShieldPPPs-PT-005A-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-005A-LTLCardinality-14 finished in 12242 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(p1)&&X(p2)))'
Support contains 7 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 133/133 transitions.
Applied a total of 0 rules in 2 ms. Remains 158 /158 variables (removed 0) and now considering 133/133 (removed 0) transitions.
// Phase 1: matrix 133 rows 158 cols
[2024-06-01 11:57:42] [INFO ] Computed 56 invariants in 2 ms
[2024-06-01 11:57:42] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-06-01 11:57:42] [INFO ] Invariant cache hit.
[2024-06-01 11:57:42] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
Running 132 sub problems to find dead transitions.
[2024-06-01 11:57:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 56/213 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (OVERLAPS) 133/291 variables, 158/372 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-06-01 11:57:44] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-06-01 11:57:44] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 2 ms to minimize.
[2024-06-01 11:57:44] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 3/375 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (OVERLAPS) 0/291 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 375 constraints, problems are : Problem set: 0 solved, 132 unsolved in 3927 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 56/213 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 3/217 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (OVERLAPS) 133/291 variables, 158/375 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 132/507 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 9 (OVERLAPS) 0/291 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 507 constraints, problems are : Problem set: 0 solved, 132 unsolved in 10451 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 3/3 constraints]
After SMT, in 14397ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 14398ms
Finished structural reductions in LTL mode , in 1 iterations and 14632 ms. Remains : 158/158 places, 133/133 transitions.
Stuttering acceptance computed with spot in 188 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (NOT p0), (NOT p1), (NOT p2), true]
Running random walk in product with property : ShieldPPPs-PT-005A-LTLCardinality-15
Product exploration explored 100000 steps with 50000 reset in 213 ms.
Product exploration explored 100000 steps with 50000 reset in 227 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 p1 p2), (X p2), (X p1), (X (NOT p0)), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 16 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPs-PT-005A-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-005A-LTLCardinality-15 finished in 15298 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((X(p1)||p0))))'
Found a Lengthening insensitive property : ShieldPPPs-PT-005A-LTLCardinality-00
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 158 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 158/158 places, 133/133 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 156 transition count 131
Applied a total of 4 rules in 10 ms. Remains 156 /158 variables (removed 2) and now considering 131/133 (removed 2) transitions.
// Phase 1: matrix 131 rows 156 cols
[2024-06-01 11:57:57] [INFO ] Computed 56 invariants in 1 ms
[2024-06-01 11:57:57] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-06-01 11:57:57] [INFO ] Invariant cache hit.
[2024-06-01 11:57:58] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
Running 130 sub problems to find dead transitions.
[2024-06-01 11:57:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 155/155 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 1/156 variables, 56/211 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (OVERLAPS) 131/287 variables, 156/368 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-06-01 11:57:59] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/287 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-06-01 11:58:01] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/287 variables, 1/370 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/287 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 10 (OVERLAPS) 0/287 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 287/287 variables, and 370 constraints, problems are : Problem set: 0 solved, 130 unsolved in 5252 ms.
Refiners :[Domain max(s): 156/156 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 155/155 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 1/156 variables, 56/211 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (OVERLAPS) 131/287 variables, 156/370 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/287 variables, 130/500 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/287 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (OVERLAPS) 0/287 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Int declared 287/287 variables, and 500 constraints, problems are : Problem set: 0 solved, 130 unsolved in 6723 ms.
Refiners :[Domain max(s): 156/156 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 2/2 constraints]
After SMT, in 11992ms problems are : Problem set: 0 solved, 130 unsolved
Search for dead transitions found 0 dead transitions in 11994ms
Starting structural reductions in LI_LTL mode, iteration 1 : 156/158 places, 131/133 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 12236 ms. Remains : 156/158 places, 131/133 transitions.
Running random walk in product with property : ShieldPPPs-PT-005A-LTLCardinality-00
Product exploration explored 100000 steps with 276 reset in 266 ms.
Product exploration explored 100000 steps with 274 reset in 290 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 p1), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 138 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 345 steps (0 resets) in 10 ms. (31 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 13 factoid took 281 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 131/131 transitions.
Applied a total of 0 rules in 2 ms. Remains 156 /156 variables (removed 0) and now considering 131/131 (removed 0) transitions.
[2024-06-01 11:58:11] [INFO ] Invariant cache hit.
[2024-06-01 11:58:11] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-06-01 11:58:11] [INFO ] Invariant cache hit.
[2024-06-01 11:58:11] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
Running 130 sub problems to find dead transitions.
[2024-06-01 11:58:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 155/155 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 1/156 variables, 56/211 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (OVERLAPS) 131/287 variables, 156/368 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-06-01 11:58:13] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/287 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-06-01 11:58:14] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/287 variables, 1/370 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/287 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 10 (OVERLAPS) 0/287 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 287/287 variables, and 370 constraints, problems are : Problem set: 0 solved, 130 unsolved in 5313 ms.
Refiners :[Domain max(s): 156/156 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 155/155 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 1/156 variables, 56/211 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (OVERLAPS) 131/287 variables, 156/370 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/287 variables, 130/500 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/287 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (OVERLAPS) 0/287 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Int declared 287/287 variables, and 500 constraints, problems are : Problem set: 0 solved, 130 unsolved in 6657 ms.
Refiners :[Domain max(s): 156/156 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 2/2 constraints]
After SMT, in 11987ms problems are : Problem set: 0 solved, 130 unsolved
Search for dead transitions found 0 dead transitions in 11988ms
Finished structural reductions in LTL mode , in 1 iterations and 12266 ms. Remains : 156/156 places, 131/131 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 p1), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 122 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 351 steps (0 resets) in 10 ms. (31 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 13 factoid took 273 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 276 reset in 259 ms.
Product exploration explored 100000 steps with 270 reset in 283 ms.
Support contains 4 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 131/131 transitions.
Applied a total of 0 rules in 2 ms. Remains 156 /156 variables (removed 0) and now considering 131/131 (removed 0) transitions.
[2024-06-01 11:58:24] [INFO ] Invariant cache hit.
[2024-06-01 11:58:25] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-06-01 11:58:25] [INFO ] Invariant cache hit.
[2024-06-01 11:58:25] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
Running 130 sub problems to find dead transitions.
[2024-06-01 11:58:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 155/155 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 1/156 variables, 56/211 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (OVERLAPS) 131/287 variables, 156/368 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-06-01 11:58:26] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/287 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-06-01 11:58:28] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/287 variables, 1/370 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/287 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 10 (OVERLAPS) 0/287 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 287/287 variables, and 370 constraints, problems are : Problem set: 0 solved, 130 unsolved in 5316 ms.
Refiners :[Domain max(s): 156/156 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 155/155 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 1/156 variables, 56/211 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (OVERLAPS) 131/287 variables, 156/370 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/287 variables, 130/500 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/287 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (OVERLAPS) 0/287 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Int declared 287/287 variables, and 500 constraints, problems are : Problem set: 0 solved, 130 unsolved in 6598 ms.
Refiners :[Domain max(s): 156/156 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 2/2 constraints]
After SMT, in 11933ms problems are : Problem set: 0 solved, 130 unsolved
Search for dead transitions found 0 dead transitions in 11935ms
Finished structural reductions in LTL mode , in 1 iterations and 12173 ms. Remains : 156/156 places, 131/131 transitions.
Treatment of property ShieldPPPs-PT-005A-LTLCardinality-00 finished in 39533 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2024-06-01 11:58:37] [INFO ] Flatten gal took : 15 ms
[2024-06-01 11:58:37] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-06-01 11:58:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 158 places, 133 transitions and 506 arcs took 4 ms.
Total runtime 229049 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA ShieldPPPs-PT-005A-LTLCardinality-00 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldPPPs-PT-005A-LTLCardinality-08 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717243236762

--------------------
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
mcc2024
ltl formula name ShieldPPPs-PT-005A-LTLCardinality-00
ltl formula formula --ltl=/tmp/1314/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 158 places, 133 transitions and 506 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.000 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1314/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1314/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1314/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1314/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 159 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 159, there are 161 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~391 levels ~10000 states ~43676 transitions
pnml2lts-mc( 3/ 4): ~618 levels ~20000 states ~71000 transitions
pnml2lts-mc( 3/ 4): ~618 levels ~40000 states ~163528 transitions
pnml2lts-mc( 3/ 4): ~618 levels ~80000 states ~345284 transitions
pnml2lts-mc( 3/ 4): ~618 levels ~160000 states ~781720 transitions
pnml2lts-mc( 3/ 4): ~618 levels ~320000 states ~1617868 transitions
pnml2lts-mc( 3/ 4): ~618 levels ~640000 states ~3587568 transitions
pnml2lts-mc( 3/ 4): ~772 levels ~1280000 states ~8472696 transitions
pnml2lts-mc( 2/ 4): ~5210 levels ~2560000 states ~17466068 transitions
pnml2lts-mc( 2/ 4): ~35948 levels ~5120000 states ~34874108 transitions
pnml2lts-mc( 2/ 4): ~68140 levels ~10240000 states ~77150052 transitions
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~992!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 8259896
pnml2lts-mc( 0/ 4): unique states count: 9686999
pnml2lts-mc( 0/ 4): unique transitions count: 74590404
pnml2lts-mc( 0/ 4): - self-loop count: 3948
pnml2lts-mc( 0/ 4): - claim dead count: 56125015
pnml2lts-mc( 0/ 4): - claim found count: 8414838
pnml2lts-mc( 0/ 4): - claim success count: 9687011
pnml2lts-mc( 0/ 4): - cum. max stack depth: 261818
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 9687011 states 74590427 transitions, fanout: 7.700
pnml2lts-mc( 0/ 4): Total exploration time 39.390 sec (39.380 sec minimum, 39.388 sec on average)
pnml2lts-mc( 0/ 4): States per second: 245926, Transitions per second: 1893639
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 79.1MB, 8.5 B/state, compr.: 1.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 29.0%/7.0%
pnml2lts-mc( 0/ 4): Stored 133 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 79.1MB (~256.0MB paged-in)
ltl formula name ShieldPPPs-PT-005A-LTLCardinality-08
ltl formula formula --ltl=/tmp/1314/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 158 places, 133 transitions and 506 arcs
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1314/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1314/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1314/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1314/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 160 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 159, there are 150 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~214 levels ~10000 states ~17404 transitions
pnml2lts-mc( 1/ 4): ~336 levels ~20000 states ~41652 transitions
pnml2lts-mc( 1/ 4): ~336 levels ~40000 states ~82664 transitions
pnml2lts-mc( 1/ 4): ~336 levels ~80000 states ~170900 transitions
pnml2lts-mc( 1/ 4): ~336 levels ~160000 states ~335564 transitions
pnml2lts-mc( 1/ 4): ~336 levels ~320000 states ~740756 transitions
pnml2lts-mc( 1/ 4): ~336 levels ~640000 states ~1576252 transitions
pnml2lts-mc( 1/ 4): ~361 levels ~1280000 states ~3088668 transitions
pnml2lts-mc( 1/ 4): ~361 levels ~2560000 states ~6284464 transitions
pnml2lts-mc( 1/ 4): ~361 levels ~5120000 states ~13148980 transitions
pnml2lts-mc( 1/ 4): ~361 levels ~10240000 states ~27058976 transitions
pnml2lts-mc( 3/ 4): ~222 levels ~20480000 states ~46755372 transitions
pnml2lts-mc( 2/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 32460130
pnml2lts-mc( 0/ 4): unique states count: 33524037
pnml2lts-mc( 0/ 4): unique transitions count: 117848900
pnml2lts-mc( 0/ 4): - self-loop count: 2479
pnml2lts-mc( 0/ 4): - claim dead count: 78941677
pnml2lts-mc( 0/ 4): - claim found count: 5253941
pnml2lts-mc( 0/ 4): - claim success count: 33524052
pnml2lts-mc( 0/ 4): - cum. max stack depth: 136986
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33524052 states 117848927 transitions, fanout: 3.515
pnml2lts-mc( 0/ 4): Total exploration time 78.860 sec (78.850 sec minimum, 78.855 sec on average)
pnml2lts-mc( 0/ 4): States per second: 425108, Transitions per second: 1494407
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 260.4MB, 8.1 B/state, compr.: 1.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/6.0%
pnml2lts-mc( 0/ 4): Stored 133 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 260.4MB (~256.0MB paged-in)

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-005A"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is ShieldPPPs-PT-005A, 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 r528-tall-171683761000419"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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