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.r544-smll-171701111100244.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 ltsminxred
Input is UtilityControlRoom-PT-Z4T4N02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r544-smll-171701111100244
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 23K Apr 13 05:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 154K Apr 13 05:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 29K Apr 13 05:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 137K Apr 13 05:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K Apr 23 08:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 34K Apr 23 08:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 16K Apr 23 08:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 23 08:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 46K Apr 13 05:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 278K Apr 13 05:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 74K Apr 13 05:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 312K Apr 13 05:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 08:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.2K 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 65K 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-Z4T4N02-LTLFireability-00
FORMULA_NAME UtilityControlRoom-PT-Z4T4N02-LTLFireability-01
FORMULA_NAME UtilityControlRoom-PT-Z4T4N02-LTLFireability-02
FORMULA_NAME UtilityControlRoom-PT-Z4T4N02-LTLFireability-03
FORMULA_NAME UtilityControlRoom-PT-Z4T4N02-LTLFireability-04
FORMULA_NAME UtilityControlRoom-PT-Z4T4N02-LTLFireability-05
FORMULA_NAME UtilityControlRoom-PT-Z4T4N02-LTLFireability-06
FORMULA_NAME UtilityControlRoom-PT-Z4T4N02-LTLFireability-07
FORMULA_NAME UtilityControlRoom-PT-Z4T4N02-LTLFireability-08
FORMULA_NAME UtilityControlRoom-PT-Z4T4N02-LTLFireability-09
FORMULA_NAME UtilityControlRoom-PT-Z4T4N02-LTLFireability-10
FORMULA_NAME UtilityControlRoom-PT-Z4T4N02-LTLFireability-11
FORMULA_NAME UtilityControlRoom-PT-Z4T4N02-LTLFireability-12
FORMULA_NAME UtilityControlRoom-PT-Z4T4N02-LTLFireability-13
FORMULA_NAME UtilityControlRoom-PT-Z4T4N02-LTLFireability-14
FORMULA_NAME UtilityControlRoom-PT-Z4T4N02-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717277413261

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=UtilityControlRoom-PT-Z4T4N02
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 21:30:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 21:30:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 21:30:15] [INFO ] Load time of PNML (sax parser for PT used): 99 ms
[2024-06-01 21:30:15] [INFO ] Transformed 80 places.
[2024-06-01 21:30:15] [INFO ] Transformed 150 transitions.
[2024-06-01 21:30:15] [INFO ] Parsed PT model containing 80 places and 150 transitions and 482 arcs in 318 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 27 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 32 transitions
Reduce redundant transitions removed 32 transitions.
FORMULA UtilityControlRoom-PT-Z4T4N02-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z4T4N02-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z4T4N02-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z4T4N02-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 68 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 118/118 transitions.
Applied a total of 0 rules in 35 ms. Remains 80 /80 variables (removed 0) and now considering 118/118 (removed 0) transitions.
// Phase 1: matrix 118 rows 80 cols
[2024-06-01 21:30:16] [INFO ] Computed 7 invariants in 23 ms
[2024-06-01 21:30:16] [INFO ] Implicit Places using invariants in 355 ms returned [65]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 433 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 79/80 places, 118/118 transitions.
Applied a total of 0 rules in 2 ms. Remains 79 /79 variables (removed 0) and now considering 118/118 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 512 ms. Remains : 79/80 places, 118/118 transitions.
Support contains 68 out of 79 places after structural reductions.
[2024-06-01 21:30:17] [INFO ] Flatten gal took : 81 ms
[2024-06-01 21:30:17] [INFO ] Flatten gal took : 27 ms
[2024-06-01 21:30:17] [INFO ] Input system was already deterministic with 118 transitions.
Reduction of identical properties reduced properties to check from 20 to 19
RANDOM walk for 30579 steps (6 resets) in 928 ms. (32 steps per ms) remains 0/19 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(G((G((G(p1)||p0))||F(p2)))))'
Support contains 53 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 118/118 transitions.
Applied a total of 0 rules in 12 ms. Remains 79 /79 variables (removed 0) and now considering 118/118 (removed 0) transitions.
// Phase 1: matrix 118 rows 79 cols
[2024-06-01 21:30:18] [INFO ] Computed 6 invariants in 3 ms
[2024-06-01 21:30:18] [INFO ] Implicit Places using invariants in 158 ms returned []
[2024-06-01 21:30:18] [INFO ] Invariant cache hit.
[2024-06-01 21:30:18] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 388 ms to find 0 implicit places.
Running 116 sub problems to find dead transitions.
[2024-06-01 21:30:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (OVERLAPS) 2/79 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (OVERLAPS) 118/197 variables, 79/85 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (OVERLAPS) 0/197 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 85 constraints, problems are : Problem set: 0 solved, 116 unsolved in 4037 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 79/79 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (OVERLAPS) 2/79 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (OVERLAPS) 118/197 variables, 79/85 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 116/201 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (OVERLAPS) 0/197 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 201 constraints, problems are : Problem set: 0 solved, 116 unsolved in 3449 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 79/79 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 0/0 constraints]
After SMT, in 7693ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 7733ms
Finished structural reductions in LTL mode , in 1 iterations and 8136 ms. Remains : 79/79 places, 118/118 transitions.
Stuttering acceptance computed with spot in 360 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) p0 (NOT p1))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N02-LTLFireability-00
Product exploration explored 100000 steps with 6888 reset in 773 ms.
Product exploration explored 100000 steps with 7054 reset in 681 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p0), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X p1), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 304 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p2) p0 (NOT p1))]
RANDOM walk for 149 steps (0 resets) in 46 ms. (3 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p0), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X p1), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (F (NOT (OR p2 p0 p1))), (F (NOT (OR p2 p0 (NOT p1)))), (F (NOT p1)), (F (NOT p0)), (F p2), (F (NOT (OR p2 (NOT p0) p1))), (F (NOT (AND (NOT p2) p0 p1)))]
Knowledge based reduction with 11 factoid took 594 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p2) p0 (NOT p1))]
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p2) p0 (NOT p1))]
Support contains 53 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 118/118 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 77 transition count 116
Applied a total of 4 rules in 46 ms. Remains 77 /79 variables (removed 2) and now considering 116/118 (removed 2) transitions.
// Phase 1: matrix 116 rows 77 cols
[2024-06-01 21:30:29] [INFO ] Computed 6 invariants in 2 ms
[2024-06-01 21:30:29] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-06-01 21:30:29] [INFO ] Invariant cache hit.
[2024-06-01 21:30:29] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
[2024-06-01 21:30:29] [INFO ] Redundant transitions in 3 ms returned []
Running 106 sub problems to find dead transitions.
[2024-06-01 21:30:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 2/77 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 116/193 variables, 77/83 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (OVERLAPS) 0/193 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 83 constraints, problems are : Problem set: 0 solved, 106 unsolved in 3350 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 77/77 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 2/77 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 116/193 variables, 77/83 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 106/189 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (OVERLAPS) 0/193 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 189 constraints, problems are : Problem set: 0 solved, 106 unsolved in 2970 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 77/77 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints]
After SMT, in 6393ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 6396ms
Starting structural reductions in SI_LTL mode, iteration 1 : 77/79 places, 116/118 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6707 ms. Remains : 77/79 places, 116/118 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 p2) p0 p1), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X p0), (X p1)]
False Knowledge obtained : [(X (AND (NOT p2) p0 p1)), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT p2)), (X p2), (X (X (AND (NOT p2) p0 p1))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT p2))), (X (X p2)), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 453 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p2) p0 (NOT p1))]
RANDOM walk for 33 steps (0 resets) in 6 ms. (4 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X p0), (X p1)]
False Knowledge obtained : [(X (AND (NOT p2) p0 p1)), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT p2)), (X p2), (X (X (AND (NOT p2) p0 p1))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT p2))), (X (X p2)), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p2 p0 p1))), (F (NOT (OR p2 p0 (NOT p1)))), (F (NOT p1)), (F (NOT p0)), (F p2), (F (NOT (OR p2 (NOT p0) p1))), (F (NOT (AND (NOT p2) p0 p1)))]
Knowledge based reduction with 4 factoid took 678 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p2) p0 (NOT p1))]
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p2) p0 (NOT p1))]
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p2) p0 (NOT p1))]
Product exploration explored 100000 steps with 7887 reset in 633 ms.
Product exploration explored 100000 steps with 7929 reset in 623 ms.
Support contains 53 out of 77 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 116/116 transitions.
Applied a total of 0 rules in 5 ms. Remains 77 /77 variables (removed 0) and now considering 116/116 (removed 0) transitions.
[2024-06-01 21:30:39] [INFO ] Invariant cache hit.
[2024-06-01 21:30:39] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-06-01 21:30:39] [INFO ] Invariant cache hit.
[2024-06-01 21:30:39] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
[2024-06-01 21:30:39] [INFO ] Redundant transitions in 3 ms returned []
Running 106 sub problems to find dead transitions.
[2024-06-01 21:30:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 2/77 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 116/193 variables, 77/83 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (OVERLAPS) 0/193 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 83 constraints, problems are : Problem set: 0 solved, 106 unsolved in 2239 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 77/77 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 2/77 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 116/193 variables, 77/83 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 106/189 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (OVERLAPS) 0/193 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 189 constraints, problems are : Problem set: 0 solved, 106 unsolved in 2691 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 77/77 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints]
After SMT, in 5005ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 5007ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 5176 ms. Remains : 77/77 places, 116/116 transitions.
Treatment of property UtilityControlRoom-PT-Z4T4N02-LTLFireability-00 finished in 26233 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(!p1))))'
Support contains 15 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 118/118 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 55 transition count 94
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 55 transition count 94
Applied a total of 48 rules in 6 ms. Remains 55 /79 variables (removed 24) and now considering 94/118 (removed 24) transitions.
// Phase 1: matrix 94 rows 55 cols
[2024-06-01 21:30:44] [INFO ] Computed 6 invariants in 3 ms
[2024-06-01 21:30:44] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-06-01 21:30:44] [INFO ] Invariant cache hit.
[2024-06-01 21:30:44] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
Running 92 sub problems to find dead transitions.
[2024-06-01 21:30:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (OVERLAPS) 2/55 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 94/149 variables, 55/61 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (OVERLAPS) 0/149 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 149/149 variables, and 61 constraints, problems are : Problem set: 0 solved, 92 unsolved in 1587 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 92 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (OVERLAPS) 2/55 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 94/149 variables, 55/61 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 92/153 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (OVERLAPS) 0/149 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Int declared 149/149 variables, and 153 constraints, problems are : Problem set: 0 solved, 92 unsolved in 1870 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 0/0 constraints]
After SMT, in 3557ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 3567ms
Starting structural reductions in LTL mode, iteration 1 : 55/79 places, 94/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3767 ms. Remains : 55/79 places, 94/118 transitions.
Stuttering acceptance computed with spot in 101 ms :[true, (AND (NOT p0) p1), p1]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N02-LTLFireability-02
Entered a terminal (fully accepting) state of product in 44 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z4T4N02-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N02-LTLFireability-02 finished in 3883 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(G((X(G(!p2))||p1)))))'
Support contains 33 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 118/118 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 55 transition count 94
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 55 transition count 94
Applied a total of 48 rules in 2 ms. Remains 55 /79 variables (removed 24) and now considering 94/118 (removed 24) transitions.
[2024-06-01 21:30:48] [INFO ] Invariant cache hit.
[2024-06-01 21:30:48] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-01 21:30:48] [INFO ] Invariant cache hit.
[2024-06-01 21:30:48] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
Running 92 sub problems to find dead transitions.
[2024-06-01 21:30:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (OVERLAPS) 2/55 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 94/149 variables, 55/61 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (OVERLAPS) 0/149 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 149/149 variables, and 61 constraints, problems are : Problem set: 0 solved, 92 unsolved in 1736 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 92 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (OVERLAPS) 2/55 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 94/149 variables, 55/61 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 92/153 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (OVERLAPS) 0/149 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Int declared 149/149 variables, and 153 constraints, problems are : Problem set: 0 solved, 92 unsolved in 2049 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 0/0 constraints]
After SMT, in 3840ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 3842ms
Starting structural reductions in LTL mode, iteration 1 : 55/79 places, 94/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3976 ms. Remains : 55/79 places, 94/118 transitions.
Stuttering acceptance computed with spot in 295 ms :[(AND (NOT p1) p2), (AND p2 (NOT p0) (NOT p1)), (AND (NOT p1) p2), p2, true, (AND p2 (NOT p0)), (AND (NOT p1) p2), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N02-LTLFireability-04
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z4T4N02-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N02-LTLFireability-04 finished in 4296 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(!p0))))'
Support contains 2 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 118/118 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 55 transition count 94
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 55 transition count 94
Applied a total of 48 rules in 7 ms. Remains 55 /79 variables (removed 24) and now considering 94/118 (removed 24) transitions.
[2024-06-01 21:30:52] [INFO ] Invariant cache hit.
[2024-06-01 21:30:52] [INFO ] Implicit Places using invariants in 89 ms returned [40]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 94 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 54/79 places, 94/118 transitions.
Applied a total of 0 rules in 2 ms. Remains 54 /54 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 104 ms. Remains : 54/79 places, 94/118 transitions.
Stuttering acceptance computed with spot in 109 ms :[p0, p0, p0]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N02-LTLFireability-05
Product exploration explored 100000 steps with 19428 reset in 112 ms.
Product exploration explored 100000 steps with 19437 reset in 123 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)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 109 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[p0, p0, p0]
RANDOM walk for 29 steps (0 resets) in 4 ms. (5 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 1 factoid took 137 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 94 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 95 ms :[p0, p0, p0]
Support contains 2 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 94/94 transitions.
Applied a total of 0 rules in 2 ms. Remains 54 /54 variables (removed 0) and now considering 94/94 (removed 0) transitions.
// Phase 1: matrix 94 rows 54 cols
[2024-06-01 21:30:53] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 21:30:53] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-06-01 21:30:53] [INFO ] Invariant cache hit.
[2024-06-01 21:30:53] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
Running 92 sub problems to find dead transitions.
[2024-06-01 21:30:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (OVERLAPS) 2/54 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 94/148 variables, 54/59 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (OVERLAPS) 0/148 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 148/148 variables, and 59 constraints, problems are : Problem set: 0 solved, 92 unsolved in 1784 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 54/54 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 92 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (OVERLAPS) 2/54 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 94/148 variables, 54/59 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 92/151 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (OVERLAPS) 0/148 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Int declared 148/148 variables, and 151 constraints, problems are : Problem set: 0 solved, 92 unsolved in 1837 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 54/54 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 0/0 constraints]
After SMT, in 3641ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 3642ms
Finished structural reductions in LTL mode , in 1 iterations and 3800 ms. Remains : 54/54 places, 94/94 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 113 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[p0, p0, p0]
RANDOM walk for 16 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 1 factoid took 130 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 93 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 95 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 96 ms :[p0, p0, p0]
Product exploration explored 100000 steps with 19587 reset in 112 ms.
Product exploration explored 100000 steps with 19124 reset in 124 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 100 ms :[p0, p0, p0]
Support contains 2 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 94/94 transitions.
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 0 place count 54 transition count 102
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 54 transition count 102
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 0 with 18 rules applied. Total rules applied 26 place count 54 transition count 108
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 34 place count 54 transition count 100
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 37 place count 51 transition count 76
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 40 place count 51 transition count 76
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 58 place count 33 transition count 46
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 1 with 18 rules applied. Total rules applied 76 place count 33 transition count 46
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 88 place count 21 transition count 34
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 100 place count 21 transition count 34
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 112 place count 21 transition count 22
Deduced a syphon composed of 8 places in 0 ms
Applied a total of 112 rules in 37 ms. Remains 21 /54 variables (removed 33) and now considering 22/94 (removed 72) transitions.
[2024-06-01 21:30:58] [INFO ] Redundant transitions in 0 ms returned []
Running 20 sub problems to find dead transitions.
// Phase 1: matrix 22 rows 21 cols
[2024-06-01 21:30:58] [INFO ] Computed 5 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 21:30:58] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 18 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 2/21 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 21:30:59] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 1/7 constraints. Problems are: Problem set: 5 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/21 variables, 0/7 constraints. Problems are: Problem set: 5 solved, 15 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
At refinement iteration 6 (OVERLAPS) 22/43 variables, 21/28 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/28 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 0/43 variables, 0/28 constraints. Problems are: Problem set: 10 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 28 constraints, problems are : Problem set: 10 solved, 10 unsolved in 480 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 10 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 1/1 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 10/21 variables, 5/6 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 1/7 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/7 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 22/43 variables, 21/28 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 10/38 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/38 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 0/43 variables, 0/38 constraints. Problems are: Problem set: 10 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 38 constraints, problems are : Problem set: 10 solved, 10 unsolved in 146 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 10/20 constraints, Known Traps: 2/2 constraints]
After SMT, in 660ms problems are : Problem set: 10 solved, 10 unsolved
Search for dead transitions found 10 dead transitions in 661ms
Found 10 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 10 transitions
Dead transitions reduction (with SMT) removed 10 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 21/54 places, 12/94 transitions.
Graph (complete) has 24 edges and 21 vertex of which 13 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 10 ms. Remains 13 /21 variables (removed 8) and now considering 12/12 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 13/54 places, 12/94 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 717 ms. Remains : 13/54 places, 12/94 transitions.
Support contains 2 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 94/94 transitions.
Applied a total of 0 rules in 3 ms. Remains 54 /54 variables (removed 0) and now considering 94/94 (removed 0) transitions.
// Phase 1: matrix 94 rows 54 cols
[2024-06-01 21:30:59] [INFO ] Computed 5 invariants in 3 ms
[2024-06-01 21:30:59] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-06-01 21:30:59] [INFO ] Invariant cache hit.
[2024-06-01 21:30:59] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
Running 92 sub problems to find dead transitions.
[2024-06-01 21:30:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (OVERLAPS) 2/54 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 94/148 variables, 54/59 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (OVERLAPS) 0/148 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 148/148 variables, and 59 constraints, problems are : Problem set: 0 solved, 92 unsolved in 2539 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 54/54 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 92 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (OVERLAPS) 2/54 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 94/148 variables, 54/59 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 92/151 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (OVERLAPS) 0/148 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Int declared 148/148 variables, and 151 constraints, problems are : Problem set: 0 solved, 92 unsolved in 1949 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 54/54 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 0/0 constraints]
After SMT, in 4520ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 4524ms
Finished structural reductions in LTL mode , in 1 iterations and 4765 ms. Remains : 54/54 places, 94/94 transitions.
Treatment of property UtilityControlRoom-PT-Z4T4N02-LTLFireability-05 finished in 11570 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((X(!p1)||p0)))'
Support contains 4 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 118/118 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 55 transition count 94
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 55 transition count 94
Applied a total of 48 rules in 3 ms. Remains 55 /79 variables (removed 24) and now considering 94/118 (removed 24) transitions.
// Phase 1: matrix 94 rows 55 cols
[2024-06-01 21:31:04] [INFO ] Computed 6 invariants in 1 ms
[2024-06-01 21:31:04] [INFO ] Implicit Places using invariants in 132 ms returned [40]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 133 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 54/79 places, 94/118 transitions.
Applied a total of 0 rules in 2 ms. Remains 54 /54 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 138 ms. Remains : 54/79 places, 94/118 transitions.
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N02-LTLFireability-06
Product exploration explored 100000 steps with 50000 reset in 112 ms.
Product exploration explored 100000 steps with 50000 reset in 134 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 33 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-PT-Z4T4N02-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-PT-Z4T4N02-LTLFireability-06 finished in 636 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 13 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 118/118 transitions.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 79 transition count 86
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 72 place count 47 transition count 78
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 72 place count 47 transition count 70
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 88 place count 39 transition count 70
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 92 place count 37 transition count 68
Applied a total of 92 rules in 8 ms. Remains 37 /79 variables (removed 42) and now considering 68/118 (removed 50) transitions.
// Phase 1: matrix 68 rows 37 cols
[2024-06-01 21:31:04] [INFO ] Computed 6 invariants in 0 ms
[2024-06-01 21:31:05] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-06-01 21:31:05] [INFO ] Invariant cache hit.
[2024-06-01 21:31:05] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
[2024-06-01 21:31:05] [INFO ] Redundant transitions in 1 ms returned []
Running 58 sub problems to find dead transitions.
[2024-06-01 21:31:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (OVERLAPS) 2/37 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (OVERLAPS) 68/105 variables, 37/43 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (OVERLAPS) 0/105 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 105/105 variables, and 43 constraints, problems are : Problem set: 0 solved, 58 unsolved in 885 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 37/37 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (OVERLAPS) 2/37 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (OVERLAPS) 68/105 variables, 37/43 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 58/101 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (OVERLAPS) 0/105 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 105/105 variables, and 101 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1107 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 37/37 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints]
After SMT, in 2054ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 2054ms
Starting structural reductions in SI_LTL mode, iteration 1 : 37/79 places, 68/118 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2257 ms. Remains : 37/79 places, 68/118 transitions.
Stuttering acceptance computed with spot in 41 ms :[p0]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N02-LTLFireability-07
Product exploration explored 100000 steps with 0 reset in 536 ms.
Stack based approach found an accepted trace after 24 steps with 0 reset with depth 25 and stack size 25 in 1 ms.
FORMULA UtilityControlRoom-PT-Z4T4N02-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N02-LTLFireability-07 finished in 2855 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 5 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 118/118 transitions.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 79 transition count 86
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 72 place count 47 transition count 78
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 72 place count 47 transition count 71
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 86 place count 40 transition count 71
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 88 place count 38 transition count 55
Iterating global reduction 2 with 2 rules applied. Total rules applied 90 place count 38 transition count 55
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 94 place count 34 transition count 51
Iterating global reduction 2 with 4 rules applied. Total rules applied 98 place count 34 transition count 51
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 101 place count 31 transition count 45
Iterating global reduction 2 with 3 rules applied. Total rules applied 104 place count 31 transition count 45
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 107 place count 28 transition count 39
Iterating global reduction 2 with 3 rules applied. Total rules applied 110 place count 28 transition count 39
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 113 place count 28 transition count 36
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 119 place count 25 transition count 33
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 121 place count 24 transition count 32
Applied a total of 121 rules in 48 ms. Remains 24 /79 variables (removed 55) and now considering 32/118 (removed 86) transitions.
// Phase 1: matrix 32 rows 24 cols
[2024-06-01 21:31:07] [INFO ] Computed 6 invariants in 1 ms
[2024-06-01 21:31:08] [INFO ] Implicit Places using invariants in 268 ms returned []
[2024-06-01 21:31:08] [INFO ] Invariant cache hit.
[2024-06-01 21:31:08] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 385 ms to find 0 implicit places.
[2024-06-01 21:31:08] [INFO ] Redundant transitions in 1 ms returned []
Running 26 sub problems to find dead transitions.
[2024-06-01 21:31:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (OVERLAPS) 2/24 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (OVERLAPS) 32/56 variables, 24/30 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (OVERLAPS) 0/56 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 30 constraints, problems are : Problem set: 0 solved, 26 unsolved in 363 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 24/24 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (OVERLAPS) 2/24 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (OVERLAPS) 32/56 variables, 24/30 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 26/56 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (OVERLAPS) 0/56 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/56 variables, and 56 constraints, problems are : Problem set: 0 solved, 26 unsolved in 370 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 24/24 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints]
After SMT, in 742ms problems are : Problem set: 0 solved, 26 unsolved
Search for dead transitions found 0 dead transitions in 742ms
Starting structural reductions in SI_LTL mode, iteration 1 : 24/79 places, 32/118 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1181 ms. Remains : 24/79 places, 32/118 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N02-LTLFireability-09
Product exploration explored 100000 steps with 0 reset in 131 ms.
Stack based approach found an accepted trace after 9 steps with 0 reset with depth 10 and stack size 10 in 1 ms.
FORMULA UtilityControlRoom-PT-Z4T4N02-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N02-LTLFireability-09 finished in 1368 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 118/118 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 55 transition count 94
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 55 transition count 94
Applied a total of 48 rules in 5 ms. Remains 55 /79 variables (removed 24) and now considering 94/118 (removed 24) transitions.
// Phase 1: matrix 94 rows 55 cols
[2024-06-01 21:31:09] [INFO ] Computed 6 invariants in 1 ms
[2024-06-01 21:31:09] [INFO ] Implicit Places using invariants in 113 ms returned [40]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 114 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 54/79 places, 94/118 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 121 ms. Remains : 54/79 places, 94/118 transitions.
Stuttering acceptance computed with spot in 142 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N02-LTLFireability-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z4T4N02-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N02-LTLFireability-11 finished in 277 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U (X(G(p1)) U (p2||X(G(!p2))))))'
Support contains 4 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 118/118 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 55 transition count 94
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 55 transition count 94
Applied a total of 48 rules in 3 ms. Remains 55 /79 variables (removed 24) and now considering 94/118 (removed 24) transitions.
[2024-06-01 21:31:09] [INFO ] Invariant cache hit.
[2024-06-01 21:31:09] [INFO ] Implicit Places using invariants in 98 ms returned [40]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 108 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 54/79 places, 94/118 transitions.
Applied a total of 0 rules in 7 ms. Remains 54 /54 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 118 ms. Remains : 54/79 places, 94/118 transitions.
Stuttering acceptance computed with spot in 292 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) p2), (NOT p0), false]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N02-LTLFireability-12
Product exploration explored 100000 steps with 47 reset in 136 ms.
Stack based approach found an accepted trace after 668 steps with 0 reset with depth 669 and stack size 636 in 2 ms.
FORMULA UtilityControlRoom-PT-Z4T4N02-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N02-LTLFireability-12 finished in 570 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U X(G((p1||X((G(p2) U (p1&&G(p2))))))))))'
Support contains 5 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 118/118 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 56 transition count 95
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 56 transition count 95
Applied a total of 46 rules in 3 ms. Remains 56 /79 variables (removed 23) and now considering 95/118 (removed 23) transitions.
// Phase 1: matrix 95 rows 56 cols
[2024-06-01 21:31:09] [INFO ] Computed 6 invariants in 1 ms
[2024-06-01 21:31:10] [INFO ] Implicit Places using invariants in 73 ms returned [41]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 91 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 55/79 places, 95/118 transitions.
Applied a total of 0 rules in 1 ms. Remains 55 /55 variables (removed 0) and now considering 95/95 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 96 ms. Remains : 55/79 places, 95/118 transitions.
Stuttering acceptance computed with spot in 389 ms :[(NOT p1), (NOT p1), (NOT p1), (OR (NOT p2) (NOT p1)), true, (NOT p2), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N02-LTLFireability-13
Entered a terminal (fully accepting) state of product in 944 steps with 0 reset in 2 ms.
FORMULA UtilityControlRoom-PT-Z4T4N02-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N02-LTLFireability-13 finished in 513 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)&&X(X(G(p2))))))))'
Support contains 5 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 118/118 transitions.
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 79 transition count 87
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 69 place count 48 transition count 80
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 69 place count 48 transition count 72
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 85 place count 40 transition count 72
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 87 place count 38 transition count 56
Iterating global reduction 2 with 2 rules applied. Total rules applied 89 place count 38 transition count 56
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 93 place count 34 transition count 52
Iterating global reduction 2 with 4 rules applied. Total rules applied 97 place count 34 transition count 52
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 101 place count 30 transition count 44
Iterating global reduction 2 with 4 rules applied. Total rules applied 105 place count 30 transition count 44
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 109 place count 26 transition count 36
Iterating global reduction 2 with 4 rules applied. Total rules applied 113 place count 26 transition count 36
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 117 place count 26 transition count 32
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 123 place count 23 transition count 29
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 124 place count 23 transition count 29
Applied a total of 124 rules in 24 ms. Remains 23 /79 variables (removed 56) and now considering 29/118 (removed 89) transitions.
// Phase 1: matrix 29 rows 23 cols
[2024-06-01 21:31:10] [INFO ] Computed 6 invariants in 1 ms
[2024-06-01 21:31:10] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-06-01 21:31:10] [INFO ] Invariant cache hit.
[2024-06-01 21:31:10] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2024-06-01 21:31:10] [INFO ] Redundant transitions in 0 ms returned []
Running 25 sub problems to find dead transitions.
[2024-06-01 21:31:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (OVERLAPS) 2/23 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (OVERLAPS) 29/52 variables, 23/29 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (OVERLAPS) 0/52 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/52 variables, and 29 constraints, problems are : Problem set: 0 solved, 25 unsolved in 343 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 23/23 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 25 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (OVERLAPS) 2/23 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (OVERLAPS) 29/52 variables, 23/29 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 25/54 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (OVERLAPS) 0/52 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/52 variables, and 54 constraints, problems are : Problem set: 0 solved, 25 unsolved in 358 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 23/23 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints]
After SMT, in 718ms problems are : Problem set: 0 solved, 25 unsolved
Search for dead transitions found 0 dead transitions in 718ms
Starting structural reductions in SI_LTL mode, iteration 1 : 23/79 places, 29/118 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 849 ms. Remains : 23/79 places, 29/118 transitions.
Stuttering acceptance computed with spot in 339 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N02-LTLFireability-14
Product exploration explored 100000 steps with 6292 reset in 203 ms.
Stack based approach found an accepted trace after 35 steps with 2 reset with depth 22 and stack size 21 in 0 ms.
FORMULA UtilityControlRoom-PT-Z4T4N02-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N02-LTLFireability-14 finished in 1416 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 118/118 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 79 transition count 87
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 69 place count 48 transition count 80
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 69 place count 48 transition count 72
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 85 place count 40 transition count 72
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 87 place count 38 transition count 56
Iterating global reduction 2 with 2 rules applied. Total rules applied 89 place count 38 transition count 56
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 93 place count 34 transition count 52
Iterating global reduction 2 with 4 rules applied. Total rules applied 97 place count 34 transition count 52
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 101 place count 30 transition count 44
Iterating global reduction 2 with 4 rules applied. Total rules applied 105 place count 30 transition count 44
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 109 place count 26 transition count 36
Iterating global reduction 2 with 4 rules applied. Total rules applied 113 place count 26 transition count 36
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 117 place count 26 transition count 32
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 133 place count 18 transition count 24
Applied a total of 133 rules in 31 ms. Remains 18 /79 variables (removed 61) and now considering 24/118 (removed 94) transitions.
// Phase 1: matrix 24 rows 18 cols
[2024-06-01 21:31:11] [INFO ] Computed 6 invariants in 4 ms
[2024-06-01 21:31:12] [INFO ] Implicit Places using invariants in 106 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 118 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/79 places, 24/118 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 24/24 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 150 ms. Remains : 17/79 places, 24/118 transitions.
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N02-LTLFireability-15
Product exploration explored 100000 steps with 1858 reset in 176 ms.
Stack based approach found an accepted trace after 14 steps with 0 reset with depth 15 and stack size 15 in 0 ms.
FORMULA UtilityControlRoom-PT-Z4T4N02-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N02-LTLFireability-15 finished in 500 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G((G(p1)||p0))||F(p2)))))'
Found a Lengthening insensitive property : UtilityControlRoom-PT-Z4T4N02-LTLFireability-00
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) p0 (NOT p1))]
Support contains 53 out of 79 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 79/79 places, 118/118 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 77 transition count 116
Applied a total of 4 rules in 4 ms. Remains 77 /79 variables (removed 2) and now considering 116/118 (removed 2) transitions.
// Phase 1: matrix 116 rows 77 cols
[2024-06-01 21:31:12] [INFO ] Computed 6 invariants in 7 ms
[2024-06-01 21:31:12] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-01 21:31:12] [INFO ] Invariant cache hit.
[2024-06-01 21:31:12] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
Running 106 sub problems to find dead transitions.
[2024-06-01 21:31:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 2/77 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 116/193 variables, 77/83 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (OVERLAPS) 0/193 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 83 constraints, problems are : Problem set: 0 solved, 106 unsolved in 2390 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 77/77 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 2/77 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 116/193 variables, 77/83 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 106/189 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (OVERLAPS) 0/193 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 189 constraints, problems are : Problem set: 0 solved, 106 unsolved in 2789 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 77/77 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints]
After SMT, in 5225ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 5227ms
Starting structural reductions in LI_LTL mode, iteration 1 : 77/79 places, 116/118 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 5403 ms. Remains : 77/79 places, 116/118 transitions.
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N02-LTLFireability-00
Product exploration explored 100000 steps with 7848 reset in 462 ms.
Product exploration explored 100000 steps with 7856 reset in 468 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p0), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 461 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p2) p0 (NOT p1))]
RANDOM walk for 39 steps (0 resets) in 6 ms. (5 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p0), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p2 p0 p1))), (F (NOT (OR p2 p0 (NOT p1)))), (F (NOT p1)), (F (NOT p0)), (F p2), (F (NOT (OR p2 (NOT p0) p1))), (F (NOT (AND (NOT p2) p0 p1)))]
Knowledge based reduction with 6 factoid took 761 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p2) p0 (NOT p1))]
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p2) p0 (NOT p1))]
Support contains 53 out of 77 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 116/116 transitions.
Applied a total of 0 rules in 2 ms. Remains 77 /77 variables (removed 0) and now considering 116/116 (removed 0) transitions.
[2024-06-01 21:31:20] [INFO ] Invariant cache hit.
[2024-06-01 21:31:20] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-06-01 21:31:20] [INFO ] Invariant cache hit.
[2024-06-01 21:31:20] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
[2024-06-01 21:31:20] [INFO ] Redundant transitions in 3 ms returned []
Running 106 sub problems to find dead transitions.
[2024-06-01 21:31:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 2/77 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 116/193 variables, 77/83 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (OVERLAPS) 0/193 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 83 constraints, problems are : Problem set: 0 solved, 106 unsolved in 2272 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 77/77 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 2/77 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 116/193 variables, 77/83 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 106/189 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (OVERLAPS) 0/193 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 189 constraints, problems are : Problem set: 0 solved, 106 unsolved in 2820 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 77/77 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints]
After SMT, in 5153ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 5154ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 5320 ms. Remains : 77/77 places, 116/116 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 p2) p0 p1), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X p0), (X p1)]
False Knowledge obtained : [(X (AND (NOT p2) p0 p1)), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT p2)), (X p2), (X (X (AND (NOT p2) p0 p1))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT p2))), (X (X p2)), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 481 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p2) p0 (NOT p1))]
RANDOM walk for 74 steps (0 resets) in 6 ms. (10 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X p0), (X p1)]
False Knowledge obtained : [(X (AND (NOT p2) p0 p1)), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT p2)), (X p2), (X (X (AND (NOT p2) p0 p1))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT p2))), (X (X p2)), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p2 p0 p1))), (F (NOT (OR p2 p0 (NOT p1)))), (F (NOT p1)), (F (NOT p0)), (F p2), (F (NOT (OR p2 (NOT p0) p1))), (F (NOT (AND (NOT p2) p0 p1)))]
Knowledge based reduction with 4 factoid took 844 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p2) p0 (NOT p1))]
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p2) p0 (NOT p1))]
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p2) p0 (NOT p1))]
Product exploration explored 100000 steps with 7911 reset in 621 ms.
Product exploration explored 100000 steps with 7826 reset in 634 ms.
Support contains 53 out of 77 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 116/116 transitions.
Applied a total of 0 rules in 2 ms. Remains 77 /77 variables (removed 0) and now considering 116/116 (removed 0) transitions.
[2024-06-01 21:31:29] [INFO ] Invariant cache hit.
[2024-06-01 21:31:29] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-06-01 21:31:29] [INFO ] Invariant cache hit.
[2024-06-01 21:31:29] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
[2024-06-01 21:31:29] [INFO ] Redundant transitions in 2 ms returned []
Running 106 sub problems to find dead transitions.
[2024-06-01 21:31:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 2/77 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 116/193 variables, 77/83 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (OVERLAPS) 0/193 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 83 constraints, problems are : Problem set: 0 solved, 106 unsolved in 2326 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 77/77 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 2/77 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 116/193 variables, 77/83 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 106/189 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (OVERLAPS) 0/193 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 189 constraints, problems are : Problem set: 0 solved, 106 unsolved in 2799 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 77/77 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints]
After SMT, in 5181ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 5185ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 5381 ms. Remains : 77/77 places, 116/116 transitions.
Treatment of property UtilityControlRoom-PT-Z4T4N02-LTLFireability-00 finished in 22059 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(!p0))))'
Found a Shortening insensitive property : UtilityControlRoom-PT-Z4T4N02-LTLFireability-05
Stuttering acceptance computed with spot in 100 ms :[p0, p0, p0]
Support contains 2 out of 79 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 79/79 places, 118/118 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 79 transition count 86
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 72 place count 47 transition count 78
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 72 place count 47 transition count 70
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 88 place count 39 transition count 70
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 91 place count 36 transition count 46
Iterating global reduction 2 with 3 rules applied. Total rules applied 94 place count 36 transition count 46
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 100 place count 30 transition count 40
Iterating global reduction 2 with 6 rules applied. Total rules applied 106 place count 30 transition count 40
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 112 place count 24 transition count 28
Iterating global reduction 2 with 6 rules applied. Total rules applied 118 place count 24 transition count 28
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 124 place count 18 transition count 22
Iterating global reduction 2 with 6 rules applied. Total rules applied 130 place count 18 transition count 22
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 136 place count 18 transition count 16
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 136 place count 18 transition count 14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 140 place count 16 transition count 14
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 144 place count 14 transition count 12
Applied a total of 144 rules in 13 ms. Remains 14 /79 variables (removed 65) and now considering 12/118 (removed 106) transitions.
// Phase 1: matrix 12 rows 14 cols
[2024-06-01 21:31:34] [INFO ] Computed 6 invariants in 0 ms
[2024-06-01 21:31:34] [INFO ] Implicit Places using invariants in 121 ms returned [0, 7]
[2024-06-01 21:31:34] [INFO ] Actually due to overlaps returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 123 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 13/79 places, 12/118 transitions.
Applied a total of 0 rules in 1 ms. Remains 13 /13 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 137 ms. Remains : 13/79 places, 12/118 transitions.
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N02-LTLFireability-05
Product exploration explored 100000 steps with 20681 reset in 232 ms.
Product exploration explored 100000 steps with 20686 reset in 263 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)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 245 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[p0, p0, p0]
RANDOM walk for 10 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 1 factoid took 132 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 99 ms :[p0, p0, p0]
Support contains 2 out of 13 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13/13 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 13 /13 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 13 cols
[2024-06-01 21:31:36] [INFO ] Computed 5 invariants in 0 ms
[2024-06-01 21:31:36] [INFO ] Implicit Places using invariants in 27 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 40 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 12/13 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42 ms. Remains : 12/13 places, 12/12 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 115 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 230 ms :[p0, p0, p0]
RANDOM walk for 12 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 1 factoid took 132 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 99 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 102 ms :[p0, p0, p0]
Product exploration explored 100000 steps with 20636 reset in 75 ms.
Product exploration explored 100000 steps with 20746 reset in 75 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 99 ms :[p0, p0, p0]
Support contains 2 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 12 transition count 14
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 12 transition count 14
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 4 ms. Remains 12 /12 variables (removed 0) and now considering 14/12 (removed -2) transitions.
[2024-06-01 21:31:37] [INFO ] Redundant transitions in 0 ms returned []
Running 12 sub problems to find dead transitions.
// Phase 1: matrix 14 rows 12 cols
[2024-06-01 21:31:37] [INFO ] Computed 4 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 2/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-06-01 21:31:37] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 6 ms to minimize.
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
[2024-06-01 21:31:37] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 2 ms to minimize.
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 2/6 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/6 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 14/26 variables, 12/18 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 0/18 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/26 variables, 0/18 constraints. Problems are: Problem set: 4 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 26/26 variables, and 18 constraints, problems are : Problem set: 4 solved, 8 unsolved in 195 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 4 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 4/12 variables, 4/4 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 2/6 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/6 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 14/26 variables, 12/18 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 8/26 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 0/26 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 0/26 variables, 0/26 constraints. Problems are: Problem set: 4 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 26/26 variables, and 26 constraints, problems are : Problem set: 4 solved, 8 unsolved in 109 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 8/12 constraints, Known Traps: 2/2 constraints]
After SMT, in 321ms problems are : Problem set: 4 solved, 8 unsolved
Search for dead transitions found 4 dead transitions in 322ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 12/12 places, 10/12 transitions.
Graph (complete) has 14 edges and 12 vertex of which 10 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 1 ms. Remains 10 /12 variables (removed 2) and now considering 10/10 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 10/12 places, 10/12 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 338 ms. Remains : 10/12 places, 10/12 transitions.
Support contains 2 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 12 cols
[2024-06-01 21:31:37] [INFO ] Computed 4 invariants in 4 ms
[2024-06-01 21:31:37] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-06-01 21:31:37] [INFO ] Invariant cache hit.
[2024-06-01 21:31:37] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
Running 10 sub problems to find dead transitions.
[2024-06-01 21:31:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 2/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 12/24 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 0/24 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/24 variables, and 16 constraints, problems are : Problem set: 0 solved, 10 unsolved in 107 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 2/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 12/24 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 10/26 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 0/24 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/24 variables, and 26 constraints, problems are : Problem set: 0 solved, 10 unsolved in 118 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 245ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 245ms
Finished structural reductions in LTL mode , in 1 iterations and 326 ms. Remains : 12/12 places, 12/12 transitions.
Treatment of property UtilityControlRoom-PT-Z4T4N02-LTLFireability-05 finished in 3521 ms.
[2024-06-01 21:31:38] [INFO ] Flatten gal took : 39 ms
[2024-06-01 21:31:38] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 6 ms.
[2024-06-01 21:31:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 79 places, 118 transitions and 344 arcs took 20 ms.
Total runtime 82505 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : UtilityControlRoom-PT-Z4T4N02-LTLFireability-00
FORMULA UtilityControlRoom-PT-Z4T4N02-LTLFireability-05 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717277498731

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name UtilityControlRoom-PT-Z4T4N02-LTLFireability-00
ltl formula formula --ltl=/tmp/1815/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 79 places, 118 transitions and 344 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1815/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1815/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1815/ltl_0_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.000 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1815/ltl_0_
pnml2lts-mc( 3/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
double free or corruption (fasttop)
ltl formula name UtilityControlRoom-PT-Z4T4N02-LTLFireability-05
ltl formula formula --ltl=/tmp/1815/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 79 places, 118 transitions and 344 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1815/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1815/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1815/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1815/ltl_1_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 81 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 80, there are 121 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~18 levels ~10000 states ~26948 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 12524
pnml2lts-mc( 0/ 4): unique states count: 12524
pnml2lts-mc( 0/ 4): unique transitions count: 38662
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 26258
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 12630
pnml2lts-mc( 0/ 4): - cum. max stack depth: 71
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 12630 states 39186 transitions, fanout: 3.103
pnml2lts-mc( 0/ 4): Total exploration time 0.150 sec (0.150 sec minimum, 0.150 sec on average)
pnml2lts-mc( 0/ 4): States per second: 84200, Transitions per second: 261240
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.2MB, 12.6 B/state, compr.: 3.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 118 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.2MB (~256.0MB paged-in)

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-Z4T4N02"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is UtilityControlRoom-PT-Z4T4N02, 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 r544-smll-171701111100244"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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