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-171683760200052.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 ShieldIIPs-PT-004A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683760200052
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 8.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Apr 11 14:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Apr 11 14:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 11 14:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 11 14:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:51 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 34K 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 ShieldIIPs-PT-004A-LTLFireability-00
FORMULA_NAME ShieldIIPs-PT-004A-LTLFireability-01
FORMULA_NAME ShieldIIPs-PT-004A-LTLFireability-02
FORMULA_NAME ShieldIIPs-PT-004A-LTLFireability-03
FORMULA_NAME ShieldIIPs-PT-004A-LTLFireability-04
FORMULA_NAME ShieldIIPs-PT-004A-LTLFireability-05
FORMULA_NAME ShieldIIPs-PT-004A-LTLFireability-06
FORMULA_NAME ShieldIIPs-PT-004A-LTLFireability-07
FORMULA_NAME ShieldIIPs-PT-004A-LTLFireability-08
FORMULA_NAME ShieldIIPs-PT-004A-LTLFireability-09
FORMULA_NAME ShieldIIPs-PT-004A-LTLFireability-10
FORMULA_NAME ShieldIIPs-PT-004A-LTLFireability-11
FORMULA_NAME ShieldIIPs-PT-004A-LTLFireability-12
FORMULA_NAME ShieldIIPs-PT-004A-LTLFireability-13
FORMULA_NAME ShieldIIPs-PT-004A-LTLFireability-14
FORMULA_NAME ShieldIIPs-PT-004A-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716880360186

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-004A
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-28 07:12: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-28 07:12:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 07:12:41] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2024-05-28 07:12:41] [INFO ] Transformed 103 places.
[2024-05-28 07:12:41] [INFO ] Transformed 99 transitions.
[2024-05-28 07:12:41] [INFO ] Found NUPN structural information;
[2024-05-28 07:12:41] [INFO ] Parsed PT model containing 103 places and 99 transitions and 438 arcs in 172 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA ShieldIIPs-PT-004A-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 46 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 99/99 transitions.
Applied a total of 0 rules in 11 ms. Remains 103 /103 variables (removed 0) and now considering 99/99 (removed 0) transitions.
// Phase 1: matrix 99 rows 103 cols
[2024-05-28 07:12:41] [INFO ] Computed 37 invariants in 11 ms
[2024-05-28 07:12:41] [INFO ] Implicit Places using invariants in 227 ms returned []
[2024-05-28 07:12:41] [INFO ] Invariant cache hit.
[2024-05-28 07:12:42] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 410 ms to find 0 implicit places.
Running 98 sub problems to find dead transitions.
[2024-05-28 07:12:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 37/139 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:12:43] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 8 ms to minimize.
[2024-05-28 07:12:43] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 2 ms to minimize.
[2024-05-28 07:12:43] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-28 07:12:43] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 4/144 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 99/202 variables, 103/247 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:12:44] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 0 ms to minimize.
[2024-05-28 07:12:44] [INFO ] Deduced a trap composed of 9 places in 16 ms of which 0 ms to minimize.
[2024-05-28 07:12:44] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-05-28 07:12:44] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 1 ms to minimize.
[2024-05-28 07:12:44] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 5/252 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:12:44] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:12:45] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/202 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:12:45] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/202 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/202 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 13 (OVERLAPS) 0/202 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 255 constraints, problems are : Problem set: 0 solved, 98 unsolved in 4573 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 37/139 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 12/152 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 99/202 variables, 103/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 98/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (OVERLAPS) 0/202 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 353 constraints, problems are : Problem set: 0 solved, 98 unsolved in 2720 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 12/12 constraints]
After SMT, in 7357ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 7377ms
Finished structural reductions in LTL mode , in 1 iterations and 7822 ms. Remains : 103/103 places, 99/99 transitions.
Support contains 46 out of 103 places after structural reductions.
[2024-05-28 07:12:49] [INFO ] Flatten gal took : 31 ms
[2024-05-28 07:12:49] [INFO ] Flatten gal took : 13 ms
[2024-05-28 07:12:49] [INFO ] Input system was already deterministic with 99 transitions.
RANDOM walk for 6591 steps (26 resets) in 353 ms. (18 steps per ms) remains 0/27 properties
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U G((p1 U p2))))'
Support contains 5 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 99/99 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 103 transition count 98
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 102 transition count 98
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 4 place count 101 transition count 97
Applied a total of 4 rules in 25 ms. Remains 101 /103 variables (removed 2) and now considering 97/99 (removed 2) transitions.
// Phase 1: matrix 97 rows 101 cols
[2024-05-28 07:12:50] [INFO ] Computed 37 invariants in 2 ms
[2024-05-28 07:12:50] [INFO ] Implicit Places using invariants in 65 ms returned [87]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 66 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 100/103 places, 97/99 transitions.
Applied a total of 0 rules in 7 ms. Remains 100 /100 variables (removed 0) and now considering 97/97 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 99 ms. Remains : 100/103 places, 97/99 transitions.
Stuttering acceptance computed with spot in 312 ms :[(NOT p2), true, (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : ShieldIIPs-PT-004A-LTLFireability-00
Stuttering criterion allowed to conclude after 204 steps with 0 reset in 5 ms.
FORMULA ShieldIIPs-PT-004A-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-004A-LTLFireability-00 finished in 477 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 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 99/99 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 102 transition count 97
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 100 transition count 97
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 5 place count 99 transition count 96
Applied a total of 5 rules in 14 ms. Remains 99 /103 variables (removed 4) and now considering 96/99 (removed 3) transitions.
// Phase 1: matrix 96 rows 99 cols
[2024-05-28 07:12:50] [INFO ] Computed 36 invariants in 1 ms
[2024-05-28 07:12:50] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-05-28 07:12:50] [INFO ] Invariant cache hit.
[2024-05-28 07:12:51] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
[2024-05-28 07:12:51] [INFO ] Redundant transitions in 21 ms returned [90]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 94 sub problems to find dead transitions.
// Phase 1: matrix 95 rows 99 cols
[2024-05-28 07:12:51] [INFO ] Computed 36 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 99/99 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 36/135 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-28 07:12:51] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-05-28 07:12:51] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-05-28 07:12:51] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-05-28 07:12:51] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 4/139 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (OVERLAPS) 95/194 variables, 99/238 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-28 07:12:52] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 1 ms to minimize.
[2024-05-28 07:12:52] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 0 ms to minimize.
[2024-05-28 07:12:52] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 3/241 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-28 07:12:52] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
[2024-05-28 07:12:52] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 2/243 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/194 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (OVERLAPS) 0/194 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Real declared 194/194 variables, and 243 constraints, problems are : Problem set: 0 solved, 94 unsolved in 2483 ms.
Refiners :[Domain max(s): 99/99 constraints, Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 94 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 99/99 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 36/135 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 9/144 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (OVERLAPS) 95/194 variables, 99/243 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 94/337 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-28 07:12:54] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-28 07:12:54] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/194 variables, 1/339 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/194 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 9 (OVERLAPS) 0/194 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Int declared 194/194 variables, and 339 constraints, problems are : Problem set: 0 solved, 94 unsolved in 3438 ms.
Refiners :[Domain max(s): 99/99 constraints, Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 11/11 constraints]
After SMT, in 5944ms problems are : Problem set: 0 solved, 94 unsolved
Search for dead transitions found 0 dead transitions in 5946ms
Starting structural reductions in SI_LTL mode, iteration 1 : 99/103 places, 95/99 transitions.
Applied a total of 0 rules in 9 ms. Remains 99 /99 variables (removed 0) and now considering 95/95 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6212 ms. Remains : 99/103 places, 95/99 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-004A-LTLFireability-01
Stuttering criterion allowed to conclude after 25007 steps with 290 reset in 105 ms.
FORMULA ShieldIIPs-PT-004A-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-004A-LTLFireability-01 finished in 6403 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))))'
Support contains 2 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 99/99 transitions.
Applied a total of 0 rules in 3 ms. Remains 103 /103 variables (removed 0) and now considering 99/99 (removed 0) transitions.
// Phase 1: matrix 99 rows 103 cols
[2024-05-28 07:12:57] [INFO ] Computed 37 invariants in 2 ms
[2024-05-28 07:12:57] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-28 07:12:57] [INFO ] Invariant cache hit.
[2024-05-28 07:12:57] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
Running 98 sub problems to find dead transitions.
[2024-05-28 07:12:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 37/139 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:12:58] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-28 07:12:58] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-28 07:12:58] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-28 07:12:58] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 4/144 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 99/202 variables, 103/247 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:12:58] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-28 07:12:58] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-28 07:12:58] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-28 07:12:58] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
[2024-05-28 07:12:59] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 5/252 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:12:59] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:13:00] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 2 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/202 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:13:00] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 9 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/202 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/202 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 13 (OVERLAPS) 0/202 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 255 constraints, problems are : Problem set: 0 solved, 98 unsolved in 4219 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 37/139 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 12/152 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 99/202 variables, 103/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 98/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (OVERLAPS) 0/202 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 353 constraints, problems are : Problem set: 0 solved, 98 unsolved in 2657 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 12/12 constraints]
After SMT, in 6915ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 6920ms
Finished structural reductions in LTL mode , in 1 iterations and 7109 ms. Remains : 103/103 places, 99/99 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-004A-LTLFireability-03
Stuttering criterion allowed to conclude after 35929 steps with 343 reset in 103 ms.
FORMULA ShieldIIPs-PT-004A-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-004A-LTLFireability-03 finished in 7320 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(p1))))'
Support contains 8 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 99/99 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 103 transition count 98
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 102 transition count 98
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 4 place count 101 transition count 97
Applied a total of 4 rules in 10 ms. Remains 101 /103 variables (removed 2) and now considering 97/99 (removed 2) transitions.
// Phase 1: matrix 97 rows 101 cols
[2024-05-28 07:13:04] [INFO ] Computed 37 invariants in 2 ms
[2024-05-28 07:13:04] [INFO ] Implicit Places using invariants in 69 ms returned [87]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 70 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 100/103 places, 97/99 transitions.
Applied a total of 0 rules in 6 ms. Remains 100 /100 variables (removed 0) and now considering 97/97 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 86 ms. Remains : 100/103 places, 97/99 transitions.
Stuttering acceptance computed with spot in 30 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-004A-LTLFireability-04
Stuttering criterion allowed to conclude after 175 steps with 0 reset in 2 ms.
FORMULA ShieldIIPs-PT-004A-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-004A-LTLFireability-04 finished in 149 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) U p1) U (p0 U X(p2))))'
Support contains 5 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 99/99 transitions.
Applied a total of 0 rules in 4 ms. Remains 103 /103 variables (removed 0) and now considering 99/99 (removed 0) transitions.
// Phase 1: matrix 99 rows 103 cols
[2024-05-28 07:13:04] [INFO ] Computed 37 invariants in 1 ms
[2024-05-28 07:13:04] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-28 07:13:04] [INFO ] Invariant cache hit.
[2024-05-28 07:13:04] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
Running 98 sub problems to find dead transitions.
[2024-05-28 07:13:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 37/139 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:13:05] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-05-28 07:13:05] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:13:05] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 2 ms to minimize.
[2024-05-28 07:13:05] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 4/144 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 99/202 variables, 103/247 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:13:06] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-28 07:13:06] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-05-28 07:13:06] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:13:06] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-28 07:13:06] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 5/252 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:13:06] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:13:07] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/202 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:13:08] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/202 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/202 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 13 (OVERLAPS) 0/202 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 255 constraints, problems are : Problem set: 0 solved, 98 unsolved in 4363 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 37/139 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 12/152 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 99/202 variables, 103/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 98/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (OVERLAPS) 0/202 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 353 constraints, problems are : Problem set: 0 solved, 98 unsolved in 2700 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 12/12 constraints]
After SMT, in 7084ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 7085ms
Finished structural reductions in LTL mode , in 1 iterations and 7261 ms. Remains : 103/103 places, 99/99 transitions.
Stuttering acceptance computed with spot in 330 ms :[(NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (NOT p2), (NOT p2), true, p0, (NOT p1), (NOT p2)]
Running random walk in product with property : ShieldIIPs-PT-004A-LTLFireability-05
Entered a terminal (fully accepting) state of product in 424 steps with 1 reset in 7 ms.
FORMULA ShieldIIPs-PT-004A-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-004A-LTLFireability-05 finished in 7627 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) U X(G(!p1))))'
Support contains 5 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 99/99 transitions.
Applied a total of 0 rules in 3 ms. Remains 103 /103 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2024-05-28 07:13:12] [INFO ] Invariant cache hit.
[2024-05-28 07:13:12] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-28 07:13:12] [INFO ] Invariant cache hit.
[2024-05-28 07:13:12] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
Running 98 sub problems to find dead transitions.
[2024-05-28 07:13:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 37/139 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:13:13] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
[2024-05-28 07:13:13] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-28 07:13:13] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-28 07:13:13] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 4/144 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 99/202 variables, 103/247 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:13:14] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-05-28 07:13:14] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2024-05-28 07:13:14] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-28 07:13:14] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-28 07:13:14] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 5/252 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:13:14] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:13:15] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/202 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:13:15] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/202 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/202 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 13 (OVERLAPS) 0/202 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 255 constraints, problems are : Problem set: 0 solved, 98 unsolved in 4373 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 37/139 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 12/152 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 99/202 variables, 103/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 98/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (OVERLAPS) 0/202 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 353 constraints, problems are : Problem set: 0 solved, 98 unsolved in 2754 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 12/12 constraints]
After SMT, in 7147ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 7151ms
Finished structural reductions in LTL mode , in 1 iterations and 7327 ms. Remains : 103/103 places, 99/99 transitions.
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) p1), p1, (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-004A-LTLFireability-06
Product exploration explored 100000 steps with 33280 reset in 200 ms.
Product exploration explored 100000 steps with 33362 reset in 325 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 141 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p0) p1), p1, (NOT p0)]
RANDOM walk for 535 steps (1 resets) in 15 ms. (33 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 7 factoid took 210 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) p1), p1, (NOT p0)]
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) p1), p1, (NOT p0)]
Support contains 5 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 99/99 transitions.
Applied a total of 0 rules in 2 ms. Remains 103 /103 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2024-05-28 07:13:21] [INFO ] Invariant cache hit.
[2024-05-28 07:13:21] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-28 07:13:21] [INFO ] Invariant cache hit.
[2024-05-28 07:13:21] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
Running 98 sub problems to find dead transitions.
[2024-05-28 07:13:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 37/139 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:13:22] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-28 07:13:22] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 0 ms to minimize.
[2024-05-28 07:13:22] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-05-28 07:13:22] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 4/144 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 99/202 variables, 103/247 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:13:22] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-28 07:13:23] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-28 07:13:23] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-28 07:13:23] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2024-05-28 07:13:23] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 5/252 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:13:23] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:13:24] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/202 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:13:24] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/202 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/202 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 13 (OVERLAPS) 0/202 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 255 constraints, problems are : Problem set: 0 solved, 98 unsolved in 4474 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 37/139 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 12/152 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 99/202 variables, 103/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 98/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (OVERLAPS) 0/202 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 353 constraints, problems are : Problem set: 0 solved, 98 unsolved in 2687 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 12/12 constraints]
After SMT, in 7194ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 7195ms
Finished structural reductions in LTL mode , in 1 iterations and 7438 ms. Remains : 103/103 places, 99/99 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 122 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) p1), p1, (NOT p0)]
RANDOM walk for 550 steps (1 resets) in 11 ms. (45 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 7 factoid took 179 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) p1), p1, (NOT p0)]
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) p1), p1, (NOT p0)]
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) p1), p1, (NOT p0)]
Product exploration explored 100000 steps with 33364 reset in 161 ms.
Product exploration explored 100000 steps with 33269 reset in 209 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) p1), p1, (NOT p0)]
Support contains 5 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 99/99 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 5 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 103 transition count 99
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 13 ms. Remains 103 /103 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2024-05-28 07:13:30] [INFO ] Redundant transitions in 66 ms returned []
Running 98 sub problems to find dead transitions.
// Phase 1: matrix 99 rows 103 cols
[2024-05-28 07:13:30] [INFO ] Computed 37 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 37/139 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:13:30] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-28 07:13:30] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 4 ms to minimize.
[2024-05-28 07:13:31] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 0 ms to minimize.
[2024-05-28 07:13:31] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
Problem TDEAD28 is UNSAT
[2024-05-28 07:13:31] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 5/145 constraints. Problems are: Problem set: 1 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/145 constraints. Problems are: Problem set: 1 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 99/202 variables, 103/248 constraints. Problems are: Problem set: 1 solved, 97 unsolved
[2024-05-28 07:13:31] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-05-28 07:13:31] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-28 07:13:31] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 3/251 constraints. Problems are: Problem set: 1 solved, 97 unsolved
[2024-05-28 07:13:32] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 1/252 constraints. Problems are: Problem set: 1 solved, 97 unsolved
[2024-05-28 07:13:32] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-28 07:13:32] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 2/254 constraints. Problems are: Problem set: 1 solved, 97 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/202 variables, 0/254 constraints. Problems are: Problem set: 1 solved, 97 unsolved
At refinement iteration 11 (OVERLAPS) 0/202 variables, 0/254 constraints. Problems are: Problem set: 1 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 254 constraints, problems are : Problem set: 1 solved, 97 unsolved in 3508 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 1 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 101/101 constraints. Problems are: Problem set: 1 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/101 constraints. Problems are: Problem set: 1 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 2/103 variables, 37/138 constraints. Problems are: Problem set: 1 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 2/140 constraints. Problems are: Problem set: 1 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 11/151 constraints. Problems are: Problem set: 1 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/151 constraints. Problems are: Problem set: 1 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 99/202 variables, 103/254 constraints. Problems are: Problem set: 1 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 97/351 constraints. Problems are: Problem set: 1 solved, 97 unsolved
[2024-05-28 07:13:34] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-28 07:13:34] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 2/353 constraints. Problems are: Problem set: 1 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/353 constraints. Problems are: Problem set: 1 solved, 97 unsolved
At refinement iteration 10 (OVERLAPS) 0/202 variables, 0/353 constraints. Problems are: Problem set: 1 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 353 constraints, problems are : Problem set: 1 solved, 97 unsolved in 4179 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 97/98 constraints, Known Traps: 13/13 constraints]
After SMT, in 7720ms problems are : Problem set: 1 solved, 97 unsolved
Search for dead transitions found 1 dead transitions in 7721ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 103/103 places, 98/99 transitions.
Graph (complete) has 354 edges and 103 vertex of which 102 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.13 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 33 ms. Remains 102 /103 variables (removed 1) and now considering 98/98 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 102/103 places, 98/99 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7854 ms. Remains : 102/103 places, 98/99 transitions.
Built C files in :
/tmp/ltsmin17512766244451029104
[2024-05-28 07:13:37] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17512766244451029104
Running compilation step : cd /tmp/ltsmin17512766244451029104;'/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 381 ms.
Running link step : cd /tmp/ltsmin17512766244451029104;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 64 ms.
Running LTSmin : cd /tmp/ltsmin17512766244451029104;'/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/stateBased15548537828194831678.hoa' '--buchi-type=spotba'
LTSmin run took 1069 ms.
FORMULA ShieldIIPs-PT-004A-LTLFireability-06 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldIIPs-PT-004A-LTLFireability-06 finished in 27147 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 (X(p0)&&(F(p1) U G(p2)))))'
Support contains 4 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 99/99 transitions.
Applied a total of 0 rules in 2 ms. Remains 103 /103 variables (removed 0) and now considering 99/99 (removed 0) transitions.
// Phase 1: matrix 99 rows 103 cols
[2024-05-28 07:13:39] [INFO ] Computed 37 invariants in 1 ms
[2024-05-28 07:13:39] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-28 07:13:39] [INFO ] Invariant cache hit.
[2024-05-28 07:13:39] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
Running 98 sub problems to find dead transitions.
[2024-05-28 07:13:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 37/139 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:13:40] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 0 ms to minimize.
[2024-05-28 07:13:40] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-28 07:13:40] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-28 07:13:40] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 4/144 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 99/202 variables, 103/247 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:13:41] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-28 07:13:41] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
[2024-05-28 07:13:41] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-05-28 07:13:41] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-28 07:13:41] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 5/252 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:13:41] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:13:42] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/202 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:13:42] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/202 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/202 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 13 (OVERLAPS) 0/202 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 255 constraints, problems are : Problem set: 0 solved, 98 unsolved in 4292 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 37/139 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 12/152 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 99/202 variables, 103/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 98/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (OVERLAPS) 0/202 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 353 constraints, problems are : Problem set: 0 solved, 98 unsolved in 2646 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 12/12 constraints]
After SMT, in 6989ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 6990ms
Finished structural reductions in LTL mode , in 1 iterations and 7171 ms. Remains : 103/103 places, 99/99 transitions.
Stuttering acceptance computed with spot in 288 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-004A-LTLFireability-07
Stuttering criterion allowed to conclude after 1214 steps with 8 reset in 3 ms.
FORMULA ShieldIIPs-PT-004A-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-004A-LTLFireability-07 finished in 7486 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(X(F(p1))))))'
Support contains 4 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 99/99 transitions.
Applied a total of 0 rules in 7 ms. Remains 103 /103 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2024-05-28 07:13:46] [INFO ] Invariant cache hit.
[2024-05-28 07:13:47] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-28 07:13:47] [INFO ] Invariant cache hit.
[2024-05-28 07:13:47] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
Running 98 sub problems to find dead transitions.
[2024-05-28 07:13:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 37/139 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:13:47] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-28 07:13:47] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-28 07:13:47] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 0 ms to minimize.
[2024-05-28 07:13:48] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 4/144 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 99/202 variables, 103/247 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:13:48] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-28 07:13:48] [INFO ] Deduced a trap composed of 9 places in 15 ms of which 0 ms to minimize.
[2024-05-28 07:13:48] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-28 07:13:48] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-28 07:13:48] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 5/252 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:13:49] [INFO ] Deduced a trap composed of 11 places in 18 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:13:50] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/202 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:13:50] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/202 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/202 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 13 (OVERLAPS) 0/202 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 255 constraints, problems are : Problem set: 0 solved, 98 unsolved in 4238 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 37/139 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 12/152 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 99/202 variables, 103/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 98/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (OVERLAPS) 0/202 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 353 constraints, problems are : Problem set: 0 solved, 98 unsolved in 2673 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 12/12 constraints]
After SMT, in 6933ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 6934ms
Finished structural reductions in LTL mode , in 1 iterations and 7132 ms. Remains : 103/103 places, 99/99 transitions.
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-004A-LTLFireability-08
Product exploration explored 100000 steps with 3446 reset in 266 ms.
Product exploration explored 100000 steps with 3413 reset in 217 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 103 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 4546 steps (16 resets) in 17 ms. (252 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F p1), (F p0)]
Knowledge based reduction with 5 factoid took 155 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2024-05-28 07:13:55] [INFO ] Invariant cache hit.
[2024-05-28 07:13:55] [INFO ] [Real]Absence check using 37 positive place invariants in 5 ms returned sat
[2024-05-28 07:13:55] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2024-05-28 07:13:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:13:55] [INFO ] [Nat]Absence check using 37 positive place invariants in 6 ms returned sat
[2024-05-28 07:13:55] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2024-05-28 07:13:55] [INFO ] Computed and/alt/rep : 92/327/92 causal constraints (skipped 6 transitions) in 8 ms.
[2024-05-28 07:13:55] [INFO ] Added : 88 causal constraints over 18 iterations in 228 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Support contains 4 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 99/99 transitions.
Applied a total of 0 rules in 1 ms. Remains 103 /103 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2024-05-28 07:13:55] [INFO ] Invariant cache hit.
[2024-05-28 07:13:55] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-05-28 07:13:55] [INFO ] Invariant cache hit.
[2024-05-28 07:13:56] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
Running 98 sub problems to find dead transitions.
[2024-05-28 07:13:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 37/139 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:13:56] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2024-05-28 07:13:56] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-28 07:13:56] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 0 ms to minimize.
[2024-05-28 07:13:57] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 4/144 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 99/202 variables, 103/247 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:13:57] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-28 07:13:57] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 0 ms to minimize.
[2024-05-28 07:13:57] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-05-28 07:13:57] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-28 07:13:57] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 5/252 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:13:58] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:13:59] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/202 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:13:59] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/202 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/202 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 13 (OVERLAPS) 0/202 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 255 constraints, problems are : Problem set: 0 solved, 98 unsolved in 4319 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 37/139 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 12/152 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 99/202 variables, 103/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 98/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (OVERLAPS) 0/202 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 353 constraints, problems are : Problem set: 0 solved, 98 unsolved in 2583 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 12/12 constraints]
After SMT, in 6935ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 6936ms
Finished structural reductions in LTL mode , in 1 iterations and 7248 ms. Remains : 103/103 places, 99/99 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 101 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 1118 steps (2 resets) in 23 ms. (46 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 4 factoid took 173 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-28 07:14:03] [INFO ] Invariant cache hit.
[2024-05-28 07:14:03] [INFO ] [Real]Absence check using 37 positive place invariants in 6 ms returned sat
[2024-05-28 07:14:03] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2024-05-28 07:14:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:14:03] [INFO ] [Nat]Absence check using 37 positive place invariants in 6 ms returned sat
[2024-05-28 07:14:03] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2024-05-28 07:14:04] [INFO ] Computed and/alt/rep : 92/327/92 causal constraints (skipped 6 transitions) in 6 ms.
[2024-05-28 07:14:04] [INFO ] Added : 65 causal constraints over 14 iterations in 223 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 240 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 3427 reset in 219 ms.
Product exploration explored 100000 steps with 3420 reset in 182 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 99/99 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 103 transition count 99
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 12 ms. Remains 103 /103 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2024-05-28 07:14:05] [INFO ] Redundant transitions in 92 ms returned [96]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT only with invariants) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 97 sub problems to find dead transitions.
// Phase 1: matrix 98 rows 103 cols
[2024-05-28 07:14:05] [INFO ] Computed 37 invariants in 2 ms
[2024-05-28 07:14:05] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 37/139 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-28 07:14:05] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 1 ms to minimize.
[2024-05-28 07:14:06] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:14:06] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-28 07:14:06] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
Problem TDEAD28 is UNSAT
[2024-05-28 07:14:06] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 5/145 constraints. Problems are: Problem set: 1 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/145 constraints. Problems are: Problem set: 1 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 98/201 variables, 103/248 constraints. Problems are: Problem set: 1 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 3/251 constraints. Problems are: Problem set: 1 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 0/251 constraints. Problems are: Problem set: 1 solved, 96 unsolved
At refinement iteration 9 (OVERLAPS) 0/201 variables, 0/251 constraints. Problems are: Problem set: 1 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 251 constraints, problems are : Problem set: 1 solved, 96 unsolved in 3071 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 1 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 101/101 constraints. Problems are: Problem set: 1 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/101 constraints. Problems are: Problem set: 1 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 2/103 variables, 37/138 constraints. Problems are: Problem set: 1 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 2/140 constraints. Problems are: Problem set: 1 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 5/145 constraints. Problems are: Problem set: 1 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/145 constraints. Problems are: Problem set: 1 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 98/201 variables, 103/248 constraints. Problems are: Problem set: 1 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 3/251 constraints. Problems are: Problem set: 1 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 96/347 constraints. Problems are: Problem set: 1 solved, 96 unsolved
[2024-05-28 07:14:09] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:14:09] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-05-28 07:14:10] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 3/350 constraints. Problems are: Problem set: 1 solved, 96 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 0/350 constraints. Problems are: Problem set: 1 solved, 96 unsolved
[2024-05-28 07:14:14] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
[2024-05-28 07:14:14] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 0 ms to minimize.
[2024-05-28 07:14:14] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/201 variables, 3/353 constraints. Problems are: Problem set: 1 solved, 96 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/201 variables, 0/353 constraints. Problems are: Problem set: 1 solved, 96 unsolved
[2024-05-28 07:14:19] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/201 variables, 1/354 constraints. Problems are: Problem set: 1 solved, 96 unsolved
[2024-05-28 07:14:21] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/201 variables, 1/355 constraints. Problems are: Problem set: 1 solved, 96 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/201 variables, 0/355 constraints. Problems are: Problem set: 1 solved, 96 unsolved
At refinement iteration 16 (OVERLAPS) 0/201 variables, 0/355 constraints. Problems are: Problem set: 1 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 355 constraints, problems are : Problem set: 1 solved, 96 unsolved in 19938 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 96/97 constraints, Known Traps: 13/13 constraints]
After SMT, in 23034ms problems are : Problem set: 1 solved, 96 unsolved
Search for dead transitions found 1 dead transitions in 23036ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 103/103 places, 97/99 transitions.
Graph (complete) has 352 edges and 103 vertex of which 102 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 102 /103 variables (removed 1) and now considering 97/97 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 102/103 places, 97/99 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 23156 ms. Remains : 102/103 places, 97/99 transitions.
Built C files in :
/tmp/ltsmin8185633578993308038
[2024-05-28 07:14:28] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8185633578993308038
Running compilation step : cd /tmp/ltsmin8185633578993308038;'/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 213 ms.
Running link step : cd /tmp/ltsmin8185633578993308038;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin8185633578993308038;'/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/stateBased12791564012506482630.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 99/99 transitions.
Applied a total of 0 rules in 0 ms. Remains 103 /103 variables (removed 0) and now considering 99/99 (removed 0) transitions.
// Phase 1: matrix 99 rows 103 cols
[2024-05-28 07:14:43] [INFO ] Computed 37 invariants in 1 ms
[2024-05-28 07:14:43] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-28 07:14:43] [INFO ] Invariant cache hit.
[2024-05-28 07:14:43] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
Running 98 sub problems to find dead transitions.
[2024-05-28 07:14:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 37/139 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:14:44] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-05-28 07:14:44] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-28 07:14:44] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 0 ms to minimize.
[2024-05-28 07:14:44] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 4/144 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 99/202 variables, 103/247 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:14:45] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-05-28 07:14:45] [INFO ] Deduced a trap composed of 9 places in 17 ms of which 0 ms to minimize.
[2024-05-28 07:14:45] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-28 07:14:45] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:14:45] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 5/252 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:14:45] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:14:46] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/202 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:14:46] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/202 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/202 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 13 (OVERLAPS) 0/202 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 255 constraints, problems are : Problem set: 0 solved, 98 unsolved in 4310 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 37/139 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 12/152 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 99/202 variables, 103/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 98/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (OVERLAPS) 0/202 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 353 constraints, problems are : Problem set: 0 solved, 98 unsolved in 2618 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 12/12 constraints]
After SMT, in 6950ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 6951ms
Finished structural reductions in LTL mode , in 1 iterations and 7171 ms. Remains : 103/103 places, 99/99 transitions.
Built C files in :
/tmp/ltsmin12358829160776878229
[2024-05-28 07:14:50] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12358829160776878229
Running compilation step : cd /tmp/ltsmin12358829160776878229;'/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 208 ms.
Running link step : cd /tmp/ltsmin12358829160776878229;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin12358829160776878229;'/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/stateBased16569195070551293808.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 07:15:05] [INFO ] Flatten gal took : 9 ms
[2024-05-28 07:15:05] [INFO ] Flatten gal took : 7 ms
[2024-05-28 07:15:05] [INFO ] Time to serialize gal into /tmp/LTL11923837875000032951.gal : 3 ms
[2024-05-28 07:15:05] [INFO ] Time to serialize properties into /tmp/LTL1237942681485586367.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/LTL11923837875000032951.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14191321678003855647.hoa' '-atoms' '/tmp/LTL1237942681485586367.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...319
Loading property file /tmp/LTL1237942681485586367.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14191321678003855647.hoa
Detected timeout of ITS tools.
[2024-05-28 07:15:20] [INFO ] Flatten gal took : 8 ms
[2024-05-28 07:15:20] [INFO ] Flatten gal took : 7 ms
[2024-05-28 07:15:20] [INFO ] Time to serialize gal into /tmp/LTL289361544178233476.gal : 2 ms
[2024-05-28 07:15:20] [INFO ] Time to serialize properties into /tmp/LTL1608406669265480238.ltl : 3 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/LTL289361544178233476.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1608406669265480238.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...274
Read 1 LTL properties
Checking formula 0 : !((F((X(X(F("(p89==1)"))))||("(((p63==1)&&(p71==1))&&(p75==1))"))))
Formula 0 simplified : G(!"(((p63==1)&&(p71==1))&&(p75==1))" & XXG!"(p89==1)")
Detected timeout of ITS tools.
[2024-05-28 07:15:35] [INFO ] Flatten gal took : 7 ms
[2024-05-28 07:15:35] [INFO ] Applying decomposition
[2024-05-28 07:15:35] [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/graph2074888010847122269.txt' '-o' '/tmp/graph2074888010847122269.bin' '-w' '/tmp/graph2074888010847122269.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2074888010847122269.bin' '-l' '-1' '-v' '-w' '/tmp/graph2074888010847122269.weights' '-q' '0' '-e' '0.001'
[2024-05-28 07:15:35] [INFO ] Decomposing Gal with order
[2024-05-28 07:15:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 07:15:35] [INFO ] Removed a total of 64 redundant transitions.
[2024-05-28 07:15:36] [INFO ] Flatten gal took : 48 ms
[2024-05-28 07:15:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 66 labels/synchronizations in 18 ms.
[2024-05-28 07:15:36] [INFO ] Time to serialize gal into /tmp/LTL14373443486355697899.gal : 8 ms
[2024-05-28 07:15:36] [INFO ] Time to serialize properties into /tmp/LTL14691024176359026639.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/LTL14373443486355697899.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14691024176359026639.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((X(X(F("(i4.u33.p89==1)"))))||("(((i2.i1.u23.p63==1)&&(i2.i1.u26.p71==1))&&(i2.i1.u27.p75==1))"))))
Formula 0 simplified : G(!"(((i2.i1.u23.p63==1)&&(i2.i1.u26.p71==1))&&(i2.i1.u27.p75==1))" & XXG!"(i4.u33.p89==1)")
Detected timeout of ITS tools.
Treatment of property ShieldIIPs-PT-004A-LTLFireability-08 finished in 124204 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G((X(!p1) U p2))||p0))))'
Support contains 7 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 99/99 transitions.
Applied a total of 0 rules in 1 ms. Remains 103 /103 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2024-05-28 07:15:51] [INFO ] Invariant cache hit.
[2024-05-28 07:15:51] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-28 07:15:51] [INFO ] Invariant cache hit.
[2024-05-28 07:15:51] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
Running 98 sub problems to find dead transitions.
[2024-05-28 07:15:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 37/139 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:15:51] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-28 07:15:52] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-05-28 07:15:52] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-05-28 07:15:52] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 4/144 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 99/202 variables, 103/247 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:15:52] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-28 07:15:52] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-28 07:15:52] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-28 07:15:52] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 1 ms to minimize.
[2024-05-28 07:15:52] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 5/252 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:15:53] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:15:54] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/202 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:15:54] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/202 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/202 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 13 (OVERLAPS) 0/202 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 255 constraints, problems are : Problem set: 0 solved, 98 unsolved in 4127 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 37/139 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 12/152 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 99/202 variables, 103/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 98/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (OVERLAPS) 0/202 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 353 constraints, problems are : Problem set: 0 solved, 98 unsolved in 2699 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 12/12 constraints]
After SMT, in 6846ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 6848ms
Finished structural reductions in LTL mode , in 1 iterations and 7020 ms. Remains : 103/103 places, 99/99 transitions.
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldIIPs-PT-004A-LTLFireability-09
Product exploration explored 100000 steps with 831 reset in 195 ms.
Product exploration explored 100000 steps with 815 reset in 211 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 121 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 482 steps (0 resets) in 14 ms. (32 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F p2), (F (NOT (OR p2 p0))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 11 factoid took 260 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 7 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 99/99 transitions.
Applied a total of 0 rules in 1 ms. Remains 103 /103 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2024-05-28 07:15:59] [INFO ] Invariant cache hit.
[2024-05-28 07:15:59] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-28 07:15:59] [INFO ] Invariant cache hit.
[2024-05-28 07:15:59] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
Running 98 sub problems to find dead transitions.
[2024-05-28 07:15:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 37/139 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:16:00] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-28 07:16:00] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-05-28 07:16:00] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
[2024-05-28 07:16:00] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 4/144 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 99/202 variables, 103/247 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:16:01] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-28 07:16:01] [INFO ] Deduced a trap composed of 9 places in 17 ms of which 0 ms to minimize.
[2024-05-28 07:16:01] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-28 07:16:01] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-28 07:16:01] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 5/252 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:16:01] [INFO ] Deduced a trap composed of 11 places in 17 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:16:02] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/202 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:16:02] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/202 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/202 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 13 (OVERLAPS) 0/202 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 255 constraints, problems are : Problem set: 0 solved, 98 unsolved in 4078 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 37/139 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 12/152 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 99/202 variables, 103/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 98/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (OVERLAPS) 0/202 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 353 constraints, problems are : Problem set: 0 solved, 98 unsolved in 2601 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 12/12 constraints]
After SMT, in 6713ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 6714ms
Finished structural reductions in LTL mode , in 1 iterations and 6883 ms. Remains : 103/103 places, 99/99 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 115 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 489 steps (1 resets) in 14 ms. (32 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F p2), (F (NOT (OR p2 p0))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 11 factoid took 244 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 808 reset in 205 ms.
Product exploration explored 100000 steps with 810 reset in 214 ms.
Built C files in :
/tmp/ltsmin5276603587178726570
[2024-05-28 07:16:07] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5276603587178726570
Running compilation step : cd /tmp/ltsmin5276603587178726570;'/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 216 ms.
Running link step : cd /tmp/ltsmin5276603587178726570;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin5276603587178726570;'/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/stateBased4964492602158988234.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 7 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 99/99 transitions.
Applied a total of 0 rules in 3 ms. Remains 103 /103 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2024-05-28 07:16:22] [INFO ] Invariant cache hit.
[2024-05-28 07:16:22] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-28 07:16:22] [INFO ] Invariant cache hit.
[2024-05-28 07:16:22] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
Running 98 sub problems to find dead transitions.
[2024-05-28 07:16:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 37/139 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:16:23] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-05-28 07:16:23] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2024-05-28 07:16:23] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2024-05-28 07:16:23] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 4/144 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 99/202 variables, 103/247 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:16:24] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-05-28 07:16:24] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 0 ms to minimize.
[2024-05-28 07:16:24] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-28 07:16:24] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
[2024-05-28 07:16:24] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 5/252 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:16:24] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:16:25] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/202 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:16:26] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/202 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/202 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 13 (OVERLAPS) 0/202 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 255 constraints, problems are : Problem set: 0 solved, 98 unsolved in 4150 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 37/139 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 12/152 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 99/202 variables, 103/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 98/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (OVERLAPS) 0/202 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 353 constraints, problems are : Problem set: 0 solved, 98 unsolved in 2700 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 12/12 constraints]
After SMT, in 6869ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 6871ms
Finished structural reductions in LTL mode , in 1 iterations and 7046 ms. Remains : 103/103 places, 99/99 transitions.
Built C files in :
/tmp/ltsmin15776777867753293115
[2024-05-28 07:16:29] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15776777867753293115
Running compilation step : cd /tmp/ltsmin15776777867753293115;'/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 240 ms.
Running link step : cd /tmp/ltsmin15776777867753293115;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin15776777867753293115;'/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/stateBased5152031214642568954.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 07:16:44] [INFO ] Flatten gal took : 20 ms
[2024-05-28 07:16:44] [INFO ] Flatten gal took : 15 ms
[2024-05-28 07:16:45] [INFO ] Time to serialize gal into /tmp/LTL2684249397851565048.gal : 2 ms
[2024-05-28 07:16:45] [INFO ] Time to serialize properties into /tmp/LTL3698408643285769426.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/LTL2684249397851565048.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4031699952602968097.hoa' '-atoms' '/tmp/LTL3698408643285769426.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/LTL3698408643285769426.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4031699952602968097.hoa
Detected timeout of ITS tools.
[2024-05-28 07:17:00] [INFO ] Flatten gal took : 9 ms
[2024-05-28 07:17:00] [INFO ] Flatten gal took : 7 ms
[2024-05-28 07:17:00] [INFO ] Time to serialize gal into /tmp/LTL14730309920543279107.gal : 1 ms
[2024-05-28 07:17:00] [INFO ] Time to serialize properties into /tmp/LTL10552397691700313569.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/LTL14730309920543279107.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10552397691700313569.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(F(((G((X(!("((((p36==1)&&(p40==1))&&(p51==1))||(!((p64==1)&&(p85==1))))")))U("((p64==1)&&(p85==1))")))||("(p58==0)"))||("(p72==0)...161
Formula 0 simplified : G(F(!"((p64==1)&&(p85==1))" & X(!"((p64==1)&&(p85==1))" W "((((p36==1)&&(p40==1))&&(p51==1))||(!((p64==1)&&(p85==1))))")) & FG(!"(p5...177
Detected timeout of ITS tools.
[2024-05-28 07:17:15] [INFO ] Flatten gal took : 14 ms
[2024-05-28 07:17:15] [INFO ] Applying decomposition
[2024-05-28 07:17:15] [INFO ] Flatten gal took : 6 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/graph8839318333490273007.txt' '-o' '/tmp/graph8839318333490273007.bin' '-w' '/tmp/graph8839318333490273007.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8839318333490273007.bin' '-l' '-1' '-v' '-w' '/tmp/graph8839318333490273007.weights' '-q' '0' '-e' '0.001'
[2024-05-28 07:17:15] [INFO ] Decomposing Gal with order
[2024-05-28 07:17:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 07:17:15] [INFO ] Removed a total of 64 redundant transitions.
[2024-05-28 07:17:15] [INFO ] Flatten gal took : 12 ms
[2024-05-28 07:17:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 66 labels/synchronizations in 5 ms.
[2024-05-28 07:17:15] [INFO ] Time to serialize gal into /tmp/LTL18113626329145395248.gal : 2 ms
[2024-05-28 07:17:15] [INFO ] Time to serialize properties into /tmp/LTL1324134687952875429.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/LTL18113626329145395248.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1324134687952875429.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F(((G((X(!("((((i1.i1.u13.p36==1)&&(i1.i1.u15.p40==1))&&(i1.i1.u18.p51==1))||(!((i2.i1.u24.p64==1)&&(i4.u31.p85==1))))")))U("((i2...245
Formula 0 simplified : G(F(!"((i2.i1.u24.p64==1)&&(i4.u31.p85==1))" & X(!"((i2.i1.u24.p64==1)&&(i4.u31.p85==1))" W "((((i1.i1.u13.p36==1)&&(i1.i1.u15.p40==...278
Detected timeout of ITS tools.
Treatment of property ShieldIIPs-PT-004A-LTLFireability-09 finished in 99115 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 99/99 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 103 transition count 98
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 102 transition count 98
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 101 transition count 97
Applied a total of 4 rules in 12 ms. Remains 101 /103 variables (removed 2) and now considering 97/99 (removed 2) transitions.
// Phase 1: matrix 97 rows 101 cols
[2024-05-28 07:17:30] [INFO ] Computed 37 invariants in 1 ms
[2024-05-28 07:17:30] [INFO ] Implicit Places using invariants in 69 ms returned [87]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 70 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 100/103 places, 97/99 transitions.
Applied a total of 0 rules in 4 ms. Remains 100 /100 variables (removed 0) and now considering 97/97 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 86 ms. Remains : 100/103 places, 97/99 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-004A-LTLFireability-10
Product exploration explored 100000 steps with 7094 reset in 171 ms.
Product exploration explored 100000 steps with 7043 reset in 158 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 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 82 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 77 steps (0 resets) in 4 ms. (15 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 97 rows 100 cols
[2024-05-28 07:17:31] [INFO ] Computed 36 invariants in 2 ms
[2024-05-28 07:17:31] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-28 07:17:31] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2024-05-28 07:17:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:17:31] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-28 07:17:31] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2024-05-28 07:17:31] [INFO ] Computed and/alt/rep : 90/325/90 causal constraints (skipped 6 transitions) in 9 ms.
[2024-05-28 07:17:31] [INFO ] Added : 58 causal constraints over 12 iterations in 156 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 97/97 transitions.
Applied a total of 0 rules in 8 ms. Remains 100 /100 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2024-05-28 07:17:31] [INFO ] Invariant cache hit.
[2024-05-28 07:17:31] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-28 07:17:31] [INFO ] Invariant cache hit.
[2024-05-28 07:17:31] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
[2024-05-28 07:17:31] [INFO ] Redundant transitions in 23 ms returned [91]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 95 sub problems to find dead transitions.
// Phase 1: matrix 96 rows 100 cols
[2024-05-28 07:17:31] [INFO ] Computed 36 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 99/99 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (OVERLAPS) 1/100 variables, 36/135 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-28 07:17:32] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-28 07:17:32] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-28 07:17:32] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-28 07:17:32] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 4/140 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (OVERLAPS) 96/196 variables, 100/240 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-28 07:17:33] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-28 07:17:33] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 2/242 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-28 07:17:33] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:17:33] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 2/244 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-28 07:17:33] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/196 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 11 (OVERLAPS) 0/196 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 245 constraints, problems are : Problem set: 0 solved, 95 unsolved in 2994 ms.
Refiners :[Domain max(s): 100/100 constraints, Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 99/99 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (OVERLAPS) 1/100 variables, 36/135 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 9/145 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (OVERLAPS) 96/196 variables, 100/245 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 95/340 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-28 07:17:36] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 10 (OVERLAPS) 0/196 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 341 constraints, problems are : Problem set: 0 solved, 95 unsolved in 4050 ms.
Refiners :[Domain max(s): 100/100 constraints, Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 10/10 constraints]
After SMT, in 7097ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 7099ms
Starting structural reductions in SI_LTL mode, iteration 1 : 100/100 places, 96/97 transitions.
Applied a total of 0 rules in 6 ms. Remains 100 /100 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7296 ms. Remains : 100/100 places, 96/97 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 69 steps (0 resets) in 4 ms. (13 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0), (NOT p0)]
[2024-05-28 07:17:39] [INFO ] Invariant cache hit.
[2024-05-28 07:17:39] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-28 07:17:39] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2024-05-28 07:17:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:17:39] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-28 07:17:39] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2024-05-28 07:17:39] [INFO ] Computed and/alt/rep : 90/330/90 causal constraints (skipped 5 transitions) in 7 ms.
[2024-05-28 07:17:39] [INFO ] Added : 89 causal constraints over 19 iterations in 261 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 7067 reset in 132 ms.
Product exploration explored 100000 steps with 7062 reset in 150 ms.
Built C files in :
/tmp/ltsmin13374403912888443678
[2024-05-28 07:17:40] [INFO ] Computing symmetric may disable matrix : 96 transitions.
[2024-05-28 07:17:40] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 07:17:40] [INFO ] Computing symmetric may enable matrix : 96 transitions.
[2024-05-28 07:17:40] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 07:17:40] [INFO ] Computing Do-Not-Accords matrix : 96 transitions.
[2024-05-28 07:17:40] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 07:17:40] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13374403912888443678
Running compilation step : cd /tmp/ltsmin13374403912888443678;'/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 233 ms.
Running link step : cd /tmp/ltsmin13374403912888443678;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin13374403912888443678;'/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/stateBased6585239066943186185.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 96/96 transitions.
Applied a total of 0 rules in 7 ms. Remains 100 /100 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2024-05-28 07:17:55] [INFO ] Invariant cache hit.
[2024-05-28 07:17:55] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-28 07:17:55] [INFO ] Invariant cache hit.
[2024-05-28 07:17:55] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
[2024-05-28 07:17:55] [INFO ] Redundant transitions in 20 ms returned []
Running 95 sub problems to find dead transitions.
[2024-05-28 07:17:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 99/99 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (OVERLAPS) 1/100 variables, 36/135 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-28 07:17:56] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:17:56] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-28 07:17:56] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2024-05-28 07:17:56] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 4/140 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (OVERLAPS) 96/196 variables, 100/240 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-28 07:17:56] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 0 ms to minimize.
[2024-05-28 07:17:56] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 2/242 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-28 07:17:57] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-28 07:17:57] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-28 07:17:58] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/196 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/196 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 12 (OVERLAPS) 0/196 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 245 constraints, problems are : Problem set: 0 solved, 95 unsolved in 3507 ms.
Refiners :[Domain max(s): 100/100 constraints, Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 99/99 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (OVERLAPS) 1/100 variables, 36/135 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 9/145 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (OVERLAPS) 96/196 variables, 100/245 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 95/340 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (OVERLAPS) 0/196 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 340 constraints, problems are : Problem set: 0 solved, 95 unsolved in 5720 ms.
Refiners :[Domain max(s): 100/100 constraints, Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 9/9 constraints]
After SMT, in 9253ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 9254ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 9479 ms. Remains : 100/100 places, 96/96 transitions.
Built C files in :
/tmp/ltsmin5642485079750221279
[2024-05-28 07:18:04] [INFO ] Computing symmetric may disable matrix : 96 transitions.
[2024-05-28 07:18:04] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 07:18:04] [INFO ] Computing symmetric may enable matrix : 96 transitions.
[2024-05-28 07:18:04] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 07:18:04] [INFO ] Computing Do-Not-Accords matrix : 96 transitions.
[2024-05-28 07:18:04] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 07:18:04] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5642485079750221279
Running compilation step : cd /tmp/ltsmin5642485079750221279;'/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 257 ms.
Running link step : cd /tmp/ltsmin5642485079750221279;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin5642485079750221279;'/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/stateBased10998143554488116407.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 07:18:19] [INFO ] Flatten gal took : 6 ms
[2024-05-28 07:18:19] [INFO ] Flatten gal took : 5 ms
[2024-05-28 07:18:19] [INFO ] Time to serialize gal into /tmp/LTL14168369885566703651.gal : 2 ms
[2024-05-28 07:18:19] [INFO ] Time to serialize properties into /tmp/LTL11948628373166333878.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/LTL14168369885566703651.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3636538973614651931.hoa' '-atoms' '/tmp/LTL11948628373166333878.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...319
Loading property file /tmp/LTL11948628373166333878.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3636538973614651931.hoa
Detected timeout of ITS tools.
[2024-05-28 07:18:34] [INFO ] Flatten gal took : 5 ms
[2024-05-28 07:18:34] [INFO ] Flatten gal took : 5 ms
[2024-05-28 07:18:34] [INFO ] Time to serialize gal into /tmp/LTL15447933727003481296.gal : 1 ms
[2024-05-28 07:18:34] [INFO ] Time to serialize properties into /tmp/LTL16889366829957204566.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/LTL15447933727003481296.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16889366829957204566.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(F("((p53==1)&&(p74==1))"))))
Formula 0 simplified : FG!"((p53==1)&&(p74==1))"
Detected timeout of ITS tools.
[2024-05-28 07:18:49] [INFO ] Flatten gal took : 9 ms
[2024-05-28 07:18:49] [INFO ] Applying decomposition
[2024-05-28 07:18:50] [INFO ] Flatten gal took : 10 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/graph1151286743840960581.txt' '-o' '/tmp/graph1151286743840960581.bin' '-w' '/tmp/graph1151286743840960581.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1151286743840960581.bin' '-l' '-1' '-v' '-w' '/tmp/graph1151286743840960581.weights' '-q' '0' '-e' '0.001'
[2024-05-28 07:18:50] [INFO ] Decomposing Gal with order
[2024-05-28 07:18:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 07:18:50] [INFO ] Removed a total of 59 redundant transitions.
[2024-05-28 07:18:50] [INFO ] Flatten gal took : 16 ms
[2024-05-28 07:18:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 9 ms.
[2024-05-28 07:18:50] [INFO ] Time to serialize gal into /tmp/LTL1882418676152265637.gal : 2 ms
[2024-05-28 07:18:50] [INFO ] Time to serialize properties into /tmp/LTL12371997062231654330.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/LTL1882418676152265637.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12371997062231654330.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F("((i4.i0.u19.p53==1)&&(i4.i1.u27.p74==1))"))))
Formula 0 simplified : FG!"((i4.i0.u19.p53==1)&&(i4.i1.u27.p74==1))"
Detected timeout of ITS tools.
Treatment of property ShieldIIPs-PT-004A-LTLFireability-10 finished in 94867 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 99/99 transitions.
Applied a total of 0 rules in 1 ms. Remains 103 /103 variables (removed 0) and now considering 99/99 (removed 0) transitions.
// Phase 1: matrix 99 rows 103 cols
[2024-05-28 07:19:05] [INFO ] Computed 37 invariants in 2 ms
[2024-05-28 07:19:05] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-28 07:19:05] [INFO ] Invariant cache hit.
[2024-05-28 07:19:05] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
Running 98 sub problems to find dead transitions.
[2024-05-28 07:19:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 37/139 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:19:06] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2024-05-28 07:19:06] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-28 07:19:06] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-28 07:19:06] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 4/144 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 99/202 variables, 103/247 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:19:06] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-28 07:19:06] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-28 07:19:06] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-28 07:19:07] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-28 07:19:07] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 5/252 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:19:07] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:19:08] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/202 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:19:08] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/202 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/202 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 13 (OVERLAPS) 0/202 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 255 constraints, problems are : Problem set: 0 solved, 98 unsolved in 4280 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 37/139 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 12/152 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 99/202 variables, 103/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 98/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (OVERLAPS) 0/202 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 353 constraints, problems are : Problem set: 0 solved, 98 unsolved in 2685 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 12/12 constraints]
After SMT, in 6982ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 6983ms
Finished structural reductions in LTL mode , in 1 iterations and 7160 ms. Remains : 103/103 places, 99/99 transitions.
Stuttering acceptance computed with spot in 103 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-004A-LTLFireability-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-004A-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-004A-LTLFireability-11 finished in 7288 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(p1)))'
Support contains 5 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 99/99 transitions.
Applied a total of 0 rules in 1 ms. Remains 103 /103 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2024-05-28 07:19:12] [INFO ] Invariant cache hit.
[2024-05-28 07:19:12] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-28 07:19:12] [INFO ] Invariant cache hit.
[2024-05-28 07:19:12] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
Running 98 sub problems to find dead transitions.
[2024-05-28 07:19:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 37/139 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:19:13] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-05-28 07:19:13] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-28 07:19:13] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 0 ms to minimize.
[2024-05-28 07:19:13] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 4/144 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 99/202 variables, 103/247 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:19:14] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-28 07:19:14] [INFO ] Deduced a trap composed of 9 places in 14 ms of which 1 ms to minimize.
[2024-05-28 07:19:14] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-28 07:19:14] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-28 07:19:14] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 5/252 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:19:14] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:19:15] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/202 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:19:15] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/202 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/202 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 13 (OVERLAPS) 0/202 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 255 constraints, problems are : Problem set: 0 solved, 98 unsolved in 4246 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 37/139 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 12/152 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 99/202 variables, 103/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 98/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (OVERLAPS) 0/202 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 353 constraints, problems are : Problem set: 0 solved, 98 unsolved in 2609 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 12/12 constraints]
After SMT, in 6869ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 6870ms
Finished structural reductions in LTL mode , in 1 iterations and 7029 ms. Remains : 103/103 places, 99/99 transitions.
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : ShieldIIPs-PT-004A-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-004A-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-004A-LTLFireability-12 finished in 7172 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(p0)&&G(p1)) U (G((X(p0)&&G(p1)))||(X(p0)&&G(p1)&&G((F(!p2)&&F(!p3))))))))'
Support contains 9 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 99/99 transitions.
Applied a total of 0 rules in 1 ms. Remains 103 /103 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2024-05-28 07:19:19] [INFO ] Invariant cache hit.
[2024-05-28 07:19:19] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-28 07:19:19] [INFO ] Invariant cache hit.
[2024-05-28 07:19:19] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
Running 98 sub problems to find dead transitions.
[2024-05-28 07:19:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 37/139 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:19:20] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2024-05-28 07:19:20] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-28 07:19:20] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2024-05-28 07:19:20] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 4/144 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 99/202 variables, 103/247 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:19:21] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-28 07:19:21] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 3 ms to minimize.
[2024-05-28 07:19:21] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-28 07:19:21] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-05-28 07:19:21] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 5/252 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:19:21] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:19:22] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/202 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:19:22] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/202 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/202 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 13 (OVERLAPS) 0/202 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 255 constraints, problems are : Problem set: 0 solved, 98 unsolved in 4181 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 37/139 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 12/152 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 99/202 variables, 103/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 98/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (OVERLAPS) 0/202 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 353 constraints, problems are : Problem set: 0 solved, 98 unsolved in 2546 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 12/12 constraints]
After SMT, in 6742ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 6743ms
Finished structural reductions in LTL mode , in 1 iterations and 6904 ms. Remains : 103/103 places, 99/99 transitions.
Stuttering acceptance computed with spot in 363 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (OR (AND p0 (NOT p1) p2) (AND p0 (NOT p1) p3) (AND (NOT p0) p1)), (NOT p1), p2, p3, (OR p2 p3), (OR (AND (NOT p0) p2) (AND (NOT p1) p2) (AND (NOT p1) p3) (AND (NOT p0) p3))]
Running random walk in product with property : ShieldIIPs-PT-004A-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-004A-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-004A-LTLFireability-13 finished in 7292 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0||F(p1)) U p2)))'
Support contains 5 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 99/99 transitions.
Applied a total of 0 rules in 1 ms. Remains 103 /103 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2024-05-28 07:19:26] [INFO ] Invariant cache hit.
[2024-05-28 07:19:26] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-28 07:19:26] [INFO ] Invariant cache hit.
[2024-05-28 07:19:27] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
Running 98 sub problems to find dead transitions.
[2024-05-28 07:19:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 37/139 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:19:27] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-05-28 07:19:27] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-28 07:19:27] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2024-05-28 07:19:27] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 4/144 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 99/202 variables, 103/247 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:19:28] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-28 07:19:28] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-05-28 07:19:28] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-05-28 07:19:28] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-28 07:19:28] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 5/252 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:19:28] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:19:29] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/202 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:19:30] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/202 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/202 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 13 (OVERLAPS) 0/202 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 255 constraints, problems are : Problem set: 0 solved, 98 unsolved in 4209 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 37/139 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 12/152 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 99/202 variables, 103/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 98/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (OVERLAPS) 0/202 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 353 constraints, problems are : Problem set: 0 solved, 98 unsolved in 2663 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 12/12 constraints]
After SMT, in 6889ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 6890ms
Finished structural reductions in LTL mode , in 1 iterations and 7044 ms. Remains : 103/103 places, 99/99 transitions.
Stuttering acceptance computed with spot in 137 ms :[(NOT p2), (NOT p2), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-004A-LTLFireability-14
Stuttering criterion allowed to conclude after 10271 steps with 218 reset in 24 ms.
FORMULA ShieldIIPs-PT-004A-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-004A-LTLFireability-14 finished in 7217 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 3 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 99/99 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 103 transition count 98
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 102 transition count 98
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 101 transition count 97
Applied a total of 4 rules in 17 ms. Remains 101 /103 variables (removed 2) and now considering 97/99 (removed 2) transitions.
// Phase 1: matrix 97 rows 101 cols
[2024-05-28 07:19:34] [INFO ] Computed 37 invariants in 2 ms
[2024-05-28 07:19:34] [INFO ] Implicit Places using invariants in 65 ms returned [87]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 66 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 100/103 places, 97/99 transitions.
Applied a total of 0 rules in 2 ms. Remains 100 /100 variables (removed 0) and now considering 97/97 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 85 ms. Remains : 100/103 places, 97/99 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-004A-LTLFireability-15
Product exploration explored 100000 steps with 50000 reset in 146 ms.
Product exploration explored 100000 steps with 50000 reset in 158 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 17 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-004A-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-004A-LTLFireability-15 finished in 450 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(X(F(p1))))))'
Found a Shortening insensitive property : ShieldIIPs-PT-004A-LTLFireability-08
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 103 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 103/103 places, 99/99 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 102 transition count 97
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 100 transition count 97
Applied a total of 3 rules in 6 ms. Remains 100 /103 variables (removed 3) and now considering 97/99 (removed 2) transitions.
// Phase 1: matrix 97 rows 100 cols
[2024-05-28 07:19:34] [INFO ] Computed 36 invariants in 0 ms
[2024-05-28 07:19:34] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-28 07:19:34] [INFO ] Invariant cache hit.
[2024-05-28 07:19:34] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2024-05-28 07:19:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 36/136 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:19:35] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-28 07:19:35] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-05-28 07:19:35] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-28 07:19:35] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 4/140 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 97/197 variables, 100/240 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:19:35] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-05-28 07:19:36] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-05-28 07:19:36] [INFO ] Deduced a trap composed of 8 places in 15 ms of which 1 ms to minimize.
[2024-05-28 07:19:36] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 2 ms to minimize.
[2024-05-28 07:19:36] [INFO ] Deduced a trap composed of 8 places in 14 ms of which 1 ms to minimize.
[2024-05-28 07:19:36] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 6/246 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:19:36] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:19:37] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/197 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/197 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (OVERLAPS) 0/197 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 248 constraints, problems are : Problem set: 0 solved, 96 unsolved in 3364 ms.
Refiners :[Domain max(s): 100/100 constraints, Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 36/136 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 12/148 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 97/197 variables, 100/248 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 96/344 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 0/197 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 344 constraints, problems are : Problem set: 0 solved, 96 unsolved in 4431 ms.
Refiners :[Domain max(s): 100/100 constraints, Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 12/12 constraints]
After SMT, in 7834ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 7835ms
Starting structural reductions in LI_LTL mode, iteration 1 : 100/103 places, 97/99 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 7990 ms. Remains : 100/103 places, 97/99 transitions.
Running random walk in product with property : ShieldIIPs-PT-004A-LTLFireability-08
Product exploration explored 100000 steps with 3865 reset in 154 ms.
Product exploration explored 100000 steps with 3865 reset in 182 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 (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 81 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 5216 steps (21 resets) in 21 ms. (237 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F p1), (F p0)]
Knowledge based reduction with 5 factoid took 173 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2024-05-28 07:19:43] [INFO ] Invariant cache hit.
[2024-05-28 07:19:43] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-28 07:19:43] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2024-05-28 07:19:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:19:43] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-28 07:19:43] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2024-05-28 07:19:43] [INFO ] Computed and/alt/rep : 96/237/96 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-28 07:19:44] [INFO ] Added : 96 causal constraints over 20 iterations in 268 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Support contains 4 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 97/97 transitions.
Applied a total of 0 rules in 1 ms. Remains 100 /100 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2024-05-28 07:19:44] [INFO ] Invariant cache hit.
[2024-05-28 07:19:44] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-28 07:19:44] [INFO ] Invariant cache hit.
[2024-05-28 07:19:44] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2024-05-28 07:19:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 36/136 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:19:44] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-05-28 07:19:44] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-28 07:19:44] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-28 07:19:44] [INFO ] Deduced a trap composed of 7 places in 15 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 4/140 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 97/197 variables, 100/240 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:19:45] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-28 07:19:45] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
[2024-05-28 07:19:45] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
[2024-05-28 07:19:45] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
[2024-05-28 07:19:45] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-05-28 07:19:45] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 6/246 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:19:46] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:19:46] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/197 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/197 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (OVERLAPS) 0/197 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 248 constraints, problems are : Problem set: 0 solved, 96 unsolved in 3396 ms.
Refiners :[Domain max(s): 100/100 constraints, Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 36/136 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 12/148 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 97/197 variables, 100/248 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 96/344 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 0/197 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 344 constraints, problems are : Problem set: 0 solved, 96 unsolved in 4469 ms.
Refiners :[Domain max(s): 100/100 constraints, Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 12/12 constraints]
After SMT, in 7882ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 7886ms
Finished structural reductions in LTL mode , in 1 iterations and 8040 ms. Remains : 100/100 places, 97/97 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 p1) (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 93 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 1555 steps (4 resets) in 13 ms. (111 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 4 factoid took 128 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-28 07:19:52] [INFO ] Invariant cache hit.
[2024-05-28 07:19:52] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-28 07:19:52] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2024-05-28 07:19:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:19:53] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-28 07:19:53] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2024-05-28 07:19:53] [INFO ] Computed and/alt/rep : 96/237/96 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-28 07:19:53] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 0 ms to minimize.
[2024-05-28 07:19:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2024-05-28 07:19:53] [INFO ] Added : 96 causal constraints over 22 iterations in 340 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 3959 reset in 157 ms.
Product exploration explored 100000 steps with 3915 reset in 169 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 97/97 transitions.
Applied a total of 0 rules in 5 ms. Remains 100 /100 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2024-05-28 07:19:54] [INFO ] Redundant transitions in 20 ms returned [96]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT only with invariants) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 95 sub problems to find dead transitions.
// Phase 1: matrix 96 rows 100 cols
[2024-05-28 07:19:54] [INFO ] Computed 36 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 36/136 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-28 07:19:54] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-05-28 07:19:54] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 2 ms to minimize.
[2024-05-28 07:19:54] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-28 07:19:54] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 4/140 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (OVERLAPS) 96/196 variables, 100/240 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-28 07:19:55] [INFO ] Deduced a trap composed of 8 places in 17 ms of which 0 ms to minimize.
[2024-05-28 07:19:55] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-28 07:19:55] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2024-05-28 07:19:55] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 4/244 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-28 07:19:55] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-28 07:19:55] [INFO ] Deduced a trap composed of 8 places in 15 ms of which 0 ms to minimize.
[2024-05-28 07:19:55] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 3/247 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-28 07:19:56] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-28 07:19:56] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 10 (OVERLAPS) 0/196 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 249 constraints, problems are : Problem set: 0 solved, 95 unsolved in 3325 ms.
Refiners :[Domain max(s): 100/100 constraints, Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 36/136 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 13/149 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (OVERLAPS) 96/196 variables, 100/249 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 95/344 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-28 07:19:58] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-28 07:19:58] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/196 variables, 2/346 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (OVERLAPS) 0/196 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 346 constraints, problems are : Problem set: 0 solved, 95 unsolved in 5832 ms.
Refiners :[Domain max(s): 100/100 constraints, Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 15/15 constraints]
After SMT, in 9185ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 9186ms
Starting structural reductions in SI_LTL mode, iteration 1 : 100/100 places, 96/97 transitions.
Applied a total of 0 rules in 2 ms. Remains 100 /100 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 9221 ms. Remains : 100/100 places, 96/97 transitions.
Built C files in :
/tmp/ltsmin2095554803046166127
[2024-05-28 07:20:03] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2095554803046166127
Running compilation step : cd /tmp/ltsmin2095554803046166127;'/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 223 ms.
Running link step : cd /tmp/ltsmin2095554803046166127;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin2095554803046166127;'/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/stateBased17334299619654431330.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 97/97 transitions.
Applied a total of 0 rules in 1 ms. Remains 100 /100 variables (removed 0) and now considering 97/97 (removed 0) transitions.
// Phase 1: matrix 97 rows 100 cols
[2024-05-28 07:20:18] [INFO ] Computed 36 invariants in 0 ms
[2024-05-28 07:20:18] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-28 07:20:18] [INFO ] Invariant cache hit.
[2024-05-28 07:20:18] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2024-05-28 07:20:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 36/136 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:20:18] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:20:18] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-28 07:20:19] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-28 07:20:19] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 4/140 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 97/197 variables, 100/240 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:20:19] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-28 07:20:19] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2024-05-28 07:20:19] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 0 ms to minimize.
[2024-05-28 07:20:19] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
[2024-05-28 07:20:19] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
[2024-05-28 07:20:19] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 6/246 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:20:20] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:20:20] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/197 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/197 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (OVERLAPS) 0/197 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 248 constraints, problems are : Problem set: 0 solved, 96 unsolved in 3368 ms.
Refiners :[Domain max(s): 100/100 constraints, Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 36/136 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 12/148 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 97/197 variables, 100/248 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 96/344 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 0/197 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 344 constraints, problems are : Problem set: 0 solved, 96 unsolved in 4512 ms.
Refiners :[Domain max(s): 100/100 constraints, Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 12/12 constraints]
After SMT, in 7899ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 7900ms
Finished structural reductions in LTL mode , in 1 iterations and 8085 ms. Remains : 100/100 places, 97/97 transitions.
Built C files in :
/tmp/ltsmin9312785090328020633
[2024-05-28 07:20:26] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9312785090328020633
Running compilation step : cd /tmp/ltsmin9312785090328020633;'/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 212 ms.
Running link step : cd /tmp/ltsmin9312785090328020633;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin9312785090328020633;'/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/stateBased15725135893408913118.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 07:20:41] [INFO ] Flatten gal took : 7 ms
[2024-05-28 07:20:41] [INFO ] Flatten gal took : 5 ms
[2024-05-28 07:20:41] [INFO ] Time to serialize gal into /tmp/LTL12743305311340927612.gal : 1 ms
[2024-05-28 07:20:41] [INFO ] Time to serialize properties into /tmp/LTL1761863135179693017.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/LTL12743305311340927612.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15115400646490443768.hoa' '-atoms' '/tmp/LTL1761863135179693017.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...319
Loading property file /tmp/LTL1761863135179693017.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15115400646490443768.hoa
Detected timeout of ITS tools.
[2024-05-28 07:20:56] [INFO ] Flatten gal took : 5 ms
[2024-05-28 07:20:56] [INFO ] Flatten gal took : 4 ms
[2024-05-28 07:20:56] [INFO ] Time to serialize gal into /tmp/LTL17846591574977525354.gal : 1 ms
[2024-05-28 07:20:56] [INFO ] Time to serialize properties into /tmp/LTL1573355227792938137.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/LTL17846591574977525354.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1573355227792938137.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((X(X(F("(p89==1)"))))||("(((p63==1)&&(p71==1))&&(p75==1))"))))
Formula 0 simplified : G(!"(((p63==1)&&(p71==1))&&(p75==1))" & XXG!"(p89==1)")
Detected timeout of ITS tools.
[2024-05-28 07:21:11] [INFO ] Flatten gal took : 10 ms
[2024-05-28 07:21:11] [INFO ] Applying decomposition
[2024-05-28 07:21:11] [INFO ] Flatten gal took : 6 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/graph15911011537264253511.txt' '-o' '/tmp/graph15911011537264253511.bin' '-w' '/tmp/graph15911011537264253511.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15911011537264253511.bin' '-l' '-1' '-v' '-w' '/tmp/graph15911011537264253511.weights' '-q' '0' '-e' '0.001'
[2024-05-28 07:21:11] [INFO ] Decomposing Gal with order
[2024-05-28 07:21:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 07:21:11] [INFO ] Removed a total of 61 redundant transitions.
[2024-05-28 07:21:11] [INFO ] Flatten gal took : 8 ms
[2024-05-28 07:21:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 66 labels/synchronizations in 2 ms.
[2024-05-28 07:21:11] [INFO ] Time to serialize gal into /tmp/LTL15955194785663271671.gal : 1 ms
[2024-05-28 07:21:11] [INFO ] Time to serialize properties into /tmp/LTL4135281409992687964.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/LTL15955194785663271671.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4135281409992687964.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((X(X(F("(i3.u32.p89==1)"))))||("(((i2.i2.u23.p63==1)&&(i2.i2.u26.p71==1))&&(i2.i2.u27.p75==1))"))))
Formula 0 simplified : G(!"(((i2.i2.u23.p63==1)&&(i2.i2.u26.p71==1))&&(i2.i2.u27.p75==1))" & XXG!"(i3.u32.p89==1)")
Detected timeout of ITS tools.
Treatment of property ShieldIIPs-PT-004A-LTLFireability-08 finished in 112250 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G((X(!p1) U p2))||p0))))'
Found a Lengthening insensitive property : ShieldIIPs-PT-004A-LTLFireability-09
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 7 out of 103 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 103/103 places, 99/99 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 103 transition count 98
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 102 transition count 98
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 101 transition count 97
Applied a total of 4 rules in 4 ms. Remains 101 /103 variables (removed 2) and now considering 97/99 (removed 2) transitions.
// Phase 1: matrix 97 rows 101 cols
[2024-05-28 07:21:27] [INFO ] Computed 37 invariants in 1 ms
[2024-05-28 07:21:27] [INFO ] Implicit Places using invariants in 60 ms returned [87]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 60 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 100/103 places, 97/99 transitions.
Applied a total of 0 rules in 17 ms. Remains 100 /100 variables (removed 0) and now considering 97/97 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 81 ms. Remains : 100/103 places, 97/99 transitions.
Running random walk in product with property : ShieldIIPs-PT-004A-LTLFireability-09
Product exploration explored 100000 steps with 836 reset in 188 ms.
Product exploration explored 100000 steps with 866 reset in 209 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 119 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 237 steps (0 resets) in 6 ms. (33 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F p2), (F (NOT (OR p2 p0))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 11 factoid took 241 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 7 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 97/97 transitions.
Applied a total of 0 rules in 0 ms. Remains 100 /100 variables (removed 0) and now considering 97/97 (removed 0) transitions.
// Phase 1: matrix 97 rows 100 cols
[2024-05-28 07:21:28] [INFO ] Computed 36 invariants in 0 ms
[2024-05-28 07:21:28] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-28 07:21:28] [INFO ] Invariant cache hit.
[2024-05-28 07:21:28] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2024-05-28 07:21:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 99/99 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 1/100 variables, 36/135 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:21:29] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-28 07:21:29] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-28 07:21:29] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-05-28 07:21:29] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 4/140 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 97/197 variables, 100/240 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:21:29] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-28 07:21:30] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:21:30] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
[2024-05-28 07:21:30] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 5 ms to minimize.
[2024-05-28 07:21:30] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 1 ms to minimize.
[2024-05-28 07:21:30] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 6/246 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:21:30] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-05-28 07:21:30] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-05-28 07:21:30] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
[2024-05-28 07:21:30] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/197 variables, 4/250 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/197 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:21:31] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/197 variables, 1/251 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:21:32] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/197 variables, 1/252 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/197 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:21:32] [INFO ] Deduced a trap composed of 9 places in 17 ms of which 0 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/197 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/197 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 16 (OVERLAPS) 0/197 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 253 constraints, problems are : Problem set: 0 solved, 96 unsolved in 5599 ms.
Refiners :[Domain max(s): 100/100 constraints, Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 99/99 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 1/100 variables, 36/135 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 17/153 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 97/197 variables, 100/253 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 96/349 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (OVERLAPS) 0/197 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 349 constraints, problems are : Problem set: 0 solved, 96 unsolved in 3588 ms.
Refiners :[Domain max(s): 100/100 constraints, Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 17/17 constraints]
After SMT, in 9216ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 9218ms
Finished structural reductions in LTL mode , in 1 iterations and 9381 ms. Remains : 100/100 places, 97/97 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 133 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 375 steps (0 resets) in 12 ms. (28 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F p2), (F (NOT (OR p2 p0))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 11 factoid took 256 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 841 reset in 196 ms.
Product exploration explored 100000 steps with 862 reset in 219 ms.
Built C files in :
/tmp/ltsmin7800848695702737838
[2024-05-28 07:21:39] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7800848695702737838
Running compilation step : cd /tmp/ltsmin7800848695702737838;'/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 205 ms.
Running link step : cd /tmp/ltsmin7800848695702737838;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin7800848695702737838;'/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/stateBased17172354404597817038.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 7 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 97/97 transitions.
Applied a total of 0 rules in 2 ms. Remains 100 /100 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2024-05-28 07:21:54] [INFO ] Invariant cache hit.
[2024-05-28 07:21:54] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-28 07:21:54] [INFO ] Invariant cache hit.
[2024-05-28 07:21:54] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2024-05-28 07:21:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 99/99 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 1/100 variables, 36/135 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:21:54] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-28 07:21:55] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 0 ms to minimize.
[2024-05-28 07:21:55] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-28 07:21:55] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 4/140 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 97/197 variables, 100/240 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:21:55] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-28 07:21:55] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
[2024-05-28 07:21:55] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-28 07:21:55] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-28 07:21:55] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 0 ms to minimize.
[2024-05-28 07:21:56] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 6/246 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:21:56] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:21:56] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-28 07:21:56] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2024-05-28 07:21:56] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/197 variables, 4/250 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/197 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:21:57] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/197 variables, 1/251 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:21:57] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/197 variables, 1/252 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/197 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:21:58] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/197 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/197 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 16 (OVERLAPS) 0/197 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 253 constraints, problems are : Problem set: 0 solved, 96 unsolved in 5527 ms.
Refiners :[Domain max(s): 100/100 constraints, Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 99/99 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 1/100 variables, 36/135 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 17/153 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 97/197 variables, 100/253 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 96/349 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (OVERLAPS) 0/197 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 349 constraints, problems are : Problem set: 0 solved, 96 unsolved in 3590 ms.
Refiners :[Domain max(s): 100/100 constraints, Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 17/17 constraints]
After SMT, in 9139ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 9140ms
Finished structural reductions in LTL mode , in 1 iterations and 9300 ms. Remains : 100/100 places, 97/97 transitions.
Built C files in :
/tmp/ltsmin671860261069838036
[2024-05-28 07:22:03] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin671860261069838036
Running compilation step : cd /tmp/ltsmin671860261069838036;'/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 216 ms.
Running link step : cd /tmp/ltsmin671860261069838036;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin671860261069838036;'/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/stateBased11471147106691376030.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 07:22:18] [INFO ] Flatten gal took : 5 ms
[2024-05-28 07:22:18] [INFO ] Flatten gal took : 4 ms
[2024-05-28 07:22:18] [INFO ] Time to serialize gal into /tmp/LTL11902934597733172481.gal : 1 ms
[2024-05-28 07:22:18] [INFO ] Time to serialize properties into /tmp/LTL2478250566986407586.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/LTL11902934597733172481.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16647190211360672200.hoa' '-atoms' '/tmp/LTL2478250566986407586.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...319
Loading property file /tmp/LTL2478250566986407586.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16647190211360672200.hoa
Detected timeout of ITS tools.
[2024-05-28 07:22:33] [INFO ] Flatten gal took : 3 ms
[2024-05-28 07:22:33] [INFO ] Flatten gal took : 3 ms
[2024-05-28 07:22:33] [INFO ] Time to serialize gal into /tmp/LTL13471017137633247750.gal : 1 ms
[2024-05-28 07:22:33] [INFO ] Time to serialize properties into /tmp/LTL14788167964447468634.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/LTL13471017137633247750.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14788167964447468634.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(F(((G((X(!("((((p36==1)&&(p40==1))&&(p51==1))||(!((p64==1)&&(p85==1))))")))U("((p64==1)&&(p85==1))")))||("(p58==0)"))||("(p72==0)...161
Formula 0 simplified : G(F(!"((p64==1)&&(p85==1))" & X(!"((p64==1)&&(p85==1))" W "((((p36==1)&&(p40==1))&&(p51==1))||(!((p64==1)&&(p85==1))))")) & FG(!"(p5...177
Detected timeout of ITS tools.
[2024-05-28 07:22:48] [INFO ] Flatten gal took : 7 ms
[2024-05-28 07:22:48] [INFO ] Applying decomposition
[2024-05-28 07:22:48] [INFO ] Flatten gal took : 6 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/graph1447407930475108949.txt' '-o' '/tmp/graph1447407930475108949.bin' '-w' '/tmp/graph1447407930475108949.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1447407930475108949.bin' '-l' '-1' '-v' '-w' '/tmp/graph1447407930475108949.weights' '-q' '0' '-e' '0.001'
[2024-05-28 07:22:48] [INFO ] Decomposing Gal with order
[2024-05-28 07:22:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 07:22:48] [INFO ] Removed a total of 61 redundant transitions.
[2024-05-28 07:22:48] [INFO ] Flatten gal took : 12 ms
[2024-05-28 07:22:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 68 labels/synchronizations in 3 ms.
[2024-05-28 07:22:48] [INFO ] Time to serialize gal into /tmp/LTL12175096757028192837.gal : 2 ms
[2024-05-28 07:22:48] [INFO ] Time to serialize properties into /tmp/LTL16236680165299503191.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/LTL12175096757028192837.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16236680165299503191.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 : !((G(F(((G((X(!("((((i1.u13.p36==1)&&(i1.u15.p40==1))&&(i2.i1.u18.p51==1))||(!((i3.i0.u24.p64==1)&&(i5.i1.u31.p85==1))))")))U("((i3.i0...239
Formula 0 simplified : G(F(!"((i3.i0.u24.p64==1)&&(i5.i1.u31.p85==1))" & X(!"((i3.i0.u24.p64==1)&&(i5.i1.u31.p85==1))" W "((((i1.u13.p36==1)&&(i1.u15.p40==...275
Detected timeout of ITS tools.
Treatment of property ShieldIIPs-PT-004A-LTLFireability-09 finished in 96977 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2024-05-28 07:23:03] [INFO ] Flatten gal took : 4 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4812258858668932021
[2024-05-28 07:23:03] [INFO ] Applying decomposition
[2024-05-28 07:23:03] [INFO ] Flatten gal took : 4 ms
[2024-05-28 07:23:03] [INFO ] Computing symmetric may disable matrix : 99 transitions.
[2024-05-28 07:23:03] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 07:23:03] [INFO ] Computing symmetric may enable matrix : 99 transitions.
[2024-05-28 07:23:03] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 07:23:03] [INFO ] Computing Do-Not-Accords matrix : 99 transitions.
[2024-05-28 07:23:03] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 07:23:03] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4812258858668932021
Running compilation step : cd /tmp/ltsmin4812258858668932021;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12042516145763800144.txt' '-o' '/tmp/graph12042516145763800144.bin' '-w' '/tmp/graph12042516145763800144.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12042516145763800144.bin' '-l' '-1' '-v' '-w' '/tmp/graph12042516145763800144.weights' '-q' '0' '-e' '0.001'
[2024-05-28 07:23:03] [INFO ] Decomposing Gal with order
[2024-05-28 07:23:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 07:23:03] [INFO ] Removed a total of 64 redundant transitions.
[2024-05-28 07:23:03] [INFO ] Flatten gal took : 7 ms
[2024-05-28 07:23:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 66 labels/synchronizations in 3 ms.
[2024-05-28 07:23:03] [INFO ] Time to serialize gal into /tmp/LTLFireability11267878524018659618.gal : 2 ms
[2024-05-28 07:23:03] [INFO ] Time to serialize properties into /tmp/LTLFireability14599499886839453505.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/LTLFireability11267878524018659618.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14599499886839453505.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...278
Read 3 LTL properties
Checking formula 0 : !((F(("(((i2.i2.u23.p63==1)&&(i2.i2.u26.p71==1))&&(i2.i2.u27.p75==1))")||(X(X(F("(i3.u33.p89==1)")))))))
Formula 0 simplified : G(!"(((i2.i2.u23.p63==1)&&(i2.i2.u26.p71==1))&&(i2.i2.u27.p75==1))" & XXG!"(i3.u33.p89==1)")
Compilation finished in 257 ms.
Running link step : cd /tmp/ltsmin4812258858668932021;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin4812258858668932021;'/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' '<>(((LTLAPp0==true)||X(X(<>((LTLAPp1==true))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin4812258858668932021;'/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' '<>(((LTLAPp0==true)||X(X(<>((LTLAPp1==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin4812258858668932021;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(([]((X(!(LTLAPp3==true)) U (LTLAPp4==true)))||(LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin4812258858668932021;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(([]((X(!(LTLAPp3==true)) U (LTLAPp4==true)))||(LTLAPp2==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin4812258858668932021;'/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)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin4812258858668932021;'/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)))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 9600 s
Running LTSmin : cd /tmp/ltsmin4812258858668932021;'/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' '<>(((LTLAPp0==true)||X(X(<>((LTLAPp1==true))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-28 07:46:31] [INFO ] Applying decomposition
[2024-05-28 07:46:31] [INFO ] Flatten gal took : 4 ms
[2024-05-28 07:46:31] [INFO ] Decomposing Gal with order
[2024-05-28 07:46:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 07:46:31] [INFO ] Removed a total of 68 redundant transitions.
[2024-05-28 07:46:31] [INFO ] Flatten gal took : 27 ms
[2024-05-28 07:46:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 2 ms.
[2024-05-28 07:46:31] [INFO ] Time to serialize gal into /tmp/LTLFireability6195818784903292535.gal : 3 ms
[2024-05-28 07:46:31] [INFO ] Time to serialize properties into /tmp/LTLFireability5939689770840616787.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/LTLFireability6195818784903292535.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5939689770840616787.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 3 LTL properties
Checking formula 0 : !((F(("(((u27.p63==1)&&(u30.p71==1))&&(u31.p75==1))")||(X(X(F("(u38.p89==1)")))))))
Formula 0 simplified : G(!"(((u27.p63==1)&&(u30.p71==1))&&(u31.p75==1))" & XXG!"(u38.p89==1)")
Reverse transition relation is NOT exact ! Due to transitions t40, t41, t46, t48, t55, t57, t66, t67, t70, t71, t80, t82, t85, t86, t95, t98, u8.t1, u8.t2,...488
Computing Next relation with stutter on 7520 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
30993 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,309.944,2692852,1,0,5.0927e+06,169,512,1.18168e+07,71,346,684419
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ShieldIIPs-PT-004A-LTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(F(((G((X(!("((((u16.p36==1)&&(u18.p40==1))&&(u21.p51==1))||(!((u28.p64==1)&&(u36.p85==1))))")))U("((u28.p64==1)&&(u36.p85==1))"))...201
Formula 1 simplified : G(F(!"((u28.p64==1)&&(u36.p85==1))" & X(!"((u28.p64==1)&&(u36.p85==1))" W "((((u16.p36==1)&&(u18.p40==1))&&(u21.p51==1))||(!((u28.p6...225
Computing Next relation with stutter on 7520 deadlock states
Detected timeout of ITS tools.
[2024-05-28 08:09:59] [INFO ] Flatten gal took : 5 ms
[2024-05-28 08:09:59] [INFO ] Input system was already deterministic with 99 transitions.
[2024-05-28 08:09:59] [INFO ] Transformed 103 places.
[2024-05-28 08:09:59] [INFO ] Transformed 99 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-28 08:09:59] [INFO ] Time to serialize gal into /tmp/LTLFireability15927228040123183361.gal : 54 ms
[2024-05-28 08:09:59] [INFO ] Time to serialize properties into /tmp/LTLFireability2643233682258495212.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/LTLFireability15927228040123183361.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2643233682258495212.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F(((G((X(!("((((p36==1)&&(p40==1))&&(p51==1))||(!((p64==1)&&(p85==1))))")))U("((p64==1)&&(p85==1))")))||("(p58==0)"))||("(p72==0)...161
Formula 0 simplified : G(F(!"((p64==1)&&(p85==1))" & X(!"((p64==1)&&(p85==1))" W "((((p36==1)&&(p40==1))&&(p51==1))||(!((p64==1)&&(p85==1))))")) & FG(!"(p5...177

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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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="ShieldIIPs-PT-004A"
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 ShieldIIPs-PT-004A, 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-171683760200052"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-004A.tgz
mv ShieldIIPs-PT-004A 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 ;