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.r444-smll-171701111100260.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 UtilityControlRoom-PT-Z4T4N06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r444-smll-171701111100260
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.3M
-rw-r--r-- 1 mcc users 34K Apr 13 05:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 173K Apr 13 05:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 73K Apr 13 05:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 292K Apr 13 05:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 26K Apr 23 08:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Apr 23 08:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 21K Apr 23 08:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 64K Apr 23 08:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 84K Apr 13 05:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 433K Apr 13 05:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 170K Apr 13 05:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 636K Apr 13 05:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.1K Apr 23 08:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.8K Apr 23 08:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 8 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 191K 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 UtilityControlRoom-PT-Z4T4N06-LTLFireability-00
FORMULA_NAME UtilityControlRoom-PT-Z4T4N06-LTLFireability-01
FORMULA_NAME UtilityControlRoom-PT-Z4T4N06-LTLFireability-02
FORMULA_NAME UtilityControlRoom-PT-Z4T4N06-LTLFireability-03
FORMULA_NAME UtilityControlRoom-PT-Z4T4N06-LTLFireability-04
FORMULA_NAME UtilityControlRoom-PT-Z4T4N06-LTLFireability-05
FORMULA_NAME UtilityControlRoom-PT-Z4T4N06-LTLFireability-06
FORMULA_NAME UtilityControlRoom-PT-Z4T4N06-LTLFireability-07
FORMULA_NAME UtilityControlRoom-PT-Z4T4N06-LTLFireability-08
FORMULA_NAME UtilityControlRoom-PT-Z4T4N06-LTLFireability-09
FORMULA_NAME UtilityControlRoom-PT-Z4T4N06-LTLFireability-10
FORMULA_NAME UtilityControlRoom-PT-Z4T4N06-LTLFireability-11
FORMULA_NAME UtilityControlRoom-PT-Z4T4N06-LTLFireability-12
FORMULA_NAME UtilityControlRoom-PT-Z4T4N06-LTLFireability-13
FORMULA_NAME UtilityControlRoom-PT-Z4T4N06-LTLFireability-14
FORMULA_NAME UtilityControlRoom-PT-Z4T4N06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717126302226

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=UtilityControlRoom-PT-Z4T4N06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-31 03:31:44] [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-31 03:31:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 03:31:45] [INFO ] Load time of PNML (sax parser for PT used): 267 ms
[2024-05-31 03:31:45] [INFO ] Transformed 228 places.
[2024-05-31 03:31:45] [INFO ] Transformed 450 transitions.
[2024-05-31 03:31:45] [INFO ] Parsed PT model containing 228 places and 450 transitions and 1446 arcs in 534 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 37 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
[2024-05-31 03:31:45] [INFO ] Reduced 18 identical enabling conditions.
[2024-05-31 03:31:45] [INFO ] Reduced 18 identical enabling conditions.
[2024-05-31 03:31:45] [INFO ] Reduced 18 identical enabling conditions.
[2024-05-31 03:31:45] [INFO ] Reduced 18 identical enabling conditions.
Ensure Unique test removed 96 transitions
Reduce redundant transitions removed 96 transitions.
FORMULA UtilityControlRoom-PT-Z4T4N06-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z4T4N06-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 203 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 354/354 transitions.
Applied a total of 0 rules in 29 ms. Remains 228 /228 variables (removed 0) and now considering 354/354 (removed 0) transitions.
// Phase 1: matrix 354 rows 228 cols
[2024-05-31 03:31:45] [INFO ] Computed 15 invariants in 39 ms
[2024-05-31 03:31:46] [INFO ] Implicit Places using invariants in 549 ms returned [185]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 618 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 227/228 places, 354/354 transitions.
Applied a total of 0 rules in 9 ms. Remains 227 /227 variables (removed 0) and now considering 354/354 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 694 ms. Remains : 227/228 places, 354/354 transitions.
Support contains 203 out of 227 places after structural reductions.
[2024-05-31 03:31:46] [INFO ] Flatten gal took : 154 ms
[2024-05-31 03:31:47] [INFO ] Flatten gal took : 102 ms
[2024-05-31 03:31:47] [INFO ] Input system was already deterministic with 354 transitions.
RANDOM walk for 13292 steps (2 resets) in 506 ms. (26 steps per ms) remains 0/22 properties
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(p0)))'
Support contains 30 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 354/354 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 155 transition count 282
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 155 transition count 282
Applied a total of 144 rules in 30 ms. Remains 155 /227 variables (removed 72) and now considering 282/354 (removed 72) transitions.
// Phase 1: matrix 282 rows 155 cols
[2024-05-31 03:31:48] [INFO ] Computed 14 invariants in 9 ms
[2024-05-31 03:31:48] [INFO ] Implicit Places using invariants in 160 ms returned []
[2024-05-31 03:31:48] [INFO ] Invariant cache hit.
[2024-05-31 03:31:48] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 397 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2024-05-31 03:31:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 169 constraints, problems are : Problem set: 0 solved, 276 unsolved in 13211 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 276/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 437/437 variables, and 445 constraints, problems are : Problem set: 0 solved, 276 unsolved in 21759 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
After SMT, in 35761ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 35790ms
Starting structural reductions in LTL mode, iteration 1 : 155/227 places, 282/354 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36221 ms. Remains : 155/227 places, 282/354 transitions.
Stuttering acceptance computed with spot in 242 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N06-LTLFireability-00
Product exploration explored 100000 steps with 1439 reset in 693 ms.
Stack based approach found an accepted trace after 47284 steps with 693 reset with depth 37 and stack size 37 in 204 ms.
FORMULA UtilityControlRoom-PT-Z4T4N06-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N06-LTLFireability-00 finished in 37473 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F((X((!p0 U (G(!p0)||p1))) U (G(X((!p0 U (p1||G(!p0)))))||(X((!p0 U (p1||G(!p0))))&&p2))))) U (G(X(F((X((!p0 U (p1||G(!p0)))) U ((p2&&X((!p0 U (p1||G(!p0)))))||G(X((!p0 U (p1||G(!p0))))))))))||(G(!p2)&&X(F((X((!p0 U (p1||G(!p0)))) U ((p2&&X((!p0 U (p1||G(!p0)))))||G(X((!p0 U (p1||G(!p0)))))))))))))'
Support contains 83 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 354/354 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 155 transition count 282
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 155 transition count 282
Applied a total of 144 rules in 11 ms. Remains 155 /227 variables (removed 72) and now considering 282/354 (removed 72) transitions.
[2024-05-31 03:32:25] [INFO ] Invariant cache hit.
[2024-05-31 03:32:25] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-31 03:32:25] [INFO ] Invariant cache hit.
[2024-05-31 03:32:26] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2024-05-31 03:32:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 169 constraints, problems are : Problem set: 0 solved, 276 unsolved in 15677 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 276/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 437/437 variables, and 445 constraints, problems are : Problem set: 0 solved, 276 unsolved in 25883 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
After SMT, in 42171ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 42179ms
Starting structural reductions in LTL mode, iteration 1 : 155/227 places, 282/354 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42423 ms. Remains : 155/227 places, 282/354 transitions.
Stuttering acceptance computed with spot in 164 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N06-LTLFireability-01
Product exploration explored 100000 steps with 1950 reset in 1428 ms.
Product exploration explored 100000 steps with 1989 reset in 1328 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) p1 (NOT p2)), (X (NOT p2)), (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT p0)), (X p1), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))))), (X (X (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2)))))]
Knowledge based reduction with 14 factoid took 480 ms. Reduced automaton from 3 states, 10 edges and 3 AP (stutter sensitive) to 3 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 94 steps (0 resets) in 8 ms. (10 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT p2)), (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT p0)), (X p1), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))))), (X (X (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT (OR p0 p1))), (F p0), (F (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1)))), (F p2), (F (NOT (AND (OR p0 (NOT p2)) (OR (NOT p2) (NOT p1))))), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT p1))]
Knowledge based reduction with 14 factoid took 775 ms. Reduced automaton from 3 states, 10 edges and 3 AP (stutter sensitive) to 3 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 130 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 83 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 282/282 transitions.
Applied a total of 0 rules in 6 ms. Remains 155 /155 variables (removed 0) and now considering 282/282 (removed 0) transitions.
[2024-05-31 03:33:13] [INFO ] Invariant cache hit.
[2024-05-31 03:33:13] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-31 03:33:13] [INFO ] Invariant cache hit.
[2024-05-31 03:33:13] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2024-05-31 03:33:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 169 constraints, problems are : Problem set: 0 solved, 276 unsolved in 13740 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 276/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 437/437 variables, and 445 constraints, problems are : Problem set: 0 solved, 276 unsolved in 23214 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
After SMT, in 37298ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 37305ms
Finished structural reductions in LTL mode , in 1 iterations and 37584 ms. Remains : 155/155 places, 282/282 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) p1), (X (NOT p2)), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (OR (AND (NOT p0) p2) (AND p2 p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (OR (AND (NOT p0) p2) (AND p2 p1)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p2 p1))))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1)))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1)))))]
Knowledge based reduction with 14 factoid took 507 ms. Reduced automaton from 3 states, 10 edges and 3 AP (stutter sensitive) to 3 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 119 steps (0 resets) in 11 ms. (9 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p2)), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (OR (AND (NOT p0) p2) (AND p2 p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (OR (AND (NOT p0) p2) (AND p2 p1)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p2 p1))))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1)))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1))))), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT (OR p0 p1))), (F p0), (F (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1)))), (F p2), (F (NOT (AND (OR p0 (NOT p2)) (OR (NOT p2) (NOT p1))))), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT p1))]
Knowledge based reduction with 14 factoid took 728 ms. Reduced automaton from 3 states, 10 edges and 3 AP (stutter sensitive) to 3 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 156 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 151 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 1982 reset in 1705 ms.
Product exploration explored 100000 steps with 1971 reset in 1552 ms.
Built C files in :
/tmp/ltsmin579902633201502348
[2024-05-31 03:33:56] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin579902633201502348
Running compilation step : cd /tmp/ltsmin579902633201502348;'/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 1527 ms.
Running link step : cd /tmp/ltsmin579902633201502348;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin579902633201502348;'/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/stateBased4493377897418930258.hoa' '--buchi-type=spotba'
LTSmin run took 350 ms.
FORMULA UtilityControlRoom-PT-Z4T4N06-LTLFireability-01 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-PT-Z4T4N06-LTLFireability-01 finished in 92374 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))'
Support contains 149 out of 227 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 227/227 places, 354/354 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 221 transition count 348
Applied a total of 12 rules in 47 ms. Remains 221 /227 variables (removed 6) and now considering 348/354 (removed 6) transitions.
// Phase 1: matrix 348 rows 221 cols
[2024-05-31 03:33:58] [INFO ] Computed 14 invariants in 5 ms
[2024-05-31 03:33:58] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-31 03:33:58] [INFO ] Invariant cache hit.
[2024-05-31 03:33:58] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 439 ms to find 0 implicit places.
[2024-05-31 03:33:58] [INFO ] Redundant transitions in 42 ms returned []
Running 318 sub problems to find dead transitions.
[2024-05-31 03:33:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/215 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 2 (OVERLAPS) 6/221 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 4 (OVERLAPS) 348/569 variables, 221/235 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/569 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 6 (OVERLAPS) 0/569 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 318 unsolved
No progress, stopping.
After SMT solving in domain Real declared 569/569 variables, and 235 constraints, problems are : Problem set: 0 solved, 318 unsolved in 20962 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 221/221 constraints, PredecessorRefiner: 318/318 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 318 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/215 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 2 (OVERLAPS) 6/221 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 4 (OVERLAPS) 348/569 variables, 221/235 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/569 variables, 318/553 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/569 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 7 (OVERLAPS) 0/569 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 318 unsolved
No progress, stopping.
After SMT solving in domain Int declared 569/569 variables, and 553 constraints, problems are : Problem set: 0 solved, 318 unsolved in 28326 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 221/221 constraints, PredecessorRefiner: 318/318 constraints, Known Traps: 0/0 constraints]
After SMT, in 49784ms problems are : Problem set: 0 solved, 318 unsolved
Search for dead transitions found 0 dead transitions in 49791ms
Starting structural reductions in SI_LTL mode, iteration 1 : 221/227 places, 348/354 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 50329 ms. Remains : 221/227 places, 348/354 transitions.
Stuttering acceptance computed with spot in 52 ms :[true, (NOT p1)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N06-LTLFireability-02
Product exploration explored 100000 steps with 44634 reset in 1677 ms.
Product exploration explored 100000 steps with 44737 reset in 1640 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 441 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[true, (NOT p1)]
RANDOM walk for 18 steps (0 resets) in 5 ms. (3 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT (OR p1 (NOT p0)))), (F p0), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 3 factoid took 622 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[true, (NOT p1)]
Stuttering acceptance computed with spot in 68 ms :[true, (NOT p1)]
[2024-05-31 03:34:53] [INFO ] Invariant cache hit.
[2024-05-31 03:34:54] [INFO ] [Real]Absence check using 14 positive place invariants in 28 ms returned sat
[2024-05-31 03:34:54] [INFO ] [Real]Absence check using state equation in 458 ms returned sat
[2024-05-31 03:34:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:34:56] [INFO ] [Nat]Absence check using 14 positive place invariants in 20 ms returned sat
[2024-05-31 03:34:56] [INFO ] [Nat]Absence check using state equation in 323 ms returned sat
[2024-05-31 03:34:56] [INFO ] Computed and/alt/rep : 318/480/318 causal constraints (skipped 0 transitions) in 43 ms.
[2024-05-31 03:34:58] [INFO ] Added : 265 causal constraints over 54 iterations in 2300 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 149 out of 221 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 221/221 places, 348/348 transitions.
Applied a total of 0 rules in 18 ms. Remains 221 /221 variables (removed 0) and now considering 348/348 (removed 0) transitions.
[2024-05-31 03:34:58] [INFO ] Invariant cache hit.
[2024-05-31 03:34:59] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-05-31 03:34:59] [INFO ] Invariant cache hit.
[2024-05-31 03:34:59] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 444 ms to find 0 implicit places.
[2024-05-31 03:34:59] [INFO ] Redundant transitions in 9 ms returned []
Running 318 sub problems to find dead transitions.
[2024-05-31 03:34:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/215 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 2 (OVERLAPS) 6/221 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 4 (OVERLAPS) 348/569 variables, 221/235 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/569 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 6 (OVERLAPS) 0/569 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 318 unsolved
No progress, stopping.
After SMT solving in domain Real declared 569/569 variables, and 235 constraints, problems are : Problem set: 0 solved, 318 unsolved in 23106 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 221/221 constraints, PredecessorRefiner: 318/318 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 318 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/215 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 2 (OVERLAPS) 6/221 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 4 (OVERLAPS) 348/569 variables, 221/235 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/569 variables, 318/553 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/569 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 7 (OVERLAPS) 0/569 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 318 unsolved
No progress, stopping.
After SMT solving in domain Int declared 569/569 variables, and 553 constraints, problems are : Problem set: 0 solved, 318 unsolved in 26118 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 221/221 constraints, PredecessorRefiner: 318/318 constraints, Known Traps: 0/0 constraints]
After SMT, in 49719ms problems are : Problem set: 0 solved, 318 unsolved
Search for dead transitions found 0 dead transitions in 49726ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 50207 ms. Remains : 221/221 places, 348/348 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 347 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[true, (NOT p1)]
RANDOM walk for 53 steps (0 resets) in 8 ms. (5 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT (OR p1 (NOT p0)))), (F p0), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 3 factoid took 623 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[true, (NOT p1)]
Stuttering acceptance computed with spot in 66 ms :[true, (NOT p1)]
[2024-05-31 03:35:50] [INFO ] Invariant cache hit.
[2024-05-31 03:35:51] [INFO ] [Real]Absence check using 14 positive place invariants in 27 ms returned sat
[2024-05-31 03:35:52] [INFO ] [Real]Absence check using state equation in 450 ms returned sat
[2024-05-31 03:35:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:35:53] [INFO ] [Nat]Absence check using 14 positive place invariants in 20 ms returned sat
[2024-05-31 03:35:53] [INFO ] [Nat]Absence check using state equation in 314 ms returned sat
[2024-05-31 03:35:53] [INFO ] Computed and/alt/rep : 318/480/318 causal constraints (skipped 0 transitions) in 40 ms.
[2024-05-31 03:35:55] [INFO ] Added : 265 causal constraints over 54 iterations in 2255 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p1)]
Product exploration explored 100000 steps with 44545 reset in 2132 ms.
Product exploration explored 100000 steps with 44641 reset in 1899 ms.
Built C files in :
/tmp/ltsmin2876917826929102233
[2024-05-31 03:35:59] [INFO ] Computing symmetric may disable matrix : 348 transitions.
[2024-05-31 03:35:59] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 03:35:59] [INFO ] Computing symmetric may enable matrix : 348 transitions.
[2024-05-31 03:35:59] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 03:35:59] [INFO ] Computing Do-Not-Accords matrix : 348 transitions.
[2024-05-31 03:36:00] [INFO ] Computation of Completed DNA matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 03:36:00] [INFO ] Built C files in 127ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2876917826929102233
Running compilation step : cd /tmp/ltsmin2876917826929102233;'/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 1985 ms.
Running link step : cd /tmp/ltsmin2876917826929102233;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin2876917826929102233;'/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/stateBased2353924161067861613.hoa' '--buchi-type=spotba'
LTSmin run took 2623 ms.
FORMULA UtilityControlRoom-PT-Z4T4N06-LTLFireability-02 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-PT-Z4T4N06-LTLFireability-02 finished in 126478 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)&&F(G(p1)))))'
Support contains 12 out of 227 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 227/227 places, 354/354 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 227 transition count 258
Reduce places removed 96 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 216 place count 131 transition count 234
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 216 place count 131 transition count 210
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 264 place count 107 transition count 210
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 267 place count 104 transition count 138
Iterating global reduction 2 with 3 rules applied. Total rules applied 270 place count 104 transition count 138
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 288 place count 86 transition count 120
Iterating global reduction 2 with 18 rules applied. Total rules applied 306 place count 86 transition count 120
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 324 place count 68 transition count 84
Iterating global reduction 2 with 18 rules applied. Total rules applied 342 place count 68 transition count 84
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 360 place count 50 transition count 66
Iterating global reduction 2 with 18 rules applied. Total rules applied 378 place count 50 transition count 66
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 396 place count 50 transition count 48
Applied a total of 396 rules in 30 ms. Remains 50 /227 variables (removed 177) and now considering 48/354 (removed 306) transitions.
// Phase 1: matrix 48 rows 50 cols
[2024-05-31 03:36:04] [INFO ] Computed 14 invariants in 1 ms
[2024-05-31 03:36:04] [INFO ] Implicit Places using invariants in 52 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 53 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 49/227 places, 48/354 transitions.
Applied a total of 0 rules in 2 ms. Remains 49 /49 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 85 ms. Remains : 49/227 places, 48/354 transitions.
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N06-LTLFireability-03
Product exploration explored 100000 steps with 0 reset in 223 ms.
Stack based approach found an accepted trace after 724 steps with 0 reset with depth 725 and stack size 725 in 2 ms.
FORMULA UtilityControlRoom-PT-Z4T4N06-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N06-LTLFireability-03 finished in 430 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 6 out of 227 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 227/227 places, 354/354 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 227 transition count 258
Reduce places removed 96 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 216 place count 131 transition count 234
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 216 place count 131 transition count 210
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 264 place count 107 transition count 210
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 267 place count 104 transition count 138
Iterating global reduction 2 with 3 rules applied. Total rules applied 270 place count 104 transition count 138
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 288 place count 86 transition count 120
Iterating global reduction 2 with 18 rules applied. Total rules applied 306 place count 86 transition count 120
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 324 place count 68 transition count 84
Iterating global reduction 2 with 18 rules applied. Total rules applied 342 place count 68 transition count 84
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 360 place count 50 transition count 66
Iterating global reduction 2 with 18 rules applied. Total rules applied 378 place count 50 transition count 66
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 396 place count 50 transition count 48
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 25 rules applied. Total rules applied 421 place count 37 transition count 36
Applied a total of 421 rules in 43 ms. Remains 37 /227 variables (removed 190) and now considering 36/354 (removed 318) transitions.
// Phase 1: matrix 36 rows 37 cols
[2024-05-31 03:36:05] [INFO ] Computed 13 invariants in 1 ms
[2024-05-31 03:36:05] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-31 03:36:05] [INFO ] Invariant cache hit.
[2024-05-31 03:36:05] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2024-05-31 03:36:05] [INFO ] Redundant transitions in 0 ms returned []
Running 30 sub problems to find dead transitions.
[2024-05-31 03:36:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (OVERLAPS) 6/37 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 36/73 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 0/73 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 73/73 variables, and 50 constraints, problems are : Problem set: 0 solved, 30 unsolved in 481 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 37/37 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (OVERLAPS) 6/37 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 36/73 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 30/80 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (OVERLAPS) 0/73 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 73/73 variables, and 80 constraints, problems are : Problem set: 0 solved, 30 unsolved in 661 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 37/37 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
After SMT, in 1152ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 1153ms
Starting structural reductions in SI_LTL mode, iteration 1 : 37/227 places, 36/354 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1307 ms. Remains : 37/227 places, 36/354 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N06-LTLFireability-04
Product exploration explored 100000 steps with 0 reset in 273 ms.
Stack based approach found an accepted trace after 104 steps with 0 reset with depth 105 and stack size 105 in 0 ms.
FORMULA UtilityControlRoom-PT-Z4T4N06-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N06-LTLFireability-04 finished in 1644 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 59 out of 227 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 227/227 places, 354/354 transitions.
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 227 transition count 258
Reduce places removed 96 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 216 place count 131 transition count 234
Applied a total of 216 rules in 26 ms. Remains 131 /227 variables (removed 96) and now considering 234/354 (removed 120) transitions.
// Phase 1: matrix 234 rows 131 cols
[2024-05-31 03:36:06] [INFO ] Computed 14 invariants in 2 ms
[2024-05-31 03:36:06] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-31 03:36:06] [INFO ] Invariant cache hit.
[2024-05-31 03:36:07] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
[2024-05-31 03:36:07] [INFO ] Redundant transitions in 6 ms returned []
Running 228 sub problems to find dead transitions.
[2024-05-31 03:36:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (OVERLAPS) 6/131 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (OVERLAPS) 234/365 variables, 131/145 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (OVERLAPS) 0/365 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 145 constraints, problems are : Problem set: 0 solved, 228 unsolved in 10133 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 228 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (OVERLAPS) 6/131 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (OVERLAPS) 234/365 variables, 131/145 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 228/373 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (OVERLAPS) 0/365 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/365 variables, and 373 constraints, problems are : Problem set: 0 solved, 228 unsolved in 15402 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 0/0 constraints]
After SMT, in 25858ms problems are : Problem set: 0 solved, 228 unsolved
Search for dead transitions found 0 dead transitions in 25863ms
Starting structural reductions in SI_LTL mode, iteration 1 : 131/227 places, 234/354 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 26182 ms. Remains : 131/227 places, 234/354 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N06-LTLFireability-05
Product exploration explored 100000 steps with 0 reset in 793 ms.
Stack based approach found an accepted trace after 19393 steps with 0 reset with depth 19394 and stack size 19394 in 154 ms.
FORMULA UtilityControlRoom-PT-Z4T4N06-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N06-LTLFireability-05 finished in 27195 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(G(!p0)))||F(p1))))'
Support contains 42 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 354/354 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 155 transition count 282
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 155 transition count 282
Applied a total of 144 rules in 4 ms. Remains 155 /227 variables (removed 72) and now considering 282/354 (removed 72) transitions.
// Phase 1: matrix 282 rows 155 cols
[2024-05-31 03:36:33] [INFO ] Computed 14 invariants in 2 ms
[2024-05-31 03:36:34] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-31 03:36:34] [INFO ] Invariant cache hit.
[2024-05-31 03:36:34] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2024-05-31 03:36:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 169 constraints, problems are : Problem set: 0 solved, 276 unsolved in 15284 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 276/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 437/437 variables, and 445 constraints, problems are : Problem set: 0 solved, 276 unsolved in 24559 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
After SMT, in 40124ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 40127ms
Starting structural reductions in LTL mode, iteration 1 : 155/227 places, 282/354 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40401 ms. Remains : 155/227 places, 282/354 transitions.
Stuttering acceptance computed with spot in 226 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N06-LTLFireability-06
Product exploration explored 100000 steps with 50000 reset in 301 ms.
Product exploration explored 100000 steps with 50000 reset in 328 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 p1), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 18 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-PT-Z4T4N06-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-PT-Z4T4N06-LTLFireability-06 finished in 41296 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)&&F(!p1))))'
Support contains 12 out of 227 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 227/227 places, 354/354 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 227 transition count 258
Reduce places removed 96 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 216 place count 131 transition count 234
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 216 place count 131 transition count 210
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 264 place count 107 transition count 210
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 267 place count 104 transition count 138
Iterating global reduction 2 with 3 rules applied. Total rules applied 270 place count 104 transition count 138
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 288 place count 86 transition count 120
Iterating global reduction 2 with 18 rules applied. Total rules applied 306 place count 86 transition count 120
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 324 place count 68 transition count 84
Iterating global reduction 2 with 18 rules applied. Total rules applied 342 place count 68 transition count 84
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 360 place count 50 transition count 66
Iterating global reduction 2 with 18 rules applied. Total rules applied 378 place count 50 transition count 66
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 396 place count 50 transition count 48
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 396 place count 50 transition count 42
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 408 place count 44 transition count 42
Applied a total of 408 rules in 24 ms. Remains 44 /227 variables (removed 183) and now considering 42/354 (removed 312) transitions.
// Phase 1: matrix 42 rows 44 cols
[2024-05-31 03:37:15] [INFO ] Computed 14 invariants in 1 ms
[2024-05-31 03:37:15] [INFO ] Implicit Places using invariants in 70 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 72 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/227 places, 42/354 transitions.
Applied a total of 0 rules in 2 ms. Remains 43 /43 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 98 ms. Remains : 43/227 places, 42/354 transitions.
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p0) p1), (NOT p0), p1]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N06-LTLFireability-07
Product exploration explored 100000 steps with 6743 reset in 253 ms.
Product exploration explored 100000 steps with 6740 reset in 237 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), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 92 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 205 ms :[(OR (NOT p0) p1), (NOT p0), p1]
RANDOM walk for 134 steps (0 resets) in 7 ms. (16 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 135 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) p1), (NOT p0), p1]
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) p1), (NOT p0), p1]
// Phase 1: matrix 42 rows 43 cols
[2024-05-31 03:37:16] [INFO ] Computed 13 invariants in 1 ms
[2024-05-31 03:37:16] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-31 03:37:16] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2024-05-31 03:37:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:37:16] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-31 03:37:17] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2024-05-31 03:37:17] [INFO ] Computed and/alt/rep : 36/54/36 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-31 03:37:17] [INFO ] Added : 11 causal constraints over 3 iterations in 35 ms. Result :sat
Could not prove EG p1
Support contains 12 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 42/42 transitions.
Applied a total of 0 rules in 3 ms. Remains 43 /43 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2024-05-31 03:37:17] [INFO ] Invariant cache hit.
[2024-05-31 03:37:17] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-31 03:37:17] [INFO ] Invariant cache hit.
[2024-05-31 03:37:17] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
[2024-05-31 03:37:17] [INFO ] Redundant transitions in 0 ms returned []
Running 36 sub problems to find dead transitions.
[2024-05-31 03:37:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (OVERLAPS) 6/43 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (OVERLAPS) 42/85 variables, 43/56 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (OVERLAPS) 0/85 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Real declared 85/85 variables, and 56 constraints, problems are : Problem set: 0 solved, 36 unsolved in 884 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 43/43 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 36 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (OVERLAPS) 6/43 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (OVERLAPS) 42/85 variables, 43/56 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 36/92 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (OVERLAPS) 0/85 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Int declared 85/85 variables, and 92 constraints, problems are : Problem set: 0 solved, 36 unsolved in 817 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 43/43 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
After SMT, in 1710ms problems are : Problem set: 0 solved, 36 unsolved
Search for dead transitions found 0 dead transitions in 1712ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1879 ms. Remains : 43/43 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 p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 128 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p0) p1), (NOT p0), p1]
RANDOM walk for 73 steps (0 resets) in 4 ms. (14 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 192 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p0) p1), (NOT p0), p1]
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) p1), (NOT p0), p1]
[2024-05-31 03:37:19] [INFO ] Invariant cache hit.
[2024-05-31 03:37:19] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2024-05-31 03:37:19] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2024-05-31 03:37:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:37:19] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-31 03:37:19] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2024-05-31 03:37:19] [INFO ] Computed and/alt/rep : 36/54/36 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-31 03:37:20] [INFO ] Added : 11 causal constraints over 3 iterations in 39 ms. Result :sat
Could not prove EG p1
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p0) p1), (NOT p0), p1]
Product exploration explored 100000 steps with 6732 reset in 283 ms.
Product exploration explored 100000 steps with 6750 reset in 279 ms.
Built C files in :
/tmp/ltsmin8333612833508551156
[2024-05-31 03:37:20] [INFO ] Computing symmetric may disable matrix : 42 transitions.
[2024-05-31 03:37:20] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 03:37:20] [INFO ] Computing symmetric may enable matrix : 42 transitions.
[2024-05-31 03:37:20] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 03:37:20] [INFO ] Computing Do-Not-Accords matrix : 42 transitions.
[2024-05-31 03:37:20] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 03:37:20] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8333612833508551156
Running compilation step : cd /tmp/ltsmin8333612833508551156;'/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 317 ms.
Running link step : cd /tmp/ltsmin8333612833508551156;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin8333612833508551156;'/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/stateBased7244833269977679716.hoa' '--buchi-type=spotba'
LTSmin run took 7551 ms.
FORMULA UtilityControlRoom-PT-Z4T4N06-LTLFireability-07 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-PT-Z4T4N06-LTLFireability-07 finished in 13428 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(!p0)))'
Support contains 2 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 354/354 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 155 transition count 282
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 155 transition count 282
Applied a total of 144 rules in 6 ms. Remains 155 /227 variables (removed 72) and now considering 282/354 (removed 72) transitions.
// Phase 1: matrix 282 rows 155 cols
[2024-05-31 03:37:28] [INFO ] Computed 14 invariants in 2 ms
[2024-05-31 03:37:28] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-05-31 03:37:28] [INFO ] Invariant cache hit.
[2024-05-31 03:37:29] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 385 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2024-05-31 03:37:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 169 constraints, problems are : Problem set: 0 solved, 276 unsolved in 15617 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 276/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 437/437 variables, and 445 constraints, problems are : Problem set: 0 solved, 276 unsolved in 23555 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
After SMT, in 39663ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 39669ms
Starting structural reductions in LTL mode, iteration 1 : 155/227 places, 282/354 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40061 ms. Remains : 155/227 places, 282/354 transitions.
Stuttering acceptance computed with spot in 141 ms :[true, p0, false, false, (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N06-LTLFireability-08
Product exploration explored 100000 steps with 50000 reset in 173 ms.
Product exploration explored 100000 steps with 50000 reset in 228 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 18 ms. Reduced automaton from 5 states, 7 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-PT-Z4T4N06-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-PT-Z4T4N06-LTLFireability-08 finished in 40639 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||F(G(p1))))))'
Support contains 4 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 354/354 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 155 transition count 282
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 155 transition count 282
Applied a total of 144 rules in 8 ms. Remains 155 /227 variables (removed 72) and now considering 282/354 (removed 72) transitions.
[2024-05-31 03:38:09] [INFO ] Invariant cache hit.
[2024-05-31 03:38:09] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-05-31 03:38:09] [INFO ] Invariant cache hit.
[2024-05-31 03:38:09] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 475 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2024-05-31 03:38:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 169 constraints, problems are : Problem set: 0 solved, 276 unsolved in 15238 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 276/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 437/437 variables, and 445 constraints, problems are : Problem set: 0 solved, 276 unsolved in 24245 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
After SMT, in 39803ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 39807ms
Starting structural reductions in LTL mode, iteration 1 : 155/227 places, 282/354 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40292 ms. Remains : 155/227 places, 282/354 transitions.
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N06-LTLFireability-09
Product exploration explored 100000 steps with 0 reset in 212 ms.
Stack based approach found an accepted trace after 4320 steps with 1 reset with depth 4318 and stack size 4318 in 12 ms.
FORMULA UtilityControlRoom-PT-Z4T4N06-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N06-LTLFireability-09 finished in 40687 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 p1)||F(p2)||G(!p0)))'
Support contains 6 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 354/354 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 155 transition count 282
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 155 transition count 282
Applied a total of 144 rules in 3 ms. Remains 155 /227 variables (removed 72) and now considering 282/354 (removed 72) transitions.
[2024-05-31 03:38:50] [INFO ] Invariant cache hit.
[2024-05-31 03:38:50] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-31 03:38:50] [INFO ] Invariant cache hit.
[2024-05-31 03:38:50] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2024-05-31 03:38:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 169 constraints, problems are : Problem set: 0 solved, 276 unsolved in 15635 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 276/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 437/437 variables, and 445 constraints, problems are : Problem set: 0 solved, 276 unsolved in 24756 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
After SMT, in 40853ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 40857ms
Starting structural reductions in LTL mode, iteration 1 : 155/227 places, 282/354 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41218 ms. Remains : 155/227 places, 282/354 transitions.
Stuttering acceptance computed with spot in 154 ms :[(NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (AND (NOT p2) p0 (NOT p1)), (AND p0 (NOT p2))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N06-LTLFireability-10
Product exploration explored 100000 steps with 291 reset in 317 ms.
Stack based approach found an accepted trace after 79890 steps with 224 reset with depth 756 and stack size 756 in 293 ms.
FORMULA UtilityControlRoom-PT-Z4T4N06-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N06-LTLFireability-10 finished in 42004 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||X(!p0)||F(p1))))'
Support contains 2 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 354/354 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 155 transition count 282
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 155 transition count 282
Applied a total of 144 rules in 3 ms. Remains 155 /227 variables (removed 72) and now considering 282/354 (removed 72) transitions.
[2024-05-31 03:39:32] [INFO ] Invariant cache hit.
[2024-05-31 03:39:32] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-31 03:39:32] [INFO ] Invariant cache hit.
[2024-05-31 03:39:32] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2024-05-31 03:39:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 169 constraints, problems are : Problem set: 0 solved, 276 unsolved in 16255 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 276/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 437/437 variables, and 445 constraints, problems are : Problem set: 0 solved, 276 unsolved in 24685 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
After SMT, in 41339ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 41342ms
Starting structural reductions in LTL mode, iteration 1 : 155/227 places, 282/354 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41668 ms. Remains : 155/227 places, 282/354 transitions.
Stuttering acceptance computed with spot in 216 ms :[(NOT p1), (AND (NOT p1) p0), false, false, false, (AND (NOT p1) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N06-LTLFireability-12
Product exploration explored 100000 steps with 11049 reset in 246 ms.
Product exploration explored 100000 steps with 11236 reset in 269 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 p0) (NOT p1)))), (X p0), (X (X p0))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 379 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 249 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 345 steps (0 resets) in 14 ms. (23 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X p0))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT p1)), (F (NOT (OR p1 p0))), (F (NOT (OR p1 (NOT p0))))]
Knowledge based reduction with 4 factoid took 525 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 249 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 253 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 282/282 transitions.
Applied a total of 0 rules in 2 ms. Remains 155 /155 variables (removed 0) and now considering 282/282 (removed 0) transitions.
[2024-05-31 03:40:16] [INFO ] Invariant cache hit.
[2024-05-31 03:40:16] [INFO ] Implicit Places using invariants in 188 ms returned []
[2024-05-31 03:40:16] [INFO ] Invariant cache hit.
[2024-05-31 03:40:16] [INFO ] Implicit Places using invariants and state equation in 364 ms returned []
Implicit Place search using SMT with State Equation took 555 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2024-05-31 03:40:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 169 constraints, problems are : Problem set: 0 solved, 276 unsolved in 15880 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 276/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 437/437 variables, and 445 constraints, problems are : Problem set: 0 solved, 276 unsolved in 24638 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
After SMT, in 41020ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 41026ms
Finished structural reductions in LTL mode , in 1 iterations and 41584 ms. Remains : 155/155 places, 282/282 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 p1 p0)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 160 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 193 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 618 steps (0 resets) in 23 ms. (25 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F (NOT p0)), (F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 1 factoid took 362 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 244 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 244 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 248 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 11098 reset in 327 ms.
Product exploration explored 100000 steps with 11179 reset in 358 ms.
Applying partial POR strategy [true, false, true, false, false]
Stuttering acceptance computed with spot in 230 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 155 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 155/155 places, 282/282 transitions.
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 23 Pre rules applied. Total rules applied 0 place count 155 transition count 305
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 0 with 23 rules applied. Total rules applied 23 place count 155 transition count 305
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 81 places in 0 ms
Iterating global reduction 0 with 58 rules applied. Total rules applied 81 place count 155 transition count 323
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 104 place count 155 transition count 300
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 106 place count 153 transition count 252
Deduced a syphon composed of 81 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 108 place count 153 transition count 252
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 144 place count 117 transition count 192
Deduced a syphon composed of 57 places in 0 ms
Iterating global reduction 1 with 36 rules applied. Total rules applied 180 place count 117 transition count 192
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 204 place count 93 transition count 156
Deduced a syphon composed of 45 places in 0 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 228 place count 93 transition count 156
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 252 place count 93 transition count 132
Deduced a syphon composed of 45 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 253 place count 93 transition count 131
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 254 place count 92 transition count 119
Deduced a syphon composed of 45 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 255 place count 92 transition count 119
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 272 place count 75 transition count 91
Deduced a syphon composed of 34 places in 0 ms
Iterating global reduction 2 with 17 rules applied. Total rules applied 289 place count 75 transition count 91
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 299 place count 65 transition count 81
Deduced a syphon composed of 29 places in 0 ms
Iterating global reduction 2 with 10 rules applied. Total rules applied 309 place count 65 transition count 81
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 319 place count 65 transition count 71
Deduced a syphon composed of 29 places in 0 ms
Applied a total of 319 rules in 69 ms. Remains 65 /155 variables (removed 90) and now considering 71/282 (removed 211) transitions.
[2024-05-31 03:41:00] [INFO ] Redundant transitions in 0 ms returned []
Running 64 sub problems to find dead transitions.
// Phase 1: matrix 71 rows 65 cols
[2024-05-31 03:41:00] [INFO ] Computed 14 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 6/65 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2024-05-31 03:41:01] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 9 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-05-31 03:41:01] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
Problem TDEAD1 is UNSAT
[2024-05-31 03:41:01] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 2 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-05-31 03:41:01] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-05-31 03:41:01] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 2 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-05-31 03:41:01] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
Problem TDEAD6 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 6/20 constraints. Problems are: Problem set: 36 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/20 constraints. Problems are: Problem set: 36 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 71/136 variables, 65/85 constraints. Problems are: Problem set: 36 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 0/85 constraints. Problems are: Problem set: 36 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 0/136 variables, 0/85 constraints. Problems are: Problem set: 36 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 136/136 variables, and 85 constraints, problems are : Problem set: 36 solved, 28 unsolved in 1507 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 65/65 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 36 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 36 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 35/65 variables, 14/14 constraints. Problems are: Problem set: 36 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 6/20 constraints. Problems are: Problem set: 36 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/20 constraints. Problems are: Problem set: 36 solved, 28 unsolved
At refinement iteration 4 (OVERLAPS) 71/136 variables, 65/85 constraints. Problems are: Problem set: 36 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 28/113 constraints. Problems are: Problem set: 36 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 0/113 constraints. Problems are: Problem set: 36 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 0/136 variables, 0/113 constraints. Problems are: Problem set: 36 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 136/136 variables, and 113 constraints, problems are : Problem set: 36 solved, 28 unsolved in 881 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 65/65 constraints, PredecessorRefiner: 28/64 constraints, Known Traps: 6/6 constraints]
After SMT, in 2420ms problems are : Problem set: 36 solved, 28 unsolved
Search for dead transitions found 36 dead transitions in 2421ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 65/155 places, 35/282 transitions.
Graph (complete) has 95 edges and 65 vertex of which 36 are kept as prefixes of interest. Removing 29 places using SCC suffix rule.1 ms
Discarding 29 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 36 /65 variables (removed 29) and now considering 35/35 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 36/155 places, 35/282 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2509 ms. Remains : 36/155 places, 35/282 transitions.
Built C files in :
/tmp/ltsmin737208604582124962
[2024-05-31 03:41:02] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin737208604582124962
Running compilation step : cd /tmp/ltsmin737208604582124962;'/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 822 ms.
Running link step : cd /tmp/ltsmin737208604582124962;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin737208604582124962;'/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/stateBased17291921059930088292.hoa' '--buchi-type=spotba'
LTSmin run took 2074 ms.
FORMULA UtilityControlRoom-PT-Z4T4N06-LTLFireability-12 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-PT-Z4T4N06-LTLFireability-12 finished in 93788 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 3 out of 227 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 227/227 places, 354/354 transitions.
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 227 transition count 258
Reduce places removed 96 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 216 place count 131 transition count 234
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 216 place count 131 transition count 210
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 264 place count 107 transition count 210
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 266 place count 105 transition count 162
Iterating global reduction 2 with 2 rules applied. Total rules applied 268 place count 105 transition count 162
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 280 place count 93 transition count 150
Iterating global reduction 2 with 12 rules applied. Total rules applied 292 place count 93 transition count 150
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 304 place count 81 transition count 126
Iterating global reduction 2 with 12 rules applied. Total rules applied 316 place count 81 transition count 126
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 328 place count 69 transition count 102
Iterating global reduction 2 with 12 rules applied. Total rules applied 340 place count 69 transition count 102
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 352 place count 69 transition count 90
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 374 place count 58 transition count 79
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 3 with 2 rules applied. Total rules applied 376 place count 57 transition count 78
Applied a total of 376 rules in 18 ms. Remains 57 /227 variables (removed 170) and now considering 78/354 (removed 276) transitions.
// Phase 1: matrix 78 rows 57 cols
[2024-05-31 03:41:05] [INFO ] Computed 14 invariants in 1 ms
[2024-05-31 03:41:05] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-31 03:41:05] [INFO ] Invariant cache hit.
[2024-05-31 03:41:05] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
[2024-05-31 03:41:05] [INFO ] Redundant transitions in 0 ms returned []
Running 65 sub problems to find dead transitions.
[2024-05-31 03:41:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 6/57 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 78/135 variables, 57/71 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (OVERLAPS) 0/135 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 135/135 variables, and 71 constraints, problems are : Problem set: 0 solved, 65 unsolved in 1134 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 57/57 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 6/57 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 78/135 variables, 57/71 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 65/136 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (OVERLAPS) 0/135 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 135/135 variables, and 136 constraints, problems are : Problem set: 0 solved, 65 unsolved in 1600 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 57/57 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints]
After SMT, in 2760ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 2762ms
Starting structural reductions in SI_LTL mode, iteration 1 : 57/227 places, 78/354 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2922 ms. Remains : 57/227 places, 78/354 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N06-LTLFireability-14
Product exploration explored 100000 steps with 1450 reset in 321 ms.
Product exploration explored 100000 steps with 1425 reset in 333 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 148 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 64 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 435 steps (0 resets) in 6 ms. (62 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 166 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 57 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 57/57 places, 78/78 transitions.
Applied a total of 0 rules in 4 ms. Remains 57 /57 variables (removed 0) and now considering 78/78 (removed 0) transitions.
[2024-05-31 03:41:10] [INFO ] Invariant cache hit.
[2024-05-31 03:41:10] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-31 03:41:10] [INFO ] Invariant cache hit.
[2024-05-31 03:41:10] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
[2024-05-31 03:41:10] [INFO ] Redundant transitions in 0 ms returned []
Running 65 sub problems to find dead transitions.
[2024-05-31 03:41:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 6/57 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 78/135 variables, 57/71 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (OVERLAPS) 0/135 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 135/135 variables, and 71 constraints, problems are : Problem set: 0 solved, 65 unsolved in 1801 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 57/57 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 6/57 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 78/135 variables, 57/71 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 65/136 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (OVERLAPS) 0/135 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 135/135 variables, and 136 constraints, problems are : Problem set: 0 solved, 65 unsolved in 2046 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 57/57 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints]
After SMT, in 3892ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 3894ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 4082 ms. Remains : 57/57 places, 78/78 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 262 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 83 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 294 steps (0 resets) in 6 ms. (42 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 209 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1439 reset in 322 ms.
Stack based approach found an accepted trace after 86268 steps with 1234 reset with depth 36 and stack size 36 in 289 ms.
FORMULA UtilityControlRoom-PT-Z4T4N06-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N06-LTLFireability-14 finished in 9792 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)&&(p1||X(F(p2))))))'
Support contains 6 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 354/354 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 155 transition count 282
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 155 transition count 282
Applied a total of 144 rules in 7 ms. Remains 155 /227 variables (removed 72) and now considering 282/354 (removed 72) transitions.
// Phase 1: matrix 282 rows 155 cols
[2024-05-31 03:41:15] [INFO ] Computed 14 invariants in 3 ms
[2024-05-31 03:41:15] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-05-31 03:41:15] [INFO ] Invariant cache hit.
[2024-05-31 03:41:16] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 434 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2024-05-31 03:41:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 169 constraints, problems are : Problem set: 0 solved, 276 unsolved in 15386 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 276/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 437/437 variables, and 445 constraints, problems are : Problem set: 0 solved, 276 unsolved in 22063 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
After SMT, in 37889ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 37895ms
Starting structural reductions in LTL mode, iteration 1 : 155/227 places, 282/354 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38337 ms. Remains : 155/227 places, 282/354 transitions.
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), true]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N06-LTLFireability-15
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z4T4N06-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N06-LTLFireability-15 finished in 38511 ms.
All properties solved by simple procedures.
Total runtime 609433 ms.

BK_STOP 1717126914173

--------------------
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="UtilityControlRoom-PT-Z4T4N06"
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 UtilityControlRoom-PT-Z4T4N06, 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 r444-smll-171701111100260"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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