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-171683761100444.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 ShieldPPPs-PT-010B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683761100444
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K 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.3K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 19:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 13 11:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Apr 13 11:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Apr 13 11:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 13 11:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 172K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldPPPs-PT-010B-LTLFireability-00
FORMULA_NAME ShieldPPPs-PT-010B-LTLFireability-01
FORMULA_NAME ShieldPPPs-PT-010B-LTLFireability-02
FORMULA_NAME ShieldPPPs-PT-010B-LTLFireability-03
FORMULA_NAME ShieldPPPs-PT-010B-LTLFireability-04
FORMULA_NAME ShieldPPPs-PT-010B-LTLFireability-05
FORMULA_NAME ShieldPPPs-PT-010B-LTLFireability-06
FORMULA_NAME ShieldPPPs-PT-010B-LTLFireability-07
FORMULA_NAME ShieldPPPs-PT-010B-LTLFireability-08
FORMULA_NAME ShieldPPPs-PT-010B-LTLFireability-09
FORMULA_NAME ShieldPPPs-PT-010B-LTLFireability-10
FORMULA_NAME ShieldPPPs-PT-010B-LTLFireability-11
FORMULA_NAME ShieldPPPs-PT-010B-LTLFireability-12
FORMULA_NAME ShieldPPPs-PT-010B-LTLFireability-13
FORMULA_NAME ShieldPPPs-PT-010B-LTLFireability-14
FORMULA_NAME ShieldPPPs-PT-010B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716968980164

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-010B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-29 07:49:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 07:49:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 07:49:41] [INFO ] Load time of PNML (sax parser for PT used): 108 ms
[2024-05-29 07:49:41] [INFO ] Transformed 683 places.
[2024-05-29 07:49:41] [INFO ] Transformed 633 transitions.
[2024-05-29 07:49:41] [INFO ] Found NUPN structural information;
[2024-05-29 07:49:41] [INFO ] Parsed PT model containing 683 places and 633 transitions and 1746 arcs in 228 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA ShieldPPPs-PT-010B-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 683/683 places, 633/633 transitions.
Discarding 64 places :
Symmetric choice reduction at 0 with 64 rule applications. Total rules 64 place count 619 transition count 569
Iterating global reduction 0 with 64 rules applied. Total rules applied 128 place count 619 transition count 569
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 129 place count 618 transition count 568
Iterating global reduction 0 with 1 rules applied. Total rules applied 130 place count 618 transition count 568
Applied a total of 130 rules in 127 ms. Remains 618 /683 variables (removed 65) and now considering 568/633 (removed 65) transitions.
// Phase 1: matrix 568 rows 618 cols
[2024-05-29 07:49:41] [INFO ] Computed 111 invariants in 26 ms
[2024-05-29 07:49:42] [INFO ] Implicit Places using invariants in 394 ms returned []
[2024-05-29 07:49:42] [INFO ] Invariant cache hit.
[2024-05-29 07:49:42] [INFO ] Implicit Places using invariants and state equation in 426 ms returned []
Implicit Place search using SMT with State Equation took 852 ms to find 0 implicit places.
Running 567 sub problems to find dead transitions.
[2024-05-29 07:49:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 567 unsolved
At refinement iteration 1 (OVERLAPS) 1/618 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 567 unsolved
[2024-05-29 07:49:54] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 13 ms to minimize.
[2024-05-29 07:49:54] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 2 ms to minimize.
[2024-05-29 07:49:54] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-29 07:49:54] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 1 ms to minimize.
[2024-05-29 07:49:54] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 0 ms to minimize.
[2024-05-29 07:49:54] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 2 ms to minimize.
[2024-05-29 07:49:54] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-29 07:49:54] [INFO ] Deduced a trap composed of 18 places in 212 ms of which 4 ms to minimize.
[2024-05-29 07:49:55] [INFO ] Deduced a trap composed of 19 places in 178 ms of which 4 ms to minimize.
[2024-05-29 07:49:55] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-29 07:49:55] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-29 07:49:55] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-29 07:49:55] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-29 07:49:55] [INFO ] Deduced a trap composed of 46 places in 42 ms of which 1 ms to minimize.
[2024-05-29 07:49:55] [INFO ] Deduced a trap composed of 23 places in 174 ms of which 4 ms to minimize.
[2024-05-29 07:49:55] [INFO ] Deduced a trap composed of 21 places in 165 ms of which 4 ms to minimize.
[2024-05-29 07:49:56] [INFO ] Deduced a trap composed of 23 places in 164 ms of which 4 ms to minimize.
[2024-05-29 07:49:56] [INFO ] Deduced a trap composed of 20 places in 162 ms of which 4 ms to minimize.
[2024-05-29 07:49:56] [INFO ] Deduced a trap composed of 37 places in 162 ms of which 4 ms to minimize.
[2024-05-29 07:49:56] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/618 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 567 unsolved
[2024-05-29 07:49:58] [INFO ] Deduced a trap composed of 26 places in 170 ms of which 4 ms to minimize.
[2024-05-29 07:49:58] [INFO ] Deduced a trap composed of 22 places in 170 ms of which 3 ms to minimize.
[2024-05-29 07:49:58] [INFO ] Deduced a trap composed of 20 places in 168 ms of which 4 ms to minimize.
[2024-05-29 07:49:59] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-29 07:49:59] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-05-29 07:49:59] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-29 07:49:59] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-05-29 07:49:59] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-05-29 07:49:59] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-29 07:49:59] [INFO ] Deduced a trap composed of 24 places in 166 ms of which 4 ms to minimize.
[2024-05-29 07:49:59] [INFO ] Deduced a trap composed of 22 places in 156 ms of which 4 ms to minimize.
[2024-05-29 07:49:59] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 0 ms to minimize.
[2024-05-29 07:49:59] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-29 07:50:00] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 3 ms to minimize.
[2024-05-29 07:50:00] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-05-29 07:50:00] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 2 ms to minimize.
[2024-05-29 07:50:00] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-29 07:50:00] [INFO ] Deduced a trap composed of 47 places in 50 ms of which 1 ms to minimize.
[2024-05-29 07:50:00] [INFO ] Deduced a trap composed of 30 places in 158 ms of which 3 ms to minimize.
[2024-05-29 07:50:00] [INFO ] Deduced a trap composed of 38 places in 156 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/618 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 567 unsolved
[2024-05-29 07:50:06] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 0 ms to minimize.
[2024-05-29 07:50:07] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-29 07:50:07] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-29 07:50:08] [INFO ] Deduced a trap composed of 60 places in 52 ms of which 1 ms to minimize.
[2024-05-29 07:50:08] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 2 ms to minimize.
[2024-05-29 07:50:08] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2024-05-29 07:50:08] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-05-29 07:50:08] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2024-05-29 07:50:08] [INFO ] Deduced a trap composed of 41 places in 55 ms of which 2 ms to minimize.
[2024-05-29 07:50:08] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 1 ms to minimize.
[2024-05-29 07:50:08] [INFO ] Deduced a trap composed of 47 places in 59 ms of which 2 ms to minimize.
[2024-05-29 07:50:08] [INFO ] Deduced a trap composed of 49 places in 55 ms of which 2 ms to minimize.
[2024-05-29 07:50:08] [INFO ] Deduced a trap composed of 41 places in 62 ms of which 2 ms to minimize.
[2024-05-29 07:50:08] [INFO ] Deduced a trap composed of 45 places in 51 ms of which 1 ms to minimize.
[2024-05-29 07:50:08] [INFO ] Deduced a trap composed of 43 places in 48 ms of which 2 ms to minimize.
[2024-05-29 07:50:08] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 3 ms to minimize.
[2024-05-29 07:50:09] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
[2024-05-29 07:50:09] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-05-29 07:50:09] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 1 ms to minimize.
[2024-05-29 07:50:09] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/618 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 567 unsolved
[2024-05-29 07:50:11] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
[2024-05-29 07:50:11] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-29 07:50:11] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 0 ms to minimize.
[2024-05-29 07:50:11] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 2 ms to minimize.
[2024-05-29 07:50:11] [INFO ] Deduced a trap composed of 29 places in 26 ms of which 1 ms to minimize.
[2024-05-29 07:50:11] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-29 07:50:11] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-29 07:50:12] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-29 07:50:12] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-29 07:50:12] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 0 ms to minimize.
[2024-05-29 07:50:12] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 0 ms to minimize.
[2024-05-29 07:50:12] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
[2024-05-29 07:50:12] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 1 ms to minimize.
[2024-05-29 07:50:12] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-05-29 07:50:12] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
SMT process timed out in 30157ms, After SMT, problems are : Problem set: 0 solved, 567 unsolved
Search for dead transitions found 0 dead transitions in 30181ms
Starting structural reductions in LTL mode, iteration 1 : 618/683 places, 568/633 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31181 ms. Remains : 618/683 places, 568/633 transitions.
Support contains 44 out of 618 places after structural reductions.
[2024-05-29 07:50:13] [INFO ] Flatten gal took : 89 ms
[2024-05-29 07:50:13] [INFO ] Flatten gal took : 36 ms
[2024-05-29 07:50:13] [INFO ] Input system was already deterministic with 568 transitions.
Support contains 42 out of 618 places (down from 44) after GAL structural reductions.
RANDOM walk for 17012 steps (7 resets) in 670 ms. (25 steps per ms) remains 0/30 properties
Computed a total of 124 stabilizing places and 124 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 618 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 618/618 places, 568/568 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 612 transition count 562
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 612 transition count 562
Applied a total of 12 rules in 43 ms. Remains 612 /618 variables (removed 6) and now considering 562/568 (removed 6) transitions.
// Phase 1: matrix 562 rows 612 cols
[2024-05-29 07:50:13] [INFO ] Computed 111 invariants in 3 ms
[2024-05-29 07:50:14] [INFO ] Implicit Places using invariants in 288 ms returned []
[2024-05-29 07:50:14] [INFO ] Invariant cache hit.
[2024-05-29 07:50:14] [INFO ] Implicit Places using invariants and state equation in 445 ms returned []
Implicit Place search using SMT with State Equation took 736 ms to find 0 implicit places.
Running 561 sub problems to find dead transitions.
[2024-05-29 07:50:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/611 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (OVERLAPS) 1/612 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-05-29 07:50:25] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-29 07:50:25] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-29 07:50:25] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-29 07:50:25] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-29 07:50:26] [INFO ] Deduced a trap composed of 18 places in 182 ms of which 3 ms to minimize.
[2024-05-29 07:50:26] [INFO ] Deduced a trap composed of 20 places in 157 ms of which 3 ms to minimize.
[2024-05-29 07:50:26] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 0 ms to minimize.
[2024-05-29 07:50:26] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 2 ms to minimize.
[2024-05-29 07:50:26] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-29 07:50:26] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-29 07:50:26] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-05-29 07:50:26] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-05-29 07:50:26] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-29 07:50:27] [INFO ] Deduced a trap composed of 23 places in 157 ms of which 3 ms to minimize.
[2024-05-29 07:50:27] [INFO ] Deduced a trap composed of 21 places in 149 ms of which 3 ms to minimize.
[2024-05-29 07:50:27] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 0 ms to minimize.
[2024-05-29 07:50:27] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-29 07:50:27] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-05-29 07:50:27] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-29 07:50:27] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/612 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-05-29 07:50:28] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-29 07:50:29] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 1 ms to minimize.
[2024-05-29 07:50:29] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-29 07:50:29] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 0 ms to minimize.
[2024-05-29 07:50:29] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 0 ms to minimize.
[2024-05-29 07:50:29] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 0 ms to minimize.
[2024-05-29 07:50:29] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2024-05-29 07:50:30] [INFO ] Deduced a trap composed of 18 places in 154 ms of which 3 ms to minimize.
[2024-05-29 07:50:30] [INFO ] Deduced a trap composed of 26 places in 149 ms of which 4 ms to minimize.
[2024-05-29 07:50:30] [INFO ] Deduced a trap composed of 27 places in 126 ms of which 3 ms to minimize.
[2024-05-29 07:50:30] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-29 07:50:30] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-29 07:50:30] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 0 ms to minimize.
[2024-05-29 07:50:30] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
[2024-05-29 07:50:30] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-29 07:50:30] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-05-29 07:50:31] [INFO ] Deduced a trap composed of 21 places in 144 ms of which 3 ms to minimize.
[2024-05-29 07:50:31] [INFO ] Deduced a trap composed of 29 places in 139 ms of which 3 ms to minimize.
[2024-05-29 07:50:31] [INFO ] Deduced a trap composed of 43 places in 114 ms of which 3 ms to minimize.
[2024-05-29 07:50:31] [INFO ] Deduced a trap composed of 22 places in 111 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/612 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-05-29 07:50:37] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-29 07:50:37] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 0 ms to minimize.
[2024-05-29 07:50:37] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-29 07:50:38] [INFO ] Deduced a trap composed of 20 places in 166 ms of which 4 ms to minimize.
[2024-05-29 07:50:38] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-29 07:50:39] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-29 07:50:39] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-05-29 07:50:39] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 2 ms to minimize.
[2024-05-29 07:50:39] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 0 ms to minimize.
[2024-05-29 07:50:39] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-29 07:50:39] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-29 07:50:39] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
[2024-05-29 07:50:39] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
[2024-05-29 07:50:39] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 2 ms to minimize.
[2024-05-29 07:50:39] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 2 ms to minimize.
[2024-05-29 07:50:40] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-29 07:50:40] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 1 ms to minimize.
[2024-05-29 07:50:40] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-29 07:50:40] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-05-29 07:50:40] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/612 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-05-29 07:50:42] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-05-29 07:50:42] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 1 ms to minimize.
[2024-05-29 07:50:43] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-05-29 07:50:43] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 1 ms to minimize.
[2024-05-29 07:50:43] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-29 07:50:43] [INFO ] Deduced a trap composed of 46 places in 56 ms of which 2 ms to minimize.
[2024-05-29 07:50:43] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 2 ms to minimize.
[2024-05-29 07:50:43] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 0 ms to minimize.
[2024-05-29 07:50:44] [INFO ] Deduced a trap composed of 49 places in 70 ms of which 2 ms to minimize.
[2024-05-29 07:50:44] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 2 ms to minimize.
[2024-05-29 07:50:44] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 2 ms to minimize.
[2024-05-29 07:50:44] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-05-29 07:50:44] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 0 ms to minimize.
[2024-05-29 07:50:44] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-29 07:50:44] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 612/1174 variables, and 186 constraints, problems are : Problem set: 0 solved, 561 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/612 constraints, PredecessorRefiner: 561/561 constraints, Known Traps: 75/75 constraints]
Escalating to Integer solving :Problem set: 0 solved, 561 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/611 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (OVERLAPS) 1/612 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/612 variables, 75/186 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-05-29 07:50:51] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-29 07:50:51] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 0 ms to minimize.
[2024-05-29 07:50:51] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 2 ms to minimize.
[2024-05-29 07:50:52] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-29 07:50:52] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 2 ms to minimize.
[2024-05-29 07:50:52] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-29 07:50:52] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2024-05-29 07:50:53] [INFO ] Deduced a trap composed of 40 places in 65 ms of which 1 ms to minimize.
[2024-05-29 07:50:53] [INFO ] Deduced a trap composed of 25 places in 109 ms of which 3 ms to minimize.
[2024-05-29 07:50:53] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-29 07:50:53] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 1 ms to minimize.
[2024-05-29 07:50:53] [INFO ] Deduced a trap composed of 33 places in 77 ms of which 1 ms to minimize.
[2024-05-29 07:50:53] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 1 ms to minimize.
[2024-05-29 07:50:53] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2024-05-29 07:50:53] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 0 ms to minimize.
[2024-05-29 07:50:53] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 0 ms to minimize.
[2024-05-29 07:50:53] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 1 ms to minimize.
[2024-05-29 07:50:53] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-29 07:50:54] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
[2024-05-29 07:50:54] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/612 variables, 20/206 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-05-29 07:50:56] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-05-29 07:50:56] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-29 07:50:56] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-05-29 07:50:56] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-29 07:50:57] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-29 07:50:58] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-05-29 07:50:58] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 1 ms to minimize.
[2024-05-29 07:50:58] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2024-05-29 07:50:58] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-29 07:50:58] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 2 ms to minimize.
[2024-05-29 07:50:58] [INFO ] Deduced a trap composed of 51 places in 68 ms of which 1 ms to minimize.
[2024-05-29 07:50:58] [INFO ] Deduced a trap composed of 55 places in 91 ms of which 2 ms to minimize.
[2024-05-29 07:50:58] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 2 ms to minimize.
[2024-05-29 07:50:58] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 0 ms to minimize.
[2024-05-29 07:50:58] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 0 ms to minimize.
[2024-05-29 07:50:58] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-05-29 07:50:59] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2024-05-29 07:50:59] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 1 ms to minimize.
[2024-05-29 07:50:59] [INFO ] Deduced a trap composed of 45 places in 72 ms of which 2 ms to minimize.
[2024-05-29 07:50:59] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/612 variables, 20/226 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-05-29 07:51:01] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 0 ms to minimize.
[2024-05-29 07:51:02] [INFO ] Deduced a trap composed of 42 places in 60 ms of which 1 ms to minimize.
[2024-05-29 07:51:02] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-29 07:51:02] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-05-29 07:51:03] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 2 ms to minimize.
[2024-05-29 07:51:03] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-29 07:51:03] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-05-29 07:51:03] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 1 ms to minimize.
[2024-05-29 07:51:03] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-05-29 07:51:04] [INFO ] Deduced a trap composed of 36 places in 83 ms of which 2 ms to minimize.
[2024-05-29 07:51:04] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 2 ms to minimize.
[2024-05-29 07:51:04] [INFO ] Deduced a trap composed of 59 places in 81 ms of which 2 ms to minimize.
[2024-05-29 07:51:04] [INFO ] Deduced a trap composed of 33 places in 78 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/612 variables, 13/239 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-05-29 07:51:08] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 1 ms to minimize.
[2024-05-29 07:51:08] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2024-05-29 07:51:08] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2024-05-29 07:51:08] [INFO ] Deduced a trap composed of 28 places in 27 ms of which 0 ms to minimize.
[2024-05-29 07:51:08] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-29 07:51:09] [INFO ] Deduced a trap composed of 32 places in 28 ms of which 0 ms to minimize.
[2024-05-29 07:51:09] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-05-29 07:51:09] [INFO ] Deduced a trap composed of 52 places in 62 ms of which 1 ms to minimize.
[2024-05-29 07:51:09] [INFO ] Deduced a trap composed of 48 places in 52 ms of which 1 ms to minimize.
[2024-05-29 07:51:09] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 2 ms to minimize.
[2024-05-29 07:51:09] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2024-05-29 07:51:09] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
[2024-05-29 07:51:09] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-05-29 07:51:09] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
[2024-05-29 07:51:09] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 1 ms to minimize.
[2024-05-29 07:51:09] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
[2024-05-29 07:51:09] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 1 ms to minimize.
[2024-05-29 07:51:10] [INFO ] Deduced a trap composed of 51 places in 52 ms of which 1 ms to minimize.
[2024-05-29 07:51:10] [INFO ] Deduced a trap composed of 49 places in 45 ms of which 1 ms to minimize.
[2024-05-29 07:51:10] [INFO ] Deduced a trap composed of 56 places in 47 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/612 variables, 20/259 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-05-29 07:51:11] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2024-05-29 07:51:12] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 1 ms to minimize.
[2024-05-29 07:51:12] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 1 ms to minimize.
[2024-05-29 07:51:12] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 0 ms to minimize.
[2024-05-29 07:51:12] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 0 ms to minimize.
[2024-05-29 07:51:12] [INFO ] Deduced a trap composed of 31 places in 30 ms of which 1 ms to minimize.
[2024-05-29 07:51:12] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
[2024-05-29 07:51:12] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
[2024-05-29 07:51:12] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2024-05-29 07:51:12] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-29 07:51:13] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-29 07:51:13] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-05-29 07:51:13] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-29 07:51:14] [INFO ] Deduced a trap composed of 69 places in 73 ms of which 1 ms to minimize.
[2024-05-29 07:51:14] [INFO ] Deduced a trap composed of 48 places in 96 ms of which 2 ms to minimize.
[2024-05-29 07:51:14] [INFO ] Deduced a trap composed of 36 places in 88 ms of which 2 ms to minimize.
[2024-05-29 07:51:14] [INFO ] Deduced a trap composed of 41 places in 82 ms of which 2 ms to minimize.
[2024-05-29 07:51:14] [INFO ] Deduced a trap composed of 39 places in 84 ms of which 2 ms to minimize.
[2024-05-29 07:51:14] [INFO ] Deduced a trap composed of 46 places in 80 ms of which 1 ms to minimize.
[2024-05-29 07:51:14] [INFO ] Deduced a trap composed of 48 places in 84 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/612 variables, 20/279 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 612/1174 variables, and 279 constraints, problems are : Problem set: 0 solved, 561 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/612 constraints, PredecessorRefiner: 0/561 constraints, Known Traps: 168/168 constraints]
After SMT, in 60122ms problems are : Problem set: 0 solved, 561 unsolved
Search for dead transitions found 0 dead transitions in 60129ms
Starting structural reductions in LTL mode, iteration 1 : 612/618 places, 562/568 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60910 ms. Remains : 612/618 places, 562/568 transitions.
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-010B-LTLFireability-00
Stuttering criterion allowed to conclude after 7836 steps with 12 reset in 70 ms.
FORMULA ShieldPPPs-PT-010B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-010B-LTLFireability-00 finished in 61187 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((F((p0&&F(p1)))&&(G(!p1) U p2))))'
Support contains 4 out of 618 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 618/618 places, 568/568 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 617 transition count 496
Reduce places removed 71 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 72 rules applied. Total rules applied 143 place count 546 transition count 495
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 144 place count 545 transition count 495
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 50 Pre rules applied. Total rules applied 144 place count 545 transition count 445
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 244 place count 495 transition count 445
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 249 place count 490 transition count 440
Iterating global reduction 3 with 5 rules applied. Total rules applied 254 place count 490 transition count 440
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 254 place count 490 transition count 435
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 264 place count 485 transition count 435
Performed 170 Post agglomeration using F-continuation condition.Transition count delta: 170
Deduced a syphon composed of 170 places in 1 ms
Reduce places removed 170 places and 0 transitions.
Iterating global reduction 3 with 340 rules applied. Total rules applied 604 place count 315 transition count 265
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 606 place count 313 transition count 263
Applied a total of 606 rules in 144 ms. Remains 313 /618 variables (removed 305) and now considering 263/568 (removed 305) transitions.
// Phase 1: matrix 263 rows 313 cols
[2024-05-29 07:51:15] [INFO ] Computed 111 invariants in 1 ms
[2024-05-29 07:51:15] [INFO ] Implicit Places using invariants in 158 ms returned []
[2024-05-29 07:51:15] [INFO ] Invariant cache hit.
[2024-05-29 07:51:15] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 381 ms to find 0 implicit places.
[2024-05-29 07:51:15] [INFO ] Redundant transitions in 10 ms returned []
Running 260 sub problems to find dead transitions.
[2024-05-29 07:51:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 101/101 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:51:18] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
[2024-05-29 07:51:18] [INFO ] Deduced a trap composed of 27 places in 24 ms of which 0 ms to minimize.
[2024-05-29 07:51:18] [INFO ] Deduced a trap composed of 42 places in 33 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 3/104 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:51:19] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
[2024-05-29 07:51:19] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/312 variables, 2/106 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (OVERLAPS) 1/313 variables, 10/116 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:51:23] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 2 ms to minimize.
[2024-05-29 07:51:23] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-05-29 07:51:23] [INFO ] Deduced a trap composed of 58 places in 34 ms of which 1 ms to minimize.
[2024-05-29 07:51:24] [INFO ] Deduced a trap composed of 71 places in 41 ms of which 1 ms to minimize.
[2024-05-29 07:51:24] [INFO ] Deduced a trap composed of 85 places in 48 ms of which 1 ms to minimize.
[2024-05-29 07:51:24] [INFO ] Deduced a trap composed of 102 places in 46 ms of which 1 ms to minimize.
[2024-05-29 07:51:24] [INFO ] Deduced a trap composed of 116 places in 50 ms of which 2 ms to minimize.
[2024-05-29 07:51:24] [INFO ] Deduced a trap composed of 130 places in 61 ms of which 3 ms to minimize.
[2024-05-29 07:51:24] [INFO ] Deduced a trap composed of 143 places in 63 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 9/125 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:51:25] [INFO ] Deduced a trap composed of 57 places in 35 ms of which 1 ms to minimize.
[2024-05-29 07:51:25] [INFO ] Deduced a trap composed of 56 places in 31 ms of which 1 ms to minimize.
[2024-05-29 07:51:26] [INFO ] Deduced a trap composed of 116 places in 57 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 3/128 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:51:28] [INFO ] Deduced a trap composed of 115 places in 52 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:51:30] [INFO ] Deduced a trap composed of 70 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/313 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 263/576 variables, 313/443 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:51:33] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/576 variables, 1/444 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:51:35] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/576 variables, 1/445 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/576 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:51:40] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
[2024-05-29 07:51:40] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-29 07:51:41] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 0 ms to minimize.
[2024-05-29 07:51:41] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-05-29 07:51:42] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-29 07:51:42] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/576 variables, 6/451 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:51:43] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/576 variables, 1/452 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 576/576 variables, and 452 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 101/101 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 28/129 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/312 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 1/313 variables, 10/139 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:51:48] [INFO ] Deduced a trap composed of 103 places in 50 ms of which 1 ms to minimize.
[2024-05-29 07:51:48] [INFO ] Deduced a trap composed of 99 places in 40 ms of which 1 ms to minimize.
[2024-05-29 07:51:48] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 3/142 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 263/576 variables, 313/455 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 260/715 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:51:54] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 1/716 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 576/576 variables, and 716 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 32/32 constraints]
After SMT, in 60078ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 60081ms
Starting structural reductions in SI_LTL mode, iteration 1 : 313/618 places, 263/568 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60621 ms. Remains : 313/618 places, 263/568 transitions.
Stuttering acceptance computed with spot in 156 ms :[(NOT p1), (OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-010B-LTLFireability-01
Stuttering criterion allowed to conclude after 749 steps with 0 reset in 14 ms.
FORMULA ShieldPPPs-PT-010B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-010B-LTLFireability-01 finished in 60810 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 618 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 618/618 places, 568/568 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 72 place count 617 transition count 495
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 144 place count 545 transition count 495
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 144 place count 545 transition count 445
Deduced a syphon composed of 50 places in 2 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 244 place count 495 transition count 445
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 250 place count 489 transition count 439
Iterating global reduction 2 with 6 rules applied. Total rules applied 256 place count 489 transition count 439
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 256 place count 489 transition count 434
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 266 place count 484 transition count 434
Performed 171 Post agglomeration using F-continuation condition.Transition count delta: 171
Deduced a syphon composed of 171 places in 1 ms
Reduce places removed 171 places and 0 transitions.
Iterating global reduction 2 with 342 rules applied. Total rules applied 608 place count 313 transition count 263
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 610 place count 311 transition count 261
Applied a total of 610 rules in 85 ms. Remains 311 /618 variables (removed 307) and now considering 261/568 (removed 307) transitions.
// Phase 1: matrix 261 rows 311 cols
[2024-05-29 07:52:15] [INFO ] Computed 111 invariants in 1 ms
[2024-05-29 07:52:16] [INFO ] Implicit Places using invariants in 191 ms returned []
[2024-05-29 07:52:16] [INFO ] Invariant cache hit.
[2024-05-29 07:52:16] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 423 ms to find 0 implicit places.
[2024-05-29 07:52:16] [INFO ] Redundant transitions in 3 ms returned []
Running 259 sub problems to find dead transitions.
[2024-05-29 07:52:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 07:52:18] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 0 ms to minimize.
[2024-05-29 07:52:18] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 0 ms to minimize.
[2024-05-29 07:52:18] [INFO ] Deduced a trap composed of 42 places in 33 ms of which 0 ms to minimize.
[2024-05-29 07:52:18] [INFO ] Deduced a trap composed of 56 places in 32 ms of which 1 ms to minimize.
[2024-05-29 07:52:19] [INFO ] Deduced a trap composed of 73 places in 47 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 5/116 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (OVERLAPS) 261/572 variables, 311/427 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/572 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (OVERLAPS) 0/572 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 259 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 427 constraints, problems are : Problem set: 0 solved, 259 unsolved in 9712 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 259 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 5/116 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 07:52:27] [INFO ] Deduced a trap composed of 42 places in 35 ms of which 1 ms to minimize.
[2024-05-29 07:52:27] [INFO ] Deduced a trap composed of 41 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (OVERLAPS) 261/572 variables, 311/429 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/572 variables, 259/688 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 0/688 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 688 constraints, problems are : Problem set: 0 solved, 259 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 7/7 constraints]
After SMT, in 39764ms problems are : Problem set: 0 solved, 259 unsolved
Search for dead transitions found 0 dead transitions in 39766ms
Starting structural reductions in SI_LTL mode, iteration 1 : 311/618 places, 261/568 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 40282 ms. Remains : 311/618 places, 261/568 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-010B-LTLFireability-03
Product exploration explored 100000 steps with 140 reset in 456 ms.
Product exploration explored 100000 steps with 140 reset in 530 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
RANDOM walk for 1088 steps (0 resets) in 14 ms. (72 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Support contains 2 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 261/261 transitions.
Applied a total of 0 rules in 9 ms. Remains 311 /311 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2024-05-29 07:52:57] [INFO ] Invariant cache hit.
[2024-05-29 07:52:57] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-05-29 07:52:57] [INFO ] Invariant cache hit.
[2024-05-29 07:52:57] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 389 ms to find 0 implicit places.
[2024-05-29 07:52:57] [INFO ] Redundant transitions in 3 ms returned []
Running 259 sub problems to find dead transitions.
[2024-05-29 07:52:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 07:53:00] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-05-29 07:53:00] [INFO ] Deduced a trap composed of 28 places in 26 ms of which 1 ms to minimize.
[2024-05-29 07:53:00] [INFO ] Deduced a trap composed of 42 places in 24 ms of which 1 ms to minimize.
[2024-05-29 07:53:00] [INFO ] Deduced a trap composed of 56 places in 40 ms of which 0 ms to minimize.
[2024-05-29 07:53:00] [INFO ] Deduced a trap composed of 73 places in 40 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 5/116 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (OVERLAPS) 261/572 variables, 311/427 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/572 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (OVERLAPS) 0/572 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 259 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 427 constraints, problems are : Problem set: 0 solved, 259 unsolved in 9836 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 259 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 5/116 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 07:53:08] [INFO ] Deduced a trap composed of 42 places in 37 ms of which 0 ms to minimize.
[2024-05-29 07:53:08] [INFO ] Deduced a trap composed of 41 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (OVERLAPS) 261/572 variables, 311/429 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/572 variables, 259/688 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 0/688 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 688 constraints, problems are : Problem set: 0 solved, 259 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 7/7 constraints]
After SMT, in 39883ms problems are : Problem set: 0 solved, 259 unsolved
Search for dead transitions found 0 dead transitions in 39886ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 40295 ms. Remains : 311/311 places, 261/261 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
RANDOM walk for 946 steps (0 resets) in 12 ms. (72 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration explored 100000 steps with 142 reset in 392 ms.
Product exploration explored 100000 steps with 140 reset in 448 ms.
Built C files in :
/tmp/ltsmin7055100455166142128
[2024-05-29 07:53:39] [INFO ] Computing symmetric may disable matrix : 261 transitions.
[2024-05-29 07:53:39] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:53:39] [INFO ] Computing symmetric may enable matrix : 261 transitions.
[2024-05-29 07:53:39] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:53:39] [INFO ] Computing Do-Not-Accords matrix : 261 transitions.
[2024-05-29 07:53:39] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:53:39] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7055100455166142128
Running compilation step : cd /tmp/ltsmin7055100455166142128;'/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'
Compilation finished in 695 ms.
Running link step : cd /tmp/ltsmin7055100455166142128;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin7055100455166142128;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8938341490729977468.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 261/261 transitions.
Applied a total of 0 rules in 15 ms. Remains 311 /311 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2024-05-29 07:53:54] [INFO ] Invariant cache hit.
[2024-05-29 07:53:54] [INFO ] Implicit Places using invariants in 143 ms returned []
[2024-05-29 07:53:54] [INFO ] Invariant cache hit.
[2024-05-29 07:53:54] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 381 ms to find 0 implicit places.
[2024-05-29 07:53:54] [INFO ] Redundant transitions in 2 ms returned []
Running 259 sub problems to find dead transitions.
[2024-05-29 07:53:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 07:53:56] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-29 07:53:56] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-05-29 07:53:56] [INFO ] Deduced a trap composed of 42 places in 35 ms of which 1 ms to minimize.
[2024-05-29 07:53:57] [INFO ] Deduced a trap composed of 56 places in 41 ms of which 0 ms to minimize.
[2024-05-29 07:53:57] [INFO ] Deduced a trap composed of 73 places in 36 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 5/116 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (OVERLAPS) 261/572 variables, 311/427 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/572 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (OVERLAPS) 0/572 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 259 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 427 constraints, problems are : Problem set: 0 solved, 259 unsolved in 9794 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 259 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 5/116 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 07:54:05] [INFO ] Deduced a trap composed of 42 places in 34 ms of which 1 ms to minimize.
[2024-05-29 07:54:05] [INFO ] Deduced a trap composed of 41 places in 30 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (OVERLAPS) 261/572 variables, 311/429 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/572 variables, 259/688 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 0/688 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 688 constraints, problems are : Problem set: 0 solved, 259 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 7/7 constraints]
After SMT, in 39831ms problems are : Problem set: 0 solved, 259 unsolved
Search for dead transitions found 0 dead transitions in 39833ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 40236 ms. Remains : 311/311 places, 261/261 transitions.
Built C files in :
/tmp/ltsmin17791184219007741458
[2024-05-29 07:54:34] [INFO ] Computing symmetric may disable matrix : 261 transitions.
[2024-05-29 07:54:34] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:54:34] [INFO ] Computing symmetric may enable matrix : 261 transitions.
[2024-05-29 07:54:34] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:54:34] [INFO ] Computing Do-Not-Accords matrix : 261 transitions.
[2024-05-29 07:54:34] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:54:34] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17791184219007741458
Running compilation step : cd /tmp/ltsmin17791184219007741458;'/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'
Compilation finished in 578 ms.
Running link step : cd /tmp/ltsmin17791184219007741458;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin17791184219007741458;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17279456147978404959.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 07:54:49] [INFO ] Flatten gal took : 22 ms
[2024-05-29 07:54:49] [INFO ] Flatten gal took : 18 ms
[2024-05-29 07:54:49] [INFO ] Time to serialize gal into /tmp/LTL3929596198763252938.gal : 14 ms
[2024-05-29 07:54:49] [INFO ] Time to serialize properties into /tmp/LTL365217197187476326.prop : 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/LTL3929596198763252938.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17517906919863832314.hoa' '-atoms' '/tmp/LTL365217197187476326.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...317
Loading property file /tmp/LTL365217197187476326.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17517906919863832314.hoa
Detected timeout of ITS tools.
[2024-05-29 07:55:04] [INFO ] Flatten gal took : 14 ms
[2024-05-29 07:55:04] [INFO ] Flatten gal took : 13 ms
[2024-05-29 07:55:04] [INFO ] Time to serialize gal into /tmp/LTL530936702480560112.gal : 3 ms
[2024-05-29 07:55:04] [INFO ] Time to serialize properties into /tmp/LTL15757424735017477324.ltl : 2 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/LTL530936702480560112.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15757424735017477324.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 : !((F(G("((p364!=1)||(p400!=1))"))))
Formula 0 simplified : GF!"((p364!=1)||(p400!=1))"
Detected timeout of ITS tools.
[2024-05-29 07:55:19] [INFO ] Flatten gal took : 13 ms
[2024-05-29 07:55:19] [INFO ] Applying decomposition
[2024-05-29 07:55:19] [INFO ] Flatten gal took : 12 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/graph994802084129274051.txt' '-o' '/tmp/graph994802084129274051.bin' '-w' '/tmp/graph994802084129274051.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph994802084129274051.bin' '-l' '-1' '-v' '-w' '/tmp/graph994802084129274051.weights' '-q' '0' '-e' '0.001'
[2024-05-29 07:55:19] [INFO ] Decomposing Gal with order
[2024-05-29 07:55:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 07:55:19] [INFO ] Removed a total of 62 redundant transitions.
[2024-05-29 07:55:19] [INFO ] Flatten gal took : 53 ms
[2024-05-29 07:55:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 124 labels/synchronizations in 10 ms.
[2024-05-29 07:55:19] [INFO ] Time to serialize gal into /tmp/LTL702569368150360797.gal : 5 ms
[2024-05-29 07:55:19] [INFO ] Time to serialize properties into /tmp/LTL14248901520841998756.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/LTL702569368150360797.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14248901520841998756.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...254
Read 1 LTL properties
Checking formula 0 : !((F(G("((i5.i0.i0.u57.p364!=1)||(i5.i0.i2.u65.p400!=1))"))))
Formula 0 simplified : GF!"((i5.i0.i0.u57.p364!=1)||(i5.i0.i2.u65.p400!=1))"
Detected timeout of ITS tools.
Treatment of property ShieldPPPs-PT-010B-LTLFireability-03 finished in 199113 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 618 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 618/618 places, 568/568 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 617 transition count 496
Reduce places removed 71 places and 0 transitions.
Iterating post reduction 1 with 71 rules applied. Total rules applied 142 place count 546 transition count 496
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 49 Pre rules applied. Total rules applied 142 place count 546 transition count 447
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 240 place count 497 transition count 447
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 246 place count 491 transition count 441
Iterating global reduction 2 with 6 rules applied. Total rules applied 252 place count 491 transition count 441
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 252 place count 491 transition count 436
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 262 place count 486 transition count 436
Performed 172 Post agglomeration using F-continuation condition.Transition count delta: 172
Deduced a syphon composed of 172 places in 0 ms
Reduce places removed 172 places and 0 transitions.
Iterating global reduction 2 with 344 rules applied. Total rules applied 606 place count 314 transition count 264
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 608 place count 312 transition count 262
Applied a total of 608 rules in 48 ms. Remains 312 /618 variables (removed 306) and now considering 262/568 (removed 306) transitions.
// Phase 1: matrix 262 rows 312 cols
[2024-05-29 07:55:35] [INFO ] Computed 111 invariants in 2 ms
[2024-05-29 07:55:35] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-05-29 07:55:35] [INFO ] Invariant cache hit.
[2024-05-29 07:55:35] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
[2024-05-29 07:55:35] [INFO ] Redundant transitions in 1 ms returned []
Running 259 sub problems to find dead transitions.
[2024-05-29 07:55:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 110/110 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 07:55:37] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-29 07:55:37] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
[2024-05-29 07:55:37] [INFO ] Deduced a trap composed of 42 places in 31 ms of which 0 ms to minimize.
[2024-05-29 07:55:37] [INFO ] Deduced a trap composed of 56 places in 36 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 4/114 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (OVERLAPS) 1/312 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 07:55:42] [INFO ] Deduced a trap composed of 75 places in 45 ms of which 2 ms to minimize.
[2024-05-29 07:55:42] [INFO ] Deduced a trap composed of 89 places in 46 ms of which 1 ms to minimize.
[2024-05-29 07:55:42] [INFO ] Deduced a trap composed of 104 places in 49 ms of which 1 ms to minimize.
[2024-05-29 07:55:42] [INFO ] Deduced a trap composed of 119 places in 53 ms of which 1 ms to minimize.
[2024-05-29 07:55:42] [INFO ] Deduced a trap composed of 133 places in 56 ms of which 1 ms to minimize.
[2024-05-29 07:55:42] [INFO ] Deduced a trap composed of 145 places in 63 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 6/121 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 07:55:44] [INFO ] Deduced a trap composed of 119 places in 56 ms of which 2 ms to minimize.
[2024-05-29 07:55:44] [INFO ] Deduced a trap composed of 115 places in 47 ms of which 1 ms to minimize.
[2024-05-29 07:55:44] [INFO ] Deduced a trap composed of 115 places in 47 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 3/124 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 07:55:45] [INFO ] Deduced a trap composed of 88 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 07:55:48] [INFO ] Deduced a trap composed of 103 places in 50 ms of which 1 ms to minimize.
[2024-05-29 07:55:48] [INFO ] Deduced a trap composed of 116 places in 56 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 9 (OVERLAPS) 262/574 variables, 312/439 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 07:55:52] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/574 variables, 1/440 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 07:55:54] [INFO ] Deduced a trap composed of 12 places in 16 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/574 variables, 1/441 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/574 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 13 (OVERLAPS) 0/574 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 259 unsolved
No progress, stopping.
After SMT solving in domain Real declared 574/574 variables, and 441 constraints, problems are : Problem set: 0 solved, 259 unsolved in 27100 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 259 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 110/110 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 6/116 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (OVERLAPS) 1/312 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 12/129 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (OVERLAPS) 262/574 variables, 312/441 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/574 variables, 259/700 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/574 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 574/574 variables, and 700 constraints, problems are : Problem set: 0 solved, 259 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 18/18 constraints]
After SMT, in 57140ms problems are : Problem set: 0 solved, 259 unsolved
Search for dead transitions found 0 dead transitions in 57142ms
Starting structural reductions in SI_LTL mode, iteration 1 : 312/618 places, 262/568 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 57570 ms. Remains : 312/618 places, 262/568 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-010B-LTLFireability-04
Product exploration explored 100000 steps with 139 reset in 376 ms.
Product exploration explored 100000 steps with 137 reset in 424 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 179 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
RANDOM walk for 9 steps (0 resets) in 5 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 148 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Support contains 1 out of 312 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 312/312 places, 262/262 transitions.
Applied a total of 0 rules in 8 ms. Remains 312 /312 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2024-05-29 07:56:33] [INFO ] Invariant cache hit.
[2024-05-29 07:56:34] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-05-29 07:56:34] [INFO ] Invariant cache hit.
[2024-05-29 07:56:34] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
[2024-05-29 07:56:34] [INFO ] Redundant transitions in 1 ms returned []
Running 259 sub problems to find dead transitions.
[2024-05-29 07:56:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 110/110 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 07:56:36] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-29 07:56:36] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 0 ms to minimize.
[2024-05-29 07:56:36] [INFO ] Deduced a trap composed of 42 places in 30 ms of which 0 ms to minimize.
[2024-05-29 07:56:36] [INFO ] Deduced a trap composed of 56 places in 35 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 4/114 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (OVERLAPS) 1/312 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 07:56:41] [INFO ] Deduced a trap composed of 75 places in 43 ms of which 1 ms to minimize.
[2024-05-29 07:56:41] [INFO ] Deduced a trap composed of 89 places in 42 ms of which 1 ms to minimize.
[2024-05-29 07:56:41] [INFO ] Deduced a trap composed of 104 places in 47 ms of which 1 ms to minimize.
[2024-05-29 07:56:41] [INFO ] Deduced a trap composed of 119 places in 53 ms of which 1 ms to minimize.
[2024-05-29 07:56:41] [INFO ] Deduced a trap composed of 133 places in 51 ms of which 1 ms to minimize.
[2024-05-29 07:56:41] [INFO ] Deduced a trap composed of 145 places in 59 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 6/121 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 07:56:42] [INFO ] Deduced a trap composed of 119 places in 54 ms of which 2 ms to minimize.
[2024-05-29 07:56:43] [INFO ] Deduced a trap composed of 115 places in 47 ms of which 1 ms to minimize.
[2024-05-29 07:56:43] [INFO ] Deduced a trap composed of 115 places in 48 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 3/124 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 07:56:44] [INFO ] Deduced a trap composed of 88 places in 52 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 07:56:47] [INFO ] Deduced a trap composed of 103 places in 50 ms of which 1 ms to minimize.
[2024-05-29 07:56:47] [INFO ] Deduced a trap composed of 116 places in 52 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 9 (OVERLAPS) 262/574 variables, 312/439 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 07:56:51] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/574 variables, 1/440 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 07:56:52] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/574 variables, 1/441 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/574 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 13 (OVERLAPS) 0/574 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 259 unsolved
No progress, stopping.
After SMT solving in domain Real declared 574/574 variables, and 441 constraints, problems are : Problem set: 0 solved, 259 unsolved in 26831 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 259 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 110/110 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 6/116 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (OVERLAPS) 1/312 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 12/129 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (OVERLAPS) 262/574 variables, 312/441 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/574 variables, 259/700 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/574 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 574/574 variables, and 700 constraints, problems are : Problem set: 0 solved, 259 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 18/18 constraints]
After SMT, in 56869ms problems are : Problem set: 0 solved, 259 unsolved
Search for dead transitions found 0 dead transitions in 56871ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 57238 ms. Remains : 312/312 places, 262/262 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 170 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
RANDOM walk for 16 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 191 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Product exploration explored 100000 steps with 137 reset in 393 ms.
Product exploration explored 100000 steps with 139 reset in 426 ms.
Built C files in :
/tmp/ltsmin6167214813912395292
[2024-05-29 07:57:32] [INFO ] Computing symmetric may disable matrix : 262 transitions.
[2024-05-29 07:57:32] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:57:32] [INFO ] Computing symmetric may enable matrix : 262 transitions.
[2024-05-29 07:57:32] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:57:32] [INFO ] Computing Do-Not-Accords matrix : 262 transitions.
[2024-05-29 07:57:32] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:57:32] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6167214813912395292
Running compilation step : cd /tmp/ltsmin6167214813912395292;'/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'
Compilation finished in 606 ms.
Running link step : cd /tmp/ltsmin6167214813912395292;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin6167214813912395292;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1675842637466057232.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 312 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 312/312 places, 262/262 transitions.
Applied a total of 0 rules in 19 ms. Remains 312 /312 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2024-05-29 07:57:47] [INFO ] Invariant cache hit.
[2024-05-29 07:57:47] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-05-29 07:57:47] [INFO ] Invariant cache hit.
[2024-05-29 07:57:47] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
[2024-05-29 07:57:47] [INFO ] Redundant transitions in 0 ms returned []
Running 259 sub problems to find dead transitions.
[2024-05-29 07:57:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 110/110 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 07:57:50] [INFO ] Deduced a trap composed of 13 places in 18 ms of which 1 ms to minimize.
[2024-05-29 07:57:50] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2024-05-29 07:57:50] [INFO ] Deduced a trap composed of 42 places in 35 ms of which 0 ms to minimize.
[2024-05-29 07:57:50] [INFO ] Deduced a trap composed of 56 places in 37 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 4/114 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (OVERLAPS) 1/312 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 07:57:54] [INFO ] Deduced a trap composed of 75 places in 44 ms of which 1 ms to minimize.
[2024-05-29 07:57:54] [INFO ] Deduced a trap composed of 89 places in 47 ms of which 0 ms to minimize.
[2024-05-29 07:57:54] [INFO ] Deduced a trap composed of 104 places in 49 ms of which 1 ms to minimize.
[2024-05-29 07:57:55] [INFO ] Deduced a trap composed of 119 places in 54 ms of which 1 ms to minimize.
[2024-05-29 07:57:55] [INFO ] Deduced a trap composed of 133 places in 65 ms of which 1 ms to minimize.
[2024-05-29 07:57:55] [INFO ] Deduced a trap composed of 145 places in 61 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 6/121 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 07:57:56] [INFO ] Deduced a trap composed of 119 places in 54 ms of which 1 ms to minimize.
[2024-05-29 07:57:56] [INFO ] Deduced a trap composed of 115 places in 52 ms of which 1 ms to minimize.
[2024-05-29 07:57:56] [INFO ] Deduced a trap composed of 115 places in 49 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 3/124 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 07:57:58] [INFO ] Deduced a trap composed of 88 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 07:58:01] [INFO ] Deduced a trap composed of 103 places in 45 ms of which 1 ms to minimize.
[2024-05-29 07:58:01] [INFO ] Deduced a trap composed of 116 places in 50 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 9 (OVERLAPS) 262/574 variables, 312/439 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 07:58:04] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/574 variables, 1/440 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 07:58:06] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/574 variables, 1/441 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/574 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 13 (OVERLAPS) 0/574 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 259 unsolved
No progress, stopping.
After SMT solving in domain Real declared 574/574 variables, and 441 constraints, problems are : Problem set: 0 solved, 259 unsolved in 26732 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 259 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 110/110 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 6/116 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (OVERLAPS) 1/312 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 12/129 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (OVERLAPS) 262/574 variables, 312/441 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/574 variables, 259/700 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/574 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 574/574 variables, and 700 constraints, problems are : Problem set: 0 solved, 259 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 18/18 constraints]
After SMT, in 56781ms problems are : Problem set: 0 solved, 259 unsolved
Search for dead transitions found 0 dead transitions in 56784ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 57185 ms. Remains : 312/312 places, 262/262 transitions.
Built C files in :
/tmp/ltsmin16624038829268785580
[2024-05-29 07:58:44] [INFO ] Computing symmetric may disable matrix : 262 transitions.
[2024-05-29 07:58:44] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:58:44] [INFO ] Computing symmetric may enable matrix : 262 transitions.
[2024-05-29 07:58:44] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:58:44] [INFO ] Computing Do-Not-Accords matrix : 262 transitions.
[2024-05-29 07:58:44] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:58:44] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16624038829268785580
Running compilation step : cd /tmp/ltsmin16624038829268785580;'/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'
Compilation finished in 593 ms.
Running link step : cd /tmp/ltsmin16624038829268785580;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin16624038829268785580;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17707818914277189304.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 07:58:59] [INFO ] Flatten gal took : 26 ms
[2024-05-29 07:58:59] [INFO ] Flatten gal took : 13 ms
[2024-05-29 07:58:59] [INFO ] Time to serialize gal into /tmp/LTL10840470418823629777.gal : 2 ms
[2024-05-29 07:58:59] [INFO ] Time to serialize properties into /tmp/LTL11181637944033338657.prop : 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/LTL10840470418823629777.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14315030917850868536.hoa' '-atoms' '/tmp/LTL11181637944033338657.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...320
Loading property file /tmp/LTL11181637944033338657.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14315030917850868536.hoa
Detected timeout of ITS tools.
[2024-05-29 07:59:15] [INFO ] Flatten gal took : 10 ms
[2024-05-29 07:59:15] [INFO ] Flatten gal took : 10 ms
[2024-05-29 07:59:15] [INFO ] Time to serialize gal into /tmp/LTL6089813573611999555.gal : 2 ms
[2024-05-29 07:59:15] [INFO ] Time to serialize properties into /tmp/LTL14493440705454139704.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/LTL6089813573611999555.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14493440705454139704.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...276
Read 1 LTL properties
Checking formula 0 : !((F(G("(p335==0)"))))
Formula 0 simplified : GF!"(p335==0)"
Detected timeout of ITS tools.
[2024-05-29 07:59:30] [INFO ] Flatten gal took : 10 ms
[2024-05-29 07:59:30] [INFO ] Applying decomposition
[2024-05-29 07:59:30] [INFO ] Flatten gal took : 9 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/graph15168057221203588698.txt' '-o' '/tmp/graph15168057221203588698.bin' '-w' '/tmp/graph15168057221203588698.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15168057221203588698.bin' '-l' '-1' '-v' '-w' '/tmp/graph15168057221203588698.weights' '-q' '0' '-e' '0.001'
[2024-05-29 07:59:30] [INFO ] Decomposing Gal with order
[2024-05-29 07:59:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 07:59:30] [INFO ] Removed a total of 61 redundant transitions.
[2024-05-29 07:59:30] [INFO ] Flatten gal took : 22 ms
[2024-05-29 07:59:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 116 labels/synchronizations in 4 ms.
[2024-05-29 07:59:30] [INFO ] Time to serialize gal into /tmp/LTL12871749714457780963.gal : 11 ms
[2024-05-29 07:59:30] [INFO ] Time to serialize properties into /tmp/LTL3169628642304873096.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/LTL12871749714457780963.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3169628642304873096.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 : !((F(G("(i4.i3.u55.p335==0)"))))
Formula 0 simplified : GF!"(i4.i3.u55.p335==0)"
Detected timeout of ITS tools.
Treatment of property ShieldPPPs-PT-010B-LTLFireability-04 finished in 250226 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 U p1))))'
Support contains 3 out of 618 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 618/618 places, 568/568 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 72 place count 617 transition count 495
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 144 place count 545 transition count 495
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 144 place count 545 transition count 445
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 244 place count 495 transition count 445
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 249 place count 490 transition count 440
Iterating global reduction 2 with 5 rules applied. Total rules applied 254 place count 490 transition count 440
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 254 place count 490 transition count 436
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 262 place count 486 transition count 436
Performed 172 Post agglomeration using F-continuation condition.Transition count delta: 172
Deduced a syphon composed of 172 places in 0 ms
Reduce places removed 172 places and 0 transitions.
Iterating global reduction 2 with 344 rules applied. Total rules applied 606 place count 314 transition count 264
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 608 place count 312 transition count 262
Applied a total of 608 rules in 43 ms. Remains 312 /618 variables (removed 306) and now considering 262/568 (removed 306) transitions.
// Phase 1: matrix 262 rows 312 cols
[2024-05-29 07:59:45] [INFO ] Computed 111 invariants in 2 ms
[2024-05-29 07:59:45] [INFO ] Implicit Places using invariants in 142 ms returned []
[2024-05-29 07:59:45] [INFO ] Invariant cache hit.
[2024-05-29 07:59:45] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
[2024-05-29 07:59:45] [INFO ] Redundant transitions in 1 ms returned []
Running 260 sub problems to find dead transitions.
[2024-05-29 07:59:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:59:47] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-29 07:59:47] [INFO ] Deduced a trap composed of 29 places in 22 ms of which 0 ms to minimize.
[2024-05-29 07:59:48] [INFO ] Deduced a trap composed of 42 places in 29 ms of which 1 ms to minimize.
[2024-05-29 07:59:48] [INFO ] Deduced a trap composed of 57 places in 40 ms of which 0 ms to minimize.
[2024-05-29 07:59:48] [INFO ] Deduced a trap composed of 72 places in 39 ms of which 1 ms to minimize.
[2024-05-29 07:59:48] [INFO ] Deduced a trap composed of 87 places in 46 ms of which 1 ms to minimize.
[2024-05-29 07:59:48] [INFO ] Deduced a trap composed of 101 places in 52 ms of which 0 ms to minimize.
[2024-05-29 07:59:48] [INFO ] Deduced a trap composed of 118 places in 49 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 8/119 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:59:49] [INFO ] Deduced a trap composed of 72 places in 40 ms of which 1 ms to minimize.
[2024-05-29 07:59:50] [INFO ] Deduced a trap composed of 73 places in 38 ms of which 1 ms to minimize.
[2024-05-29 07:59:50] [INFO ] Deduced a trap composed of 71 places in 37 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/312 variables, 3/122 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (OVERLAPS) 262/574 variables, 312/434 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:59:53] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/574 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/574 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (OVERLAPS) 0/574 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 574/574 variables, and 435 constraints, problems are : Problem set: 0 solved, 260 unsolved in 14672 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 12/123 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/312 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 262/574 variables, 312/435 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/574 variables, 260/695 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 08:00:04] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2024-05-29 08:00:07] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 574/574 variables, and 697 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 14/14 constraints]
After SMT, in 44711ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 44713ms
Starting structural reductions in SI_LTL mode, iteration 1 : 312/618 places, 262/568 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 45132 ms. Remains : 312/618 places, 262/568 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-010B-LTLFireability-05
Stuttering criterion allowed to conclude after 603 steps with 0 reset in 8 ms.
FORMULA ShieldPPPs-PT-010B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-010B-LTLFireability-05 finished in 45235 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p1)||(!p2 U p3)||p0)))'
Support contains 7 out of 618 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 618/618 places, 568/568 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 612 transition count 562
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 612 transition count 562
Applied a total of 12 rules in 18 ms. Remains 612 /618 variables (removed 6) and now considering 562/568 (removed 6) transitions.
// Phase 1: matrix 562 rows 612 cols
[2024-05-29 08:00:30] [INFO ] Computed 111 invariants in 6 ms
[2024-05-29 08:00:30] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-05-29 08:00:30] [INFO ] Invariant cache hit.
[2024-05-29 08:00:31] [INFO ] Implicit Places using invariants and state equation in 388 ms returned []
Implicit Place search using SMT with State Equation took 573 ms to find 0 implicit places.
Running 561 sub problems to find dead transitions.
[2024-05-29 08:00:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/611 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (OVERLAPS) 1/612 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-05-29 08:00:41] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2024-05-29 08:00:41] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-29 08:00:41] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-29 08:00:41] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-29 08:00:42] [INFO ] Deduced a trap composed of 18 places in 167 ms of which 3 ms to minimize.
[2024-05-29 08:00:42] [INFO ] Deduced a trap composed of 20 places in 151 ms of which 4 ms to minimize.
[2024-05-29 08:00:42] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-29 08:00:42] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-29 08:00:42] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 0 ms to minimize.
[2024-05-29 08:00:42] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-29 08:00:42] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-05-29 08:00:42] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 0 ms to minimize.
[2024-05-29 08:00:42] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-29 08:00:42] [INFO ] Deduced a trap composed of 23 places in 149 ms of which 3 ms to minimize.
[2024-05-29 08:00:43] [INFO ] Deduced a trap composed of 21 places in 144 ms of which 3 ms to minimize.
[2024-05-29 08:00:43] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 0 ms to minimize.
[2024-05-29 08:00:43] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2024-05-29 08:00:43] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
[2024-05-29 08:00:43] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-29 08:00:43] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/612 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-05-29 08:00:44] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-05-29 08:00:45] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 0 ms to minimize.
[2024-05-29 08:00:45] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2024-05-29 08:00:45] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
[2024-05-29 08:00:45] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-29 08:00:45] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
[2024-05-29 08:00:45] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-29 08:00:45] [INFO ] Deduced a trap composed of 18 places in 138 ms of which 3 ms to minimize.
[2024-05-29 08:00:45] [INFO ] Deduced a trap composed of 26 places in 138 ms of which 3 ms to minimize.
[2024-05-29 08:00:46] [INFO ] Deduced a trap composed of 27 places in 124 ms of which 3 ms to minimize.
[2024-05-29 08:00:46] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-29 08:00:46] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-29 08:00:46] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-29 08:00:46] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-29 08:00:46] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-29 08:00:46] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-05-29 08:00:46] [INFO ] Deduced a trap composed of 21 places in 142 ms of which 4 ms to minimize.
[2024-05-29 08:00:46] [INFO ] Deduced a trap composed of 29 places in 126 ms of which 3 ms to minimize.
[2024-05-29 08:00:47] [INFO ] Deduced a trap composed of 43 places in 108 ms of which 2 ms to minimize.
[2024-05-29 08:00:47] [INFO ] Deduced a trap composed of 22 places in 104 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/612 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-05-29 08:00:53] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-29 08:00:53] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 1 ms to minimize.
[2024-05-29 08:00:53] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-05-29 08:00:53] [INFO ] Deduced a trap composed of 20 places in 168 ms of which 3 ms to minimize.
[2024-05-29 08:00:53] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-29 08:00:54] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-05-29 08:00:54] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-29 08:00:54] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-05-29 08:00:54] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-29 08:00:54] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-29 08:00:54] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-29 08:00:54] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
[2024-05-29 08:00:55] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
[2024-05-29 08:00:55] [INFO ] Deduced a trap composed of 20 places in 103 ms of which 2 ms to minimize.
[2024-05-29 08:00:55] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 2 ms to minimize.
[2024-05-29 08:00:55] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-05-29 08:00:55] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
[2024-05-29 08:00:55] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-29 08:00:55] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-05-29 08:00:55] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/612 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-05-29 08:00:57] [INFO ] Deduced a trap composed of 21 places in 21 ms of which 1 ms to minimize.
[2024-05-29 08:00:58] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 1 ms to minimize.
[2024-05-29 08:00:58] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-05-29 08:00:58] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 2 ms to minimize.
[2024-05-29 08:00:58] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-29 08:00:58] [INFO ] Deduced a trap composed of 46 places in 57 ms of which 1 ms to minimize.
[2024-05-29 08:00:59] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-05-29 08:00:59] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-29 08:00:59] [INFO ] Deduced a trap composed of 49 places in 62 ms of which 1 ms to minimize.
[2024-05-29 08:00:59] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 2 ms to minimize.
[2024-05-29 08:00:59] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 1 ms to minimize.
[2024-05-29 08:00:59] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-05-29 08:00:59] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 0 ms to minimize.
[2024-05-29 08:00:59] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
[2024-05-29 08:00:59] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 1 ms to minimize.
[2024-05-29 08:01:00] [INFO ] Deduced a trap composed of 42 places in 70 ms of which 2 ms to minimize.
[2024-05-29 08:01:00] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 1 ms to minimize.
[2024-05-29 08:01:00] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-29 08:01:00] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-05-29 08:01:00] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/612 variables, 20/191 constraints. Problems are: Problem set: 0 solved, 561 unsolved
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 612/1174 variables, and 191 constraints, problems are : Problem set: 0 solved, 561 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/612 constraints, PredecessorRefiner: 561/561 constraints, Known Traps: 80/80 constraints]
Escalating to Integer solving :Problem set: 0 solved, 561 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/611 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (OVERLAPS) 1/612 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/612 variables, 80/191 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-05-29 08:01:07] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-29 08:01:07] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 0 ms to minimize.
[2024-05-29 08:01:08] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 2 ms to minimize.
[2024-05-29 08:01:08] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-05-29 08:01:08] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-29 08:01:08] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-29 08:01:08] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-29 08:01:08] [INFO ] Deduced a trap composed of 48 places in 50 ms of which 1 ms to minimize.
[2024-05-29 08:01:08] [INFO ] Deduced a trap composed of 49 places in 133 ms of which 3 ms to minimize.
[2024-05-29 08:01:09] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 3 ms to minimize.
[2024-05-29 08:01:09] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-29 08:01:09] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-29 08:01:09] [INFO ] Deduced a trap composed of 27 places in 25 ms of which 1 ms to minimize.
[2024-05-29 08:01:09] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-29 08:01:09] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-29 08:01:09] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 2 ms to minimize.
[2024-05-29 08:01:10] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2024-05-29 08:01:10] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2024-05-29 08:01:10] [INFO ] Deduced a trap composed of 28 places in 26 ms of which 0 ms to minimize.
[2024-05-29 08:01:10] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/612 variables, 20/211 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-05-29 08:01:11] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
[2024-05-29 08:01:12] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-05-29 08:01:12] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-29 08:01:12] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-29 08:01:12] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-05-29 08:01:12] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-29 08:01:13] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-05-29 08:01:13] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 1 ms to minimize.
[2024-05-29 08:01:14] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2024-05-29 08:01:14] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2024-05-29 08:01:14] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
[2024-05-29 08:01:14] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-29 08:01:14] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 0 ms to minimize.
[2024-05-29 08:01:14] [INFO ] Deduced a trap composed of 29 places in 27 ms of which 1 ms to minimize.
[2024-05-29 08:01:14] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-05-29 08:01:14] [INFO ] Deduced a trap composed of 26 places in 26 ms of which 0 ms to minimize.
[2024-05-29 08:01:14] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-05-29 08:01:14] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-05-29 08:01:15] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 1 ms to minimize.
[2024-05-29 08:01:15] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/612 variables, 20/231 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-05-29 08:01:17] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-05-29 08:01:17] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-29 08:01:17] [INFO ] Deduced a trap composed of 41 places in 63 ms of which 1 ms to minimize.
[2024-05-29 08:01:17] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 1 ms to minimize.
[2024-05-29 08:01:17] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-05-29 08:01:17] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-29 08:01:17] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-29 08:01:18] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2024-05-29 08:01:19] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
[2024-05-29 08:01:19] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-29 08:01:19] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 1 ms to minimize.
[2024-05-29 08:01:19] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-05-29 08:01:19] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 1 ms to minimize.
[2024-05-29 08:01:19] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2024-05-29 08:01:19] [INFO ] Deduced a trap composed of 34 places in 27 ms of which 1 ms to minimize.
[2024-05-29 08:01:19] [INFO ] Deduced a trap composed of 30 places in 27 ms of which 0 ms to minimize.
[2024-05-29 08:01:19] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 1 ms to minimize.
[2024-05-29 08:01:20] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-05-29 08:01:20] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-05-29 08:01:20] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/612 variables, 20/251 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-05-29 08:01:22] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2024-05-29 08:01:22] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 0 ms to minimize.
[2024-05-29 08:01:22] [INFO ] Deduced a trap composed of 27 places in 26 ms of which 1 ms to minimize.
[2024-05-29 08:01:22] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-05-29 08:01:22] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 0 ms to minimize.
[2024-05-29 08:01:22] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-05-29 08:01:22] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-05-29 08:01:23] [INFO ] Deduced a trap composed of 33 places in 138 ms of which 6 ms to minimize.
[2024-05-29 08:01:23] [INFO ] Deduced a trap composed of 34 places in 111 ms of which 3 ms to minimize.
[2024-05-29 08:01:23] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
[2024-05-29 08:01:23] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 1 ms to minimize.
[2024-05-29 08:01:23] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 0 ms to minimize.
[2024-05-29 08:01:23] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-05-29 08:01:24] [INFO ] Deduced a trap composed of 47 places in 60 ms of which 1 ms to minimize.
[2024-05-29 08:01:24] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-05-29 08:01:24] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-29 08:01:24] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-29 08:01:24] [INFO ] Deduced a trap composed of 56 places in 72 ms of which 1 ms to minimize.
[2024-05-29 08:01:25] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-29 08:01:25] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/612 variables, 20/271 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-05-29 08:01:27] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-29 08:01:27] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 0 ms to minimize.
[2024-05-29 08:01:27] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-05-29 08:01:27] [INFO ] Deduced a trap composed of 43 places in 45 ms of which 1 ms to minimize.
[2024-05-29 08:01:27] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-29 08:01:28] [INFO ] Deduced a trap composed of 50 places in 40 ms of which 0 ms to minimize.
[2024-05-29 08:01:28] [INFO ] Deduced a trap composed of 49 places in 51 ms of which 1 ms to minimize.
[2024-05-29 08:01:28] [INFO ] Deduced a trap composed of 49 places in 58 ms of which 1 ms to minimize.
[2024-05-29 08:01:29] [INFO ] Deduced a trap composed of 50 places in 62 ms of which 2 ms to minimize.
[2024-05-29 08:01:29] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 0 ms to minimize.
[2024-05-29 08:01:29] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 2 ms to minimize.
[2024-05-29 08:01:29] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 2 ms to minimize.
[2024-05-29 08:01:30] [INFO ] Deduced a trap composed of 47 places in 90 ms of which 2 ms to minimize.
[2024-05-29 08:01:31] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
SMT process timed out in 60071ms, After SMT, problems are : Problem set: 0 solved, 561 unsolved
Search for dead transitions found 0 dead transitions in 60076ms
Starting structural reductions in LTL mode, iteration 1 : 612/618 places, 562/568 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60670 ms. Remains : 612/618 places, 562/568 transitions.
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p3)), true, (NOT p3)]
Running random walk in product with property : ShieldPPPs-PT-010B-LTLFireability-06
Entered a terminal (fully accepting) state of product in 487 steps with 0 reset in 4 ms.
FORMULA ShieldPPPs-PT-010B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-010B-LTLFireability-06 finished in 60852 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&&G(F(p1)))) U G(p2)))'
Support contains 5 out of 618 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 618/618 places, 568/568 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 617 transition count 496
Reduce places removed 71 places and 0 transitions.
Iterating post reduction 1 with 71 rules applied. Total rules applied 142 place count 546 transition count 496
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 142 place count 546 transition count 446
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 242 place count 496 transition count 446
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 247 place count 491 transition count 441
Iterating global reduction 2 with 5 rules applied. Total rules applied 252 place count 491 transition count 441
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 252 place count 491 transition count 437
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 260 place count 487 transition count 437
Performed 171 Post agglomeration using F-continuation condition.Transition count delta: 171
Deduced a syphon composed of 171 places in 0 ms
Reduce places removed 171 places and 0 transitions.
Iterating global reduction 2 with 342 rules applied. Total rules applied 602 place count 316 transition count 266
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 604 place count 314 transition count 264
Applied a total of 604 rules in 52 ms. Remains 314 /618 variables (removed 304) and now considering 264/568 (removed 304) transitions.
// Phase 1: matrix 264 rows 314 cols
[2024-05-29 08:01:31] [INFO ] Computed 111 invariants in 1 ms
[2024-05-29 08:01:31] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-05-29 08:01:31] [INFO ] Invariant cache hit.
[2024-05-29 08:01:31] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
[2024-05-29 08:01:31] [INFO ] Redundant transitions in 1 ms returned []
Running 262 sub problems to find dead transitions.
[2024-05-29 08:01:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/313 variables, 110/110 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-29 08:01:34] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 0 ms to minimize.
[2024-05-29 08:01:34] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 0 ms to minimize.
[2024-05-29 08:01:34] [INFO ] Deduced a trap composed of 42 places in 30 ms of which 1 ms to minimize.
[2024-05-29 08:01:34] [INFO ] Deduced a trap composed of 57 places in 37 ms of which 1 ms to minimize.
[2024-05-29 08:01:34] [INFO ] Deduced a trap composed of 72 places in 43 ms of which 1 ms to minimize.
[2024-05-29 08:01:34] [INFO ] Deduced a trap composed of 87 places in 46 ms of which 1 ms to minimize.
[2024-05-29 08:01:34] [INFO ] Deduced a trap composed of 102 places in 47 ms of which 1 ms to minimize.
[2024-05-29 08:01:34] [INFO ] Deduced a trap composed of 118 places in 52 ms of which 1 ms to minimize.
[2024-05-29 08:01:34] [INFO ] Deduced a trap composed of 133 places in 54 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/313 variables, 9/119 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/313 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (OVERLAPS) 1/314 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/314 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (OVERLAPS) 264/578 variables, 314/434 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (OVERLAPS) 0/578 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 578/578 variables, and 434 constraints, problems are : Problem set: 0 solved, 262 unsolved in 12533 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 314/314 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/313 variables, 110/110 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/313 variables, 9/119 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/313 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (OVERLAPS) 1/314 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/314 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (OVERLAPS) 264/578 variables, 314/434 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 262/696 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/578 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 578/578 variables, and 696 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 314/314 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 9/9 constraints]
After SMT, in 42570ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 42572ms
Starting structural reductions in SI_LTL mode, iteration 1 : 314/618 places, 264/568 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 43006 ms. Remains : 314/618 places, 264/568 transitions.
Stuttering acceptance computed with spot in 129 ms :[(NOT p2), (NOT p1), (AND (NOT p1) p2), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-010B-LTLFireability-07
Product exploration explored 100000 steps with 750 reset in 424 ms.
Product exploration explored 100000 steps with 669 reset in 424 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p2 (NOT p1)))), (X (AND (NOT p2) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 118 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 139 ms :[(NOT p2), (NOT p1), (AND (NOT p1) p2), (NOT p0)]
RANDOM walk for 4307 steps (4 resets) in 32 ms. (130 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p2 (NOT p1)))), (X (AND (NOT p2) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p2) (NOT p1)))), (F p1), (F p2), (F (NOT (OR (NOT p2) p1))), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 13 factoid took 298 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 136 ms :[(NOT p2), (NOT p1), (AND (NOT p1) p2), (NOT p0)]
Stuttering acceptance computed with spot in 137 ms :[(NOT p2), (NOT p1), (AND (NOT p1) p2), (NOT p0)]
[2024-05-29 08:02:16] [INFO ] Invariant cache hit.
Proved EG (NOT p2)
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p2 (NOT p1)))), (X (AND (NOT p2) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p2) (NOT p1)))), (F p1), (F p2), (F (NOT (OR (NOT p2) p1))), (F (NOT (AND (NOT p0) (NOT p2)))), (G (NOT p2))]
Property proved to be false thanks to negative knowledge :(G (NOT p2))
Knowledge based reduction with 13 factoid took 363 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPs-PT-010B-LTLFireability-07 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-010B-LTLFireability-07 finished in 45363 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 618 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 618/618 places, 568/568 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 617 transition count 496
Reduce places removed 71 places and 0 transitions.
Iterating post reduction 1 with 71 rules applied. Total rules applied 142 place count 546 transition count 496
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 142 place count 546 transition count 446
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 242 place count 496 transition count 446
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 247 place count 491 transition count 441
Iterating global reduction 2 with 5 rules applied. Total rules applied 252 place count 491 transition count 441
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 252 place count 491 transition count 437
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 260 place count 487 transition count 437
Performed 173 Post agglomeration using F-continuation condition.Transition count delta: 173
Deduced a syphon composed of 173 places in 0 ms
Reduce places removed 173 places and 0 transitions.
Iterating global reduction 2 with 346 rules applied. Total rules applied 606 place count 314 transition count 264
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 608 place count 312 transition count 262
Applied a total of 608 rules in 44 ms. Remains 312 /618 variables (removed 306) and now considering 262/568 (removed 306) transitions.
// Phase 1: matrix 262 rows 312 cols
[2024-05-29 08:02:16] [INFO ] Computed 111 invariants in 2 ms
[2024-05-29 08:02:16] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-29 08:02:16] [INFO ] Invariant cache hit.
[2024-05-29 08:02:17] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 369 ms to find 0 implicit places.
[2024-05-29 08:02:17] [INFO ] Redundant transitions in 1 ms returned []
Running 259 sub problems to find dead transitions.
[2024-05-29 08:02:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 110/110 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:02:19] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-05-29 08:02:19] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 0 ms to minimize.
[2024-05-29 08:02:19] [INFO ] Deduced a trap composed of 42 places in 36 ms of which 1 ms to minimize.
[2024-05-29 08:02:19] [INFO ] Deduced a trap composed of 56 places in 42 ms of which 0 ms to minimize.
[2024-05-29 08:02:19] [INFO ] Deduced a trap composed of 73 places in 35 ms of which 1 ms to minimize.
[2024-05-29 08:02:19] [INFO ] Deduced a trap composed of 85 places in 46 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 6/116 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (OVERLAPS) 1/312 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:02:23] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2024-05-29 08:02:23] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2024-05-29 08:02:23] [INFO ] Deduced a trap composed of 6 places in 15 ms of which 1 ms to minimize.
[2024-05-29 08:02:24] [INFO ] Deduced a trap composed of 103 places in 50 ms of which 1 ms to minimize.
[2024-05-29 08:02:24] [INFO ] Deduced a trap composed of 115 places in 54 ms of which 1 ms to minimize.
[2024-05-29 08:02:24] [INFO ] Deduced a trap composed of 130 places in 56 ms of which 1 ms to minimize.
[2024-05-29 08:02:24] [INFO ] Deduced a trap composed of 147 places in 57 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 7/124 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:02:25] [INFO ] Deduced a trap composed of 114 places in 51 ms of which 1 ms to minimize.
[2024-05-29 08:02:25] [INFO ] Deduced a trap composed of 117 places in 45 ms of which 1 ms to minimize.
[2024-05-29 08:02:25] [INFO ] Deduced a trap composed of 115 places in 45 ms of which 1 ms to minimize.
[2024-05-29 08:02:25] [INFO ] Deduced a trap composed of 114 places in 46 ms of which 1 ms to minimize.
[2024-05-29 08:02:26] [INFO ] Deduced a trap composed of 115 places in 44 ms of which 1 ms to minimize.
[2024-05-29 08:02:26] [INFO ] Deduced a trap composed of 117 places in 44 ms of which 1 ms to minimize.
[2024-05-29 08:02:26] [INFO ] Deduced a trap composed of 115 places in 49 ms of which 1 ms to minimize.
[2024-05-29 08:02:26] [INFO ] Deduced a trap composed of 69 places in 46 ms of which 1 ms to minimize.
[2024-05-29 08:02:26] [INFO ] Deduced a trap composed of 98 places in 44 ms of which 1 ms to minimize.
[2024-05-29 08:02:26] [INFO ] Deduced a trap composed of 99 places in 48 ms of which 1 ms to minimize.
[2024-05-29 08:02:26] [INFO ] Deduced a trap composed of 99 places in 45 ms of which 1 ms to minimize.
[2024-05-29 08:02:26] [INFO ] Deduced a trap composed of 97 places in 45 ms of which 1 ms to minimize.
[2024-05-29 08:02:26] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
[2024-05-29 08:02:26] [INFO ] Deduced a trap composed of 71 places in 44 ms of which 1 ms to minimize.
[2024-05-29 08:02:26] [INFO ] Deduced a trap composed of 70 places in 44 ms of which 1 ms to minimize.
[2024-05-29 08:02:26] [INFO ] Deduced a trap composed of 69 places in 45 ms of which 1 ms to minimize.
[2024-05-29 08:02:26] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
[2024-05-29 08:02:26] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 1 ms to minimize.
[2024-05-29 08:02:26] [INFO ] Deduced a trap composed of 71 places in 45 ms of which 1 ms to minimize.
[2024-05-29 08:02:26] [INFO ] Deduced a trap composed of 69 places in 51 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 20/144 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:02:27] [INFO ] Deduced a trap composed of 39 places in 34 ms of which 0 ms to minimize.
[2024-05-29 08:02:28] [INFO ] Deduced a trap composed of 72 places in 42 ms of which 1 ms to minimize.
[2024-05-29 08:02:28] [INFO ] Deduced a trap composed of 70 places in 34 ms of which 0 ms to minimize.
[2024-05-29 08:02:28] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-29 08:02:28] [INFO ] Deduced a trap composed of 83 places in 66 ms of which 1 ms to minimize.
[2024-05-29 08:02:28] [INFO ] Deduced a trap composed of 99 places in 61 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 6/150 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:02:31] [INFO ] Deduced a trap composed of 83 places in 46 ms of which 1 ms to minimize.
[2024-05-29 08:02:31] [INFO ] Deduced a trap composed of 84 places in 39 ms of which 1 ms to minimize.
[2024-05-29 08:02:31] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
[2024-05-29 08:02:31] [INFO ] Deduced a trap composed of 126 places in 58 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 4/154 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:02:31] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:02:34] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 1 ms to minimize.
[2024-05-29 08:02:34] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 2/157 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:02:37] [INFO ] Deduced a trap composed of 129 places in 58 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:02:38] [INFO ] Deduced a trap composed of 115 places in 51 ms of which 1 ms to minimize.
[2024-05-29 08:02:38] [INFO ] Deduced a trap composed of 114 places in 44 ms of which 1 ms to minimize.
[2024-05-29 08:02:39] [INFO ] Deduced a trap composed of 114 places in 47 ms of which 1 ms to minimize.
[2024-05-29 08:02:39] [INFO ] Deduced a trap composed of 117 places in 43 ms of which 1 ms to minimize.
[2024-05-29 08:02:39] [INFO ] Deduced a trap composed of 115 places in 43 ms of which 1 ms to minimize.
[2024-05-29 08:02:39] [INFO ] Deduced a trap composed of 115 places in 44 ms of which 1 ms to minimize.
[2024-05-29 08:02:39] [INFO ] Deduced a trap composed of 116 places in 45 ms of which 1 ms to minimize.
[2024-05-29 08:02:39] [INFO ] Deduced a trap composed of 115 places in 42 ms of which 1 ms to minimize.
[2024-05-29 08:02:39] [INFO ] Deduced a trap composed of 112 places in 45 ms of which 1 ms to minimize.
[2024-05-29 08:02:39] [INFO ] Deduced a trap composed of 146 places in 61 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/312 variables, 10/168 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:02:40] [INFO ] Deduced a trap composed of 54 places in 42 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/312 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:02:43] [INFO ] Deduced a trap composed of 133 places in 57 ms of which 1 ms to minimize.
[2024-05-29 08:02:43] [INFO ] Deduced a trap composed of 132 places in 49 ms of which 1 ms to minimize.
[2024-05-29 08:02:44] [INFO ] Deduced a trap composed of 135 places in 47 ms of which 1 ms to minimize.
[2024-05-29 08:02:44] [INFO ] Deduced a trap composed of 129 places in 47 ms of which 1 ms to minimize.
[2024-05-29 08:02:44] [INFO ] Deduced a trap composed of 132 places in 48 ms of which 1 ms to minimize.
[2024-05-29 08:02:44] [INFO ] Deduced a trap composed of 129 places in 44 ms of which 1 ms to minimize.
[2024-05-29 08:02:44] [INFO ] Deduced a trap composed of 133 places in 45 ms of which 2 ms to minimize.
[2024-05-29 08:02:44] [INFO ] Deduced a trap composed of 128 places in 46 ms of which 1 ms to minimize.
[2024-05-29 08:02:44] [INFO ] Deduced a trap composed of 133 places in 47 ms of which 1 ms to minimize.
[2024-05-29 08:02:44] [INFO ] Deduced a trap composed of 128 places in 46 ms of which 1 ms to minimize.
[2024-05-29 08:02:44] [INFO ] Deduced a trap composed of 129 places in 47 ms of which 1 ms to minimize.
[2024-05-29 08:02:44] [INFO ] Deduced a trap composed of 127 places in 47 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/312 variables, 12/181 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:02:46] [INFO ] Deduced a trap composed of 117 places in 45 ms of which 1 ms to minimize.
[2024-05-29 08:02:46] [INFO ] Deduced a trap composed of 115 places in 45 ms of which 1 ms to minimize.
[2024-05-29 08:02:46] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 1 ms to minimize.
[2024-05-29 08:02:46] [INFO ] Deduced a trap composed of 115 places in 42 ms of which 1 ms to minimize.
[2024-05-29 08:02:46] [INFO ] Deduced a trap composed of 114 places in 44 ms of which 1 ms to minimize.
[2024-05-29 08:02:46] [INFO ] Deduced a trap composed of 113 places in 43 ms of which 1 ms to minimize.
[2024-05-29 08:02:46] [INFO ] Deduced a trap composed of 99 places in 43 ms of which 1 ms to minimize.
[2024-05-29 08:02:46] [INFO ] Deduced a trap composed of 113 places in 44 ms of which 1 ms to minimize.
[2024-05-29 08:02:46] [INFO ] Deduced a trap composed of 100 places in 45 ms of which 1 ms to minimize.
[2024-05-29 08:02:46] [INFO ] Deduced a trap composed of 101 places in 42 ms of which 1 ms to minimize.
[2024-05-29 08:02:46] [INFO ] Deduced a trap composed of 114 places in 43 ms of which 1 ms to minimize.
[2024-05-29 08:02:46] [INFO ] Deduced a trap composed of 113 places in 41 ms of which 1 ms to minimize.
[2024-05-29 08:02:46] [INFO ] Deduced a trap composed of 112 places in 44 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/312 variables, 13/194 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 312/574 variables, and 194 constraints, problems are : Problem set: 0 solved, 259 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/312 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 83/83 constraints]
Escalating to Integer solving :Problem set: 0 solved, 259 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 110/110 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 83/193 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (OVERLAPS) 1/312 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (OVERLAPS) 262/574 variables, 312/506 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/574 variables, 259/765 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:02:54] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-29 08:02:54] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
[2024-05-29 08:03:04] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 574/574 variables, and 768 constraints, problems are : Problem set: 0 solved, 259 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 86/86 constraints]
After SMT, in 60047ms problems are : Problem set: 0 solved, 259 unsolved
Search for dead transitions found 0 dead transitions in 60049ms
Starting structural reductions in SI_LTL mode, iteration 1 : 312/618 places, 262/568 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60467 ms. Remains : 312/618 places, 262/568 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-010B-LTLFireability-08
Product exploration explored 100000 steps with 22060 reset in 230 ms.
Product exploration explored 100000 steps with 22194 reset in 286 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/312 stabilizing places and 2/262 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 160 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
RANDOM walk for 13 steps (0 resets) in 5 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 167 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
[2024-05-29 08:03:18] [INFO ] Invariant cache hit.
[2024-05-29 08:03:18] [INFO ] [Real]Absence check using 111 positive place invariants in 22 ms returned sat
[2024-05-29 08:03:18] [INFO ] [Real]Absence check using state equation in 199 ms returned sat
[2024-05-29 08:03:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 08:03:18] [INFO ] [Nat]Absence check using 111 positive place invariants in 26 ms returned sat
[2024-05-29 08:03:18] [INFO ] [Nat]Absence check using state equation in 208 ms returned sat
[2024-05-29 08:03:18] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
[2024-05-29 08:03:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2024-05-29 08:03:18] [INFO ] Computed and/alt/rep : 259/498/259 causal constraints (skipped 0 transitions) in 23 ms.
[2024-05-29 08:03:20] [INFO ] Added : 223 causal constraints over 45 iterations in 1558 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 312 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 312/312 places, 262/262 transitions.
Applied a total of 0 rules in 8 ms. Remains 312 /312 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2024-05-29 08:03:20] [INFO ] Invariant cache hit.
[2024-05-29 08:03:20] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-29 08:03:20] [INFO ] Invariant cache hit.
[2024-05-29 08:03:20] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
[2024-05-29 08:03:20] [INFO ] Redundant transitions in 1 ms returned []
Running 259 sub problems to find dead transitions.
[2024-05-29 08:03:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 110/110 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:03:23] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-05-29 08:03:23] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2024-05-29 08:03:23] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 1 ms to minimize.
[2024-05-29 08:03:23] [INFO ] Deduced a trap composed of 56 places in 38 ms of which 0 ms to minimize.
[2024-05-29 08:03:23] [INFO ] Deduced a trap composed of 73 places in 40 ms of which 1 ms to minimize.
[2024-05-29 08:03:23] [INFO ] Deduced a trap composed of 85 places in 43 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 6/116 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (OVERLAPS) 1/312 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:03:26] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2024-05-29 08:03:27] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
[2024-05-29 08:03:27] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 0 ms to minimize.
[2024-05-29 08:03:27] [INFO ] Deduced a trap composed of 103 places in 52 ms of which 1 ms to minimize.
[2024-05-29 08:03:27] [INFO ] Deduced a trap composed of 115 places in 52 ms of which 1 ms to minimize.
[2024-05-29 08:03:28] [INFO ] Deduced a trap composed of 130 places in 58 ms of which 1 ms to minimize.
[2024-05-29 08:03:28] [INFO ] Deduced a trap composed of 147 places in 66 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 7/124 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:03:29] [INFO ] Deduced a trap composed of 114 places in 52 ms of which 1 ms to minimize.
[2024-05-29 08:03:29] [INFO ] Deduced a trap composed of 117 places in 45 ms of which 1 ms to minimize.
[2024-05-29 08:03:29] [INFO ] Deduced a trap composed of 115 places in 46 ms of which 1 ms to minimize.
[2024-05-29 08:03:29] [INFO ] Deduced a trap composed of 114 places in 47 ms of which 1 ms to minimize.
[2024-05-29 08:03:29] [INFO ] Deduced a trap composed of 115 places in 45 ms of which 1 ms to minimize.
[2024-05-29 08:03:29] [INFO ] Deduced a trap composed of 117 places in 44 ms of which 1 ms to minimize.
[2024-05-29 08:03:29] [INFO ] Deduced a trap composed of 115 places in 46 ms of which 1 ms to minimize.
[2024-05-29 08:03:29] [INFO ] Deduced a trap composed of 69 places in 46 ms of which 1 ms to minimize.
[2024-05-29 08:03:30] [INFO ] Deduced a trap composed of 98 places in 42 ms of which 1 ms to minimize.
[2024-05-29 08:03:30] [INFO ] Deduced a trap composed of 99 places in 44 ms of which 1 ms to minimize.
[2024-05-29 08:03:30] [INFO ] Deduced a trap composed of 99 places in 44 ms of which 1 ms to minimize.
[2024-05-29 08:03:30] [INFO ] Deduced a trap composed of 97 places in 43 ms of which 1 ms to minimize.
[2024-05-29 08:03:30] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
[2024-05-29 08:03:30] [INFO ] Deduced a trap composed of 71 places in 43 ms of which 2 ms to minimize.
[2024-05-29 08:03:30] [INFO ] Deduced a trap composed of 70 places in 50 ms of which 1 ms to minimize.
[2024-05-29 08:03:30] [INFO ] Deduced a trap composed of 69 places in 44 ms of which 1 ms to minimize.
[2024-05-29 08:03:30] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 1 ms to minimize.
[2024-05-29 08:03:30] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
[2024-05-29 08:03:30] [INFO ] Deduced a trap composed of 71 places in 47 ms of which 1 ms to minimize.
[2024-05-29 08:03:30] [INFO ] Deduced a trap composed of 69 places in 50 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 20/144 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:03:31] [INFO ] Deduced a trap composed of 39 places in 33 ms of which 0 ms to minimize.
[2024-05-29 08:03:31] [INFO ] Deduced a trap composed of 72 places in 40 ms of which 0 ms to minimize.
[2024-05-29 08:03:31] [INFO ] Deduced a trap composed of 70 places in 39 ms of which 1 ms to minimize.
[2024-05-29 08:03:31] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-29 08:03:32] [INFO ] Deduced a trap composed of 83 places in 55 ms of which 2 ms to minimize.
[2024-05-29 08:03:32] [INFO ] Deduced a trap composed of 99 places in 63 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 6/150 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:03:35] [INFO ] Deduced a trap composed of 83 places in 45 ms of which 1 ms to minimize.
[2024-05-29 08:03:35] [INFO ] Deduced a trap composed of 84 places in 37 ms of which 1 ms to minimize.
[2024-05-29 08:03:35] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-05-29 08:03:35] [INFO ] Deduced a trap composed of 126 places in 58 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 4/154 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:03:35] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:03:38] [INFO ] Deduced a trap composed of 39 places in 34 ms of which 1 ms to minimize.
[2024-05-29 08:03:38] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 2/157 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:03:41] [INFO ] Deduced a trap composed of 129 places in 51 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:03:42] [INFO ] Deduced a trap composed of 115 places in 48 ms of which 1 ms to minimize.
[2024-05-29 08:03:42] [INFO ] Deduced a trap composed of 114 places in 44 ms of which 1 ms to minimize.
[2024-05-29 08:03:43] [INFO ] Deduced a trap composed of 114 places in 44 ms of which 1 ms to minimize.
[2024-05-29 08:03:43] [INFO ] Deduced a trap composed of 117 places in 43 ms of which 1 ms to minimize.
[2024-05-29 08:03:43] [INFO ] Deduced a trap composed of 115 places in 44 ms of which 1 ms to minimize.
[2024-05-29 08:03:43] [INFO ] Deduced a trap composed of 115 places in 44 ms of which 1 ms to minimize.
[2024-05-29 08:03:43] [INFO ] Deduced a trap composed of 116 places in 46 ms of which 1 ms to minimize.
[2024-05-29 08:03:43] [INFO ] Deduced a trap composed of 115 places in 42 ms of which 1 ms to minimize.
[2024-05-29 08:03:43] [INFO ] Deduced a trap composed of 112 places in 45 ms of which 1 ms to minimize.
[2024-05-29 08:03:43] [INFO ] Deduced a trap composed of 146 places in 57 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/312 variables, 10/168 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:03:44] [INFO ] Deduced a trap composed of 54 places in 41 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/312 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:03:47] [INFO ] Deduced a trap composed of 133 places in 53 ms of which 1 ms to minimize.
[2024-05-29 08:03:47] [INFO ] Deduced a trap composed of 132 places in 49 ms of which 1 ms to minimize.
[2024-05-29 08:03:48] [INFO ] Deduced a trap composed of 135 places in 46 ms of which 1 ms to minimize.
[2024-05-29 08:03:48] [INFO ] Deduced a trap composed of 129 places in 46 ms of which 1 ms to minimize.
[2024-05-29 08:03:48] [INFO ] Deduced a trap composed of 132 places in 51 ms of which 2 ms to minimize.
[2024-05-29 08:03:48] [INFO ] Deduced a trap composed of 129 places in 47 ms of which 1 ms to minimize.
[2024-05-29 08:03:48] [INFO ] Deduced a trap composed of 133 places in 49 ms of which 1 ms to minimize.
[2024-05-29 08:03:48] [INFO ] Deduced a trap composed of 128 places in 48 ms of which 1 ms to minimize.
[2024-05-29 08:03:48] [INFO ] Deduced a trap composed of 133 places in 47 ms of which 1 ms to minimize.
[2024-05-29 08:03:48] [INFO ] Deduced a trap composed of 128 places in 46 ms of which 2 ms to minimize.
[2024-05-29 08:03:48] [INFO ] Deduced a trap composed of 129 places in 52 ms of which 1 ms to minimize.
[2024-05-29 08:03:48] [INFO ] Deduced a trap composed of 127 places in 53 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/312 variables, 12/181 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:03:50] [INFO ] Deduced a trap composed of 117 places in 51 ms of which 1 ms to minimize.
[2024-05-29 08:03:50] [INFO ] Deduced a trap composed of 115 places in 46 ms of which 1 ms to minimize.
[2024-05-29 08:03:50] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 1 ms to minimize.
[2024-05-29 08:03:50] [INFO ] Deduced a trap composed of 115 places in 43 ms of which 1 ms to minimize.
[2024-05-29 08:03:50] [INFO ] Deduced a trap composed of 114 places in 43 ms of which 1 ms to minimize.
[2024-05-29 08:03:50] [INFO ] Deduced a trap composed of 113 places in 42 ms of which 1 ms to minimize.
[2024-05-29 08:03:50] [INFO ] Deduced a trap composed of 99 places in 45 ms of which 1 ms to minimize.
[2024-05-29 08:03:50] [INFO ] Deduced a trap composed of 113 places in 42 ms of which 1 ms to minimize.
[2024-05-29 08:03:50] [INFO ] Deduced a trap composed of 100 places in 52 ms of which 4 ms to minimize.
[2024-05-29 08:03:50] [INFO ] Deduced a trap composed of 101 places in 44 ms of which 1 ms to minimize.
[2024-05-29 08:03:50] [INFO ] Deduced a trap composed of 114 places in 42 ms of which 1 ms to minimize.
[2024-05-29 08:03:50] [INFO ] Deduced a trap composed of 113 places in 43 ms of which 1 ms to minimize.
[2024-05-29 08:03:50] [INFO ] Deduced a trap composed of 112 places in 40 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/312 variables, 13/194 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 312/574 variables, and 194 constraints, problems are : Problem set: 0 solved, 259 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/312 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 83/83 constraints]
Escalating to Integer solving :Problem set: 0 solved, 259 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 110/110 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 83/193 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (OVERLAPS) 1/312 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (OVERLAPS) 262/574 variables, 312/506 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/574 variables, 259/765 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:03:58] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-29 08:03:58] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2024-05-29 08:04:07] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 574/574 variables, and 768 constraints, problems are : Problem set: 0 solved, 259 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 86/86 constraints]
After SMT, in 60048ms problems are : Problem set: 0 solved, 259 unsolved
Search for dead transitions found 0 dead transitions in 60052ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60422 ms. Remains : 312/312 places, 262/262 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/312 stabilizing places and 2/262 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 169 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
RANDOM walk for 6 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 211 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2024-05-29 08:04:21] [INFO ] Invariant cache hit.
[2024-05-29 08:04:21] [INFO ] [Real]Absence check using 111 positive place invariants in 22 ms returned sat
[2024-05-29 08:04:21] [INFO ] [Real]Absence check using state equation in 188 ms returned sat
[2024-05-29 08:04:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 08:04:21] [INFO ] [Nat]Absence check using 111 positive place invariants in 21 ms returned sat
[2024-05-29 08:04:22] [INFO ] [Nat]Absence check using state equation in 216 ms returned sat
[2024-05-29 08:04:22] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
[2024-05-29 08:04:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2024-05-29 08:04:22] [INFO ] Computed and/alt/rep : 259/498/259 causal constraints (skipped 0 transitions) in 13 ms.
[2024-05-29 08:04:23] [INFO ] Added : 223 causal constraints over 45 iterations in 1513 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 21897 reset in 235 ms.
Product exploration explored 100000 steps with 22337 reset in 264 ms.
Built C files in :
/tmp/ltsmin13073706216910206640
[2024-05-29 08:04:24] [INFO ] Computing symmetric may disable matrix : 262 transitions.
[2024-05-29 08:04:24] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 08:04:24] [INFO ] Computing symmetric may enable matrix : 262 transitions.
[2024-05-29 08:04:24] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 08:04:24] [INFO ] Computing Do-Not-Accords matrix : 262 transitions.
[2024-05-29 08:04:24] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 08:04:24] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13073706216910206640
Running compilation step : cd /tmp/ltsmin13073706216910206640;'/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'
Compilation finished in 592 ms.
Running link step : cd /tmp/ltsmin13073706216910206640;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin13073706216910206640;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17038498419640812819.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 312 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 312/312 places, 262/262 transitions.
Applied a total of 0 rules in 13 ms. Remains 312 /312 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2024-05-29 08:04:39] [INFO ] Invariant cache hit.
[2024-05-29 08:04:39] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-05-29 08:04:39] [INFO ] Invariant cache hit.
[2024-05-29 08:04:39] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
[2024-05-29 08:04:39] [INFO ] Redundant transitions in 1 ms returned []
Running 259 sub problems to find dead transitions.
[2024-05-29 08:04:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 110/110 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:04:42] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-05-29 08:04:42] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 0 ms to minimize.
[2024-05-29 08:04:42] [INFO ] Deduced a trap composed of 42 places in 34 ms of which 0 ms to minimize.
[2024-05-29 08:04:42] [INFO ] Deduced a trap composed of 56 places in 33 ms of which 0 ms to minimize.
[2024-05-29 08:04:42] [INFO ] Deduced a trap composed of 73 places in 41 ms of which 0 ms to minimize.
[2024-05-29 08:04:42] [INFO ] Deduced a trap composed of 85 places in 39 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 6/116 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (OVERLAPS) 1/312 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:04:45] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
[2024-05-29 08:04:45] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-05-29 08:04:45] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 1 ms to minimize.
[2024-05-29 08:04:46] [INFO ] Deduced a trap composed of 103 places in 51 ms of which 1 ms to minimize.
[2024-05-29 08:04:46] [INFO ] Deduced a trap composed of 115 places in 55 ms of which 1 ms to minimize.
[2024-05-29 08:04:47] [INFO ] Deduced a trap composed of 130 places in 62 ms of which 2 ms to minimize.
[2024-05-29 08:04:47] [INFO ] Deduced a trap composed of 147 places in 61 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 7/124 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:04:48] [INFO ] Deduced a trap composed of 114 places in 59 ms of which 2 ms to minimize.
[2024-05-29 08:04:48] [INFO ] Deduced a trap composed of 117 places in 52 ms of which 1 ms to minimize.
[2024-05-29 08:04:48] [INFO ] Deduced a trap composed of 115 places in 50 ms of which 1 ms to minimize.
[2024-05-29 08:04:48] [INFO ] Deduced a trap composed of 114 places in 56 ms of which 1 ms to minimize.
[2024-05-29 08:04:48] [INFO ] Deduced a trap composed of 115 places in 50 ms of which 1 ms to minimize.
[2024-05-29 08:04:48] [INFO ] Deduced a trap composed of 117 places in 54 ms of which 1 ms to minimize.
[2024-05-29 08:04:48] [INFO ] Deduced a trap composed of 115 places in 52 ms of which 1 ms to minimize.
[2024-05-29 08:04:48] [INFO ] Deduced a trap composed of 69 places in 48 ms of which 1 ms to minimize.
[2024-05-29 08:04:49] [INFO ] Deduced a trap composed of 98 places in 54 ms of which 1 ms to minimize.
[2024-05-29 08:04:49] [INFO ] Deduced a trap composed of 99 places in 48 ms of which 1 ms to minimize.
[2024-05-29 08:04:49] [INFO ] Deduced a trap composed of 99 places in 52 ms of which 1 ms to minimize.
[2024-05-29 08:04:49] [INFO ] Deduced a trap composed of 97 places in 47 ms of which 1 ms to minimize.
[2024-05-29 08:04:49] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 1 ms to minimize.
[2024-05-29 08:04:49] [INFO ] Deduced a trap composed of 71 places in 47 ms of which 2 ms to minimize.
[2024-05-29 08:04:49] [INFO ] Deduced a trap composed of 70 places in 48 ms of which 2 ms to minimize.
[2024-05-29 08:04:49] [INFO ] Deduced a trap composed of 69 places in 51 ms of which 1 ms to minimize.
[2024-05-29 08:04:49] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 1 ms to minimize.
[2024-05-29 08:04:49] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 1 ms to minimize.
[2024-05-29 08:04:49] [INFO ] Deduced a trap composed of 71 places in 46 ms of which 1 ms to minimize.
[2024-05-29 08:04:49] [INFO ] Deduced a trap composed of 69 places in 48 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 20/144 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:04:50] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 1 ms to minimize.
[2024-05-29 08:04:50] [INFO ] Deduced a trap composed of 72 places in 45 ms of which 1 ms to minimize.
[2024-05-29 08:04:51] [INFO ] Deduced a trap composed of 70 places in 36 ms of which 1 ms to minimize.
[2024-05-29 08:04:51] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-05-29 08:04:51] [INFO ] Deduced a trap composed of 83 places in 63 ms of which 1 ms to minimize.
[2024-05-29 08:04:51] [INFO ] Deduced a trap composed of 99 places in 61 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 6/150 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:04:54] [INFO ] Deduced a trap composed of 83 places in 46 ms of which 1 ms to minimize.
[2024-05-29 08:04:54] [INFO ] Deduced a trap composed of 84 places in 44 ms of which 1 ms to minimize.
[2024-05-29 08:04:54] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 2 ms to minimize.
[2024-05-29 08:04:54] [INFO ] Deduced a trap composed of 126 places in 58 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 4/154 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:04:54] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:04:57] [INFO ] Deduced a trap composed of 39 places in 43 ms of which 0 ms to minimize.
[2024-05-29 08:04:57] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 2/157 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:05:00] [INFO ] Deduced a trap composed of 129 places in 61 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:05:02] [INFO ] Deduced a trap composed of 115 places in 55 ms of which 1 ms to minimize.
[2024-05-29 08:05:02] [INFO ] Deduced a trap composed of 114 places in 53 ms of which 1 ms to minimize.
[2024-05-29 08:05:02] [INFO ] Deduced a trap composed of 114 places in 52 ms of which 1 ms to minimize.
[2024-05-29 08:05:02] [INFO ] Deduced a trap composed of 117 places in 49 ms of which 1 ms to minimize.
[2024-05-29 08:05:02] [INFO ] Deduced a trap composed of 115 places in 45 ms of which 1 ms to minimize.
[2024-05-29 08:05:02] [INFO ] Deduced a trap composed of 115 places in 49 ms of which 1 ms to minimize.
[2024-05-29 08:05:02] [INFO ] Deduced a trap composed of 116 places in 49 ms of which 1 ms to minimize.
[2024-05-29 08:05:02] [INFO ] Deduced a trap composed of 115 places in 53 ms of which 1 ms to minimize.
[2024-05-29 08:05:02] [INFO ] Deduced a trap composed of 112 places in 52 ms of which 1 ms to minimize.
[2024-05-29 08:05:03] [INFO ] Deduced a trap composed of 146 places in 60 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/312 variables, 10/168 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:05:04] [INFO ] Deduced a trap composed of 54 places in 43 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/312 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:05:07] [INFO ] Deduced a trap composed of 133 places in 60 ms of which 1 ms to minimize.
[2024-05-29 08:05:07] [INFO ] Deduced a trap composed of 132 places in 53 ms of which 1 ms to minimize.
[2024-05-29 08:05:07] [INFO ] Deduced a trap composed of 135 places in 47 ms of which 1 ms to minimize.
[2024-05-29 08:05:07] [INFO ] Deduced a trap composed of 129 places in 47 ms of which 2 ms to minimize.
[2024-05-29 08:05:07] [INFO ] Deduced a trap composed of 132 places in 46 ms of which 1 ms to minimize.
[2024-05-29 08:05:07] [INFO ] Deduced a trap composed of 129 places in 57 ms of which 2 ms to minimize.
[2024-05-29 08:05:07] [INFO ] Deduced a trap composed of 133 places in 53 ms of which 1 ms to minimize.
[2024-05-29 08:05:07] [INFO ] Deduced a trap composed of 128 places in 58 ms of which 1 ms to minimize.
[2024-05-29 08:05:07] [INFO ] Deduced a trap composed of 133 places in 51 ms of which 1 ms to minimize.
[2024-05-29 08:05:08] [INFO ] Deduced a trap composed of 128 places in 58 ms of which 1 ms to minimize.
[2024-05-29 08:05:08] [INFO ] Deduced a trap composed of 129 places in 50 ms of which 1 ms to minimize.
[2024-05-29 08:05:08] [INFO ] Deduced a trap composed of 127 places in 58 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/312 variables, 12/181 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:05:09] [INFO ] Deduced a trap composed of 117 places in 56 ms of which 2 ms to minimize.
SMT process timed out in 30081ms, After SMT, problems are : Problem set: 0 solved, 259 unsolved
Search for dead transitions found 0 dead transitions in 30084ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 30448 ms. Remains : 312/312 places, 262/262 transitions.
Built C files in :
/tmp/ltsmin650730582757848483
[2024-05-29 08:05:09] [INFO ] Computing symmetric may disable matrix : 262 transitions.
[2024-05-29 08:05:09] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 08:05:09] [INFO ] Computing symmetric may enable matrix : 262 transitions.
[2024-05-29 08:05:09] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 08:05:09] [INFO ] Computing Do-Not-Accords matrix : 262 transitions.
[2024-05-29 08:05:09] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 08:05:09] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin650730582757848483
Running compilation step : cd /tmp/ltsmin650730582757848483;'/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'
Compilation finished in 578 ms.
Running link step : cd /tmp/ltsmin650730582757848483;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin650730582757848483;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12256911937663891643.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 08:05:24] [INFO ] Flatten gal took : 9 ms
[2024-05-29 08:05:24] [INFO ] Flatten gal took : 8 ms
[2024-05-29 08:05:24] [INFO ] Time to serialize gal into /tmp/LTL3813743119100981322.gal : 1 ms
[2024-05-29 08:05:24] [INFO ] Time to serialize properties into /tmp/LTL5561364216260001521.prop : 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/LTL3813743119100981322.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12895526828245137824.hoa' '-atoms' '/tmp/LTL5561364216260001521.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/LTL5561364216260001521.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12895526828245137824.hoa
Detected timeout of ITS tools.
[2024-05-29 08:05:39] [INFO ] Flatten gal took : 8 ms
[2024-05-29 08:05:39] [INFO ] Flatten gal took : 7 ms
[2024-05-29 08:05:39] [INFO ] Time to serialize gal into /tmp/LTL8558536933603524050.gal : 2 ms
[2024-05-29 08:05:39] [INFO ] Time to serialize properties into /tmp/LTL4956858881889972129.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/LTL8558536933603524050.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4956858881889972129.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 : !((F("(p389==1)")))
Formula 0 simplified : G!"(p389==1)"
Detected timeout of ITS tools.
[2024-05-29 08:05:55] [INFO ] Flatten gal took : 9 ms
[2024-05-29 08:05:55] [INFO ] Applying decomposition
[2024-05-29 08:05:55] [INFO ] Flatten gal took : 8 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/graph17933703852081838263.txt' '-o' '/tmp/graph17933703852081838263.bin' '-w' '/tmp/graph17933703852081838263.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17933703852081838263.bin' '-l' '-1' '-v' '-w' '/tmp/graph17933703852081838263.weights' '-q' '0' '-e' '0.001'
[2024-05-29 08:05:55] [INFO ] Decomposing Gal with order
[2024-05-29 08:05:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 08:05:55] [INFO ] Removed a total of 61 redundant transitions.
[2024-05-29 08:05:55] [INFO ] Flatten gal took : 15 ms
[2024-05-29 08:05:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 116 labels/synchronizations in 4 ms.
[2024-05-29 08:05:55] [INFO ] Time to serialize gal into /tmp/LTL14250096679541732220.gal : 4 ms
[2024-05-29 08:05:55] [INFO ] Time to serialize properties into /tmp/LTL12717367414154239317.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/LTL14250096679541732220.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12717367414154239317.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...256
Read 1 LTL properties
Checking formula 0 : !((F("(i5.i1.u64.p389==1)")))
Formula 0 simplified : G!"(i5.i1.u64.p389==1)"
Detected timeout of ITS tools.
Treatment of property ShieldPPPs-PT-010B-LTLFireability-08 finished in 233511 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U X((X(p1) U ((X(p1)&&(p2||F(!p0)))||X(G(p1))))))))'
Support contains 3 out of 618 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 618/618 places, 568/568 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 612 transition count 562
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 612 transition count 562
Applied a total of 12 rules in 19 ms. Remains 612 /618 variables (removed 6) and now considering 562/568 (removed 6) transitions.
// Phase 1: matrix 562 rows 612 cols
[2024-05-29 08:06:10] [INFO ] Computed 111 invariants in 2 ms
[2024-05-29 08:06:10] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-05-29 08:06:10] [INFO ] Invariant cache hit.
[2024-05-29 08:06:10] [INFO ] Implicit Places using invariants and state equation in 406 ms returned []
Implicit Place search using SMT with State Equation took 588 ms to find 0 implicit places.
Running 561 sub problems to find dead transitions.
[2024-05-29 08:06:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/611 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (OVERLAPS) 1/612 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-05-29 08:06:21] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-29 08:06:21] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-05-29 08:06:21] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-05-29 08:06:21] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-29 08:06:22] [INFO ] Deduced a trap composed of 18 places in 162 ms of which 4 ms to minimize.
[2024-05-29 08:06:22] [INFO ] Deduced a trap composed of 20 places in 153 ms of which 3 ms to minimize.
[2024-05-29 08:06:22] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-05-29 08:06:22] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-29 08:06:22] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-29 08:06:22] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-29 08:06:22] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2024-05-29 08:06:22] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-05-29 08:06:22] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-29 08:06:22] [INFO ] Deduced a trap composed of 23 places in 155 ms of which 3 ms to minimize.
[2024-05-29 08:06:23] [INFO ] Deduced a trap composed of 21 places in 145 ms of which 3 ms to minimize.
[2024-05-29 08:06:23] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 0 ms to minimize.
[2024-05-29 08:06:23] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-29 08:06:23] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-05-29 08:06:23] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-05-29 08:06:23] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/612 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-05-29 08:06:24] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-29 08:06:25] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 0 ms to minimize.
[2024-05-29 08:06:25] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2024-05-29 08:06:25] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 0 ms to minimize.
[2024-05-29 08:06:25] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-29 08:06:25] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-05-29 08:06:25] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-05-29 08:06:25] [INFO ] Deduced a trap composed of 18 places in 150 ms of which 3 ms to minimize.
[2024-05-29 08:06:26] [INFO ] Deduced a trap composed of 26 places in 137 ms of which 3 ms to minimize.
[2024-05-29 08:06:26] [INFO ] Deduced a trap composed of 27 places in 131 ms of which 3 ms to minimize.
[2024-05-29 08:06:26] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 0 ms to minimize.
[2024-05-29 08:06:26] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-29 08:06:26] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-29 08:06:26] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-29 08:06:26] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2024-05-29 08:06:26] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-05-29 08:06:26] [INFO ] Deduced a trap composed of 21 places in 127 ms of which 3 ms to minimize.
[2024-05-29 08:06:27] [INFO ] Deduced a trap composed of 29 places in 131 ms of which 3 ms to minimize.
[2024-05-29 08:06:27] [INFO ] Deduced a trap composed of 43 places in 107 ms of which 3 ms to minimize.
[2024-05-29 08:06:27] [INFO ] Deduced a trap composed of 22 places in 116 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/612 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-05-29 08:06:33] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-05-29 08:06:33] [INFO ] Deduced a trap composed of 17 places in 18 ms of which 0 ms to minimize.
[2024-05-29 08:06:33] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-29 08:06:33] [INFO ] Deduced a trap composed of 20 places in 163 ms of which 3 ms to minimize.
[2024-05-29 08:06:34] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-29 08:06:34] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-29 08:06:34] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-05-29 08:06:34] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-05-29 08:06:34] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-29 08:06:34] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-29 08:06:35] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
[2024-05-29 08:06:35] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 1 ms to minimize.
[2024-05-29 08:06:35] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
[2024-05-29 08:06:35] [INFO ] Deduced a trap composed of 20 places in 91 ms of which 2 ms to minimize.
[2024-05-29 08:06:35] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 1 ms to minimize.
[2024-05-29 08:06:35] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-05-29 08:06:35] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
[2024-05-29 08:06:35] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-29 08:06:35] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-05-29 08:06:35] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/612 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-05-29 08:06:37] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-29 08:06:38] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 1 ms to minimize.
[2024-05-29 08:06:38] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-05-29 08:06:39] [INFO ] Deduced a trap composed of 34 places in 64 ms of which 1 ms to minimize.
[2024-05-29 08:06:39] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 2 ms to minimize.
[2024-05-29 08:06:39] [INFO ] Deduced a trap composed of 46 places in 56 ms of which 1 ms to minimize.
[2024-05-29 08:06:39] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-05-29 08:06:39] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-29 08:06:39] [INFO ] Deduced a trap composed of 49 places in 69 ms of which 1 ms to minimize.
[2024-05-29 08:06:39] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 2 ms to minimize.
[2024-05-29 08:06:39] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 2 ms to minimize.
[2024-05-29 08:06:39] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-05-29 08:06:39] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
[2024-05-29 08:06:40] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 0 ms to minimize.
[2024-05-29 08:06:40] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 2 ms to minimize.
[2024-05-29 08:06:40] [INFO ] Deduced a trap composed of 42 places in 81 ms of which 2 ms to minimize.
[2024-05-29 08:06:40] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 2 ms to minimize.
[2024-05-29 08:06:40] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 0 ms to minimize.
[2024-05-29 08:06:40] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 0 ms to minimize.
[2024-05-29 08:06:40] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/612 variables, 20/191 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 612/1174 variables, and 191 constraints, problems are : Problem set: 0 solved, 561 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/612 constraints, PredecessorRefiner: 561/561 constraints, Known Traps: 80/80 constraints]
Escalating to Integer solving :Problem set: 0 solved, 561 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/611 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (OVERLAPS) 1/612 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/612 variables, 80/191 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-05-29 08:06:47] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-29 08:06:47] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
[2024-05-29 08:06:47] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 2 ms to minimize.
[2024-05-29 08:06:47] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2024-05-29 08:06:48] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-29 08:06:48] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-29 08:06:48] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-29 08:06:48] [INFO ] Deduced a trap composed of 48 places in 50 ms of which 1 ms to minimize.
[2024-05-29 08:06:48] [INFO ] Deduced a trap composed of 49 places in 116 ms of which 2 ms to minimize.
[2024-05-29 08:06:48] [INFO ] Deduced a trap composed of 22 places in 103 ms of which 2 ms to minimize.
[2024-05-29 08:06:49] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2024-05-29 08:06:49] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-29 08:06:49] [INFO ] Deduced a trap composed of 27 places in 27 ms of which 0 ms to minimize.
[2024-05-29 08:06:49] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-05-29 08:06:49] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 4 ms to minimize.
[2024-05-29 08:06:49] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 1 ms to minimize.
[2024-05-29 08:06:49] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2024-05-29 08:06:49] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-05-29 08:06:49] [INFO ] Deduced a trap composed of 28 places in 27 ms of which 1 ms to minimize.
[2024-05-29 08:06:50] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/612 variables, 20/211 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-05-29 08:06:51] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-29 08:06:52] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-29 08:06:52] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-05-29 08:06:52] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-29 08:06:52] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
[2024-05-29 08:06:52] [INFO ] Deduced a trap composed of 25 places in 24 ms of which 0 ms to minimize.
[2024-05-29 08:06:52] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-29 08:06:53] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2024-05-29 08:06:54] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2024-05-29 08:06:54] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 2 ms to minimize.
[2024-05-29 08:06:54] [INFO ] Deduced a trap composed of 33 places in 33 ms of which 0 ms to minimize.
[2024-05-29 08:06:54] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-29 08:06:54] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 0 ms to minimize.
[2024-05-29 08:06:54] [INFO ] Deduced a trap composed of 29 places in 28 ms of which 0 ms to minimize.
[2024-05-29 08:06:54] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-05-29 08:06:54] [INFO ] Deduced a trap composed of 26 places in 25 ms of which 1 ms to minimize.
[2024-05-29 08:06:54] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 0 ms to minimize.
[2024-05-29 08:06:54] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-05-29 08:06:54] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 0 ms to minimize.
[2024-05-29 08:06:54] [INFO ] Deduced a trap composed of 43 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/612 variables, 20/231 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-05-29 08:06:57] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 0 ms to minimize.
[2024-05-29 08:06:57] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-29 08:06:57] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 1 ms to minimize.
[2024-05-29 08:06:57] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 1 ms to minimize.
[2024-05-29 08:06:57] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 0 ms to minimize.
[2024-05-29 08:06:57] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 0 ms to minimize.
[2024-05-29 08:06:57] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-29 08:06:58] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-05-29 08:06:58] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 1 ms to minimize.
[2024-05-29 08:06:59] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-29 08:06:59] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 1 ms to minimize.
[2024-05-29 08:06:59] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-29 08:06:59] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-05-29 08:06:59] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-05-29 08:06:59] [INFO ] Deduced a trap composed of 34 places in 25 ms of which 0 ms to minimize.
[2024-05-29 08:06:59] [INFO ] Deduced a trap composed of 30 places in 25 ms of which 1 ms to minimize.
[2024-05-29 08:06:59] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 0 ms to minimize.
[2024-05-29 08:06:59] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
[2024-05-29 08:06:59] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-05-29 08:06:59] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/612 variables, 20/251 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-05-29 08:07:01] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-29 08:07:01] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 1 ms to minimize.
[2024-05-29 08:07:01] [INFO ] Deduced a trap composed of 27 places in 23 ms of which 1 ms to minimize.
[2024-05-29 08:07:02] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-05-29 08:07:02] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 0 ms to minimize.
[2024-05-29 08:07:02] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-05-29 08:07:02] [INFO ] Deduced a trap composed of 28 places in 26 ms of which 0 ms to minimize.
[2024-05-29 08:07:02] [INFO ] Deduced a trap composed of 33 places in 121 ms of which 3 ms to minimize.
[2024-05-29 08:07:02] [INFO ] Deduced a trap composed of 34 places in 114 ms of which 3 ms to minimize.
[2024-05-29 08:07:02] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
[2024-05-29 08:07:02] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 1 ms to minimize.
[2024-05-29 08:07:03] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-05-29 08:07:03] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-05-29 08:07:03] [INFO ] Deduced a trap composed of 47 places in 56 ms of which 1 ms to minimize.
[2024-05-29 08:07:03] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 0 ms to minimize.
[2024-05-29 08:07:04] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-29 08:07:04] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-29 08:07:04] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 2 ms to minimize.
[2024-05-29 08:07:05] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-05-29 08:07:05] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/612 variables, 20/271 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-05-29 08:07:07] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-29 08:07:07] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-05-29 08:07:07] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-29 08:07:07] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 1 ms to minimize.
[2024-05-29 08:07:07] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-29 08:07:07] [INFO ] Deduced a trap composed of 50 places in 38 ms of which 1 ms to minimize.
[2024-05-29 08:07:08] [INFO ] Deduced a trap composed of 49 places in 51 ms of which 1 ms to minimize.
[2024-05-29 08:07:08] [INFO ] Deduced a trap composed of 49 places in 63 ms of which 2 ms to minimize.
[2024-05-29 08:07:08] [INFO ] Deduced a trap composed of 50 places in 64 ms of which 2 ms to minimize.
[2024-05-29 08:07:08] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 0 ms to minimize.
[2024-05-29 08:07:09] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 2 ms to minimize.
[2024-05-29 08:07:09] [INFO ] Deduced a trap composed of 36 places in 74 ms of which 2 ms to minimize.
[2024-05-29 08:07:10] [INFO ] Deduced a trap composed of 47 places in 92 ms of which 2 ms to minimize.
[2024-05-29 08:07:10] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 0 ms to minimize.
[2024-05-29 08:07:10] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 0 ms to minimize.
[2024-05-29 08:07:10] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2024-05-29 08:07:10] [INFO ] Deduced a trap composed of 70 places in 61 ms of which 2 ms to minimize.
SMT process timed out in 60090ms, After SMT, problems are : Problem set: 0 solved, 561 unsolved
Search for dead transitions found 0 dead transitions in 60095ms
Starting structural reductions in LTL mode, iteration 1 : 612/618 places, 562/568 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60703 ms. Remains : 612/618 places, 562/568 transitions.
Stuttering acceptance computed with spot in 463 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND p0 (NOT p1)), (NOT p1), (NOT p1), (AND p0 (NOT p1)), true, (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0]
Running random walk in product with property : ShieldPPPs-PT-010B-LTLFireability-09
Product exploration explored 100000 steps with 25000 reset in 118 ms.
Product exploration explored 100000 steps with 25000 reset in 125 ms.
Computed a total of 119 stabilizing places and 119 stable transitions
Computed a total of 119 stabilizing places and 119 stable transitions
Detected a total of 119/612 stabilizing places and 119/562 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 94 ms. Reduced automaton from 13 states, 26 edges and 3 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
RANDOM walk for 291 steps (0 resets) in 5 ms. (48 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 6 factoid took 122 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 196 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 1 out of 612 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 612/612 places, 562/562 transitions.
Applied a total of 0 rules in 11 ms. Remains 612 /612 variables (removed 0) and now considering 562/562 (removed 0) transitions.
[2024-05-29 08:07:12] [INFO ] Invariant cache hit.
[2024-05-29 08:07:12] [INFO ] Implicit Places using invariants in 163 ms returned []
[2024-05-29 08:07:12] [INFO ] Invariant cache hit.
[2024-05-29 08:07:12] [INFO ] Implicit Places using invariants and state equation in 403 ms returned []
Implicit Place search using SMT with State Equation took 570 ms to find 0 implicit places.
Running 561 sub problems to find dead transitions.
[2024-05-29 08:07:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/611 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (OVERLAPS) 1/612 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-05-29 08:07:23] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-29 08:07:23] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-29 08:07:23] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
[2024-05-29 08:07:23] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-05-29 08:07:24] [INFO ] Deduced a trap composed of 18 places in 167 ms of which 3 ms to minimize.
[2024-05-29 08:07:24] [INFO ] Deduced a trap composed of 20 places in 153 ms of which 3 ms to minimize.
[2024-05-29 08:07:24] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-29 08:07:24] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-29 08:07:24] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2024-05-29 08:07:24] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-29 08:07:24] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-05-29 08:07:24] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-05-29 08:07:24] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-29 08:07:25] [INFO ] Deduced a trap composed of 23 places in 151 ms of which 3 ms to minimize.
[2024-05-29 08:07:25] [INFO ] Deduced a trap composed of 21 places in 142 ms of which 3 ms to minimize.
[2024-05-29 08:07:25] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-29 08:07:25] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2024-05-29 08:07:25] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-05-29 08:07:25] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
[2024-05-29 08:07:25] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/612 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-05-29 08:07:26] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-29 08:07:27] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 2 ms to minimize.
[2024-05-29 08:07:27] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
[2024-05-29 08:07:27] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 1 ms to minimize.
[2024-05-29 08:07:27] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-05-29 08:07:27] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-29 08:07:27] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-05-29 08:07:27] [INFO ] Deduced a trap composed of 18 places in 138 ms of which 3 ms to minimize.
[2024-05-29 08:07:28] [INFO ] Deduced a trap composed of 26 places in 141 ms of which 3 ms to minimize.
[2024-05-29 08:07:28] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 3 ms to minimize.
[2024-05-29 08:07:28] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 1 ms to minimize.
[2024-05-29 08:07:28] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-29 08:07:28] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-29 08:07:28] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-29 08:07:28] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2024-05-29 08:07:28] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 0 ms to minimize.
[2024-05-29 08:07:28] [INFO ] Deduced a trap composed of 21 places in 128 ms of which 3 ms to minimize.
[2024-05-29 08:07:29] [INFO ] Deduced a trap composed of 29 places in 127 ms of which 3 ms to minimize.
[2024-05-29 08:07:29] [INFO ] Deduced a trap composed of 43 places in 109 ms of which 3 ms to minimize.
[2024-05-29 08:07:29] [INFO ] Deduced a trap composed of 22 places in 103 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/612 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-05-29 08:07:35] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-29 08:07:35] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 1 ms to minimize.
[2024-05-29 08:07:35] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-29 08:07:35] [INFO ] Deduced a trap composed of 20 places in 165 ms of which 3 ms to minimize.
[2024-05-29 08:07:35] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
[2024-05-29 08:07:36] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-05-29 08:07:36] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-29 08:07:36] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-05-29 08:07:36] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-29 08:07:36] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 0 ms to minimize.
[2024-05-29 08:07:36] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-29 08:07:36] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2024-05-29 08:07:37] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2024-05-29 08:07:37] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 2 ms to minimize.
[2024-05-29 08:07:37] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 1 ms to minimize.
[2024-05-29 08:07:37] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-29 08:07:37] [INFO ] Deduced a trap composed of 36 places in 31 ms of which 1 ms to minimize.
[2024-05-29 08:07:37] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-29 08:07:37] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-05-29 08:07:37] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/612 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-05-29 08:07:39] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2024-05-29 08:07:40] [INFO ] Deduced a trap composed of 37 places in 57 ms of which 1 ms to minimize.
[2024-05-29 08:07:40] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-05-29 08:07:40] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 1 ms to minimize.
[2024-05-29 08:07:40] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-29 08:07:40] [INFO ] Deduced a trap composed of 46 places in 55 ms of which 1 ms to minimize.
[2024-05-29 08:07:40] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-05-29 08:07:41] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-29 08:07:41] [INFO ] Deduced a trap composed of 49 places in 66 ms of which 2 ms to minimize.
[2024-05-29 08:07:41] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 1 ms to minimize.
[2024-05-29 08:07:41] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 2 ms to minimize.
[2024-05-29 08:07:41] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-05-29 08:07:41] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2024-05-29 08:07:41] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-05-29 08:07:41] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 1 ms to minimize.
[2024-05-29 08:07:41] [INFO ] Deduced a trap composed of 42 places in 73 ms of which 2 ms to minimize.
[2024-05-29 08:07:42] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2024-05-29 08:07:42] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 0 ms to minimize.
[2024-05-29 08:07:42] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-05-29 08:07:42] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/612 variables, 20/191 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 612/1174 variables, and 191 constraints, problems are : Problem set: 0 solved, 561 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/612 constraints, PredecessorRefiner: 561/561 constraints, Known Traps: 80/80 constraints]
Escalating to Integer solving :Problem set: 0 solved, 561 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/611 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (OVERLAPS) 1/612 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/612 variables, 80/191 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-05-29 08:07:49] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-29 08:07:49] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 0 ms to minimize.
[2024-05-29 08:07:49] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 2 ms to minimize.
[2024-05-29 08:07:49] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2024-05-29 08:07:50] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
[2024-05-29 08:07:50] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-05-29 08:07:50] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-29 08:07:50] [INFO ] Deduced a trap composed of 48 places in 50 ms of which 1 ms to minimize.
[2024-05-29 08:07:50] [INFO ] Deduced a trap composed of 49 places in 109 ms of which 2 ms to minimize.
[2024-05-29 08:07:50] [INFO ] Deduced a trap composed of 22 places in 112 ms of which 3 ms to minimize.
[2024-05-29 08:07:51] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 0 ms to minimize.
[2024-05-29 08:07:51] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
[2024-05-29 08:07:51] [INFO ] Deduced a trap composed of 27 places in 24 ms of which 1 ms to minimize.
[2024-05-29 08:07:51] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-05-29 08:07:51] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2024-05-29 08:07:51] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 2 ms to minimize.
[2024-05-29 08:07:51] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 0 ms to minimize.
[2024-05-29 08:07:51] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
[2024-05-29 08:07:51] [INFO ] Deduced a trap composed of 28 places in 26 ms of which 1 ms to minimize.
[2024-05-29 08:07:51] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/612 variables, 20/211 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-05-29 08:07:53] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-05-29 08:07:54] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-05-29 08:07:54] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-05-29 08:07:54] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-05-29 08:07:54] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-29 08:07:54] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-29 08:07:54] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-05-29 08:07:55] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 2 ms to minimize.
[2024-05-29 08:07:56] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-05-29 08:07:56] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2024-05-29 08:07:56] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
[2024-05-29 08:07:56] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-29 08:07:56] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-05-29 08:07:56] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 1 ms to minimize.
[2024-05-29 08:07:56] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-05-29 08:07:56] [INFO ] Deduced a trap composed of 26 places in 26 ms of which 1 ms to minimize.
[2024-05-29 08:07:56] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-05-29 08:07:56] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-05-29 08:07:56] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 1 ms to minimize.
[2024-05-29 08:07:56] [INFO ] Deduced a trap composed of 43 places in 36 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/612 variables, 20/231 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-05-29 08:07:59] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2024-05-29 08:07:59] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-29 08:07:59] [INFO ] Deduced a trap composed of 41 places in 56 ms of which 1 ms to minimize.
[2024-05-29 08:07:59] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 1 ms to minimize.
[2024-05-29 08:07:59] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 0 ms to minimize.
[2024-05-29 08:07:59] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-29 08:07:59] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-05-29 08:08:00] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 0 ms to minimize.
[2024-05-29 08:08:01] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 1 ms to minimize.
[2024-05-29 08:08:01] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 0 ms to minimize.
[2024-05-29 08:08:01] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2024-05-29 08:08:01] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-05-29 08:08:01] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
[2024-05-29 08:08:01] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-05-29 08:08:01] [INFO ] Deduced a trap composed of 34 places in 27 ms of which 1 ms to minimize.
[2024-05-29 08:08:01] [INFO ] Deduced a trap composed of 30 places in 27 ms of which 1 ms to minimize.
[2024-05-29 08:08:01] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-05-29 08:08:01] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 0 ms to minimize.
[2024-05-29 08:08:01] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 0 ms to minimize.
[2024-05-29 08:08:02] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/612 variables, 20/251 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-05-29 08:08:03] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2024-05-29 08:08:03] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 1 ms to minimize.
[2024-05-29 08:08:03] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 0 ms to minimize.
[2024-05-29 08:08:04] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-29 08:08:04] [INFO ] Deduced a trap composed of 17 places in 17 ms of which 0 ms to minimize.
[2024-05-29 08:08:04] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-05-29 08:08:04] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
[2024-05-29 08:08:04] [INFO ] Deduced a trap composed of 33 places in 118 ms of which 3 ms to minimize.
[2024-05-29 08:08:04] [INFO ] Deduced a trap composed of 34 places in 109 ms of which 3 ms to minimize.
[2024-05-29 08:08:04] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
[2024-05-29 08:08:05] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
[2024-05-29 08:08:05] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-05-29 08:08:05] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 0 ms to minimize.
[2024-05-29 08:08:05] [INFO ] Deduced a trap composed of 47 places in 51 ms of which 2 ms to minimize.
[2024-05-29 08:08:05] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-05-29 08:08:06] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 0 ms to minimize.
[2024-05-29 08:08:06] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 0 ms to minimize.
[2024-05-29 08:08:06] [INFO ] Deduced a trap composed of 56 places in 66 ms of which 1 ms to minimize.
[2024-05-29 08:08:07] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-05-29 08:08:07] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/612 variables, 20/271 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-05-29 08:08:09] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-29 08:08:09] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2024-05-29 08:08:09] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-29 08:08:09] [INFO ] Deduced a trap composed of 43 places in 44 ms of which 1 ms to minimize.
[2024-05-29 08:08:09] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-29 08:08:09] [INFO ] Deduced a trap composed of 50 places in 47 ms of which 1 ms to minimize.
[2024-05-29 08:08:10] [INFO ] Deduced a trap composed of 49 places in 51 ms of which 1 ms to minimize.
[2024-05-29 08:08:10] [INFO ] Deduced a trap composed of 49 places in 61 ms of which 2 ms to minimize.
[2024-05-29 08:08:10] [INFO ] Deduced a trap composed of 50 places in 62 ms of which 1 ms to minimize.
[2024-05-29 08:08:11] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-05-29 08:08:11] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 2 ms to minimize.
[2024-05-29 08:08:11] [INFO ] Deduced a trap composed of 36 places in 76 ms of which 2 ms to minimize.
[2024-05-29 08:08:12] [INFO ] Deduced a trap composed of 47 places in 88 ms of which 2 ms to minimize.
[2024-05-29 08:08:12] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-05-29 08:08:12] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
[2024-05-29 08:08:12] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 2 ms to minimize.
[2024-05-29 08:08:12] [INFO ] Deduced a trap composed of 70 places in 60 ms of which 2 ms to minimize.
[2024-05-29 08:08:13] [INFO ] Deduced a trap composed of 61 places in 65 ms of which 1 ms to minimize.
SMT process timed out in 60095ms, After SMT, problems are : Problem set: 0 solved, 561 unsolved
Search for dead transitions found 0 dead transitions in 60101ms
Finished structural reductions in LTL mode , in 1 iterations and 60684 ms. Remains : 612/612 places, 562/562 transitions.
Computed a total of 119 stabilizing places and 119 stable transitions
Computed a total of 119 stabilizing places and 119 stable transitions
Knowledge obtained : [p1]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 69 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
RANDOM walk for 372 steps (0 resets) in 6 ms. (53 steps per ms) remains 0/1 properties
Knowledge obtained : [p1]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 1 factoid took 85 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 160 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 151 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 25000 reset in 121 ms.
Product exploration explored 100000 steps with 25000 reset in 125 ms.
Applying partial POR strategy [true, false, false, false, true]
Stuttering acceptance computed with spot in 158 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 1 out of 612 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 612/612 places, 562/562 transitions.
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 612 transition count 562
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 21 Pre rules applied. Total rules applied 70 place count 612 transition count 563
Deduced a syphon composed of 91 places in 1 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 91 place count 612 transition count 563
Performed 208 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 299 places in 0 ms
Iterating global reduction 1 with 208 rules applied. Total rules applied 299 place count 612 transition count 563
Discarding 70 places :
Symmetric choice reduction at 1 with 70 rule applications. Total rules 369 place count 542 transition count 493
Deduced a syphon composed of 229 places in 1 ms
Iterating global reduction 1 with 70 rules applied. Total rules applied 439 place count 542 transition count 493
Deduced a syphon composed of 229 places in 0 ms
Applied a total of 439 rules in 84 ms. Remains 542 /612 variables (removed 70) and now considering 493/562 (removed 69) transitions.
[2024-05-29 08:08:14] [INFO ] Redundant transitions in 3 ms returned []
Running 492 sub problems to find dead transitions.
// Phase 1: matrix 493 rows 542 cols
[2024-05-29 08:08:14] [INFO ] Computed 111 invariants in 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/541 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 492 unsolved
At refinement iteration 1 (OVERLAPS) 1/542 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 492 unsolved
[2024-05-29 08:08:22] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-05-29 08:08:22] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 0 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-05-29 08:08:22] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 0 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-05-29 08:08:22] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-05-29 08:08:22] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
Problem TDEAD12 is UNSAT
[2024-05-29 08:08:22] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
Problem TDEAD15 is UNSAT
[2024-05-29 08:08:22] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
Problem TDEAD18 is UNSAT
[2024-05-29 08:08:22] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
Problem TDEAD21 is UNSAT
[2024-05-29 08:08:22] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
Problem TDEAD24 is UNSAT
[2024-05-29 08:08:22] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
Problem TDEAD27 is UNSAT
[2024-05-29 08:08:22] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
Problem TDEAD30 is UNSAT
[2024-05-29 08:08:22] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
Problem TDEAD33 is UNSAT
[2024-05-29 08:08:22] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
Problem TDEAD36 is UNSAT
[2024-05-29 08:08:22] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
Problem TDEAD39 is UNSAT
[2024-05-29 08:08:22] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
Problem TDEAD42 is UNSAT
[2024-05-29 08:08:22] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
Problem TDEAD45 is UNSAT
[2024-05-29 08:08:22] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
Problem TDEAD48 is UNSAT
[2024-05-29 08:08:22] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
Problem TDEAD51 is UNSAT
[2024-05-29 08:08:22] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
Problem TDEAD54 is UNSAT
[2024-05-29 08:08:22] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD465 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/542 variables, 20/131 constraints. Problems are: Problem set: 83 solved, 409 unsolved
[2024-05-29 08:08:23] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
Problem TDEAD60 is UNSAT
[2024-05-29 08:08:23] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
Problem TDEAD63 is UNSAT
[2024-05-29 08:08:23] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 5 ms to minimize.
Problem TDEAD66 is UNSAT
[2024-05-29 08:08:23] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
Problem TDEAD69 is UNSAT
[2024-05-29 08:08:23] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
Problem TDEAD72 is UNSAT
[2024-05-29 08:08:23] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
Problem TDEAD75 is UNSAT
[2024-05-29 08:08:23] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
Problem TDEAD78 is UNSAT
[2024-05-29 08:08:23] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 1 ms to minimize.
Problem TDEAD81 is UNSAT
[2024-05-29 08:08:23] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
Problem TDEAD84 is UNSAT
[2024-05-29 08:08:23] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
[2024-05-29 08:08:23] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
[2024-05-29 08:08:23] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Problem TDEAD92 is UNSAT
[2024-05-29 08:08:23] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
[2024-05-29 08:08:24] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
[2024-05-29 08:08:24] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
Problem TDEAD97 is UNSAT
[2024-05-29 08:08:24] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
[2024-05-29 08:08:24] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
[2024-05-29 08:08:24] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
[2024-05-29 08:08:24] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
[2024-05-29 08:08:24] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
Problem TDEAD60 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD489 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/542 variables, 20/151 constraints. Problems are: Problem set: 145 solved, 347 unsolved
[2024-05-29 08:08:27] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
[2024-05-29 08:08:27] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
[2024-05-29 08:08:27] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
Problem TDEAD116 is UNSAT
[2024-05-29 08:08:27] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
[2024-05-29 08:08:27] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
[2024-05-29 08:08:27] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
[2024-05-29 08:08:27] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Problem TDEAD124 is UNSAT
[2024-05-29 08:08:27] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
[2024-05-29 08:08:27] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
[2024-05-29 08:08:27] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
[2024-05-29 08:08:27] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
Problem TDEAD132 is UNSAT
[2024-05-29 08:08:27] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
[2024-05-29 08:08:27] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
[2024-05-29 08:08:27] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
[2024-05-29 08:08:27] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
[2024-05-29 08:08:27] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Problem TDEAD143 is UNSAT
[2024-05-29 08:08:27] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
[2024-05-29 08:08:27] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
[2024-05-29 08:08:28] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
Problem TDEAD148 is UNSAT
[2024-05-29 08:08:28] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/542 variables, 20/171 constraints. Problems are: Problem set: 195 solved, 297 unsolved
[2024-05-29 08:08:28] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
[2024-05-29 08:08:28] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
[2024-05-29 08:08:28] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
[2024-05-29 08:08:28] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
Problem TDEAD159 is UNSAT
[2024-05-29 08:08:28] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
[2024-05-29 08:08:28] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
[2024-05-29 08:08:28] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
Problem TDEAD164 is UNSAT
[2024-05-29 08:08:28] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
[2024-05-29 08:08:28] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
Problem TDEAD168 is UNSAT
[2024-05-29 08:08:29] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
[2024-05-29 08:08:29] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
[2024-05-29 08:08:29] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Problem TDEAD266 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
[2024-05-29 08:08:30] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem TDEAD289 is UNSAT
[2024-05-29 08:08:30] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
Problem TDEAD312 is UNSAT
[2024-05-29 08:08:30] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
Problem TDEAD335 is UNSAT
[2024-05-29 08:08:30] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
Problem TDEAD358 is UNSAT
[2024-05-29 08:08:30] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
Problem TDEAD381 is UNSAT
[2024-05-29 08:08:30] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
Problem TDEAD404 is UNSAT
[2024-05-29 08:08:30] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
Problem TDEAD424 is UNSAT
[2024-05-29 08:08:31] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD447 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/542 variables, 20/191 constraints. Problems are: Problem set: 229 solved, 263 unsolved
[2024-05-29 08:08:33] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
Problem TDEAD469 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/542 variables, 1/192 constraints. Problems are: Problem set: 230 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/542 variables, 0/192 constraints. Problems are: Problem set: 230 solved, 262 unsolved
At refinement iteration 8 (OVERLAPS) 493/1035 variables, 542/734 constraints. Problems are: Problem set: 230 solved, 262 unsolved
[2024-05-29 08:08:39] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-29 08:08:39] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-05-29 08:08:39] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-29 08:08:39] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-29 08:08:39] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-05-29 08:08:40] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-29 08:08:40] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 2 ms to minimize.
[2024-05-29 08:08:40] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 1 ms to minimize.
[2024-05-29 08:08:40] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 2 ms to minimize.
[2024-05-29 08:08:40] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 1 ms to minimize.
[2024-05-29 08:08:41] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-29 08:08:41] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 0 ms to minimize.
[2024-05-29 08:08:41] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2024-05-29 08:08:41] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1035 variables, 14/748 constraints. Problems are: Problem set: 230 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1035/1035 variables, and 748 constraints, problems are : Problem set: 230 solved, 262 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 542/542 constraints, PredecessorRefiner: 492/492 constraints, Known Traps: 95/95 constraints]
Escalating to Integer solving :Problem set: 230 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 0/0 constraints. Problems are: Problem set: 230 solved, 262 unsolved
At refinement iteration 1 (OVERLAPS) 230/542 variables, 111/111 constraints. Problems are: Problem set: 230 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/542 variables, 95/206 constraints. Problems are: Problem set: 230 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/542 variables, 0/206 constraints. Problems are: Problem set: 230 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 493/1035 variables, 542/748 constraints. Problems are: Problem set: 230 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1035 variables, 262/1010 constraints. Problems are: Problem set: 230 solved, 262 unsolved
[2024-05-29 08:09:08] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-29 08:09:08] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1035 variables, 2/1012 constraints. Problems are: Problem set: 230 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1035/1035 variables, and 1012 constraints, problems are : Problem set: 230 solved, 262 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 542/542 constraints, PredecessorRefiner: 262/492 constraints, Known Traps: 97/97 constraints]
After SMT, in 60104ms problems are : Problem set: 230 solved, 262 unsolved
Search for dead transitions found 230 dead transitions in 60108ms
Found 230 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 230 transitions
Dead transitions reduction (with SMT) removed 230 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 542/612 places, 263/562 transitions.
Graph (complete) has 824 edges and 542 vertex of which 313 are kept as prefixes of interest. Removing 229 places using SCC suffix rule.1 ms
Discarding 229 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 8 ms. Remains 313 /542 variables (removed 229) and now considering 263/263 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 313/612 places, 263/562 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60216 ms. Remains : 313/612 places, 263/562 transitions.
Built C files in :
/tmp/ltsmin2191759008253819052
[2024-05-29 08:09:14] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2191759008253819052
Running compilation step : cd /tmp/ltsmin2191759008253819052;'/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'
Compilation finished in 985 ms.
Running link step : cd /tmp/ltsmin2191759008253819052;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin2191759008253819052;'/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' '--hoa' '/tmp/stateBased7710427356573300980.hoa' '--buchi-type=spotba'
LTSmin run took 375 ms.
FORMULA ShieldPPPs-PT-010B-LTLFireability-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPs-PT-010B-LTLFireability-09 finished in 185919 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||X(F(p1)))))'
Support contains 2 out of 618 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 618/618 places, 568/568 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 613 transition count 563
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 613 transition count 563
Applied a total of 10 rules in 23 ms. Remains 613 /618 variables (removed 5) and now considering 563/568 (removed 5) transitions.
// Phase 1: matrix 563 rows 613 cols
[2024-05-29 08:09:16] [INFO ] Computed 111 invariants in 4 ms
[2024-05-29 08:09:16] [INFO ] Implicit Places using invariants in 174 ms returned []
[2024-05-29 08:09:16] [INFO ] Invariant cache hit.
[2024-05-29 08:09:16] [INFO ] Implicit Places using invariants and state equation in 413 ms returned []
Implicit Place search using SMT with State Equation took 604 ms to find 0 implicit places.
Running 562 sub problems to find dead transitions.
[2024-05-29 08:09:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/612 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 562 unsolved
At refinement iteration 1 (OVERLAPS) 1/613 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2024-05-29 08:09:27] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2024-05-29 08:09:27] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2024-05-29 08:09:27] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-29 08:09:27] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-29 08:09:27] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-29 08:09:27] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 1 ms to minimize.
[2024-05-29 08:09:27] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-29 08:09:27] [INFO ] Deduced a trap composed of 22 places in 163 ms of which 4 ms to minimize.
[2024-05-29 08:09:28] [INFO ] Deduced a trap composed of 28 places in 155 ms of which 3 ms to minimize.
[2024-05-29 08:09:28] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-05-29 08:09:28] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-29 08:09:28] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-29 08:09:28] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-29 08:09:28] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-29 08:09:28] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-29 08:09:28] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
[2024-05-29 08:09:28] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2024-05-29 08:09:28] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2024-05-29 08:09:28] [INFO ] Deduced a trap composed of 21 places in 159 ms of which 3 ms to minimize.
[2024-05-29 08:09:29] [INFO ] Deduced a trap composed of 19 places in 151 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/613 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2024-05-29 08:09:30] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 0 ms to minimize.
[2024-05-29 08:09:31] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-05-29 08:09:31] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-05-29 08:09:31] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 0 ms to minimize.
[2024-05-29 08:09:31] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-29 08:09:31] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-29 08:09:31] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
[2024-05-29 08:09:31] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
[2024-05-29 08:09:31] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-05-29 08:09:31] [INFO ] Deduced a trap composed of 50 places in 40 ms of which 1 ms to minimize.
[2024-05-29 08:09:31] [INFO ] Deduced a trap composed of 18 places in 132 ms of which 3 ms to minimize.
[2024-05-29 08:09:31] [INFO ] Deduced a trap composed of 27 places in 130 ms of which 3 ms to minimize.
[2024-05-29 08:09:31] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 0 ms to minimize.
[2024-05-29 08:09:32] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-29 08:09:32] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 0 ms to minimize.
[2024-05-29 08:09:32] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-29 08:09:32] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-05-29 08:09:32] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 0 ms to minimize.
[2024-05-29 08:09:32] [INFO ] Deduced a trap composed of 21 places in 124 ms of which 3 ms to minimize.
[2024-05-29 08:09:32] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/613 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2024-05-29 08:09:38] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 1 ms to minimize.
[2024-05-29 08:09:38] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 0 ms to minimize.
[2024-05-29 08:09:39] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 1 ms to minimize.
[2024-05-29 08:09:39] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-29 08:09:39] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-29 08:09:39] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-29 08:09:40] [INFO ] Deduced a trap composed of 62 places in 56 ms of which 1 ms to minimize.
[2024-05-29 08:09:40] [INFO ] Deduced a trap composed of 60 places in 138 ms of which 3 ms to minimize.
[2024-05-29 08:09:40] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-29 08:09:40] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 0 ms to minimize.
[2024-05-29 08:09:40] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-29 08:09:40] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-29 08:09:40] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2024-05-29 08:09:40] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 0 ms to minimize.
[2024-05-29 08:09:40] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-29 08:09:40] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-29 08:09:40] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
[2024-05-29 08:09:40] [INFO ] Deduced a trap composed of 25 places in 24 ms of which 1 ms to minimize.
[2024-05-29 08:09:40] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
[2024-05-29 08:09:40] [INFO ] Deduced a trap composed of 29 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/613 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2024-05-29 08:09:43] [INFO ] Deduced a trap composed of 29 places in 135 ms of which 3 ms to minimize.
[2024-05-29 08:09:43] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-05-29 08:09:43] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-29 08:09:43] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 0 ms to minimize.
[2024-05-29 08:09:43] [INFO ] Deduced a trap composed of 23 places in 20 ms of which 1 ms to minimize.
[2024-05-29 08:09:43] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 1 ms to minimize.
[2024-05-29 08:09:43] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 1 ms to minimize.
[2024-05-29 08:09:44] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 0 ms to minimize.
[2024-05-29 08:09:44] [INFO ] Deduced a trap composed of 24 places in 120 ms of which 2 ms to minimize.
[2024-05-29 08:09:44] [INFO ] Deduced a trap composed of 27 places in 114 ms of which 3 ms to minimize.
[2024-05-29 08:09:44] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-05-29 08:09:44] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2024-05-29 08:09:44] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-05-29 08:09:44] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-05-29 08:09:44] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 1 ms to minimize.
[2024-05-29 08:09:44] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-29 08:09:45] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 1 ms to minimize.
[2024-05-29 08:09:45] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-05-29 08:09:45] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 2 ms to minimize.
[2024-05-29 08:09:45] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/613 variables, 20/191 constraints. Problems are: Problem set: 0 solved, 562 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 613/1176 variables, and 191 constraints, problems are : Problem set: 0 solved, 562 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/613 constraints, PredecessorRefiner: 562/562 constraints, Known Traps: 80/80 constraints]
Escalating to Integer solving :Problem set: 0 solved, 562 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/612 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 562 unsolved
At refinement iteration 1 (OVERLAPS) 1/613 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 562 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/613 variables, 80/191 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2024-05-29 08:09:53] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-29 08:09:53] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-05-29 08:09:53] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-29 08:09:53] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-29 08:09:53] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 0 ms to minimize.
[2024-05-29 08:09:53] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 0 ms to minimize.
[2024-05-29 08:09:54] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2024-05-29 08:09:54] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 1 ms to minimize.
[2024-05-29 08:09:54] [INFO ] Deduced a trap composed of 43 places in 116 ms of which 3 ms to minimize.
[2024-05-29 08:09:54] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 0 ms to minimize.
[2024-05-29 08:09:54] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
[2024-05-29 08:09:54] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
[2024-05-29 08:09:54] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-29 08:09:55] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-29 08:09:55] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-05-29 08:09:55] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 1 ms to minimize.
[2024-05-29 08:09:55] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
[2024-05-29 08:09:55] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 1 ms to minimize.
[2024-05-29 08:09:55] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 1 ms to minimize.
[2024-05-29 08:09:55] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/613 variables, 20/211 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2024-05-29 08:09:57] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-29 08:09:57] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 1 ms to minimize.
[2024-05-29 08:09:57] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 0 ms to minimize.
[2024-05-29 08:09:57] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-29 08:09:58] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-05-29 08:09:58] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-05-29 08:09:58] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-29 08:09:59] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-29 08:09:59] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-29 08:09:59] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-29 08:09:59] [INFO ] Deduced a trap composed of 28 places in 89 ms of which 2 ms to minimize.
[2024-05-29 08:09:59] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 2 ms to minimize.
[2024-05-29 08:09:59] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 2 ms to minimize.
[2024-05-29 08:09:59] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-05-29 08:09:59] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-05-29 08:09:59] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-29 08:09:59] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-05-29 08:09:59] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 0 ms to minimize.
[2024-05-29 08:10:00] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-29 08:10:00] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/613 variables, 20/231 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2024-05-29 08:10:02] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2024-05-29 08:10:02] [INFO ] Deduced a trap composed of 30 places in 30 ms of which 1 ms to minimize.
[2024-05-29 08:10:02] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-29 08:10:02] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-29 08:10:03] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-29 08:10:03] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2024-05-29 08:10:03] [INFO ] Deduced a trap composed of 42 places in 68 ms of which 2 ms to minimize.
[2024-05-29 08:10:04] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 2 ms to minimize.
[2024-05-29 08:10:04] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 1 ms to minimize.
[2024-05-29 08:10:04] [INFO ] Deduced a trap composed of 42 places in 78 ms of which 2 ms to minimize.
[2024-05-29 08:10:04] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 2 ms to minimize.
[2024-05-29 08:10:04] [INFO ] Deduced a trap composed of 42 places in 91 ms of which 2 ms to minimize.
[2024-05-29 08:10:04] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
[2024-05-29 08:10:04] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-29 08:10:04] [INFO ] Deduced a trap composed of 37 places in 82 ms of which 1 ms to minimize.
[2024-05-29 08:10:05] [INFO ] Deduced a trap composed of 61 places in 74 ms of which 2 ms to minimize.
[2024-05-29 08:10:05] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-05-29 08:10:05] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-05-29 08:10:05] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-05-29 08:10:05] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/613 variables, 20/251 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2024-05-29 08:10:07] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-29 08:10:08] [INFO ] Deduced a trap composed of 25 places in 120 ms of which 3 ms to minimize.
[2024-05-29 08:10:08] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 0 ms to minimize.
[2024-05-29 08:10:08] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-29 08:10:09] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 1 ms to minimize.
[2024-05-29 08:10:09] [INFO ] Deduced a trap composed of 36 places in 66 ms of which 1 ms to minimize.
[2024-05-29 08:10:09] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 2 ms to minimize.
[2024-05-29 08:10:09] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-05-29 08:10:09] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-05-29 08:10:09] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-29 08:10:09] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-29 08:10:09] [INFO ] Deduced a trap composed of 43 places in 85 ms of which 2 ms to minimize.
[2024-05-29 08:10:10] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-05-29 08:10:10] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 2 ms to minimize.
[2024-05-29 08:10:10] [INFO ] Deduced a trap composed of 73 places in 87 ms of which 2 ms to minimize.
[2024-05-29 08:10:10] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 2 ms to minimize.
[2024-05-29 08:10:10] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-29 08:10:10] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 0 ms to minimize.
[2024-05-29 08:10:10] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 0 ms to minimize.
[2024-05-29 08:10:10] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/613 variables, 20/271 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2024-05-29 08:10:13] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-05-29 08:10:13] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-29 08:10:14] [INFO ] Deduced a trap composed of 45 places in 64 ms of which 2 ms to minimize.
[2024-05-29 08:10:14] [INFO ] Deduced a trap composed of 52 places in 65 ms of which 1 ms to minimize.
[2024-05-29 08:10:15] [INFO ] Deduced a trap composed of 43 places in 100 ms of which 2 ms to minimize.
[2024-05-29 08:10:15] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 2 ms to minimize.
[2024-05-29 08:10:15] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 2 ms to minimize.
[2024-05-29 08:10:15] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2024-05-29 08:10:15] [INFO ] Deduced a trap composed of 42 places in 92 ms of which 2 ms to minimize.
[2024-05-29 08:10:16] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 2 ms to minimize.
[2024-05-29 08:10:16] [INFO ] Deduced a trap composed of 59 places in 86 ms of which 2 ms to minimize.
[2024-05-29 08:10:16] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-05-29 08:10:16] [INFO ] Deduced a trap composed of 62 places in 91 ms of which 2 ms to minimize.
[2024-05-29 08:10:16] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 613/1176 variables, and 285 constraints, problems are : Problem set: 0 solved, 562 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/613 constraints, PredecessorRefiner: 0/562 constraints, Known Traps: 174/174 constraints]
After SMT, in 60089ms problems are : Problem set: 0 solved, 562 unsolved
Search for dead transitions found 0 dead transitions in 60094ms
Starting structural reductions in LTL mode, iteration 1 : 613/618 places, 563/568 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60722 ms. Remains : 613/618 places, 563/568 transitions.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-010B-LTLFireability-10
Product exploration explored 100000 steps with 297 reset in 270 ms.
Product exploration explored 100000 steps with 300 reset in 300 ms.
Computed a total of 120 stabilizing places and 120 stable transitions
Computed a total of 120 stabilizing places and 120 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 75 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 9900 steps (4 resets) in 56 ms. (173 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) p1))), (F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 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 171 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-29 08:10:18] [INFO ] Invariant cache hit.
[2024-05-29 08:10:18] [INFO ] [Real]Absence check using 111 positive place invariants in 41 ms returned sat
[2024-05-29 08:10:19] [INFO ] [Real]Absence check using state equation in 960 ms returned sat
[2024-05-29 08:10:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 08:10:19] [INFO ] [Nat]Absence check using 111 positive place invariants in 43 ms returned sat
[2024-05-29 08:10:20] [INFO ] [Nat]Absence check using state equation in 1097 ms returned sat
[2024-05-29 08:10:21] [INFO ] Computed and/alt/rep : 562/993/562 causal constraints (skipped 0 transitions) in 29 ms.
[2024-05-29 08:10:30] [INFO ] Added : 534 causal constraints over 108 iterations in 9144 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 2 out of 613 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 613/613 places, 563/563 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 72 place count 612 transition count 490
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 144 place count 540 transition count 490
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 144 place count 540 transition count 440
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 244 place count 490 transition count 440
Performed 177 Post agglomeration using F-continuation condition.Transition count delta: 177
Deduced a syphon composed of 177 places in 1 ms
Reduce places removed 177 places and 0 transitions.
Iterating global reduction 2 with 354 rules applied. Total rules applied 598 place count 313 transition count 263
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 600 place count 311 transition count 261
Applied a total of 600 rules in 36 ms. Remains 311 /613 variables (removed 302) and now considering 261/563 (removed 302) transitions.
// Phase 1: matrix 261 rows 311 cols
[2024-05-29 08:10:30] [INFO ] Computed 111 invariants in 4 ms
[2024-05-29 08:10:30] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-05-29 08:10:30] [INFO ] Invariant cache hit.
[2024-05-29 08:10:30] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
[2024-05-29 08:10:30] [INFO ] Redundant transitions in 0 ms returned []
Running 259 sub problems to find dead transitions.
[2024-05-29 08:10:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:10:32] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-05-29 08:10:32] [INFO ] Deduced a trap composed of 28 places in 27 ms of which 1 ms to minimize.
[2024-05-29 08:10:32] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 1 ms to minimize.
[2024-05-29 08:10:33] [INFO ] Deduced a trap composed of 56 places in 38 ms of which 0 ms to minimize.
[2024-05-29 08:10:33] [INFO ] Deduced a trap composed of 73 places in 42 ms of which 1 ms to minimize.
[2024-05-29 08:10:33] [INFO ] Deduced a trap composed of 86 places in 43 ms of which 1 ms to minimize.
[2024-05-29 08:10:33] [INFO ] Deduced a trap composed of 104 places in 52 ms of which 1 ms to minimize.
[2024-05-29 08:10:33] [INFO ] Deduced a trap composed of 116 places in 46 ms of which 1 ms to minimize.
[2024-05-29 08:10:33] [INFO ] Deduced a trap composed of 129 places in 56 ms of which 2 ms to minimize.
[2024-05-29 08:10:33] [INFO ] Deduced a trap composed of 148 places in 60 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 10/121 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:10:35] [INFO ] Deduced a trap composed of 102 places in 49 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:10:36] [INFO ] Deduced a trap composed of 103 places in 41 ms of which 1 ms to minimize.
[2024-05-29 08:10:36] [INFO ] Deduced a trap composed of 102 places in 41 ms of which 1 ms to minimize.
[2024-05-29 08:10:36] [INFO ] Deduced a trap composed of 102 places in 45 ms of which 1 ms to minimize.
[2024-05-29 08:10:36] [INFO ] Deduced a trap composed of 101 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 4/126 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (OVERLAPS) 261/572 variables, 311/437 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:10:39] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 1/438 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:10:45] [INFO ] Deduced a trap composed of 56 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/572 variables, 1/439 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:10:50] [INFO ] Deduced a trap composed of 26 places in 23 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/572 variables, 1/440 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:10:51] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/572 variables, 1/441 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/572 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 13 (OVERLAPS) 0/572 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 259 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 441 constraints, problems are : Problem set: 0 solved, 259 unsolved in 27996 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 259 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 19/130 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:10:59] [INFO ] Deduced a trap composed of 102 places in 49 ms of which 1 ms to minimize.
[2024-05-29 08:10:59] [INFO ] Deduced a trap composed of 102 places in 42 ms of which 1 ms to minimize.
[2024-05-29 08:11:00] [INFO ] Deduced a trap composed of 103 places in 39 ms of which 1 ms to minimize.
[2024-05-29 08:11:00] [INFO ] Deduced a trap composed of 71 places in 42 ms of which 1 ms to minimize.
[2024-05-29 08:11:00] [INFO ] Deduced a trap composed of 102 places in 38 ms of which 1 ms to minimize.
[2024-05-29 08:11:00] [INFO ] Deduced a trap composed of 101 places in 41 ms of which 1 ms to minimize.
[2024-05-29 08:11:00] [INFO ] Deduced a trap composed of 102 places in 39 ms of which 1 ms to minimize.
[2024-05-29 08:11:00] [INFO ] Deduced a trap composed of 100 places in 40 ms of which 1 ms to minimize.
[2024-05-29 08:11:00] [INFO ] Deduced a trap composed of 102 places in 40 ms of which 1 ms to minimize.
[2024-05-29 08:11:00] [INFO ] Deduced a trap composed of 100 places in 40 ms of which 1 ms to minimize.
[2024-05-29 08:11:00] [INFO ] Deduced a trap composed of 100 places in 42 ms of which 1 ms to minimize.
[2024-05-29 08:11:00] [INFO ] Deduced a trap composed of 100 places in 47 ms of which 1 ms to minimize.
[2024-05-29 08:11:00] [INFO ] Deduced a trap composed of 98 places in 40 ms of which 1 ms to minimize.
[2024-05-29 08:11:00] [INFO ] Deduced a trap composed of 41 places in 38 ms of which 1 ms to minimize.
[2024-05-29 08:11:00] [INFO ] Deduced a trap composed of 103 places in 40 ms of which 1 ms to minimize.
[2024-05-29 08:11:00] [INFO ] Deduced a trap composed of 102 places in 43 ms of which 1 ms to minimize.
[2024-05-29 08:11:00] [INFO ] Deduced a trap composed of 103 places in 40 ms of which 1 ms to minimize.
[2024-05-29 08:11:00] [INFO ] Deduced a trap composed of 101 places in 40 ms of which 1 ms to minimize.
[2024-05-29 08:11:00] [INFO ] Deduced a trap composed of 70 places in 39 ms of which 1 ms to minimize.
[2024-05-29 08:11:00] [INFO ] Deduced a trap composed of 82 places in 41 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 20/150 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (OVERLAPS) 261/572 variables, 311/461 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/572 variables, 259/720 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 0/720 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 720 constraints, problems are : Problem set: 0 solved, 259 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 39/39 constraints]
After SMT, in 58033ms problems are : Problem set: 0 solved, 259 unsolved
Search for dead transitions found 0 dead transitions in 58035ms
Starting structural reductions in SI_LTL mode, iteration 1 : 311/613 places, 261/563 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 58422 ms. Remains : 311/613 places, 261/563 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 118 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 167 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 1397 steps (1 resets) in 15 ms. (87 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) p1))), (F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 13 factoid took 264 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 148 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-29 08:11:29] [INFO ] Invariant cache hit.
[2024-05-29 08:11:29] [INFO ] [Real]Absence check using 111 positive place invariants in 22 ms returned sat
[2024-05-29 08:11:29] [INFO ] [Real]Absence check using state equation in 179 ms returned sat
[2024-05-29 08:11:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 08:11:29] [INFO ] [Nat]Absence check using 111 positive place invariants in 21 ms returned sat
[2024-05-29 08:11:30] [INFO ] [Nat]Absence check using state equation in 235 ms returned sat
[2024-05-29 08:11:30] [INFO ] Computed and/alt/rep : 259/494/259 causal constraints (skipped 0 transitions) in 14 ms.
[2024-05-29 08:11:31] [INFO ] Added : 209 causal constraints over 42 iterations in 1352 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1211 reset in 299 ms.
Product exploration explored 100000 steps with 1197 reset in 343 ms.
Built C files in :
/tmp/ltsmin4256802678732057383
[2024-05-29 08:11:32] [INFO ] Computing symmetric may disable matrix : 261 transitions.
[2024-05-29 08:11:32] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 08:11:32] [INFO ] Computing symmetric may enable matrix : 261 transitions.
[2024-05-29 08:11:32] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 08:11:32] [INFO ] Computing Do-Not-Accords matrix : 261 transitions.
[2024-05-29 08:11:32] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 08:11:32] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4256802678732057383
Running compilation step : cd /tmp/ltsmin4256802678732057383;'/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'
Compilation finished in 585 ms.
Running link step : cd /tmp/ltsmin4256802678732057383;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin4256802678732057383;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17315193650685851431.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 261/261 transitions.
Applied a total of 0 rules in 9 ms. Remains 311 /311 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2024-05-29 08:11:47] [INFO ] Invariant cache hit.
[2024-05-29 08:11:47] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-05-29 08:11:47] [INFO ] Invariant cache hit.
[2024-05-29 08:11:47] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
[2024-05-29 08:11:47] [INFO ] Redundant transitions in 0 ms returned []
Running 259 sub problems to find dead transitions.
[2024-05-29 08:11:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:11:49] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-05-29 08:11:50] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 1 ms to minimize.
[2024-05-29 08:11:50] [INFO ] Deduced a trap composed of 42 places in 31 ms of which 0 ms to minimize.
[2024-05-29 08:11:50] [INFO ] Deduced a trap composed of 56 places in 37 ms of which 0 ms to minimize.
[2024-05-29 08:11:50] [INFO ] Deduced a trap composed of 73 places in 39 ms of which 1 ms to minimize.
[2024-05-29 08:11:50] [INFO ] Deduced a trap composed of 86 places in 45 ms of which 1 ms to minimize.
[2024-05-29 08:11:50] [INFO ] Deduced a trap composed of 104 places in 48 ms of which 1 ms to minimize.
[2024-05-29 08:11:50] [INFO ] Deduced a trap composed of 116 places in 46 ms of which 1 ms to minimize.
[2024-05-29 08:11:50] [INFO ] Deduced a trap composed of 129 places in 49 ms of which 1 ms to minimize.
[2024-05-29 08:11:50] [INFO ] Deduced a trap composed of 148 places in 65 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 10/121 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:11:52] [INFO ] Deduced a trap composed of 102 places in 49 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:11:53] [INFO ] Deduced a trap composed of 103 places in 48 ms of which 1 ms to minimize.
[2024-05-29 08:11:53] [INFO ] Deduced a trap composed of 102 places in 42 ms of which 1 ms to minimize.
[2024-05-29 08:11:53] [INFO ] Deduced a trap composed of 102 places in 40 ms of which 1 ms to minimize.
[2024-05-29 08:11:53] [INFO ] Deduced a trap composed of 101 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 4/126 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (OVERLAPS) 261/572 variables, 311/437 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:11:57] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 1/438 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:12:02] [INFO ] Deduced a trap composed of 56 places in 30 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/572 variables, 1/439 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:12:07] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/572 variables, 1/440 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:12:09] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/572 variables, 1/441 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/572 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 13 (OVERLAPS) 0/572 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 259 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 441 constraints, problems are : Problem set: 0 solved, 259 unsolved in 28418 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 259 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 19/130 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:12:17] [INFO ] Deduced a trap composed of 102 places in 49 ms of which 1 ms to minimize.
[2024-05-29 08:12:17] [INFO ] Deduced a trap composed of 102 places in 43 ms of which 1 ms to minimize.
[2024-05-29 08:12:17] [INFO ] Deduced a trap composed of 103 places in 42 ms of which 1 ms to minimize.
[2024-05-29 08:12:17] [INFO ] Deduced a trap composed of 71 places in 43 ms of which 1 ms to minimize.
[2024-05-29 08:12:17] [INFO ] Deduced a trap composed of 102 places in 39 ms of which 1 ms to minimize.
[2024-05-29 08:12:17] [INFO ] Deduced a trap composed of 101 places in 46 ms of which 1 ms to minimize.
[2024-05-29 08:12:17] [INFO ] Deduced a trap composed of 102 places in 42 ms of which 1 ms to minimize.
[2024-05-29 08:12:18] [INFO ] Deduced a trap composed of 100 places in 43 ms of which 1 ms to minimize.
[2024-05-29 08:12:18] [INFO ] Deduced a trap composed of 102 places in 40 ms of which 1 ms to minimize.
[2024-05-29 08:12:18] [INFO ] Deduced a trap composed of 100 places in 39 ms of which 1 ms to minimize.
[2024-05-29 08:12:18] [INFO ] Deduced a trap composed of 100 places in 37 ms of which 1 ms to minimize.
[2024-05-29 08:12:18] [INFO ] Deduced a trap composed of 100 places in 38 ms of which 0 ms to minimize.
[2024-05-29 08:12:18] [INFO ] Deduced a trap composed of 98 places in 41 ms of which 1 ms to minimize.
[2024-05-29 08:12:18] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 1 ms to minimize.
[2024-05-29 08:12:18] [INFO ] Deduced a trap composed of 103 places in 43 ms of which 1 ms to minimize.
[2024-05-29 08:12:18] [INFO ] Deduced a trap composed of 102 places in 44 ms of which 1 ms to minimize.
[2024-05-29 08:12:18] [INFO ] Deduced a trap composed of 103 places in 41 ms of which 1 ms to minimize.
[2024-05-29 08:12:18] [INFO ] Deduced a trap composed of 101 places in 41 ms of which 1 ms to minimize.
[2024-05-29 08:12:18] [INFO ] Deduced a trap composed of 70 places in 41 ms of which 1 ms to minimize.
[2024-05-29 08:12:18] [INFO ] Deduced a trap composed of 82 places in 43 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 20/150 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (OVERLAPS) 261/572 variables, 311/461 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/572 variables, 259/720 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 0/720 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 720 constraints, problems are : Problem set: 0 solved, 259 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 39/39 constraints]
After SMT, in 58454ms problems are : Problem set: 0 solved, 259 unsolved
Search for dead transitions found 0 dead transitions in 58457ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 58801 ms. Remains : 311/311 places, 261/261 transitions.
Built C files in :
/tmp/ltsmin17894919134846429816
[2024-05-29 08:12:46] [INFO ] Computing symmetric may disable matrix : 261 transitions.
[2024-05-29 08:12:46] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 08:12:46] [INFO ] Computing symmetric may enable matrix : 261 transitions.
[2024-05-29 08:12:46] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 08:12:46] [INFO ] Computing Do-Not-Accords matrix : 261 transitions.
[2024-05-29 08:12:46] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 08:12:46] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17894919134846429816
Running compilation step : cd /tmp/ltsmin17894919134846429816;'/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'
Compilation finished in 599 ms.
Running link step : cd /tmp/ltsmin17894919134846429816;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin17894919134846429816;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6110308617982913990.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 08:13:01] [INFO ] Flatten gal took : 7 ms
[2024-05-29 08:13:01] [INFO ] Flatten gal took : 7 ms
[2024-05-29 08:13:01] [INFO ] Time to serialize gal into /tmp/LTL12378520609518096216.gal : 1 ms
[2024-05-29 08:13:01] [INFO ] Time to serialize properties into /tmp/LTL652414756439214001.prop : 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/LTL12378520609518096216.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9710847244366003570.hoa' '-atoms' '/tmp/LTL652414756439214001.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...317
Loading property file /tmp/LTL652414756439214001.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9710847244366003570.hoa
Detected timeout of ITS tools.
[2024-05-29 08:13:16] [INFO ] Flatten gal took : 7 ms
[2024-05-29 08:13:16] [INFO ] Flatten gal took : 8 ms
[2024-05-29 08:13:16] [INFO ] Time to serialize gal into /tmp/LTL17755006624046070363.gal : 1 ms
[2024-05-29 08:13:16] [INFO ] Time to serialize properties into /tmp/LTL16041633983358300512.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/LTL17755006624046070363.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16041633983358300512.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...277
Read 1 LTL properties
Checking formula 0 : !((F(("(p405==1)")||(X(F("(p400==1)"))))))
Formula 0 simplified : G(!"(p405==1)" & XG!"(p400==1)")
Detected timeout of ITS tools.
[2024-05-29 08:13:31] [INFO ] Flatten gal took : 10 ms
[2024-05-29 08:13:31] [INFO ] Applying decomposition
[2024-05-29 08:13:31] [INFO ] Flatten gal took : 8 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/graph4123913138672878242.txt' '-o' '/tmp/graph4123913138672878242.bin' '-w' '/tmp/graph4123913138672878242.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4123913138672878242.bin' '-l' '-1' '-v' '-w' '/tmp/graph4123913138672878242.weights' '-q' '0' '-e' '0.001'
[2024-05-29 08:13:31] [INFO ] Decomposing Gal with order
[2024-05-29 08:13:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 08:13:31] [INFO ] Removed a total of 61 redundant transitions.
[2024-05-29 08:13:31] [INFO ] Flatten gal took : 13 ms
[2024-05-29 08:13:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 116 labels/synchronizations in 3 ms.
[2024-05-29 08:13:31] [INFO ] Time to serialize gal into /tmp/LTL11546469605239355105.gal : 3 ms
[2024-05-29 08:13:31] [INFO ] Time to serialize properties into /tmp/LTL10918290414185396336.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/LTL11546469605239355105.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10918290414185396336.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...256
Read 1 LTL properties
Checking formula 0 : !((F(("(i5.i3.u66.p405==1)")||(X(F("(i5.i1.u65.p400==1)"))))))
Formula 0 simplified : G(!"(i5.i3.u66.p405==1)" & XG!"(i5.i1.u65.p400==1)")
Detected timeout of ITS tools.
Treatment of property ShieldPPPs-PT-010B-LTLFireability-10 finished in 270478 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)))'
Support contains 4 out of 618 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 618/618 places, 568/568 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 617 transition count 496
Reduce places removed 71 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 72 rules applied. Total rules applied 143 place count 546 transition count 495
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 144 place count 545 transition count 495
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 50 Pre rules applied. Total rules applied 144 place count 545 transition count 445
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 244 place count 495 transition count 445
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 249 place count 490 transition count 440
Iterating global reduction 3 with 5 rules applied. Total rules applied 254 place count 490 transition count 440
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 254 place count 490 transition count 436
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 262 place count 486 transition count 436
Performed 172 Post agglomeration using F-continuation condition.Transition count delta: 172
Deduced a syphon composed of 172 places in 0 ms
Reduce places removed 172 places and 0 transitions.
Iterating global reduction 3 with 344 rules applied. Total rules applied 606 place count 314 transition count 264
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 608 place count 312 transition count 262
Applied a total of 608 rules in 43 ms. Remains 312 /618 variables (removed 306) and now considering 262/568 (removed 306) transitions.
// Phase 1: matrix 262 rows 312 cols
[2024-05-29 08:13:46] [INFO ] Computed 111 invariants in 1 ms
[2024-05-29 08:13:46] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-05-29 08:13:46] [INFO ] Invariant cache hit.
[2024-05-29 08:13:47] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
[2024-05-29 08:13:47] [INFO ] Redundant transitions in 0 ms returned []
Running 260 sub problems to find dead transitions.
[2024-05-29 08:13:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 08:13:49] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-29 08:13:49] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 0 ms to minimize.
[2024-05-29 08:13:49] [INFO ] Deduced a trap composed of 42 places in 26 ms of which 1 ms to minimize.
[2024-05-29 08:13:49] [INFO ] Deduced a trap composed of 56 places in 30 ms of which 0 ms to minimize.
[2024-05-29 08:13:49] [INFO ] Deduced a trap composed of 73 places in 43 ms of which 1 ms to minimize.
[2024-05-29 08:13:49] [INFO ] Deduced a trap composed of 85 places in 44 ms of which 1 ms to minimize.
[2024-05-29 08:13:49] [INFO ] Deduced a trap composed of 104 places in 50 ms of which 1 ms to minimize.
[2024-05-29 08:13:49] [INFO ] Deduced a trap composed of 116 places in 49 ms of which 1 ms to minimize.
[2024-05-29 08:13:50] [INFO ] Deduced a trap composed of 130 places in 54 ms of which 1 ms to minimize.
[2024-05-29 08:13:50] [INFO ] Deduced a trap composed of 144 places in 60 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 10/121 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/312 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 262/574 variables, 312/433 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/574 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 08:13:56] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (OVERLAPS) 0/574 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 08:13:57] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/574 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/574 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 08:14:05] [INFO ] Deduced a trap composed of 13 places in 18 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/574 variables, 1/436 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/574 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 0/574 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 574/574 variables, and 436 constraints, problems are : Problem set: 0 solved, 260 unsolved in 24644 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 13/124 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/312 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 262/574 variables, 312/436 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/574 variables, 260/696 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/574 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 08:14:36] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-05-29 08:14:36] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 574/574 variables, and 698 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 15/15 constraints]
After SMT, in 54682ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 54685ms
Starting structural reductions in SI_LTL mode, iteration 1 : 312/618 places, 262/568 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 55092 ms. Remains : 312/618 places, 262/568 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPs-PT-010B-LTLFireability-11
Product exploration explored 100000 steps with 657 reset in 319 ms.
Product exploration explored 100000 steps with 661 reset in 360 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 96 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 499 steps (0 resets) in 7 ms. (62 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 9 factoid took 117 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 58 ms :[(NOT p1), (NOT p1)]
[2024-05-29 08:14:42] [INFO ] Invariant cache hit.
[2024-05-29 08:14:43] [INFO ] [Real]Absence check using 111 positive place invariants in 21 ms returned sat
[2024-05-29 08:14:43] [INFO ] [Real]Absence check using state equation in 188 ms returned sat
[2024-05-29 08:14:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 08:14:43] [INFO ] [Nat]Absence check using 111 positive place invariants in 22 ms returned sat
[2024-05-29 08:14:43] [INFO ] [Nat]Absence check using state equation in 210 ms returned sat
[2024-05-29 08:14:43] [INFO ] Computed and/alt/rep : 260/495/260 causal constraints (skipped 0 transitions) in 14 ms.
[2024-05-29 08:14:45] [INFO ] Added : 220 causal constraints over 44 iterations in 1451 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 1 out of 312 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 312/312 places, 262/262 transitions.
Applied a total of 0 rules in 10 ms. Remains 312 /312 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2024-05-29 08:14:45] [INFO ] Invariant cache hit.
[2024-05-29 08:14:45] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-05-29 08:14:45] [INFO ] Invariant cache hit.
[2024-05-29 08:14:45] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
[2024-05-29 08:14:45] [INFO ] Redundant transitions in 3 ms returned []
Running 260 sub problems to find dead transitions.
[2024-05-29 08:14:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 08:14:47] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2024-05-29 08:14:47] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 0 ms to minimize.
[2024-05-29 08:14:47] [INFO ] Deduced a trap composed of 42 places in 28 ms of which 1 ms to minimize.
[2024-05-29 08:14:47] [INFO ] Deduced a trap composed of 56 places in 34 ms of which 0 ms to minimize.
[2024-05-29 08:14:48] [INFO ] Deduced a trap composed of 73 places in 39 ms of which 0 ms to minimize.
[2024-05-29 08:14:48] [INFO ] Deduced a trap composed of 85 places in 43 ms of which 1 ms to minimize.
[2024-05-29 08:14:48] [INFO ] Deduced a trap composed of 104 places in 52 ms of which 1 ms to minimize.
[2024-05-29 08:14:48] [INFO ] Deduced a trap composed of 116 places in 53 ms of which 1 ms to minimize.
[2024-05-29 08:14:48] [INFO ] Deduced a trap composed of 130 places in 56 ms of which 1 ms to minimize.
[2024-05-29 08:14:48] [INFO ] Deduced a trap composed of 144 places in 60 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 10/121 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/312 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 262/574 variables, 312/433 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/574 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 08:14:55] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
At refinement iteration 5 (OVERLAPS) 0/574 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 08:14:56] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/574 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/574 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 08:15:03] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/574 variables, 1/436 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/574 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 0/574 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 574/574 variables, and 436 constraints, problems are : Problem set: 0 solved, 260 unsolved in 24762 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 13/124 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/312 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 262/574 variables, 312/436 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/574 variables, 260/696 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/574 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 08:15:35] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-05-29 08:15:35] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 574/574 variables, and 698 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 15/15 constraints]
After SMT, in 54801ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 54807ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 55172 ms. Remains : 312/312 places, 262/262 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 417 steps (0 resets) in 8 ms. (46 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 126 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p1), (NOT p1)]
[2024-05-29 08:15:40] [INFO ] Invariant cache hit.
[2024-05-29 08:15:40] [INFO ] [Real]Absence check using 111 positive place invariants in 22 ms returned sat
[2024-05-29 08:15:40] [INFO ] [Real]Absence check using state equation in 193 ms returned sat
[2024-05-29 08:15:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 08:15:41] [INFO ] [Nat]Absence check using 111 positive place invariants in 21 ms returned sat
[2024-05-29 08:15:41] [INFO ] [Nat]Absence check using state equation in 215 ms returned sat
[2024-05-29 08:15:41] [INFO ] Computed and/alt/rep : 260/495/260 causal constraints (skipped 0 transitions) in 14 ms.
[2024-05-29 08:15:42] [INFO ] Added : 220 causal constraints over 44 iterations in 1514 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 655 reset in 319 ms.
Product exploration explored 100000 steps with 655 reset in 361 ms.
Built C files in :
/tmp/ltsmin17051040363265819118
[2024-05-29 08:15:43] [INFO ] Computing symmetric may disable matrix : 262 transitions.
[2024-05-29 08:15:43] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 08:15:43] [INFO ] Computing symmetric may enable matrix : 262 transitions.
[2024-05-29 08:15:43] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 08:15:43] [INFO ] Computing Do-Not-Accords matrix : 262 transitions.
[2024-05-29 08:15:43] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 08:15:43] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17051040363265819118
Running compilation step : cd /tmp/ltsmin17051040363265819118;'/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'
Compilation finished in 597 ms.
Running link step : cd /tmp/ltsmin17051040363265819118;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin17051040363265819118;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8456327875121394473.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 312 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 312/312 places, 262/262 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 311 transition count 261
Applied a total of 2 rules in 16 ms. Remains 311 /312 variables (removed 1) and now considering 261/262 (removed 1) transitions.
// Phase 1: matrix 261 rows 311 cols
[2024-05-29 08:15:58] [INFO ] Computed 111 invariants in 3 ms
[2024-05-29 08:15:58] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-05-29 08:15:58] [INFO ] Invariant cache hit.
[2024-05-29 08:15:59] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
[2024-05-29 08:15:59] [INFO ] Redundant transitions in 1 ms returned []
Running 259 sub problems to find dead transitions.
[2024-05-29 08:15:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:16:01] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-05-29 08:16:01] [INFO ] Deduced a trap composed of 28 places in 27 ms of which 1 ms to minimize.
[2024-05-29 08:16:01] [INFO ] Deduced a trap composed of 42 places in 31 ms of which 0 ms to minimize.
[2024-05-29 08:16:01] [INFO ] Deduced a trap composed of 56 places in 36 ms of which 0 ms to minimize.
[2024-05-29 08:16:01] [INFO ] Deduced a trap composed of 73 places in 43 ms of which 0 ms to minimize.
[2024-05-29 08:16:01] [INFO ] Deduced a trap composed of 85 places in 45 ms of which 1 ms to minimize.
[2024-05-29 08:16:01] [INFO ] Deduced a trap composed of 104 places in 50 ms of which 1 ms to minimize.
[2024-05-29 08:16:02] [INFO ] Deduced a trap composed of 116 places in 59 ms of which 1 ms to minimize.
[2024-05-29 08:16:02] [INFO ] Deduced a trap composed of 130 places in 52 ms of which 1 ms to minimize.
[2024-05-29 08:16:02] [INFO ] Deduced a trap composed of 143 places in 60 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 10/121 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:16:03] [INFO ] Deduced a trap composed of 72 places in 42 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (OVERLAPS) 261/572 variables, 311/433 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:16:07] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-29 08:16:08] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/572 variables, 2/435 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:16:08] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 1/436 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 8 (OVERLAPS) 0/572 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 259 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 436 constraints, problems are : Problem set: 0 solved, 259 unsolved in 16212 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 259 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 14/125 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:16:16] [INFO ] Deduced a trap composed of 42 places in 37 ms of which 1 ms to minimize.
[2024-05-29 08:16:16] [INFO ] Deduced a trap composed of 41 places in 31 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (OVERLAPS) 261/572 variables, 311/438 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/572 variables, 259/697 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 0/697 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 697 constraints, problems are : Problem set: 0 solved, 259 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 16/16 constraints]
After SMT, in 46258ms problems are : Problem set: 0 solved, 259 unsolved
Search for dead transitions found 0 dead transitions in 46260ms
Starting structural reductions in SI_LTL mode, iteration 1 : 311/312 places, 261/262 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 46642 ms. Remains : 311/312 places, 261/262 transitions.
Built C files in :
/tmp/ltsmin4060133021656325999
[2024-05-29 08:16:45] [INFO ] Computing symmetric may disable matrix : 261 transitions.
[2024-05-29 08:16:45] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 08:16:45] [INFO ] Computing symmetric may enable matrix : 261 transitions.
[2024-05-29 08:16:45] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 08:16:45] [INFO ] Computing Do-Not-Accords matrix : 261 transitions.
[2024-05-29 08:16:45] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 08:16:45] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4060133021656325999
Running compilation step : cd /tmp/ltsmin4060133021656325999;'/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'
Compilation finished in 578 ms.
Running link step : cd /tmp/ltsmin4060133021656325999;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin4060133021656325999;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2861679148059262204.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 08:17:00] [INFO ] Flatten gal took : 10 ms
[2024-05-29 08:17:00] [INFO ] Flatten gal took : 7 ms
[2024-05-29 08:17:00] [INFO ] Time to serialize gal into /tmp/LTL14369112721303241196.gal : 2 ms
[2024-05-29 08:17:00] [INFO ] Time to serialize properties into /tmp/LTL11890675273635121912.prop : 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/LTL14369112721303241196.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18446149452253643303.hoa' '-atoms' '/tmp/LTL11890675273635121912.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...320
Loading property file /tmp/LTL11890675273635121912.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18446149452253643303.hoa
Detected timeout of ITS tools.
[2024-05-29 08:17:15] [INFO ] Flatten gal took : 12 ms
[2024-05-29 08:17:15] [INFO ] Flatten gal took : 7 ms
[2024-05-29 08:17:15] [INFO ] Time to serialize gal into /tmp/LTL14120071149213502621.gal : 1 ms
[2024-05-29 08:17:15] [INFO ] Time to serialize properties into /tmp/LTL10288003833712522702.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/LTL14120071149213502621.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10288003833712522702.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...277
Read 1 LTL properties
Checking formula 0 : !(((G("((p673==1)&&((p430==0)||(p432==0)))"))||(F("(p241==1)"))))
Formula 0 simplified : F!"((p673==1)&&((p430==0)||(p432==0)))" & G!"(p241==1)"
Detected timeout of ITS tools.
[2024-05-29 08:17:30] [INFO ] Flatten gal took : 10 ms
[2024-05-29 08:17:30] [INFO ] Applying decomposition
[2024-05-29 08:17:30] [INFO ] Flatten gal took : 7 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/graph14770645802456252795.txt' '-o' '/tmp/graph14770645802456252795.bin' '-w' '/tmp/graph14770645802456252795.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14770645802456252795.bin' '-l' '-1' '-v' '-w' '/tmp/graph14770645802456252795.weights' '-q' '0' '-e' '0.001'
[2024-05-29 08:17:30] [INFO ] Decomposing Gal with order
[2024-05-29 08:17:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 08:17:30] [INFO ] Removed a total of 62 redundant transitions.
[2024-05-29 08:17:30] [INFO ] Flatten gal took : 17 ms
[2024-05-29 08:17:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 120 labels/synchronizations in 4 ms.
[2024-05-29 08:17:30] [INFO ] Time to serialize gal into /tmp/LTL5928783916813109245.gal : 14 ms
[2024-05-29 08:17:30] [INFO ] Time to serialize properties into /tmp/LTL10943531864274102886.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/LTL5928783916813109245.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10943531864274102886.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("((i9.i3.u111.p673==1)&&((i6.i0.u69.p430==0)||(i6.i2.u70.p432==0)))"))||(F("(i3.i2.u40.p241==1)"))))
Formula 0 simplified : F!"((i9.i3.u111.p673==1)&&((i6.i0.u69.p430==0)||(i6.i2.u70.p432==0)))" & G!"(i3.i2.u40.p241==1)"
Detected timeout of ITS tools.
Treatment of property ShieldPPPs-PT-010B-LTLFireability-11 finished in 239198 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(p0))))'
Support contains 1 out of 618 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 618/618 places, 568/568 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 612 transition count 562
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 612 transition count 562
Applied a total of 12 rules in 25 ms. Remains 612 /618 variables (removed 6) and now considering 562/568 (removed 6) transitions.
// Phase 1: matrix 562 rows 612 cols
[2024-05-29 08:17:45] [INFO ] Computed 111 invariants in 4 ms
[2024-05-29 08:17:45] [INFO ] Implicit Places using invariants in 168 ms returned []
[2024-05-29 08:17:45] [INFO ] Invariant cache hit.
[2024-05-29 08:17:46] [INFO ] Implicit Places using invariants and state equation in 396 ms returned []
Implicit Place search using SMT with State Equation took 565 ms to find 0 implicit places.
Running 561 sub problems to find dead transitions.
[2024-05-29 08:17:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/611 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (OVERLAPS) 1/612 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-05-29 08:17:56] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2024-05-29 08:17:56] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-29 08:17:56] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-29 08:17:56] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-05-29 08:17:57] [INFO ] Deduced a trap composed of 18 places in 176 ms of which 3 ms to minimize.
[2024-05-29 08:17:57] [INFO ] Deduced a trap composed of 20 places in 154 ms of which 3 ms to minimize.
[2024-05-29 08:17:57] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-29 08:17:57] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-29 08:17:57] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-29 08:17:57] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-05-29 08:17:57] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2024-05-29 08:17:57] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-29 08:17:57] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2024-05-29 08:17:58] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 4 ms to minimize.
[2024-05-29 08:17:58] [INFO ] Deduced a trap composed of 21 places in 146 ms of which 3 ms to minimize.
[2024-05-29 08:17:58] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
[2024-05-29 08:17:58] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-29 08:17:58] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2024-05-29 08:17:58] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-29 08:17:58] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/612 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-05-29 08:18:00] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-29 08:18:00] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 1 ms to minimize.
[2024-05-29 08:18:00] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-29 08:18:00] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2024-05-29 08:18:00] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 0 ms to minimize.
[2024-05-29 08:18:00] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-05-29 08:18:00] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-29 08:18:01] [INFO ] Deduced a trap composed of 18 places in 144 ms of which 3 ms to minimize.
[2024-05-29 08:18:01] [INFO ] Deduced a trap composed of 26 places in 140 ms of which 3 ms to minimize.
[2024-05-29 08:18:01] [INFO ] Deduced a trap composed of 27 places in 129 ms of which 3 ms to minimize.
[2024-05-29 08:18:01] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 1 ms to minimize.
[2024-05-29 08:18:01] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-05-29 08:18:01] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-29 08:18:01] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-29 08:18:01] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-29 08:18:01] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-05-29 08:18:02] [INFO ] Deduced a trap composed of 21 places in 138 ms of which 2 ms to minimize.
[2024-05-29 08:18:02] [INFO ] Deduced a trap composed of 29 places in 128 ms of which 3 ms to minimize.
[2024-05-29 08:18:02] [INFO ] Deduced a trap composed of 43 places in 110 ms of which 2 ms to minimize.
[2024-05-29 08:18:02] [INFO ] Deduced a trap composed of 22 places in 114 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/612 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-05-29 08:18:08] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2024-05-29 08:18:08] [INFO ] Deduced a trap composed of 17 places in 17 ms of which 0 ms to minimize.
[2024-05-29 08:18:08] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-05-29 08:18:08] [INFO ] Deduced a trap composed of 20 places in 161 ms of which 3 ms to minimize.
[2024-05-29 08:18:09] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-29 08:18:09] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-29 08:18:09] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 0 ms to minimize.
[2024-05-29 08:18:09] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
[2024-05-29 08:18:09] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 0 ms to minimize.
[2024-05-29 08:18:09] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-29 08:18:10] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 0 ms to minimize.
[2024-05-29 08:18:10] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-05-29 08:18:10] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2024-05-29 08:18:10] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 2 ms to minimize.
[2024-05-29 08:18:10] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 1 ms to minimize.
[2024-05-29 08:18:10] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-29 08:18:10] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 1 ms to minimize.
[2024-05-29 08:18:10] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-29 08:18:10] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-05-29 08:18:10] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/612 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-05-29 08:18:12] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-29 08:18:13] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 1 ms to minimize.
[2024-05-29 08:18:13] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-05-29 08:18:13] [INFO ] Deduced a trap composed of 34 places in 64 ms of which 1 ms to minimize.
[2024-05-29 08:18:13] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 2 ms to minimize.
[2024-05-29 08:18:14] [INFO ] Deduced a trap composed of 46 places in 56 ms of which 1 ms to minimize.
[2024-05-29 08:18:14] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-05-29 08:18:14] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-29 08:18:14] [INFO ] Deduced a trap composed of 49 places in 69 ms of which 1 ms to minimize.
[2024-05-29 08:18:14] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 1 ms to minimize.
[2024-05-29 08:18:14] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 2 ms to minimize.
[2024-05-29 08:18:14] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 0 ms to minimize.
[2024-05-29 08:18:14] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 0 ms to minimize.
[2024-05-29 08:18:14] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-29 08:18:14] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 2 ms to minimize.
[2024-05-29 08:18:15] [INFO ] Deduced a trap composed of 42 places in 74 ms of which 2 ms to minimize.
[2024-05-29 08:18:15] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 2 ms to minimize.
[2024-05-29 08:18:15] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
[2024-05-29 08:18:15] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 0 ms to minimize.
[2024-05-29 08:18:15] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/612 variables, 20/191 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 1.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 1.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 timeout
0.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 612/1174 variables, and 191 constraints, problems are : Problem set: 0 solved, 561 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/612 constraints, PredecessorRefiner: 561/561 constraints, Known Traps: 80/80 constraints]
Escalating to Integer solving :Problem set: 0 solved, 561 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/611 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (OVERLAPS) 1/612 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/612 variables, 80/191 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-05-29 08:18:23] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2024-05-29 08:18:23] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 0 ms to minimize.
[2024-05-29 08:18:23] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
[2024-05-29 08:18:23] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2024-05-29 08:18:23] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 0 ms to minimize.
[2024-05-29 08:18:23] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-29 08:18:23] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-29 08:18:23] [INFO ] Deduced a trap composed of 48 places in 53 ms of which 1 ms to minimize.
[2024-05-29 08:18:24] [INFO ] Deduced a trap composed of 49 places in 115 ms of which 2 ms to minimize.
[2024-05-29 08:18:24] [INFO ] Deduced a trap composed of 22 places in 105 ms of which 3 ms to minimize.
[2024-05-29 08:18:24] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-05-29 08:18:24] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-29 08:18:24] [INFO ] Deduced a trap composed of 27 places in 27 ms of which 1 ms to minimize.
[2024-05-29 08:18:24] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 0 ms to minimize.
[2024-05-29 08:18:24] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
[2024-05-29 08:18:25] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 2 ms to minimize.
[2024-05-29 08:18:25] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-05-29 08:18:25] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
[2024-05-29 08:18:25] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 0 ms to minimize.
[2024-05-29 08:18:25] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/612 variables, 20/211 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-05-29 08:18:26] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2024-05-29 08:18:27] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-05-29 08:18:27] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-05-29 08:18:27] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-29 08:18:27] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
[2024-05-29 08:18:28] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-29 08:18:28] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-29 08:18:28] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 1 ms to minimize.
[2024-05-29 08:18:29] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 2 ms to minimize.
[2024-05-29 08:18:29] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 2 ms to minimize.
[2024-05-29 08:18:29] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 1 ms to minimize.
[2024-05-29 08:18:29] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
[2024-05-29 08:18:29] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-05-29 08:18:29] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 1 ms to minimize.
[2024-05-29 08:18:29] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-05-29 08:18:29] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 0 ms to minimize.
[2024-05-29 08:18:29] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-29 08:18:29] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-05-29 08:18:30] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 1 ms to minimize.
[2024-05-29 08:18:30] [INFO ] Deduced a trap composed of 43 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/612 variables, 20/231 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-05-29 08:18:32] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2024-05-29 08:18:32] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-29 08:18:32] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 1 ms to minimize.
[2024-05-29 08:18:32] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 2 ms to minimize.
[2024-05-29 08:18:32] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-29 08:18:32] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-29 08:18:32] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
[2024-05-29 08:18:33] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-05-29 08:18:34] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 0 ms to minimize.
[2024-05-29 08:18:34] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-29 08:18:34] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
[2024-05-29 08:18:34] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-05-29 08:18:34] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 1 ms to minimize.
[2024-05-29 08:18:34] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-05-29 08:18:34] [INFO ] Deduced a trap composed of 34 places in 24 ms of which 0 ms to minimize.
[2024-05-29 08:18:34] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 1 ms to minimize.
[2024-05-29 08:18:34] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2024-05-29 08:18:35] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-05-29 08:18:35] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-05-29 08:18:35] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/612 variables, 20/251 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-05-29 08:18:37] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
[2024-05-29 08:18:37] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 0 ms to minimize.
[2024-05-29 08:18:37] [INFO ] Deduced a trap composed of 27 places in 22 ms of which 0 ms to minimize.
[2024-05-29 08:18:37] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-05-29 08:18:37] [INFO ] Deduced a trap composed of 17 places in 18 ms of which 1 ms to minimize.
[2024-05-29 08:18:37] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-05-29 08:18:37] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 0 ms to minimize.
[2024-05-29 08:18:38] [INFO ] Deduced a trap composed of 33 places in 124 ms of which 3 ms to minimize.
[2024-05-29 08:18:38] [INFO ] Deduced a trap composed of 34 places in 113 ms of which 2 ms to minimize.
[2024-05-29 08:18:38] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
[2024-05-29 08:18:38] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2024-05-29 08:18:38] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-05-29 08:18:38] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2024-05-29 08:18:39] [INFO ] Deduced a trap composed of 47 places in 61 ms of which 1 ms to minimize.
[2024-05-29 08:18:39] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-05-29 08:18:39] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-29 08:18:39] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 0 ms to minimize.
[2024-05-29 08:18:39] [INFO ] Deduced a trap composed of 56 places in 66 ms of which 1 ms to minimize.
[2024-05-29 08:18:40] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-05-29 08:18:40] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/612 variables, 20/271 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-05-29 08:18:42] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-29 08:18:42] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
[2024-05-29 08:18:42] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-29 08:18:42] [INFO ] Deduced a trap composed of 43 places in 44 ms of which 1 ms to minimize.
[2024-05-29 08:18:42] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-05-29 08:18:43] [INFO ] Deduced a trap composed of 50 places in 47 ms of which 0 ms to minimize.
[2024-05-29 08:18:43] [INFO ] Deduced a trap composed of 49 places in 55 ms of which 1 ms to minimize.
[2024-05-29 08:18:43] [INFO ] Deduced a trap composed of 49 places in 64 ms of which 1 ms to minimize.
[2024-05-29 08:18:44] [INFO ] Deduced a trap composed of 50 places in 66 ms of which 2 ms to minimize.
[2024-05-29 08:18:44] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-05-29 08:18:44] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 1 ms to minimize.
[2024-05-29 08:18:45] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 1 ms to minimize.
[2024-05-29 08:18:46] [INFO ] Deduced a trap composed of 47 places in 87 ms of which 2 ms to minimize.
[2024-05-29 08:18:46] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-05-29 08:18:46] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 0 ms to minimize.
[2024-05-29 08:18:46] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 2 ms to minimize.
[2024-05-29 08:18:46] [INFO ] Deduced a trap composed of 70 places in 66 ms of which 7 ms to minimize.
SMT process timed out in 60078ms, After SMT, problems are : Problem set: 0 solved, 561 unsolved
Search for dead transitions found 0 dead transitions in 60084ms
Starting structural reductions in LTL mode, iteration 1 : 612/618 places, 562/568 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60676 ms. Remains : 612/618 places, 562/568 transitions.
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-010B-LTLFireability-12
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldPPPs-PT-010B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-010B-LTLFireability-12 finished in 60803 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((G(p0)||(p1 U (p2||G(p1)))))))'
Support contains 4 out of 618 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 618/618 places, 568/568 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 612 transition count 562
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 612 transition count 562
Applied a total of 12 rules in 25 ms. Remains 612 /618 variables (removed 6) and now considering 562/568 (removed 6) transitions.
[2024-05-29 08:18:46] [INFO ] Invariant cache hit.
[2024-05-29 08:18:46] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-05-29 08:18:46] [INFO ] Invariant cache hit.
[2024-05-29 08:18:47] [INFO ] Implicit Places using invariants and state equation in 386 ms returned []
Implicit Place search using SMT with State Equation took 551 ms to find 0 implicit places.
Running 561 sub problems to find dead transitions.
[2024-05-29 08:18:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/611 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (OVERLAPS) 1/612 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-05-29 08:18:57] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-29 08:18:57] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 0 ms to minimize.
[2024-05-29 08:18:57] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2024-05-29 08:18:57] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 0 ms to minimize.
[2024-05-29 08:18:58] [INFO ] Deduced a trap composed of 18 places in 169 ms of which 3 ms to minimize.
[2024-05-29 08:18:58] [INFO ] Deduced a trap composed of 20 places in 160 ms of which 4 ms to minimize.
[2024-05-29 08:18:58] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2024-05-29 08:18:58] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-05-29 08:18:58] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-05-29 08:18:58] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-05-29 08:18:58] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2024-05-29 08:18:58] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-29 08:18:58] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-29 08:18:58] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 3 ms to minimize.
[2024-05-29 08:18:59] [INFO ] Deduced a trap composed of 21 places in 139 ms of which 3 ms to minimize.
[2024-05-29 08:18:59] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 0 ms to minimize.
[2024-05-29 08:18:59] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-29 08:18:59] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
[2024-05-29 08:18:59] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-29 08:18:59] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/612 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-05-29 08:19:00] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-29 08:19:01] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 1 ms to minimize.
[2024-05-29 08:19:01] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2024-05-29 08:19:01] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2024-05-29 08:19:01] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-05-29 08:19:01] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2024-05-29 08:19:01] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 1 ms to minimize.
[2024-05-29 08:19:01] [INFO ] Deduced a trap composed of 18 places in 146 ms of which 3 ms to minimize.
[2024-05-29 08:19:02] [INFO ] Deduced a trap composed of 26 places in 139 ms of which 3 ms to minimize.
[2024-05-29 08:19:02] [INFO ] Deduced a trap composed of 27 places in 121 ms of which 3 ms to minimize.
[2024-05-29 08:19:02] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 0 ms to minimize.
[2024-05-29 08:19:02] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-29 08:19:02] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
[2024-05-29 08:19:02] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-29 08:19:02] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-29 08:19:02] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-05-29 08:19:02] [INFO ] Deduced a trap composed of 21 places in 140 ms of which 3 ms to minimize.
[2024-05-29 08:19:02] [INFO ] Deduced a trap composed of 29 places in 125 ms of which 3 ms to minimize.
[2024-05-29 08:19:03] [INFO ] Deduced a trap composed of 43 places in 104 ms of which 3 ms to minimize.
[2024-05-29 08:19:03] [INFO ] Deduced a trap composed of 22 places in 104 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/612 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-05-29 08:19:09] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-29 08:19:09] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 0 ms to minimize.
[2024-05-29 08:19:09] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-05-29 08:19:09] [INFO ] Deduced a trap composed of 20 places in 156 ms of which 4 ms to minimize.
[2024-05-29 08:19:09] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-05-29 08:19:10] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2024-05-29 08:19:10] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-29 08:19:10] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-05-29 08:19:10] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-29 08:19:10] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-29 08:19:10] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2024-05-29 08:19:10] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
[2024-05-29 08:19:10] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2024-05-29 08:19:11] [INFO ] Deduced a trap composed of 20 places in 94 ms of which 3 ms to minimize.
[2024-05-29 08:19:11] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 2 ms to minimize.
[2024-05-29 08:19:11] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-05-29 08:19:11] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 0 ms to minimize.
[2024-05-29 08:19:11] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-29 08:19:11] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
[2024-05-29 08:19:11] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/612 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-05-29 08:19:13] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-29 08:19:14] [INFO ] Deduced a trap composed of 37 places in 57 ms of which 1 ms to minimize.
[2024-05-29 08:19:14] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-05-29 08:19:14] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 1 ms to minimize.
[2024-05-29 08:19:14] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-29 08:19:14] [INFO ] Deduced a trap composed of 46 places in 61 ms of which 2 ms to minimize.
[2024-05-29 08:19:14] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-05-29 08:19:14] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-05-29 08:19:15] [INFO ] Deduced a trap composed of 49 places in 71 ms of which 1 ms to minimize.
[2024-05-29 08:19:15] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 1 ms to minimize.
[2024-05-29 08:19:15] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 2 ms to minimize.
[2024-05-29 08:19:15] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-05-29 08:19:15] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 0 ms to minimize.
[2024-05-29 08:19:15] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 0 ms to minimize.
[2024-05-29 08:19:15] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 1 ms to minimize.
[2024-05-29 08:19:15] [INFO ] Deduced a trap composed of 42 places in 71 ms of which 2 ms to minimize.
[2024-05-29 08:19:15] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 1 ms to minimize.
[2024-05-29 08:19:16] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 0 ms to minimize.
[2024-05-29 08:19:16] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-05-29 08:19:16] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/612 variables, 20/191 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 612/1174 variables, and 191 constraints, problems are : Problem set: 0 solved, 561 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/612 constraints, PredecessorRefiner: 561/561 constraints, Known Traps: 80/80 constraints]
Escalating to Integer solving :Problem set: 0 solved, 561 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/611 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (OVERLAPS) 1/612 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/612 variables, 80/191 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-05-29 08:19:23] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-29 08:19:24] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-29 08:19:24] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 2 ms to minimize.
[2024-05-29 08:19:24] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-05-29 08:19:24] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-29 08:19:24] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-05-29 08:19:24] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-29 08:19:24] [INFO ] Deduced a trap composed of 48 places in 46 ms of which 1 ms to minimize.
[2024-05-29 08:19:24] [INFO ] Deduced a trap composed of 49 places in 115 ms of which 3 ms to minimize.
[2024-05-29 08:19:25] [INFO ] Deduced a trap composed of 22 places in 113 ms of which 3 ms to minimize.
[2024-05-29 08:19:25] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-05-29 08:19:25] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-05-29 08:19:25] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 0 ms to minimize.
[2024-05-29 08:19:25] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-05-29 08:19:25] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-29 08:19:26] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 2 ms to minimize.
[2024-05-29 08:19:26] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2024-05-29 08:19:26] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
[2024-05-29 08:19:26] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 1 ms to minimize.
[2024-05-29 08:19:26] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/612 variables, 20/211 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-05-29 08:19:27] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-29 08:19:28] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-05-29 08:19:28] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-05-29 08:19:28] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
[2024-05-29 08:19:28] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-05-29 08:19:28] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 0 ms to minimize.
[2024-05-29 08:19:29] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-05-29 08:19:29] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
[2024-05-29 08:19:30] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-05-29 08:19:30] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 2 ms to minimize.
[2024-05-29 08:19:30] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
[2024-05-29 08:19:30] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
[2024-05-29 08:19:30] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-05-29 08:19:30] [INFO ] Deduced a trap composed of 29 places in 27 ms of which 1 ms to minimize.
[2024-05-29 08:19:30] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
[2024-05-29 08:19:30] [INFO ] Deduced a trap composed of 26 places in 24 ms of which 1 ms to minimize.
[2024-05-29 08:19:30] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-05-29 08:19:30] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-29 08:19:30] [INFO ] Deduced a trap composed of 44 places in 38 ms of which 1 ms to minimize.
[2024-05-29 08:19:30] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/612 variables, 20/231 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-05-29 08:19:33] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
[2024-05-29 08:19:33] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-29 08:19:33] [INFO ] Deduced a trap composed of 41 places in 63 ms of which 1 ms to minimize.
[2024-05-29 08:19:33] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 2 ms to minimize.
[2024-05-29 08:19:33] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-29 08:19:33] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-05-29 08:19:33] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
[2024-05-29 08:19:34] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-29 08:19:34] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
[2024-05-29 08:19:35] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 0 ms to minimize.
[2024-05-29 08:19:35] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
[2024-05-29 08:19:35] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-29 08:19:35] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-05-29 08:19:35] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-05-29 08:19:35] [INFO ] Deduced a trap composed of 34 places in 26 ms of which 0 ms to minimize.
[2024-05-29 08:19:35] [INFO ] Deduced a trap composed of 30 places in 27 ms of which 0 ms to minimize.
[2024-05-29 08:19:35] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 1 ms to minimize.
[2024-05-29 08:19:35] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
[2024-05-29 08:19:35] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-05-29 08:19:35] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/612 variables, 20/251 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-05-29 08:19:37] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-29 08:19:37] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 1 ms to minimize.
[2024-05-29 08:19:37] [INFO ] Deduced a trap composed of 27 places in 22 ms of which 0 ms to minimize.
[2024-05-29 08:19:37] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-05-29 08:19:37] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-05-29 08:19:38] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 0 ms to minimize.
[2024-05-29 08:19:38] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 0 ms to minimize.
[2024-05-29 08:19:38] [INFO ] Deduced a trap composed of 33 places in 126 ms of which 3 ms to minimize.
[2024-05-29 08:19:38] [INFO ] Deduced a trap composed of 34 places in 114 ms of which 3 ms to minimize.
[2024-05-29 08:19:38] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
[2024-05-29 08:19:38] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
[2024-05-29 08:19:38] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 0 ms to minimize.
[2024-05-29 08:19:39] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-29 08:19:39] [INFO ] Deduced a trap composed of 47 places in 57 ms of which 1 ms to minimize.
[2024-05-29 08:19:39] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-29 08:19:39] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-05-29 08:19:39] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-29 08:19:40] [INFO ] Deduced a trap composed of 56 places in 72 ms of which 2 ms to minimize.
[2024-05-29 08:19:41] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-05-29 08:19:41] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/612 variables, 20/271 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-05-29 08:19:43] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-29 08:19:43] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-05-29 08:19:43] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-29 08:19:43] [INFO ] Deduced a trap composed of 43 places in 43 ms of which 1 ms to minimize.
[2024-05-29 08:19:43] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-29 08:19:43] [INFO ] Deduced a trap composed of 50 places in 49 ms of which 0 ms to minimize.
[2024-05-29 08:19:44] [INFO ] Deduced a trap composed of 49 places in 56 ms of which 1 ms to minimize.
[2024-05-29 08:19:44] [INFO ] Deduced a trap composed of 49 places in 62 ms of which 1 ms to minimize.
[2024-05-29 08:19:44] [INFO ] Deduced a trap composed of 50 places in 67 ms of which 1 ms to minimize.
[2024-05-29 08:19:44] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-05-29 08:19:45] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 2 ms to minimize.
[2024-05-29 08:19:45] [INFO ] Deduced a trap composed of 36 places in 76 ms of which 2 ms to minimize.
[2024-05-29 08:19:46] [INFO ] Deduced a trap composed of 47 places in 92 ms of which 2 ms to minimize.
[2024-05-29 08:19:46] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 0 ms to minimize.
[2024-05-29 08:19:46] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 0 ms to minimize.
[2024-05-29 08:19:46] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 2 ms to minimize.
[2024-05-29 08:19:46] [INFO ] Deduced a trap composed of 70 places in 66 ms of which 2 ms to minimize.
[2024-05-29 08:19:46] [INFO ] Deduced a trap composed of 61 places in 72 ms of which 1 ms to minimize.
[2024-05-29 08:19:47] [INFO ] Deduced a trap composed of 55 places in 55 ms of which 1 ms to minimize.
[2024-05-29 08:19:47] [INFO ] Deduced a trap composed of 50 places in 47 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/612 variables, 20/291 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 1)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 1)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 1)
(s29 0)
(s30 1)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 1)
(s36 0)
(s37 1)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 1)
(s43 0)
(s44 1)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 1)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 1)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 1)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 1)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 1)
(s82 0)
(s83 0)
(s84 1)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 1)
(s95 0)
(s96 1)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 1)
(s102 0)
(s103 1)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 1)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 1)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 1)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 1)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 1)
(s142 0)
(s143 0)
(s144 1)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 1)
(s155 0)
(s156 1)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 1)
(s162 0)
(s163 1)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 1)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 1)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 1)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 612/1174 variables, and 291 constraints, problems are : Problem set: 0 solved, 561 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/612 constraints, PredecessorRefiner: 0/561 constraints, Known Traps: 180/180 constraints]
After SMT, in 60085ms problems are : Problem set: 0 solved, 561 unsolved
Search for dead transitions found 0 dead transitions in 60089ms
Starting structural reductions in LTL mode, iteration 1 : 612/618 places, 562/568 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60668 ms. Remains : 612/618 places, 562/568 transitions.
Stuttering acceptance computed with spot in 237 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-010B-LTLFireability-13
Entered a terminal (fully accepting) state of product in 169 steps with 0 reset in 2 ms.
FORMULA ShieldPPPs-PT-010B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-010B-LTLFireability-13 finished in 60925 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 618 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 618/618 places, 568/568 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 617 transition count 496
Reduce places removed 71 places and 0 transitions.
Iterating post reduction 1 with 71 rules applied. Total rules applied 142 place count 546 transition count 496
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 142 place count 546 transition count 446
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 242 place count 496 transition count 446
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 248 place count 490 transition count 440
Iterating global reduction 2 with 6 rules applied. Total rules applied 254 place count 490 transition count 440
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 254 place count 490 transition count 435
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 264 place count 485 transition count 435
Performed 171 Post agglomeration using F-continuation condition.Transition count delta: 171
Deduced a syphon composed of 171 places in 0 ms
Reduce places removed 171 places and 0 transitions.
Iterating global reduction 2 with 342 rules applied. Total rules applied 606 place count 314 transition count 264
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 608 place count 312 transition count 262
Applied a total of 608 rules in 60 ms. Remains 312 /618 variables (removed 306) and now considering 262/568 (removed 306) transitions.
// Phase 1: matrix 262 rows 312 cols
[2024-05-29 08:19:47] [INFO ] Computed 111 invariants in 0 ms
[2024-05-29 08:19:47] [INFO ] Implicit Places using invariants in 330 ms returned []
[2024-05-29 08:19:47] [INFO ] Invariant cache hit.
[2024-05-29 08:19:48] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 547 ms to find 0 implicit places.
[2024-05-29 08:19:48] [INFO ] Redundant transitions in 1 ms returned []
Running 259 sub problems to find dead transitions.
[2024-05-29 08:19:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 110/110 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:19:50] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-29 08:19:50] [INFO ] Deduced a trap composed of 28 places in 22 ms of which 0 ms to minimize.
[2024-05-29 08:19:50] [INFO ] Deduced a trap composed of 42 places in 26 ms of which 0 ms to minimize.
[2024-05-29 08:19:50] [INFO ] Deduced a trap composed of 56 places in 40 ms of which 1 ms to minimize.
[2024-05-29 08:19:50] [INFO ] Deduced a trap composed of 73 places in 40 ms of which 1 ms to minimize.
[2024-05-29 08:19:50] [INFO ] Deduced a trap composed of 85 places in 45 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 6/116 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (OVERLAPS) 1/312 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:19:54] [INFO ] Deduced a trap composed of 42 places in 33 ms of which 0 ms to minimize.
[2024-05-29 08:19:54] [INFO ] Deduced a trap composed of 41 places in 28 ms of which 1 ms to minimize.
[2024-05-29 08:19:55] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-05-29 08:19:55] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 1 ms to minimize.
[2024-05-29 08:19:55] [INFO ] Deduced a trap composed of 54 places in 53 ms of which 1 ms to minimize.
[2024-05-29 08:19:55] [INFO ] Deduced a trap composed of 69 places in 66 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 6/123 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (OVERLAPS) 262/574 variables, 312/435 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/574 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:19:59] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/574 variables, 1/436 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:20:01] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-29 08:20:02] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/574 variables, 2/438 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:20:05] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
[2024-05-29 08:20:06] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/574 variables, 2/440 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/574 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:20:09] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/574 variables, 1/441 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/574 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 14 (OVERLAPS) 0/574 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 259 unsolved
No progress, stopping.
After SMT solving in domain Real declared 574/574 variables, and 441 constraints, problems are : Problem set: 0 solved, 259 unsolved in 29042 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 259 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 110/110 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 14/124 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (OVERLAPS) 1/312 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 4/129 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (OVERLAPS) 262/574 variables, 312/441 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/574 variables, 259/700 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/574 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:20:41] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-29 08:20:47] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 574/574 variables, and 702 constraints, problems are : Problem set: 0 solved, 259 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 20/20 constraints]
After SMT, in 59083ms problems are : Problem set: 0 solved, 259 unsolved
Search for dead transitions found 0 dead transitions in 59085ms
Starting structural reductions in SI_LTL mode, iteration 1 : 312/618 places, 262/568 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 59697 ms. Remains : 312/618 places, 262/568 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-010B-LTLFireability-14
Stuttering criterion allowed to conclude after 43088 steps with 174 reset in 153 ms.
FORMULA ShieldPPPs-PT-010B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-010B-LTLFireability-14 finished in 59899 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(!X((F(p0)||p1))) U p1))'
Support contains 3 out of 618 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 618/618 places, 568/568 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 612 transition count 562
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 612 transition count 562
Applied a total of 12 rules in 19 ms. Remains 612 /618 variables (removed 6) and now considering 562/568 (removed 6) transitions.
// Phase 1: matrix 562 rows 612 cols
[2024-05-29 08:20:47] [INFO ] Computed 111 invariants in 3 ms
[2024-05-29 08:20:47] [INFO ] Implicit Places using invariants in 181 ms returned []
[2024-05-29 08:20:47] [INFO ] Invariant cache hit.
[2024-05-29 08:20:48] [INFO ] Implicit Places using invariants and state equation in 406 ms returned []
Implicit Place search using SMT with State Equation took 595 ms to find 0 implicit places.
Running 561 sub problems to find dead transitions.
[2024-05-29 08:20:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/611 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (OVERLAPS) 1/612 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-05-29 08:20:58] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2024-05-29 08:20:58] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 0 ms to minimize.
[2024-05-29 08:20:58] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-29 08:20:58] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-05-29 08:20:59] [INFO ] Deduced a trap composed of 18 places in 176 ms of which 3 ms to minimize.
[2024-05-29 08:20:59] [INFO ] Deduced a trap composed of 20 places in 164 ms of which 4 ms to minimize.
[2024-05-29 08:20:59] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-29 08:20:59] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-29 08:20:59] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-29 08:20:59] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-29 08:20:59] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2024-05-29 08:20:59] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-05-29 08:20:59] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-29 08:21:00] [INFO ] Deduced a trap composed of 23 places in 158 ms of which 4 ms to minimize.
[2024-05-29 08:21:00] [INFO ] Deduced a trap composed of 21 places in 143 ms of which 3 ms to minimize.
[2024-05-29 08:21:00] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-29 08:21:00] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 0 ms to minimize.
[2024-05-29 08:21:00] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
[2024-05-29 08:21:00] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-05-29 08:21:00] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/612 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-05-29 08:21:02] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-29 08:21:02] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 1 ms to minimize.
[2024-05-29 08:21:02] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-29 08:21:02] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 0 ms to minimize.
[2024-05-29 08:21:02] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 0 ms to minimize.
[2024-05-29 08:21:02] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
[2024-05-29 08:21:02] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2024-05-29 08:21:03] [INFO ] Deduced a trap composed of 18 places in 149 ms of which 4 ms to minimize.
[2024-05-29 08:21:03] [INFO ] Deduced a trap composed of 26 places in 148 ms of which 3 ms to minimize.
[2024-05-29 08:21:03] [INFO ] Deduced a trap composed of 27 places in 129 ms of which 3 ms to minimize.
[2024-05-29 08:21:03] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-29 08:21:03] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-29 08:21:03] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-29 08:21:03] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-29 08:21:03] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-29 08:21:03] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-05-29 08:21:04] [INFO ] Deduced a trap composed of 21 places in 143 ms of which 3 ms to minimize.
[2024-05-29 08:21:04] [INFO ] Deduced a trap composed of 29 places in 131 ms of which 3 ms to minimize.
[2024-05-29 08:21:04] [INFO ] Deduced a trap composed of 43 places in 116 ms of which 3 ms to minimize.
[2024-05-29 08:21:04] [INFO ] Deduced a trap composed of 22 places in 114 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/612 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-05-29 08:21:10] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-05-29 08:21:10] [INFO ] Deduced a trap composed of 17 places in 17 ms of which 1 ms to minimize.
[2024-05-29 08:21:10] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-29 08:21:11] [INFO ] Deduced a trap composed of 20 places in 167 ms of which 4 ms to minimize.
[2024-05-29 08:21:11] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-29 08:21:11] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-05-29 08:21:12] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-29 08:21:12] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-05-29 08:21:12] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 0 ms to minimize.
[2024-05-29 08:21:12] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-29 08:21:12] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-05-29 08:21:12] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2024-05-29 08:21:12] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
[2024-05-29 08:21:12] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 2 ms to minimize.
[2024-05-29 08:21:12] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 1 ms to minimize.
[2024-05-29 08:21:12] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-05-29 08:21:12] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 0 ms to minimize.
[2024-05-29 08:21:13] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-29 08:21:13] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-05-29 08:21:13] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/612 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-05-29 08:21:14] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
[2024-05-29 08:21:15] [INFO ] Deduced a trap composed of 37 places in 51 ms of which 1 ms to minimize.
[2024-05-29 08:21:16] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 0 ms to minimize.
[2024-05-29 08:21:16] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 1 ms to minimize.
[2024-05-29 08:21:16] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-29 08:21:16] [INFO ] Deduced a trap composed of 46 places in 57 ms of which 1 ms to minimize.
[2024-05-29 08:21:16] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-05-29 08:21:16] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-29 08:21:16] [INFO ] Deduced a trap composed of 49 places in 72 ms of which 1 ms to minimize.
[2024-05-29 08:21:16] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 2 ms to minimize.
[2024-05-29 08:21:16] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 2 ms to minimize.
[2024-05-29 08:21:16] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-05-29 08:21:17] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
[2024-05-29 08:21:17] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-29 08:21:17] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 1 ms to minimize.
[2024-05-29 08:21:17] [INFO ] Deduced a trap composed of 42 places in 70 ms of which 2 ms to minimize.
[2024-05-29 08:21:17] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 2 ms to minimize.
[2024-05-29 08:21:17] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-05-29 08:21:17] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 0 ms to minimize.
[2024-05-29 08:21:17] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/612 variables, 20/191 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 612/1174 variables, and 191 constraints, problems are : Problem set: 0 solved, 561 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/612 constraints, PredecessorRefiner: 561/561 constraints, Known Traps: 80/80 constraints]
Escalating to Integer solving :Problem set: 0 solved, 561 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/611 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (OVERLAPS) 1/612 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/612 variables, 80/191 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-05-29 08:21:25] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2024-05-29 08:21:25] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-29 08:21:25] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
[2024-05-29 08:21:25] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2024-05-29 08:21:25] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
[2024-05-29 08:21:25] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-29 08:21:25] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-29 08:21:25] [INFO ] Deduced a trap composed of 48 places in 49 ms of which 1 ms to minimize.
[2024-05-29 08:21:25] [INFO ] Deduced a trap composed of 49 places in 114 ms of which 2 ms to minimize.
[2024-05-29 08:21:26] [INFO ] Deduced a trap composed of 22 places in 109 ms of which 2 ms to minimize.
[2024-05-29 08:21:26] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-29 08:21:26] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-05-29 08:21:26] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 0 ms to minimize.
[2024-05-29 08:21:26] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-29 08:21:26] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-29 08:21:27] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 1 ms to minimize.
[2024-05-29 08:21:27] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 0 ms to minimize.
[2024-05-29 08:21:27] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-05-29 08:21:27] [INFO ] Deduced a trap composed of 28 places in 27 ms of which 0 ms to minimize.
[2024-05-29 08:21:27] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/612 variables, 20/211 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-05-29 08:21:28] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-29 08:21:29] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-05-29 08:21:29] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-29 08:21:29] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-29 08:21:29] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 0 ms to minimize.
[2024-05-29 08:21:29] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-05-29 08:21:30] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-29 08:21:30] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 1 ms to minimize.
[2024-05-29 08:21:31] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-05-29 08:21:31] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
[2024-05-29 08:21:31] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 0 ms to minimize.
[2024-05-29 08:21:31] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
[2024-05-29 08:21:31] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-05-29 08:21:31] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 1 ms to minimize.
[2024-05-29 08:21:31] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
[2024-05-29 08:21:31] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 1 ms to minimize.
[2024-05-29 08:21:31] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-29 08:21:31] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-29 08:21:31] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 1 ms to minimize.
[2024-05-29 08:21:31] [INFO ] Deduced a trap composed of 43 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/612 variables, 20/231 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-05-29 08:21:34] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2024-05-29 08:21:34] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-29 08:21:34] [INFO ] Deduced a trap composed of 41 places in 61 ms of which 1 ms to minimize.
[2024-05-29 08:21:34] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 1 ms to minimize.
[2024-05-29 08:21:34] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-05-29 08:21:34] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-05-29 08:21:34] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
[2024-05-29 08:21:35] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-05-29 08:21:36] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2024-05-29 08:21:36] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-29 08:21:36] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-05-29 08:21:36] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-05-29 08:21:36] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 1 ms to minimize.
[2024-05-29 08:21:36] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2024-05-29 08:21:36] [INFO ] Deduced a trap composed of 34 places in 27 ms of which 1 ms to minimize.
[2024-05-29 08:21:36] [INFO ] Deduced a trap composed of 30 places in 26 ms of which 1 ms to minimize.
[2024-05-29 08:21:36] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-05-29 08:21:36] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 0 ms to minimize.
[2024-05-29 08:21:36] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-05-29 08:21:37] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/612 variables, 20/251 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-05-29 08:21:39] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-29 08:21:39] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 0 ms to minimize.
[2024-05-29 08:21:39] [INFO ] Deduced a trap composed of 27 places in 26 ms of which 1 ms to minimize.
[2024-05-29 08:21:39] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-29 08:21:39] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 0 ms to minimize.
[2024-05-29 08:21:39] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-05-29 08:21:39] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2024-05-29 08:21:39] [INFO ] Deduced a trap composed of 33 places in 129 ms of which 3 ms to minimize.
[2024-05-29 08:21:40] [INFO ] Deduced a trap composed of 34 places in 112 ms of which 3 ms to minimize.
[2024-05-29 08:21:40] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 1 ms to minimize.
[2024-05-29 08:21:40] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
[2024-05-29 08:21:40] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 0 ms to minimize.
[2024-05-29 08:21:40] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-29 08:21:40] [INFO ] Deduced a trap composed of 47 places in 58 ms of which 2 ms to minimize.
[2024-05-29 08:21:41] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 0 ms to minimize.
[2024-05-29 08:21:41] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-29 08:21:41] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-29 08:21:41] [INFO ] Deduced a trap composed of 56 places in 72 ms of which 2 ms to minimize.
[2024-05-29 08:21:42] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-05-29 08:21:42] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/612 variables, 20/271 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-05-29 08:21:44] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-29 08:21:44] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-29 08:21:44] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-29 08:21:44] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 1 ms to minimize.
[2024-05-29 08:21:44] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2024-05-29 08:21:44] [INFO ] Deduced a trap composed of 50 places in 48 ms of which 1 ms to minimize.
[2024-05-29 08:21:45] [INFO ] Deduced a trap composed of 49 places in 57 ms of which 1 ms to minimize.
[2024-05-29 08:21:45] [INFO ] Deduced a trap composed of 49 places in 58 ms of which 1 ms to minimize.
[2024-05-29 08:21:46] [INFO ] Deduced a trap composed of 50 places in 65 ms of which 2 ms to minimize.
[2024-05-29 08:21:46] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-05-29 08:21:46] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 1 ms to minimize.
[2024-05-29 08:21:46] [INFO ] Deduced a trap composed of 36 places in 75 ms of which 1 ms to minimize.
[2024-05-29 08:21:47] [INFO ] Deduced a trap composed of 47 places in 95 ms of which 2 ms to minimize.
[2024-05-29 08:21:47] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-05-29 08:21:48] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 0 ms to minimize.
[2024-05-29 08:21:48] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 3 ms to minimize.
SMT process timed out in 60088ms, After SMT, problems are : Problem set: 0 solved, 561 unsolved
Search for dead transitions found 0 dead transitions in 60093ms
Starting structural reductions in LTL mode, iteration 1 : 612/618 places, 562/568 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60708 ms. Remains : 612/618 places, 562/568 transitions.
Stuttering acceptance computed with spot in 145 ms :[(NOT p1), true, p0, (OR p1 p0), true]
Running random walk in product with property : ShieldPPPs-PT-010B-LTLFireability-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPs-PT-010B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-010B-LTLFireability-15 finished in 60873 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)))'
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)))'
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))'
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||X(F(p1)))))'
Found a Shortening insensitive property : ShieldPPPs-PT-010B-LTLFireability-10
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 618 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 618/618 places, 568/568 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 72 place count 617 transition count 495
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 144 place count 545 transition count 495
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 144 place count 545 transition count 445
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 244 place count 495 transition count 445
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 249 place count 490 transition count 440
Iterating global reduction 2 with 5 rules applied. Total rules applied 254 place count 490 transition count 440
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 254 place count 490 transition count 436
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 262 place count 486 transition count 436
Performed 173 Post agglomeration using F-continuation condition.Transition count delta: 173
Deduced a syphon composed of 173 places in 0 ms
Reduce places removed 173 places and 0 transitions.
Iterating global reduction 2 with 346 rules applied. Total rules applied 608 place count 313 transition count 263
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 610 place count 311 transition count 261
Applied a total of 610 rules in 36 ms. Remains 311 /618 variables (removed 307) and now considering 261/568 (removed 307) transitions.
// Phase 1: matrix 261 rows 311 cols
[2024-05-29 08:21:48] [INFO ] Computed 111 invariants in 0 ms
[2024-05-29 08:21:48] [INFO ] Implicit Places using invariants in 158 ms returned []
[2024-05-29 08:21:48] [INFO ] Invariant cache hit.
[2024-05-29 08:21:49] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
Running 259 sub problems to find dead transitions.
[2024-05-29 08:21:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:21:51] [INFO ] Deduced a trap composed of 13 places in 18 ms of which 1 ms to minimize.
[2024-05-29 08:21:51] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 1 ms to minimize.
[2024-05-29 08:21:51] [INFO ] Deduced a trap composed of 42 places in 32 ms of which 1 ms to minimize.
[2024-05-29 08:21:51] [INFO ] Deduced a trap composed of 56 places in 35 ms of which 1 ms to minimize.
[2024-05-29 08:21:51] [INFO ] Deduced a trap composed of 73 places in 40 ms of which 0 ms to minimize.
[2024-05-29 08:21:51] [INFO ] Deduced a trap composed of 86 places in 41 ms of which 1 ms to minimize.
[2024-05-29 08:21:51] [INFO ] Deduced a trap composed of 104 places in 50 ms of which 1 ms to minimize.
[2024-05-29 08:21:52] [INFO ] Deduced a trap composed of 116 places in 47 ms of which 1 ms to minimize.
[2024-05-29 08:21:52] [INFO ] Deduced a trap composed of 129 places in 56 ms of which 2 ms to minimize.
[2024-05-29 08:21:52] [INFO ] Deduced a trap composed of 148 places in 62 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 10/121 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:21:53] [INFO ] Deduced a trap composed of 102 places in 49 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:21:54] [INFO ] Deduced a trap composed of 42 places in 32 ms of which 1 ms to minimize.
[2024-05-29 08:21:54] [INFO ] Deduced a trap composed of 41 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:21:57] [INFO ] Deduced a trap composed of 102 places in 49 ms of which 1 ms to minimize.
[2024-05-29 08:21:57] [INFO ] Deduced a trap composed of 102 places in 48 ms of which 1 ms to minimize.
[2024-05-29 08:21:57] [INFO ] Deduced a trap composed of 101 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 3/127 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (OVERLAPS) 261/572 variables, 311/438 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 8 (OVERLAPS) 0/572 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 259 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 438 constraints, problems are : Problem set: 0 solved, 259 unsolved in 14858 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 259 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 16/127 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:22:05] [INFO ] Deduced a trap composed of 102 places in 53 ms of which 1 ms to minimize.
[2024-05-29 08:22:05] [INFO ] Deduced a trap composed of 102 places in 43 ms of which 1 ms to minimize.
[2024-05-29 08:22:05] [INFO ] Deduced a trap composed of 103 places in 40 ms of which 1 ms to minimize.
[2024-05-29 08:22:05] [INFO ] Deduced a trap composed of 103 places in 40 ms of which 1 ms to minimize.
[2024-05-29 08:22:05] [INFO ] Deduced a trap composed of 102 places in 51 ms of which 0 ms to minimize.
[2024-05-29 08:22:05] [INFO ] Deduced a trap composed of 101 places in 41 ms of which 1 ms to minimize.
[2024-05-29 08:22:05] [INFO ] Deduced a trap composed of 100 places in 41 ms of which 1 ms to minimize.
[2024-05-29 08:22:05] [INFO ] Deduced a trap composed of 100 places in 39 ms of which 0 ms to minimize.
[2024-05-29 08:22:05] [INFO ] Deduced a trap composed of 101 places in 40 ms of which 1 ms to minimize.
[2024-05-29 08:22:05] [INFO ] Deduced a trap composed of 103 places in 41 ms of which 1 ms to minimize.
[2024-05-29 08:22:05] [INFO ] Deduced a trap composed of 99 places in 42 ms of which 1 ms to minimize.
[2024-05-29 08:22:06] [INFO ] Deduced a trap composed of 117 places in 50 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 12/139 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (OVERLAPS) 261/572 variables, 311/450 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/572 variables, 259/709 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 709 constraints, problems are : Problem set: 0 solved, 259 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 28/28 constraints]
After SMT, in 44890ms problems are : Problem set: 0 solved, 259 unsolved
Search for dead transitions found 0 dead transitions in 44892ms
Starting structural reductions in LI_LTL mode, iteration 1 : 311/618 places, 261/568 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 45309 ms. Remains : 311/618 places, 261/568 transitions.
Running random walk in product with property : ShieldPPPs-PT-010B-LTLFireability-10
Product exploration explored 100000 steps with 1232 reset in 294 ms.
Product exploration explored 100000 steps with 1193 reset in 345 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 85 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 3567 steps (4 resets) in 30 ms. (115 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) p1))), (F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 328 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 170 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-29 08:22:35] [INFO ] Invariant cache hit.
[2024-05-29 08:22:35] [INFO ] [Real]Absence check using 111 positive place invariants in 24 ms returned sat
[2024-05-29 08:22:36] [INFO ] [Real]Absence check using state equation in 208 ms returned sat
[2024-05-29 08:22:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 08:22:36] [INFO ] [Nat]Absence check using 111 positive place invariants in 23 ms returned sat
[2024-05-29 08:22:36] [INFO ] [Nat]Absence check using state equation in 199 ms returned sat
[2024-05-29 08:22:36] [INFO ] Computed and/alt/rep : 259/494/259 causal constraints (skipped 0 transitions) in 18 ms.
[2024-05-29 08:22:37] [INFO ] Added : 216 causal constraints over 44 iterations in 1428 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 2 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 261/261 transitions.
Applied a total of 0 rules in 7 ms. Remains 311 /311 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2024-05-29 08:22:37] [INFO ] Invariant cache hit.
[2024-05-29 08:22:37] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-29 08:22:37] [INFO ] Invariant cache hit.
[2024-05-29 08:22:38] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
[2024-05-29 08:22:38] [INFO ] Redundant transitions in 1 ms returned []
Running 259 sub problems to find dead transitions.
[2024-05-29 08:22:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:22:40] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 0 ms to minimize.
[2024-05-29 08:22:40] [INFO ] Deduced a trap composed of 28 places in 26 ms of which 1 ms to minimize.
[2024-05-29 08:22:40] [INFO ] Deduced a trap composed of 42 places in 32 ms of which 1 ms to minimize.
[2024-05-29 08:22:40] [INFO ] Deduced a trap composed of 56 places in 31 ms of which 1 ms to minimize.
[2024-05-29 08:22:40] [INFO ] Deduced a trap composed of 73 places in 40 ms of which 1 ms to minimize.
[2024-05-29 08:22:40] [INFO ] Deduced a trap composed of 86 places in 45 ms of which 1 ms to minimize.
[2024-05-29 08:22:41] [INFO ] Deduced a trap composed of 104 places in 45 ms of which 1 ms to minimize.
[2024-05-29 08:22:41] [INFO ] Deduced a trap composed of 116 places in 55 ms of which 1 ms to minimize.
[2024-05-29 08:22:41] [INFO ] Deduced a trap composed of 129 places in 66 ms of which 1 ms to minimize.
[2024-05-29 08:22:41] [INFO ] Deduced a trap composed of 148 places in 65 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 10/121 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:22:42] [INFO ] Deduced a trap composed of 102 places in 43 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:22:44] [INFO ] Deduced a trap composed of 42 places in 27 ms of which 1 ms to minimize.
[2024-05-29 08:22:44] [INFO ] Deduced a trap composed of 41 places in 32 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:22:46] [INFO ] Deduced a trap composed of 102 places in 52 ms of which 1 ms to minimize.
[2024-05-29 08:22:46] [INFO ] Deduced a trap composed of 102 places in 44 ms of which 1 ms to minimize.
[2024-05-29 08:22:47] [INFO ] Deduced a trap composed of 101 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 3/127 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (OVERLAPS) 261/572 variables, 311/438 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 8 (OVERLAPS) 0/572 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 259 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 438 constraints, problems are : Problem set: 0 solved, 259 unsolved in 14856 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 259 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 16/127 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:22:54] [INFO ] Deduced a trap composed of 102 places in 44 ms of which 1 ms to minimize.
[2024-05-29 08:22:54] [INFO ] Deduced a trap composed of 102 places in 42 ms of which 1 ms to minimize.
[2024-05-29 08:22:54] [INFO ] Deduced a trap composed of 103 places in 41 ms of which 1 ms to minimize.
[2024-05-29 08:22:54] [INFO ] Deduced a trap composed of 103 places in 42 ms of which 1 ms to minimize.
[2024-05-29 08:22:54] [INFO ] Deduced a trap composed of 102 places in 38 ms of which 1 ms to minimize.
[2024-05-29 08:22:54] [INFO ] Deduced a trap composed of 101 places in 40 ms of which 1 ms to minimize.
[2024-05-29 08:22:54] [INFO ] Deduced a trap composed of 100 places in 39 ms of which 1 ms to minimize.
[2024-05-29 08:22:54] [INFO ] Deduced a trap composed of 100 places in 41 ms of which 1 ms to minimize.
[2024-05-29 08:22:54] [INFO ] Deduced a trap composed of 101 places in 40 ms of which 1 ms to minimize.
[2024-05-29 08:22:54] [INFO ] Deduced a trap composed of 103 places in 42 ms of which 1 ms to minimize.
[2024-05-29 08:22:54] [INFO ] Deduced a trap composed of 99 places in 39 ms of which 1 ms to minimize.
[2024-05-29 08:22:55] [INFO ] Deduced a trap composed of 117 places in 49 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 12/139 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (OVERLAPS) 261/572 variables, 311/450 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/572 variables, 259/709 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 709 constraints, problems are : Problem set: 0 solved, 259 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 28/28 constraints]
After SMT, in 44898ms problems are : Problem set: 0 solved, 259 unsolved
Search for dead transitions found 0 dead transitions in 44900ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 45252 ms. Remains : 311/311 places, 261/261 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 136 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 161 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 821 steps (0 resets) in 18 ms. (43 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) p1))), (F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 13 factoid took 329 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 162 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-29 08:23:24] [INFO ] Invariant cache hit.
[2024-05-29 08:23:24] [INFO ] [Real]Absence check using 111 positive place invariants in 23 ms returned sat
[2024-05-29 08:23:24] [INFO ] [Real]Absence check using state equation in 208 ms returned sat
[2024-05-29 08:23:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 08:23:24] [INFO ] [Nat]Absence check using 111 positive place invariants in 22 ms returned sat
[2024-05-29 08:23:24] [INFO ] [Nat]Absence check using state equation in 199 ms returned sat
[2024-05-29 08:23:24] [INFO ] Computed and/alt/rep : 259/494/259 causal constraints (skipped 0 transitions) in 13 ms.
[2024-05-29 08:23:26] [INFO ] Added : 216 causal constraints over 44 iterations in 1394 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1204 reset in 302 ms.
Product exploration explored 100000 steps with 1206 reset in 340 ms.
Built C files in :
/tmp/ltsmin15293129932240415115
[2024-05-29 08:23:26] [INFO ] Computing symmetric may disable matrix : 261 transitions.
[2024-05-29 08:23:26] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 08:23:26] [INFO ] Computing symmetric may enable matrix : 261 transitions.
[2024-05-29 08:23:27] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 08:23:27] [INFO ] Computing Do-Not-Accords matrix : 261 transitions.
[2024-05-29 08:23:27] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 08:23:27] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15293129932240415115
Running compilation step : cd /tmp/ltsmin15293129932240415115;'/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'
Compilation finished in 597 ms.
Running link step : cd /tmp/ltsmin15293129932240415115;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin15293129932240415115;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12888730343062211690.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 261/261 transitions.
Applied a total of 0 rules in 9 ms. Remains 311 /311 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2024-05-29 08:23:42] [INFO ] Invariant cache hit.
[2024-05-29 08:23:42] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-29 08:23:42] [INFO ] Invariant cache hit.
[2024-05-29 08:23:42] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 354 ms to find 0 implicit places.
[2024-05-29 08:23:42] [INFO ] Redundant transitions in 1 ms returned []
Running 259 sub problems to find dead transitions.
[2024-05-29 08:23:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:23:44] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-29 08:23:44] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 0 ms to minimize.
[2024-05-29 08:23:44] [INFO ] Deduced a trap composed of 42 places in 32 ms of which 0 ms to minimize.
[2024-05-29 08:23:44] [INFO ] Deduced a trap composed of 56 places in 40 ms of which 0 ms to minimize.
[2024-05-29 08:23:45] [INFO ] Deduced a trap composed of 73 places in 36 ms of which 1 ms to minimize.
[2024-05-29 08:23:45] [INFO ] Deduced a trap composed of 86 places in 47 ms of which 1 ms to minimize.
[2024-05-29 08:23:45] [INFO ] Deduced a trap composed of 104 places in 46 ms of which 1 ms to minimize.
[2024-05-29 08:23:45] [INFO ] Deduced a trap composed of 116 places in 50 ms of which 1 ms to minimize.
[2024-05-29 08:23:45] [INFO ] Deduced a trap composed of 129 places in 59 ms of which 1 ms to minimize.
[2024-05-29 08:23:45] [INFO ] Deduced a trap composed of 148 places in 60 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 10/121 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:23:46] [INFO ] Deduced a trap composed of 102 places in 55 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:23:48] [INFO ] Deduced a trap composed of 42 places in 37 ms of which 1 ms to minimize.
[2024-05-29 08:23:48] [INFO ] Deduced a trap composed of 41 places in 31 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:23:51] [INFO ] Deduced a trap composed of 102 places in 50 ms of which 1 ms to minimize.
[2024-05-29 08:23:51] [INFO ] Deduced a trap composed of 102 places in 44 ms of which 1 ms to minimize.
[2024-05-29 08:23:51] [INFO ] Deduced a trap composed of 101 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 3/127 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (OVERLAPS) 261/572 variables, 311/438 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 8 (OVERLAPS) 0/572 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 259 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 438 constraints, problems are : Problem set: 0 solved, 259 unsolved in 14946 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 259 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 16/127 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-29 08:23:58] [INFO ] Deduced a trap composed of 102 places in 52 ms of which 1 ms to minimize.
[2024-05-29 08:23:58] [INFO ] Deduced a trap composed of 102 places in 43 ms of which 1 ms to minimize.
[2024-05-29 08:23:58] [INFO ] Deduced a trap composed of 103 places in 42 ms of which 0 ms to minimize.
[2024-05-29 08:23:59] [INFO ] Deduced a trap composed of 103 places in 43 ms of which 0 ms to minimize.
[2024-05-29 08:23:59] [INFO ] Deduced a trap composed of 102 places in 43 ms of which 1 ms to minimize.
[2024-05-29 08:23:59] [INFO ] Deduced a trap composed of 101 places in 45 ms of which 1 ms to minimize.
[2024-05-29 08:23:59] [INFO ] Deduced a trap composed of 100 places in 41 ms of which 1 ms to minimize.
[2024-05-29 08:23:59] [INFO ] Deduced a trap composed of 100 places in 41 ms of which 1 ms to minimize.
[2024-05-29 08:23:59] [INFO ] Deduced a trap composed of 101 places in 42 ms of which 1 ms to minimize.
[2024-05-29 08:23:59] [INFO ] Deduced a trap composed of 103 places in 41 ms of which 1 ms to minimize.
[2024-05-29 08:23:59] [INFO ] Deduced a trap composed of 99 places in 39 ms of which 1 ms to minimize.
[2024-05-29 08:23:59] [INFO ] Deduced a trap composed of 117 places in 49 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 12/139 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (OVERLAPS) 261/572 variables, 311/450 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/572 variables, 259/709 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 709 constraints, problems are : Problem set: 0 solved, 259 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 28/28 constraints]
After SMT, in 44993ms problems are : Problem set: 0 solved, 259 unsolved
Search for dead transitions found 0 dead transitions in 44995ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 45362 ms. Remains : 311/311 places, 261/261 transitions.
Built C files in :
/tmp/ltsmin870445787484688026
[2024-05-29 08:24:27] [INFO ] Computing symmetric may disable matrix : 261 transitions.
[2024-05-29 08:24:27] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 08:24:27] [INFO ] Computing symmetric may enable matrix : 261 transitions.
[2024-05-29 08:24:27] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 08:24:27] [INFO ] Computing Do-Not-Accords matrix : 261 transitions.
[2024-05-29 08:24:27] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 08:24:27] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin870445787484688026
Running compilation step : cd /tmp/ltsmin870445787484688026;'/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'
Compilation finished in 601 ms.
Running link step : cd /tmp/ltsmin870445787484688026;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin870445787484688026;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6649868512558074314.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 08:24:42] [INFO ] Flatten gal took : 19 ms
[2024-05-29 08:24:42] [INFO ] Flatten gal took : 12 ms
[2024-05-29 08:24:42] [INFO ] Time to serialize gal into /tmp/LTL5714726639000895825.gal : 2 ms
[2024-05-29 08:24:42] [INFO ] Time to serialize properties into /tmp/LTL15647325306662969864.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/LTL5714726639000895825.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1258483829595373473.hoa' '-atoms' '/tmp/LTL15647325306662969864.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/LTL15647325306662969864.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1258483829595373473.hoa
Detected timeout of ITS tools.
[2024-05-29 08:24:57] [INFO ] Flatten gal took : 19 ms
[2024-05-29 08:24:57] [INFO ] Flatten gal took : 13 ms
[2024-05-29 08:24:57] [INFO ] Time to serialize gal into /tmp/LTL17407920757579982194.gal : 2 ms
[2024-05-29 08:24:57] [INFO ] Time to serialize properties into /tmp/LTL8550348939879366914.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/LTL17407920757579982194.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8550348939879366914.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...276
Read 1 LTL properties
Checking formula 0 : !((F(("(p405==1)")||(X(F("(p400==1)"))))))
Formula 0 simplified : G(!"(p405==1)" & XG!"(p400==1)")
Detected timeout of ITS tools.
[2024-05-29 08:25:12] [INFO ] Flatten gal took : 6 ms
[2024-05-29 08:25:12] [INFO ] Applying decomposition
[2024-05-29 08:25:12] [INFO ] Flatten gal took : 7 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/graph3727705237252986283.txt' '-o' '/tmp/graph3727705237252986283.bin' '-w' '/tmp/graph3727705237252986283.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3727705237252986283.bin' '-l' '-1' '-v' '-w' '/tmp/graph3727705237252986283.weights' '-q' '0' '-e' '0.001'
[2024-05-29 08:25:12] [INFO ] Decomposing Gal with order
[2024-05-29 08:25:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 08:25:12] [INFO ] Removed a total of 61 redundant transitions.
[2024-05-29 08:25:12] [INFO ] Flatten gal took : 12 ms
[2024-05-29 08:25:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 116 labels/synchronizations in 2 ms.
[2024-05-29 08:25:12] [INFO ] Time to serialize gal into /tmp/LTL3285217611731613102.gal : 3 ms
[2024-05-29 08:25:12] [INFO ] Time to serialize properties into /tmp/LTL12787173229981791832.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/LTL3285217611731613102.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12787173229981791832.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 : !((F(("(i5.i3.u66.p405==1)")||(X(F("(i5.i2.u65.p400==1)"))))))
Formula 0 simplified : G(!"(i5.i3.u66.p405==1)" & XG!"(i5.i2.u65.p400==1)")
Detected timeout of ITS tools.
Treatment of property ShieldPPPs-PT-010B-LTLFireability-10 finished in 219255 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)))'
[2024-05-29 08:25:27] [INFO ] Flatten gal took : 12 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16357840169249053353
[2024-05-29 08:25:27] [INFO ] Applying decomposition
[2024-05-29 08:25:27] [INFO ] Computing symmetric may disable matrix : 568 transitions.
[2024-05-29 08:25:27] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 08:25:27] [INFO ] Computing symmetric may enable matrix : 568 transitions.
[2024-05-29 08:25:27] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 08:25:27] [INFO ] Flatten gal took : 11 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/graph16335242178104143644.txt' '-o' '/tmp/graph16335242178104143644.bin' '-w' '/tmp/graph16335242178104143644.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16335242178104143644.bin' '-l' '-1' '-v' '-w' '/tmp/graph16335242178104143644.weights' '-q' '0' '-e' '0.001'
[2024-05-29 08:25:28] [INFO ] Decomposing Gal with order
[2024-05-29 08:25:28] [INFO ] Computing Do-Not-Accords matrix : 568 transitions.
[2024-05-29 08:25:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 08:25:28] [INFO ] Computation of Completed DNA matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 08:25:28] [INFO ] Built C files in 72ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16357840169249053353
Running compilation step : cd /tmp/ltsmin16357840169249053353;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '144' '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'
[2024-05-29 08:25:28] [INFO ] Removed a total of 90 redundant transitions.
[2024-05-29 08:25:28] [INFO ] Flatten gal took : 23 ms
[2024-05-29 08:25:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2024-05-29 08:25:28] [INFO ] Time to serialize gal into /tmp/LTLFireability17543086642024530612.gal : 10 ms
[2024-05-29 08:25:28] [INFO ] Time to serialize properties into /tmp/LTLFireability9887404007893290704.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/LTLFireability17543086642024530612.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9887404007893290704.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 5 LTL properties
Checking formula 0 : !((F(G("((i5.i1.i2.u129.p364!=1)||(i5.i1.i5.u141.p400!=1))"))))
Formula 0 simplified : GF!"((i5.i1.i2.u129.p364!=1)||(i5.i1.i5.u141.p400!=1))"
Compilation finished in 1425 ms.
Running link step : cd /tmp/ltsmin16357840169249053353;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin16357840169249053353;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin16357840169249053353;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin16357840169249053353;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp1==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin16357840169249053353;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp1==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin16357840169249053353;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>((LTLAPp2==true))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin16357840169249053353;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>((LTLAPp2==true))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin16357840169249053353;'/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' '<>(((LTLAPp3==true)||X(<>((LTLAPp4==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin16357840169249053353;'/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' '<>(((LTLAPp3==true)||X(<>((LTLAPp4==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin16357840169249053353;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '([]((LTLAPp5==true))||<>((LTLAPp6==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin16357840169249053353;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '([]((LTLAPp5==true))||<>((LTLAPp6==true)))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 5760 s
Running LTSmin : cd /tmp/ltsmin16357840169249053353;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'

BK_TIME_CONFINEMENT_REACHED

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="ShieldPPPs-PT-010B"
export BK_EXAMINATION="LTLFireability"
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 ShieldPPPs-PT-010B, examination is LTLFireability"
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-171683761100444"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-010B.tgz
mv ShieldPPPs-PT-010B execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;