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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 18K May 19 19:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 14:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K Apr 11 14:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 11 14:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 11 14:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 42K 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-005A-LTLFireability-00
FORMULA_NAME ShieldIIPs-PT-005A-LTLFireability-01
FORMULA_NAME ShieldIIPs-PT-005A-LTLFireability-02
FORMULA_NAME ShieldIIPs-PT-005A-LTLFireability-03
FORMULA_NAME ShieldIIPs-PT-005A-LTLFireability-04
FORMULA_NAME ShieldIIPs-PT-005A-LTLFireability-05
FORMULA_NAME ShieldIIPs-PT-005A-LTLFireability-06
FORMULA_NAME ShieldIIPs-PT-005A-LTLFireability-07
FORMULA_NAME ShieldIIPs-PT-005A-LTLFireability-08
FORMULA_NAME ShieldIIPs-PT-005A-LTLFireability-09
FORMULA_NAME ShieldIIPs-PT-005A-LTLFireability-10
FORMULA_NAME ShieldIIPs-PT-005A-LTLFireability-11
FORMULA_NAME ShieldIIPs-PT-005A-LTLFireability-12
FORMULA_NAME ShieldIIPs-PT-005A-LTLFireability-13
FORMULA_NAME ShieldIIPs-PT-005A-LTLFireability-14
FORMULA_NAME ShieldIIPs-PT-005A-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716885483214

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-005A
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-28 08:38:04] [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 08:38:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 08:38:04] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2024-05-28 08:38:04] [INFO ] Transformed 128 places.
[2024-05-28 08:38:04] [INFO ] Transformed 123 transitions.
[2024-05-28 08:38:04] [INFO ] Found NUPN structural information;
[2024-05-28 08:38:04] [INFO ] Parsed PT model containing 128 places and 123 transitions and 546 arcs in 158 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA ShieldIIPs-PT-005A-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 123/123 transitions.
Applied a total of 0 rules in 11 ms. Remains 128 /128 variables (removed 0) and now considering 123/123 (removed 0) transitions.
// Phase 1: matrix 123 rows 128 cols
[2024-05-28 08:38:04] [INFO ] Computed 46 invariants in 15 ms
[2024-05-28 08:38:04] [INFO ] Implicit Places using invariants in 245 ms returned []
[2024-05-28 08:38:04] [INFO ] Invariant cache hit.
[2024-05-28 08:38:05] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 405 ms to find 0 implicit places.
Running 122 sub problems to find dead transitions.
[2024-05-28 08:38:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 46/173 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 08:38:06] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 7 ms to minimize.
[2024-05-28 08:38:06] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-28 08:38:06] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-05-28 08:38:06] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-28 08:38:06] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 5/179 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 123/251 variables, 128/307 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 08:38:07] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 08:38:08] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2024-05-28 08:38:08] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2024-05-28 08:38:08] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 3/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 0/251 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 251/251 variables, and 311 constraints, problems are : Problem set: 0 solved, 122 unsolved in 4609 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 46/173 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 9/183 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 123/251 variables, 128/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 122/433 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 08:38:11] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 0/251 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 251/251 variables, and 434 constraints, problems are : Problem set: 0 solved, 122 unsolved in 5568 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 10/10 constraints]
After SMT, in 10241ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 10253ms
Finished structural reductions in LTL mode , in 1 iterations and 10687 ms. Remains : 128/128 places, 123/123 transitions.
Support contains 43 out of 128 places after structural reductions.
[2024-05-28 08:38:15] [INFO ] Flatten gal took : 34 ms
[2024-05-28 08:38:15] [INFO ] Flatten gal took : 15 ms
[2024-05-28 08:38:15] [INFO ] Input system was already deterministic with 123 transitions.
Reduction of identical properties reduced properties to check from 29 to 27
RANDOM walk for 40000 steps (135 resets) in 1167 ms. (34 steps per ms) remains 1/27 properties
BEST_FIRST walk for 40004 steps (12 resets) in 189 ms. (210 steps per ms) remains 1/1 properties
[2024-05-28 08:38:16] [INFO ] Invariant cache hit.
Problem AtomicPropp12 is UNSAT
After SMT solving in domain Real declared 1/251 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 18 ms.
Refiners :[Domain max(s): 0/128 constraints, Positive P Invariants (semi-flows): 0/46 constraints, State Equation: 0/128 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 20ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
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' '!(F(G(p0)))'
Support contains 3 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 123/123 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 127 transition count 122
Applied a total of 2 rules in 23 ms. Remains 127 /128 variables (removed 1) and now considering 122/123 (removed 1) transitions.
// Phase 1: matrix 122 rows 127 cols
[2024-05-28 08:38:16] [INFO ] Computed 46 invariants in 6 ms
[2024-05-28 08:38:16] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-28 08:38:16] [INFO ] Invariant cache hit.
[2024-05-28 08:38:16] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
[2024-05-28 08:38:16] [INFO ] Redundant transitions in 24 ms returned []
Running 121 sub problems to find dead transitions.
[2024-05-28 08:38:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 46/172 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 08:38:17] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
[2024-05-28 08:38:17] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 0 ms to minimize.
[2024-05-28 08:38:17] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-28 08:38:17] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 0 ms to minimize.
[2024-05-28 08:38:17] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 5/178 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (OVERLAPS) 122/249 variables, 127/305 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 08:38:18] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-05-28 08:38:18] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-28 08:38:19] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2024-05-28 08:38:19] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-05-28 08:38:19] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/249 variables, 5/310 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 08:38:19] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/249 variables, 1/311 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 08:38:20] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/249 variables, 1/312 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 08:38:20] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-05-28 08:38:20] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/249 variables, 2/314 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/249 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 12 (OVERLAPS) 0/249 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/249 variables, and 314 constraints, problems are : Problem set: 0 solved, 121 unsolved in 5817 ms.
Refiners :[Domain max(s): 127/127 constraints, Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 46/172 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 14/187 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (OVERLAPS) 122/249 variables, 127/314 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/249 variables, 121/435 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 08:38:25] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/249 variables, 1/436 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 08:38:26] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/249 variables, 1/437 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 08:38:30] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/249 variables, 1/438 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/249 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 08:38:35] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/249 variables, 1/439 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/249 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 14 (OVERLAPS) 0/249 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/249 variables, and 439 constraints, problems are : Problem set: 0 solved, 121 unsolved in 22778 ms.
Refiners :[Domain max(s): 127/127 constraints, Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 18/18 constraints]
After SMT, in 28623ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 28627ms
Starting structural reductions in SI_LTL mode, iteration 1 : 127/128 places, 122/123 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 28907 ms. Remains : 127/128 places, 122/123 transitions.
Stuttering acceptance computed with spot in 150 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-005A-LTLFireability-00
Product exploration explored 100000 steps with 342 reset in 419 ms.
Product exploration explored 100000 steps with 348 reset in 324 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
RANDOM walk for 485 steps (0 resets) in 8 ms. (53 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Support contains 3 out of 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 122/122 transitions.
Applied a total of 0 rules in 16 ms. Remains 127 /127 variables (removed 0) and now considering 122/122 (removed 0) transitions.
[2024-05-28 08:38:46] [INFO ] Invariant cache hit.
[2024-05-28 08:38:46] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-28 08:38:46] [INFO ] Invariant cache hit.
[2024-05-28 08:38:46] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
[2024-05-28 08:38:46] [INFO ] Redundant transitions in 26 ms returned []
Running 121 sub problems to find dead transitions.
[2024-05-28 08:38:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 46/172 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 08:38:47] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 2 ms to minimize.
[2024-05-28 08:38:47] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-28 08:38:47] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-05-28 08:38:47] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-28 08:38:47] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 5/178 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (OVERLAPS) 122/249 variables, 127/305 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 08:38:49] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-05-28 08:38:49] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 2 ms to minimize.
[2024-05-28 08:38:49] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-05-28 08:38:49] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-28 08:38:49] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/249 variables, 5/310 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 08:38:49] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/249 variables, 1/311 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 08:38:50] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/249 variables, 1/312 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 08:38:50] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-28 08:38:51] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/249 variables, 2/314 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/249 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 12 (OVERLAPS) 0/249 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/249 variables, and 314 constraints, problems are : Problem set: 0 solved, 121 unsolved in 5918 ms.
Refiners :[Domain max(s): 127/127 constraints, Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 46/172 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 14/187 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (OVERLAPS) 122/249 variables, 127/314 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/249 variables, 121/435 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 08:38:55] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/249 variables, 1/436 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 08:38:57] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/249 variables, 1/437 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 08:39:00] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/249 variables, 1/438 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/249 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 08:39:05] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/249 variables, 1/439 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/249 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 14 (OVERLAPS) 0/249 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/249 variables, and 439 constraints, problems are : Problem set: 0 solved, 121 unsolved in 22489 ms.
Refiners :[Domain max(s): 127/127 constraints, Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 18/18 constraints]
After SMT, in 28430ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 28431ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 28689 ms. Remains : 127/127 places, 122/122 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 66 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
RANDOM walk for 2051 steps (6 resets) in 17 ms. (113 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 115 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration explored 100000 steps with 343 reset in 248 ms.
Product exploration explored 100000 steps with 348 reset in 261 ms.
Built C files in :
/tmp/ltsmin5928118762869309005
[2024-05-28 08:39:16] [INFO ] Computing symmetric may disable matrix : 122 transitions.
[2024-05-28 08:39:16] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 08:39:16] [INFO ] Computing symmetric may enable matrix : 122 transitions.
[2024-05-28 08:39:16] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 08:39:16] [INFO ] Computing Do-Not-Accords matrix : 122 transitions.
[2024-05-28 08:39:16] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 08:39:16] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5928118762869309005
Running compilation step : cd /tmp/ltsmin5928118762869309005;'/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 391 ms.
Running link step : cd /tmp/ltsmin5928118762869309005;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin5928118762869309005;'/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/stateBased16400504628223411629.hoa' '--buchi-type=spotba'
LTSmin run took 1740 ms.
FORMULA ShieldIIPs-PT-005A-LTLFireability-00 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldIIPs-PT-005A-LTLFireability-00 finished in 61993 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' '!((p0 U (F(p1) U p2)))'
Support contains 6 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 123/123 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 128 transition count 122
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 127 transition count 122
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 126 transition count 121
Applied a total of 4 rules in 19 ms. Remains 126 /128 variables (removed 2) and now considering 121/123 (removed 2) transitions.
// Phase 1: matrix 121 rows 126 cols
[2024-05-28 08:39:18] [INFO ] Computed 46 invariants in 2 ms
[2024-05-28 08:39:18] [INFO ] Implicit Places using invariants in 68 ms returned [112]
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 : 125/128 places, 121/123 transitions.
Applied a total of 0 rules in 5 ms. Remains 125 /125 variables (removed 0) and now considering 121/121 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 94 ms. Remains : 125/128 places, 121/123 transitions.
Stuttering acceptance computed with spot in 133 ms :[(NOT p2), (NOT p1), (NOT p2)]
Running random walk in product with property : ShieldIIPs-PT-005A-LTLFireability-01
Stuttering criterion allowed to conclude after 57021 steps with 505 reset in 174 ms.
FORMULA ShieldIIPs-PT-005A-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-005A-LTLFireability-01 finished in 418 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(F(p0))||G(p1))))'
Support contains 3 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 123/123 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 128 transition count 122
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 127 transition count 122
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 126 transition count 121
Applied a total of 4 rules in 16 ms. Remains 126 /128 variables (removed 2) and now considering 121/123 (removed 2) transitions.
[2024-05-28 08:39:18] [INFO ] Invariant cache hit.
[2024-05-28 08:39:18] [INFO ] Implicit Places using invariants in 117 ms returned [112]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 119 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 125/128 places, 121/123 transitions.
Applied a total of 0 rules in 6 ms. Remains 125 /125 variables (removed 0) and now considering 121/121 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 141 ms. Remains : 125/128 places, 121/123 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-005A-LTLFireability-02
Product exploration explored 100000 steps with 1599 reset in 251 ms.
Product exploration explored 100000 steps with 1691 reset in 250 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 87 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 130 steps (0 resets) in 9 ms. (13 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 9 factoid took 203 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 125 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 125/125 places, 121/121 transitions.
Applied a total of 0 rules in 9 ms. Remains 125 /125 variables (removed 0) and now considering 121/121 (removed 0) transitions.
// Phase 1: matrix 121 rows 125 cols
[2024-05-28 08:39:20] [INFO ] Computed 45 invariants in 1 ms
[2024-05-28 08:39:20] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-28 08:39:20] [INFO ] Invariant cache hit.
[2024-05-28 08:39:20] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
[2024-05-28 08:39:20] [INFO ] Redundant transitions in 24 ms returned [113]
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 119 sub problems to find dead transitions.
// Phase 1: matrix 120 rows 125 cols
[2024-05-28 08:39:20] [INFO ] Computed 45 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 45/169 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 08:39:21] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-28 08:39:21] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2024-05-28 08:39:21] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-05-28 08:39:21] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-28 08:39:21] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 5/175 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (OVERLAPS) 120/245 variables, 125/300 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 08:39:22] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-28 08:39:22] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 1 ms to minimize.
[2024-05-28 08:39:22] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-28 08:39:22] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-05-28 08:39:22] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-28 08:39:22] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 4 ms to minimize.
[2024-05-28 08:39:22] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-28 08:39:22] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-28 08:39:23] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 9/309 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (OVERLAPS) 0/245 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 245/245 variables, and 309 constraints, problems are : Problem set: 0 solved, 119 unsolved in 3974 ms.
Refiners :[Domain max(s): 125/125 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 45/169 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 14/184 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (OVERLAPS) 120/245 variables, 125/309 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 119/428 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 08:39:25] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 1/429 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 08:39:28] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/245 variables, 1/430 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 08:39:30] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/245 variables, 1/431 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/245 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 12 (OVERLAPS) 0/245 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 245/245 variables, and 431 constraints, problems are : Problem set: 0 solved, 119 unsolved in 16825 ms.
Refiners :[Domain max(s): 125/125 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 17/17 constraints]
After SMT, in 20821ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 20823ms
Starting structural reductions in SI_LTL mode, iteration 1 : 125/125 places, 120/121 transitions.
Applied a total of 0 rules in 8 ms. Remains 125 /125 variables (removed 0) and now considering 120/120 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 21053 ms. Remains : 125/125 places, 120/121 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) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 97 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 152 steps (0 resets) in 8 ms. (16 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 9 factoid took 210 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1618 reset in 223 ms.
Product exploration explored 100000 steps with 1619 reset in 238 ms.
Built C files in :
/tmp/ltsmin11204597559120851017
[2024-05-28 08:39:42] [INFO ] Computing symmetric may disable matrix : 120 transitions.
[2024-05-28 08:39:42] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 08:39:42] [INFO ] Computing symmetric may enable matrix : 120 transitions.
[2024-05-28 08:39:42] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 08:39:42] [INFO ] Computing Do-Not-Accords matrix : 120 transitions.
[2024-05-28 08:39:42] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 08:39:42] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11204597559120851017
Running compilation step : cd /tmp/ltsmin11204597559120851017;'/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 285 ms.
Running link step : cd /tmp/ltsmin11204597559120851017;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin11204597559120851017;'/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/stateBased13048105461855427625.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 125 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 125/125 places, 120/120 transitions.
Applied a total of 0 rules in 5 ms. Remains 125 /125 variables (removed 0) and now considering 120/120 (removed 0) transitions.
[2024-05-28 08:39:57] [INFO ] Invariant cache hit.
[2024-05-28 08:39:57] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-28 08:39:57] [INFO ] Invariant cache hit.
[2024-05-28 08:39:57] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
[2024-05-28 08:39:57] [INFO ] Redundant transitions in 29 ms returned []
Running 119 sub problems to find dead transitions.
[2024-05-28 08:39:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 45/169 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 08:39:58] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-28 08:39:58] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-05-28 08:39:58] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-28 08:39:58] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2024-05-28 08:39:58] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 5/175 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (OVERLAPS) 120/245 variables, 125/300 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 08:39:59] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2024-05-28 08:39:59] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-28 08:39:59] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-28 08:39:59] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-28 08:39:59] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-28 08:39:59] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 6/306 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 08:40:00] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 1 ms to minimize.
[2024-05-28 08:40:00] [INFO ] Deduced a trap composed of 21 places in 20 ms of which 0 ms to minimize.
[2024-05-28 08:40:00] [INFO ] Deduced a trap composed of 12 places in 17 ms of which 0 ms to minimize.
[2024-05-28 08:40:00] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
[2024-05-28 08:40:00] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-28 08:40:00] [INFO ] Deduced a trap composed of 10 places in 16 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 6/312 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 08:40:00] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/245 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 08:40:01] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/245 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/245 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 08:40:02] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/245 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 08:40:03] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
[2024-05-28 08:40:03] [INFO ] Deduced a trap composed of 16 places in 18 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/245 variables, 2/317 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/245 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 15 (OVERLAPS) 0/245 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 245/245 variables, and 317 constraints, problems are : Problem set: 0 solved, 119 unsolved in 7258 ms.
Refiners :[Domain max(s): 125/125 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 45/169 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 22/192 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (OVERLAPS) 120/245 variables, 125/317 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 119/436 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 08:40:06] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 1/437 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/245 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 10 (OVERLAPS) 0/245 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 245/245 variables, and 437 constraints, problems are : Problem set: 0 solved, 119 unsolved in 5818 ms.
Refiners :[Domain max(s): 125/125 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 23/23 constraints]
After SMT, in 13098ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 13100ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 13314 ms. Remains : 125/125 places, 120/120 transitions.
Built C files in :
/tmp/ltsmin11506685581275029510
[2024-05-28 08:40:10] [INFO ] Computing symmetric may disable matrix : 120 transitions.
[2024-05-28 08:40:10] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 08:40:10] [INFO ] Computing symmetric may enable matrix : 120 transitions.
[2024-05-28 08:40:10] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 08:40:10] [INFO ] Computing Do-Not-Accords matrix : 120 transitions.
[2024-05-28 08:40:10] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 08:40:10] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11506685581275029510
Running compilation step : cd /tmp/ltsmin11506685581275029510;'/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 281 ms.
Running link step : cd /tmp/ltsmin11506685581275029510;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin11506685581275029510;'/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/stateBased12113636184559756679.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 08:40:25] [INFO ] Flatten gal took : 11 ms
[2024-05-28 08:40:25] [INFO ] Flatten gal took : 10 ms
[2024-05-28 08:40:25] [INFO ] Time to serialize gal into /tmp/LTL7185318558455165651.gal : 4 ms
[2024-05-28 08:40:25] [INFO ] Time to serialize properties into /tmp/LTL8963541834382937351.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/LTL7185318558455165651.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16171531740726076636.hoa' '-atoms' '/tmp/LTL8963541834382937351.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL8963541834382937351.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16171531740726076636.hoa
Detected timeout of ITS tools.
[2024-05-28 08:40:40] [INFO ] Flatten gal took : 8 ms
[2024-05-28 08:40:40] [INFO ] Flatten gal took : 8 ms
[2024-05-28 08:40:40] [INFO ] Time to serialize gal into /tmp/LTL6985005578963502058.gal : 4 ms
[2024-05-28 08:40:40] [INFO ] Time to serialize properties into /tmp/LTL14235982936300340829.ltl : 4 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/LTL6985005578963502058.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14235982936300340829.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((G(F("((p54==1)&&(p69==1))")))||(G("(p115==0)")))))
Formula 0 simplified : G(FG!"((p54==1)&&(p69==1))" & F!"(p115==0)")
Detected timeout of ITS tools.
[2024-05-28 08:40:56] [INFO ] Flatten gal took : 8 ms
[2024-05-28 08:40:56] [INFO ] Applying decomposition
[2024-05-28 08:40:56] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6646798431501733424.txt' '-o' '/tmp/graph6646798431501733424.bin' '-w' '/tmp/graph6646798431501733424.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6646798431501733424.bin' '-l' '-1' '-v' '-w' '/tmp/graph6646798431501733424.weights' '-q' '0' '-e' '0.001'
[2024-05-28 08:40:56] [INFO ] Decomposing Gal with order
[2024-05-28 08:40:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 08:40:56] [INFO ] Removed a total of 75 redundant transitions.
[2024-05-28 08:40:56] [INFO ] Flatten gal took : 45 ms
[2024-05-28 08:40:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 72 labels/synchronizations in 10 ms.
[2024-05-28 08:40:56] [INFO ] Time to serialize gal into /tmp/LTL9832968552443399468.gal : 3 ms
[2024-05-28 08:40:56] [INFO ] Time to serialize properties into /tmp/LTL1325856508621101101.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/LTL9832968552443399468.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1325856508621101101.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F((G(F("((i2.i0.u19.p54==1)&&(i2.i0.u25.p69==1))")))||(G("(i4.i0.u41.p115==0)")))))
Formula 0 simplified : G(FG!"((i2.i0.u19.p54==1)&&(i2.i0.u25.p69==1))" & F!"(i4.i0.u41.p115==0)")
Detected timeout of ITS tools.
Treatment of property ShieldIIPs-PT-005A-LTLFireability-02 finished in 112644 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 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 123/123 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 128 transition count 122
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 127 transition count 122
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 126 transition count 121
Applied a total of 4 rules in 10 ms. Remains 126 /128 variables (removed 2) and now considering 121/123 (removed 2) transitions.
// Phase 1: matrix 121 rows 126 cols
[2024-05-28 08:41:11] [INFO ] Computed 46 invariants in 0 ms
[2024-05-28 08:41:11] [INFO ] Implicit Places using invariants in 79 ms returned [112]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 83 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 125/128 places, 121/123 transitions.
Applied a total of 0 rules in 4 ms. Remains 125 /125 variables (removed 0) and now considering 121/121 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 97 ms. Remains : 125/128 places, 121/123 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-005A-LTLFireability-03
Product exploration explored 100000 steps with 16483 reset in 199 ms.
Product exploration explored 100000 steps with 16549 reset in 200 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 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 67 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 14 steps (0 resets) in 5 ms. (2 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 129 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 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 121 rows 125 cols
[2024-05-28 08:41:12] [INFO ] Computed 45 invariants in 0 ms
[2024-05-28 08:41:12] [INFO ] [Real]Absence check using 45 positive place invariants in 8 ms returned sat
[2024-05-28 08:41:12] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2024-05-28 08:41:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 08:41:12] [INFO ] [Nat]Absence check using 45 positive place invariants in 9 ms returned sat
[2024-05-28 08:41:12] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2024-05-28 08:41:12] [INFO ] Computed and/alt/rep : 112/401/112 causal constraints (skipped 8 transitions) in 10 ms.
[2024-05-28 08:41:13] [INFO ] Added : 85 causal constraints over 17 iterations in 265 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 125 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 125/125 places, 121/121 transitions.
Applied a total of 0 rules in 4 ms. Remains 125 /125 variables (removed 0) and now considering 121/121 (removed 0) transitions.
[2024-05-28 08:41:13] [INFO ] Invariant cache hit.
[2024-05-28 08:41:13] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-28 08:41:13] [INFO ] Invariant cache hit.
[2024-05-28 08:41:13] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
[2024-05-28 08:41:13] [INFO ] Redundant transitions in 37 ms returned [113]
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 119 sub problems to find dead transitions.
// Phase 1: matrix 120 rows 125 cols
[2024-05-28 08:41:13] [INFO ] Computed 45 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 45/169 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 08:41:14] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 3 ms to minimize.
[2024-05-28 08:41:14] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-28 08:41:14] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-05-28 08:41:14] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-28 08:41:14] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 5/175 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (OVERLAPS) 120/245 variables, 125/300 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 08:41:15] [INFO ] Deduced a trap composed of 9 places in 17 ms of which 1 ms to minimize.
[2024-05-28 08:41:15] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
[2024-05-28 08:41:15] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-28 08:41:15] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
[2024-05-28 08:41:15] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-28 08:41:15] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-28 08:41:15] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-28 08:41:15] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 1 ms to minimize.
[2024-05-28 08:41:16] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 9/309 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (OVERLAPS) 0/245 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 245/245 variables, and 309 constraints, problems are : Problem set: 0 solved, 119 unsolved in 4052 ms.
Refiners :[Domain max(s): 125/125 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 45/169 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 14/184 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (OVERLAPS) 120/245 variables, 125/309 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 119/428 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 08:41:18] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 1/429 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 08:41:21] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/245 variables, 1/430 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 08:41:24] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/245 variables, 1/431 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/245 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 12 (OVERLAPS) 0/245 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 245/245 variables, and 431 constraints, problems are : Problem set: 0 solved, 119 unsolved in 16831 ms.
Refiners :[Domain max(s): 125/125 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 17/17 constraints]
After SMT, in 20905ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 20908ms
Starting structural reductions in SI_LTL mode, iteration 1 : 125/125 places, 120/121 transitions.
Applied a total of 0 rules in 7 ms. Remains 125 /125 variables (removed 0) and now considering 120/120 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 21175 ms. Remains : 125/125 places, 120/121 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 62 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 72 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 12 steps (0 resets) in 4 ms. (2 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 78 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 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
[2024-05-28 08:41:34] [INFO ] Invariant cache hit.
[2024-05-28 08:41:34] [INFO ] [Real]Absence check using 45 positive place invariants in 7 ms returned sat
[2024-05-28 08:41:34] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2024-05-28 08:41:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 08:41:34] [INFO ] [Nat]Absence check using 45 positive place invariants in 8 ms returned sat
[2024-05-28 08:41:34] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2024-05-28 08:41:34] [INFO ] Deduced a trap composed of 16 places in 19 ms of which 0 ms to minimize.
[2024-05-28 08:41:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2024-05-28 08:41:34] [INFO ] Computed and/alt/rep : 112/406/112 causal constraints (skipped 7 transitions) in 8 ms.
[2024-05-28 08:41:35] [INFO ] Added : 107 causal constraints over 22 iterations in 307 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 16492 reset in 181 ms.
Product exploration explored 100000 steps with 16487 reset in 194 ms.
Built C files in :
/tmp/ltsmin8526299424553097861
[2024-05-28 08:41:35] [INFO ] Computing symmetric may disable matrix : 120 transitions.
[2024-05-28 08:41:35] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 08:41:35] [INFO ] Computing symmetric may enable matrix : 120 transitions.
[2024-05-28 08:41:35] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 08:41:35] [INFO ] Computing Do-Not-Accords matrix : 120 transitions.
[2024-05-28 08:41:35] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 08:41:35] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8526299424553097861
Running compilation step : cd /tmp/ltsmin8526299424553097861;'/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 299 ms.
Running link step : cd /tmp/ltsmin8526299424553097861;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin8526299424553097861;'/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/stateBased12058737103717452979.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 125 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 125/125 places, 120/120 transitions.
Applied a total of 0 rules in 12 ms. Remains 125 /125 variables (removed 0) and now considering 120/120 (removed 0) transitions.
[2024-05-28 08:41:50] [INFO ] Invariant cache hit.
[2024-05-28 08:41:50] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-28 08:41:50] [INFO ] Invariant cache hit.
[2024-05-28 08:41:50] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
[2024-05-28 08:41:51] [INFO ] Redundant transitions in 21 ms returned []
Running 119 sub problems to find dead transitions.
[2024-05-28 08:41:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 45/169 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 08:41:51] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-28 08:41:51] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 2 ms to minimize.
[2024-05-28 08:41:52] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2024-05-28 08:41:52] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2024-05-28 08:41:52] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 5/175 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (OVERLAPS) 120/245 variables, 125/300 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 08:41:53] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2024-05-28 08:41:53] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-28 08:41:53] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-28 08:41:53] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-28 08:41:53] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-05-28 08:41:53] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 6/306 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 08:41:53] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-05-28 08:41:53] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-05-28 08:41:53] [INFO ] Deduced a trap composed of 12 places in 17 ms of which 0 ms to minimize.
[2024-05-28 08:41:53] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
[2024-05-28 08:41:53] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-05-28 08:41:53] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 6/312 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 08:41:54] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/245 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 08:41:55] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/245 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/245 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 08:41:55] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/245 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 08:41:56] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-05-28 08:41:56] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/245 variables, 2/317 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/245 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 15 (OVERLAPS) 0/245 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 245/245 variables, and 317 constraints, problems are : Problem set: 0 solved, 119 unsolved in 7422 ms.
Refiners :[Domain max(s): 125/125 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 45/169 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 22/192 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (OVERLAPS) 120/245 variables, 125/317 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 119/436 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 08:42:00] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 1/437 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/245 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 10 (OVERLAPS) 0/245 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 245/245 variables, and 437 constraints, problems are : Problem set: 0 solved, 119 unsolved in 5760 ms.
Refiners :[Domain max(s): 125/125 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 23/23 constraints]
After SMT, in 13199ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 13200ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 13423 ms. Remains : 125/125 places, 120/120 transitions.
Built C files in :
/tmp/ltsmin11699981598394812592
[2024-05-28 08:42:04] [INFO ] Computing symmetric may disable matrix : 120 transitions.
[2024-05-28 08:42:04] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 08:42:04] [INFO ] Computing symmetric may enable matrix : 120 transitions.
[2024-05-28 08:42:04] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 08:42:04] [INFO ] Computing Do-Not-Accords matrix : 120 transitions.
[2024-05-28 08:42:04] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 08:42:04] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11699981598394812592
Running compilation step : cd /tmp/ltsmin11699981598394812592;'/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 290 ms.
Running link step : cd /tmp/ltsmin11699981598394812592;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin11699981598394812592;'/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/stateBased2054781499095066561.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 08:42:19] [INFO ] Flatten gal took : 19 ms
[2024-05-28 08:42:19] [INFO ] Flatten gal took : 7 ms
[2024-05-28 08:42:19] [INFO ] Time to serialize gal into /tmp/LTL17821658330325251614.gal : 2 ms
[2024-05-28 08:42:19] [INFO ] Time to serialize properties into /tmp/LTL1676464709110521298.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/LTL17821658330325251614.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11504557351553511301.hoa' '-atoms' '/tmp/LTL1676464709110521298.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/LTL1676464709110521298.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11504557351553511301.hoa
Detected timeout of ITS tools.
[2024-05-28 08:42:34] [INFO ] Flatten gal took : 6 ms
[2024-05-28 08:42:34] [INFO ] Flatten gal took : 6 ms
[2024-05-28 08:42:34] [INFO ] Time to serialize gal into /tmp/LTL17283801583758563688.gal : 1 ms
[2024-05-28 08:42:34] [INFO ] Time to serialize properties into /tmp/LTL17415608047210630350.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/LTL17283801583758563688.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17415608047210630350.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("((p87==1)&&(p120==1))"))))
Formula 0 simplified : FG!"((p87==1)&&(p120==1))"
Detected timeout of ITS tools.
[2024-05-28 08:42:49] [INFO ] Flatten gal took : 12 ms
[2024-05-28 08:42:49] [INFO ] Applying decomposition
[2024-05-28 08:42:49] [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/graph16919526209143859467.txt' '-o' '/tmp/graph16919526209143859467.bin' '-w' '/tmp/graph16919526209143859467.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16919526209143859467.bin' '-l' '-1' '-v' '-w' '/tmp/graph16919526209143859467.weights' '-q' '0' '-e' '0.001'
[2024-05-28 08:42:49] [INFO ] Decomposing Gal with order
[2024-05-28 08:42:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 08:42:49] [INFO ] Removed a total of 75 redundant transitions.
[2024-05-28 08:42:49] [INFO ] Flatten gal took : 34 ms
[2024-05-28 08:42:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 72 labels/synchronizations in 8 ms.
[2024-05-28 08:42:49] [INFO ] Time to serialize gal into /tmp/LTL6260059382514466177.gal : 3 ms
[2024-05-28 08:42:49] [INFO ] Time to serialize properties into /tmp/LTL6763368137902646151.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/LTL6260059382514466177.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6763368137902646151.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F("((i3.i2.u32.p87==1)&&(i4.i2.u43.p120==1))"))))
Formula 0 simplified : FG!"((i3.i2.u32.p87==1)&&(i4.i2.u43.p120==1))"
Detected timeout of ITS tools.
Treatment of property ShieldIIPs-PT-005A-LTLFireability-03 finished in 113154 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 1 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 123/123 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 127 transition count 121
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 125 transition count 121
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 5 place count 124 transition count 120
Applied a total of 5 rules in 8 ms. Remains 124 /128 variables (removed 4) and now considering 120/123 (removed 3) transitions.
// Phase 1: matrix 120 rows 124 cols
[2024-05-28 08:43:04] [INFO ] Computed 45 invariants in 5 ms
[2024-05-28 08:43:04] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-28 08:43:04] [INFO ] Invariant cache hit.
[2024-05-28 08:43:04] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
[2024-05-28 08:43:04] [INFO ] Redundant transitions in 20 ms returned [112]
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 118 sub problems to find dead transitions.
// Phase 1: matrix 119 rows 124 cols
[2024-05-28 08:43:04] [INFO ] Computed 45 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 45/169 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 08:43:05] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
[2024-05-28 08:43:05] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-05-28 08:43:05] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-28 08:43:05] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-28 08:43:05] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 5/174 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (OVERLAPS) 119/243 variables, 124/298 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 08:43:06] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 08:43:07] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-28 08:43:07] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 5 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/243 variables, 2/301 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 08:43:07] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 1 ms to minimize.
[2024-05-28 08:43:08] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/243 variables, 2/303 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/243 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 08:43:09] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-05-28 08:43:09] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-28 08:43:09] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 1 ms to minimize.
[2024-05-28 08:43:09] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/243 variables, 4/307 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/243 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 08:43:09] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-05-28 08:43:09] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 0 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/243 variables, 2/309 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 08:43:10] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2024-05-28 08:43:10] [INFO ] Deduced a trap composed of 9 places in 16 ms of which 0 ms to minimize.
[2024-05-28 08:43:10] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/243 variables, 3/312 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 08:43:11] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/243 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/243 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 08:43:12] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-05-28 08:43:12] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 0 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/243 variables, 2/315 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 08:43:12] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 0 ms to minimize.
[2024-05-28 08:43:12] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-05-28 08:43:12] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-28 08:43:12] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/243 variables, 4/319 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/243 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 19 (OVERLAPS) 0/243 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Real declared 243/243 variables, and 319 constraints, problems are : Problem set: 0 solved, 118 unsolved in 9715 ms.
Refiners :[Domain max(s): 124/124 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 118 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 45/169 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 26/195 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (OVERLAPS) 119/243 variables, 124/319 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 118/437 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (OVERLAPS) 0/243 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Int declared 243/243 variables, and 437 constraints, problems are : Problem set: 0 solved, 118 unsolved in 3282 ms.
Refiners :[Domain max(s): 124/124 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 26/26 constraints]
After SMT, in 13022ms problems are : Problem set: 0 solved, 118 unsolved
Search for dead transitions found 0 dead transitions in 13023ms
Starting structural reductions in SI_LTL mode, iteration 1 : 124/128 places, 119/123 transitions.
Applied a total of 0 rules in 6 ms. Remains 124 /124 variables (removed 0) and now considering 119/119 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 13238 ms. Remains : 124/128 places, 119/123 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-005A-LTLFireability-04
Product exploration explored 100000 steps with 864 reset in 225 ms.
Product exploration explored 100000 steps with 888 reset in 234 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 69 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 58 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 337 steps (0 resets) in 6 ms. (48 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 115 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 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 119/119 transitions.
Applied a total of 0 rules in 6 ms. Remains 124 /124 variables (removed 0) and now considering 119/119 (removed 0) transitions.
[2024-05-28 08:43:18] [INFO ] Invariant cache hit.
[2024-05-28 08:43:18] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-28 08:43:18] [INFO ] Invariant cache hit.
[2024-05-28 08:43:19] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
[2024-05-28 08:43:19] [INFO ] Redundant transitions in 19 ms returned []
Running 118 sub problems to find dead transitions.
[2024-05-28 08:43:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 45/169 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 08:43:19] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 1 ms to minimize.
[2024-05-28 08:43:19] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-05-28 08:43:19] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
[2024-05-28 08:43:19] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-28 08:43:19] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 5/174 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (OVERLAPS) 119/243 variables, 124/298 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 08:43:20] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
[2024-05-28 08:43:20] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
[2024-05-28 08:43:20] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 3/301 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 08:43:21] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/243 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 08:43:22] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
[2024-05-28 08:43:22] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/243 variables, 2/304 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 08:43:22] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/243 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 08:43:23] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/243 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 08:43:23] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
[2024-05-28 08:43:23] [INFO ] Deduced a trap composed of 13 places in 17 ms of which 1 ms to minimize.
[2024-05-28 08:43:23] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/243 variables, 3/309 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/243 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 13 (OVERLAPS) 0/243 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Real declared 243/243 variables, and 309 constraints, problems are : Problem set: 0 solved, 118 unsolved in 6429 ms.
Refiners :[Domain max(s): 124/124 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 118 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 45/169 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 16/185 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (OVERLAPS) 119/243 variables, 124/309 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 118/427 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 08:43:26] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 1/428 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 08:43:29] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
[2024-05-28 08:43:29] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 2/430 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/243 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 9 (OVERLAPS) 0/243 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Int declared 243/243 variables, and 430 constraints, problems are : Problem set: 0 solved, 118 unsolved in 16878 ms.
Refiners :[Domain max(s): 124/124 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 19/19 constraints]
After SMT, in 23323ms problems are : Problem set: 0 solved, 118 unsolved
Search for dead transitions found 0 dead transitions in 23325ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 23539 ms. Remains : 124/124 places, 119/119 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 322 steps (0 resets) in 8 ms. (35 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 112 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 84 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 877 reset in 217 ms.
Product exploration explored 100000 steps with 888 reset in 235 ms.
Built C files in :
/tmp/ltsmin10275046451928166597
[2024-05-28 08:43:43] [INFO ] Computing symmetric may disable matrix : 119 transitions.
[2024-05-28 08:43:43] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 08:43:43] [INFO ] Computing symmetric may enable matrix : 119 transitions.
[2024-05-28 08:43:43] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 08:43:43] [INFO ] Computing Do-Not-Accords matrix : 119 transitions.
[2024-05-28 08:43:43] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 08:43:43] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10275046451928166597
Running compilation step : cd /tmp/ltsmin10275046451928166597;'/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 300 ms.
Running link step : cd /tmp/ltsmin10275046451928166597;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin10275046451928166597;'/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/stateBased15891430067494982469.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 119/119 transitions.
Applied a total of 0 rules in 22 ms. Remains 124 /124 variables (removed 0) and now considering 119/119 (removed 0) transitions.
[2024-05-28 08:43:58] [INFO ] Invariant cache hit.
[2024-05-28 08:43:58] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-28 08:43:58] [INFO ] Invariant cache hit.
[2024-05-28 08:43:58] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
[2024-05-28 08:43:58] [INFO ] Redundant transitions in 18 ms returned []
Running 118 sub problems to find dead transitions.
[2024-05-28 08:43:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 45/169 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 08:43:59] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
[2024-05-28 08:43:59] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-05-28 08:43:59] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-28 08:43:59] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-28 08:43:59] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 5/174 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (OVERLAPS) 119/243 variables, 124/298 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 08:44:00] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-05-28 08:44:00] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
[2024-05-28 08:44:00] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 3/301 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 08:44:01] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/243 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 08:44:01] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-05-28 08:44:01] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/243 variables, 2/304 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 08:44:02] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/243 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 08:44:03] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/243 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 08:44:03] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-05-28 08:44:03] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 0 ms to minimize.
[2024-05-28 08:44:03] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/243 variables, 3/309 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/243 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 13 (OVERLAPS) 0/243 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Real declared 243/243 variables, and 309 constraints, problems are : Problem set: 0 solved, 118 unsolved in 6602 ms.
Refiners :[Domain max(s): 124/124 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 118 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 45/169 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 16/185 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (OVERLAPS) 119/243 variables, 124/309 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 118/427 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 08:44:06] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 1/428 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 08:44:09] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-28 08:44:09] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 2/430 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/243 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 9 (OVERLAPS) 0/243 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Int declared 243/243 variables, and 430 constraints, problems are : Problem set: 0 solved, 118 unsolved in 17116 ms.
Refiners :[Domain max(s): 124/124 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 19/19 constraints]
After SMT, in 23738ms problems are : Problem set: 0 solved, 118 unsolved
Search for dead transitions found 0 dead transitions in 23740ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 23980 ms. Remains : 124/124 places, 119/119 transitions.
Built C files in :
/tmp/ltsmin11500409036115846705
[2024-05-28 08:44:22] [INFO ] Computing symmetric may disable matrix : 119 transitions.
[2024-05-28 08:44:22] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 08:44:22] [INFO ] Computing symmetric may enable matrix : 119 transitions.
[2024-05-28 08:44:22] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 08:44:22] [INFO ] Computing Do-Not-Accords matrix : 119 transitions.
[2024-05-28 08:44:22] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 08:44:22] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11500409036115846705
Running compilation step : cd /tmp/ltsmin11500409036115846705;'/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 281 ms.
Running link step : cd /tmp/ltsmin11500409036115846705;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin11500409036115846705;'/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/stateBased14749659260275761148.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 08:44:37] [INFO ] Flatten gal took : 18 ms
[2024-05-28 08:44:37] [INFO ] Flatten gal took : 5 ms
[2024-05-28 08:44:37] [INFO ] Time to serialize gal into /tmp/LTL14626450550126508274.gal : 1 ms
[2024-05-28 08:44:37] [INFO ] Time to serialize properties into /tmp/LTL9683475153687580030.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/LTL14626450550126508274.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6700607838345318355.hoa' '-atoms' '/tmp/LTL9683475153687580030.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL9683475153687580030.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6700607838345318355.hoa
Detected timeout of ITS tools.
[2024-05-28 08:44:52] [INFO ] Flatten gal took : 5 ms
[2024-05-28 08:44:52] [INFO ] Flatten gal took : 5 ms
[2024-05-28 08:44:52] [INFO ] Time to serialize gal into /tmp/LTL12168752092065132008.gal : 1 ms
[2024-05-28 08:44:52] [INFO ] Time to serialize properties into /tmp/LTL8553333301421580474.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/LTL12168752092065132008.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8553333301421580474.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 : !((G(F("(p40==0)"))))
Formula 0 simplified : FG!"(p40==0)"
Detected timeout of ITS tools.
[2024-05-28 08:45:07] [INFO ] Flatten gal took : 11 ms
[2024-05-28 08:45:07] [INFO ] Applying decomposition
[2024-05-28 08:45:07] [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/graph10226416214898966774.txt' '-o' '/tmp/graph10226416214898966774.bin' '-w' '/tmp/graph10226416214898966774.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10226416214898966774.bin' '-l' '-1' '-v' '-w' '/tmp/graph10226416214898966774.weights' '-q' '0' '-e' '0.001'
[2024-05-28 08:45:07] [INFO ] Decomposing Gal with order
[2024-05-28 08:45:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 08:45:07] [INFO ] Removed a total of 75 redundant transitions.
[2024-05-28 08:45:07] [INFO ] Flatten gal took : 8 ms
[2024-05-28 08:45:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 72 labels/synchronizations in 3 ms.
[2024-05-28 08:45:07] [INFO ] Time to serialize gal into /tmp/LTL12592413455140386503.gal : 2 ms
[2024-05-28 08:45:07] [INFO ] Time to serialize properties into /tmp/LTL7235475860015427532.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/LTL12592413455140386503.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7235475860015427532.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("(i1.i0.u15.p40==0)"))))
Formula 0 simplified : FG!"(i1.i0.u15.p40==0)"
Detected timeout of ITS tools.
Treatment of property ShieldIIPs-PT-005A-LTLFireability-04 finished in 138169 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)||X(G(p1))||G(p2)))'
Support contains 8 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 123/123 transitions.
Applied a total of 0 rules in 1 ms. Remains 128 /128 variables (removed 0) and now considering 123/123 (removed 0) transitions.
// Phase 1: matrix 123 rows 128 cols
[2024-05-28 08:45:22] [INFO ] Computed 46 invariants in 1 ms
[2024-05-28 08:45:22] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-28 08:45:22] [INFO ] Invariant cache hit.
[2024-05-28 08:45:23] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
Running 122 sub problems to find dead transitions.
[2024-05-28 08:45:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 46/173 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 08:45:23] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-28 08:45:23] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-05-28 08:45:24] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-28 08:45:24] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2024-05-28 08:45:24] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 5/179 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 123/251 variables, 128/307 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 08:45:25] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 08:45:25] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-05-28 08:45:25] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 0 ms to minimize.
[2024-05-28 08:45:25] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 3/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 0/251 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 251/251 variables, and 311 constraints, problems are : Problem set: 0 solved, 122 unsolved in 4244 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 46/173 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 9/183 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 123/251 variables, 128/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 122/433 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 08:45:28] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 0/251 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 251/251 variables, and 434 constraints, problems are : Problem set: 0 solved, 122 unsolved in 5420 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 10/10 constraints]
After SMT, in 9680ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 9681ms
Finished structural reductions in LTL mode , in 1 iterations and 9863 ms. Remains : 128/128 places, 123/123 transitions.
Stuttering acceptance computed with spot in 350 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (NOT p0), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-005A-LTLFireability-05
Entered a terminal (fully accepting) state of product in 2678 steps with 8 reset in 14 ms.
FORMULA ShieldIIPs-PT-005A-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-005A-LTLFireability-05 finished in 10252 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 1 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 123/123 transitions.
Applied a total of 0 rules in 0 ms. Remains 128 /128 variables (removed 0) and now considering 123/123 (removed 0) transitions.
[2024-05-28 08:45:33] [INFO ] Invariant cache hit.
[2024-05-28 08:45:33] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-28 08:45:33] [INFO ] Invariant cache hit.
[2024-05-28 08:45:33] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
Running 122 sub problems to find dead transitions.
[2024-05-28 08:45:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 46/173 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 08:45:34] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-28 08:45:34] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2024-05-28 08:45:34] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-28 08:45:34] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-28 08:45:34] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 5/179 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 123/251 variables, 128/307 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 08:45:35] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 08:45:35] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-05-28 08:45:36] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2024-05-28 08:45:36] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 3/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 0/251 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 251/251 variables, and 311 constraints, problems are : Problem set: 0 solved, 122 unsolved in 4185 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 46/173 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 9/183 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 123/251 variables, 128/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 122/433 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 08:45:38] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 0/251 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 251/251 variables, and 434 constraints, problems are : Problem set: 0 solved, 122 unsolved in 5497 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 10/10 constraints]
After SMT, in 9705ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 9707ms
Finished structural reductions in LTL mode , in 1 iterations and 9902 ms. Remains : 128/128 places, 123/123 transitions.
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-005A-LTLFireability-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-005A-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-005A-LTLFireability-06 finished in 10010 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 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 123/123 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 127 transition count 122
Applied a total of 2 rules in 6 ms. Remains 127 /128 variables (removed 1) and now considering 122/123 (removed 1) transitions.
// Phase 1: matrix 122 rows 127 cols
[2024-05-28 08:45:43] [INFO ] Computed 46 invariants in 1 ms
[2024-05-28 08:45:43] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-28 08:45:43] [INFO ] Invariant cache hit.
[2024-05-28 08:45:43] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
[2024-05-28 08:45:43] [INFO ] Redundant transitions in 19 ms returned []
Running 121 sub problems to find dead transitions.
[2024-05-28 08:45:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 46/172 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 08:45:44] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
[2024-05-28 08:45:44] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-28 08:45:44] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-05-28 08:45:44] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-28 08:45:44] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 5/178 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (OVERLAPS) 122/249 variables, 127/305 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 08:45:45] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-28 08:45:45] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-05-28 08:45:45] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-28 08:45:45] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-28 08:45:45] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/249 variables, 5/310 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 08:45:46] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/249 variables, 1/311 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 08:45:46] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/249 variables, 1/312 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 08:45:47] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-28 08:45:47] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/249 variables, 2/314 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/249 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 12 (OVERLAPS) 0/249 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/249 variables, and 314 constraints, problems are : Problem set: 0 solved, 121 unsolved in 5833 ms.
Refiners :[Domain max(s): 127/127 constraints, Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 46/172 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 14/187 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (OVERLAPS) 122/249 variables, 127/314 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/249 variables, 121/435 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 08:45:51] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/249 variables, 1/436 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 08:45:53] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/249 variables, 1/437 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 08:45:56] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/249 variables, 1/438 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/249 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 08:46:01] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/249 variables, 1/439 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/249 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 14 (OVERLAPS) 0/249 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/249 variables, and 439 constraints, problems are : Problem set: 0 solved, 121 unsolved in 22553 ms.
Refiners :[Domain max(s): 127/127 constraints, Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 18/18 constraints]
After SMT, in 28406ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 28410ms
Starting structural reductions in SI_LTL mode, iteration 1 : 127/128 places, 122/123 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 28642 ms. Remains : 127/128 places, 122/123 transitions.
Stuttering acceptance computed with spot in 54 ms :[p0]
Running random walk in product with property : ShieldIIPs-PT-005A-LTLFireability-08
Stuttering criterion allowed to conclude after 607 steps with 2 reset in 1 ms.
FORMULA ShieldIIPs-PT-005A-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-005A-LTLFireability-08 finished in 28714 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 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 123/123 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 128 transition count 122
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 127 transition count 122
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 126 transition count 121
Applied a total of 4 rules in 18 ms. Remains 126 /128 variables (removed 2) and now considering 121/123 (removed 2) transitions.
// Phase 1: matrix 121 rows 126 cols
[2024-05-28 08:46:11] [INFO ] Computed 46 invariants in 1 ms
[2024-05-28 08:46:11] [INFO ] Implicit Places using invariants in 71 ms returned [112]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 72 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 125/128 places, 121/123 transitions.
Applied a total of 0 rules in 3 ms. Remains 125 /125 variables (removed 0) and now considering 121/121 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 93 ms. Remains : 125/128 places, 121/123 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-005A-LTLFireability-09
Product exploration explored 100000 steps with 1421 reset in 214 ms.
Product exploration explored 100000 steps with 1424 reset in 236 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 64 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
RANDOM walk for 355 steps (0 resets) in 6 ms. (50 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 106 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
// Phase 1: matrix 121 rows 125 cols
[2024-05-28 08:46:12] [INFO ] Computed 45 invariants in 1 ms
[2024-05-28 08:46:12] [INFO ] [Real]Absence check using 45 positive place invariants in 8 ms returned sat
[2024-05-28 08:46:12] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2024-05-28 08:46:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 08:46:12] [INFO ] [Nat]Absence check using 45 positive place invariants in 7 ms returned sat
[2024-05-28 08:46:12] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2024-05-28 08:46:13] [INFO ] Computed and/alt/rep : 112/401/112 causal constraints (skipped 8 transitions) in 8 ms.
[2024-05-28 08:46:13] [INFO ] Added : 93 causal constraints over 19 iterations in 301 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 4 out of 125 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 125/125 places, 121/121 transitions.
Applied a total of 0 rules in 4 ms. Remains 125 /125 variables (removed 0) and now considering 121/121 (removed 0) transitions.
[2024-05-28 08:46:13] [INFO ] Invariant cache hit.
[2024-05-28 08:46:13] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-28 08:46:13] [INFO ] Invariant cache hit.
[2024-05-28 08:46:13] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
[2024-05-28 08:46:13] [INFO ] Redundant transitions in 17 ms returned [113]
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 119 sub problems to find dead transitions.
// Phase 1: matrix 120 rows 125 cols
[2024-05-28 08:46:13] [INFO ] Computed 45 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 45/169 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 08:46:14] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-28 08:46:14] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-05-28 08:46:14] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-05-28 08:46:14] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-28 08:46:14] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 5/175 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (OVERLAPS) 120/245 variables, 125/300 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 08:46:15] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-28 08:46:15] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 1 ms to minimize.
[2024-05-28 08:46:15] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-28 08:46:15] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-05-28 08:46:15] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-28 08:46:15] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-28 08:46:15] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-28 08:46:15] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2024-05-28 08:46:16] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 9/309 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (OVERLAPS) 0/245 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 245/245 variables, and 309 constraints, problems are : Problem set: 0 solved, 119 unsolved in 3957 ms.
Refiners :[Domain max(s): 125/125 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 45/169 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 14/184 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (OVERLAPS) 120/245 variables, 125/309 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 119/428 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 08:46:18] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 1/429 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 08:46:22] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/245 variables, 1/430 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 08:46:24] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/245 variables, 1/431 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/245 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 12 (OVERLAPS) 0/245 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 245/245 variables, and 431 constraints, problems are : Problem set: 0 solved, 119 unsolved in 16866 ms.
Refiners :[Domain max(s): 125/125 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 17/17 constraints]
After SMT, in 20843ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 20844ms
Starting structural reductions in SI_LTL mode, iteration 1 : 125/125 places, 120/121 transitions.
Applied a total of 0 rules in 2 ms. Remains 125 /125 variables (removed 0) and now considering 120/120 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 21062 ms. Remains : 125/125 places, 120/121 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 77 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
RANDOM walk for 267 steps (0 resets) in 5 ms. (44 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 101 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
[2024-05-28 08:46:34] [INFO ] Invariant cache hit.
[2024-05-28 08:46:34] [INFO ] [Real]Absence check using 45 positive place invariants in 8 ms returned sat
[2024-05-28 08:46:34] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2024-05-28 08:46:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 08:46:34] [INFO ] [Nat]Absence check using 45 positive place invariants in 8 ms returned sat
[2024-05-28 08:46:34] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2024-05-28 08:46:35] [INFO ] Computed and/alt/rep : 112/406/112 causal constraints (skipped 7 transitions) in 10 ms.
[2024-05-28 08:46:35] [INFO ] Added : 89 causal constraints over 19 iterations in 335 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1436 reset in 213 ms.
Product exploration explored 100000 steps with 1439 reset in 234 ms.
Built C files in :
/tmp/ltsmin1801043118183911222
[2024-05-28 08:46:35] [INFO ] Computing symmetric may disable matrix : 120 transitions.
[2024-05-28 08:46:35] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 08:46:35] [INFO ] Computing symmetric may enable matrix : 120 transitions.
[2024-05-28 08:46:35] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 08:46:35] [INFO ] Computing Do-Not-Accords matrix : 120 transitions.
[2024-05-28 08:46:35] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 08:46:35] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1801043118183911222
Running compilation step : cd /tmp/ltsmin1801043118183911222;'/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 289 ms.
Running link step : cd /tmp/ltsmin1801043118183911222;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin1801043118183911222;'/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/stateBased11241156456331099155.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 125 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 125/125 places, 120/120 transitions.
Applied a total of 0 rules in 7 ms. Remains 125 /125 variables (removed 0) and now considering 120/120 (removed 0) transitions.
[2024-05-28 08:46:50] [INFO ] Invariant cache hit.
[2024-05-28 08:46:51] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-28 08:46:51] [INFO ] Invariant cache hit.
[2024-05-28 08:46:51] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
[2024-05-28 08:46:51] [INFO ] Redundant transitions in 24 ms returned []
Running 119 sub problems to find dead transitions.
[2024-05-28 08:46:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 45/169 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 08:46:52] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-28 08:46:52] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-28 08:46:52] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-28 08:46:52] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2024-05-28 08:46:52] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 5/175 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (OVERLAPS) 120/245 variables, 125/300 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 08:46:53] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
[2024-05-28 08:46:53] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-28 08:46:53] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-28 08:46:53] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-28 08:46:53] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 2 ms to minimize.
[2024-05-28 08:46:53] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 6/306 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 08:46:53] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-05-28 08:46:53] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-28 08:46:53] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
[2024-05-28 08:46:53] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 0 ms to minimize.
[2024-05-28 08:46:54] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-05-28 08:46:54] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 6/312 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 08:46:54] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/245 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 08:46:55] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/245 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/245 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 08:46:56] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/245 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 08:46:56] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-28 08:46:57] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/245 variables, 2/317 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/245 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 15 (OVERLAPS) 0/245 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 245/245 variables, and 317 constraints, problems are : Problem set: 0 solved, 119 unsolved in 7504 ms.
Refiners :[Domain max(s): 125/125 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 45/169 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 22/192 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (OVERLAPS) 120/245 variables, 125/317 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 119/436 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 08:47:00] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 1/437 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/245 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 10 (OVERLAPS) 0/245 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 245/245 variables, and 437 constraints, problems are : Problem set: 0 solved, 119 unsolved in 5884 ms.
Refiners :[Domain max(s): 125/125 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 23/23 constraints]
After SMT, in 13413ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 13414ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 13646 ms. Remains : 125/125 places, 120/120 transitions.
Built C files in :
/tmp/ltsmin15189365492636678398
[2024-05-28 08:47:04] [INFO ] Computing symmetric may disable matrix : 120 transitions.
[2024-05-28 08:47:04] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 08:47:04] [INFO ] Computing symmetric may enable matrix : 120 transitions.
[2024-05-28 08:47:04] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 08:47:04] [INFO ] Computing Do-Not-Accords matrix : 120 transitions.
[2024-05-28 08:47:04] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 08:47:04] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15189365492636678398
Running compilation step : cd /tmp/ltsmin15189365492636678398;'/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 289 ms.
Running link step : cd /tmp/ltsmin15189365492636678398;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin15189365492636678398;'/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/stateBased824820060870056068.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 08:47:19] [INFO ] Flatten gal took : 5 ms
[2024-05-28 08:47:19] [INFO ] Flatten gal took : 9 ms
[2024-05-28 08:47:19] [INFO ] Time to serialize gal into /tmp/LTL15229295378453608714.gal : 3 ms
[2024-05-28 08:47:19] [INFO ] Time to serialize properties into /tmp/LTL13026048952855495860.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/LTL15229295378453608714.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8075419041746628763.hoa' '-atoms' '/tmp/LTL13026048952855495860.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/LTL13026048952855495860.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8075419041746628763.hoa
Detected timeout of ITS tools.
[2024-05-28 08:47:34] [INFO ] Flatten gal took : 9 ms
[2024-05-28 08:47:34] [INFO ] Flatten gal took : 5 ms
[2024-05-28 08:47:34] [INFO ] Time to serialize gal into /tmp/LTL12992404623750045119.gal : 1 ms
[2024-05-28 08:47:34] [INFO ] Time to serialize properties into /tmp/LTL3030885665549909846.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/LTL12992404623750045119.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3030885665549909846.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("(((p8==1)&&(p22==1))||((p30==1)&&(p43==1)))")))
Formula 0 simplified : G!"(((p8==1)&&(p22==1))||((p30==1)&&(p43==1)))"
Detected timeout of ITS tools.
[2024-05-28 08:47:49] [INFO ] Flatten gal took : 15 ms
[2024-05-28 08:47:49] [INFO ] Applying decomposition
[2024-05-28 08:47:49] [INFO ] Flatten gal took : 5 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/graph7470724926560979005.txt' '-o' '/tmp/graph7470724926560979005.bin' '-w' '/tmp/graph7470724926560979005.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7470724926560979005.bin' '-l' '-1' '-v' '-w' '/tmp/graph7470724926560979005.weights' '-q' '0' '-e' '0.001'
[2024-05-28 08:47:49] [INFO ] Decomposing Gal with order
[2024-05-28 08:47:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 08:47:49] [INFO ] Removed a total of 75 redundant transitions.
[2024-05-28 08:47:49] [INFO ] Flatten gal took : 9 ms
[2024-05-28 08:47:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 72 labels/synchronizations in 3 ms.
[2024-05-28 08:47:49] [INFO ] Time to serialize gal into /tmp/LTL11609987470987519734.gal : 2 ms
[2024-05-28 08:47:49] [INFO ] Time to serialize properties into /tmp/LTL8161549548874510168.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/LTL11609987470987519734.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8161549548874510168.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("(((i0.i2.u3.p8==1)&&(i0.i2.u8.p22==1))||((i1.i2.u11.p30==1)&&(i1.i0.u16.p43==1)))")))
Formula 0 simplified : G!"(((i0.i2.u3.p8==1)&&(i0.i2.u8.p22==1))||((i1.i2.u11.p30==1)&&(i1.i0.u16.p43==1)))"
Detected timeout of ITS tools.
Treatment of property ShieldIIPs-PT-005A-LTLFireability-09 finished in 113144 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 G(p1))&&X(G(p1))))'
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 123/123 transitions.
Applied a total of 0 rules in 1 ms. Remains 128 /128 variables (removed 0) and now considering 123/123 (removed 0) transitions.
// Phase 1: matrix 123 rows 128 cols
[2024-05-28 08:48:04] [INFO ] Computed 46 invariants in 2 ms
[2024-05-28 08:48:05] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-28 08:48:05] [INFO ] Invariant cache hit.
[2024-05-28 08:48:05] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
Running 122 sub problems to find dead transitions.
[2024-05-28 08:48:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 46/173 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 08:48:06] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 1 ms to minimize.
[2024-05-28 08:48:06] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 0 ms to minimize.
[2024-05-28 08:48:06] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-28 08:48:06] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-05-28 08:48:06] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 5/179 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 123/251 variables, 128/307 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 08:48:07] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 08:48:07] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2024-05-28 08:48:07] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-05-28 08:48:07] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 3/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 0/251 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 251/251 variables, and 311 constraints, problems are : Problem set: 0 solved, 122 unsolved in 4201 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 46/173 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 9/183 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 123/251 variables, 128/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 122/433 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 08:48:10] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 0/251 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 251/251 variables, and 434 constraints, problems are : Problem set: 0 solved, 122 unsolved in 5515 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 10/10 constraints]
After SMT, in 9735ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 9736ms
Finished structural reductions in LTL mode , in 1 iterations and 9929 ms. Remains : 128/128 places, 123/123 transitions.
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p1), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-005A-LTLFireability-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-005A-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-005A-LTLFireability-10 finished in 10072 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G((p1 U !p2))))))'
Support contains 7 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 123/123 transitions.
Applied a total of 0 rules in 0 ms. Remains 128 /128 variables (removed 0) and now considering 123/123 (removed 0) transitions.
[2024-05-28 08:48:15] [INFO ] Invariant cache hit.
[2024-05-28 08:48:15] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-28 08:48:15] [INFO ] Invariant cache hit.
[2024-05-28 08:48:15] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
Running 122 sub problems to find dead transitions.
[2024-05-28 08:48:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 46/173 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 08:48:16] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-05-28 08:48:16] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-05-28 08:48:16] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-28 08:48:16] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2024-05-28 08:48:16] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 5/179 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 123/251 variables, 128/307 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 08:48:17] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 08:48:17] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
[2024-05-28 08:48:18] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2024-05-28 08:48:18] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 3/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 0/251 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 251/251 variables, and 311 constraints, problems are : Problem set: 0 solved, 122 unsolved in 4318 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 46/173 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 9/183 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 123/251 variables, 128/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 122/433 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 08:48:20] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 0/251 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 251/251 variables, and 434 constraints, problems are : Problem set: 0 solved, 122 unsolved in 5530 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 10/10 constraints]
After SMT, in 9875ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 9877ms
Finished structural reductions in LTL mode , in 1 iterations and 10061 ms. Remains : 128/128 places, 123/123 transitions.
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Running random walk in product with property : ShieldIIPs-PT-005A-LTLFireability-11
Product exploration explored 100000 steps with 50000 reset in 262 ms.
Product exploration explored 100000 steps with 50000 reset in 266 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) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)))), (X p0), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 13 factoid took 19 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-005A-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-005A-LTLFireability-11 finished in 10775 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||G(F(p1)))))))'
Support contains 5 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 123/123 transitions.
Applied a total of 0 rules in 1 ms. Remains 128 /128 variables (removed 0) and now considering 123/123 (removed 0) transitions.
[2024-05-28 08:48:25] [INFO ] Invariant cache hit.
[2024-05-28 08:48:25] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-28 08:48:25] [INFO ] Invariant cache hit.
[2024-05-28 08:48:25] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
Running 122 sub problems to find dead transitions.
[2024-05-28 08:48:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 46/173 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 08:48:26] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-28 08:48:26] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 1 ms to minimize.
[2024-05-28 08:48:26] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-28 08:48:27] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-28 08:48:27] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 5/179 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 123/251 variables, 128/307 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 08:48:28] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 08:48:28] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-05-28 08:48:28] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-05-28 08:48:28] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 3/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 0/251 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 251/251 variables, and 311 constraints, problems are : Problem set: 0 solved, 122 unsolved in 4273 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 46/173 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 9/183 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 123/251 variables, 128/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 122/433 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 08:48:31] [INFO ] Deduced a trap composed of 9 places in 17 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 0/251 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 251/251 variables, and 434 constraints, problems are : Problem set: 0 solved, 122 unsolved in 5496 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 10/10 constraints]
After SMT, in 9788ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 9789ms
Finished structural reductions in LTL mode , in 1 iterations and 9979 ms. Remains : 128/128 places, 123/123 transitions.
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-005A-LTLFireability-12
Stuttering criterion allowed to conclude after 2527 steps with 21 reset in 6 ms.
FORMULA ShieldIIPs-PT-005A-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-005A-LTLFireability-12 finished in 10150 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(((p1 U X(p2))||G(p3)))||p0)))'
Support contains 7 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 123/123 transitions.
Applied a total of 0 rules in 1 ms. Remains 128 /128 variables (removed 0) and now considering 123/123 (removed 0) transitions.
[2024-05-28 08:48:35] [INFO ] Invariant cache hit.
[2024-05-28 08:48:36] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-28 08:48:36] [INFO ] Invariant cache hit.
[2024-05-28 08:48:36] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
Running 122 sub problems to find dead transitions.
[2024-05-28 08:48:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 46/173 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 08:48:37] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-28 08:48:37] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2024-05-28 08:48:37] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-28 08:48:37] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-28 08:48:37] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 5/179 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 123/251 variables, 128/307 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 08:48:38] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 08:48:38] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2024-05-28 08:48:38] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-28 08:48:38] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 3/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 0/251 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 251/251 variables, and 311 constraints, problems are : Problem set: 0 solved, 122 unsolved in 4219 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 46/173 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 9/183 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 123/251 variables, 128/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 122/433 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 08:48:41] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 0/251 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 251/251 variables, and 434 constraints, problems are : Problem set: 0 solved, 122 unsolved in 5510 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 10/10 constraints]
After SMT, in 9747ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 9748ms
Finished structural reductions in LTL mode , in 1 iterations and 9947 ms. Remains : 128/128 places, 123/123 transitions.
Stuttering acceptance computed with spot in 307 ms :[true, (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p3)), (NOT p3), (NOT p2), (NOT p2)]
Running random walk in product with property : ShieldIIPs-PT-005A-LTLFireability-13
Product exploration explored 100000 steps with 50000 reset in 229 ms.
Product exploration explored 100000 steps with 50000 reset in 257 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 p1) (NOT p3) (NOT p2)), (X p0), (X (X (NOT p3))), (X (X (NOT (AND p1 p3)))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p3)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 15 ms. Reduced automaton from 9 states, 18 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-005A-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-005A-LTLFireability-13 finished in 10776 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(X(F((p0&&F((G(p1)||(p1&&F(!p2))))))))))'
Support contains 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 123/123 transitions.
Applied a total of 0 rules in 1 ms. Remains 128 /128 variables (removed 0) and now considering 123/123 (removed 0) transitions.
[2024-05-28 08:48:46] [INFO ] Invariant cache hit.
[2024-05-28 08:48:46] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-28 08:48:46] [INFO ] Invariant cache hit.
[2024-05-28 08:48:46] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
Running 122 sub problems to find dead transitions.
[2024-05-28 08:48:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 46/173 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 08:48:47] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-28 08:48:47] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-28 08:48:47] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-28 08:48:47] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-28 08:48:48] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 5/179 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 123/251 variables, 128/307 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 08:48:49] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 08:48:49] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
[2024-05-28 08:48:49] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-05-28 08:48:49] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 3/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 0/251 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 251/251 variables, and 311 constraints, problems are : Problem set: 0 solved, 122 unsolved in 4170 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 46/173 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 9/183 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 123/251 variables, 128/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 122/433 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 08:48:52] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 0/251 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 251/251 variables, and 434 constraints, problems are : Problem set: 0 solved, 122 unsolved in 5380 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 10/10 constraints]
After SMT, in 9579ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 9580ms
Finished structural reductions in LTL mode , in 1 iterations and 9779 ms. Remains : 128/128 places, 123/123 transitions.
Stuttering acceptance computed with spot in 233 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) p2)]
Running random walk in product with property : ShieldIIPs-PT-005A-LTLFireability-14
Product exploration explored 100000 steps with 4714 reset in 200 ms.
Product exploration explored 100000 steps with 4748 reset in 221 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 p1) (NOT p2))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 92 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 281 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) p2)]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 40000 steps (135 resets) in 313 ms. (127 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40004 steps (21 resets) in 258 ms. (154 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (16 resets) in 384 ms. (103 steps per ms) remains 2/2 properties
[2024-05-28 08:48:57] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 8/12 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 116/128 variables, 42/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 116/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 123/251 variables, 128/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/251 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 251/251 variables, and 302 constraints, problems are : Problem set: 0 solved, 2 unsolved in 95 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Problem apf1 is UNSAT
Problem apf5 is UNSAT
After SMT solving in domain Int declared 4/251 variables, and 4 constraints, problems are : Problem set: 2 solved, 0 unsolved in 18 ms.
Refiners :[Domain max(s): 4/128 constraints, Positive P Invariants (semi-flows): 0/46 constraints, State Equation: 0/128 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 126ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (G (OR (NOT p0) (NOT p1) (NOT p2))), (G (OR p1 (NOT p2)))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (AND p0 (NOT p1)))), (F p1), (F p2), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 189 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 209 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
[2024-05-28 08:48:58] [INFO ] Invariant cache hit.
[2024-05-28 08:48:58] [INFO ] [Real]Absence check using 46 positive place invariants in 10 ms returned sat
[2024-05-28 08:48:58] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2024-05-28 08:48:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 08:48:58] [INFO ] [Nat]Absence check using 46 positive place invariants in 8 ms returned sat
[2024-05-28 08:48:58] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2024-05-28 08:48:58] [INFO ] Computed and/alt/rep : 114/403/114 causal constraints (skipped 8 transitions) in 9 ms.
[2024-05-28 08:48:59] [INFO ] Added : 111 causal constraints over 23 iterations in 282 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 123/123 transitions.
Applied a total of 0 rules in 1 ms. Remains 128 /128 variables (removed 0) and now considering 123/123 (removed 0) transitions.
[2024-05-28 08:48:59] [INFO ] Invariant cache hit.
[2024-05-28 08:48:59] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-28 08:48:59] [INFO ] Invariant cache hit.
[2024-05-28 08:48:59] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
Running 122 sub problems to find dead transitions.
[2024-05-28 08:48:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 46/173 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 08:49:00] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2024-05-28 08:49:00] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-05-28 08:49:00] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-28 08:49:00] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-28 08:49:00] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 5/179 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 123/251 variables, 128/307 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 08:49:01] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 08:49:01] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
[2024-05-28 08:49:02] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2024-05-28 08:49:02] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 3/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 0/251 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 251/251 variables, and 311 constraints, problems are : Problem set: 0 solved, 122 unsolved in 4149 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 46/173 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 9/183 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 123/251 variables, 128/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 122/433 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 08:49:04] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 0/251 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 251/251 variables, and 434 constraints, problems are : Problem set: 0 solved, 122 unsolved in 5409 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 10/10 constraints]
After SMT, in 9577ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 9578ms
Finished structural reductions in LTL mode , in 1 iterations and 9768 ms. Remains : 128/128 places, 123/123 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) p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 87 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
RANDOM walk for 60 steps (0 resets) in 6 ms. (8 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) p0)]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (NOT p0)), (F p1)]
Knowledge based reduction with 1 factoid took 153 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 209 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 182 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
[2024-05-28 08:49:09] [INFO ] Invariant cache hit.
[2024-05-28 08:49:09] [INFO ] [Real]Absence check using 46 positive place invariants in 10 ms returned sat
[2024-05-28 08:49:09] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2024-05-28 08:49:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 08:49:09] [INFO ] [Nat]Absence check using 46 positive place invariants in 7 ms returned sat
[2024-05-28 08:49:10] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2024-05-28 08:49:10] [INFO ] Computed and/alt/rep : 114/403/114 causal constraints (skipped 8 transitions) in 9 ms.
[2024-05-28 08:49:10] [INFO ] Added : 111 causal constraints over 23 iterations in 291 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 167 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 6122 reset in 176 ms.
Product exploration explored 100000 steps with 6069 reset in 196 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 154 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Support contains 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 123/123 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 128 transition count 123
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 9 ms. Remains 128 /128 variables (removed 0) and now considering 123/123 (removed 0) transitions.
[2024-05-28 08:49:11] [INFO ] Redundant transitions in 20 ms returned [120]
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 121 sub problems to find dead transitions.
// Phase 1: matrix 122 rows 128 cols
[2024-05-28 08:49:11] [INFO ] Computed 46 invariants in 1 ms
[2024-05-28 08:49:11] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 46/173 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 08:49:12] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-28 08:49:12] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-28 08:49:12] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-28 08:49:12] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-28 08:49:12] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-05-28 08:49:12] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 1 ms to minimize.
Problem TDEAD35 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 6/180 constraints. Problems are: Problem set: 1 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/180 constraints. Problems are: Problem set: 1 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 122/250 variables, 128/308 constraints. Problems are: Problem set: 1 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/250 variables, 3/311 constraints. Problems are: Problem set: 1 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 0/311 constraints. Problems are: Problem set: 1 solved, 120 unsolved
[2024-05-28 08:49:14] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-28 08:49:14] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 0 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/250 variables, 2/313 constraints. Problems are: Problem set: 1 solved, 120 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/250 variables, 0/313 constraints. Problems are: Problem set: 1 solved, 120 unsolved
[2024-05-28 08:49:15] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/250 variables, 1/314 constraints. Problems are: Problem set: 1 solved, 120 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/250 variables, 0/314 constraints. Problems are: Problem set: 1 solved, 120 unsolved
At refinement iteration 13 (OVERLAPS) 0/250 variables, 0/314 constraints. Problems are: Problem set: 1 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 250/250 variables, and 314 constraints, problems are : Problem set: 1 solved, 120 unsolved in 6614 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 128/128 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 1 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 126/126 constraints. Problems are: Problem set: 1 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/126 constraints. Problems are: Problem set: 1 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 2/128 variables, 46/172 constraints. Problems are: Problem set: 1 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 2/174 constraints. Problems are: Problem set: 1 solved, 120 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 9/183 constraints. Problems are: Problem set: 1 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/183 constraints. Problems are: Problem set: 1 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 122/250 variables, 128/311 constraints. Problems are: Problem set: 1 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/250 variables, 3/314 constraints. Problems are: Problem set: 1 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 120/434 constraints. Problems are: Problem set: 1 solved, 120 unsolved
[2024-05-28 08:49:19] [INFO ] Deduced a trap composed of 11 places in 16 ms of which 0 ms to minimize.
[2024-05-28 08:49:20] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/250 variables, 2/436 constraints. Problems are: Problem set: 1 solved, 120 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/250 variables, 0/436 constraints. Problems are: Problem set: 1 solved, 120 unsolved
At refinement iteration 11 (OVERLAPS) 0/250 variables, 0/436 constraints. Problems are: Problem set: 1 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 250/250 variables, and 436 constraints, problems are : Problem set: 1 solved, 120 unsolved in 9265 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 128/128 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 120/121 constraints, Known Traps: 11/11 constraints]
After SMT, in 15898ms problems are : Problem set: 1 solved, 120 unsolved
Search for dead transitions found 1 dead transitions in 15899ms
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 : 128/128 places, 121/123 transitions.
Graph (complete) has 440 edges and 128 vertex of which 127 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 12 ms. Remains 127 /128 variables (removed 1) and now considering 121/121 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 127/128 places, 121/123 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 15965 ms. Remains : 127/128 places, 121/123 transitions.
Built C files in :
/tmp/ltsmin16632073821503944274
[2024-05-28 08:49:27] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16632073821503944274
Running compilation step : cd /tmp/ltsmin16632073821503944274;'/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 252 ms.
Running link step : cd /tmp/ltsmin16632073821503944274;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin16632073821503944274;'/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/stateBased9395713750949488564.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 123/123 transitions.
Applied a total of 0 rules in 1 ms. Remains 128 /128 variables (removed 0) and now considering 123/123 (removed 0) transitions.
// Phase 1: matrix 123 rows 128 cols
[2024-05-28 08:49:42] [INFO ] Computed 46 invariants in 13 ms
[2024-05-28 08:49:42] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-28 08:49:42] [INFO ] Invariant cache hit.
[2024-05-28 08:49:42] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
Running 122 sub problems to find dead transitions.
[2024-05-28 08:49:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 46/173 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 08:49:43] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-05-28 08:49:43] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-05-28 08:49:43] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-28 08:49:43] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-28 08:49:43] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 5/179 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 123/251 variables, 128/307 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 08:49:44] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 08:49:45] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2024-05-28 08:49:45] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2024-05-28 08:49:45] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 3/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 0/251 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 251/251 variables, and 311 constraints, problems are : Problem set: 0 solved, 122 unsolved in 4285 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 46/173 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 9/183 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 123/251 variables, 128/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 122/433 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 08:49:48] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 0/251 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 251/251 variables, and 434 constraints, problems are : Problem set: 0 solved, 122 unsolved in 5428 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 10/10 constraints]
After SMT, in 9734ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 9735ms
Finished structural reductions in LTL mode , in 1 iterations and 9939 ms. Remains : 128/128 places, 123/123 transitions.
Built C files in :
/tmp/ltsmin12645508199259273675
[2024-05-28 08:49:52] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12645508199259273675
Running compilation step : cd /tmp/ltsmin12645508199259273675;'/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 282 ms.
Running link step : cd /tmp/ltsmin12645508199259273675;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin12645508199259273675;'/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/stateBased8452738125806297430.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 08:50:07] [INFO ] Flatten gal took : 5 ms
[2024-05-28 08:50:07] [INFO ] Flatten gal took : 4 ms
[2024-05-28 08:50:07] [INFO ] Time to serialize gal into /tmp/LTL4880189731387033843.gal : 1 ms
[2024-05-28 08:50:07] [INFO ] Time to serialize properties into /tmp/LTL13944149034061695446.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/LTL4880189731387033843.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11116405518770050274.hoa' '-atoms' '/tmp/LTL13944149034061695446.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/LTL13944149034061695446.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11116405518770050274.hoa
Detected timeout of ITS tools.
[2024-05-28 08:50:22] [INFO ] Flatten gal took : 10 ms
[2024-05-28 08:50:22] [INFO ] Flatten gal took : 7 ms
[2024-05-28 08:50:22] [INFO ] Time to serialize gal into /tmp/LTL17943928698126761859.gal : 3 ms
[2024-05-28 08:50:22] [INFO ] Time to serialize properties into /tmp/LTL16924000002792068796.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/LTL17943928698126761859.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16924000002792068796.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 : !((X(X(X(F((F((G("(((p106==1)&&(p117==1))||((p54==1)&&(p69==1)))"))||(("(((p106==1)&&(p117==1))||((p54==1)&&(p69==1)))")&&(F("((p106==...209
Formula 0 simplified : XXXG(!"((p106==0)||(p117==0))" | G(F!"(((p106==1)&&(p117==1))||((p54==1)&&(p69==1)))" & (!"(((p106==1)&&(p117==1))||((p54==1)&&(p69=...193
Detected timeout of ITS tools.
[2024-05-28 08:50:37] [INFO ] Flatten gal took : 13 ms
[2024-05-28 08:50:37] [INFO ] Applying decomposition
[2024-05-28 08:50:37] [INFO ] Flatten gal took : 5 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/graph7142555720464627232.txt' '-o' '/tmp/graph7142555720464627232.bin' '-w' '/tmp/graph7142555720464627232.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7142555720464627232.bin' '-l' '-1' '-v' '-w' '/tmp/graph7142555720464627232.weights' '-q' '0' '-e' '0.001'
[2024-05-28 08:50:37] [INFO ] Decomposing Gal with order
[2024-05-28 08:50:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 08:50:37] [INFO ] Removed a total of 80 redundant transitions.
[2024-05-28 08:50:37] [INFO ] Flatten gal took : 9 ms
[2024-05-28 08:50:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 80 labels/synchronizations in 3 ms.
[2024-05-28 08:50:37] [INFO ] Time to serialize gal into /tmp/LTL7058890525668002430.gal : 2 ms
[2024-05-28 08:50:37] [INFO ] Time to serialize properties into /tmp/LTL12943348660242261291.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/LTL7058890525668002430.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12943348660242261291.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 : !((X(X(X(F((F((G("(((i4.i2.u38.p106==1)&&(i4.i2.u42.p117==1))||((i2.i2.u19.p54==1)&&(i2.i2.u25.p69==1)))"))||(("(((i4.i2.u38.p106==1)&...329
Formula 0 simplified : XXXG(!"((i4.i2.u38.p106==0)||(i4.i2.u42.p117==0))" | G(F!"(((i4.i2.u38.p106==1)&&(i4.i2.u42.p117==1))||((i2.i2.u19.p54==1)&&(i2.i2.u...313
Detected timeout of ITS tools.
Treatment of property ShieldIIPs-PT-005A-LTLFireability-14 finished in 125906 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(p1)||p0))))'
Support contains 5 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 123/123 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 128 transition count 122
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 127 transition count 122
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 126 transition count 121
Applied a total of 4 rules in 17 ms. Remains 126 /128 variables (removed 2) and now considering 121/123 (removed 2) transitions.
// Phase 1: matrix 121 rows 126 cols
[2024-05-28 08:50:52] [INFO ] Computed 46 invariants in 1 ms
[2024-05-28 08:50:52] [INFO ] Implicit Places using invariants in 72 ms returned [112]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 88 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 125/128 places, 121/123 transitions.
Applied a total of 0 rules in 2 ms. Remains 125 /125 variables (removed 0) and now considering 121/121 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 108 ms. Remains : 125/128 places, 121/123 transitions.
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-005A-LTLFireability-15
Product exploration explored 100000 steps with 373 reset in 231 ms.
Product exploration explored 100000 steps with 367 reset in 252 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 194 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 7951 steps (27 resets) in 55 ms. (141 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 9 factoid took 221 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 125 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 125/125 places, 121/121 transitions.
Applied a total of 0 rules in 4 ms. Remains 125 /125 variables (removed 0) and now considering 121/121 (removed 0) transitions.
// Phase 1: matrix 121 rows 125 cols
[2024-05-28 08:50:53] [INFO ] Computed 45 invariants in 1 ms
[2024-05-28 08:50:53] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-28 08:50:53] [INFO ] Invariant cache hit.
[2024-05-28 08:50:54] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
[2024-05-28 08:50:54] [INFO ] Redundant transitions in 19 ms returned [113]
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 119 sub problems to find dead transitions.
// Phase 1: matrix 120 rows 125 cols
[2024-05-28 08:50:54] [INFO ] Computed 45 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 45/169 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 08:50:55] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-28 08:50:55] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2024-05-28 08:50:55] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-28 08:50:55] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-28 08:50:55] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 5/175 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (OVERLAPS) 120/245 variables, 125/300 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 08:50:56] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-28 08:50:56] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2024-05-28 08:50:56] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-28 08:50:56] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2024-05-28 08:50:56] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-28 08:50:56] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-28 08:50:56] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-28 08:50:56] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-05-28 08:50:56] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 9/309 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (OVERLAPS) 0/245 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 245/245 variables, and 309 constraints, problems are : Problem set: 0 solved, 119 unsolved in 4066 ms.
Refiners :[Domain max(s): 125/125 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 45/169 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 14/184 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (OVERLAPS) 120/245 variables, 125/309 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 119/428 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 08:50:59] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 1/429 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 08:51:02] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/245 variables, 1/430 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 08:51:04] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/245 variables, 1/431 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/245 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 12 (OVERLAPS) 0/245 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 245/245 variables, and 431 constraints, problems are : Problem set: 0 solved, 119 unsolved in 17452 ms.
Refiners :[Domain max(s): 125/125 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 17/17 constraints]
After SMT, in 21537ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 21538ms
Starting structural reductions in SI_LTL mode, iteration 1 : 125/125 places, 120/121 transitions.
Applied a total of 0 rules in 7 ms. Remains 125 /125 variables (removed 0) and now considering 120/120 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 21751 ms. Remains : 125/125 places, 120/121 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 78 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 6964 steps (23 resets) in 45 ms. (151 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 9 factoid took 202 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 362 reset in 235 ms.
Product exploration explored 100000 steps with 367 reset in 264 ms.
Built C files in :
/tmp/ltsmin11745208054610842628
[2024-05-28 08:51:16] [INFO ] Computing symmetric may disable matrix : 120 transitions.
[2024-05-28 08:51:16] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 08:51:16] [INFO ] Computing symmetric may enable matrix : 120 transitions.
[2024-05-28 08:51:16] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 08:51:16] [INFO ] Computing Do-Not-Accords matrix : 120 transitions.
[2024-05-28 08:51:16] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 08:51:16] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11745208054610842628
Running compilation step : cd /tmp/ltsmin11745208054610842628;'/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 284 ms.
Running link step : cd /tmp/ltsmin11745208054610842628;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin11745208054610842628;'/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/stateBased5824995497641819389.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 125 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 125/125 places, 120/120 transitions.
Applied a total of 0 rules in 6 ms. Remains 125 /125 variables (removed 0) and now considering 120/120 (removed 0) transitions.
[2024-05-28 08:51:31] [INFO ] Invariant cache hit.
[2024-05-28 08:51:31] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-28 08:51:32] [INFO ] Invariant cache hit.
[2024-05-28 08:51:32] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
[2024-05-28 08:51:32] [INFO ] Redundant transitions in 16 ms returned []
Running 119 sub problems to find dead transitions.
[2024-05-28 08:51:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 45/169 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 08:51:32] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-28 08:51:33] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 0 ms to minimize.
[2024-05-28 08:51:33] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-05-28 08:51:33] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-28 08:51:33] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 5/175 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (OVERLAPS) 120/245 variables, 125/300 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 08:51:34] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-05-28 08:51:34] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-28 08:51:34] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2024-05-28 08:51:34] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-28 08:51:34] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-28 08:51:34] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 6/306 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 08:51:34] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2024-05-28 08:51:34] [INFO ] Deduced a trap composed of 21 places in 20 ms of which 0 ms to minimize.
[2024-05-28 08:51:34] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 1 ms to minimize.
[2024-05-28 08:51:34] [INFO ] Deduced a trap composed of 11 places in 17 ms of which 0 ms to minimize.
[2024-05-28 08:51:34] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-28 08:51:34] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 6/312 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 08:51:35] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/245 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 08:51:36] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/245 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/245 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 08:51:37] [INFO ] Deduced a trap composed of 8 places in 17 ms of which 0 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/245 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 08:51:37] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
[2024-05-28 08:51:37] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/245 variables, 2/317 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/245 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 15 (OVERLAPS) 0/245 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 245/245 variables, and 317 constraints, problems are : Problem set: 0 solved, 119 unsolved in 7483 ms.
Refiners :[Domain max(s): 125/125 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 45/169 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 22/192 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (OVERLAPS) 120/245 variables, 125/317 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 119/436 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 08:51:41] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 1/437 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/245 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 10 (OVERLAPS) 0/245 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 245/245 variables, and 437 constraints, problems are : Problem set: 0 solved, 119 unsolved in 6035 ms.
Refiners :[Domain max(s): 125/125 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 23/23 constraints]
After SMT, in 13539ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 13540ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 13734 ms. Remains : 125/125 places, 120/120 transitions.
Built C files in :
/tmp/ltsmin8957105082358646464
[2024-05-28 08:51:45] [INFO ] Computing symmetric may disable matrix : 120 transitions.
[2024-05-28 08:51:45] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 08:51:45] [INFO ] Computing symmetric may enable matrix : 120 transitions.
[2024-05-28 08:51:45] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 08:51:45] [INFO ] Computing Do-Not-Accords matrix : 120 transitions.
[2024-05-28 08:51:45] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 08:51:45] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8957105082358646464
Running compilation step : cd /tmp/ltsmin8957105082358646464;'/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 281 ms.
Running link step : cd /tmp/ltsmin8957105082358646464;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin8957105082358646464;'/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/stateBased13813914885236166364.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 08:52:00] [INFO ] Flatten gal took : 4 ms
[2024-05-28 08:52:00] [INFO ] Flatten gal took : 4 ms
[2024-05-28 08:52:00] [INFO ] Time to serialize gal into /tmp/LTL11158865852074519735.gal : 1 ms
[2024-05-28 08:52:00] [INFO ] Time to serialize properties into /tmp/LTL1564110087589435796.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/LTL11158865852074519735.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14906659794875694760.hoa' '-atoms' '/tmp/LTL1564110087589435796.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/LTL1564110087589435796.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14906659794875694760.hoa
Detected timeout of ITS tools.
[2024-05-28 08:52:15] [INFO ] Flatten gal took : 7 ms
[2024-05-28 08:52:15] [INFO ] Flatten gal took : 7 ms
[2024-05-28 08:52:15] [INFO ] Time to serialize gal into /tmp/LTL10810057195653844364.gal : 2 ms
[2024-05-28 08:52:15] [INFO ] Time to serialize properties into /tmp/LTL5823766666533599549.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/LTL10810057195653844364.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5823766666533599549.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 : !((G(F(("((p72==1)||(p90==0))")||(G("(((p13==0)||(p23==0))||(p25==0))"))))))
Formula 0 simplified : G(F!"(((p13==0)||(p23==0))||(p25==0))" & FG!"((p72==1)||(p90==0))")
Detected timeout of ITS tools.
[2024-05-28 08:52:30] [INFO ] Flatten gal took : 4 ms
[2024-05-28 08:52:30] [INFO ] Applying decomposition
[2024-05-28 08:52:30] [INFO ] Flatten gal took : 4 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/graph17914932320918996439.txt' '-o' '/tmp/graph17914932320918996439.bin' '-w' '/tmp/graph17914932320918996439.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17914932320918996439.bin' '-l' '-1' '-v' '-w' '/tmp/graph17914932320918996439.weights' '-q' '0' '-e' '0.001'
[2024-05-28 08:52:30] [INFO ] Decomposing Gal with order
[2024-05-28 08:52:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 08:52:30] [INFO ] Removed a total of 75 redundant transitions.
[2024-05-28 08:52:30] [INFO ] Flatten gal took : 9 ms
[2024-05-28 08:52:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 72 labels/synchronizations in 3 ms.
[2024-05-28 08:52:30] [INFO ] Time to serialize gal into /tmp/LTL17491692102631545679.gal : 2 ms
[2024-05-28 08:52:30] [INFO ] Time to serialize properties into /tmp/LTL14734932566162336745.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/LTL17491692102631545679.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14734932566162336745.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(("((i2.i2.u26.p72==1)||(i3.i0.u33.p90==0))")||(G("(((i0.i1.u5.p13==0)||(i0.i1.u8.p23==0))||(i0.i2.u9.p25==0))"))))))
Formula 0 simplified : G(F!"(((i0.i1.u5.p13==0)||(i0.i1.u8.p23==0))||(i0.i2.u9.p25==0))" & FG!"((i2.i2.u26.p72==1)||(i3.i0.u33.p90==0))")
Detected timeout of ITS tools.
Treatment of property ShieldIIPs-PT-005A-LTLFireability-15 finished in 113392 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(F(p0))||G(p1))))'
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)))'
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)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((p0&&F((G(p1)||(p1&&F(!p2))))))))))'
Found a Shortening insensitive property : ShieldIIPs-PT-005A-LTLFireability-14
Stuttering acceptance computed with spot in 278 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) p2)]
Support contains 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 128/128 places, 123/123 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 128 transition count 122
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 127 transition count 122
Applied a total of 2 rules in 8 ms. Remains 127 /128 variables (removed 1) and now considering 122/123 (removed 1) transitions.
// Phase 1: matrix 122 rows 127 cols
[2024-05-28 08:52:46] [INFO ] Computed 46 invariants in 1 ms
[2024-05-28 08:52:46] [INFO ] Implicit Places using invariants in 71 ms returned [112]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 72 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 126/128 places, 122/123 transitions.
Applied a total of 0 rules in 2 ms. Remains 126 /126 variables (removed 0) and now considering 122/122 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 83 ms. Remains : 126/128 places, 122/123 transitions.
Running random walk in product with property : ShieldIIPs-PT-005A-LTLFireability-14
Product exploration explored 100000 steps with 5298 reset in 191 ms.
Product exploration explored 100000 steps with 5296 reset in 214 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 p1) (NOT p2))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 87 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 275 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) p2)]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 40000 steps (137 resets) in 195 ms. (204 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40003 steps (21 resets) in 70 ms. (563 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (17 resets) in 73 ms. (540 steps per ms) remains 2/2 properties
// Phase 1: matrix 122 rows 126 cols
[2024-05-28 08:52:47] [INFO ] Computed 45 invariants in 1 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 8/12 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 114/126 variables, 41/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 114/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 122/248 variables, 126/297 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/248 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/248 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 248/248 variables, and 297 constraints, problems are : Problem set: 0 solved, 2 unsolved in 98 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Problem apf1 is UNSAT
Problem apf5 is UNSAT
After SMT solving in domain Int declared 4/248 variables, and 4 constraints, problems are : Problem set: 2 solved, 0 unsolved in 14 ms.
Refiners :[Domain max(s): 4/126 constraints, Positive P Invariants (semi-flows): 0/45 constraints, State Equation: 0/126 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 117ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (G (OR (NOT p0) (NOT p1) (NOT p2))), (G (OR p1 (NOT p2)))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (AND p0 (NOT p1)))), (F p1), (F p2), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 229 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 204 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
[2024-05-28 08:52:48] [INFO ] Invariant cache hit.
[2024-05-28 08:52:48] [INFO ] [Real]Absence check using 45 positive place invariants in 9 ms returned sat
[2024-05-28 08:52:48] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2024-05-28 08:52:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 08:52:48] [INFO ] [Nat]Absence check using 45 positive place invariants in 8 ms returned sat
[2024-05-28 08:52:48] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2024-05-28 08:52:48] [INFO ] Computed and/alt/rep : 113/394/113 causal constraints (skipped 8 transitions) in 10 ms.
[2024-05-28 08:52:49] [INFO ] Added : 78 causal constraints over 16 iterations in 232 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 4 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 122/122 transitions.
Applied a total of 0 rules in 1 ms. Remains 126 /126 variables (removed 0) and now considering 122/122 (removed 0) transitions.
[2024-05-28 08:52:49] [INFO ] Invariant cache hit.
[2024-05-28 08:52:49] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-28 08:52:49] [INFO ] Invariant cache hit.
[2024-05-28 08:52:49] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
Running 121 sub problems to find dead transitions.
[2024-05-28 08:52:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 125/125 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 45/170 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 08:52:50] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-28 08:52:50] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2024-05-28 08:52:50] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-28 08:52:50] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-28 08:52:50] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 5/176 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (OVERLAPS) 122/248 variables, 126/302 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 08:52:51] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2024-05-28 08:52:51] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-28 08:52:51] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/248 variables, 3/305 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 08:52:51] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-05-28 08:52:51] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 2/307 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 08:52:52] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-05-28 08:52:52] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
[2024-05-28 08:52:52] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 0 ms to minimize.
[2024-05-28 08:52:52] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2024-05-28 08:52:52] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-05-28 08:52:53] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-28 08:52:53] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/248 variables, 7/314 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/248 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 11 (OVERLAPS) 0/248 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 248/248 variables, and 314 constraints, problems are : Problem set: 0 solved, 121 unsolved in 5177 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 125/125 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 45/170 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 17/188 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (OVERLAPS) 122/248 variables, 126/314 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/248 variables, 121/435 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 08:52:57] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 1/436 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/248 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 10 (OVERLAPS) 0/248 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 248/248 variables, and 436 constraints, problems are : Problem set: 0 solved, 121 unsolved in 13385 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 18/18 constraints]
After SMT, in 18582ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 18583ms
Finished structural reductions in LTL mode , in 1 iterations and 18778 ms. Remains : 126/126 places, 122/122 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) p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 83 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 207 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
RANDOM walk for 69 steps (0 resets) in 5 ms. (11 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) p0)]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (NOT p0)), (F p1)]
Knowledge based reduction with 1 factoid took 176 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 210 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
[2024-05-28 08:53:08] [INFO ] Invariant cache hit.
[2024-05-28 08:53:08] [INFO ] [Real]Absence check using 45 positive place invariants in 9 ms returned sat
[2024-05-28 08:53:08] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2024-05-28 08:53:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 08:53:09] [INFO ] [Nat]Absence check using 45 positive place invariants in 8 ms returned sat
[2024-05-28 08:53:09] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2024-05-28 08:53:09] [INFO ] Computed and/alt/rep : 113/394/113 causal constraints (skipped 8 transitions) in 9 ms.
[2024-05-28 08:53:09] [INFO ] Added : 78 causal constraints over 16 iterations in 223 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 196 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 7004 reset in 174 ms.
Product exploration explored 100000 steps with 7030 reset in 203 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 202 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Support contains 4 out of 126 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 126/126 places, 122/122 transitions.
Applied a total of 0 rules in 5 ms. Remains 126 /126 variables (removed 0) and now considering 122/122 (removed 0) transitions.
[2024-05-28 08:53:10] [INFO ] Redundant transitions in 25 ms returned [119]
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 120 sub problems to find dead transitions.
// Phase 1: matrix 121 rows 126 cols
[2024-05-28 08:53:10] [INFO ] Computed 45 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 125/125 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 45/170 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 08:53:11] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-28 08:53:11] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-05-28 08:53:11] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2024-05-28 08:53:11] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2024-05-28 08:53:11] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 5/176 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 121/247 variables, 126/302 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 08:53:12] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/247 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/247 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 08:53:13] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
[2024-05-28 08:53:13] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-28 08:53:13] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-28 08:53:13] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/247 variables, 4/307 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 08:53:14] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/247 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/247 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 08:53:15] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/247 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 08:53:15] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-28 08:53:15] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/247 variables, 2/311 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 08:53:16] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/247 variables, 1/312 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 08:53:16] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/247 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 08:53:17] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/247 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/247 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 18 (OVERLAPS) 0/247 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 247/247 variables, and 314 constraints, problems are : Problem set: 0 solved, 120 unsolved in 9156 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 125/125 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 45/170 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 17/188 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 121/247 variables, 126/314 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/247 variables, 120/434 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/247 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (OVERLAPS) 0/247 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 247/247 variables, and 434 constraints, problems are : Problem set: 0 solved, 120 unsolved in 6095 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 17/17 constraints]
After SMT, in 15272ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 15273ms
Starting structural reductions in SI_LTL mode, iteration 1 : 126/126 places, 121/122 transitions.
Applied a total of 0 rules in 6 ms. Remains 126 /126 variables (removed 0) and now considering 121/121 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 15315 ms. Remains : 126/126 places, 121/122 transitions.
Built C files in :
/tmp/ltsmin4356138338246072941
[2024-05-28 08:53:25] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4356138338246072941
Running compilation step : cd /tmp/ltsmin4356138338246072941;'/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 273 ms.
Running link step : cd /tmp/ltsmin4356138338246072941;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin4356138338246072941;'/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/stateBased15346921685538734041.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 122/122 transitions.
Applied a total of 0 rules in 3 ms. Remains 126 /126 variables (removed 0) and now considering 122/122 (removed 0) transitions.
// Phase 1: matrix 122 rows 126 cols
[2024-05-28 08:53:40] [INFO ] Computed 45 invariants in 2 ms
[2024-05-28 08:53:40] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-28 08:53:40] [INFO ] Invariant cache hit.
[2024-05-28 08:53:40] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
Running 121 sub problems to find dead transitions.
[2024-05-28 08:53:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 125/125 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 45/170 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 08:53:41] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-28 08:53:41] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-05-28 08:53:41] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-28 08:53:41] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2024-05-28 08:53:41] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 5/176 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (OVERLAPS) 122/248 variables, 126/302 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 08:53:42] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-28 08:53:42] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 0 ms to minimize.
[2024-05-28 08:53:43] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/248 variables, 3/305 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 08:53:43] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-28 08:53:43] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 2/307 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 08:53:43] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-28 08:53:44] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2024-05-28 08:53:44] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
[2024-05-28 08:53:44] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-05-28 08:53:44] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-28 08:53:44] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-28 08:53:44] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/248 variables, 7/314 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/248 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 11 (OVERLAPS) 0/248 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 248/248 variables, and 314 constraints, problems are : Problem set: 0 solved, 121 unsolved in 5054 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 125/125 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 45/170 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 17/188 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (OVERLAPS) 122/248 variables, 126/314 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/248 variables, 121/435 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 08:53:48] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 1/436 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/248 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 10 (OVERLAPS) 0/248 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 248/248 variables, and 436 constraints, problems are : Problem set: 0 solved, 121 unsolved in 13135 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 18/18 constraints]
After SMT, in 18208ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 18209ms
Finished structural reductions in LTL mode , in 1 iterations and 18399 ms. Remains : 126/126 places, 122/122 transitions.
Built C files in :
/tmp/ltsmin9758656139691875569
[2024-05-28 08:53:59] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9758656139691875569
Running compilation step : cd /tmp/ltsmin9758656139691875569;'/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 266 ms.
Running link step : cd /tmp/ltsmin9758656139691875569;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin9758656139691875569;'/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/stateBased3915264794592609050.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 08:54:14] [INFO ] Flatten gal took : 5 ms
[2024-05-28 08:54:14] [INFO ] Flatten gal took : 4 ms
[2024-05-28 08:54:14] [INFO ] Time to serialize gal into /tmp/LTL15859933394874717929.gal : 1 ms
[2024-05-28 08:54:14] [INFO ] Time to serialize properties into /tmp/LTL15914114914053030532.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/LTL15859933394874717929.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6389156093549338329.hoa' '-atoms' '/tmp/LTL15914114914053030532.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/LTL15914114914053030532.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6389156093549338329.hoa
Detected timeout of ITS tools.
[2024-05-28 08:54:29] [INFO ] Flatten gal took : 8 ms
[2024-05-28 08:54:29] [INFO ] Flatten gal took : 4 ms
[2024-05-28 08:54:29] [INFO ] Time to serialize gal into /tmp/LTL12431821607735308982.gal : 1 ms
[2024-05-28 08:54:29] [INFO ] Time to serialize properties into /tmp/LTL15593741187881237783.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/LTL12431821607735308982.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15593741187881237783.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 : !((X(X(X(F((F((G("(((p106==1)&&(p117==1))||((p54==1)&&(p69==1)))"))||(("(((p106==1)&&(p117==1))||((p54==1)&&(p69==1)))")&&(F("((p106==...209
Formula 0 simplified : XXXG(!"((p106==0)||(p117==0))" | G(F!"(((p106==1)&&(p117==1))||((p54==1)&&(p69==1)))" & (!"(((p106==1)&&(p117==1))||((p54==1)&&(p69=...193
Detected timeout of ITS tools.
[2024-05-28 08:54:44] [INFO ] Flatten gal took : 10 ms
[2024-05-28 08:54:44] [INFO ] Applying decomposition
[2024-05-28 08:54:44] [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/graph18103978085216527308.txt' '-o' '/tmp/graph18103978085216527308.bin' '-w' '/tmp/graph18103978085216527308.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18103978085216527308.bin' '-l' '-1' '-v' '-w' '/tmp/graph18103978085216527308.weights' '-q' '0' '-e' '0.001'
[2024-05-28 08:54:44] [INFO ] Decomposing Gal with order
[2024-05-28 08:54:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 08:54:44] [INFO ] Removed a total of 77 redundant transitions.
[2024-05-28 08:54:44] [INFO ] Flatten gal took : 9 ms
[2024-05-28 08:54:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 80 labels/synchronizations in 2 ms.
[2024-05-28 08:54:44] [INFO ] Time to serialize gal into /tmp/LTL9266556380743625747.gal : 1 ms
[2024-05-28 08:54:44] [INFO ] Time to serialize properties into /tmp/LTL13177301616280637320.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/LTL9266556380743625747.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13177301616280637320.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 : !((X(X(X(F((F((G("(((i4.i1.u38.p106==1)&&(i4.i1.u41.p117==1))||((i2.i1.u19.p54==1)&&(i2.i1.u25.p69==1)))"))||(("(((i4.i1.u38.p106==1)&...329
Formula 0 simplified : XXXG(!"((i4.i1.u38.p106==0)||(i4.i1.u41.p117==0))" | G(F!"(((i4.i1.u38.p106==1)&&(i4.i1.u41.p117==1))||((i2.i1.u19.p54==1)&&(i2.i1.u...313
Detected timeout of ITS tools.
Treatment of property ShieldIIPs-PT-005A-LTLFireability-14 finished in 132965 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(p1)||p0))))'
[2024-05-28 08:54:59] [INFO ] Flatten gal took : 10 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4833193791425653424
[2024-05-28 08:54:59] [INFO ] Computing symmetric may disable matrix : 123 transitions.
[2024-05-28 08:54:59] [INFO ] Applying decomposition
[2024-05-28 08:54:59] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 08:54:59] [INFO ] Computing symmetric may enable matrix : 123 transitions.
[2024-05-28 08:54:59] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 08:54:59] [INFO ] Flatten gal took : 5 ms
[2024-05-28 08:54:59] [INFO ] Computing Do-Not-Accords matrix : 123 transitions.
[2024-05-28 08:54:59] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 08:54:59] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4833193791425653424
Running compilation step : cd /tmp/ltsmin4833193791425653424;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '120' '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/graph14245348166424544805.txt' '-o' '/tmp/graph14245348166424544805.bin' '-w' '/tmp/graph14245348166424544805.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14245348166424544805.bin' '-l' '-1' '-v' '-w' '/tmp/graph14245348166424544805.weights' '-q' '0' '-e' '0.001'
[2024-05-28 08:54:59] [INFO ] Decomposing Gal with order
[2024-05-28 08:54:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 08:54:59] [INFO ] Removed a total of 80 redundant transitions.
[2024-05-28 08:54:59] [INFO ] Flatten gal took : 8 ms
[2024-05-28 08:54:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 80 labels/synchronizations in 2 ms.
[2024-05-28 08:54:59] [INFO ] Time to serialize gal into /tmp/LTLFireability15158994117392930019.gal : 2 ms
[2024-05-28 08:54:59] [INFO ] Time to serialize properties into /tmp/LTLFireability2313884527687941931.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/LTLFireability15158994117392930019.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2313884527687941931.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 6 LTL properties
Checking formula 0 : !((F((G(F("((i2.i1.u19.p54==1)&&(i2.i1.u25.p69==1))")))||(G("(i4.i2.u42.p115==0)")))))
Formula 0 simplified : G(FG!"((i2.i1.u19.p54==1)&&(i2.i1.u25.p69==1))" & F!"(i4.i2.u42.p115==0)")
Compilation finished in 312 ms.
Running link step : cd /tmp/ltsmin4833193791425653424;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin4833193791425653424;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(([](<>((LTLAPp0==true)))||[]((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>100 s) on command cd /tmp/ltsmin4833193791425653424;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(([](<>((LTLAPp0==true)))||[]((LTLAPp1==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin4833193791425653424;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp2==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>100 s) on command cd /tmp/ltsmin4833193791425653424;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp2==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin4833193791425653424;'/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' '[](<>((LTLAPp3==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>100 s) on command cd /tmp/ltsmin4833193791425653424;'/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' '[](<>((LTLAPp3==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin4833193791425653424;'/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' '<>((LTLAPp4==true))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>100 s) on command cd /tmp/ltsmin4833193791425653424;'/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' '<>((LTLAPp4==true))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin4833193791425653424;'/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(X(X(<>(((LTLAPp5==true)&&<>(([]((LTLAPp6==true))||((LTLAPp6==true)&&<>(!(LTLAPp7==true))))))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>100 s) on command cd /tmp/ltsmin4833193791425653424;'/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(X(X(<>(((LTLAPp5==true)&&<>(([]((LTLAPp6==true))||((LTLAPp6==true)&&<>(!(LTLAPp7==true))))))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin4833193791425653424;'/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' '[](<>(([]((LTLAPp9==true))||(LTLAPp8==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>100 s) on command cd /tmp/ltsmin4833193791425653424;'/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' '[](<>(([]((LTLAPp9==true))||(LTLAPp8==true))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 4800 s
Running LTSmin : cd /tmp/ltsmin4833193791425653424;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(([](<>((LTLAPp0==true)))||[]((LTLAPp1==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.017: Loading model from ./gal.so
pins2lts-mc-linux64( 3/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.017: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.025: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.023: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.023: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.026: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.026: Initializing POR dependencies: labels 133, guards 123
pins2lts-mc-linux64( 4/ 8), 0.024: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.051: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.051: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.052: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.054: LTL layer: formula: <>(([](<>((LTLAPp0==true)))||[]((LTLAPp1==true))))
pins2lts-mc-linux64( 6/ 8), 0.054: "<>(([](<>((LTLAPp0==true)))||[]((LTLAPp1==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.054: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.141: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.155: There are 134 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.155: State length is 129, there are 129 groups
pins2lts-mc-linux64( 0/ 8), 0.155: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.155: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.155: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.155: Visible groups: 0 / 129, labels: 2 / 134
pins2lts-mc-linux64( 0/ 8), 0.155: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.155: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 1/ 8), 0.180: [Blue] ~120 levels ~960 states ~2416 transitions
pins2lts-mc-linux64( 1/ 8), 0.199: [Blue] ~160 levels ~1920 states ~3848 transitions
pins2lts-mc-linux64( 0/ 8), 0.222: [Blue] ~168 levels ~3840 states ~6992 transitions
pins2lts-mc-linux64( 0/ 8), 0.264: [Blue] ~170 levels ~7680 states ~12240 transitions
pins2lts-mc-linux64( 0/ 8), 0.338: [Blue] ~170 levels ~15360 states ~22784 transitions
pins2lts-mc-linux64( 0/ 8), 0.533: [Blue] ~170 levels ~30720 states ~45248 transitions
pins2lts-mc-linux64( 0/ 8), 0.830: [Blue] ~170 levels ~61440 states ~92136 transitions
pins2lts-mc-linux64( 0/ 8), 1.428: [Blue] ~170 levels ~122880 states ~184512 transitions
pins2lts-mc-linux64( 2/ 8), 2.398: [Blue] ~184 levels ~245760 states ~368040 transitions
pins2lts-mc-linux64( 2/ 8), 4.105: [Blue] ~184 levels ~491520 states ~765192 transitions
pins2lts-mc-linux64( 2/ 8), 6.819: [Blue] ~185 levels ~983040 states ~1556112 transitions
pins2lts-mc-linux64( 3/ 8), 11.721: [Blue] ~206 levels ~1966080 states ~3131920 transitions
pins2lts-mc-linux64( 3/ 8), 21.280: [Blue] ~206 levels ~3932160 states ~6277104 transitions
pins2lts-mc-linux64( 3/ 8), 41.021: [Blue] ~206 levels ~7864320 states ~12737208 transitions
pins2lts-mc-linux64( 7/ 8), 80.481: [Blue] ~221 levels ~15728640 states ~26024624 transitions
pins2lts-mc-linux64( 7/ 8), 160.138: [Blue] ~222 levels ~31457280 states ~52473416 transitions
pins2lts-mc-linux64( 7/ 8), 319.649: [Blue] ~222 levels ~62914560 states ~106498152 transitions
pins2lts-mc-linux64( 7/ 8), 643.326: [Blue] ~223 levels ~125829120 states ~214164272 transitions
pins2lts-mc-linux64( 7/ 8), 751.295: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 751.383:
pins2lts-mc-linux64( 0/ 8), 751.383: Explored 134215226 states 259091209 transitions, fanout: 1.930
pins2lts-mc-linux64( 0/ 8), 751.383: Total exploration time 751.210 sec (751.130 sec minimum, 751.161 sec on average)
pins2lts-mc-linux64( 0/ 8), 751.383: States per second: 178665, Transitions per second: 344898
pins2lts-mc-linux64( 0/ 8), 751.383:
pins2lts-mc-linux64( 0/ 8), 751.383: State space has 134217333 states, 32505478 are accepting
pins2lts-mc-linux64( 0/ 8), 751.383: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 751.383: blue states: 134215226 (100.00%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 751.383: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 751.383: all-red states: 134213962 (100.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 751.383:
pins2lts-mc-linux64( 0/ 8), 751.383: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 751.383:
pins2lts-mc-linux64( 0/ 8), 751.383: Queue width: 8B, total height: 1624, memory: 0.01MB
pins2lts-mc-linux64( 0/ 8), 751.383: Tree memory: 1069.1MB, 8.4 B/state, compr.: 1.6%
pins2lts-mc-linux64( 0/ 8), 751.383: Tree fill ratio (roots/leafs): 99.0%/17.0%
pins2lts-mc-linux64( 0/ 8), 751.383: Stored 123 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 751.383: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 751.383: Est. total memory use: 1069.1MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin4833193791425653424;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(([](<>((LTLAPp0==true)))||[]((LTLAPp1==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin4833193791425653424;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(([](<>((LTLAPp0==true)))||[]((LTLAPp1==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:121)
at java.base/java.lang.Thread.run(Thread.java:840)
Detected timeout of ITS tools.
[2024-05-28 09:20:37] [INFO ] Applying decomposition
[2024-05-28 09:20:37] [INFO ] Flatten gal took : 5 ms
[2024-05-28 09:20:37] [INFO ] Decomposing Gal with order
[2024-05-28 09:20:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 09:20:37] [INFO ] Removed a total of 85 redundant transitions.
[2024-05-28 09:20:37] [INFO ] Flatten gal took : 8 ms
[2024-05-28 09:20:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 1 ms.
[2024-05-28 09:20:37] [INFO ] Time to serialize gal into /tmp/LTLFireability17353060100466272360.gal : 1 ms
[2024-05-28 09:20:37] [INFO ] Time to serialize properties into /tmp/LTLFireability15719093902908126926.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/LTLFireability17353060100466272360.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15719093902908126926.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 6 LTL properties
Checking formula 0 : !((F((G(F("((u22.p54==1)&&(u29.p69==1))")))||(G("(u48.p115==0)")))))
Formula 0 simplified : G(FG!"((u22.p54==1)&&(u29.p69==1))" & F!"(u48.p115==0)")
Reverse transition relation is NOT exact ! Due to transitions t48, t50, t59, t61, t63, t65, t75, t76, t79, t81, t88, t92, t94, t95, t103, t107, t109, t110,...577
Computing Next relation with stutter on 136620 deadlock states

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-005A"
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-005A, 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-171683760300068"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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