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.r312-tall-171662339500868.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 ResAllocation-PT-R020C002, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-171662339500868
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 9.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K 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.7K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K Apr 11 23:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Apr 11 23:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 23:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K Apr 11 23:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 9 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 85K 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 ResAllocation-PT-R020C002-LTLFireability-00
FORMULA_NAME ResAllocation-PT-R020C002-LTLFireability-01
FORMULA_NAME ResAllocation-PT-R020C002-LTLFireability-02
FORMULA_NAME ResAllocation-PT-R020C002-LTLFireability-03
FORMULA_NAME ResAllocation-PT-R020C002-LTLFireability-04
FORMULA_NAME ResAllocation-PT-R020C002-LTLFireability-05
FORMULA_NAME ResAllocation-PT-R020C002-LTLFireability-06
FORMULA_NAME ResAllocation-PT-R020C002-LTLFireability-07
FORMULA_NAME ResAllocation-PT-R020C002-LTLFireability-08
FORMULA_NAME ResAllocation-PT-R020C002-LTLFireability-09
FORMULA_NAME ResAllocation-PT-R020C002-LTLFireability-10
FORMULA_NAME ResAllocation-PT-R020C002-LTLFireability-11
FORMULA_NAME ResAllocation-PT-R020C002-LTLFireability-12
FORMULA_NAME ResAllocation-PT-R020C002-LTLFireability-13
FORMULA_NAME ResAllocation-PT-R020C002-LTLFireability-14
FORMULA_NAME ResAllocation-PT-R020C002-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716718640067

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ResAllocation-PT-R020C002
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-26 10:17:21] [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-26 10:17:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 10:17:21] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2024-05-26 10:17:21] [INFO ] Transformed 80 places.
[2024-05-26 10:17:21] [INFO ] Transformed 42 transitions.
[2024-05-26 10:17:21] [INFO ] Found NUPN structural information;
[2024-05-26 10:17:21] [INFO ] Parsed PT model containing 80 places and 42 transitions and 200 arcs in 164 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ResAllocation-PT-R020C002-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R020C002-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R020C002-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 52 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 42/42 transitions.
Applied a total of 0 rules in 10 ms. Remains 80 /80 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 80 cols
[2024-05-26 10:17:21] [INFO ] Computed 40 invariants in 11 ms
[2024-05-26 10:17:21] [INFO ] Implicit Places using invariants in 203 ms returned [45, 47, 57, 61, 65, 69, 71, 77, 79]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 234 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 71/80 places, 42/42 transitions.
Applied a total of 0 rules in 2 ms. Remains 71 /71 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 261 ms. Remains : 71/80 places, 42/42 transitions.
Support contains 52 out of 71 places after structural reductions.
[2024-05-26 10:17:21] [INFO ] Flatten gal took : 22 ms
[2024-05-26 10:17:21] [INFO ] Flatten gal took : 8 ms
[2024-05-26 10:17:22] [INFO ] Input system was already deterministic with 42 transitions.
Reduction of identical properties reduced properties to check from 30 to 25
RANDOM walk for 40000 steps (344 resets) in 1073 ms. (37 steps per ms) remains 5/25 properties
BEST_FIRST walk for 40004 steps (64 resets) in 126 ms. (314 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (28 resets) in 132 ms. (300 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40003 steps (35 resets) in 107 ms. (370 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (64 resets) in 74 ms. (533 steps per ms) remains 2/2 properties
// Phase 1: matrix 42 rows 71 cols
[2024-05-26 10:17:22] [INFO ] Computed 31 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 5/7 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 8/15 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 11/26 variables, 7/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/26 variables, 7/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/26 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/26 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 11/37 variables, 7/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/37 variables, 7/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/37 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/37 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 11/48 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/48 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/48 variables, 3/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/48 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 11/59 variables, 7/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/59 variables, 7/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/59 variables, 3/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/59 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 11/70 variables, 7/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/70 variables, 7/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/70 variables, 3/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/70 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 12/82 variables, 8/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/82 variables, 8/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/82 variables, 4/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/82 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 11/93 variables, 7/129 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/93 variables, 7/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/93 variables, 3/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/93 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (OVERLAPS) 11/104 variables, 7/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/104 variables, 7/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/104 variables, 3/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/104 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 39 (OVERLAPS) 9/113 variables, 7/163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/113 variables, 7/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/113 variables, 3/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/113 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 43 (OVERLAPS) 0/113 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 113/113 variables, and 173 constraints, problems are : Problem set: 0 solved, 2 unsolved in 254 ms.
Refiners :[Domain max(s): 71/71 constraints, Positive P Invariants (semi-flows): 31/31 constraints, State Equation: 71/71 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 5/7 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 8/15 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 11/26 variables, 7/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/26 variables, 7/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/26 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/26 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/26 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 11/37 variables, 7/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/37 variables, 7/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/37 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/37 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 11/48 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/48 variables, 7/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/48 variables, 3/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/48 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 11/59 variables, 7/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/59 variables, 7/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/59 variables, 3/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/59 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 11/70 variables, 7/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/70 variables, 7/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/70 variables, 3/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/70 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 12/82 variables, 8/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/82 variables, 8/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/82 variables, 4/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/82 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (OVERLAPS) 11/93 variables, 7/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/93 variables, 7/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/93 variables, 3/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/93 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (OVERLAPS) 11/104 variables, 7/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/104 variables, 7/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/104 variables, 3/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/104 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 40 (OVERLAPS) 9/113 variables, 7/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/113 variables, 7/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/113 variables, 3/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/113 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 44 (OVERLAPS) 0/113 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 113/113 variables, and 175 constraints, problems are : Problem set: 0 solved, 2 unsolved in 309 ms.
Refiners :[Domain max(s): 71/71 constraints, Positive P Invariants (semi-flows): 31/31 constraints, State Equation: 71/71 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 595ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 1575 steps, including 73 resets, run visited all 2 properties in 11 ms. (steps per millisecond=143 )
Parikh walk visited 2 properties in 14 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(X(F(p0)))&&(!p1 U (p2||G(!p1)))))))'
Support contains 3 out of 71 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 71 /71 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2024-05-26 10:17:23] [INFO ] Invariant cache hit.
[2024-05-26 10:17:23] [INFO ] Implicit Places using invariants in 70 ms returned [41, 43, 47, 49, 51, 53, 56, 59, 62, 66, 68]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 72 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 60/71 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 76 ms. Remains : 60/71 places, 42/42 transitions.
Stuttering acceptance computed with spot in 299 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2)), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R020C002-LTLFireability-01
Product exploration explored 100000 steps with 19324 reset in 265 ms.
Product exploration explored 100000 steps with 19391 reset in 144 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) p0), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (OR p2 (NOT p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (OR p2 (NOT p1)))), (X (X (NOT (OR p2 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 7 factoid took 270 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 15 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p2 (NOT p1) p0), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (OR p2 (NOT p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (OR p2 (NOT p1)))), (X (X (NOT (OR p2 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 331 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 60 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 42/42 transitions.
Applied a total of 0 rules in 3 ms. Remains 60 /60 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 60 cols
[2024-05-26 10:17:25] [INFO ] Computed 20 invariants in 3 ms
[2024-05-26 10:17:25] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-26 10:17:25] [INFO ] Invariant cache hit.
[2024-05-26 10:17:25] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
Running 40 sub problems to find dead transitions.
[2024-05-26 10:17:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-26 10:17:26] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 6 ms to minimize.
[2024-05-26 10:17:26] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 2 ms to minimize.
[2024-05-26 10:17:26] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-26 10:17:26] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-26 10:17:26] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-26 10:17:26] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-26 10:17:26] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-26 10:17:26] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-26 10:17:26] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-26 10:17:26] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-26 10:17:26] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 4 ms to minimize.
[2024-05-26 10:17:26] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-26 10:17:26] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-26 10:17:26] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-26 10:17:26] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-26 10:17:26] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-26 10:17:26] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-26 10:17:26] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-26 10:17:26] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 19/99 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 42/102 variables, 60/159 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 0/102 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 102/102 variables, and 159 constraints, problems are : Problem set: 0 solved, 40 unsolved in 1131 ms.
Refiners :[Domain max(s): 60/60 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 60/60 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 19/99 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 42/102 variables, 60/159 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 40/199 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 0/102 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 102/102 variables, and 199 constraints, problems are : Problem set: 0 solved, 40 unsolved in 799 ms.
Refiners :[Domain max(s): 60/60 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 60/60 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 19/19 constraints]
After SMT, in 1946ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1947ms
Finished structural reductions in LTL mode , in 1 iterations and 2085 ms. Remains : 60/60 places, 42/42 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 87 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 22 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 200 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 19328 reset in 101 ms.
Product exploration explored 100000 steps with 19294 reset in 142 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 42/42 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 60 transition count 42
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 16 ms. Remains 60 /60 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2024-05-26 10:17:29] [INFO ] Redundant transitions in 1 ms returned []
Running 40 sub problems to find dead transitions.
// Phase 1: matrix 42 rows 60 cols
[2024-05-26 10:17:29] [INFO ] Computed 20 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-26 10:17:29] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD19 is UNSAT
[2024-05-26 10:17:29] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
Problem TDEAD20 is UNSAT
[2024-05-26 10:17:29] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-26 10:17:29] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-26 10:17:29] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-26 10:17:29] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-26 10:17:29] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-26 10:17:29] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-26 10:17:29] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-26 10:17:29] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-26 10:17:29] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-26 10:17:29] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-26 10:17:29] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-26 10:17:29] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-26 10:17:29] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-26 10:17:29] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 4 ms to minimize.
[2024-05-26 10:17:29] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 17/97 constraints. Problems are: Problem set: 2 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/97 constraints. Problems are: Problem set: 2 solved, 38 unsolved
At refinement iteration 4 (OVERLAPS) 42/102 variables, 60/157 constraints. Problems are: Problem set: 2 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/157 constraints. Problems are: Problem set: 2 solved, 38 unsolved
At refinement iteration 6 (OVERLAPS) 0/102 variables, 0/157 constraints. Problems are: Problem set: 2 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 102/102 variables, and 157 constraints, problems are : Problem set: 2 solved, 38 unsolved in 856 ms.
Refiners :[Domain max(s): 60/60 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 60/60 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 2 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 58/58 constraints. Problems are: Problem set: 2 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 18/76 constraints. Problems are: Problem set: 2 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 17/93 constraints. Problems are: Problem set: 2 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/93 constraints. Problems are: Problem set: 2 solved, 38 unsolved
At refinement iteration 4 (OVERLAPS) 2/60 variables, 2/95 constraints. Problems are: Problem set: 2 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 2/97 constraints. Problems are: Problem set: 2 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/97 constraints. Problems are: Problem set: 2 solved, 38 unsolved
At refinement iteration 7 (OVERLAPS) 42/102 variables, 60/157 constraints. Problems are: Problem set: 2 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 38/195 constraints. Problems are: Problem set: 2 solved, 38 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 0/195 constraints. Problems are: Problem set: 2 solved, 38 unsolved
At refinement iteration 10 (OVERLAPS) 0/102 variables, 0/195 constraints. Problems are: Problem set: 2 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 102/102 variables, and 195 constraints, problems are : Problem set: 2 solved, 38 unsolved in 845 ms.
Refiners :[Domain max(s): 60/60 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 60/60 constraints, PredecessorRefiner: 38/40 constraints, Known Traps: 17/17 constraints]
After SMT, in 1721ms problems are : Problem set: 2 solved, 38 unsolved
Search for dead transitions found 2 dead transitions in 1722ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 60/60 places, 40/42 transitions.
Graph (complete) has 154 edges and 60 vertex of which 58 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 58 /60 variables (removed 2) and now considering 40/40 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 58/60 places, 40/42 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1753 ms. Remains : 58/60 places, 40/42 transitions.
Built C files in :
/tmp/ltsmin4737660511091044873
[2024-05-26 10:17:31] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4737660511091044873
Running compilation step : cd /tmp/ltsmin4737660511091044873;'/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 262 ms.
Running link step : cd /tmp/ltsmin4737660511091044873;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin4737660511091044873;'/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/stateBased57963957786861572.hoa' '--buchi-type=spotba'
LTSmin run took 12245 ms.
FORMULA ResAllocation-PT-R020C002-LTLFireability-01 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ResAllocation-PT-R020C002-LTLFireability-01 finished in 19889 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((p0&&X(p1)))||G(p2))))'
Support contains 6 out of 71 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 71/71 places, 42/42 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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 69 transition count 41
Applied a total of 3 rules in 15 ms. Remains 69 /71 variables (removed 2) and now considering 41/42 (removed 1) transitions.
// Phase 1: matrix 41 rows 69 cols
[2024-05-26 10:17:43] [INFO ] Computed 30 invariants in 3 ms
[2024-05-26 10:17:43] [INFO ] Implicit Places using invariants in 69 ms returned [41, 47, 49, 51, 54, 57, 60, 64, 66]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 70 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/71 places, 41/42 transitions.
Applied a total of 0 rules in 4 ms. Remains 60 /60 variables (removed 0) and now considering 41/41 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 89 ms. Remains : 60/71 places, 41/42 transitions.
Stuttering acceptance computed with spot in 46 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ResAllocation-PT-R020C002-LTLFireability-02
Product exploration explored 100000 steps with 861 reset in 270 ms.
Product exploration explored 100000 steps with 863 reset in 311 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT p2)), (X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 p1 p2))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p1) p2)))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X p0), (X p1), (X (X (NOT p2))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p1) p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 132 ms. Reduced automaton from 1 states, 4 edges and 3 AP (stutter insensitive) to 1 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
RANDOM walk for 40000 steps (343 resets) in 180 ms. (220 steps per ms) remains 1/7 properties
BEST_FIRST walk for 40004 steps (64 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
// Phase 1: matrix 41 rows 60 cols
[2024-05-26 10:17:44] [INFO ] Computed 21 invariants in 1 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 2/3 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/12 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/12 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/12 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/12 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/17 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/17 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/17 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/17 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 5/22 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/22 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/22 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/22 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 5/27 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/27 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/27 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/27 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 5/32 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/32 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/32 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/32 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 5/37 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/37 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/37 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/37 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 5/42 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/42 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/42 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/42 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 5/47 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/47 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/47 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/47 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 5/52 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/52 variables, 3/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/52 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/52 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 5/57 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/57 variables, 3/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/57 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/57 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 5/62 variables, 3/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/62 variables, 3/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/62 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/62 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (OVERLAPS) 5/67 variables, 3/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/67 variables, 3/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/67 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/67 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (OVERLAPS) 5/72 variables, 3/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/72 variables, 3/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/72 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/72 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (OVERLAPS) 5/77 variables, 3/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/77 variables, 3/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/77 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/77 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (OVERLAPS) 6/83 variables, 4/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/83 variables, 4/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/83 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/83 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (OVERLAPS) 5/88 variables, 3/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/88 variables, 3/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/88 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/88 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (OVERLAPS) 5/93 variables, 3/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/93 variables, 3/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/93 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/93 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (OVERLAPS) 5/98 variables, 3/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/98 variables, 3/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/98 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/98 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (OVERLAPS) 3/101 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/101 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/101 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/101 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (OVERLAPS) 0/101 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 101/101 variables, and 141 constraints, problems are : Problem set: 0 solved, 1 unsolved in 77 ms.
Refiners :[Domain max(s): 60/60 constraints, Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 60/60 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 2/3 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/12 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/12 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/12 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/12 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/12 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 5/17 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/17 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/17 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/17 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 5/22 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/22 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/22 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/22 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 5/27 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/27 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/27 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/27 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 5/32 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/32 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/32 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/32 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 5/37 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/37 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/37 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/37 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 5/42 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/42 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/42 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/42 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 5/47 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/47 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/47 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/47 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 5/52 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/52 variables, 3/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/52 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/52 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 5/57 variables, 3/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/57 variables, 3/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/57 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/57 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (OVERLAPS) 5/62 variables, 3/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/62 variables, 3/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/62 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/62 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (OVERLAPS) 5/67 variables, 3/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/67 variables, 3/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/67 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/67 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (OVERLAPS) 5/72 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/72 variables, 3/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/72 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/72 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (OVERLAPS) 5/77 variables, 3/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/77 variables, 3/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/77 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/77 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (OVERLAPS) 6/83 variables, 4/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/83 variables, 4/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/83 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/83 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (OVERLAPS) 5/88 variables, 3/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/88 variables, 3/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/88 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/88 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (OVERLAPS) 5/93 variables, 3/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/93 variables, 3/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/93 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/93 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (OVERLAPS) 5/98 variables, 3/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/98 variables, 3/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/98 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/98 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (OVERLAPS) 3/101 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/101 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/101 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/101 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (OVERLAPS) 0/101 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 101/101 variables, and 142 constraints, problems are : Problem set: 0 solved, 1 unsolved in 120 ms.
Refiners :[Domain max(s): 60/60 constraints, Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 60/60 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 199ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 20 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=20 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT p2)), (X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 p1 p2))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p1) p2)))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X p0), (X p1), (X (X (NOT p2))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p1) p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p2) p1))), (F (NOT (AND (OR p0 p2) (OR p2 p1)))), (F (NOT p1)), (F (NOT p0)), (F p2), (F (NOT (AND (OR p0 (NOT p2)) (OR (NOT p2) p1)))), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1))))]
Knowledge based reduction with 15 factoid took 320 ms. Reduced automaton from 1 states, 4 edges and 3 AP (stutter insensitive) to 1 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 46 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Support contains 6 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 41/41 transitions.
Applied a total of 0 rules in 3 ms. Remains 60 /60 variables (removed 0) and now considering 41/41 (removed 0) transitions.
[2024-05-26 10:17:45] [INFO ] Invariant cache hit.
[2024-05-26 10:17:45] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-26 10:17:45] [INFO ] Invariant cache hit.
[2024-05-26 10:17:45] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2024-05-26 10:17:45] [INFO ] Redundant transitions in 0 ms returned []
Running 39 sub problems to find dead transitions.
[2024-05-26 10:17:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 21/81 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-26 10:17:45] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-26 10:17:45] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-26 10:17:45] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-26 10:17:45] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-26 10:17:45] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-26 10:17:45] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-26 10:17:45] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-26 10:17:45] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-26 10:17:45] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-26 10:17:45] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-26 10:17:45] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-26 10:17:45] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-26 10:17:45] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-26 10:17:45] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-26 10:17:45] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 2 ms to minimize.
[2024-05-26 10:17:45] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-26 10:17:45] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 17/98 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (OVERLAPS) 41/101 variables, 60/158 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (OVERLAPS) 0/101 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 101/101 variables, and 158 constraints, problems are : Problem set: 0 solved, 39 unsolved in 881 ms.
Refiners :[Domain max(s): 60/60 constraints, Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 60/60 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 21/81 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 17/98 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (OVERLAPS) 41/101 variables, 60/158 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 39/197 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (OVERLAPS) 0/101 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 101/101 variables, and 197 constraints, problems are : Problem set: 0 solved, 39 unsolved in 757 ms.
Refiners :[Domain max(s): 60/60 constraints, Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 60/60 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 17/17 constraints]
After SMT, in 1645ms problems are : Problem set: 0 solved, 39 unsolved
Search for dead transitions found 0 dead transitions in 1645ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1751 ms. Remains : 60/60 places, 41/41 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (NOT (AND p0 p2 p1))), (X (NOT (OR (AND (NOT p0) p2) (AND p2 (NOT p1))))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (X (AND p0 (NOT p2) p1)), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p2 (NOT p1)))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1)))))), (X (X (AND p0 (NOT p2) p1))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 146 ms. Reduced automaton from 1 states, 4 edges and 3 AP (stutter insensitive) to 1 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
RANDOM walk for 40000 steps (342 resets) in 156 ms. (254 steps per ms) remains 1/7 properties
BEST_FIRST walk for 40002 steps (64 resets) in 51 ms. (769 steps per ms) remains 1/1 properties
[2024-05-26 10:17:47] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 2/3 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/12 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/12 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/12 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/12 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/17 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/17 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/17 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/17 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 5/22 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/22 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/22 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/22 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 5/27 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/27 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/27 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/27 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 5/32 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/32 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/32 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/32 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 5/37 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/37 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/37 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/37 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 5/42 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/42 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/42 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/42 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 5/47 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/47 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/47 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/47 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 5/52 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/52 variables, 3/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/52 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/52 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 5/57 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/57 variables, 3/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/57 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/57 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 5/62 variables, 3/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/62 variables, 3/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/62 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/62 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (OVERLAPS) 5/67 variables, 3/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/67 variables, 3/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/67 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/67 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (OVERLAPS) 5/72 variables, 3/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/72 variables, 3/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/72 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/72 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (OVERLAPS) 5/77 variables, 3/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/77 variables, 3/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/77 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/77 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (OVERLAPS) 6/83 variables, 4/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/83 variables, 4/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/83 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/83 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (OVERLAPS) 5/88 variables, 3/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/88 variables, 3/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/88 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/88 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (OVERLAPS) 5/93 variables, 3/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/93 variables, 3/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/93 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/93 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (OVERLAPS) 5/98 variables, 3/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/98 variables, 3/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/98 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/98 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (OVERLAPS) 3/101 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/101 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/101 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/101 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (OVERLAPS) 0/101 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 101/101 variables, and 141 constraints, problems are : Problem set: 0 solved, 1 unsolved in 85 ms.
Refiners :[Domain max(s): 60/60 constraints, Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 60/60 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 2/3 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/12 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/12 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/12 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/12 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/12 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 5/17 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/17 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/17 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/17 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 5/22 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/22 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/22 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/22 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 5/27 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/27 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/27 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/27 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 5/32 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/32 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/32 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/32 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 5/37 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/37 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/37 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/37 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 5/42 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/42 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/42 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/42 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 5/47 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/47 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/47 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/47 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 5/52 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/52 variables, 3/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/52 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/52 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 5/57 variables, 3/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/57 variables, 3/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/57 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/57 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (OVERLAPS) 5/62 variables, 3/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/62 variables, 3/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/62 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/62 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (OVERLAPS) 5/67 variables, 3/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/67 variables, 3/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/67 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/67 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (OVERLAPS) 5/72 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/72 variables, 3/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/72 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/72 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (OVERLAPS) 5/77 variables, 3/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/77 variables, 3/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/77 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/77 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (OVERLAPS) 6/83 variables, 4/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/83 variables, 4/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/83 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/83 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (OVERLAPS) 5/88 variables, 3/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/88 variables, 3/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/88 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/88 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (OVERLAPS) 5/93 variables, 3/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/93 variables, 3/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/93 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/93 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (OVERLAPS) 5/98 variables, 3/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/98 variables, 3/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/98 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/98 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (OVERLAPS) 3/101 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/101 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/101 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/101 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (OVERLAPS) 0/101 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 101/101 variables, and 142 constraints, problems are : Problem set: 0 solved, 1 unsolved in 105 ms.
Refiners :[Domain max(s): 60/60 constraints, Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 60/60 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 193ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 20 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=20 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (NOT (AND p0 p2 p1))), (X (NOT (OR (AND (NOT p0) p2) (AND p2 (NOT p1))))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (X (AND p0 (NOT p2) p1)), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p2 (NOT p1)))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1)))))), (X (X (AND p0 (NOT p2) p1))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p2) p1))), (F (NOT (AND (OR p0 p2) (OR p2 p1)))), (F (NOT p1)), (F (NOT p0)), (F p2), (F (NOT (AND (OR p0 (NOT p2)) (OR (NOT p2) p1)))), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1))))]
Knowledge based reduction with 15 factoid took 372 ms. Reduced automaton from 1 states, 4 edges and 3 AP (stutter insensitive) to 1 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 30 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 47 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Product exploration explored 100000 steps with 862 reset in 181 ms.
Product exploration explored 100000 steps with 860 reset in 193 ms.
Built C files in :
/tmp/ltsmin7715075475978931131
[2024-05-26 10:17:48] [INFO ] Computing symmetric may disable matrix : 41 transitions.
[2024-05-26 10:17:48] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 10:17:48] [INFO ] Computing symmetric may enable matrix : 41 transitions.
[2024-05-26 10:17:48] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 10:17:48] [INFO ] Computing Do-Not-Accords matrix : 41 transitions.
[2024-05-26 10:17:48] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 10:17:48] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7715075475978931131
Running compilation step : cd /tmp/ltsmin7715075475978931131;'/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 148 ms.
Running link step : cd /tmp/ltsmin7715075475978931131;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin7715075475978931131;'/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/stateBased15847394502397867198.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 41/41 transitions.
Applied a total of 0 rules in 7 ms. Remains 60 /60 variables (removed 0) and now considering 41/41 (removed 0) transitions.
[2024-05-26 10:18:03] [INFO ] Invariant cache hit.
[2024-05-26 10:18:03] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-26 10:18:03] [INFO ] Invariant cache hit.
[2024-05-26 10:18:03] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
[2024-05-26 10:18:03] [INFO ] Redundant transitions in 0 ms returned []
Running 39 sub problems to find dead transitions.
[2024-05-26 10:18:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 21/81 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-26 10:18:03] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-26 10:18:03] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-26 10:18:03] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-26 10:18:03] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 4 ms to minimize.
[2024-05-26 10:18:03] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-26 10:18:03] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-26 10:18:03] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-26 10:18:03] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-26 10:18:03] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-26 10:18:04] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-26 10:18:04] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 2 ms to minimize.
[2024-05-26 10:18:04] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-26 10:18:04] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-26 10:18:04] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-26 10:18:04] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-26 10:18:04] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-26 10:18:04] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 17/98 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (OVERLAPS) 41/101 variables, 60/158 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (OVERLAPS) 0/101 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 101/101 variables, and 158 constraints, problems are : Problem set: 0 solved, 39 unsolved in 929 ms.
Refiners :[Domain max(s): 60/60 constraints, Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 60/60 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 21/81 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 17/98 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (OVERLAPS) 41/101 variables, 60/158 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 39/197 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (OVERLAPS) 0/101 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 101/101 variables, and 197 constraints, problems are : Problem set: 0 solved, 39 unsolved in 780 ms.
Refiners :[Domain max(s): 60/60 constraints, Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 60/60 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 17/17 constraints]
After SMT, in 1718ms problems are : Problem set: 0 solved, 39 unsolved
Search for dead transitions found 0 dead transitions in 1718ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1855 ms. Remains : 60/60 places, 41/41 transitions.
Built C files in :
/tmp/ltsmin9901484919222297111
[2024-05-26 10:18:05] [INFO ] Computing symmetric may disable matrix : 41 transitions.
[2024-05-26 10:18:05] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 10:18:05] [INFO ] Computing symmetric may enable matrix : 41 transitions.
[2024-05-26 10:18:05] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 10:18:05] [INFO ] Computing Do-Not-Accords matrix : 41 transitions.
[2024-05-26 10:18:05] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 10:18:05] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9901484919222297111
Running compilation step : cd /tmp/ltsmin9901484919222297111;'/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 151 ms.
Running link step : cd /tmp/ltsmin9901484919222297111;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin9901484919222297111;'/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/stateBased5254490985107232946.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-26 10:18:20] [INFO ] Flatten gal took : 4 ms
[2024-05-26 10:18:20] [INFO ] Flatten gal took : 4 ms
[2024-05-26 10:18:20] [INFO ] Time to serialize gal into /tmp/LTL14308833088974243539.gal : 1 ms
[2024-05-26 10:18:20] [INFO ] Time to serialize properties into /tmp/LTL1593290754624029121.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/LTL14308833088974243539.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4817194614490363960.hoa' '-atoms' '/tmp/LTL1593290754624029121.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/LTL1593290754624029121.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4817194614490363960.hoa
Reverse transition relation is NOT exact ! Due to transitions t20, t22.t21, Intersection with reachable at each step enabled. (destroyed/reverse/intersect...173
Computing Next relation with stutter on 19 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
277 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.78346,117264,1,0,3145,619672,141,2864,1878,921591,6271
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ResAllocation-PT-R020C002-LTLFireability-02 FALSE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ResAllocation-PT-R020C002-LTLFireability-02 finished in 40466 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 (p1||X(p2)))&&F(G(p1))))'
Support contains 8 out of 71 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 42/42 transitions.
Applied a total of 0 rules in 2 ms. Remains 71 /71 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 71 cols
[2024-05-26 10:18:24] [INFO ] Computed 31 invariants in 2 ms
[2024-05-26 10:18:24] [INFO ] Implicit Places using invariants in 70 ms returned [41, 43, 47, 51, 53, 56, 59, 62, 68]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 88 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 62/71 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 93 ms. Remains : 62/71 places, 42/42 transitions.
Stuttering acceptance computed with spot in 165 ms :[(NOT p1), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), true]
Running random walk in product with property : ResAllocation-PT-R020C002-LTLFireability-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ResAllocation-PT-R020C002-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R020C002-LTLFireability-03 finished in 280 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0) U X((X(!p0)&&p1))))'
Support contains 5 out of 71 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 42/42 transitions.
Applied a total of 0 rules in 3 ms. Remains 71 /71 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2024-05-26 10:18:24] [INFO ] Invariant cache hit.
[2024-05-26 10:18:24] [INFO ] Implicit Places using invariants in 52 ms returned [41, 43, 47, 49, 51, 53, 56, 59, 66, 68]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 63 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 61/71 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 61 /61 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 69 ms. Remains : 61/71 places, 42/42 transitions.
Stuttering acceptance computed with spot in 233 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), true, p0, p0]
Running random walk in product with property : ResAllocation-PT-R020C002-LTLFireability-05
Entered a terminal (fully accepting) state of product in 28 steps with 0 reset in 0 ms.
FORMULA ResAllocation-PT-R020C002-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R020C002-LTLFireability-05 finished in 322 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(p1)||G(p2)||p0)))'
Support contains 4 out of 71 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 42/42 transitions.
Applied a total of 0 rules in 4 ms. Remains 71 /71 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2024-05-26 10:18:24] [INFO ] Invariant cache hit.
[2024-05-26 10:18:24] [INFO ] Implicit Places using invariants in 47 ms returned [41, 43, 47, 49, 51, 53, 56, 59, 62, 66, 68]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 48 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 60/71 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 54 ms. Remains : 60/71 places, 42/42 transitions.
Stuttering acceptance computed with spot in 343 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ResAllocation-PT-R020C002-LTLFireability-06
Product exploration explored 100000 steps with 50000 reset in 107 ms.
Product exploration explored 100000 steps with 50000 reset in 127 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) p0), (X p2), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X p0), (X (NOT p1)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 14 factoid took 20 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ResAllocation-PT-R020C002-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ResAllocation-PT-R020C002-LTLFireability-06 finished in 669 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G((!p1 U !p2)))))'
Support contains 7 out of 71 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 71/71 places, 42/42 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 68 transition count 40
Applied a total of 5 rules in 9 ms. Remains 68 /71 variables (removed 3) and now considering 40/42 (removed 2) transitions.
// Phase 1: matrix 40 rows 68 cols
[2024-05-26 10:18:25] [INFO ] Computed 30 invariants in 1 ms
[2024-05-26 10:18:25] [INFO ] Implicit Places using invariants in 54 ms returned [44, 46, 50, 53, 56, 59, 63, 65]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 67 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/71 places, 40/42 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 40/40 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 78 ms. Remains : 60/71 places, 40/42 transitions.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2)]
Running random walk in product with property : ResAllocation-PT-R020C002-LTLFireability-07
Product exploration explored 100000 steps with 4589 reset in 144 ms.
Product exploration explored 100000 steps with 4549 reset in 156 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT p0)), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 115 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2)]
RANDOM walk for 40000 steps (344 resets) in 139 ms. (285 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40004 steps (68 resets) in 291 ms. (137 steps per ms) remains 2/2 properties
BEST_FIRST walk for 2233 steps (0 resets) in 12 ms. (171 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT p0)), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p2) (NOT p1)))), (F p0), (F p1), (F p2), (F (NOT (OR p0 (NOT p2) p1))), (F (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 13 factoid took 362 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2)]
Support contains 7 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 40/40 transitions.
Applied a total of 0 rules in 6 ms. Remains 60 /60 variables (removed 0) and now considering 40/40 (removed 0) transitions.
// Phase 1: matrix 40 rows 60 cols
[2024-05-26 10:18:26] [INFO ] Computed 22 invariants in 1 ms
[2024-05-26 10:18:26] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-26 10:18:26] [INFO ] Invariant cache hit.
[2024-05-26 10:18:26] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2024-05-26 10:18:26] [INFO ] Redundant transitions in 0 ms returned []
Running 38 sub problems to find dead transitions.
[2024-05-26 10:18:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 22/82 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-26 10:18:26] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-26 10:18:26] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-26 10:18:27] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-26 10:18:27] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-26 10:18:27] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-26 10:18:27] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-26 10:18:27] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-26 10:18:27] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-26 10:18:27] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-26 10:18:27] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-26 10:18:27] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-26 10:18:27] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-26 10:18:27] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-26 10:18:27] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-26 10:18:27] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 15/97 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (OVERLAPS) 40/100 variables, 60/157 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (OVERLAPS) 0/100 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 100/100 variables, and 157 constraints, problems are : Problem set: 0 solved, 38 unsolved in 951 ms.
Refiners :[Domain max(s): 60/60 constraints, Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 60/60 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 22/82 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 15/97 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (OVERLAPS) 40/100 variables, 60/157 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 38/195 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (OVERLAPS) 0/100 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 100/100 variables, and 195 constraints, problems are : Problem set: 0 solved, 38 unsolved in 747 ms.
Refiners :[Domain max(s): 60/60 constraints, Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 60/60 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 15/15 constraints]
After SMT, in 1706ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 1708ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1833 ms. Remains : 60/60 places, 40/40 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT p0)), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 152 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2)]
RANDOM walk for 40000 steps (344 resets) in 116 ms. (341 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40004 steps (68 resets) in 42 ms. (930 steps per ms) remains 2/2 properties
BEST_FIRST walk for 1221 steps (0 resets) in 5 ms. (203 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT p0)), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p2) (NOT p1)))), (F p0), (F p1), (F p2), (F (NOT (OR p0 (NOT p2) p1))), (F (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 13 factoid took 341 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2)]
Product exploration explored 100000 steps with 4500 reset in 153 ms.
Product exploration explored 100000 steps with 4523 reset in 164 ms.
Built C files in :
/tmp/ltsmin13701631840107750599
[2024-05-26 10:18:29] [INFO ] Computing symmetric may disable matrix : 40 transitions.
[2024-05-26 10:18:29] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 10:18:29] [INFO ] Computing symmetric may enable matrix : 40 transitions.
[2024-05-26 10:18:29] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 10:18:29] [INFO ] Computing Do-Not-Accords matrix : 40 transitions.
[2024-05-26 10:18:29] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 10:18:29] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13701631840107750599
Running compilation step : cd /tmp/ltsmin13701631840107750599;'/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 145 ms.
Running link step : cd /tmp/ltsmin13701631840107750599;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin13701631840107750599;'/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/stateBased7700415202660569057.hoa' '--buchi-type=spotba'
LTSmin run took 3211 ms.
FORMULA ResAllocation-PT-R020C002-LTLFireability-07 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ResAllocation-PT-R020C002-LTLFireability-07 finished in 7905 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0 U (G(!p0)||(X(!p2)&&p1)))))'
Support contains 6 out of 71 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 42/42 transitions.
Applied a total of 0 rules in 2 ms. Remains 71 /71 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 71 cols
[2024-05-26 10:18:33] [INFO ] Computed 31 invariants in 1 ms
[2024-05-26 10:18:33] [INFO ] Implicit Places using invariants in 61 ms returned [41, 43, 47, 49, 51, 53, 56, 59, 62, 66, 68]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 62 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 60/71 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 66 ms. Remains : 60/71 places, 42/42 transitions.
Stuttering acceptance computed with spot in 170 ms :[true, p2, (OR (AND p0 (NOT p1)) (AND p0 p2)), (OR (AND p0 (NOT p1)) (AND p0 p2)), (AND p0 p2)]
Running random walk in product with property : ResAllocation-PT-R020C002-LTLFireability-08
Entered a terminal (fully accepting) state of product in 706 steps with 9 reset in 2 ms.
FORMULA ResAllocation-PT-R020C002-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R020C002-LTLFireability-08 finished in 261 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 p1)&&F(X(X((X(p2)&&!(p0 U p3))))))))'
Support contains 8 out of 71 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 42/42 transitions.
Applied a total of 0 rules in 2 ms. Remains 71 /71 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2024-05-26 10:18:33] [INFO ] Invariant cache hit.
[2024-05-26 10:18:33] [INFO ] Implicit Places using invariants in 60 ms returned [41, 43, 49, 51, 53, 56, 62, 66, 68]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 62 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 62/71 places, 42/42 transitions.
Applied a total of 0 rules in 0 ms. Remains 62 /62 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 64 ms. Remains : 62/71 places, 42/42 transitions.
Stuttering acceptance computed with spot in 272 ms :[(OR (NOT p2) p3 p1), (OR (NOT p2) p3), p1, (OR (NOT p2) p3), (NOT p2), p3]
Running random walk in product with property : ResAllocation-PT-R020C002-LTLFireability-09
Product exploration explored 100000 steps with 25000 reset in 99 ms.
Product exploration explored 100000 steps with 25000 reset in 113 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p3) p2), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p3))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 80 ms. Reduced automaton from 6 states, 14 edges and 4 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 260 ms :[(OR (NOT p2) p3), (OR (NOT p2) p3), (OR (NOT p2) p3), (NOT p2), p3]
Reduction of identical properties reduced properties to check from 7 to 5
RANDOM walk for 40000 steps (344 resets) in 199 ms. (200 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40004 steps (69 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
// Phase 1: matrix 42 rows 62 cols
[2024-05-26 10:18:34] [INFO ] Computed 22 invariants in 0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 8/13 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/25 variables, 13/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 13/38 variables, 9/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/38 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/38 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/38 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 10/48 variables, 6/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/48 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/48 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/48 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 10/58 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/58 variables, 6/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/58 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/58 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 10/68 variables, 6/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/68 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/68 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/68 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 5/73 variables, 3/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/73 variables, 3/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/73 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/73 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 5/78 variables, 3/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/78 variables, 3/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/78 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/78 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 6/84 variables, 4/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/84 variables, 4/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/84 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/84 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 5/89 variables, 3/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/89 variables, 3/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/89 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/89 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 5/94 variables, 3/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/94 variables, 3/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/94 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/94 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 5/99 variables, 3/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/99 variables, 3/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/99 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/99 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 5/104 variables, 3/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/104 variables, 3/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/104 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/104 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (OVERLAPS) 0/104 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/104 variables, and 146 constraints, problems are : Problem set: 0 solved, 1 unsolved in 82 ms.
Refiners :[Domain max(s): 62/62 constraints, Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 8/13 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/25 variables, 13/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 13/38 variables, 9/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/38 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/38 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/38 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/38 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 10/48 variables, 6/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/48 variables, 6/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/48 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/48 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 10/58 variables, 6/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/58 variables, 6/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/58 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/58 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 10/68 variables, 6/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/68 variables, 6/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/68 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/68 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 5/73 variables, 3/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/73 variables, 3/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/73 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/73 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 5/78 variables, 3/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/78 variables, 3/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/78 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/78 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 6/84 variables, 4/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/84 variables, 4/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/84 variables, 2/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/84 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 5/89 variables, 3/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/89 variables, 3/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/89 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/89 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 5/94 variables, 3/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/94 variables, 3/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/94 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/94 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 5/99 variables, 3/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/99 variables, 3/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/99 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/99 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (OVERLAPS) 5/104 variables, 3/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/104 variables, 3/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/104 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/104 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (OVERLAPS) 0/104 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/104 variables, and 147 constraints, problems are : Problem set: 0 solved, 1 unsolved in 126 ms.
Refiners :[Domain max(s): 62/62 constraints, Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 213ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 14 ms.
Support contains 5 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 42/42 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 60 transition count 40
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 60 transition count 38
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 10 place count 56 transition count 38
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 14 place count 54 transition count 36
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 54 transition count 34
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 20 place count 50 transition count 34
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 48 transition count 32
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 48 transition count 30
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 30 place count 44 transition count 30
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 34 place count 42 transition count 28
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 36 place count 42 transition count 26
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 40 place count 38 transition count 26
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 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 43 place count 36 transition count 25
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 44 place count 36 transition count 24
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 46 place count 34 transition count 24
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 5 with 2 rules applied. Total rules applied 48 place count 33 transition count 23
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 49 place count 33 transition count 22
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 51 place count 31 transition count 22
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 6 with 2 rules applied. Total rules applied 53 place count 30 transition count 21
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 54 place count 30 transition count 20
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 56 place count 28 transition count 20
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 7 with 2 rules applied. Total rules applied 58 place count 27 transition count 19
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 59 place count 27 transition count 18
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 61 place count 25 transition count 18
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 8 with 2 rules applied. Total rules applied 63 place count 24 transition count 17
Free-agglomeration rule applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 64 place count 24 transition count 16
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 66 place count 22 transition count 16
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 9 with 2 rules applied. Total rules applied 68 place count 21 transition count 15
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 69 place count 21 transition count 14
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 71 place count 19 transition count 14
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 10 with 2 rules applied. Total rules applied 73 place count 18 transition count 13
Free-agglomeration rule applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 74 place count 18 transition count 12
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 76 place count 16 transition count 12
Applied a total of 76 rules in 28 ms. Remains 16 /62 variables (removed 46) and now considering 12/42 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 16/62 places, 12/42 transitions.
RANDOM walk for 40000 steps (3596 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1221 resets) in 21 ms. (1818 steps per ms) remains 1/1 properties
Probably explored full state space saw : 112 states, properties seen :0
Probabilistic random walk after 352 steps, saw 112 distinct states, run finished after 11 ms. (steps per millisecond=32 ) properties seen :0
Explored full state space saw : 112 states, properties seen :0
Exhaustive walk after 352 steps, saw 112 distinct states, run finished after 2 ms. (steps per millisecond=176 ) properties seen :0
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p3) p2), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p3))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR (NOT p3) p2))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p3 p2))), (F (NOT (OR (NOT p0) p3))), (F p0), (F (NOT p2)), (F p3), (F (NOT (OR p3 p2)))]
Knowledge based reduction with 10 factoid took 364 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 241 ms :[(OR (NOT p2) p3), (OR (NOT p2) p3), (OR (NOT p2) p3), (NOT p2), p3]
Stuttering acceptance computed with spot in 233 ms :[(OR (NOT p2) p3), (OR (NOT p2) p3), (OR (NOT p2) p3), (NOT p2), p3]
Support contains 5 out of 62 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2024-05-26 10:18:35] [INFO ] Invariant cache hit.
[2024-05-26 10:18:35] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-26 10:18:35] [INFO ] Invariant cache hit.
[2024-05-26 10:18:35] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
Running 40 sub problems to find dead transitions.
[2024-05-26 10:18:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 22/84 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-26 10:18:35] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-05-26 10:18:35] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-26 10:18:36] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-26 10:18:36] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-26 10:18:36] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-26 10:18:36] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-26 10:18:36] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-26 10:18:36] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-26 10:18:36] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-26 10:18:36] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-26 10:18:36] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-26 10:18:36] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-26 10:18:36] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-26 10:18:36] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-26 10:18:36] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-26 10:18:36] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-26 10:18:36] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-26 10:18:36] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-26 10:18:36] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 19/103 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 42/104 variables, 62/165 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 0/104 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/104 variables, and 165 constraints, problems are : Problem set: 0 solved, 40 unsolved in 1076 ms.
Refiners :[Domain max(s): 62/62 constraints, Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 22/84 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 19/103 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 42/104 variables, 62/165 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 40/205 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 0/104 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/104 variables, and 205 constraints, problems are : Problem set: 0 solved, 40 unsolved in 848 ms.
Refiners :[Domain max(s): 62/62 constraints, Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 19/19 constraints]
After SMT, in 1932ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1933ms
Finished structural reductions in LTL mode , in 1 iterations and 2037 ms. Remains : 62/62 places, 42/42 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p3) (NOT p0) p2), (X (X (NOT p3))), (X (X (NOT (AND (NOT p3) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 105 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 229 ms :[(OR (NOT p2) p3), (OR (NOT p2) p3), (OR (NOT p2) p3), (NOT p2), p3]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 31625 steps (272 resets) in 145 ms. (216 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p3) (NOT p0) p2), (X (X (NOT p3))), (X (X (NOT (AND (NOT p3) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT (OR p3 (NOT p0)))), (F (NOT (OR p2 (NOT p0)))), (F (NOT p2)), (F p3)]
Knowledge based reduction with 4 factoid took 241 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 235 ms :[(OR (NOT p2) p3), (OR (NOT p2) p3), (OR (NOT p2) p3), (NOT p2), p3]
Stuttering acceptance computed with spot in 221 ms :[(OR (NOT p2) p3), (OR (NOT p2) p3), (OR (NOT p2) p3), (NOT p2), p3]
Stuttering acceptance computed with spot in 186 ms :[(OR (NOT p2) p3), (OR (NOT p2) p3), (OR (NOT p2) p3), (NOT p2), p3]
Product exploration explored 100000 steps with 25000 reset in 89 ms.
Product exploration explored 100000 steps with 25000 reset in 101 ms.
Built C files in :
/tmp/ltsmin5332795417207521010
[2024-05-26 10:18:39] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5332795417207521010
Running compilation step : cd /tmp/ltsmin5332795417207521010;'/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 149 ms.
Running link step : cd /tmp/ltsmin5332795417207521010;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin5332795417207521010;'/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/stateBased14647412372263390092.hoa' '--buchi-type=spotba'
LTSmin run took 154 ms.
FORMULA ResAllocation-PT-R020C002-LTLFireability-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ResAllocation-PT-R020C002-LTLFireability-09 finished in 6233 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(X(X(!X(p0))))) U X(p1)))'
Support contains 6 out of 71 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 71 /71 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 71 cols
[2024-05-26 10:18:39] [INFO ] Computed 31 invariants in 1 ms
[2024-05-26 10:18:39] [INFO ] Implicit Places using invariants in 57 ms returned [41, 43, 47, 49, 51, 53, 59, 62, 68]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 57 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 62/71 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 59 ms. Remains : 62/71 places, 42/42 transitions.
Stuttering acceptance computed with spot in 290 ms :[(NOT p1), (NOT p1), (OR (NOT p1) p0), p0, p0, true]
Running random walk in product with property : ResAllocation-PT-R020C002-LTLFireability-11
Entered a terminal (fully accepting) state of product in 596 steps with 5 reset in 3 ms.
FORMULA ResAllocation-PT-R020C002-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R020C002-LTLFireability-11 finished in 373 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 71 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 71/71 places, 42/42 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 68 transition count 40
Applied a total of 5 rules in 6 ms. Remains 68 /71 variables (removed 3) and now considering 40/42 (removed 2) transitions.
// Phase 1: matrix 40 rows 68 cols
[2024-05-26 10:18:40] [INFO ] Computed 30 invariants in 1 ms
[2024-05-26 10:18:40] [INFO ] Implicit Places using invariants in 54 ms returned [40, 44, 46, 48, 50, 53, 56, 59, 63]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 54 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/71 places, 40/42 transitions.
Applied a total of 0 rules in 2 ms. Remains 59 /59 variables (removed 0) and now considering 40/40 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 62 ms. Remains : 59/71 places, 40/42 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : ResAllocation-PT-R020C002-LTLFireability-12
Product exploration explored 100000 steps with 17537 reset in 88 ms.
Stuttering criterion allowed to conclude after 8030 steps with 1339 reset in 9 ms.
FORMULA ResAllocation-PT-R020C002-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R020C002-LTLFireability-12 finished in 206 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(X(X(p1)))&&X(p2))) U p0))'
Support contains 4 out of 71 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 42/42 transitions.
Applied a total of 0 rules in 0 ms. Remains 71 /71 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 71 cols
[2024-05-26 10:18:40] [INFO ] Computed 31 invariants in 2 ms
[2024-05-26 10:18:40] [INFO ] Implicit Places using invariants in 58 ms returned [41, 43, 47, 49, 51, 53, 56, 59, 62, 66, 68]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 59 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 60/71 places, 42/42 transitions.
Applied a total of 0 rules in 0 ms. Remains 60 /60 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60 ms. Remains : 60/71 places, 42/42 transitions.
Stuttering acceptance computed with spot in 117 ms :[(NOT p1), (NOT p0), true, (OR (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : ResAllocation-PT-R020C002-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ResAllocation-PT-R020C002-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R020C002-LTLFireability-13 finished in 200 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 6 out of 71 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 71/71 places, 42/42 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 68 transition count 40
Applied a total of 5 rules in 6 ms. Remains 68 /71 variables (removed 3) and now considering 40/42 (removed 2) transitions.
// Phase 1: matrix 40 rows 68 cols
[2024-05-26 10:18:40] [INFO ] Computed 30 invariants in 1 ms
[2024-05-26 10:18:40] [INFO ] Implicit Places using invariants in 55 ms returned [44, 46, 48, 53, 56, 59, 63, 65]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 56 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/71 places, 40/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 40/40 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 64 ms. Remains : 60/71 places, 40/42 transitions.
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ResAllocation-PT-R020C002-LTLFireability-14
Product exploration explored 100000 steps with 863 reset in 123 ms.
Product exploration explored 100000 steps with 860 reset in 126 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 105 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))]
RANDOM walk for 40000 steps (343 resets) in 165 ms. (240 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (75 resets) in 45 ms. (869 steps per ms) remains 2/2 properties
BEST_FIRST walk for 1417 steps (0 resets) in 6 ms. (202 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND 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 190 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 87 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 6 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 40/40 transitions.
Applied a total of 0 rules in 4 ms. Remains 60 /60 variables (removed 0) and now considering 40/40 (removed 0) transitions.
// Phase 1: matrix 40 rows 60 cols
[2024-05-26 10:18:41] [INFO ] Computed 22 invariants in 0 ms
[2024-05-26 10:18:41] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-26 10:18:41] [INFO ] Invariant cache hit.
[2024-05-26 10:18:41] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
[2024-05-26 10:18:41] [INFO ] Redundant transitions in 0 ms returned []
Running 38 sub problems to find dead transitions.
[2024-05-26 10:18:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 22/82 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-26 10:18:41] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-05-26 10:18:41] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-26 10:18:41] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-26 10:18:41] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-26 10:18:42] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-26 10:18:42] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-26 10:18:42] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-26 10:18:42] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-26 10:18:42] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-26 10:18:42] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-26 10:18:42] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-26 10:18:42] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-26 10:18:42] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-26 10:18:42] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-26 10:18:42] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 15/97 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (OVERLAPS) 40/100 variables, 60/157 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (OVERLAPS) 0/100 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 100/100 variables, and 157 constraints, problems are : Problem set: 0 solved, 38 unsolved in 867 ms.
Refiners :[Domain max(s): 60/60 constraints, Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 60/60 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 22/82 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 15/97 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (OVERLAPS) 40/100 variables, 60/157 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 38/195 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (OVERLAPS) 0/100 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 100/100 variables, and 195 constraints, problems are : Problem set: 0 solved, 38 unsolved in 713 ms.
Refiners :[Domain max(s): 60/60 constraints, Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 60/60 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 15/15 constraints]
After SMT, in 1587ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 1588ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1781 ms. Remains : 60/60 places, 40/40 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND 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 98 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 86 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (343 resets) in 103 ms. (384 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40001 steps (73 resets) in 44 ms. (888 steps per ms) remains 2/2 properties
BEST_FIRST walk for 1298 steps (0 resets) in 4 ms. (259 steps per ms) remains 0/2 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 227 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 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 856 reset in 122 ms.
Product exploration explored 100000 steps with 858 reset in 130 ms.
Built C files in :
/tmp/ltsmin3604973557487371513
[2024-05-26 10:18:44] [INFO ] Computing symmetric may disable matrix : 40 transitions.
[2024-05-26 10:18:44] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 10:18:44] [INFO ] Computing symmetric may enable matrix : 40 transitions.
[2024-05-26 10:18:44] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 10:18:44] [INFO ] Computing Do-Not-Accords matrix : 40 transitions.
[2024-05-26 10:18:44] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 10:18:44] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3604973557487371513
Running compilation step : cd /tmp/ltsmin3604973557487371513;'/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 161 ms.
Running link step : cd /tmp/ltsmin3604973557487371513;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin3604973557487371513;'/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/stateBased11173116287970005122.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 40/40 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 40/40 (removed 0) transitions.
[2024-05-26 10:18:59] [INFO ] Invariant cache hit.
[2024-05-26 10:18:59] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-26 10:18:59] [INFO ] Invariant cache hit.
[2024-05-26 10:18:59] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
[2024-05-26 10:18:59] [INFO ] Redundant transitions in 0 ms returned []
Running 38 sub problems to find dead transitions.
[2024-05-26 10:18:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 22/82 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-26 10:18:59] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-05-26 10:18:59] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-26 10:18:59] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-26 10:18:59] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-26 10:18:59] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-26 10:18:59] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-26 10:18:59] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-26 10:18:59] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-26 10:18:59] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-26 10:19:00] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-26 10:19:00] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-26 10:19:00] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-26 10:19:00] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-26 10:19:00] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-26 10:19:00] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 15/97 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (OVERLAPS) 40/100 variables, 60/157 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (OVERLAPS) 0/100 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 100/100 variables, and 157 constraints, problems are : Problem set: 0 solved, 38 unsolved in 897 ms.
Refiners :[Domain max(s): 60/60 constraints, Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 60/60 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 22/82 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 15/97 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (OVERLAPS) 40/100 variables, 60/157 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 38/195 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (OVERLAPS) 0/100 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 100/100 variables, and 195 constraints, problems are : Problem set: 0 solved, 38 unsolved in 733 ms.
Refiners :[Domain max(s): 60/60 constraints, Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 60/60 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 15/15 constraints]
After SMT, in 1643ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 1644ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1775 ms. Remains : 60/60 places, 40/40 transitions.
Built C files in :
/tmp/ltsmin16240620949499119224
[2024-05-26 10:19:01] [INFO ] Computing symmetric may disable matrix : 40 transitions.
[2024-05-26 10:19:01] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 10:19:01] [INFO ] Computing symmetric may enable matrix : 40 transitions.
[2024-05-26 10:19:01] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 10:19:01] [INFO ] Computing Do-Not-Accords matrix : 40 transitions.
[2024-05-26 10:19:01] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 10:19:01] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16240620949499119224
Running compilation step : cd /tmp/ltsmin16240620949499119224;'/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 146 ms.
Running link step : cd /tmp/ltsmin16240620949499119224;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin16240620949499119224;'/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/stateBased4628621415441395185.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-26 10:19:16] [INFO ] Flatten gal took : 5 ms
[2024-05-26 10:19:16] [INFO ] Flatten gal took : 11 ms
[2024-05-26 10:19:16] [INFO ] Time to serialize gal into /tmp/LTL8327444540585517988.gal : 2 ms
[2024-05-26 10:19:16] [INFO ] Time to serialize properties into /tmp/LTL14851322310809640820.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/LTL8327444540585517988.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13159717780474914637.hoa' '-atoms' '/tmp/LTL14851322310809640820.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/LTL14851322310809640820.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13159717780474914637.hoa
Reverse transition relation is NOT exact ! Due to transitions t19.t20, t22.t21, Intersection with reachable at each step enabled. (destroyed/reverse/inter...177
Computing Next relation with stutter on 19 deadlock states
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
29 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.303578,27768,1,0,666,78953,120,392,1931,97403,1422
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ResAllocation-PT-R020C002-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ResAllocation-PT-R020C002-LTLFireability-14 finished in 36243 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 8 out of 71 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 71/71 places, 42/42 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 70 transition count 41
Applied a total of 2 rules in 2 ms. Remains 70 /71 variables (removed 1) and now considering 41/42 (removed 1) transitions.
// Phase 1: matrix 41 rows 70 cols
[2024-05-26 10:19:16] [INFO ] Computed 31 invariants in 2 ms
[2024-05-26 10:19:16] [INFO ] Implicit Places using invariants in 64 ms returned [42, 46, 48, 52, 55, 58, 61, 65, 67]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 65 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/71 places, 41/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 61 /61 variables (removed 0) and now considering 41/41 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 68 ms. Remains : 61/71 places, 41/42 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R020C002-LTLFireability-15
Product exploration explored 100000 steps with 863 reset in 232 ms.
Product exploration explored 100000 steps with 862 reset in 271 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 65 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 33528 steps (287 resets) in 57 ms. (578 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 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Support contains 8 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 41/41 transitions.
Applied a total of 0 rules in 3 ms. Remains 61 /61 variables (removed 0) and now considering 41/41 (removed 0) transitions.
// Phase 1: matrix 41 rows 61 cols
[2024-05-26 10:19:17] [INFO ] Computed 22 invariants in 0 ms
[2024-05-26 10:19:17] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-26 10:19:17] [INFO ] Invariant cache hit.
[2024-05-26 10:19:17] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2024-05-26 10:19:17] [INFO ] Redundant transitions in 0 ms returned []
Running 39 sub problems to find dead transitions.
[2024-05-26 10:19:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 61/61 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 22/83 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-26 10:19:18] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-26 10:19:18] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-26 10:19:18] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-26 10:19:18] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-26 10:19:18] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-26 10:19:18] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-26 10:19:18] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-26 10:19:18] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-26 10:19:18] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 2 ms to minimize.
[2024-05-26 10:19:18] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-26 10:19:18] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-26 10:19:18] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-26 10:19:18] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-26 10:19:18] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-26 10:19:18] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-26 10:19:18] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-26 10:19:18] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 17/100 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (OVERLAPS) 41/102 variables, 61/161 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (OVERLAPS) 0/102 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 102/102 variables, and 161 constraints, problems are : Problem set: 0 solved, 39 unsolved in 910 ms.
Refiners :[Domain max(s): 61/61 constraints, Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 61/61 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 61/61 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 22/83 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 17/100 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (OVERLAPS) 41/102 variables, 61/161 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 39/200 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (OVERLAPS) 0/102 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 102/102 variables, and 200 constraints, problems are : Problem set: 0 solved, 39 unsolved in 810 ms.
Refiners :[Domain max(s): 61/61 constraints, Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 61/61 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 17/17 constraints]
After SMT, in 1729ms problems are : Problem set: 0 solved, 39 unsolved
Search for dead transitions found 0 dead transitions in 1731ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1832 ms. Remains : 61/61 places, 41/41 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 85 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 81 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (343 resets) in 67 ms. (588 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (66 resets) in 231 ms. (172 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 599 steps, run visited all 1 properties in 6 ms. (steps per millisecond=99 )
Probabilistic random walk after 599 steps, saw 447 distinct states, run finished after 13 ms. (steps per millisecond=46 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 94 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 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 862 reset in 138 ms.
Product exploration explored 100000 steps with 860 reset in 148 ms.
Built C files in :
/tmp/ltsmin2235138640203452950
[2024-05-26 10:19:20] [INFO ] Computing symmetric may disable matrix : 41 transitions.
[2024-05-26 10:19:20] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 10:19:20] [INFO ] Computing symmetric may enable matrix : 41 transitions.
[2024-05-26 10:19:20] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 10:19:20] [INFO ] Computing Do-Not-Accords matrix : 41 transitions.
[2024-05-26 10:19:20] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 10:19:20] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2235138640203452950
Running compilation step : cd /tmp/ltsmin2235138640203452950;'/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 135 ms.
Running link step : cd /tmp/ltsmin2235138640203452950;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin2235138640203452950;'/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/stateBased17036517133699589159.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 8 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 41/41 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 41/41 (removed 0) transitions.
[2024-05-26 10:19:35] [INFO ] Invariant cache hit.
[2024-05-26 10:19:35] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-26 10:19:35] [INFO ] Invariant cache hit.
[2024-05-26 10:19:35] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2024-05-26 10:19:35] [INFO ] Redundant transitions in 0 ms returned []
Running 39 sub problems to find dead transitions.
[2024-05-26 10:19:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 61/61 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 22/83 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-26 10:19:35] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-26 10:19:35] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-26 10:19:35] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-26 10:19:36] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-26 10:19:36] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-26 10:19:36] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-26 10:19:36] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-26 10:19:36] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-26 10:19:36] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-26 10:19:36] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-26 10:19:36] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-26 10:19:36] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-26 10:19:36] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-26 10:19:36] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-26 10:19:36] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-26 10:19:36] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-26 10:19:36] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 17/100 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (OVERLAPS) 41/102 variables, 61/161 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (OVERLAPS) 0/102 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 102/102 variables, and 161 constraints, problems are : Problem set: 0 solved, 39 unsolved in 908 ms.
Refiners :[Domain max(s): 61/61 constraints, Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 61/61 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 61/61 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 22/83 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 17/100 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (OVERLAPS) 41/102 variables, 61/161 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 39/200 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (OVERLAPS) 0/102 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 102/102 variables, and 200 constraints, problems are : Problem set: 0 solved, 39 unsolved in 828 ms.
Refiners :[Domain max(s): 61/61 constraints, Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 61/61 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 17/17 constraints]
After SMT, in 1746ms problems are : Problem set: 0 solved, 39 unsolved
Search for dead transitions found 0 dead transitions in 1747ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1862 ms. Remains : 61/61 places, 41/41 transitions.
Built C files in :
/tmp/ltsmin1617483629414656303
[2024-05-26 10:19:37] [INFO ] Computing symmetric may disable matrix : 41 transitions.
[2024-05-26 10:19:37] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 10:19:37] [INFO ] Computing symmetric may enable matrix : 41 transitions.
[2024-05-26 10:19:37] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 10:19:37] [INFO ] Computing Do-Not-Accords matrix : 41 transitions.
[2024-05-26 10:19:37] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 10:19:37] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1617483629414656303
Running compilation step : cd /tmp/ltsmin1617483629414656303;'/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 154 ms.
Running link step : cd /tmp/ltsmin1617483629414656303;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin1617483629414656303;'/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/stateBased2905553538129077449.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-26 10:19:52] [INFO ] Flatten gal took : 4 ms
[2024-05-26 10:19:52] [INFO ] Flatten gal took : 4 ms
[2024-05-26 10:19:52] [INFO ] Time to serialize gal into /tmp/LTL7240882091599579931.gal : 2 ms
[2024-05-26 10:19:52] [INFO ] Time to serialize properties into /tmp/LTL12131535158924131396.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/LTL7240882091599579931.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2677304035048847353.hoa' '-atoms' '/tmp/LTL12131535158924131396.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/LTL12131535158924131396.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2677304035048847353.hoa
Reverse transition relation is NOT exact ! Due to transitions t21, t19.t20, Intersection with reachable at each step enabled. (destroyed/reverse/intersect...173
Computing Next relation with stutter on 19 deadlock states
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
14 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.16141,21804,1,0,406,45553,112,203,1971,35235,876
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ResAllocation-PT-R020C002-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ResAllocation-PT-R020C002-LTLFireability-15 finished in 36134 ms.
All properties solved by simple procedures.
Total runtime 151710 ms.

BK_STOP 1716718792940

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ResAllocation-PT-R020C002"
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 ResAllocation-PT-R020C002, 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 r312-tall-171662339500868"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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