About the Execution of ITS-Tools for ShieldRVs-PT-050A
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16204.308 | 3104399.00 | 4012943.00 | 9003.70 | FFTFTTFFFTFFF?FF | 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-171683762000851.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-050A, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683762000851
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 776K
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 19:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 18:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Apr 12 18:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Apr 12 18:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 12 18:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:55 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 320K 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-050A-LTLCardinality-00
FORMULA_NAME ShieldRVs-PT-050A-LTLCardinality-01
FORMULA_NAME ShieldRVs-PT-050A-LTLCardinality-02
FORMULA_NAME ShieldRVs-PT-050A-LTLCardinality-03
FORMULA_NAME ShieldRVs-PT-050A-LTLCardinality-04
FORMULA_NAME ShieldRVs-PT-050A-LTLCardinality-05
FORMULA_NAME ShieldRVs-PT-050A-LTLCardinality-06
FORMULA_NAME ShieldRVs-PT-050A-LTLCardinality-07
FORMULA_NAME ShieldRVs-PT-050A-LTLCardinality-08
FORMULA_NAME ShieldRVs-PT-050A-LTLCardinality-09
FORMULA_NAME ShieldRVs-PT-050A-LTLCardinality-10
FORMULA_NAME ShieldRVs-PT-050A-LTLCardinality-11
FORMULA_NAME ShieldRVs-PT-050A-LTLCardinality-12
FORMULA_NAME ShieldRVs-PT-050A-LTLCardinality-13
FORMULA_NAME ShieldRVs-PT-050A-LTLCardinality-14
FORMULA_NAME ShieldRVs-PT-050A-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1717061389093
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-050A
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-30 09:29:50] [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 09:29:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 09:29:50] [INFO ] Load time of PNML (sax parser for PT used): 117 ms
[2024-05-30 09:29:50] [INFO ] Transformed 703 places.
[2024-05-30 09:29:50] [INFO ] Transformed 953 transitions.
[2024-05-30 09:29:50] [INFO ] Found NUPN structural information;
[2024-05-30 09:29:50] [INFO ] Parsed PT model containing 703 places and 953 transitions and 4600 arcs in 216 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 3 formulas.
FORMULA ShieldRVs-PT-050A-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-050A-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-050A-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-050A-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-050A-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-050A-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-050A-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Applied a total of 0 rules in 65 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
// Phase 1: matrix 953 rows 703 cols
[2024-05-30 09:29:50] [INFO ] Computed 201 invariants in 33 ms
[2024-05-30 09:29:51] [INFO ] Implicit Places using invariants in 574 ms returned []
[2024-05-30 09:29:51] [INFO ] Invariant cache hit.
[2024-05-30 09:29:51] [INFO ] Implicit Places using invariants and state equation in 759 ms returned []
Implicit Place search using SMT with State Equation took 1365 ms to find 0 implicit places.
Running 952 sub problems to find dead transitions.
[2024-05-30 09:29:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/702 variables, 702/702 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/702 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 2 (OVERLAPS) 1/703 variables, 201/903 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/703 variables, 1/904 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-05-30 09:30:20] [INFO ] Deduced a trap composed of 8 places in 246 ms of which 29 ms to minimize.
[2024-05-30 09:30:20] [INFO ] Deduced a trap composed of 7 places in 189 ms of which 3 ms to minimize.
[2024-05-30 09:30:21] [INFO ] Deduced a trap composed of 7 places in 167 ms of which 3 ms to minimize.
[2024-05-30 09:30:21] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 2 ms to minimize.
[2024-05-30 09:30:21] [INFO ] Deduced a trap composed of 14 places in 160 ms of which 3 ms to minimize.
[2024-05-30 09:30:21] [INFO ] Deduced a trap composed of 7 places in 165 ms of which 3 ms to minimize.
[2024-05-30 09:30:21] [INFO ] Deduced a trap composed of 13 places in 155 ms of which 3 ms to minimize.
[2024-05-30 09:30:21] [INFO ] Deduced a trap composed of 14 places in 155 ms of which 3 ms to minimize.
[2024-05-30 09:30:22] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 2 ms to minimize.
[2024-05-30 09:30:22] [INFO ] Deduced a trap composed of 13 places in 179 ms of which 2 ms to minimize.
[2024-05-30 09:30:22] [INFO ] Deduced a trap composed of 7 places in 185 ms of which 3 ms to minimize.
[2024-05-30 09:30:22] [INFO ] Deduced a trap composed of 16 places in 178 ms of which 3 ms to minimize.
SMT process timed out in 30679ms, After SMT, problems are : Problem set: 0 solved, 952 unsolved
Search for dead transitions found 0 dead transitions in 30709ms
Finished structural reductions in LTL mode , in 1 iterations and 32163 ms. Remains : 703/703 places, 953/953 transitions.
Support contains 33 out of 703 places after structural reductions.
[2024-05-30 09:30:23] [INFO ] Flatten gal took : 153 ms
[2024-05-30 09:30:23] [INFO ] Flatten gal took : 80 ms
[2024-05-30 09:30:23] [INFO ] Input system was already deterministic with 953 transitions.
Support contains 31 out of 703 places (down from 33) after GAL structural reductions.
RANDOM walk for 35638 steps (52 resets) in 1155 ms. (30 steps per ms) remains 0/17 properties
FORMULA ShieldRVs-PT-050A-LTLCardinality-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(p0))||G(p1)))))'
Support contains 3 out of 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Applied a total of 0 rules in 16 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
[2024-05-30 09:30:24] [INFO ] Invariant cache hit.
[2024-05-30 09:30:24] [INFO ] Implicit Places using invariants in 531 ms returned []
[2024-05-30 09:30:24] [INFO ] Invariant cache hit.
[2024-05-30 09:30:25] [INFO ] Implicit Places using invariants and state equation in 739 ms returned []
Implicit Place search using SMT with State Equation took 1280 ms to find 0 implicit places.
Running 952 sub problems to find dead transitions.
[2024-05-30 09:30:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/702 variables, 702/702 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/702 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 2 (OVERLAPS) 1/703 variables, 201/903 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/703 variables, 1/904 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-05-30 09:30:53] [INFO ] Deduced a trap composed of 8 places in 178 ms of which 3 ms to minimize.
[2024-05-30 09:30:53] [INFO ] Deduced a trap composed of 7 places in 177 ms of which 3 ms to minimize.
[2024-05-30 09:30:54] [INFO ] Deduced a trap composed of 7 places in 179 ms of which 3 ms to minimize.
[2024-05-30 09:30:54] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 2 ms to minimize.
[2024-05-30 09:30:54] [INFO ] Deduced a trap composed of 14 places in 173 ms of which 3 ms to minimize.
[2024-05-30 09:30:54] [INFO ] Deduced a trap composed of 7 places in 176 ms of which 2 ms to minimize.
[2024-05-30 09:30:54] [INFO ] Deduced a trap composed of 13 places in 173 ms of which 2 ms to minimize.
[2024-05-30 09:30:55] [INFO ] Deduced a trap composed of 14 places in 210 ms of which 2 ms to minimize.
[2024-05-30 09:30:55] [INFO ] Deduced a trap composed of 7 places in 105 ms of which 2 ms to minimize.
[2024-05-30 09:30:55] [INFO ] Deduced a trap composed of 13 places in 159 ms of which 3 ms to minimize.
[2024-05-30 09:30:55] [INFO ] Deduced a trap composed of 7 places in 179 ms of which 3 ms to minimize.
[2024-05-30 09:30:55] [INFO ] Deduced a trap composed of 16 places in 181 ms of which 3 ms to minimize.
SMT process timed out in 30500ms, After SMT, problems are : Problem set: 0 solved, 952 unsolved
Search for dead transitions found 0 dead transitions in 30512ms
Finished structural reductions in LTL mode , in 1 iterations and 31825 ms. Remains : 703/703 places, 953/953 transitions.
Stuttering acceptance computed with spot in 302 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVs-PT-050A-LTLCardinality-01
Stuttering criterion allowed to conclude after 1340 steps with 1 reset in 13 ms.
FORMULA ShieldRVs-PT-050A-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050A-LTLCardinality-01 finished in 32199 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(G((G(p1)||p0)))))'
Support contains 4 out of 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Applied a total of 0 rules in 15 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
[2024-05-30 09:30:56] [INFO ] Invariant cache hit.
[2024-05-30 09:30:56] [INFO ] Implicit Places using invariants in 320 ms returned []
[2024-05-30 09:30:56] [INFO ] Invariant cache hit.
[2024-05-30 09:30:57] [INFO ] Implicit Places using invariants and state equation in 713 ms returned []
Implicit Place search using SMT with State Equation took 1034 ms to find 0 implicit places.
Running 952 sub problems to find dead transitions.
[2024-05-30 09:30:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/702 variables, 702/702 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/702 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 2 (OVERLAPS) 1/703 variables, 201/903 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/703 variables, 1/904 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-05-30 09:31:24] [INFO ] Deduced a trap composed of 8 places in 161 ms of which 3 ms to minimize.
[2024-05-30 09:31:24] [INFO ] Deduced a trap composed of 7 places in 163 ms of which 2 ms to minimize.
[2024-05-30 09:31:25] [INFO ] Deduced a trap composed of 7 places in 178 ms of which 3 ms to minimize.
[2024-05-30 09:31:25] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 1 ms to minimize.
[2024-05-30 09:31:25] [INFO ] Deduced a trap composed of 14 places in 176 ms of which 2 ms to minimize.
[2024-05-30 09:31:25] [INFO ] Deduced a trap composed of 7 places in 172 ms of which 3 ms to minimize.
[2024-05-30 09:31:25] [INFO ] Deduced a trap composed of 13 places in 168 ms of which 3 ms to minimize.
[2024-05-30 09:31:26] [INFO ] Deduced a trap composed of 14 places in 177 ms of which 2 ms to minimize.
[2024-05-30 09:31:26] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 2 ms to minimize.
[2024-05-30 09:31:26] [INFO ] Deduced a trap composed of 13 places in 201 ms of which 4 ms to minimize.
[2024-05-30 09:31:26] [INFO ] Deduced a trap composed of 7 places in 173 ms of which 2 ms to minimize.
[2024-05-30 09:31:26] [INFO ] Deduced a trap composed of 16 places in 175 ms of which 5 ms to minimize.
[2024-05-30 09:31:27] [INFO ] Deduced a trap composed of 13 places in 174 ms of which 2 ms to minimize.
[2024-05-30 09:31:27] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 2 ms to minimize.
[2024-05-30 09:31:27] [INFO ] Deduced a trap composed of 14 places in 167 ms of which 3 ms to minimize.
[2024-05-30 09:31:27] [INFO ] Deduced a trap composed of 7 places in 171 ms of which 4 ms to minimize.
SMT process timed out in 30473ms, After SMT, problems are : Problem set: 0 solved, 952 unsolved
Search for dead transitions found 0 dead transitions in 30482ms
Finished structural reductions in LTL mode , in 1 iterations and 31536 ms. Remains : 703/703 places, 953/953 transitions.
Stuttering acceptance computed with spot in 159 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVs-PT-050A-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 427 steps with 0 reset in 9 ms.
FORMULA ShieldRVs-PT-050A-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050A-LTLCardinality-07 finished in 31724 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Applied a total of 0 rules in 11 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
[2024-05-30 09:31:27] [INFO ] Invariant cache hit.
[2024-05-30 09:31:28] [INFO ] Implicit Places using invariants in 328 ms returned []
[2024-05-30 09:31:28] [INFO ] Invariant cache hit.
[2024-05-30 09:31:28] [INFO ] Implicit Places using invariants and state equation in 747 ms returned []
Implicit Place search using SMT with State Equation took 1077 ms to find 0 implicit places.
Running 952 sub problems to find dead transitions.
[2024-05-30 09:31:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/702 variables, 702/702 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/702 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 2 (OVERLAPS) 1/703 variables, 201/903 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/703 variables, 1/904 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-05-30 09:31:56] [INFO ] Deduced a trap composed of 8 places in 176 ms of which 3 ms to minimize.
[2024-05-30 09:31:57] [INFO ] Deduced a trap composed of 7 places in 183 ms of which 2 ms to minimize.
[2024-05-30 09:31:57] [INFO ] Deduced a trap composed of 7 places in 170 ms of which 3 ms to minimize.
[2024-05-30 09:31:57] [INFO ] Deduced a trap composed of 7 places in 105 ms of which 1 ms to minimize.
[2024-05-30 09:31:57] [INFO ] Deduced a trap composed of 14 places in 179 ms of which 3 ms to minimize.
[2024-05-30 09:31:57] [INFO ] Deduced a trap composed of 7 places in 177 ms of which 2 ms to minimize.
[2024-05-30 09:31:58] [INFO ] Deduced a trap composed of 13 places in 172 ms of which 3 ms to minimize.
[2024-05-30 09:31:58] [INFO ] Deduced a trap composed of 14 places in 176 ms of which 3 ms to minimize.
[2024-05-30 09:31:58] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 2 ms to minimize.
[2024-05-30 09:31:58] [INFO ] Deduced a trap composed of 13 places in 173 ms of which 2 ms to minimize.
[2024-05-30 09:31:58] [INFO ] Deduced a trap composed of 7 places in 166 ms of which 3 ms to minimize.
[2024-05-30 09:31:59] [INFO ] Deduced a trap composed of 16 places in 161 ms of which 3 ms to minimize.
[2024-05-30 09:31:59] [INFO ] Deduced a trap composed of 13 places in 158 ms of which 2 ms to minimize.
[2024-05-30 09:31:59] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 1 ms to minimize.
SMT process timed out in 30359ms, After SMT, problems are : Problem set: 0 solved, 952 unsolved
Search for dead transitions found 0 dead transitions in 30368ms
Finished structural reductions in LTL mode , in 1 iterations and 31463 ms. Remains : 703/703 places, 953/953 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-050A-LTLCardinality-08
Stuttering criterion allowed to conclude after 782 steps with 2 reset in 9 ms.
FORMULA ShieldRVs-PT-050A-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050A-LTLCardinality-08 finished in 31584 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&X(G((p1 U p2)))))))'
Support contains 5 out of 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Applied a total of 0 rules in 15 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
[2024-05-30 09:31:59] [INFO ] Invariant cache hit.
[2024-05-30 09:31:59] [INFO ] Implicit Places using invariants in 300 ms returned []
[2024-05-30 09:31:59] [INFO ] Invariant cache hit.
[2024-05-30 09:32:00] [INFO ] Implicit Places using invariants and state equation in 756 ms returned []
Implicit Place search using SMT with State Equation took 1077 ms to find 0 implicit places.
Running 952 sub problems to find dead transitions.
[2024-05-30 09:32:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/702 variables, 702/702 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/702 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 2 (OVERLAPS) 1/703 variables, 201/903 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/703 variables, 1/904 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-05-30 09:32:28] [INFO ] Deduced a trap composed of 8 places in 187 ms of which 3 ms to minimize.
[2024-05-30 09:32:28] [INFO ] Deduced a trap composed of 7 places in 180 ms of which 3 ms to minimize.
[2024-05-30 09:32:28] [INFO ] Deduced a trap composed of 7 places in 180 ms of which 3 ms to minimize.
[2024-05-30 09:32:28] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 1 ms to minimize.
[2024-05-30 09:32:28] [INFO ] Deduced a trap composed of 14 places in 176 ms of which 3 ms to minimize.
[2024-05-30 09:32:29] [INFO ] Deduced a trap composed of 7 places in 178 ms of which 3 ms to minimize.
[2024-05-30 09:32:29] [INFO ] Deduced a trap composed of 13 places in 180 ms of which 3 ms to minimize.
[2024-05-30 09:32:29] [INFO ] Deduced a trap composed of 14 places in 171 ms of which 3 ms to minimize.
[2024-05-30 09:32:29] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 1 ms to minimize.
[2024-05-30 09:32:29] [INFO ] Deduced a trap composed of 13 places in 185 ms of which 3 ms to minimize.
[2024-05-30 09:32:30] [INFO ] Deduced a trap composed of 7 places in 181 ms of which 3 ms to minimize.
[2024-05-30 09:32:30] [INFO ] Deduced a trap composed of 16 places in 177 ms of which 3 ms to minimize.
[2024-05-30 09:32:30] [INFO ] Deduced a trap composed of 13 places in 176 ms of which 2 ms to minimize.
[2024-05-30 09:32:30] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 2 ms to minimize.
[2024-05-30 09:32:30] [INFO ] Deduced a trap composed of 14 places in 179 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 703/1656 variables, and 919 constraints, problems are : Problem set: 0 solved, 952 unsolved in 30033 ms.
Refiners :[Domain max(s): 703/703 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 0/703 constraints, PredecessorRefiner: 952/952 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 952 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/702 variables, 702/702 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/702 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 2 (OVERLAPS) 1/703 variables, 201/903 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/703 variables, 1/904 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/703 variables, 15/919 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-05-30 09:32:41] [INFO ] Deduced a trap composed of 7 places in 172 ms of which 2 ms to minimize.
[2024-05-30 09:32:41] [INFO ] Deduced a trap composed of 12 places in 186 ms of which 3 ms to minimize.
[2024-05-30 09:32:41] [INFO ] Deduced a trap composed of 14 places in 177 ms of which 2 ms to minimize.
[2024-05-30 09:32:41] [INFO ] Deduced a trap composed of 7 places in 101 ms of which 2 ms to minimize.
[2024-05-30 09:32:42] [INFO ] Deduced a trap composed of 7 places in 108 ms of which 1 ms to minimize.
[2024-05-30 09:32:42] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 1 ms to minimize.
[2024-05-30 09:32:42] [INFO ] Deduced a trap composed of 13 places in 171 ms of which 3 ms to minimize.
[2024-05-30 09:32:42] [INFO ] Deduced a trap composed of 7 places in 175 ms of which 3 ms to minimize.
[2024-05-30 09:32:42] [INFO ] Deduced a trap composed of 13 places in 169 ms of which 3 ms to minimize.
[2024-05-30 09:32:43] [INFO ] Deduced a trap composed of 14 places in 167 ms of which 3 ms to minimize.
[2024-05-30 09:32:43] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 2 ms to minimize.
[2024-05-30 09:32:43] [INFO ] Deduced a trap composed of 13 places in 173 ms of which 2 ms to minimize.
[2024-05-30 09:32:43] [INFO ] Deduced a trap composed of 7 places in 166 ms of which 2 ms to minimize.
[2024-05-30 09:32:43] [INFO ] Deduced a trap composed of 13 places in 171 ms of which 3 ms to minimize.
[2024-05-30 09:32:43] [INFO ] Deduced a trap composed of 7 places in 86 ms of which 1 ms to minimize.
[2024-05-30 09:32:44] [INFO ] Deduced a trap composed of 13 places in 177 ms of which 3 ms to minimize.
[2024-05-30 09:32:44] [INFO ] Deduced a trap composed of 7 places in 181 ms of which 2 ms to minimize.
[2024-05-30 09:32:44] [INFO ] Deduced a trap composed of 13 places in 182 ms of which 3 ms to minimize.
[2024-05-30 09:32:44] [INFO ] Deduced a trap composed of 11 places in 181 ms of which 2 ms to minimize.
[2024-05-30 09:32:45] [INFO ] Deduced a trap composed of 16 places in 179 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/703 variables, 20/939 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-05-30 09:32:45] [INFO ] Deduced a trap composed of 13 places in 174 ms of which 3 ms to minimize.
[2024-05-30 09:32:46] [INFO ] Deduced a trap composed of 13 places in 170 ms of which 3 ms to minimize.
[2024-05-30 09:32:46] [INFO ] Deduced a trap composed of 17 places in 179 ms of which 3 ms to minimize.
[2024-05-30 09:32:46] [INFO ] Deduced a trap composed of 13 places in 174 ms of which 2 ms to minimize.
[2024-05-30 09:32:46] [INFO ] Deduced a trap composed of 13 places in 179 ms of which 3 ms to minimize.
[2024-05-30 09:32:46] [INFO ] Deduced a trap composed of 18 places in 176 ms of which 3 ms to minimize.
[2024-05-30 09:32:47] [INFO ] Deduced a trap composed of 12 places in 178 ms of which 3 ms to minimize.
[2024-05-30 09:32:47] [INFO ] Deduced a trap composed of 13 places in 160 ms of which 2 ms to minimize.
[2024-05-30 09:32:47] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 1 ms to minimize.
[2024-05-30 09:32:47] [INFO ] Deduced a trap composed of 14 places in 181 ms of which 2 ms to minimize.
[2024-05-30 09:32:47] [INFO ] Deduced a trap composed of 7 places in 182 ms of which 2 ms to minimize.
[2024-05-30 09:32:48] [INFO ] Deduced a trap composed of 13 places in 179 ms of which 2 ms to minimize.
[2024-05-30 09:32:48] [INFO ] Deduced a trap composed of 18 places in 189 ms of which 3 ms to minimize.
[2024-05-30 09:32:48] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 1 ms to minimize.
[2024-05-30 09:32:48] [INFO ] Deduced a trap composed of 18 places in 169 ms of which 2 ms to minimize.
[2024-05-30 09:32:48] [INFO ] Deduced a trap composed of 19 places in 185 ms of which 3 ms to minimize.
[2024-05-30 09:32:49] [INFO ] Deduced a trap composed of 10 places in 179 ms of which 3 ms to minimize.
[2024-05-30 09:32:49] [INFO ] Deduced a trap composed of 7 places in 114 ms of which 1 ms to minimize.
[2024-05-30 09:32:49] [INFO ] Deduced a trap composed of 17 places in 111 ms of which 2 ms to minimize.
[2024-05-30 09:32:49] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/703 variables, 20/959 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-05-30 09:32:50] [INFO ] Deduced a trap composed of 13 places in 181 ms of which 3 ms to minimize.
[2024-05-30 09:32:50] [INFO ] Deduced a trap composed of 14 places in 186 ms of which 2 ms to minimize.
[2024-05-30 09:32:51] [INFO ] Deduced a trap composed of 14 places in 176 ms of which 3 ms to minimize.
[2024-05-30 09:32:51] [INFO ] Deduced a trap composed of 14 places in 178 ms of which 2 ms to minimize.
[2024-05-30 09:32:51] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 1 ms to minimize.
[2024-05-30 09:32:51] [INFO ] Deduced a trap composed of 13 places in 188 ms of which 3 ms to minimize.
[2024-05-30 09:32:51] [INFO ] Deduced a trap composed of 7 places in 189 ms of which 3 ms to minimize.
[2024-05-30 09:32:52] [INFO ] Deduced a trap composed of 11 places in 179 ms of which 2 ms to minimize.
[2024-05-30 09:32:52] [INFO ] Deduced a trap composed of 21 places in 186 ms of which 2 ms to minimize.
[2024-05-30 09:32:52] [INFO ] Deduced a trap composed of 21 places in 182 ms of which 3 ms to minimize.
[2024-05-30 09:32:52] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 1 ms to minimize.
[2024-05-30 09:32:52] [INFO ] Deduced a trap composed of 30 places in 173 ms of which 3 ms to minimize.
[2024-05-30 09:32:53] [INFO ] Deduced a trap composed of 7 places in 179 ms of which 3 ms to minimize.
[2024-05-30 09:32:53] [INFO ] Deduced a trap composed of 14 places in 174 ms of which 3 ms to minimize.
[2024-05-30 09:32:53] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 1 ms to minimize.
[2024-05-30 09:32:53] [INFO ] Deduced a trap composed of 14 places in 175 ms of which 3 ms to minimize.
[2024-05-30 09:32:53] [INFO ] Deduced a trap composed of 7 places in 173 ms of which 3 ms to minimize.
[2024-05-30 09:32:54] [INFO ] Deduced a trap composed of 14 places in 172 ms of which 3 ms to minimize.
[2024-05-30 09:32:54] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 1 ms to minimize.
[2024-05-30 09:32:54] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/703 variables, 20/979 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-05-30 09:32:55] [INFO ] Deduced a trap composed of 17 places in 185 ms of which 2 ms to minimize.
[2024-05-30 09:32:55] [INFO ] Deduced a trap composed of 13 places in 183 ms of which 2 ms to minimize.
[2024-05-30 09:32:55] [INFO ] Deduced a trap composed of 14 places in 178 ms of which 3 ms to minimize.
[2024-05-30 09:32:56] [INFO ] Deduced a trap composed of 14 places in 170 ms of which 3 ms to minimize.
[2024-05-30 09:32:56] [INFO ] Deduced a trap composed of 14 places in 176 ms of which 3 ms to minimize.
[2024-05-30 09:32:56] [INFO ] Deduced a trap composed of 13 places in 171 ms of which 2 ms to minimize.
[2024-05-30 09:32:56] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 2 ms to minimize.
[2024-05-30 09:32:57] [INFO ] Deduced a trap composed of 13 places in 186 ms of which 3 ms to minimize.
[2024-05-30 09:32:57] [INFO ] Deduced a trap composed of 14 places in 180 ms of which 3 ms to minimize.
[2024-05-30 09:32:57] [INFO ] Deduced a trap composed of 7 places in 186 ms of which 4 ms to minimize.
[2024-05-30 09:32:57] [INFO ] Deduced a trap composed of 13 places in 182 ms of which 3 ms to minimize.
[2024-05-30 09:32:57] [INFO ] Deduced a trap composed of 14 places in 185 ms of which 3 ms to minimize.
[2024-05-30 09:32:58] [INFO ] Deduced a trap composed of 18 places in 187 ms of which 4 ms to minimize.
[2024-05-30 09:32:58] [INFO ] Deduced a trap composed of 13 places in 188 ms of which 3 ms to minimize.
[2024-05-30 09:32:58] [INFO ] Deduced a trap composed of 13 places in 192 ms of which 2 ms to minimize.
[2024-05-30 09:32:58] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 1 ms to minimize.
[2024-05-30 09:32:59] [INFO ] Deduced a trap composed of 13 places in 194 ms of which 3 ms to minimize.
[2024-05-30 09:32:59] [INFO ] Deduced a trap composed of 7 places in 178 ms of which 3 ms to minimize.
[2024-05-30 09:32:59] [INFO ] Deduced a trap composed of 13 places in 177 ms of which 3 ms to minimize.
[2024-05-30 09:32:59] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/703 variables, 20/999 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-05-30 09:33:00] [INFO ] Deduced a trap composed of 18 places in 167 ms of which 2 ms to minimize.
[2024-05-30 09:33:00] [INFO ] Deduced a trap composed of 14 places in 166 ms of which 2 ms to minimize.
[2024-05-30 09:33:01] [INFO ] Deduced a trap composed of 13 places in 189 ms of which 3 ms to minimize.
SMT process timed out in 60578ms, After SMT, problems are : Problem set: 0 solved, 952 unsolved
Search for dead transitions found 0 dead transitions in 60587ms
Finished structural reductions in LTL mode , in 1 iterations and 61683 ms. Remains : 703/703 places, 953/953 transitions.
Stuttering acceptance computed with spot in 217 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, (NOT p2), (NOT p2)]
Running random walk in product with property : ShieldRVs-PT-050A-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 31 steps with 0 reset in 3 ms.
FORMULA ShieldRVs-PT-050A-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050A-LTLCardinality-10 finished in 61928 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 703 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 703/703 places, 953/953 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 702 transition count 952
Applied a total of 2 rules in 74 ms. Remains 702 /703 variables (removed 1) and now considering 952/953 (removed 1) transitions.
// Phase 1: matrix 952 rows 702 cols
[2024-05-30 09:33:01] [INFO ] Computed 201 invariants in 5 ms
[2024-05-30 09:33:01] [INFO ] Implicit Places using invariants in 303 ms returned []
[2024-05-30 09:33:01] [INFO ] Invariant cache hit.
[2024-05-30 09:33:02] [INFO ] Implicit Places using invariants and state equation in 724 ms returned []
Implicit Place search using SMT with State Equation took 1031 ms to find 0 implicit places.
[2024-05-30 09:33:02] [INFO ] Redundant transitions in 302 ms returned [300]
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 950 sub problems to find dead transitions.
// Phase 1: matrix 951 rows 702 cols
[2024-05-30 09:33:02] [INFO ] Computed 201 invariants in 8 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/701 variables, 701/701 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/701 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 2 (OVERLAPS) 1/702 variables, 201/902 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/702 variables, 1/903 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 09:33:31] [INFO ] Deduced a trap composed of 8 places in 170 ms of which 3 ms to minimize.
[2024-05-30 09:33:31] [INFO ] Deduced a trap composed of 8 places in 166 ms of which 2 ms to minimize.
[2024-05-30 09:33:31] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 2 ms to minimize.
[2024-05-30 09:33:31] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 2 ms to minimize.
[2024-05-30 09:33:31] [INFO ] Deduced a trap composed of 13 places in 165 ms of which 2 ms to minimize.
[2024-05-30 09:33:32] [INFO ] Deduced a trap composed of 7 places in 168 ms of which 3 ms to minimize.
[2024-05-30 09:33:32] [INFO ] Deduced a trap composed of 13 places in 175 ms of which 2 ms to minimize.
[2024-05-30 09:33:32] [INFO ] Deduced a trap composed of 8 places in 178 ms of which 2 ms to minimize.
[2024-05-30 09:33:32] [INFO ] Deduced a trap composed of 11 places in 174 ms of which 3 ms to minimize.
[2024-05-30 09:33:32] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 2 ms to minimize.
[2024-05-30 09:33:33] [INFO ] Deduced a trap composed of 16 places in 181 ms of which 3 ms to minimize.
[2024-05-30 09:33:33] [INFO ] Deduced a trap composed of 7 places in 171 ms of which 3 ms to minimize.
[2024-05-30 09:33:33] [INFO ] Deduced a trap composed of 13 places in 169 ms of which 3 ms to minimize.
SMT process timed out in 30625ms, After SMT, problems are : Problem set: 0 solved, 950 unsolved
Search for dead transitions found 0 dead transitions in 30636ms
Starting structural reductions in SI_LTL mode, iteration 1 : 702/703 places, 951/953 transitions.
Applied a total of 0 rules in 30 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 32086 ms. Remains : 702/703 places, 951/953 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVs-PT-050A-LTLCardinality-11
Stuttering criterion allowed to conclude after 7848 steps with 11 reset in 55 ms.
FORMULA ShieldRVs-PT-050A-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050A-LTLCardinality-11 finished in 32214 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)) U (!p1&&G(F(!p2))))))'
Support contains 5 out of 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Applied a total of 0 rules in 10 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
// Phase 1: matrix 953 rows 703 cols
[2024-05-30 09:33:33] [INFO ] Computed 201 invariants in 4 ms
[2024-05-30 09:33:33] [INFO ] Implicit Places using invariants in 296 ms returned []
[2024-05-30 09:33:33] [INFO ] Invariant cache hit.
[2024-05-30 09:33:34] [INFO ] Implicit Places using invariants and state equation in 706 ms returned []
Implicit Place search using SMT with State Equation took 1005 ms to find 0 implicit places.
Running 952 sub problems to find dead transitions.
[2024-05-30 09:33:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/702 variables, 702/702 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/702 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 2 (OVERLAPS) 1/703 variables, 201/903 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/703 variables, 1/904 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-05-30 09:34:02] [INFO ] Deduced a trap composed of 8 places in 163 ms of which 3 ms to minimize.
[2024-05-30 09:34:02] [INFO ] Deduced a trap composed of 7 places in 161 ms of which 3 ms to minimize.
[2024-05-30 09:34:03] [INFO ] Deduced a trap composed of 7 places in 177 ms of which 3 ms to minimize.
[2024-05-30 09:34:03] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 1 ms to minimize.
[2024-05-30 09:34:03] [INFO ] Deduced a trap composed of 14 places in 161 ms of which 3 ms to minimize.
[2024-05-30 09:34:03] [INFO ] Deduced a trap composed of 7 places in 165 ms of which 2 ms to minimize.
[2024-05-30 09:34:03] [INFO ] Deduced a trap composed of 13 places in 161 ms of which 2 ms to minimize.
[2024-05-30 09:34:04] [INFO ] Deduced a trap composed of 14 places in 160 ms of which 2 ms to minimize.
[2024-05-30 09:34:04] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 1 ms to minimize.
[2024-05-30 09:34:04] [INFO ] Deduced a trap composed of 13 places in 171 ms of which 3 ms to minimize.
[2024-05-30 09:34:04] [INFO ] Deduced a trap composed of 7 places in 165 ms of which 3 ms to minimize.
[2024-05-30 09:34:04] [INFO ] Deduced a trap composed of 16 places in 181 ms of which 2 ms to minimize.
[2024-05-30 09:34:05] [INFO ] Deduced a trap composed of 13 places in 171 ms of which 3 ms to minimize.
SMT process timed out in 30377ms, After SMT, problems are : Problem set: 0 solved, 952 unsolved
Search for dead transitions found 0 dead transitions in 30388ms
Finished structural reductions in LTL mode , in 1 iterations and 31406 ms. Remains : 703/703 places, 953/953 transitions.
Stuttering acceptance computed with spot in 263 ms :[(OR p2 p1), (OR p1 p2), (NOT p0), (NOT p0), p2, p2]
Running random walk in product with property : ShieldRVs-PT-050A-LTLCardinality-12
Product exploration explored 100000 steps with 151 reset in 517 ms.
Stuttering criterion allowed to conclude after 15865 steps with 23 reset in 105 ms.
FORMULA ShieldRVs-PT-050A-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050A-LTLCardinality-12 finished in 32326 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(F(p0))&&F(!p1))||G(F(p0))))'
Support contains 6 out of 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Applied a total of 0 rules in 15 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
[2024-05-30 09:34:05] [INFO ] Invariant cache hit.
[2024-05-30 09:34:06] [INFO ] Implicit Places using invariants in 319 ms returned []
[2024-05-30 09:34:06] [INFO ] Invariant cache hit.
[2024-05-30 09:34:07] [INFO ] Implicit Places using invariants and state equation in 746 ms returned []
Implicit Place search using SMT with State Equation took 1065 ms to find 0 implicit places.
Running 952 sub problems to find dead transitions.
[2024-05-30 09:34:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/702 variables, 702/702 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/702 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 2 (OVERLAPS) 1/703 variables, 201/903 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/703 variables, 1/904 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-05-30 09:34:34] [INFO ] Deduced a trap composed of 8 places in 176 ms of which 3 ms to minimize.
[2024-05-30 09:34:34] [INFO ] Deduced a trap composed of 7 places in 176 ms of which 3 ms to minimize.
[2024-05-30 09:34:35] [INFO ] Deduced a trap composed of 7 places in 173 ms of which 3 ms to minimize.
[2024-05-30 09:34:35] [INFO ] Deduced a trap composed of 7 places in 101 ms of which 1 ms to minimize.
[2024-05-30 09:34:35] [INFO ] Deduced a trap composed of 14 places in 176 ms of which 2 ms to minimize.
[2024-05-30 09:34:35] [INFO ] Deduced a trap composed of 7 places in 162 ms of which 3 ms to minimize.
[2024-05-30 09:34:35] [INFO ] Deduced a trap composed of 13 places in 181 ms of which 3 ms to minimize.
[2024-05-30 09:34:36] [INFO ] Deduced a trap composed of 14 places in 180 ms of which 2 ms to minimize.
[2024-05-30 09:34:36] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 2 ms to minimize.
[2024-05-30 09:34:36] [INFO ] Deduced a trap composed of 13 places in 174 ms of which 3 ms to minimize.
[2024-05-30 09:34:36] [INFO ] Deduced a trap composed of 7 places in 184 ms of which 2 ms to minimize.
[2024-05-30 09:34:36] [INFO ] Deduced a trap composed of 16 places in 179 ms of which 3 ms to minimize.
[2024-05-30 09:34:37] [INFO ] Deduced a trap composed of 13 places in 177 ms of which 2 ms to minimize.
[2024-05-30 09:34:37] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 1 ms to minimize.
[2024-05-30 09:34:37] [INFO ] Deduced a trap composed of 14 places in 183 ms of which 3 ms to minimize.
SMT process timed out in 30389ms, After SMT, problems are : Problem set: 0 solved, 952 unsolved
Search for dead transitions found 0 dead transitions in 30399ms
Finished structural reductions in LTL mode , in 1 iterations and 31483 ms. Remains : 703/703 places, 953/953 transitions.
Stuttering acceptance computed with spot in 248 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : ShieldRVs-PT-050A-LTLCardinality-13
Product exploration explored 100000 steps with 1203 reset in 530 ms.
Product exploration explored 100000 steps with 1171 reset in 615 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) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 122 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1), false, false]
RANDOM walk for 40000 steps (57 resets) in 440 ms. (90 steps per ms) remains 1/5 properties
BEST_FIRST walk for 12009 steps (1 resets) in 83 ms. (142 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 7 factoid took 193 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1), false, false]
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1), false, false]
Support contains 6 out of 703 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 702 transition count 952
Applied a total of 2 rules in 45 ms. Remains 702 /703 variables (removed 1) and now considering 952/953 (removed 1) transitions.
// Phase 1: matrix 952 rows 702 cols
[2024-05-30 09:34:40] [INFO ] Computed 201 invariants in 8 ms
[2024-05-30 09:34:40] [INFO ] Implicit Places using invariants in 336 ms returned []
[2024-05-30 09:34:40] [INFO ] Invariant cache hit.
[2024-05-30 09:34:41] [INFO ] Implicit Places using invariants and state equation in 738 ms returned []
Implicit Place search using SMT with State Equation took 1076 ms to find 0 implicit places.
[2024-05-30 09:34:41] [INFO ] Redundant transitions in 174 ms returned [300]
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 950 sub problems to find dead transitions.
// Phase 1: matrix 951 rows 702 cols
[2024-05-30 09:34:41] [INFO ] Computed 201 invariants in 5 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/701 variables, 701/701 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/701 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 2 (OVERLAPS) 1/702 variables, 201/902 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/702 variables, 1/903 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 09:35:08] [INFO ] Deduced a trap composed of 8 places in 174 ms of which 3 ms to minimize.
[2024-05-30 09:35:09] [INFO ] Deduced a trap composed of 8 places in 176 ms of which 2 ms to minimize.
[2024-05-30 09:35:09] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 1 ms to minimize.
[2024-05-30 09:35:09] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 1 ms to minimize.
[2024-05-30 09:35:09] [INFO ] Deduced a trap composed of 13 places in 181 ms of which 3 ms to minimize.
[2024-05-30 09:35:09] [INFO ] Deduced a trap composed of 7 places in 182 ms of which 2 ms to minimize.
[2024-05-30 09:35:10] [INFO ] Deduced a trap composed of 13 places in 163 ms of which 3 ms to minimize.
[2024-05-30 09:35:10] [INFO ] Deduced a trap composed of 8 places in 174 ms of which 3 ms to minimize.
[2024-05-30 09:35:10] [INFO ] Deduced a trap composed of 11 places in 172 ms of which 2 ms to minimize.
[2024-05-30 09:35:10] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 1 ms to minimize.
[2024-05-30 09:35:10] [INFO ] Deduced a trap composed of 16 places in 172 ms of which 2 ms to minimize.
[2024-05-30 09:35:11] [INFO ] Deduced a trap composed of 7 places in 176 ms of which 2 ms to minimize.
[2024-05-30 09:35:11] [INFO ] Deduced a trap composed of 13 places in 171 ms of which 2 ms to minimize.
[2024-05-30 09:35:11] [INFO ] Deduced a trap composed of 14 places in 172 ms of which 2 ms to minimize.
[2024-05-30 09:35:11] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 702/1653 variables, and 918 constraints, problems are : Problem set: 0 solved, 950 unsolved in 30019 ms.
Refiners :[Domain max(s): 702/702 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 0/702 constraints, PredecessorRefiner: 950/950 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 950 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/701 variables, 701/701 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/701 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 2 (OVERLAPS) 1/702 variables, 201/902 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/702 variables, 1/903 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/702 variables, 15/918 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 09:35:21] [INFO ] Deduced a trap composed of 13 places in 242 ms of which 2 ms to minimize.
[2024-05-30 09:35:22] [INFO ] Deduced a trap composed of 12 places in 177 ms of which 2 ms to minimize.
[2024-05-30 09:35:22] [INFO ] Deduced a trap composed of 12 places in 177 ms of which 3 ms to minimize.
[2024-05-30 09:35:22] [INFO ] Deduced a trap composed of 7 places in 178 ms of which 3 ms to minimize.
[2024-05-30 09:35:22] [INFO ] Deduced a trap composed of 11 places in 167 ms of which 3 ms to minimize.
[2024-05-30 09:35:22] [INFO ] Deduced a trap composed of 17 places in 169 ms of which 3 ms to minimize.
[2024-05-30 09:35:23] [INFO ] Deduced a trap composed of 7 places in 166 ms of which 2 ms to minimize.
[2024-05-30 09:35:23] [INFO ] Deduced a trap composed of 12 places in 171 ms of which 3 ms to minimize.
[2024-05-30 09:35:23] [INFO ] Deduced a trap composed of 14 places in 170 ms of which 2 ms to minimize.
[2024-05-30 09:35:23] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 1 ms to minimize.
[2024-05-30 09:35:23] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 2 ms to minimize.
[2024-05-30 09:35:23] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 2 ms to minimize.
[2024-05-30 09:35:24] [INFO ] Deduced a trap composed of 13 places in 170 ms of which 2 ms to minimize.
[2024-05-30 09:35:24] [INFO ] Deduced a trap composed of 7 places in 172 ms of which 3 ms to minimize.
[2024-05-30 09:35:24] [INFO ] Deduced a trap composed of 13 places in 174 ms of which 2 ms to minimize.
[2024-05-30 09:35:24] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 2 ms to minimize.
[2024-05-30 09:35:24] [INFO ] Deduced a trap composed of 14 places in 177 ms of which 2 ms to minimize.
[2024-05-30 09:35:25] [INFO ] Deduced a trap composed of 7 places in 174 ms of which 3 ms to minimize.
[2024-05-30 09:35:25] [INFO ] Deduced a trap composed of 13 places in 175 ms of which 3 ms to minimize.
[2024-05-30 09:35:25] [INFO ] Deduced a trap composed of 14 places in 174 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/702 variables, 20/938 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 09:35:26] [INFO ] Deduced a trap composed of 7 places in 181 ms of which 3 ms to minimize.
[2024-05-30 09:35:26] [INFO ] Deduced a trap composed of 8 places in 181 ms of which 3 ms to minimize.
[2024-05-30 09:35:26] [INFO ] Deduced a trap composed of 14 places in 173 ms of which 3 ms to minimize.
[2024-05-30 09:35:26] [INFO ] Deduced a trap composed of 19 places in 174 ms of which 3 ms to minimize.
[2024-05-30 09:35:27] [INFO ] Deduced a trap composed of 14 places in 195 ms of which 3 ms to minimize.
[2024-05-30 09:35:27] [INFO ] Deduced a trap composed of 7 places in 122 ms of which 2 ms to minimize.
[2024-05-30 09:35:27] [INFO ] Deduced a trap composed of 13 places in 171 ms of which 3 ms to minimize.
[2024-05-30 09:35:27] [INFO ] Deduced a trap composed of 14 places in 148 ms of which 2 ms to minimize.
[2024-05-30 09:35:27] [INFO ] Deduced a trap composed of 13 places in 169 ms of which 2 ms to minimize.
[2024-05-30 09:35:28] [INFO ] Deduced a trap composed of 14 places in 172 ms of which 2 ms to minimize.
[2024-05-30 09:35:28] [INFO ] Deduced a trap composed of 13 places in 186 ms of which 3 ms to minimize.
[2024-05-30 09:35:28] [INFO ] Deduced a trap composed of 13 places in 165 ms of which 2 ms to minimize.
[2024-05-30 09:35:28] [INFO ] Deduced a trap composed of 7 places in 104 ms of which 1 ms to minimize.
[2024-05-30 09:35:29] [INFO ] Deduced a trap composed of 14 places in 195 ms of which 3 ms to minimize.
[2024-05-30 09:35:29] [INFO ] Deduced a trap composed of 7 places in 182 ms of which 3 ms to minimize.
[2024-05-30 09:35:29] [INFO ] Deduced a trap composed of 13 places in 169 ms of which 2 ms to minimize.
[2024-05-30 09:35:29] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 1 ms to minimize.
[2024-05-30 09:35:29] [INFO ] Deduced a trap composed of 13 places in 173 ms of which 3 ms to minimize.
[2024-05-30 09:35:30] [INFO ] Deduced a trap composed of 7 places in 167 ms of which 2 ms to minimize.
[2024-05-30 09:35:30] [INFO ] Deduced a trap composed of 14 places in 181 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/702 variables, 20/958 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 09:35:30] [INFO ] Deduced a trap composed of 14 places in 179 ms of which 3 ms to minimize.
[2024-05-30 09:35:31] [INFO ] Deduced a trap composed of 13 places in 198 ms of which 3 ms to minimize.
[2024-05-30 09:35:31] [INFO ] Deduced a trap composed of 12 places in 189 ms of which 3 ms to minimize.
[2024-05-30 09:35:31] [INFO ] Deduced a trap composed of 16 places in 191 ms of which 3 ms to minimize.
[2024-05-30 09:35:32] [INFO ] Deduced a trap composed of 17 places in 203 ms of which 3 ms to minimize.
[2024-05-30 09:35:32] [INFO ] Deduced a trap composed of 16 places in 185 ms of which 3 ms to minimize.
[2024-05-30 09:35:32] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 1 ms to minimize.
[2024-05-30 09:35:32] [INFO ] Deduced a trap composed of 7 places in 108 ms of which 4 ms to minimize.
[2024-05-30 09:35:33] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 1 ms to minimize.
[2024-05-30 09:35:33] [INFO ] Deduced a trap composed of 13 places in 207 ms of which 3 ms to minimize.
[2024-05-30 09:35:33] [INFO ] Deduced a trap composed of 14 places in 201 ms of which 2 ms to minimize.
[2024-05-30 09:35:33] [INFO ] Deduced a trap composed of 7 places in 194 ms of which 2 ms to minimize.
[2024-05-30 09:35:33] [INFO ] Deduced a trap composed of 8 places in 199 ms of which 3 ms to minimize.
[2024-05-30 09:35:34] [INFO ] Deduced a trap composed of 13 places in 125 ms of which 2 ms to minimize.
[2024-05-30 09:35:34] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 1 ms to minimize.
[2024-05-30 09:35:34] [INFO ] Deduced a trap composed of 18 places in 183 ms of which 3 ms to minimize.
[2024-05-30 09:35:34] [INFO ] Deduced a trap composed of 19 places in 188 ms of which 2 ms to minimize.
[2024-05-30 09:35:34] [INFO ] Deduced a trap composed of 12 places in 209 ms of which 2 ms to minimize.
[2024-05-30 09:35:35] [INFO ] Deduced a trap composed of 7 places in 104 ms of which 1 ms to minimize.
[2024-05-30 09:35:35] [INFO ] Deduced a trap composed of 17 places in 208 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/702 variables, 20/978 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 09:35:36] [INFO ] Deduced a trap composed of 14 places in 176 ms of which 2 ms to minimize.
[2024-05-30 09:35:36] [INFO ] Deduced a trap composed of 13 places in 175 ms of which 3 ms to minimize.
[2024-05-30 09:35:36] [INFO ] Deduced a trap composed of 14 places in 182 ms of which 3 ms to minimize.
[2024-05-30 09:35:36] [INFO ] Deduced a trap composed of 18 places in 200 ms of which 2 ms to minimize.
[2024-05-30 09:35:37] [INFO ] Deduced a trap composed of 13 places in 204 ms of which 2 ms to minimize.
[2024-05-30 09:35:37] [INFO ] Deduced a trap composed of 14 places in 206 ms of which 2 ms to minimize.
[2024-05-30 09:35:37] [INFO ] Deduced a trap composed of 13 places in 201 ms of which 3 ms to minimize.
[2024-05-30 09:35:38] [INFO ] Deduced a trap composed of 12 places in 190 ms of which 3 ms to minimize.
[2024-05-30 09:35:38] [INFO ] Deduced a trap composed of 17 places in 220 ms of which 3 ms to minimize.
[2024-05-30 09:35:38] [INFO ] Deduced a trap composed of 17 places in 177 ms of which 2 ms to minimize.
[2024-05-30 09:35:38] [INFO ] Deduced a trap composed of 12 places in 197 ms of which 3 ms to minimize.
[2024-05-30 09:35:39] [INFO ] Deduced a trap composed of 21 places in 200 ms of which 4 ms to minimize.
[2024-05-30 09:35:39] [INFO ] Deduced a trap composed of 17 places in 165 ms of which 3 ms to minimize.
[2024-05-30 09:35:39] [INFO ] Deduced a trap composed of 21 places in 196 ms of which 3 ms to minimize.
[2024-05-30 09:35:39] [INFO ] Deduced a trap composed of 17 places in 205 ms of which 12 ms to minimize.
[2024-05-30 09:35:40] [INFO ] Deduced a trap composed of 21 places in 187 ms of which 3 ms to minimize.
[2024-05-30 09:35:40] [INFO ] Deduced a trap composed of 7 places in 179 ms of which 3 ms to minimize.
[2024-05-30 09:35:40] [INFO ] Deduced a trap composed of 13 places in 218 ms of which 3 ms to minimize.
[2024-05-30 09:35:40] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 1 ms to minimize.
[2024-05-30 09:35:40] [INFO ] Deduced a trap composed of 17 places in 201 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/702 variables, 20/998 constraints. Problems are: Problem set: 0 solved, 950 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 702/1653 variables, and 998 constraints, problems are : Problem set: 0 solved, 950 unsolved in 30022 ms.
Refiners :[Domain max(s): 702/702 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 0/702 constraints, PredecessorRefiner: 0/950 constraints, Known Traps: 95/95 constraints]
After SMT, in 60347ms problems are : Problem set: 0 solved, 950 unsolved
Search for dead transitions found 0 dead transitions in 60356ms
Starting structural reductions in SI_LTL mode, iteration 1 : 702/703 places, 951/953 transitions.
Applied a total of 0 rules in 23 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61687 ms. Remains : 702/703 places, 951/953 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 152 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1), false, false]
RANDOM walk for 36870 steps (54 resets) in 376 ms. (97 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 11 factoid took 232 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1), false, false]
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1), false, false]
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1), false, false]
Product exploration explored 100000 steps with 612 reset in 487 ms.
Product exploration explored 100000 steps with 610 reset in 592 ms.
Built C files in :
/tmp/ltsmin902446211629630194
[2024-05-30 09:35:43] [INFO ] Computing symmetric may disable matrix : 951 transitions.
[2024-05-30 09:35:44] [INFO ] Computation of Complete disable matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 09:35:44] [INFO ] Computing symmetric may enable matrix : 951 transitions.
[2024-05-30 09:35:44] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 09:35:44] [INFO ] Computing Do-Not-Accords matrix : 951 transitions.
[2024-05-30 09:35:44] [INFO ] Computation of Completed DNA matrix. took 25 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 09:35:44] [INFO ] Built C files in 251ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin902446211629630194
Running compilation step : cd /tmp/ltsmin902446211629630194;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin902446211629630194;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin902446211629630194;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 6 out of 702 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 702/702 places, 951/951 transitions.
Applied a total of 0 rules in 46 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
[2024-05-30 09:35:47] [INFO ] Invariant cache hit.
[2024-05-30 09:35:47] [INFO ] Implicit Places using invariants in 370 ms returned []
[2024-05-30 09:35:47] [INFO ] Invariant cache hit.
[2024-05-30 09:35:48] [INFO ] Implicit Places using invariants and state equation in 681 ms returned []
Implicit Place search using SMT with State Equation took 1073 ms to find 0 implicit places.
[2024-05-30 09:35:48] [INFO ] Redundant transitions in 160 ms returned []
Running 950 sub problems to find dead transitions.
[2024-05-30 09:35:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/701 variables, 701/701 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/701 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 2 (OVERLAPS) 1/702 variables, 201/902 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/702 variables, 1/903 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 09:36:16] [INFO ] Deduced a trap composed of 8 places in 158 ms of which 2 ms to minimize.
[2024-05-30 09:36:16] [INFO ] Deduced a trap composed of 8 places in 175 ms of which 2 ms to minimize.
[2024-05-30 09:36:17] [INFO ] Deduced a trap composed of 7 places in 122 ms of which 2 ms to minimize.
[2024-05-30 09:36:17] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 2 ms to minimize.
[2024-05-30 09:36:17] [INFO ] Deduced a trap composed of 13 places in 178 ms of which 2 ms to minimize.
[2024-05-30 09:36:17] [INFO ] Deduced a trap composed of 7 places in 167 ms of which 3 ms to minimize.
[2024-05-30 09:36:17] [INFO ] Deduced a trap composed of 13 places in 175 ms of which 3 ms to minimize.
[2024-05-30 09:36:17] [INFO ] Deduced a trap composed of 8 places in 175 ms of which 3 ms to minimize.
[2024-05-30 09:36:18] [INFO ] Deduced a trap composed of 11 places in 174 ms of which 3 ms to minimize.
[2024-05-30 09:36:18] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 1 ms to minimize.
[2024-05-30 09:36:18] [INFO ] Deduced a trap composed of 16 places in 178 ms of which 2 ms to minimize.
[2024-05-30 09:36:18] [INFO ] Deduced a trap composed of 7 places in 173 ms of which 3 ms to minimize.
[2024-05-30 09:36:18] [INFO ] Deduced a trap composed of 13 places in 173 ms of which 7 ms to minimize.
SMT process timed out in 30355ms, After SMT, problems are : Problem set: 0 solved, 950 unsolved
Search for dead transitions found 0 dead transitions in 30364ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 31667 ms. Remains : 702/702 places, 951/951 transitions.
Built C files in :
/tmp/ltsmin16621877114471343739
[2024-05-30 09:36:18] [INFO ] Computing symmetric may disable matrix : 951 transitions.
[2024-05-30 09:36:18] [INFO ] Computation of Complete disable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 09:36:18] [INFO ] Computing symmetric may enable matrix : 951 transitions.
[2024-05-30 09:36:18] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 09:36:19] [INFO ] Computing Do-Not-Accords matrix : 951 transitions.
[2024-05-30 09:36:19] [INFO ] Computation of Completed DNA matrix. took 24 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 09:36:19] [INFO ] Built C files in 190ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16621877114471343739
Running compilation step : cd /tmp/ltsmin16621877114471343739;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16621877114471343739;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16621877114471343739;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-30 09:36:22] [INFO ] Flatten gal took : 95 ms
[2024-05-30 09:36:22] [INFO ] Flatten gal took : 103 ms
[2024-05-30 09:36:22] [INFO ] Time to serialize gal into /tmp/LTL1124803647558399897.gal : 29 ms
[2024-05-30 09:36:22] [INFO ] Time to serialize properties into /tmp/LTL5107606292128360189.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1124803647558399897.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11145235773809500152.hoa' '-atoms' '/tmp/LTL5107606292128360189.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL5107606292128360189.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11145235773809500152.hoa
Detected timeout of ITS tools.
[2024-05-30 09:36:37] [INFO ] Flatten gal took : 47 ms
[2024-05-30 09:36:37] [INFO ] Flatten gal took : 45 ms
[2024-05-30 09:36:37] [INFO ] Time to serialize gal into /tmp/LTL1027475629149271658.gal : 9 ms
[2024-05-30 09:36:37] [INFO ] Time to serialize properties into /tmp/LTL5818787335356908356.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1027475629149271658.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5818787335356908356.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((G(F("((p382==0)||(p112==1))")))||((X(F("((p382==0)||(p112==1))")))&&(F("(((p474==1)&&(p462==0))&&((p505==1)&&(p225==0)))")))))
Formula 0 simplified : FG!"((p382==0)||(p112==1))" & (XG!"((p382==0)||(p112==1))" | G!"(((p474==1)&&(p462==0))&&((p505==1)&&(p225==0)))")
Detected timeout of ITS tools.
[2024-05-30 09:36:52] [INFO ] Flatten gal took : 42 ms
[2024-05-30 09:36:52] [INFO ] Applying decomposition
[2024-05-30 09:36:52] [INFO ] Flatten gal took : 46 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12115708702477150105.txt' '-o' '/tmp/graph12115708702477150105.bin' '-w' '/tmp/graph12115708702477150105.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12115708702477150105.bin' '-l' '-1' '-v' '-w' '/tmp/graph12115708702477150105.weights' '-q' '0' '-e' '0.001'
[2024-05-30 09:36:53] [INFO ] Decomposing Gal with order
[2024-05-30 09:36:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 09:36:53] [INFO ] Removed a total of 1045 redundant transitions.
[2024-05-30 09:36:53] [INFO ] Flatten gal took : 107 ms
[2024-05-30 09:36:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 860 labels/synchronizations in 93 ms.
[2024-05-30 09:36:53] [INFO ] Time to serialize gal into /tmp/LTL2357863998757563341.gal : 11 ms
[2024-05-30 09:36:53] [INFO ] Time to serialize properties into /tmp/LTL11338416350384980988.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2357863998757563341.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11338416350384980988.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((G(F("((i9.i0.i1.u109.p382==0)||(i3.u32.p112==1))")))||((X(F("((i9.i0.i1.u109.p382==0)||(i3.u32.p112==1))")))&&(F("(((i11.u135.p474...233
Formula 0 simplified : FG!"((i9.i0.i1.u109.p382==0)||(i3.u32.p112==1))" & (XG!"((i9.i0.i1.u109.p382==0)||(i3.u32.p112==1))" | G!"(((i11.u135.p474==1)&&(i10...219
Detected timeout of ITS tools.
Treatment of property ShieldRVs-PT-050A-LTLCardinality-13 finished in 182548 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(G(p1))))'
Support contains 4 out of 703 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 701 transition count 951
Applied a total of 2 rules in 40 ms. Remains 701 /703 variables (removed 2) and now considering 951/953 (removed 2) transitions.
// Phase 1: matrix 951 rows 701 cols
[2024-05-30 09:37:08] [INFO ] Computed 201 invariants in 6 ms
[2024-05-30 09:37:08] [INFO ] Implicit Places using invariants in 333 ms returned []
[2024-05-30 09:37:08] [INFO ] Invariant cache hit.
[2024-05-30 09:37:09] [INFO ] Implicit Places using invariants and state equation in 757 ms returned []
Implicit Place search using SMT with State Equation took 1095 ms to find 0 implicit places.
[2024-05-30 09:37:09] [INFO ] Redundant transitions in 145 ms returned [299]
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 949 sub problems to find dead transitions.
// Phase 1: matrix 950 rows 701 cols
[2024-05-30 09:37:09] [INFO ] Computed 201 invariants in 6 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/701 variables, 701/701 constraints. Problems are: Problem set: 0 solved, 949 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/701 variables, 201/902 constraints. Problems are: Problem set: 0 solved, 949 unsolved
[2024-05-30 09:37:19] [INFO ] Deduced a trap composed of 7 places in 163 ms of which 11 ms to minimize.
[2024-05-30 09:37:19] [INFO ] Deduced a trap composed of 7 places in 159 ms of which 3 ms to minimize.
[2024-05-30 09:37:19] [INFO ] Deduced a trap composed of 6 places in 87 ms of which 1 ms to minimize.
[2024-05-30 09:37:20] [INFO ] Deduced a trap composed of 6 places in 88 ms of which 1 ms to minimize.
[2024-05-30 09:37:20] [INFO ] Deduced a trap composed of 12 places in 158 ms of which 2 ms to minimize.
[2024-05-30 09:37:20] [INFO ] Deduced a trap composed of 6 places in 161 ms of which 3 ms to minimize.
[2024-05-30 09:37:20] [INFO ] Deduced a trap composed of 11 places in 187 ms of which 3 ms to minimize.
[2024-05-30 09:37:20] [INFO ] Deduced a trap composed of 11 places in 169 ms of which 3 ms to minimize.
[2024-05-30 09:37:21] [INFO ] Deduced a trap composed of 6 places in 123 ms of which 2 ms to minimize.
[2024-05-30 09:37:21] [INFO ] Deduced a trap composed of 13 places in 162 ms of which 2 ms to minimize.
[2024-05-30 09:37:21] [INFO ] Deduced a trap composed of 6 places in 169 ms of which 3 ms to minimize.
[2024-05-30 09:37:21] [INFO ] Deduced a trap composed of 12 places in 160 ms of which 3 ms to minimize.
[2024-05-30 09:37:21] [INFO ] Deduced a trap composed of 6 places in 98 ms of which 1 ms to minimize.
[2024-05-30 09:37:21] [INFO ] Deduced a trap composed of 16 places in 150 ms of which 3 ms to minimize.
[2024-05-30 09:37:22] [INFO ] Deduced a trap composed of 13 places in 195 ms of which 3 ms to minimize.
[2024-05-30 09:37:22] [INFO ] Deduced a trap composed of 9 places in 175 ms of which 2 ms to minimize.
[2024-05-30 09:37:22] [INFO ] Deduced a trap composed of 16 places in 165 ms of which 3 ms to minimize.
[2024-05-30 09:37:22] [INFO ] Deduced a trap composed of 12 places in 169 ms of which 2 ms to minimize.
[2024-05-30 09:37:22] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 1 ms to minimize.
[2024-05-30 09:37:23] [INFO ] Deduced a trap composed of 20 places in 178 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/701 variables, 20/922 constraints. Problems are: Problem set: 0 solved, 949 unsolved
[2024-05-30 09:37:23] [INFO ] Deduced a trap composed of 12 places in 162 ms of which 3 ms to minimize.
[2024-05-30 09:37:23] [INFO ] Deduced a trap composed of 12 places in 163 ms of which 3 ms to minimize.
[2024-05-30 09:37:24] [INFO ] Deduced a trap composed of 12 places in 163 ms of which 2 ms to minimize.
[2024-05-30 09:37:24] [INFO ] Deduced a trap composed of 10 places in 170 ms of which 2 ms to minimize.
[2024-05-30 09:37:24] [INFO ] Deduced a trap composed of 13 places in 173 ms of which 3 ms to minimize.
[2024-05-30 09:37:24] [INFO ] Deduced a trap composed of 6 places in 162 ms of which 2 ms to minimize.
[2024-05-30 09:37:25] [INFO ] Deduced a trap composed of 11 places in 175 ms of which 3 ms to minimize.
[2024-05-30 09:37:25] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 1 ms to minimize.
[2024-05-30 09:37:25] [INFO ] Deduced a trap composed of 6 places in 112 ms of which 2 ms to minimize.
[2024-05-30 09:37:25] [INFO ] Deduced a trap composed of 6 places in 98 ms of which 2 ms to minimize.
[2024-05-30 09:37:25] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 1 ms to minimize.
[2024-05-30 09:37:25] [INFO ] Deduced a trap composed of 12 places in 183 ms of which 2 ms to minimize.
[2024-05-30 09:37:26] [INFO ] Deduced a trap composed of 13 places in 161 ms of which 2 ms to minimize.
[2024-05-30 09:37:26] [INFO ] Deduced a trap composed of 6 places in 199 ms of which 2 ms to minimize.
[2024-05-30 09:37:26] [INFO ] Deduced a trap composed of 12 places in 180 ms of which 2 ms to minimize.
[2024-05-30 09:37:26] [INFO ] Deduced a trap composed of 13 places in 169 ms of which 3 ms to minimize.
[2024-05-30 09:37:26] [INFO ] Deduced a trap composed of 6 places in 85 ms of which 1 ms to minimize.
[2024-05-30 09:37:26] [INFO ] Deduced a trap composed of 12 places in 167 ms of which 3 ms to minimize.
[2024-05-30 09:37:27] [INFO ] Deduced a trap composed of 13 places in 163 ms of which 2 ms to minimize.
[2024-05-30 09:37:27] [INFO ] Deduced a trap composed of 6 places in 170 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/701 variables, 20/942 constraints. Problems are: Problem set: 0 solved, 949 unsolved
[2024-05-30 09:37:37] [INFO ] Deduced a trap composed of 13 places in 173 ms of which 3 ms to minimize.
[2024-05-30 09:37:37] [INFO ] Deduced a trap composed of 7 places in 162 ms of which 3 ms to minimize.
[2024-05-30 09:37:37] [INFO ] Deduced a trap composed of 12 places in 159 ms of which 3 ms to minimize.
[2024-05-30 09:37:38] [INFO ] Deduced a trap composed of 12 places in 184 ms of which 3 ms to minimize.
[2024-05-30 09:37:38] [INFO ] Deduced a trap composed of 11 places in 177 ms of which 3 ms to minimize.
[2024-05-30 09:37:38] [INFO ] Deduced a trap composed of 16 places in 171 ms of which 3 ms to minimize.
[2024-05-30 09:37:38] [INFO ] Deduced a trap composed of 11 places in 182 ms of which 3 ms to minimize.
[2024-05-30 09:37:38] [INFO ] Deduced a trap composed of 6 places in 176 ms of which 3 ms to minimize.
[2024-05-30 09:37:39] [INFO ] Deduced a trap composed of 6 places in 173 ms of which 3 ms to minimize.
[2024-05-30 09:37:39] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 1 ms to minimize.
[2024-05-30 09:37:39] [INFO ] Deduced a trap composed of 6 places in 112 ms of which 2 ms to minimize.
[2024-05-30 09:37:39] [INFO ] Deduced a trap composed of 16 places in 175 ms of which 2 ms to minimize.
[2024-05-30 09:37:39] [INFO ] Deduced a trap composed of 6 places in 175 ms of which 2 ms to minimize.
[2024-05-30 09:37:40] [INFO ] Deduced a trap composed of 15 places in 181 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 701/1651 variables, and 956 constraints, problems are : Problem set: 0 solved, 949 unsolved in 30030 ms.
Refiners :[Domain max(s): 701/701 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 0/701 constraints, PredecessorRefiner: 949/949 constraints, Known Traps: 54/54 constraints]
Escalating to Integer solving :Problem set: 0 solved, 949 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/701 variables, 701/701 constraints. Problems are: Problem set: 0 solved, 949 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/701 variables, 201/902 constraints. Problems are: Problem set: 0 solved, 949 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/701 variables, 54/956 constraints. Problems are: Problem set: 0 solved, 949 unsolved
[2024-05-30 09:37:41] [INFO ] Deduced a trap composed of 13 places in 178 ms of which 2 ms to minimize.
[2024-05-30 09:37:41] [INFO ] Deduced a trap composed of 6 places in 110 ms of which 1 ms to minimize.
[2024-05-30 09:37:41] [INFO ] Deduced a trap composed of 12 places in 173 ms of which 2 ms to minimize.
[2024-05-30 09:37:42] [INFO ] Deduced a trap composed of 10 places in 187 ms of which 2 ms to minimize.
[2024-05-30 09:37:42] [INFO ] Deduced a trap composed of 11 places in 163 ms of which 2 ms to minimize.
[2024-05-30 09:37:42] [INFO ] Deduced a trap composed of 11 places in 170 ms of which 3 ms to minimize.
[2024-05-30 09:37:43] [INFO ] Deduced a trap composed of 6 places in 194 ms of which 2 ms to minimize.
[2024-05-30 09:37:43] [INFO ] Deduced a trap composed of 15 places in 185 ms of which 2 ms to minimize.
[2024-05-30 09:37:43] [INFO ] Deduced a trap composed of 16 places in 176 ms of which 2 ms to minimize.
[2024-05-30 09:37:43] [INFO ] Deduced a trap composed of 19 places in 171 ms of which 3 ms to minimize.
[2024-05-30 09:37:43] [INFO ] Deduced a trap composed of 11 places in 180 ms of which 2 ms to minimize.
[2024-05-30 09:37:44] [INFO ] Deduced a trap composed of 11 places in 166 ms of which 2 ms to minimize.
[2024-05-30 09:37:44] [INFO ] Deduced a trap composed of 15 places in 175 ms of which 3 ms to minimize.
[2024-05-30 09:37:44] [INFO ] Deduced a trap composed of 6 places in 173 ms of which 2 ms to minimize.
[2024-05-30 09:37:44] [INFO ] Deduced a trap composed of 10 places in 177 ms of which 3 ms to minimize.
[2024-05-30 09:37:44] [INFO ] Deduced a trap composed of 12 places in 161 ms of which 3 ms to minimize.
[2024-05-30 09:37:45] [INFO ] Deduced a trap composed of 11 places in 173 ms of which 2 ms to minimize.
[2024-05-30 09:37:45] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 1 ms to minimize.
[2024-05-30 09:37:45] [INFO ] Deduced a trap composed of 6 places in 119 ms of which 2 ms to minimize.
[2024-05-30 09:37:45] [INFO ] Deduced a trap composed of 12 places in 192 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/701 variables, 20/976 constraints. Problems are: Problem set: 0 solved, 949 unsolved
[2024-05-30 09:37:46] [INFO ] Deduced a trap composed of 16 places in 179 ms of which 3 ms to minimize.
[2024-05-30 09:37:46] [INFO ] Deduced a trap composed of 12 places in 212 ms of which 2 ms to minimize.
[2024-05-30 09:37:46] [INFO ] Deduced a trap composed of 21 places in 191 ms of which 3 ms to minimize.
[2024-05-30 09:37:47] [INFO ] Deduced a trap composed of 9 places in 184 ms of which 2 ms to minimize.
[2024-05-30 09:37:47] [INFO ] Deduced a trap composed of 20 places in 208 ms of which 2 ms to minimize.
[2024-05-30 09:37:47] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 1 ms to minimize.
[2024-05-30 09:37:47] [INFO ] Deduced a trap composed of 18 places in 119 ms of which 2 ms to minimize.
[2024-05-30 09:37:47] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 2 ms to minimize.
[2024-05-30 09:37:48] [INFO ] Deduced a trap composed of 6 places in 201 ms of which 2 ms to minimize.
[2024-05-30 09:37:48] [INFO ] Deduced a trap composed of 12 places in 180 ms of which 2 ms to minimize.
[2024-05-30 09:37:48] [INFO ] Deduced a trap composed of 13 places in 199 ms of which 3 ms to minimize.
[2024-05-30 09:37:49] [INFO ] Deduced a trap composed of 12 places in 189 ms of which 2 ms to minimize.
[2024-05-30 09:37:49] [INFO ] Deduced a trap composed of 12 places in 189 ms of which 2 ms to minimize.
[2024-05-30 09:37:49] [INFO ] Deduced a trap composed of 10 places in 175 ms of which 3 ms to minimize.
[2024-05-30 09:37:49] [INFO ] Deduced a trap composed of 12 places in 177 ms of which 2 ms to minimize.
[2024-05-30 09:37:49] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 2 ms to minimize.
[2024-05-30 09:37:49] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-30 09:37:50] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 2 ms to minimize.
[2024-05-30 09:37:50] [INFO ] Deduced a trap composed of 6 places in 86 ms of which 1 ms to minimize.
[2024-05-30 09:37:50] [INFO ] Deduced a trap composed of 6 places in 178 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/701 variables, 20/996 constraints. Problems are: Problem set: 0 solved, 949 unsolved
[2024-05-30 09:37:50] [INFO ] Deduced a trap composed of 13 places in 177 ms of which 2 ms to minimize.
[2024-05-30 09:37:51] [INFO ] Deduced a trap composed of 7 places in 176 ms of which 2 ms to minimize.
[2024-05-30 09:37:51] [INFO ] Deduced a trap composed of 11 places in 169 ms of which 2 ms to minimize.
[2024-05-30 09:37:51] [INFO ] Deduced a trap composed of 12 places in 160 ms of which 2 ms to minimize.
[2024-05-30 09:37:52] [INFO ] Deduced a trap composed of 13 places in 176 ms of which 3 ms to minimize.
[2024-05-30 09:37:52] [INFO ] Deduced a trap composed of 12 places in 183 ms of which 3 ms to minimize.
[2024-05-30 09:37:52] [INFO ] Deduced a trap composed of 13 places in 171 ms of which 3 ms to minimize.
[2024-05-30 09:37:52] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2024-05-30 09:37:52] [INFO ] Deduced a trap composed of 12 places in 180 ms of which 3 ms to minimize.
[2024-05-30 09:37:53] [INFO ] Deduced a trap composed of 13 places in 176 ms of which 2 ms to minimize.
[2024-05-30 09:37:53] [INFO ] Deduced a trap composed of 12 places in 181 ms of which 3 ms to minimize.
[2024-05-30 09:37:53] [INFO ] Deduced a trap composed of 13 places in 165 ms of which 3 ms to minimize.
[2024-05-30 09:37:53] [INFO ] Deduced a trap composed of 10 places in 169 ms of which 3 ms to minimize.
[2024-05-30 09:37:54] [INFO ] Deduced a trap composed of 13 places in 181 ms of which 2 ms to minimize.
[2024-05-30 09:37:54] [INFO ] Deduced a trap composed of 12 places in 185 ms of which 3 ms to minimize.
[2024-05-30 09:37:54] [INFO ] Deduced a trap composed of 12 places in 175 ms of which 3 ms to minimize.
[2024-05-30 09:37:54] [INFO ] Deduced a trap composed of 16 places in 190 ms of which 3 ms to minimize.
[2024-05-30 09:37:55] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 1 ms to minimize.
[2024-05-30 09:37:55] [INFO ] Deduced a trap composed of 12 places in 129 ms of which 2 ms to minimize.
[2024-05-30 09:37:55] [INFO ] Deduced a trap composed of 20 places in 184 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/701 variables, 20/1016 constraints. Problems are: Problem set: 0 solved, 949 unsolved
[2024-05-30 09:37:55] [INFO ] Deduced a trap composed of 11 places in 173 ms of which 2 ms to minimize.
[2024-05-30 09:37:56] [INFO ] Deduced a trap composed of 20 places in 176 ms of which 3 ms to minimize.
[2024-05-30 09:37:57] [INFO ] Deduced a trap composed of 15 places in 180 ms of which 3 ms to minimize.
[2024-05-30 09:37:57] [INFO ] Deduced a trap composed of 24 places in 180 ms of which 3 ms to minimize.
[2024-05-30 09:37:57] [INFO ] Deduced a trap composed of 20 places in 153 ms of which 2 ms to minimize.
[2024-05-30 09:37:57] [INFO ] Deduced a trap composed of 15 places in 184 ms of which 3 ms to minimize.
[2024-05-30 09:37:57] [INFO ] Deduced a trap composed of 14 places in 177 ms of which 3 ms to minimize.
[2024-05-30 09:37:58] [INFO ] Deduced a trap composed of 32 places in 181 ms of which 3 ms to minimize.
[2024-05-30 09:37:58] [INFO ] Deduced a trap composed of 27 places in 185 ms of which 3 ms to minimize.
[2024-05-30 09:37:58] [INFO ] Deduced a trap composed of 22 places in 180 ms of which 3 ms to minimize.
[2024-05-30 09:37:58] [INFO ] Deduced a trap composed of 20 places in 151 ms of which 2 ms to minimize.
[2024-05-30 09:37:58] [INFO ] Deduced a trap composed of 20 places in 146 ms of which 3 ms to minimize.
[2024-05-30 09:37:58] [INFO ] Deduced a trap composed of 20 places in 159 ms of which 3 ms to minimize.
[2024-05-30 09:37:59] [INFO ] Deduced a trap composed of 19 places in 150 ms of which 2 ms to minimize.
[2024-05-30 09:37:59] [INFO ] Deduced a trap composed of 12 places in 184 ms of which 3 ms to minimize.
[2024-05-30 09:37:59] [INFO ] Deduced a trap composed of 6 places in 125 ms of which 2 ms to minimize.
[2024-05-30 09:37:59] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 1 ms to minimize.
[2024-05-30 09:38:00] [INFO ] Deduced a trap composed of 9 places in 132 ms of which 2 ms to minimize.
[2024-05-30 09:38:00] [INFO ] Deduced a trap composed of 16 places in 183 ms of which 3 ms to minimize.
[2024-05-30 09:38:00] [INFO ] Deduced a trap composed of 12 places in 189 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/701 variables, 20/1036 constraints. Problems are: Problem set: 0 solved, 949 unsolved
[2024-05-30 09:38:01] [INFO ] Deduced a trap composed of 15 places in 175 ms of which 3 ms to minimize.
[2024-05-30 09:38:01] [INFO ] Deduced a trap composed of 16 places in 178 ms of which 3 ms to minimize.
[2024-05-30 09:38:02] [INFO ] Deduced a trap composed of 13 places in 182 ms of which 3 ms to minimize.
[2024-05-30 09:38:02] [INFO ] Deduced a trap composed of 17 places in 182 ms of which 3 ms to minimize.
[2024-05-30 09:38:03] [INFO ] Deduced a trap composed of 6 places in 185 ms of which 3 ms to minimize.
[2024-05-30 09:38:03] [INFO ] Deduced a trap composed of 12 places in 191 ms of which 3 ms to minimize.
[2024-05-30 09:38:03] [INFO ] Deduced a trap composed of 24 places in 185 ms of which 3 ms to minimize.
[2024-05-30 09:38:03] [INFO ] Deduced a trap composed of 16 places in 132 ms of which 2 ms to minimize.
[2024-05-30 09:38:03] [INFO ] Deduced a trap composed of 13 places in 183 ms of which 3 ms to minimize.
[2024-05-30 09:38:04] [INFO ] Deduced a trap composed of 30 places in 183 ms of which 3 ms to minimize.
[2024-05-30 09:38:04] [INFO ] Deduced a trap composed of 19 places in 184 ms of which 3 ms to minimize.
[2024-05-30 09:38:04] [INFO ] Deduced a trap composed of 21 places in 185 ms of which 3 ms to minimize.
[2024-05-30 09:38:04] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 2 ms to minimize.
[2024-05-30 09:38:04] [INFO ] Deduced a trap composed of 17 places in 128 ms of which 2 ms to minimize.
[2024-05-30 09:38:04] [INFO ] Deduced a trap composed of 17 places in 186 ms of which 2 ms to minimize.
[2024-05-30 09:38:05] [INFO ] Deduced a trap composed of 11 places in 191 ms of which 3 ms to minimize.
[2024-05-30 09:38:05] [INFO ] Deduced a trap composed of 6 places in 190 ms of which 3 ms to minimize.
[2024-05-30 09:38:05] [INFO ] Deduced a trap composed of 11 places in 186 ms of which 3 ms to minimize.
[2024-05-30 09:38:05] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 1 ms to minimize.
[2024-05-30 09:38:05] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/701 variables, 20/1056 constraints. Problems are: Problem set: 0 solved, 949 unsolved
[2024-05-30 09:38:06] [INFO ] Deduced a trap composed of 12 places in 176 ms of which 2 ms to minimize.
[2024-05-30 09:38:06] [INFO ] Deduced a trap composed of 17 places in 170 ms of which 2 ms to minimize.
[2024-05-30 09:38:07] [INFO ] Deduced a trap composed of 11 places in 182 ms of which 2 ms to minimize.
[2024-05-30 09:38:07] [INFO ] Deduced a trap composed of 12 places in 177 ms of which 2 ms to minimize.
[2024-05-30 09:38:07] [INFO ] Deduced a trap composed of 16 places in 167 ms of which 3 ms to minimize.
[2024-05-30 09:38:08] [INFO ] Deduced a trap composed of 16 places in 171 ms of which 3 ms to minimize.
[2024-05-30 09:38:08] [INFO ] Deduced a trap composed of 20 places in 179 ms of which 3 ms to minimize.
[2024-05-30 09:38:08] [INFO ] Deduced a trap composed of 16 places in 178 ms of which 3 ms to minimize.
[2024-05-30 09:38:08] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 3 ms to minimize.
[2024-05-30 09:38:09] [INFO ] Deduced a trap composed of 6 places in 186 ms of which 3 ms to minimize.
[2024-05-30 09:38:09] [INFO ] Deduced a trap composed of 20 places in 183 ms of which 2 ms to minimize.
[2024-05-30 09:38:09] [INFO ] Deduced a trap composed of 11 places in 180 ms of which 3 ms to minimize.
[2024-05-30 09:38:09] [INFO ] Deduced a trap composed of 12 places in 177 ms of which 2 ms to minimize.
[2024-05-30 09:38:10] [INFO ] Deduced a trap composed of 11 places in 166 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 701/1651 variables, and 1070 constraints, problems are : Problem set: 0 solved, 949 unsolved in 30021 ms.
Refiners :[Domain max(s): 701/701 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 0/701 constraints, PredecessorRefiner: 0/949 constraints, Known Traps: 168/168 constraints]
After SMT, in 60303ms problems are : Problem set: 0 solved, 949 unsolved
Search for dead transitions found 0 dead transitions in 60311ms
Starting structural reductions in SI_LTL mode, iteration 1 : 701/703 places, 950/953 transitions.
Applied a total of 0 rules in 18 ms. Remains 701 /701 variables (removed 0) and now considering 950/950 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61623 ms. Remains : 701/703 places, 950/953 transitions.
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldRVs-PT-050A-LTLCardinality-14
Stuttering criterion allowed to conclude after 56575 steps with 97 reset in 279 ms.
FORMULA ShieldRVs-PT-050A-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050A-LTLCardinality-14 finished in 62063 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(F(p0))&&F(!p1))||G(F(p0))))'
Found a Shortening insensitive property : ShieldRVs-PT-050A-LTLCardinality-13
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Support contains 6 out of 703 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 703/703 places, 953/953 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 702 transition count 952
Applied a total of 2 rules in 35 ms. Remains 702 /703 variables (removed 1) and now considering 952/953 (removed 1) transitions.
// Phase 1: matrix 952 rows 702 cols
[2024-05-30 09:38:10] [INFO ] Computed 201 invariants in 8 ms
[2024-05-30 09:38:11] [INFO ] Implicit Places using invariants in 326 ms returned []
[2024-05-30 09:38:11] [INFO ] Invariant cache hit.
[2024-05-30 09:38:12] [INFO ] Implicit Places using invariants and state equation in 727 ms returned []
Implicit Place search using SMT with State Equation took 1054 ms to find 0 implicit places.
Running 951 sub problems to find dead transitions.
[2024-05-30 09:38:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/701 variables, 701/701 constraints. Problems are: Problem set: 0 solved, 951 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/701 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 951 unsolved
At refinement iteration 2 (OVERLAPS) 1/702 variables, 201/902 constraints. Problems are: Problem set: 0 solved, 951 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/702 variables, 1/903 constraints. Problems are: Problem set: 0 solved, 951 unsolved
[2024-05-30 09:38:40] [INFO ] Deduced a trap composed of 8 places in 187 ms of which 3 ms to minimize.
[2024-05-30 09:38:40] [INFO ] Deduced a trap composed of 8 places in 169 ms of which 2 ms to minimize.
[2024-05-30 09:38:40] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 1 ms to minimize.
[2024-05-30 09:38:40] [INFO ] Deduced a trap composed of 13 places in 172 ms of which 2 ms to minimize.
[2024-05-30 09:38:40] [INFO ] Deduced a trap composed of 7 places in 178 ms of which 2 ms to minimize.
[2024-05-30 09:38:41] [INFO ] Deduced a trap composed of 13 places in 170 ms of which 3 ms to minimize.
[2024-05-30 09:38:41] [INFO ] Deduced a trap composed of 8 places in 169 ms of which 2 ms to minimize.
[2024-05-30 09:38:41] [INFO ] Deduced a trap composed of 11 places in 164 ms of which 3 ms to minimize.
[2024-05-30 09:38:41] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 1 ms to minimize.
[2024-05-30 09:38:41] [INFO ] Deduced a trap composed of 13 places in 169 ms of which 3 ms to minimize.
[2024-05-30 09:38:42] [INFO ] Deduced a trap composed of 14 places in 167 ms of which 3 ms to minimize.
[2024-05-30 09:38:42] [INFO ] Deduced a trap composed of 13 places in 167 ms of which 3 ms to minimize.
[2024-05-30 09:38:42] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 2 ms to minimize.
SMT process timed out in 30342ms, After SMT, problems are : Problem set: 0 solved, 951 unsolved
Search for dead transitions found 0 dead transitions in 30352ms
Starting structural reductions in LI_LTL mode, iteration 1 : 702/703 places, 952/953 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 31445 ms. Remains : 702/703 places, 952/953 transitions.
Running random walk in product with property : ShieldRVs-PT-050A-LTLCardinality-13
Product exploration explored 100000 steps with 1144 reset in 527 ms.
Product exploration explored 100000 steps with 1196 reset in 659 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) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 109 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 219 ms :[(AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1), false, false]
RANDOM walk for 40000 steps (57 resets) in 353 ms. (112 steps per ms) remains 1/5 properties
BEST_FIRST walk for 8505 steps (0 resets) in 39 ms. (212 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 7 factoid took 209 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 205 ms :[(AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1), false, false]
Stuttering acceptance computed with spot in 218 ms :[(AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1), false, false]
Support contains 6 out of 702 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 702/702 places, 952/952 transitions.
Applied a total of 0 rules in 18 ms. Remains 702 /702 variables (removed 0) and now considering 952/952 (removed 0) transitions.
[2024-05-30 09:38:44] [INFO ] Invariant cache hit.
[2024-05-30 09:38:45] [INFO ] Implicit Places using invariants in 324 ms returned []
[2024-05-30 09:38:45] [INFO ] Invariant cache hit.
[2024-05-30 09:38:45] [INFO ] Implicit Places using invariants and state equation in 727 ms returned []
Implicit Place search using SMT with State Equation took 1052 ms to find 0 implicit places.
[2024-05-30 09:38:45] [INFO ] Redundant transitions in 154 ms returned [300]
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 950 sub problems to find dead transitions.
// Phase 1: matrix 951 rows 702 cols
[2024-05-30 09:38:45] [INFO ] Computed 201 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/701 variables, 701/701 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/701 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 2 (OVERLAPS) 1/702 variables, 201/902 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/702 variables, 1/903 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 09:39:14] [INFO ] Deduced a trap composed of 8 places in 168 ms of which 3 ms to minimize.
[2024-05-30 09:39:14] [INFO ] Deduced a trap composed of 8 places in 164 ms of which 3 ms to minimize.
[2024-05-30 09:39:14] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 2 ms to minimize.
[2024-05-30 09:39:14] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 2 ms to minimize.
[2024-05-30 09:39:14] [INFO ] Deduced a trap composed of 13 places in 175 ms of which 3 ms to minimize.
[2024-05-30 09:39:15] [INFO ] Deduced a trap composed of 7 places in 169 ms of which 3 ms to minimize.
[2024-05-30 09:39:15] [INFO ] Deduced a trap composed of 13 places in 176 ms of which 3 ms to minimize.
[2024-05-30 09:39:15] [INFO ] Deduced a trap composed of 8 places in 167 ms of which 2 ms to minimize.
[2024-05-30 09:39:15] [INFO ] Deduced a trap composed of 11 places in 166 ms of which 2 ms to minimize.
[2024-05-30 09:39:15] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 1 ms to minimize.
[2024-05-30 09:39:16] [INFO ] Deduced a trap composed of 16 places in 178 ms of which 3 ms to minimize.
[2024-05-30 09:39:16] [INFO ] Deduced a trap composed of 7 places in 180 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 702/1653 variables, and 915 constraints, problems are : Problem set: 0 solved, 950 unsolved in 30020 ms.
Refiners :[Domain max(s): 702/702 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 0/702 constraints, PredecessorRefiner: 950/950 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 950 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/701 variables, 701/701 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/701 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 2 (OVERLAPS) 1/702 variables, 201/902 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/702 variables, 1/903 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/702 variables, 12/915 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 09:39:26] [INFO ] Deduced a trap composed of 13 places in 181 ms of which 3 ms to minimize.
[2024-05-30 09:39:26] [INFO ] Deduced a trap composed of 14 places in 171 ms of which 3 ms to minimize.
[2024-05-30 09:39:27] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 2 ms to minimize.
[2024-05-30 09:39:27] [INFO ] Deduced a trap composed of 14 places in 179 ms of which 3 ms to minimize.
[2024-05-30 09:39:27] [INFO ] Deduced a trap composed of 7 places in 167 ms of which 3 ms to minimize.
[2024-05-30 09:39:27] [INFO ] Deduced a trap composed of 14 places in 172 ms of which 3 ms to minimize.
[2024-05-30 09:39:27] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 1 ms to minimize.
[2024-05-30 09:39:28] [INFO ] Deduced a trap composed of 14 places in 181 ms of which 3 ms to minimize.
[2024-05-30 09:39:28] [INFO ] Deduced a trap composed of 7 places in 182 ms of which 3 ms to minimize.
[2024-05-30 09:39:28] [INFO ] Deduced a trap composed of 13 places in 180 ms of which 2 ms to minimize.
[2024-05-30 09:39:28] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 1 ms to minimize.
[2024-05-30 09:39:28] [INFO ] Deduced a trap composed of 14 places in 180 ms of which 3 ms to minimize.
[2024-05-30 09:39:29] [INFO ] Deduced a trap composed of 7 places in 178 ms of which 2 ms to minimize.
[2024-05-30 09:39:29] [INFO ] Deduced a trap composed of 14 places in 178 ms of which 3 ms to minimize.
[2024-05-30 09:39:29] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 1 ms to minimize.
[2024-05-30 09:39:29] [INFO ] Deduced a trap composed of 13 places in 178 ms of which 3 ms to minimize.
[2024-05-30 09:39:29] [INFO ] Deduced a trap composed of 7 places in 181 ms of which 3 ms to minimize.
[2024-05-30 09:39:30] [INFO ] Deduced a trap composed of 13 places in 180 ms of which 6 ms to minimize.
[2024-05-30 09:39:30] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 1 ms to minimize.
[2024-05-30 09:39:30] [INFO ] Deduced a trap composed of 17 places in 183 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/702 variables, 20/935 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 09:39:30] [INFO ] Deduced a trap composed of 8 places in 171 ms of which 3 ms to minimize.
[2024-05-30 09:39:30] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 2 ms to minimize.
[2024-05-30 09:39:31] [INFO ] Deduced a trap composed of 12 places in 182 ms of which 3 ms to minimize.
[2024-05-30 09:39:31] [INFO ] Deduced a trap composed of 18 places in 184 ms of which 3 ms to minimize.
[2024-05-30 09:39:32] [INFO ] Deduced a trap composed of 13 places in 169 ms of which 3 ms to minimize.
[2024-05-30 09:39:32] [INFO ] Deduced a trap composed of 17 places in 180 ms of which 2 ms to minimize.
[2024-05-30 09:39:32] [INFO ] Deduced a trap composed of 7 places in 176 ms of which 3 ms to minimize.
[2024-05-30 09:39:32] [INFO ] Deduced a trap composed of 21 places in 182 ms of which 2 ms to minimize.
[2024-05-30 09:39:32] [INFO ] Deduced a trap composed of 14 places in 183 ms of which 2 ms to minimize.
[2024-05-30 09:39:33] [INFO ] Deduced a trap composed of 8 places in 167 ms of which 2 ms to minimize.
[2024-05-30 09:39:33] [INFO ] Deduced a trap composed of 12 places in 184 ms of which 2 ms to minimize.
[2024-05-30 09:39:33] [INFO ] Deduced a trap composed of 25 places in 180 ms of which 3 ms to minimize.
[2024-05-30 09:39:33] [INFO ] Deduced a trap composed of 7 places in 175 ms of which 2 ms to minimize.
[2024-05-30 09:39:33] [INFO ] Deduced a trap composed of 19 places in 182 ms of which 3 ms to minimize.
[2024-05-30 09:39:34] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 1 ms to minimize.
[2024-05-30 09:39:34] [INFO ] Deduced a trap composed of 14 places in 185 ms of which 2 ms to minimize.
[2024-05-30 09:39:34] [INFO ] Deduced a trap composed of 7 places in 179 ms of which 3 ms to minimize.
[2024-05-30 09:39:34] [INFO ] Deduced a trap composed of 13 places in 182 ms of which 3 ms to minimize.
[2024-05-30 09:39:34] [INFO ] Deduced a trap composed of 13 places in 182 ms of which 3 ms to minimize.
[2024-05-30 09:39:35] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/702 variables, 20/955 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 09:39:35] [INFO ] Deduced a trap composed of 14 places in 178 ms of which 3 ms to minimize.
[2024-05-30 09:39:35] [INFO ] Deduced a trap composed of 12 places in 179 ms of which 3 ms to minimize.
[2024-05-30 09:39:36] [INFO ] Deduced a trap composed of 13 places in 164 ms of which 3 ms to minimize.
[2024-05-30 09:39:36] [INFO ] Deduced a trap composed of 17 places in 184 ms of which 3 ms to minimize.
[2024-05-30 09:39:36] [INFO ] Deduced a trap composed of 13 places in 169 ms of which 2 ms to minimize.
[2024-05-30 09:39:36] [INFO ] Deduced a trap composed of 14 places in 181 ms of which 2 ms to minimize.
[2024-05-30 09:39:37] [INFO ] Deduced a trap composed of 12 places in 108 ms of which 2 ms to minimize.
[2024-05-30 09:39:37] [INFO ] Deduced a trap composed of 18 places in 112 ms of which 2 ms to minimize.
[2024-05-30 09:39:37] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 1 ms to minimize.
[2024-05-30 09:39:37] [INFO ] Deduced a trap composed of 13 places in 187 ms of which 3 ms to minimize.
[2024-05-30 09:39:37] [INFO ] Deduced a trap composed of 14 places in 174 ms of which 2 ms to minimize.
[2024-05-30 09:39:38] [INFO ] Deduced a trap composed of 8 places in 169 ms of which 3 ms to minimize.
[2024-05-30 09:39:38] [INFO ] Deduced a trap composed of 13 places in 166 ms of which 2 ms to minimize.
[2024-05-30 09:39:38] [INFO ] Deduced a trap composed of 14 places in 181 ms of which 3 ms to minimize.
[2024-05-30 09:39:38] [INFO ] Deduced a trap composed of 7 places in 177 ms of which 2 ms to minimize.
[2024-05-30 09:39:38] [INFO ] Deduced a trap composed of 14 places in 179 ms of which 3 ms to minimize.
[2024-05-30 09:39:39] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 2 ms to minimize.
[2024-05-30 09:39:39] [INFO ] Deduced a trap composed of 13 places in 167 ms of which 2 ms to minimize.
[2024-05-30 09:39:39] [INFO ] Deduced a trap composed of 7 places in 186 ms of which 3 ms to minimize.
[2024-05-30 09:39:39] [INFO ] Deduced a trap composed of 13 places in 185 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/702 variables, 20/975 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 09:39:40] [INFO ] Deduced a trap composed of 14 places in 166 ms of which 2 ms to minimize.
[2024-05-30 09:39:40] [INFO ] Deduced a trap composed of 13 places in 174 ms of which 3 ms to minimize.
[2024-05-30 09:39:41] [INFO ] Deduced a trap composed of 14 places in 180 ms of which 2 ms to minimize.
[2024-05-30 09:39:41] [INFO ] Deduced a trap composed of 12 places in 172 ms of which 3 ms to minimize.
[2024-05-30 09:39:41] [INFO ] Deduced a trap composed of 13 places in 181 ms of which 2 ms to minimize.
[2024-05-30 09:39:41] [INFO ] Deduced a trap composed of 14 places in 175 ms of which 3 ms to minimize.
[2024-05-30 09:39:41] [INFO ] Deduced a trap composed of 14 places in 178 ms of which 3 ms to minimize.
[2024-05-30 09:39:42] [INFO ] Deduced a trap composed of 15 places in 176 ms of which 2 ms to minimize.
[2024-05-30 09:39:42] [INFO ] Deduced a trap composed of 15 places in 174 ms of which 3 ms to minimize.
[2024-05-30 09:39:42] [INFO ] Deduced a trap composed of 13 places in 179 ms of which 3 ms to minimize.
[2024-05-30 09:39:42] [INFO ] Deduced a trap composed of 13 places in 182 ms of which 2 ms to minimize.
[2024-05-30 09:39:43] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 2 ms to minimize.
[2024-05-30 09:39:43] [INFO ] Deduced a trap composed of 13 places in 190 ms of which 3 ms to minimize.
[2024-05-30 09:39:43] [INFO ] Deduced a trap composed of 14 places in 187 ms of which 3 ms to minimize.
[2024-05-30 09:39:43] [INFO ] Deduced a trap composed of 14 places in 191 ms of which 3 ms to minimize.
[2024-05-30 09:39:44] [INFO ] Deduced a trap composed of 13 places in 184 ms of which 3 ms to minimize.
[2024-05-30 09:39:44] [INFO ] Deduced a trap composed of 13 places in 183 ms of which 3 ms to minimize.
[2024-05-30 09:39:44] [INFO ] Deduced a trap composed of 15 places in 182 ms of which 3 ms to minimize.
[2024-05-30 09:39:44] [INFO ] Deduced a trap composed of 7 places in 183 ms of which 3 ms to minimize.
[2024-05-30 09:39:44] [INFO ] Deduced a trap composed of 17 places in 185 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/702 variables, 20/995 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 09:39:45] [INFO ] Deduced a trap composed of 13 places in 158 ms of which 3 ms to minimize.
[2024-05-30 09:39:45] [INFO ] Deduced a trap composed of 18 places in 166 ms of which 2 ms to minimize.
[2024-05-30 09:39:46] [INFO ] Deduced a trap composed of 13 places in 177 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 1)
(s3 0)
(s4 1)
(s5 0)
(s6 0)
(s7 0)
(s8 1)
(s9 0)
(s10 0)
(s11 1)
(s12 0)
(s13 0)
(s14 0)
(s15 1)
(s16 0)
(s17 0)
(s18 0)
(s19 1)
(s20 0)
(s21 1)
(s22 0)
(s23 0)
(s24 0)
(s25 1)
(s26 0)
(s27 0)
(s28 0)
(s29 1)
(s30 0)
(s31 0)
(s32 1)
(s33 0)
(s34 0)
(s35 0)
(s36 1)
(s37 0)
(s38 0)
(s39 1)
(s40 0)
(s41 0)
(s42 0)
(s43 1)
(s44 0)
(s45 0)
(s46 0)
(s47 1)
(s48 0)
(s49 1)
(s50 0)
(s51 0)
(s52 0)
(s53 1)
(s54 0)
(s55 0)
(s56 0)
(s57 1)
(s58 0)
(s59 0)
(s60 0)
(s61 1)
(s62 0)
(s63 1)
(s64 0)
(s65 0)
(s66 0)
(s67 1)
(s68 0)
(s69 0)
(s70 0)
(s71 1)
(s72 0)
(s73 0)
(s74 1)
(s75 0)
(s76 0)
(s77 0)
(s78 1)
(s79 0)
(s80 1)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 1)
(s86 0)
(s87 0)
(s88 0)
(s89 1)
(s90 0)
(s91 0)
(s92 1)
(s93 0)
(s94 1)
(s95 0)
(s96 0)
(s97 1)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 1)
(s104 0)
(s105 0)
(s106 1)
(s107 0)
(s108 0)
(s109 0)
(s110 1)
(s111 1)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 1)
(s118 0)
(s119 0)
(s120 1)
(s121 0)
(s122 0)
(s123 0)
(s124 1)
(s125 1)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 1)
(s132 0)
(s133 0)
(s134 1)
(s135 0)
(s136 0)
(s137 0)
(s138 1)
(s139 1)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 1)
(s146 0)
(s147 0)
(s148 1)
(s149 0)
(s150 0)
(s151 0)
(s152 1)
(s153 1)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 1)
(s160 0)
(s161 0)
(s162 1)
(s163 0)
(s164 0)
(s165 0)
(s166 1)
(s167 1)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 1)
(s174 0)
(s175 0)
(s176 1)
(s177 0)
(s178 0)
(s179 0)
(s180 1)
(s181 1)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 1)
(s188 0)
(s189 0)
(s190 1)
(s191 0)
(s192 0)
(s193 0)
(s194 1)
(s195 1)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 1)
(s202 0)
(s203 0)
(s204 1)
(s205 0)
(s206 0)
(s207 0)
(s208 1)
(s209 1)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 1)
(s216 0)
(s217 0)
(s218 1)
(s219 0)
(s220 0)
(s221 0)
(s222 1)
(s223 1)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 1)
(s230 0)
(s231 0)
(s232 1)
(s233 0)
(s234 0)
(s235 0)
(s236 1)
(s237 1)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 1)
(s244 0)
(s245 0)
(s246 1)
(s247 0)
(s248 0)
(s249 0)
(s250 1)
(s251 1)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 1)
(s258 0)
(s259 0)
(s260 1)
(s261 0)
(s262 0)
(s263 0)
(s264 1)
(s265 1)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 1)
(s272 0)
(s273 0)
(s274 1)
(s275 0)
(s276 0)
(s277 0)
(s278 1)
(s279 1)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 1)
(s286 0)
(s287 0)
(s288 1)
(s289 0)
(s290 0)
(s291 0)
(s292 1)
(s293 1)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 1)
(s300 0)
(s301 0)
(s302 1)
(s303 0)
(s304 0)
(s305 0)
(s306 1)
(s307 1)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 1)
(s314 0)
(s315 0)
(s316 1)
(s317 0)
(s318 0)
(s319 0)
(s320 1)
(s321 1)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 1)
(s328 0)
(s329 0)
(s330 1)
(s331 0)
(s332 0)
(s333 0)
(s334 1)
(s335 1)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 1)
(s342 0)
(s343 0)
(s344 1)
(s345 0)
(s346 0)
(s347 0)
(s348 1)
(s349 1)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 1)
(s356 0)
(s357 0)
(s358 1)
(s359 0)
(s360 0)
(s361 0)
(s362 1)
(s363 1)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 1)
(s370 0)
(s371 0)
(s372 1)
(s373 0)
(s374 0)
(s375 0)
(s376 1)
(s377 1)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 1)
(s384 0)
(s385 0)
(s386 1)
(s387 0)
(s388 0)
(s389 0)
(s390 1)
(s391 1)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 1)
(s398 0)
(s399 0)
(s400 1)
(s401 0)
(s402 0)
(s403 0)
(s404 1)
(s405 1)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 1)
(s412 0)
(s413 0)
(s414 1)
(s415 0)
(s416 0)
(s417 0)
(s418 1)
(s419 1)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 1)
(s426 0)
(s427 0)
(s428 1)
(s429 0)
(s430 0)
(s431 0)
(s432 1)
(s433 1)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 1)
(s440 0)
(s441 0)
(s442 1)
(s443 0)
(s444 0)
(s445 0)
(s446 1)
(s447 1)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 1)
(s454 0)
(s455 0)
(s456 1)
(s457 0)
(s458 0)
(s459 0)
(s460 1)
(s461 1)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 1)
(s468 0)
(s469 0)
(s470 1)
(s471 0)
(s472 0)
(s473 0)
(s474 1)
(s475 1)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 1)
(s482 0)
(s483 0)
(s484 1)
(s485 0)
(s486 0)
(s487 0)
(s488 1)
(s489 1)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s494 0)
(s495 1)
(s496 0)
(s497 0)
(s498 1)
(s499 0)
(s500 0)
(s501 0)
(s502 1)
(s503 1)
(s504 0)
(s505 0)
(s506 0)
(s507 0)
(s508 0)
(s509 1)
(s510 0)
(s511 0)
(s512 1)
(s513 0)
(s514 0)
(s515 0)
(s516 1)
(s517 1)
(s518 0)
(s519 0)
(s520 0)
(s521 0)
(s522 0)
(s523 1)
(s524 0)
(s525 0)
(s526 1)
(s527 0)
(s528 0)
(s529 0)
(s530 1)
(s531 1)
(s532 0)
(s533 0)
(s534 0)
(s535 0)
(s536 0)
(s537 1)
(s538 0)
(s539 0)
(s540 1)
(s541 0)
(s542 0)
(s543 0)
(s544 1)
(s545 1)
(s546 0)
(s547 0)
(s548 0)
(s549 0)
(s550 0)
(s551 1)
(s552 0)
(s553 0)
(s554 1)
(s555 0)
(s556 0)
(s557 0)
(s558 1)
(s559 1)
(s560 0)
(s561 0)
(s562 0)
(s563 0)
(s564 0)
(s565 1)
(s566 0)
(s567 0)
(s568 1)
(s569 0)
(s570 0)
(s571 0)
(s572 1)
(s573 1)
(s574 0)
(s575 0)
(s576 0)
(s577 0)
(s578 0)
(s579 1)
(s580 0)
(s581 0)
(s582 1)
(s583 0)
(s584 0)
(s585 0)
(s586 1)
(s587 1)
(s588 0)
(s589 0)
(s590 0)
(s591 0)
(s592 0)
(s593 1)
(s594 0)
(s595 0)
(s596 1)
(s597 0)
(s598 0)
(s599 0)
(s600 1)
(s601 1)
(s602 0)
(s603 0)
(s604 0)
(s605 0)
(s606 0)
(s607 1)
(s608 0)
(s609 0)
(s610 1)
(s611 0)
(s612 0)
(s613 0)
(s614 1)
(s615 1)
(s616 0)
(s617 0)
(s618 0)
(s619 0)
(s620 0)
(s621 1)
(s622 0)
(s623 0)
(s624 1)
(s625 0)
(s626 0)
(s627 0)
(s628 1)
(s629 timeout
1 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 702/1653 variables, and 998 constraints, problems are : Problem set: 0 solved, 950 unsolved in 30027 ms.
Refiners :[Domain max(s): 702/702 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 0/702 constraints, PredecessorRefiner: 0/950 constraints, Known Traps: 95/95 constraints]
After SMT, in 60342ms problems are : Problem set: 0 solved, 950 unsolved
Search for dead transitions found 0 dead transitions in 60350ms
Starting structural reductions in SI_LTL mode, iteration 1 : 702/702 places, 951/952 transitions.
Applied a total of 0 rules in 17 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61599 ms. Remains : 702/702 places, 951/952 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 123 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1), false, false]
RANDOM walk for 40000 steps (58 resets) in 280 ms. (142 steps per ms) remains 1/5 properties
BEST_FIRST walk for 8336 steps (0 resets) in 42 ms. (193 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 11 factoid took 265 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1), false, false]
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1), false, false]
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1), false, false]
Product exploration explored 100000 steps with 613 reset in 500 ms.
Product exploration explored 100000 steps with 610 reset in 581 ms.
Built C files in :
/tmp/ltsmin12442589364237515027
[2024-05-30 09:39:48] [INFO ] Computing symmetric may disable matrix : 951 transitions.
[2024-05-30 09:39:48] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 09:39:48] [INFO ] Computing symmetric may enable matrix : 951 transitions.
[2024-05-30 09:39:48] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 09:39:48] [INFO ] Computing Do-Not-Accords matrix : 951 transitions.
[2024-05-30 09:39:48] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 09:39:48] [INFO ] Built C files in 163ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12442589364237515027
Running compilation step : cd /tmp/ltsmin12442589364237515027;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12442589364237515027;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12442589364237515027;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 6 out of 702 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 702/702 places, 951/951 transitions.
Applied a total of 0 rules in 17 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
[2024-05-30 09:39:51] [INFO ] Invariant cache hit.
[2024-05-30 09:39:52] [INFO ] Implicit Places using invariants in 325 ms returned []
[2024-05-30 09:39:52] [INFO ] Invariant cache hit.
[2024-05-30 09:39:52] [INFO ] Implicit Places using invariants and state equation in 740 ms returned []
Implicit Place search using SMT with State Equation took 1067 ms to find 0 implicit places.
[2024-05-30 09:39:53] [INFO ] Redundant transitions in 164 ms returned []
Running 950 sub problems to find dead transitions.
[2024-05-30 09:39:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/701 variables, 701/701 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/701 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 2 (OVERLAPS) 1/702 variables, 201/902 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/702 variables, 1/903 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 09:40:21] [INFO ] Deduced a trap composed of 8 places in 165 ms of which 2 ms to minimize.
[2024-05-30 09:40:21] [INFO ] Deduced a trap composed of 8 places in 185 ms of which 3 ms to minimize.
[2024-05-30 09:40:21] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 2 ms to minimize.
[2024-05-30 09:40:21] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 2 ms to minimize.
[2024-05-30 09:40:22] [INFO ] Deduced a trap composed of 13 places in 182 ms of which 2 ms to minimize.
[2024-05-30 09:40:22] [INFO ] Deduced a trap composed of 7 places in 175 ms of which 2 ms to minimize.
[2024-05-30 09:40:22] [INFO ] Deduced a trap composed of 13 places in 177 ms of which 3 ms to minimize.
[2024-05-30 09:40:22] [INFO ] Deduced a trap composed of 8 places in 178 ms of which 3 ms to minimize.
[2024-05-30 09:40:22] [INFO ] Deduced a trap composed of 11 places in 162 ms of which 3 ms to minimize.
[2024-05-30 09:40:22] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 1 ms to minimize.
[2024-05-30 09:40:23] [INFO ] Deduced a trap composed of 16 places in 181 ms of which 3 ms to minimize.
[2024-05-30 09:40:23] [INFO ] Deduced a trap composed of 7 places in 175 ms of which 2 ms to minimize.
[2024-05-30 09:40:23] [INFO ] Deduced a trap composed of 13 places in 174 ms of which 3 ms to minimize.
SMT process timed out in 30456ms, After SMT, problems are : Problem set: 0 solved, 950 unsolved
Search for dead transitions found 0 dead transitions in 30466ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 31722 ms. Remains : 702/702 places, 951/951 transitions.
Built C files in :
/tmp/ltsmin10459330263596429482
[2024-05-30 09:40:23] [INFO ] Computing symmetric may disable matrix : 951 transitions.
[2024-05-30 09:40:23] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 09:40:23] [INFO ] Computing symmetric may enable matrix : 951 transitions.
[2024-05-30 09:40:23] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 09:40:23] [INFO ] Computing Do-Not-Accords matrix : 951 transitions.
[2024-05-30 09:40:23] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 09:40:23] [INFO ] Built C files in 164ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10459330263596429482
Running compilation step : cd /tmp/ltsmin10459330263596429482;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10459330263596429482;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10459330263596429482;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-30 09:40:26] [INFO ] Flatten gal took : 39 ms
[2024-05-30 09:40:26] [INFO ] Flatten gal took : 37 ms
[2024-05-30 09:40:26] [INFO ] Time to serialize gal into /tmp/LTL5526539227859541595.gal : 6 ms
[2024-05-30 09:40:27] [INFO ] Time to serialize properties into /tmp/LTL2020914930587682239.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5526539227859541595.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13418241445072308246.hoa' '-atoms' '/tmp/LTL2020914930587682239.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL2020914930587682239.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13418241445072308246.hoa
Detected timeout of ITS tools.
[2024-05-30 09:40:42] [INFO ] Flatten gal took : 40 ms
[2024-05-30 09:40:42] [INFO ] Flatten gal took : 36 ms
[2024-05-30 09:40:42] [INFO ] Time to serialize gal into /tmp/LTL623887430451533800.gal : 6 ms
[2024-05-30 09:40:42] [INFO ] Time to serialize properties into /tmp/LTL14817537153583354643.ltl : 17 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL623887430451533800.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14817537153583354643.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((G(F("((p382==0)||(p112==1))")))||((X(F("((p382==0)||(p112==1))")))&&(F("(((p474==1)&&(p462==0))&&((p505==1)&&(p225==0)))")))))
Formula 0 simplified : FG!"((p382==0)||(p112==1))" & (XG!"((p382==0)||(p112==1))" | G!"(((p474==1)&&(p462==0))&&((p505==1)&&(p225==0)))")
Detected timeout of ITS tools.
[2024-05-30 09:40:57] [INFO ] Flatten gal took : 36 ms
[2024-05-30 09:40:57] [INFO ] Applying decomposition
[2024-05-30 09:40:57] [INFO ] Flatten gal took : 38 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3431695098908286174.txt' '-o' '/tmp/graph3431695098908286174.bin' '-w' '/tmp/graph3431695098908286174.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3431695098908286174.bin' '-l' '-1' '-v' '-w' '/tmp/graph3431695098908286174.weights' '-q' '0' '-e' '0.001'
[2024-05-30 09:40:57] [INFO ] Decomposing Gal with order
[2024-05-30 09:40:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 09:40:57] [INFO ] Removed a total of 1045 redundant transitions.
[2024-05-30 09:40:57] [INFO ] Flatten gal took : 88 ms
[2024-05-30 09:40:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 812 labels/synchronizations in 33 ms.
[2024-05-30 09:40:57] [INFO ] Time to serialize gal into /tmp/LTL3542733573621198652.gal : 8 ms
[2024-05-30 09:40:57] [INFO ] Time to serialize properties into /tmp/LTL11260605405143612789.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3542733573621198652.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11260605405143612789.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((G(F("((i9.u109.p382==0)||(i2.i0.i1.u32.p112==1))")))||((X(F("((i9.u109.p382==0)||(i2.i0.i1.u32.p112==1))")))&&(F("(((i11.u135.p474...227
Formula 0 simplified : FG!"((i9.u109.p382==0)||(i2.i0.i1.u32.p112==1))" & (XG!"((i9.u109.p382==0)||(i2.i0.i1.u32.p112==1))" | G!"(((i11.u135.p474==1)&&(i10...213
Detected timeout of ITS tools.
Treatment of property ShieldRVs-PT-050A-LTLCardinality-13 finished in 182239 ms.
[2024-05-30 09:41:12] [INFO ] Flatten gal took : 38 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin63150236864544567
[2024-05-30 09:41:12] [INFO ] Computing symmetric may disable matrix : 953 transitions.
[2024-05-30 09:41:12] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 09:41:12] [INFO ] Computing symmetric may enable matrix : 953 transitions.
[2024-05-30 09:41:12] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 09:41:12] [INFO ] Applying decomposition
[2024-05-30 09:41:12] [INFO ] Flatten gal took : 55 ms
[2024-05-30 09:41:13] [INFO ] Computing Do-Not-Accords matrix : 953 transitions.
[2024-05-30 09:41:13] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 09:41:13] [INFO ] Built C files in 229ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin63150236864544567
Running compilation step : cd /tmp/ltsmin63150236864544567;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8414844700192065683.txt' '-o' '/tmp/graph8414844700192065683.bin' '-w' '/tmp/graph8414844700192065683.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8414844700192065683.bin' '-l' '-1' '-v' '-w' '/tmp/graph8414844700192065683.weights' '-q' '0' '-e' '0.001'
[2024-05-30 09:41:13] [INFO ] Decomposing Gal with order
[2024-05-30 09:41:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 09:41:13] [INFO ] Removed a total of 1047 redundant transitions.
[2024-05-30 09:41:13] [INFO ] Flatten gal took : 55 ms
[2024-05-30 09:41:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 872 labels/synchronizations in 46 ms.
[2024-05-30 09:41:13] [INFO ] Time to serialize gal into /tmp/LTLCardinality6191100017895320194.gal : 7 ms
[2024-05-30 09:41:13] [INFO ] Time to serialize properties into /tmp/LTLCardinality11648147366470546273.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality6191100017895320194.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality11648147366470546273.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((((X(F("((i9.u109.p382==0)||(i2.u32.p112==1))")))&&(F(!("(((i11.u135.p474==0)||(i11.u132.p462==1))||((i12.u144.p505==0)||(i6.u64.p22...218
Formula 0 simplified : FG!"((i9.u109.p382==0)||(i2.u32.p112==1))" & (XG!"((i9.u109.p382==0)||(i2.u32.p112==1))" | G"(((i11.u135.p474==0)||(i11.u132.p462==1...200
Compilation finished in 3851 ms.
Running link step : cd /tmp/ltsmin63150236864544567;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 134 ms.
Running LTSmin : cd /tmp/ltsmin63150236864544567;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((X(<>((LTLAPp0==true)))&&<>(!(LTLAPp1==true)))||[](<>((LTLAPp0==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.018: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.018: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.027: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.027: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.043: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.043: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.043: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.043: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.043: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.043: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.044: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.044: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.137: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.137: LTL layer: formula: ((X(<>((LTLAPp0==true)))&&<>(!(LTLAPp1==true)))||[](<>((LTLAPp0==true))))
pins2lts-mc-linux64( 2/ 8), 0.137: "((X(<>((LTLAPp0==true)))&&<>(!(LTLAPp1==true)))||[](<>((LTLAPp0==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.137: Using Spin LTL semantics
pins2lts-mc-linux64( 5/ 8), 0.145: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.147: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.150: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.161: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.170: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.186: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.187: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.194: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.414: DFS-FIFO for weak LTL, using special progress label 956
pins2lts-mc-linux64( 0/ 8), 0.414: There are 957 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.414: State length is 704, there are 959 groups
pins2lts-mc-linux64( 0/ 8), 0.414: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.414: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.414: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.414: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 6/ 8), 0.478: ~2 levels ~960 states ~3816 transitions
pins2lts-mc-linux64( 6/ 8), 0.558: ~2 levels ~1920 states ~8544 transitions
pins2lts-mc-linux64( 6/ 8), 0.701: ~2 levels ~3840 states ~19736 transitions
pins2lts-mc-linux64( 6/ 8), 0.947: ~2 levels ~7680 states ~43888 transitions
pins2lts-mc-linux64( 6/ 8), 1.829: ~2 levels ~15360 states ~94720 transitions
pins2lts-mc-linux64( 6/ 8), 3.578: ~2 levels ~30720 states ~196832 transitions
pins2lts-mc-linux64( 0/ 8), 5.282: ~1 levels ~61440 states ~382496 transitions
pins2lts-mc-linux64( 0/ 8), 9.826: ~1 levels ~122880 states ~813448 transitions
pins2lts-mc-linux64( 4/ 8), 20.555: ~1 levels ~245760 states ~1727776 transitions
pins2lts-mc-linux64( 3/ 8), 32.139: ~1 levels ~491520 states ~3711248 transitions
pins2lts-mc-linux64( 0/ 8), 53.789: ~1 levels ~983040 states ~7418568 transitions
pins2lts-mc-linux64( 0/ 8), 92.143: ~1 levels ~1966080 states ~15410928 transitions
pins2lts-mc-linux64( 0/ 8), 168.916: ~1 levels ~3932160 states ~32166312 transitions
pins2lts-mc-linux64( 6/ 8), 230.217: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 230.321:
pins2lts-mc-linux64( 0/ 8), 230.321: mean standard work distribution: 0.6% (states) 1.6% (transitions)
pins2lts-mc-linux64( 0/ 8), 230.321:
pins2lts-mc-linux64( 0/ 8), 230.321: Explored 5338204 states 45756210 transitions, fanout: 8.571
pins2lts-mc-linux64( 0/ 8), 230.321: Total exploration time 229.890 sec (229.790 sec minimum, 229.842 sec on average)
pins2lts-mc-linux64( 0/ 8), 230.321: States per second: 23221, Transitions per second: 199035
pins2lts-mc-linux64( 0/ 8), 230.321:
pins2lts-mc-linux64( 0/ 8), 230.321: Progress states detected: 10093895
pins2lts-mc-linux64( 0/ 8), 230.321: Redundant explorations: -47.1147
pins2lts-mc-linux64( 0/ 8), 230.321:
pins2lts-mc-linux64( 0/ 8), 230.321: Queue width: 8B, total height: 8234704, memory: 62.83MB
pins2lts-mc-linux64( 0/ 8), 230.321: Tree memory: 333.0MB, 34.6 B/state, compr.: 1.2%
pins2lts-mc-linux64( 0/ 8), 230.321: Tree fill ratio (roots/leafs): 7.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 230.321: Stored 960 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 230.321: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 230.321: Est. total memory use: 395.8MB (~1086.8MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin63150236864544567;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((X(<>((LTLAPp0==true)))&&<>(!(LTLAPp1==true)))||[](<>((LTLAPp0==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin63150236864544567;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((X(<>((LTLAPp0==true)))&&<>(!(LTLAPp1==true)))||[](<>((LTLAPp0==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:840)
ITS-tools command line returned an error code 137
[2024-05-30 09:50:13] [INFO ] Applying decomposition
[2024-05-30 09:50:13] [INFO ] Flatten gal took : 34 ms
[2024-05-30 09:50:13] [INFO ] Decomposing Gal with order
[2024-05-30 09:50:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 09:50:13] [INFO ] Removed a total of 1047 redundant transitions.
[2024-05-30 09:50:13] [INFO ] Flatten gal took : 48 ms
[2024-05-30 09:50:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 600 labels/synchronizations in 20 ms.
[2024-05-30 09:50:13] [INFO ] Time to serialize gal into /tmp/LTLCardinality2633751753389531812.gal : 6 ms
[2024-05-30 09:50:13] [INFO ] Time to serialize properties into /tmp/LTLCardinality7553395670557059732.ltl : 15 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality2633751753389531812.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality7553395670557059732.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((((X(F("((u110.p382==0)||(u33.p112==1))")))&&(F(!("(((u136.p474==0)||(u133.p462==1))||((u145.p505==0)||(u65.p225==1)))"))))||(G(F("(...191
Formula 0 simplified : FG!"((u110.p382==0)||(u33.p112==1))" & (XG!"((u110.p382==0)||(u33.p112==1))" | G"(((u136.p474==0)||(u133.p462==1))||((u145.p505==0)|...173
Reverse transition relation is NOT exact ! Due to transitions t304, t307, t310, t317, t320, t324, t326, t331, t336, t339, t344, t348, t350, t356, t361, t36...4105
Computing Next relation with stutter on 2.394e+38 deadlock states
ITS-tools command line returned an error code 137
[2024-05-30 10:05:06] [INFO ] Flatten gal took : 37 ms
[2024-05-30 10:05:06] [INFO ] Input system was already deterministic with 953 transitions.
[2024-05-30 10:05:06] [INFO ] Transformed 703 places.
[2024-05-30 10:05:06] [INFO ] Transformed 953 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-30 10:05:07] [INFO ] Time to serialize gal into /tmp/LTLCardinality13192850682614661072.gal : 4 ms
[2024-05-30 10:05:07] [INFO ] Time to serialize properties into /tmp/LTLCardinality11635140574412775973.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality13192850682614661072.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality11635140574412775973.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...344
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((((X(F("((p382==0)||(p112==1))")))&&(F(!("(((p474==0)||(p462==1))||((p505==0)||(p225==1)))"))))||(G(F("((p382==0)||(p112==1))")))))
Formula 0 simplified : FG!"((p382==0)||(p112==1))" & (XG!"((p382==0)||(p112==1))" | G"(((p474==0)||(p462==1))||((p505==0)||(p225==1)))")
ITS-tools command line returned an error code 137
Total runtime 3103240 ms.
BK_STOP 1717064493492
--------------------
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-050A"
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-050A, 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-171683762000851"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-050A.tgz
mv ShieldRVs-PT-050A 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 ;