About the Execution of GreatSPN+red for ShieldIIPt-PT-005B
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
445.680 | 246881.00 | 299951.00 | 653.70 | FFFTFFFFFFFFFFFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r355-tall-171683758400251.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is ShieldIIPt-PT-005B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r355-tall-171683758400251
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 19 19:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 20:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 139K Apr 12 20:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Apr 12 20:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Apr 12 20:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 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 83K 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 ShieldIIPt-PT-005B-LTLCardinality-00
FORMULA_NAME ShieldIIPt-PT-005B-LTLCardinality-01
FORMULA_NAME ShieldIIPt-PT-005B-LTLCardinality-02
FORMULA_NAME ShieldIIPt-PT-005B-LTLCardinality-03
FORMULA_NAME ShieldIIPt-PT-005B-LTLCardinality-04
FORMULA_NAME ShieldIIPt-PT-005B-LTLCardinality-05
FORMULA_NAME ShieldIIPt-PT-005B-LTLCardinality-06
FORMULA_NAME ShieldIIPt-PT-005B-LTLCardinality-07
FORMULA_NAME ShieldIIPt-PT-005B-LTLCardinality-08
FORMULA_NAME ShieldIIPt-PT-005B-LTLCardinality-09
FORMULA_NAME ShieldIIPt-PT-005B-LTLCardinality-10
FORMULA_NAME ShieldIIPt-PT-005B-LTLCardinality-11
FORMULA_NAME ShieldIIPt-PT-005B-LTLCardinality-12
FORMULA_NAME ShieldIIPt-PT-005B-LTLCardinality-13
FORMULA_NAME ShieldIIPt-PT-005B-LTLCardinality-14
FORMULA_NAME ShieldIIPt-PT-005B-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1716927729177
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-005B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 20:22:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-28 20:22:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 20:22:10] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2024-05-28 20:22:10] [INFO ] Transformed 353 places.
[2024-05-28 20:22:10] [INFO ] Transformed 328 transitions.
[2024-05-28 20:22:10] [INFO ] Found NUPN structural information;
[2024-05-28 20:22:10] [INFO ] Parsed PT model containing 353 places and 328 transitions and 816 arcs in 187 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldIIPt-PT-005B-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-005B-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-005B-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-005B-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-005B-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-005B-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-005B-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-005B-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-005B-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 out of 353 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 328/328 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 307 transition count 282
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 307 transition count 282
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 306 transition count 281
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 306 transition count 281
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 305 transition count 280
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 305 transition count 280
Applied a total of 96 rules in 90 ms. Remains 305 /353 variables (removed 48) and now considering 280/328 (removed 48) transitions.
// Phase 1: matrix 280 rows 305 cols
[2024-05-28 20:22:10] [INFO ] Computed 46 invariants in 23 ms
[2024-05-28 20:22:11] [INFO ] Implicit Places using invariants in 260 ms returned []
[2024-05-28 20:22:11] [INFO ] Invariant cache hit.
[2024-05-28 20:22:11] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 519 ms to find 0 implicit places.
Running 279 sub problems to find dead transitions.
[2024-05-28 20:22:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/304 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 1 (OVERLAPS) 1/305 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 279 unsolved
[2024-05-28 20:22:14] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 10 ms to minimize.
[2024-05-28 20:22:14] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2024-05-28 20:22:14] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-28 20:22:14] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
[2024-05-28 20:22:14] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-28 20:22:14] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-28 20:22:14] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-28 20:22:14] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-28 20:22:14] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
[2024-05-28 20:22:14] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 2 ms to minimize.
[2024-05-28 20:22:14] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-28 20:22:14] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-28 20:22:14] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 1 ms to minimize.
[2024-05-28 20:22:15] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
[2024-05-28 20:22:15] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-28 20:22:15] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 1 ms to minimize.
[2024-05-28 20:22:15] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 2 ms to minimize.
[2024-05-28 20:22:15] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-28 20:22:15] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-28 20:22:15] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 279 unsolved
[2024-05-28 20:22:16] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-28 20:22:16] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 13 ms to minimize.
[2024-05-28 20:22:16] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
[2024-05-28 20:22:16] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-28 20:22:16] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-28 20:22:16] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-28 20:22:16] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 1 ms to minimize.
[2024-05-28 20:22:16] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-28 20:22:16] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-05-28 20:22:16] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-05-28 20:22:16] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-28 20:22:16] [INFO ] Deduced a trap composed of 15 places in 19 ms of which 1 ms to minimize.
[2024-05-28 20:22:16] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-28 20:22:16] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 2 ms to minimize.
[2024-05-28 20:22:17] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 11 ms to minimize.
[2024-05-28 20:22:17] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-28 20:22:17] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-28 20:22:17] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-05-28 20:22:17] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-28 20:22:17] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 20/86 constraints. Problems are: Problem set: 0 solved, 279 unsolved
[2024-05-28 20:22:19] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-28 20:22:19] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
[2024-05-28 20:22:19] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-28 20:22:19] [INFO ] Deduced a trap composed of 27 places in 25 ms of which 1 ms to minimize.
[2024-05-28 20:22:19] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-28 20:22:19] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2024-05-28 20:22:20] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-28 20:22:20] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-28 20:22:20] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-28 20:22:20] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 10/96 constraints. Problems are: Problem set: 0 solved, 279 unsolved
[2024-05-28 20:22:21] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-05-28 20:22:21] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
[2024-05-28 20:22:21] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 3/99 constraints. Problems are: Problem set: 0 solved, 279 unsolved
[2024-05-28 20:22:22] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 8 (OVERLAPS) 280/585 variables, 305/405 constraints. Problems are: Problem set: 0 solved, 279 unsolved
[2024-05-28 20:22:26] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-28 20:22:27] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-28 20:22:28] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/585 variables, 3/408 constraints. Problems are: Problem set: 0 solved, 279 unsolved
[2024-05-28 20:22:31] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/585 variables, 1/409 constraints. Problems are: Problem set: 0 solved, 279 unsolved
[2024-05-28 20:22:33] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/585 variables, 1/410 constraints. Problems are: Problem set: 0 solved, 279 unsolved
[2024-05-28 20:22:36] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-28 20:22:36] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-05-28 20:22:36] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-28 20:22:36] [INFO ] Deduced a trap composed of 18 places in 18 ms of which 0 ms to minimize.
[2024-05-28 20:22:37] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/585 variables, 5/415 constraints. Problems are: Problem set: 0 solved, 279 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 585/585 variables, and 415 constraints, problems are : Problem set: 0 solved, 279 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 305/305 constraints, PredecessorRefiner: 279/279 constraints, Known Traps: 64/64 constraints]
Escalating to Integer solving :Problem set: 0 solved, 279 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/304 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 1 (OVERLAPS) 1/305 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 64/110 constraints. Problems are: Problem set: 0 solved, 279 unsolved
[2024-05-28 20:22:43] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 5 (OVERLAPS) 280/585 variables, 305/416 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/585 variables, 279/695 constraints. Problems are: Problem set: 0 solved, 279 unsolved
[2024-05-28 20:22:47] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 2 ms to minimize.
[2024-05-28 20:22:47] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 2 ms to minimize.
[2024-05-28 20:22:47] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 2 ms to minimize.
[2024-05-28 20:22:48] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2024-05-28 20:22:48] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2024-05-28 20:22:49] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 2 ms to minimize.
[2024-05-28 20:22:49] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 2 ms to minimize.
[2024-05-28 20:22:49] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-05-28 20:22:50] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/585 variables, 9/704 constraints. Problems are: Problem set: 0 solved, 279 unsolved
[2024-05-28 20:22:53] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 2 ms to minimize.
[2024-05-28 20:22:53] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 2 ms to minimize.
[2024-05-28 20:22:53] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 2 ms to minimize.
[2024-05-28 20:22:54] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 2 ms to minimize.
[2024-05-28 20:22:54] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 2 ms to minimize.
[2024-05-28 20:22:54] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 1 ms to minimize.
[2024-05-28 20:22:54] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 1 ms to minimize.
[2024-05-28 20:22:55] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 2 ms to minimize.
[2024-05-28 20:22:55] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 2 ms to minimize.
[2024-05-28 20:22:56] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 2 ms to minimize.
[2024-05-28 20:22:56] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 1 ms to minimize.
[2024-05-28 20:22:57] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 2 ms to minimize.
[2024-05-28 20:22:57] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/585 variables, 13/717 constraints. Problems are: Problem set: 0 solved, 279 unsolved
[2024-05-28 20:23:00] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
[2024-05-28 20:23:01] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 2 ms to minimize.
[2024-05-28 20:23:01] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/585 variables, 3/720 constraints. Problems are: Problem set: 0 solved, 279 unsolved
[2024-05-28 20:23:08] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2024-05-28 20:23:09] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 2 ms to minimize.
[2024-05-28 20:23:09] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 1 ms to minimize.
[2024-05-28 20:23:09] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 585/585 variables, and 724 constraints, problems are : Problem set: 0 solved, 279 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 305/305 constraints, PredecessorRefiner: 279/279 constraints, Known Traps: 94/94 constraints]
After SMT, in 60102ms problems are : Problem set: 0 solved, 279 unsolved
Search for dead transitions found 0 dead transitions in 60119ms
Starting structural reductions in LTL mode, iteration 1 : 305/353 places, 280/328 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60752 ms. Remains : 305/353 places, 280/328 transitions.
Support contains 19 out of 305 places after structural reductions.
[2024-05-28 20:23:11] [INFO ] Flatten gal took : 46 ms
[2024-05-28 20:23:11] [INFO ] Flatten gal took : 20 ms
[2024-05-28 20:23:11] [INFO ] Input system was already deterministic with 280 transitions.
RANDOM walk for 19371 steps (4 resets) in 426 ms. (45 steps per ms) remains 0/12 properties
Computed a total of 80 stabilizing places and 80 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||G(p1))))'
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 280/280 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 304 transition count 223
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 112 place count 248 transition count 223
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 38 Pre rules applied. Total rules applied 112 place count 248 transition count 185
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 188 place count 210 transition count 185
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 194 place count 204 transition count 179
Iterating global reduction 2 with 6 rules applied. Total rules applied 200 place count 204 transition count 179
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 200 place count 204 transition count 174
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 210 place count 199 transition count 174
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Deduced a syphon composed of 82 places in 0 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 2 with 164 rules applied. Total rules applied 374 place count 117 transition count 92
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 375 place count 117 transition count 91
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 377 place count 116 transition count 90
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 403 place count 103 transition count 96
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 405 place count 101 transition count 94
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 407 place count 99 transition count 94
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 407 place count 99 transition count 93
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 409 place count 98 transition count 93
Applied a total of 409 rules in 72 ms. Remains 98 /305 variables (removed 207) and now considering 93/280 (removed 187) transitions.
// Phase 1: matrix 93 rows 98 cols
[2024-05-28 20:23:12] [INFO ] Computed 44 invariants in 0 ms
[2024-05-28 20:23:12] [INFO ] Implicit Places using invariants in 64 ms returned [86]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 65 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 97/305 places, 93/280 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 96 transition count 92
Applied a total of 2 rules in 5 ms. Remains 96 /97 variables (removed 1) and now considering 92/93 (removed 1) transitions.
// Phase 1: matrix 92 rows 96 cols
[2024-05-28 20:23:12] [INFO ] Computed 43 invariants in 1 ms
[2024-05-28 20:23:12] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-28 20:23:12] [INFO ] Invariant cache hit.
[2024-05-28 20:23:12] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 96/305 places, 92/280 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 275 ms. Remains : 96/305 places, 92/280 transitions.
Stuttering acceptance computed with spot in 191 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-005B-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA ShieldIIPt-PT-005B-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-005B-LTLCardinality-01 finished in 532 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((G((F(p1)&&F(G(p2))))||p0))))'
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 280/280 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 297 transition count 272
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 297 transition count 272
Applied a total of 16 rules in 17 ms. Remains 297 /305 variables (removed 8) and now considering 272/280 (removed 8) transitions.
// Phase 1: matrix 272 rows 297 cols
[2024-05-28 20:23:12] [INFO ] Computed 46 invariants in 3 ms
[2024-05-28 20:23:12] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-28 20:23:12] [INFO ] Invariant cache hit.
[2024-05-28 20:23:12] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
Running 271 sub problems to find dead transitions.
[2024-05-28 20:23:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (OVERLAPS) 1/297 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 271 unsolved
[2024-05-28 20:23:15] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-28 20:23:15] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-05-28 20:23:15] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-28 20:23:15] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
[2024-05-28 20:23:15] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
[2024-05-28 20:23:15] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-28 20:23:15] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-28 20:23:16] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 2 ms to minimize.
[2024-05-28 20:23:16] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-28 20:23:16] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-28 20:23:16] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2024-05-28 20:23:16] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
[2024-05-28 20:23:16] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
[2024-05-28 20:23:16] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-28 20:23:16] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-05-28 20:23:16] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 2 ms to minimize.
[2024-05-28 20:23:16] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-28 20:23:16] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-28 20:23:16] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-05-28 20:23:16] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 271 unsolved
[2024-05-28 20:23:17] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-28 20:23:17] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-28 20:23:17] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-28 20:23:17] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-28 20:23:17] [INFO ] Deduced a trap composed of 21 places in 21 ms of which 0 ms to minimize.
[2024-05-28 20:23:17] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-28 20:23:17] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-05-28 20:23:17] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-28 20:23:17] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-28 20:23:17] [INFO ] Deduced a trap composed of 15 places in 19 ms of which 1 ms to minimize.
[2024-05-28 20:23:17] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 0 ms to minimize.
[2024-05-28 20:23:18] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 0 ms to minimize.
[2024-05-28 20:23:18] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2024-05-28 20:23:18] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-05-28 20:23:18] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
[2024-05-28 20:23:18] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-28 20:23:18] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
[2024-05-28 20:23:18] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-28 20:23:18] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-28 20:23:18] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 20/86 constraints. Problems are: Problem set: 0 solved, 271 unsolved
[2024-05-28 20:23:20] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
[2024-05-28 20:23:20] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-28 20:23:20] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-28 20:23:21] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-28 20:23:21] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 6 (OVERLAPS) 272/569 variables, 297/388 constraints. Problems are: Problem set: 0 solved, 271 unsolved
[2024-05-28 20:23:25] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/569 variables, 1/389 constraints. Problems are: Problem set: 0 solved, 271 unsolved
[2024-05-28 20:23:27] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-28 20:23:28] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-05-28 20:23:29] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/569 variables, 3/392 constraints. Problems are: Problem set: 0 solved, 271 unsolved
[2024-05-28 20:23:29] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-28 20:23:30] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-28 20:23:30] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
[2024-05-28 20:23:30] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 0 ms to minimize.
[2024-05-28 20:23:30] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-05-28 20:23:31] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2024-05-28 20:23:31] [INFO ] Deduced a trap composed of 24 places in 23 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/569 variables, 7/399 constraints. Problems are: Problem set: 0 solved, 271 unsolved
[2024-05-28 20:23:34] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/569 variables, 1/400 constraints. Problems are: Problem set: 0 solved, 271 unsolved
[2024-05-28 20:23:36] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-05-28 20:23:36] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 1 ms to minimize.
[2024-05-28 20:23:36] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/569 variables, 3/403 constraints. Problems are: Problem set: 0 solved, 271 unsolved
[2024-05-28 20:23:39] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/569 variables, 1/404 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 569/569 variables, and 404 constraints, problems are : Problem set: 0 solved, 271 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 297/297 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 61/61 constraints]
Escalating to Integer solving :Problem set: 0 solved, 271 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (OVERLAPS) 1/297 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 61/107 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 4 (OVERLAPS) 272/569 variables, 297/404 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/569 variables, 271/675 constraints. Problems are: Problem set: 0 solved, 271 unsolved
[2024-05-28 20:23:47] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2024-05-28 20:23:47] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 2 ms to minimize.
[2024-05-28 20:23:47] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 2 ms to minimize.
[2024-05-28 20:23:47] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 2 ms to minimize.
[2024-05-28 20:23:48] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 1 ms to minimize.
[2024-05-28 20:23:48] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 2 ms to minimize.
[2024-05-28 20:23:48] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 2 ms to minimize.
[2024-05-28 20:23:48] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 2 ms to minimize.
[2024-05-28 20:23:49] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 2 ms to minimize.
[2024-05-28 20:23:49] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-05-28 20:23:49] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 1 ms to minimize.
[2024-05-28 20:23:50] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 2 ms to minimize.
[2024-05-28 20:23:50] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 2 ms to minimize.
[2024-05-28 20:23:50] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
[2024-05-28 20:23:50] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 2 ms to minimize.
[2024-05-28 20:23:50] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 2 ms to minimize.
[2024-05-28 20:23:51] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-28 20:23:51] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-28 20:23:52] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/569 variables, 19/694 constraints. Problems are: Problem set: 0 solved, 271 unsolved
[2024-05-28 20:23:54] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 2 ms to minimize.
[2024-05-28 20:23:55] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-28 20:23:55] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 2 ms to minimize.
[2024-05-28 20:23:56] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/569 variables, 4/698 constraints. Problems are: Problem set: 0 solved, 271 unsolved
[2024-05-28 20:24:00] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 2 ms to minimize.
[2024-05-28 20:24:00] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 1 ms to minimize.
[2024-05-28 20:24:00] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 1 ms to minimize.
[2024-05-28 20:24:01] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 2 ms to minimize.
[2024-05-28 20:24:01] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/569 variables, 5/703 constraints. Problems are: Problem set: 0 solved, 271 unsolved
[2024-05-28 20:24:06] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
[2024-05-28 20:24:07] [INFO ] Deduced a trap composed of 21 places in 96 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/569 variables, 2/705 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 569/569 variables, and 705 constraints, problems are : Problem set: 0 solved, 271 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 297/297 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 91/91 constraints]
After SMT, in 60064ms problems are : Problem set: 0 solved, 271 unsolved
Search for dead transitions found 0 dead transitions in 60071ms
Starting structural reductions in LTL mode, iteration 1 : 297/305 places, 272/280 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60375 ms. Remains : 297/305 places, 272/280 transitions.
Stuttering acceptance computed with spot in 219 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldIIPt-PT-005B-LTLCardinality-03
Product exploration explored 100000 steps with 50000 reset in 274 ms.
Product exploration explored 100000 steps with 50000 reset in 159 ms.
Computed a total of 78 stabilizing places and 78 stable transitions
Computed a total of 78 stabilizing places and 78 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 23 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-005B-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-005B-LTLCardinality-03 finished in 61091 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||F((p1&&F(p0)))))'
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 280/280 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 297 transition count 272
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 297 transition count 272
Applied a total of 16 rules in 12 ms. Remains 297 /305 variables (removed 8) and now considering 272/280 (removed 8) transitions.
// Phase 1: matrix 272 rows 297 cols
[2024-05-28 20:24:13] [INFO ] Computed 46 invariants in 2 ms
[2024-05-28 20:24:13] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-28 20:24:13] [INFO ] Invariant cache hit.
[2024-05-28 20:24:13] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
Running 271 sub problems to find dead transitions.
[2024-05-28 20:24:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (OVERLAPS) 1/297 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 271 unsolved
[2024-05-28 20:24:16] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2024-05-28 20:24:16] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-05-28 20:24:16] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
[2024-05-28 20:24:16] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 0 ms to minimize.
[2024-05-28 20:24:16] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
[2024-05-28 20:24:16] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-28 20:24:16] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-28 20:24:17] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 2 ms to minimize.
[2024-05-28 20:24:17] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-28 20:24:17] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-28 20:24:17] [INFO ] Deduced a trap composed of 13 places in 17 ms of which 1 ms to minimize.
[2024-05-28 20:24:17] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 0 ms to minimize.
[2024-05-28 20:24:17] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-28 20:24:17] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-28 20:24:17] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 2 ms to minimize.
[2024-05-28 20:24:17] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-28 20:24:17] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-28 20:24:17] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-05-28 20:24:17] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 0 ms to minimize.
[2024-05-28 20:24:17] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 271 unsolved
[2024-05-28 20:24:18] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-28 20:24:18] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-28 20:24:18] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-28 20:24:18] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-28 20:24:18] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-05-28 20:24:18] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-28 20:24:18] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-28 20:24:18] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 0 ms to minimize.
[2024-05-28 20:24:18] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 0 ms to minimize.
[2024-05-28 20:24:19] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-28 20:24:19] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
[2024-05-28 20:24:19] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-28 20:24:19] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-28 20:24:19] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-05-28 20:24:19] [INFO ] Deduced a trap composed of 16 places in 18 ms of which 1 ms to minimize.
[2024-05-28 20:24:19] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-28 20:24:19] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 17/83 constraints. Problems are: Problem set: 0 solved, 271 unsolved
[2024-05-28 20:24:21] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-28 20:24:21] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-28 20:24:22] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 3/86 constraints. Problems are: Problem set: 0 solved, 271 unsolved
[2024-05-28 20:24:23] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 271 unsolved
[2024-05-28 20:24:24] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 271 unsolved
[2024-05-28 20:24:27] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/297 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/297 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 9 (OVERLAPS) 272/569 variables, 297/386 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/569 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 271 unsolved
[2024-05-28 20:24:35] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/569 variables, 1/387 constraints. Problems are: Problem set: 0 solved, 271 unsolved
[2024-05-28 20:24:37] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-28 20:24:37] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-28 20:24:37] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-28 20:24:37] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/569 variables, 4/391 constraints. Problems are: Problem set: 0 solved, 271 unsolved
[2024-05-28 20:24:40] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/569 variables, 1/392 constraints. Problems are: Problem set: 0 solved, 271 unsolved
[2024-05-28 20:24:43] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 569/569 variables, and 393 constraints, problems are : Problem set: 0 solved, 271 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 297/297 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 50/50 constraints]
Escalating to Integer solving :Problem set: 0 solved, 271 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (OVERLAPS) 1/297 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 50/96 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 4 (OVERLAPS) 272/569 variables, 297/393 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/569 variables, 271/664 constraints. Problems are: Problem set: 0 solved, 271 unsolved
[2024-05-28 20:24:48] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 2 ms to minimize.
[2024-05-28 20:24:48] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2024-05-28 20:24:48] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 2 ms to minimize.
[2024-05-28 20:24:48] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 2 ms to minimize.
[2024-05-28 20:24:49] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 2 ms to minimize.
[2024-05-28 20:24:49] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 2 ms to minimize.
[2024-05-28 20:24:49] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-05-28 20:24:49] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 2 ms to minimize.
[2024-05-28 20:24:49] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 1 ms to minimize.
[2024-05-28 20:24:50] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 2 ms to minimize.
[2024-05-28 20:24:50] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 2 ms to minimize.
[2024-05-28 20:24:50] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 2 ms to minimize.
[2024-05-28 20:24:50] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2024-05-28 20:24:50] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 2 ms to minimize.
[2024-05-28 20:24:51] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2024-05-28 20:24:51] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2024-05-28 20:24:51] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 2 ms to minimize.
[2024-05-28 20:24:52] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/569 variables, 18/682 constraints. Problems are: Problem set: 0 solved, 271 unsolved
[2024-05-28 20:24:54] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 2 ms to minimize.
[2024-05-28 20:24:55] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 2 ms to minimize.
[2024-05-28 20:24:55] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 5 ms to minimize.
[2024-05-28 20:24:55] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-05-28 20:24:56] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 2 ms to minimize.
[2024-05-28 20:24:56] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2024-05-28 20:24:57] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-28 20:24:58] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 2 ms to minimize.
[2024-05-28 20:24:58] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 2 ms to minimize.
[2024-05-28 20:24:58] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/569 variables, 10/692 constraints. Problems are: Problem set: 0 solved, 271 unsolved
[2024-05-28 20:25:02] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2024-05-28 20:25:02] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 2 ms to minimize.
[2024-05-28 20:25:04] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 2 ms to minimize.
[2024-05-28 20:25:05] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-28 20:25:05] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/569 variables, 5/697 constraints. Problems are: Problem set: 0 solved, 271 unsolved
[2024-05-28 20:25:09] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2024-05-28 20:25:10] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 2 ms to minimize.
[2024-05-28 20:25:12] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/569 variables, 3/700 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 569/569 variables, and 700 constraints, problems are : Problem set: 0 solved, 271 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 297/297 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 86/86 constraints]
After SMT, in 60052ms problems are : Problem set: 0 solved, 271 unsolved
Search for dead transitions found 0 dead transitions in 60056ms
Starting structural reductions in LTL mode, iteration 1 : 297/305 places, 272/280 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60310 ms. Remains : 297/305 places, 272/280 transitions.
Stuttering acceptance computed with spot in 171 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-005B-LTLCardinality-04
Product exploration explored 100000 steps with 170 reset in 175 ms.
Stack based approach found an accepted trace after 341 steps with 1 reset with depth 112 and stack size 112 in 1 ms.
FORMULA ShieldIIPt-PT-005B-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-005B-LTLCardinality-04 finished in 60678 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 280/280 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 304 transition count 225
Reduce places removed 54 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 55 rules applied. Total rules applied 109 place count 250 transition count 224
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 110 place count 249 transition count 224
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 38 Pre rules applied. Total rules applied 110 place count 249 transition count 186
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 186 place count 211 transition count 186
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 193 place count 204 transition count 179
Iterating global reduction 3 with 7 rules applied. Total rules applied 200 place count 204 transition count 179
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 200 place count 204 transition count 172
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 214 place count 197 transition count 172
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: 81
Deduced a syphon composed of 81 places in 0 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 3 with 162 rules applied. Total rules applied 376 place count 116 transition count 91
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 377 place count 116 transition count 90
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 379 place count 115 transition count 89
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 407 place count 101 transition count 98
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 409 place count 99 transition count 96
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 411 place count 97 transition count 96
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 411 place count 97 transition count 95
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 413 place count 96 transition count 95
Applied a total of 413 rules in 38 ms. Remains 96 /305 variables (removed 209) and now considering 95/280 (removed 185) transitions.
// Phase 1: matrix 95 rows 96 cols
[2024-05-28 20:25:14] [INFO ] Computed 44 invariants in 3 ms
[2024-05-28 20:25:14] [INFO ] Implicit Places using invariants in 62 ms returned [85]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 64 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 95/305 places, 95/280 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 94 transition count 94
Applied a total of 2 rules in 4 ms. Remains 94 /95 variables (removed 1) and now considering 94/95 (removed 1) transitions.
// Phase 1: matrix 94 rows 94 cols
[2024-05-28 20:25:14] [INFO ] Computed 43 invariants in 0 ms
[2024-05-28 20:25:14] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-28 20:25:14] [INFO ] Invariant cache hit.
[2024-05-28 20:25:14] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-28 20:25:14] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 94/305 places, 94/280 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 240 ms. Remains : 94/305 places, 94/280 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-005B-LTLCardinality-07
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-005B-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-005B-LTLCardinality-07 finished in 331 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 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 280/280 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 57 place count 304 transition count 222
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 1 with 57 rules applied. Total rules applied 114 place count 247 transition count 222
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 114 place count 247 transition count 185
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 188 place count 210 transition count 185
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 196 place count 202 transition count 177
Iterating global reduction 2 with 8 rules applied. Total rules applied 204 place count 202 transition count 177
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 204 place count 202 transition count 170
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 218 place count 195 transition count 170
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: 81
Deduced a syphon composed of 81 places in 0 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 2 with 162 rules applied. Total rules applied 380 place count 114 transition count 89
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 381 place count 114 transition count 88
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 383 place count 113 transition count 87
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 411 place count 99 transition count 96
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 413 place count 97 transition count 94
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 415 place count 95 transition count 94
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 415 place count 95 transition count 93
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 417 place count 94 transition count 93
Applied a total of 417 rules in 37 ms. Remains 94 /305 variables (removed 211) and now considering 93/280 (removed 187) transitions.
// Phase 1: matrix 93 rows 94 cols
[2024-05-28 20:25:14] [INFO ] Computed 44 invariants in 0 ms
[2024-05-28 20:25:14] [INFO ] Implicit Places using invariants in 67 ms returned [83]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 69 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 93/305 places, 93/280 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 92 transition count 92
Applied a total of 2 rules in 4 ms. Remains 92 /93 variables (removed 1) and now considering 92/93 (removed 1) transitions.
// Phase 1: matrix 92 rows 92 cols
[2024-05-28 20:25:14] [INFO ] Computed 43 invariants in 1 ms
[2024-05-28 20:25:14] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-28 20:25:14] [INFO ] Invariant cache hit.
[2024-05-28 20:25:14] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 92/305 places, 92/280 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 252 ms. Remains : 92/305 places, 92/280 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-005B-LTLCardinality-09
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-005B-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-005B-LTLCardinality-09 finished in 300 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((F(p1)&&p0))))'
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 280/280 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 298 transition count 273
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 298 transition count 273
Applied a total of 14 rules in 6 ms. Remains 298 /305 variables (removed 7) and now considering 273/280 (removed 7) transitions.
// Phase 1: matrix 273 rows 298 cols
[2024-05-28 20:25:15] [INFO ] Computed 46 invariants in 4 ms
[2024-05-28 20:25:15] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-28 20:25:15] [INFO ] Invariant cache hit.
[2024-05-28 20:25:15] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
Running 272 sub problems to find dead transitions.
[2024-05-28 20:25:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (OVERLAPS) 1/298 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 272 unsolved
[2024-05-28 20:25:17] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2024-05-28 20:25:17] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-05-28 20:25:17] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-05-28 20:25:17] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 0 ms to minimize.
[2024-05-28 20:25:17] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-05-28 20:25:18] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-05-28 20:25:18] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-28 20:25:18] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 2 ms to minimize.
[2024-05-28 20:25:18] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-28 20:25:18] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-05-28 20:25:18] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 1 ms to minimize.
[2024-05-28 20:25:18] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-05-28 20:25:18] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2024-05-28 20:25:18] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2024-05-28 20:25:18] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2024-05-28 20:25:18] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2024-05-28 20:25:18] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
[2024-05-28 20:25:19] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-28 20:25:19] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-05-28 20:25:19] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/298 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 272 unsolved
[2024-05-28 20:25:19] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-28 20:25:19] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-05-28 20:25:19] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-28 20:25:19] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-28 20:25:20] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-05-28 20:25:20] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-28 20:25:20] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-28 20:25:20] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
[2024-05-28 20:25:20] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-28 20:25:20] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 0 ms to minimize.
[2024-05-28 20:25:20] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-28 20:25:20] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-28 20:25:20] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-28 20:25:20] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-28 20:25:20] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-28 20:25:20] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 0 ms to minimize.
[2024-05-28 20:25:20] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-28 20:25:20] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/298 variables, 18/84 constraints. Problems are: Problem set: 0 solved, 272 unsolved
[2024-05-28 20:25:23] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-05-28 20:25:23] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/298 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 272 unsolved
[2024-05-28 20:25:25] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/298 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 272 unsolved
[2024-05-28 20:25:26] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2024-05-28 20:25:26] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/298 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 8 (OVERLAPS) 273/571 variables, 298/387 constraints. Problems are: Problem set: 0 solved, 272 unsolved
[2024-05-28 20:25:31] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/571 variables, 1/388 constraints. Problems are: Problem set: 0 solved, 272 unsolved
[2024-05-28 20:25:35] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-28 20:25:35] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 0 ms to minimize.
[2024-05-28 20:25:35] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
[2024-05-28 20:25:35] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-05-28 20:25:35] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/571 variables, 5/393 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/571 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 272 unsolved
[2024-05-28 20:25:39] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/571 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 272 unsolved
[2024-05-28 20:25:44] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-28 20:25:44] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/571 variables, 2/396 constraints. Problems are: Problem set: 0 solved, 272 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 571/571 variables, and 396 constraints, problems are : Problem set: 0 solved, 272 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 298/298 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 52/52 constraints]
Escalating to Integer solving :Problem set: 0 solved, 272 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (OVERLAPS) 1/298 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/298 variables, 52/98 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/298 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 4 (OVERLAPS) 273/571 variables, 298/396 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/571 variables, 272/668 constraints. Problems are: Problem set: 0 solved, 272 unsolved
[2024-05-28 20:25:49] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 2 ms to minimize.
[2024-05-28 20:25:49] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 2 ms to minimize.
[2024-05-28 20:25:50] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2024-05-28 20:25:50] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 2 ms to minimize.
[2024-05-28 20:25:50] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 2 ms to minimize.
[2024-05-28 20:25:50] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
[2024-05-28 20:25:50] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-05-28 20:25:51] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 2 ms to minimize.
[2024-05-28 20:25:51] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2024-05-28 20:25:52] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 2 ms to minimize.
[2024-05-28 20:25:52] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 2 ms to minimize.
[2024-05-28 20:25:52] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-05-28 20:25:53] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 1 ms to minimize.
[2024-05-28 20:25:53] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/571 variables, 14/682 constraints. Problems are: Problem set: 0 solved, 272 unsolved
[2024-05-28 20:25:56] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 1 ms to minimize.
[2024-05-28 20:25:56] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 2 ms to minimize.
[2024-05-28 20:25:56] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 2 ms to minimize.
[2024-05-28 20:25:56] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 2 ms to minimize.
[2024-05-28 20:25:57] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 1 ms to minimize.
[2024-05-28 20:25:59] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 2 ms to minimize.
[2024-05-28 20:25:59] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/571 variables, 7/689 constraints. Problems are: Problem set: 0 solved, 272 unsolved
[2024-05-28 20:26:02] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 2 ms to minimize.
[2024-05-28 20:26:03] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 2 ms to minimize.
[2024-05-28 20:26:04] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
[2024-05-28 20:26:04] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 1 ms to minimize.
[2024-05-28 20:26:04] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/571 variables, 5/694 constraints. Problems are: Problem set: 0 solved, 272 unsolved
[2024-05-28 20:26:08] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 2 ms to minimize.
[2024-05-28 20:26:11] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/571 variables, 2/696 constraints. Problems are: Problem set: 0 solved, 272 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 571/571 variables, and 696 constraints, problems are : Problem set: 0 solved, 272 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 298/298 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 80/80 constraints]
After SMT, in 60051ms problems are : Problem set: 0 solved, 272 unsolved
Search for dead transitions found 0 dead transitions in 60054ms
Starting structural reductions in LTL mode, iteration 1 : 298/305 places, 273/280 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60329 ms. Remains : 298/305 places, 273/280 transitions.
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-005B-LTLCardinality-10
Product exploration explored 100000 steps with 462 reset in 179 ms.
Stack based approach found an accepted trace after 770 steps with 3 reset with depth 242 and stack size 242 in 3 ms.
FORMULA ShieldIIPt-PT-005B-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-005B-LTLCardinality-10 finished in 60659 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 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 280/280 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 57 place count 304 transition count 222
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 1 with 57 rules applied. Total rules applied 114 place count 247 transition count 222
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 38 Pre rules applied. Total rules applied 114 place count 247 transition count 184
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 190 place count 209 transition count 184
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 197 place count 202 transition count 177
Iterating global reduction 2 with 7 rules applied. Total rules applied 204 place count 202 transition count 177
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 204 place count 202 transition count 171
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 216 place count 196 transition count 171
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 166 rules applied. Total rules applied 382 place count 113 transition count 88
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 383 place count 113 transition count 87
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 385 place count 112 transition count 86
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 413 place count 98 transition count 95
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 415 place count 96 transition count 93
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 417 place count 94 transition count 93
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 417 place count 94 transition count 92
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 419 place count 93 transition count 92
Applied a total of 419 rules in 33 ms. Remains 93 /305 variables (removed 212) and now considering 92/280 (removed 188) transitions.
// Phase 1: matrix 92 rows 93 cols
[2024-05-28 20:26:15] [INFO ] Computed 44 invariants in 1 ms
[2024-05-28 20:26:15] [INFO ] Implicit Places using invariants in 55 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 56 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 92/305 places, 92/280 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 91 transition count 91
Applied a total of 2 rules in 4 ms. Remains 91 /92 variables (removed 1) and now considering 91/92 (removed 1) transitions.
// Phase 1: matrix 91 rows 91 cols
[2024-05-28 20:26:15] [INFO ] Computed 43 invariants in 0 ms
[2024-05-28 20:26:15] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-28 20:26:15] [INFO ] Invariant cache hit.
[2024-05-28 20:26:15] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 91/305 places, 91/280 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 225 ms. Remains : 91/305 places, 91/280 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-005B-LTLCardinality-13
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-005B-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-005B-LTLCardinality-13 finished in 274 ms.
All properties solved by simple procedures.
Total runtime 245628 ms.
ITS solved all properties within timeout
BK_STOP 1716927976058
--------------------
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
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="ShieldIIPt-PT-005B"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is ShieldIIPt-PT-005B, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r355-tall-171683758400251"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-005B.tgz
mv ShieldIIPt-PT-005B execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;