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

About the Execution of ITS-Tools for ShieldRVs-PT-003A

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
386.048 33966.00 51210.00 172.90 TFTTTTFFFTFFFTFF normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r356-tall-171683761700739.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is ShieldRVs-PT-003A, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683761700739
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 432K
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K Apr 12 17:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Apr 12 17:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 12 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 12 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 19K 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 ShieldRVs-PT-003A-LTLCardinality-00
FORMULA_NAME ShieldRVs-PT-003A-LTLCardinality-01
FORMULA_NAME ShieldRVs-PT-003A-LTLCardinality-02
FORMULA_NAME ShieldRVs-PT-003A-LTLCardinality-03
FORMULA_NAME ShieldRVs-PT-003A-LTLCardinality-04
FORMULA_NAME ShieldRVs-PT-003A-LTLCardinality-05
FORMULA_NAME ShieldRVs-PT-003A-LTLCardinality-06
FORMULA_NAME ShieldRVs-PT-003A-LTLCardinality-07
FORMULA_NAME ShieldRVs-PT-003A-LTLCardinality-08
FORMULA_NAME ShieldRVs-PT-003A-LTLCardinality-09
FORMULA_NAME ShieldRVs-PT-003A-LTLCardinality-10
FORMULA_NAME ShieldRVs-PT-003A-LTLCardinality-11
FORMULA_NAME ShieldRVs-PT-003A-LTLCardinality-12
FORMULA_NAME ShieldRVs-PT-003A-LTLCardinality-13
FORMULA_NAME ShieldRVs-PT-003A-LTLCardinality-14
FORMULA_NAME ShieldRVs-PT-003A-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717032956131

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-003A
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-30 01:35:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-30 01:35:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 01:35:57] [INFO ] Load time of PNML (sax parser for PT used): 48 ms
[2024-05-30 01:35:57] [INFO ] Transformed 45 places.
[2024-05-30 01:35:57] [INFO ] Transformed 60 transitions.
[2024-05-30 01:35:57] [INFO ] Found NUPN structural information;
[2024-05-30 01:35:57] [INFO ] Parsed PT model containing 45 places and 60 transitions and 276 arcs in 142 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ShieldRVs-PT-003A-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-003A-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-003A-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-003A-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA ShieldRVs-PT-003A-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-003A-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-003A-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-003A-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-003A-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 15 out of 45 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 60/60 transitions.
Applied a total of 0 rules in 10 ms. Remains 45 /45 variables (removed 0) and now considering 60/60 (removed 0) transitions.
// Phase 1: matrix 60 rows 45 cols
[2024-05-30 01:35:57] [INFO ] Computed 13 invariants in 5 ms
[2024-05-30 01:35:57] [INFO ] Implicit Places using invariants in 157 ms returned []
[2024-05-30 01:35:57] [INFO ] Invariant cache hit.
[2024-05-30 01:35:57] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
Running 59 sub problems to find dead transitions.
[2024-05-30 01:35:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 1/45 variables, 13/57 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:35:58] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 8 ms to minimize.
[2024-05-30 01:35:58] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 1 ms to minimize.
[2024-05-30 01:35:58] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 2 ms to minimize.
[2024-05-30 01:35:58] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-05-30 01:35:58] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:35:58] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 1 ms to minimize.
[2024-05-30 01:35:58] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:35:58] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:35:58] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-05-30 01:35:58] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 1 ms to minimize.
[2024-05-30 01:35:58] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 11/69 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:35:58] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-05-30 01:35:58] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:35:58] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:35:58] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:35:58] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 5/74 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/45 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (OVERLAPS) 60/105 variables, 45/119 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:35:59] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:35:59] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:35:59] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2024-05-30 01:35:59] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/105 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/105 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 11 (OVERLAPS) 0/105 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 105/105 variables, and 123 constraints, problems are : Problem set: 0 solved, 59 unsolved in 2028 ms.
Refiners :[Domain max(s): 45/45 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 45/45 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 1/45 variables, 13/57 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (OVERLAPS) 60/105 variables, 45/123 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 59/182 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:36:00] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/105 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (OVERLAPS) 0/105 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 105/105 variables, and 183 constraints, problems are : Problem set: 0 solved, 59 unsolved in 1791 ms.
Refiners :[Domain max(s): 45/45 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 45/45 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 21/21 constraints]
After SMT, in 3873ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 3887ms
Finished structural reductions in LTL mode , in 1 iterations and 4189 ms. Remains : 45/45 places, 60/60 transitions.
Support contains 15 out of 45 places after structural reductions.
[2024-05-30 01:36:01] [INFO ] Flatten gal took : 25 ms
[2024-05-30 01:36:01] [INFO ] Flatten gal took : 11 ms
[2024-05-30 01:36:01] [INFO ] Input system was already deterministic with 60 transitions.
Reduction of identical properties reduced properties to check from 12 to 11
RANDOM walk for 137 steps (0 resets) in 18 ms. (7 steps per ms) remains 0/11 properties
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(p1)))'
Support contains 3 out of 45 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 60/60 transitions.
Applied a total of 0 rules in 1 ms. Remains 45 /45 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2024-05-30 01:36:02] [INFO ] Invariant cache hit.
[2024-05-30 01:36:02] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-30 01:36:02] [INFO ] Invariant cache hit.
[2024-05-30 01:36:02] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
Running 59 sub problems to find dead transitions.
[2024-05-30 01:36:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 1/45 variables, 13/57 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:36:02] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 1 ms to minimize.
[2024-05-30 01:36:02] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 0 ms to minimize.
[2024-05-30 01:36:02] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
[2024-05-30 01:36:02] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-30 01:36:02] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 1 ms to minimize.
[2024-05-30 01:36:02] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 0 ms to minimize.
[2024-05-30 01:36:02] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:36:02] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:36:03] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:36:03] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 0 ms to minimize.
[2024-05-30 01:36:03] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 11/69 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:36:03] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:36:03] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 5 ms to minimize.
[2024-05-30 01:36:03] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 16 ms to minimize.
[2024-05-30 01:36:03] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:36:03] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 5/74 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/45 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (OVERLAPS) 60/105 variables, 45/119 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:36:03] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:36:03] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:36:03] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2024-05-30 01:36:03] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/105 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/105 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 11 (OVERLAPS) 0/105 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 105/105 variables, and 123 constraints, problems are : Problem set: 0 solved, 59 unsolved in 1841 ms.
Refiners :[Domain max(s): 45/45 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 45/45 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 1/45 variables, 13/57 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (OVERLAPS) 60/105 variables, 45/123 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 59/182 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:36:04] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/105 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (OVERLAPS) 0/105 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 105/105 variables, and 183 constraints, problems are : Problem set: 0 solved, 59 unsolved in 1410 ms.
Refiners :[Domain max(s): 45/45 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 45/45 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 21/21 constraints]
After SMT, in 3278ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 3280ms
Finished structural reductions in LTL mode , in 1 iterations and 3371 ms. Remains : 45/45 places, 60/60 transitions.
Stuttering acceptance computed with spot in 270 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-003A-LTLCardinality-00
Product exploration explored 100000 steps with 50000 reset in 306 ms.
Product exploration explored 100000 steps with 50000 reset in 146 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 21 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVs-PT-003A-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVs-PT-003A-LTLCardinality-00 finished in 4178 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 45 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 45/45 places, 60/60 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 44 transition count 59
Applied a total of 2 rules in 24 ms. Remains 44 /45 variables (removed 1) and now considering 59/60 (removed 1) transitions.
// Phase 1: matrix 59 rows 44 cols
[2024-05-30 01:36:06] [INFO ] Computed 13 invariants in 1 ms
[2024-05-30 01:36:06] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-30 01:36:06] [INFO ] Invariant cache hit.
[2024-05-30 01:36:06] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
[2024-05-30 01:36:06] [INFO ] Redundant transitions in 22 ms returned [18]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 57 sub problems to find dead transitions.
// Phase 1: matrix 58 rows 44 cols
[2024-05-30 01:36:06] [INFO ] Computed 13 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 1/44 variables, 13/56 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-30 01:36:06] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 0 ms to minimize.
[2024-05-30 01:36:06] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 1 ms to minimize.
[2024-05-30 01:36:06] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 1 ms to minimize.
[2024-05-30 01:36:06] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-30 01:36:07] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:36:07] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:36:07] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:36:07] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:36:07] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:36:07] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:36:07] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2024-05-30 01:36:07] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-30 01:36:07] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
[2024-05-30 01:36:07] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (OVERLAPS) 58/102 variables, 44/115 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-30 01:36:07] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:36:07] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:36:07] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 2 ms to minimize.
[2024-05-30 01:36:07] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2024-05-30 01:36:07] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-05-30 01:36:07] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:36:07] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 7/122 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-30 01:36:07] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-30 01:36:08] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
[2024-05-30 01:36:08] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:36:08] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/102 variables, 3/126 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/102 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-30 01:36:08] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/102 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/102 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-30 01:36:08] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:36:08] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:36:08] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:36:08] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 1 ms to minimize.
[2024-05-30 01:36:08] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 0 ms to minimize.
[2024-05-30 01:36:08] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/102 variables, 6/133 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-30 01:36:09] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2024-05-30 01:36:09] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/102 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/102 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 17 (OVERLAPS) 0/102 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 102/102 variables, and 135 constraints, problems are : Problem set: 0 solved, 57 unsolved in 2902 ms.
Refiners :[Domain max(s): 44/44 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 44/44 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 57 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 1/44 variables, 13/56 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 34/91 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-30 01:36:09] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:36:09] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:36:09] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:36:09] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (OVERLAPS) 58/102 variables, 44/139 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 57/196 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 10 (OVERLAPS) 0/102 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Int declared 102/102 variables, and 196 constraints, problems are : Problem set: 0 solved, 57 unsolved in 1347 ms.
Refiners :[Domain max(s): 44/44 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 44/44 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 38/38 constraints]
After SMT, in 4264ms problems are : Problem set: 0 solved, 57 unsolved
Search for dead transitions found 0 dead transitions in 4265ms
Starting structural reductions in SI_LTL mode, iteration 1 : 44/45 places, 58/60 transitions.
Applied a total of 0 rules in 3 ms. Remains 44 /44 variables (removed 0) and now considering 58/58 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4486 ms. Remains : 44/45 places, 58/60 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVs-PT-003A-LTLCardinality-02
Product exploration explored 100000 steps with 50000 reset in 136 ms.
Product exploration explored 100000 steps with 50000 reset in 143 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 13 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVs-PT-003A-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVs-PT-003A-LTLCardinality-02 finished in 4826 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((X(F(p0))&&(X(p0)||p1)))))'
Support contains 2 out of 45 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 60/60 transitions.
Applied a total of 0 rules in 1 ms. Remains 45 /45 variables (removed 0) and now considering 60/60 (removed 0) transitions.
// Phase 1: matrix 60 rows 45 cols
[2024-05-30 01:36:11] [INFO ] Computed 13 invariants in 0 ms
[2024-05-30 01:36:11] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-30 01:36:11] [INFO ] Invariant cache hit.
[2024-05-30 01:36:11] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
Running 59 sub problems to find dead transitions.
[2024-05-30 01:36:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 1/45 variables, 13/57 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:36:11] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 0 ms to minimize.
[2024-05-30 01:36:11] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:36:11] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
[2024-05-30 01:36:11] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:36:11] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:36:11] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 1 ms to minimize.
[2024-05-30 01:36:11] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:36:11] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:36:11] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:36:11] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 0 ms to minimize.
[2024-05-30 01:36:11] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 11/69 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:36:12] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:36:12] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:36:12] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:36:12] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:36:12] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 5/74 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/45 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (OVERLAPS) 60/105 variables, 45/119 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:36:12] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:36:12] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:36:12] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
[2024-05-30 01:36:12] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/105 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/105 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 11 (OVERLAPS) 0/105 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 105/105 variables, and 123 constraints, problems are : Problem set: 0 solved, 59 unsolved in 1658 ms.
Refiners :[Domain max(s): 45/45 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 45/45 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 1/45 variables, 13/57 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (OVERLAPS) 60/105 variables, 45/123 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 59/182 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:36:13] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/105 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (OVERLAPS) 0/105 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 105/105 variables, and 183 constraints, problems are : Problem set: 0 solved, 59 unsolved in 1382 ms.
Refiners :[Domain max(s): 45/45 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 45/45 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 21/21 constraints]
After SMT, in 3055ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 3057ms
Finished structural reductions in LTL mode , in 1 iterations and 3154 ms. Remains : 45/45 places, 60/60 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-003A-LTLCardinality-03
Product exploration explored 100000 steps with 33333 reset in 95 ms.
Product exploration explored 100000 steps with 33333 reset in 95 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 24 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVs-PT-003A-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVs-PT-003A-LTLCardinality-03 finished in 3496 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 45 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 45/45 places, 60/60 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 44 transition count 59
Applied a total of 2 rules in 12 ms. Remains 44 /45 variables (removed 1) and now considering 59/60 (removed 1) transitions.
// Phase 1: matrix 59 rows 44 cols
[2024-05-30 01:36:14] [INFO ] Computed 13 invariants in 1 ms
[2024-05-30 01:36:14] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-30 01:36:14] [INFO ] Invariant cache hit.
[2024-05-30 01:36:14] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2024-05-30 01:36:14] [INFO ] Redundant transitions in 21 ms returned [18]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 57 sub problems to find dead transitions.
// Phase 1: matrix 58 rows 44 cols
[2024-05-30 01:36:14] [INFO ] Computed 13 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 1/44 variables, 13/56 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-30 01:36:15] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:36:15] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:36:15] [INFO ] Deduced a trap composed of 7 places in 14 ms of which 0 ms to minimize.
[2024-05-30 01:36:15] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:36:15] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:36:15] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
[2024-05-30 01:36:15] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 0 ms to minimize.
[2024-05-30 01:36:15] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:36:15] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:36:15] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:36:15] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
[2024-05-30 01:36:15] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-30 01:36:15] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
[2024-05-30 01:36:15] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (OVERLAPS) 58/102 variables, 44/115 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-30 01:36:15] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:36:15] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 1 ms to minimize.
[2024-05-30 01:36:15] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 1 ms to minimize.
[2024-05-30 01:36:15] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:36:15] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 0 ms to minimize.
[2024-05-30 01:36:15] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:36:15] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 7/122 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-30 01:36:16] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-30 01:36:16] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:36:16] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:36:16] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/102 variables, 3/126 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/102 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-30 01:36:16] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/102 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/102 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-30 01:36:16] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:36:16] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:36:16] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
[2024-05-30 01:36:16] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
[2024-05-30 01:36:17] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:36:17] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/102 variables, 6/133 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-30 01:36:17] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
[2024-05-30 01:36:17] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/102 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/102 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 17 (OVERLAPS) 0/102 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 102/102 variables, and 135 constraints, problems are : Problem set: 0 solved, 57 unsolved in 2732 ms.
Refiners :[Domain max(s): 44/44 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 44/44 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 57 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 1/44 variables, 13/56 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 34/91 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-30 01:36:17] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-05-30 01:36:17] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
[2024-05-30 01:36:17] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 1 ms to minimize.
[2024-05-30 01:36:17] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (OVERLAPS) 58/102 variables, 44/139 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 57/196 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 10 (OVERLAPS) 0/102 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Int declared 102/102 variables, and 196 constraints, problems are : Problem set: 0 solved, 57 unsolved in 1341 ms.
Refiners :[Domain max(s): 44/44 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 44/44 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 38/38 constraints]
After SMT, in 4087ms problems are : Problem set: 0 solved, 57 unsolved
Search for dead transitions found 0 dead transitions in 4088ms
Starting structural reductions in SI_LTL mode, iteration 1 : 44/45 places, 58/60 transitions.
Applied a total of 0 rules in 9 ms. Remains 44 /44 variables (removed 0) and now considering 58/58 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4219 ms. Remains : 44/45 places, 58/60 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-003A-LTLCardinality-06
Stuttering criterion allowed to conclude after 131 steps with 3 reset in 2 ms.
FORMULA ShieldRVs-PT-003A-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-003A-LTLCardinality-06 finished in 4301 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0))||(F(p0)&&F(G(!p1))))))'
Support contains 5 out of 45 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 60/60 transitions.
Applied a total of 0 rules in 1 ms. Remains 45 /45 variables (removed 0) and now considering 60/60 (removed 0) transitions.
// Phase 1: matrix 60 rows 45 cols
[2024-05-30 01:36:19] [INFO ] Computed 13 invariants in 1 ms
[2024-05-30 01:36:19] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-30 01:36:19] [INFO ] Invariant cache hit.
[2024-05-30 01:36:19] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Running 59 sub problems to find dead transitions.
[2024-05-30 01:36:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 1/45 variables, 13/57 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:36:19] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:36:19] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 1 ms to minimize.
[2024-05-30 01:36:19] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
[2024-05-30 01:36:19] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 2 ms to minimize.
[2024-05-30 01:36:19] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:36:19] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 0 ms to minimize.
[2024-05-30 01:36:19] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:36:19] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:36:19] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-05-30 01:36:19] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 1 ms to minimize.
[2024-05-30 01:36:19] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 11/69 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:36:19] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:36:19] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:36:19] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:36:19] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:36:19] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 5/74 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/45 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (OVERLAPS) 60/105 variables, 45/119 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:36:20] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 1 ms to minimize.
[2024-05-30 01:36:20] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:36:20] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2024-05-30 01:36:20] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/105 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/105 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 11 (OVERLAPS) 0/105 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 105/105 variables, and 123 constraints, problems are : Problem set: 0 solved, 59 unsolved in 1646 ms.
Refiners :[Domain max(s): 45/45 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 45/45 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 1/45 variables, 13/57 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (OVERLAPS) 60/105 variables, 45/123 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 59/182 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:36:21] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/105 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (OVERLAPS) 0/105 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 105/105 variables, and 183 constraints, problems are : Problem set: 0 solved, 59 unsolved in 1407 ms.
Refiners :[Domain max(s): 45/45 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 45/45 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 21/21 constraints]
After SMT, in 3072ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 3073ms
Finished structural reductions in LTL mode , in 1 iterations and 3168 ms. Remains : 45/45 places, 60/60 transitions.
Stuttering acceptance computed with spot in 193 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : ShieldRVs-PT-003A-LTLCardinality-07
Stuttering criterion allowed to conclude after 2931 steps with 130 reset in 15 ms.
FORMULA ShieldRVs-PT-003A-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-003A-LTLCardinality-07 finished in 3397 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((!p1 U (X(!p2)||G(!p1))))&&p0)))'
Support contains 4 out of 45 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 60/60 transitions.
Applied a total of 0 rules in 1 ms. Remains 45 /45 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2024-05-30 01:36:22] [INFO ] Invariant cache hit.
[2024-05-30 01:36:22] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-30 01:36:22] [INFO ] Invariant cache hit.
[2024-05-30 01:36:22] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
Running 59 sub problems to find dead transitions.
[2024-05-30 01:36:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 1/45 variables, 13/57 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:36:22] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:36:22] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 1 ms to minimize.
[2024-05-30 01:36:22] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 0 ms to minimize.
[2024-05-30 01:36:22] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:36:22] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2024-05-30 01:36:22] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 1 ms to minimize.
[2024-05-30 01:36:22] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:36:22] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:36:23] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:36:23] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 0 ms to minimize.
[2024-05-30 01:36:23] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 11/69 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:36:23] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:36:23] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 0 ms to minimize.
[2024-05-30 01:36:23] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:36:23] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 1 ms to minimize.
[2024-05-30 01:36:23] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 5/74 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/45 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (OVERLAPS) 60/105 variables, 45/119 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:36:23] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:36:23] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:36:23] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:36:23] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/105 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/105 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 11 (OVERLAPS) 0/105 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 105/105 variables, and 123 constraints, problems are : Problem set: 0 solved, 59 unsolved in 1677 ms.
Refiners :[Domain max(s): 45/45 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 45/45 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 1/45 variables, 13/57 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (OVERLAPS) 60/105 variables, 45/123 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 59/182 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:36:24] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/105 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (OVERLAPS) 0/105 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 105/105 variables, and 183 constraints, problems are : Problem set: 0 solved, 59 unsolved in 1283 ms.
Refiners :[Domain max(s): 45/45 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 45/45 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 21/21 constraints]
After SMT, in 2973ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 2973ms
Finished structural reductions in LTL mode , in 1 iterations and 3055 ms. Remains : 45/45 places, 60/60 transitions.
Stuttering acceptance computed with spot in 203 ms :[true, p2, (OR (NOT p0) (AND p1 p2)), (OR (NOT p0) (AND p1 p2)), (AND p2 p1), (AND p2 p1)]
Running random walk in product with property : ShieldRVs-PT-003A-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-003A-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-003A-LTLCardinality-11 finished in 3270 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 45 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 45/45 places, 60/60 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 44 transition count 59
Applied a total of 2 rules in 3 ms. Remains 44 /45 variables (removed 1) and now considering 59/60 (removed 1) transitions.
// Phase 1: matrix 59 rows 44 cols
[2024-05-30 01:36:25] [INFO ] Computed 13 invariants in 1 ms
[2024-05-30 01:36:25] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-30 01:36:25] [INFO ] Invariant cache hit.
[2024-05-30 01:36:25] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2024-05-30 01:36:25] [INFO ] Redundant transitions in 19 ms returned [18]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 57 sub problems to find dead transitions.
// Phase 1: matrix 58 rows 44 cols
[2024-05-30 01:36:25] [INFO ] Computed 13 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 1/44 variables, 13/56 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-30 01:36:26] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:36:26] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 0 ms to minimize.
[2024-05-30 01:36:26] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 1 ms to minimize.
[2024-05-30 01:36:26] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 0 ms to minimize.
[2024-05-30 01:36:26] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:36:26] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:36:26] [INFO ] Deduced a trap composed of 7 places in 15 ms of which 0 ms to minimize.
[2024-05-30 01:36:26] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:36:26] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:36:26] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:36:26] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:36:26] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-30 01:36:26] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 1 ms to minimize.
[2024-05-30 01:36:26] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (OVERLAPS) 58/102 variables, 44/115 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-30 01:36:26] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 1 ms to minimize.
[2024-05-30 01:36:26] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 0 ms to minimize.
[2024-05-30 01:36:26] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:36:26] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
[2024-05-30 01:36:26] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2024-05-30 01:36:26] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:36:26] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 7/122 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-30 01:36:27] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-30 01:36:27] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:36:27] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 0 ms to minimize.
[2024-05-30 01:36:27] [INFO ] Deduced a trap composed of 11 places in 17 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/102 variables, 3/126 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/102 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-30 01:36:27] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/102 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/102 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-30 01:36:27] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:36:27] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:36:27] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2024-05-30 01:36:28] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
[2024-05-30 01:36:28] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 1 ms to minimize.
[2024-05-30 01:36:28] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 0 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/102 variables, 6/133 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-30 01:36:28] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
[2024-05-30 01:36:28] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/102 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/102 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 17 (OVERLAPS) 0/102 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 102/102 variables, and 135 constraints, problems are : Problem set: 0 solved, 57 unsolved in 2807 ms.
Refiners :[Domain max(s): 44/44 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 44/44 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 57 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 1/44 variables, 13/56 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 34/91 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-30 01:36:28] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:36:28] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:36:28] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:36:28] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (OVERLAPS) 58/102 variables, 44/139 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 57/196 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 10 (OVERLAPS) 0/102 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Int declared 102/102 variables, and 196 constraints, problems are : Problem set: 0 solved, 57 unsolved in 1292 ms.
Refiners :[Domain max(s): 44/44 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 44/44 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 38/38 constraints]
After SMT, in 4114ms problems are : Problem set: 0 solved, 57 unsolved
Search for dead transitions found 0 dead transitions in 4115ms
Starting structural reductions in SI_LTL mode, iteration 1 : 44/45 places, 58/60 transitions.
Applied a total of 0 rules in 8 ms. Remains 44 /44 variables (removed 0) and now considering 58/58 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4234 ms. Remains : 44/45 places, 58/60 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-003A-LTLCardinality-12
Stuttering criterion allowed to conclude after 816 steps with 115 reset in 4 ms.
FORMULA ShieldRVs-PT-003A-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-003A-LTLCardinality-12 finished in 4330 ms.
All properties solved by simple procedures.
Total runtime 32780 ms.

BK_STOP 1717032990097

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldRVs-PT-003A"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is ShieldRVs-PT-003A, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r356-tall-171683761700739"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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