fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r443-smll-171701109800108
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for UtilityControlRoom-COL-Z4T4N02

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
494.560 196830.00 249320.00 1072.60 TTFTFTTFTFTFFFFT normal

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.r443-smll-171701109800108.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 greatspnxred
Input is UtilityControlRoom-COL-Z4T4N02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r443-smll-171701109800108
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 11K Apr 13 05:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 109K Apr 13 05:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 13 05:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 13 05:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Apr 23 08:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 08:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 23 08:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 08:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 13 05:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Apr 13 05:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 13 05:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Apr 13 05:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 23 08:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 23 08:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 8 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 29K 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-COL-Z4T4N02-LTLFireability-00
FORMULA_NAME UtilityControlRoom-COL-Z4T4N02-LTLFireability-01
FORMULA_NAME UtilityControlRoom-COL-Z4T4N02-LTLFireability-02
FORMULA_NAME UtilityControlRoom-COL-Z4T4N02-LTLFireability-03
FORMULA_NAME UtilityControlRoom-COL-Z4T4N02-LTLFireability-04
FORMULA_NAME UtilityControlRoom-COL-Z4T4N02-LTLFireability-05
FORMULA_NAME UtilityControlRoom-COL-Z4T4N02-LTLFireability-06
FORMULA_NAME UtilityControlRoom-COL-Z4T4N02-LTLFireability-07
FORMULA_NAME UtilityControlRoom-COL-Z4T4N02-LTLFireability-08
FORMULA_NAME UtilityControlRoom-COL-Z4T4N02-LTLFireability-09
FORMULA_NAME UtilityControlRoom-COL-Z4T4N02-LTLFireability-10
FORMULA_NAME UtilityControlRoom-COL-Z4T4N02-LTLFireability-11
FORMULA_NAME UtilityControlRoom-COL-Z4T4N02-LTLFireability-12
FORMULA_NAME UtilityControlRoom-COL-Z4T4N02-LTLFireability-13
FORMULA_NAME UtilityControlRoom-COL-Z4T4N02-LTLFireability-14
FORMULA_NAME UtilityControlRoom-COL-Z4T4N02-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717065379073

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=UtilityControlRoom-COL-Z4T4N02
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 10:36:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-30 10:36:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 10:36:21] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-30 10:36:22] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-30 10:36:23] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1278 ms
[2024-05-30 10:36:23] [INFO ] Imported 13 HL places and 12 HL transitions for a total of 80 PT places and 150.0 transition bindings in 39 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 36 ms.
Working with output stream class java.io.PrintStream
[2024-05-30 10:36:23] [INFO ] Built PT skeleton of HLPN with 13 places and 12 transitions 37 arcs in 9 ms.
[2024-05-30 10:36:23] [INFO ] Skeletonized 16 HLPN properties in 5 ms.
Initial state reduction rules removed 4 formulas.
FORMULA UtilityControlRoom-COL-Z4T4N02-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z4T4N02-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z4T4N02-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z4T4N02-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 9 properties that can be checked using skeleton over-approximation.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Reduction of identical properties reduced properties to check from 10 to 9
RANDOM walk for 115 steps (0 resets) in 22 ms. (5 steps per ms) remains 0/9 properties
[2024-05-30 10:36:23] [INFO ] Flatten gal took : 31 ms
[2024-05-30 10:36:23] [INFO ] Flatten gal took : 7 ms
Domain [Cli(2), Z(4), Z(4)] of place MovetoZ breaks symmetries in sort Z
Transition timeout forces synchronizations/join behavior on parameter c of sort Cli
[2024-05-30 10:36:23] [INFO ] Unfolded HLPN to a Petri net with 80 places and 150 transitions 482 arcs in 45 ms.
[2024-05-30 10:36:23] [INFO ] Unfolded 12 HLPN properties in 0 ms.
[2024-05-30 10:36:23] [INFO ] Reduced 6 identical enabling conditions.
[2024-05-30 10:36:23] [INFO ] Reduced 6 identical enabling conditions.
Ensure Unique test removed 32 transitions
Reduce redundant transitions removed 32 transitions.
Support contains 71 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 17 ms. Remains 80 /80 variables (removed 0) and now considering 118/118 (removed 0) transitions.
// Phase 1: matrix 118 rows 80 cols
[2024-05-30 10:36:24] [INFO ] Computed 7 invariants in 32 ms
[2024-05-30 10:36:24] [INFO ] Implicit Places using invariants in 655 ms returned [65]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 718 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 3 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 766 ms. Remains : 79/80 places, 118/118 transitions.
Support contains 71 out of 79 places after structural reductions.
[2024-05-30 10:36:24] [INFO ] Flatten gal took : 24 ms
[2024-05-30 10:36:24] [INFO ] Flatten gal took : 25 ms
[2024-05-30 10:36:24] [INFO ] Input system was already deterministic with 118 transitions.
Reduction of identical properties reduced properties to check from 13 to 11
RANDOM walk for 59 steps (0 resets) in 30 ms. (1 steps per ms) remains 0/11 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 2 ms. Remains 79 /79 variables (removed 0) and now considering 118/118 (removed 0) transitions.
// Phase 1: matrix 118 rows 79 cols
[2024-05-30 10:36:25] [INFO ] Computed 6 invariants in 3 ms
[2024-05-30 10:36:25] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-30 10:36:25] [INFO ] Invariant cache hit.
[2024-05-30 10:36:25] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
Running 116 sub problems to find dead transitions.
[2024-05-30 10:36:25] [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 4531 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 4979 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 9708ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 9728ms
Finished structural reductions in LTL mode , in 1 iterations and 9930 ms. Remains : 79/79 places, 118/118 transitions.
Stuttering acceptance computed with spot in 533 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-COL-Z4T4N02-LTLFireability-00
Product exploration explored 100000 steps with 7048 reset in 1073 ms.
Product exploration explored 100000 steps with 7095 reset in 556 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 (NOT (AND (NOT p0) p1 (NOT p2)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0)), (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 306 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 160 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p2) p0 (NOT p1))]
RANDOM walk for 112 steps (0 resets) in 36 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 (NOT (AND (NOT p0) p1 (NOT p2)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0)), (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 p0)), (F (NOT (OR p2 p0 p1))), (F (NOT (OR p2 p0 (NOT p1)))), (F (NOT p1)), (F p2), (F (NOT (OR p2 (NOT p0) p1))), (F (NOT (AND (NOT p2) p0 p1)))]
Knowledge based reduction with 11 factoid took 795 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 158 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p2) p0 (NOT p1))]
Stuttering acceptance computed with spot in 161 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 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 35 ms. Remains 77 /79 variables (removed 2) and now considering 116/118 (removed 2) transitions.
// Phase 1: matrix 116 rows 77 cols
[2024-05-30 10:36:39] [INFO ] Computed 6 invariants in 3 ms
[2024-05-30 10:36:39] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-30 10:36:39] [INFO ] Invariant cache hit.
[2024-05-30 10:36:39] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
[2024-05-30 10:36:39] [INFO ] Redundant transitions in 5 ms returned []
Running 106 sub problems to find dead transitions.
[2024-05-30 10:36: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 3332 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 3882 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 7345ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 7349ms
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 7617 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 (NOT p2)), (X p2), (X (AND (NOT p2) p0 p1)), (X (NOT (AND (NOT p2) p0 p1))), (X (X (NOT p2))), (X (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 p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 681 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 156 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p2) p0 (NOT p1))]
RANDOM walk for 78 steps (0 resets) in 9 ms. (7 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 (NOT p2)), (X p2), (X (AND (NOT p2) p0 p1)), (X (NOT (AND (NOT p2) p0 p1))), (X (X (NOT p2))), (X (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 p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT (OR p2 p0 p1))), (F (NOT (OR p2 p0 (NOT p1)))), (F (NOT p1)), (F p2), (F (NOT (OR p2 (NOT p0) p1))), (F (NOT (AND (NOT p2) p0 p1)))]
Knowledge based reduction with 4 factoid took 751 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 130 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p2) p0 (NOT p1))]
Stuttering acceptance computed with spot in 136 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))]
Product exploration explored 100000 steps with 7868 reset in 1000 ms.
Product exploration explored 100000 steps with 7758 reset in 633 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-05-30 10:36:50] [INFO ] Invariant cache hit.
[2024-05-30 10:36:50] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-30 10:36:50] [INFO ] Invariant cache hit.
[2024-05-30 10:36:50] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
[2024-05-30 10:36:50] [INFO ] Redundant transitions in 3 ms returned []
Running 106 sub problems to find dead transitions.
[2024-05-30 10:36:50] [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 3515 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 3439 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 7010ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 7013ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7215 ms. Remains : 77/77 places, 116/116 transitions.
Treatment of property UtilityControlRoom-COL-Z4T4N02-LTLFireability-00 finished in 32470 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-05-30 10:36:57] [INFO ] Computed 6 invariants in 3 ms
[2024-05-30 10:36:57] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-30 10:36:57] [INFO ] Invariant cache hit.
[2024-05-30 10:36:58] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
Running 92 sub problems to find dead transitions.
[2024-05-30 10:36:58] [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 2165 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 2397 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 4658ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 4661ms
Starting structural reductions in LTL mode, iteration 1 : 55/79 places, 94/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4818 ms. Remains : 55/79 places, 94/118 transitions.
Stuttering acceptance computed with spot in 142 ms :[true, (AND (NOT p0) p1), p1]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N02-LTLFireability-02
Entered a terminal (fully accepting) state of product in 150 steps with 0 reset in 1 ms.
FORMULA UtilityControlRoom-COL-Z4T4N02-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N02-LTLFireability-02 finished in 4983 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 4 ms. Remains 55 /79 variables (removed 24) and now considering 94/118 (removed 24) transitions.
[2024-05-30 10:37:03] [INFO ] Invariant cache hit.
[2024-05-30 10:37:03] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-30 10:37:03] [INFO ] Invariant cache hit.
[2024-05-30 10:37:03] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
Running 92 sub problems to find dead transitions.
[2024-05-30 10:37:03] [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 2201 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 3350 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 5648ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 5653ms
Starting structural reductions in LTL mode, iteration 1 : 55/79 places, 94/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5812 ms. Remains : 55/79 places, 94/118 transitions.
Stuttering acceptance computed with spot in 395 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-COL-Z4T4N02-LTLFireability-04
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z4T4N02-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N02-LTLFireability-04 finished in 6366 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 6 ms. Remains 55 /79 variables (removed 24) and now considering 94/118 (removed 24) transitions.
[2024-05-30 10:37:09] [INFO ] Invariant cache hit.
[2024-05-30 10:37:09] [INFO ] Implicit Places using invariants in 152 ms returned [40]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 155 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 3 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 164 ms. Remains : 54/79 places, 94/118 transitions.
Stuttering acceptance computed with spot in 152 ms :[p0, p0, p0]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N02-LTLFireability-05
Product exploration explored 100000 steps with 19444 reset in 172 ms.
Product exploration explored 100000 steps with 19412 reset in 204 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 169 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 144 ms :[p0, p0, p0]
RANDOM walk for 18 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 189 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 142 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 140 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-05-30 10:37:10] [INFO ] Computed 5 invariants in 1 ms
[2024-05-30 10:37:10] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-30 10:37:10] [INFO ] Invariant cache hit.
[2024-05-30 10:37:11] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
Running 92 sub problems to find dead transitions.
[2024-05-30 10:37:11] [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 2497 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 3015 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 5548ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 5551ms
Finished structural reductions in LTL mode , in 1 iterations and 5772 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 162 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 163 ms :[p0, p0, p0]
RANDOM walk for 20 steps (0 resets) in 7 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 189 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 148 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 141 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 142 ms :[p0, p0, p0]
Product exploration explored 100000 steps with 19458 reset in 179 ms.
Product exploration explored 100000 steps with 19575 reset in 201 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 144 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 1 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 26 ms. Remains 21 /54 variables (removed 33) and now considering 22/94 (removed 72) transitions.
[2024-05-30 10:37:18] [INFO ] Redundant transitions in 0 ms returned []
Running 20 sub problems to find dead transitions.
// Phase 1: matrix 22 rows 21 cols
[2024-05-30 10:37:18] [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-05-30 10:37:18] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 21 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-05-30 10:37:18] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 2 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 492 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 228 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 727ms problems are : Problem set: 10 solved, 10 unsolved
Search for dead transitions found 10 dead transitions in 727ms
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 9 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 772 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 2 ms. Remains 54 /54 variables (removed 0) and now considering 94/94 (removed 0) transitions.
// Phase 1: matrix 94 rows 54 cols
[2024-05-30 10:37:19] [INFO ] Computed 5 invariants in 2 ms
[2024-05-30 10:37:19] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-30 10:37:19] [INFO ] Invariant cache hit.
[2024-05-30 10:37:19] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
Running 92 sub problems to find dead transitions.
[2024-05-30 10:37:19] [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 2587 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 3037 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 5663ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 5666ms
Finished structural reductions in LTL mode , in 1 iterations and 5895 ms. Remains : 54/54 places, 94/94 transitions.
Treatment of property UtilityControlRoom-COL-Z4T4N02-LTLFireability-05 finished in 15995 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 5 ms. Remains 55 /79 variables (removed 24) and now considering 94/118 (removed 24) transitions.
// Phase 1: matrix 94 rows 55 cols
[2024-05-30 10:37:25] [INFO ] Computed 6 invariants in 1 ms
[2024-05-30 10:37:25] [INFO ] Implicit Places using invariants in 114 ms returned [40]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 115 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 123 ms. Remains : 54/79 places, 94/118 transitions.
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N02-LTLFireability-06
Product exploration explored 100000 steps with 50000 reset in 140 ms.
Product exploration explored 100000 steps with 50000 reset in 160 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 19 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-COL-Z4T4N02-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z4T4N02-LTLFireability-06 finished in 572 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 0 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 16 ms. Remains 37 /79 variables (removed 42) and now considering 68/118 (removed 50) transitions.
// Phase 1: matrix 68 rows 37 cols
[2024-05-30 10:37:25] [INFO ] Computed 6 invariants in 1 ms
[2024-05-30 10:37:25] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-30 10:37:25] [INFO ] Invariant cache hit.
[2024-05-30 10:37:25] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2024-05-30 10:37:25] [INFO ] Redundant transitions in 1 ms returned []
Running 58 sub problems to find dead transitions.
[2024-05-30 10:37:25] [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 1288 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 1767 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 3110ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 3111ms
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 3266 ms. Remains : 37/79 places, 68/118 transitions.
Stuttering acceptance computed with spot in 50 ms :[p0]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N02-LTLFireability-07
Product exploration explored 100000 steps with 0 reset in 731 ms.
Stack based approach found an accepted trace after 29 steps with 0 reset with depth 30 and stack size 30 in 0 ms.
FORMULA UtilityControlRoom-COL-Z4T4N02-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N02-LTLFireability-07 finished in 4068 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 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 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 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 9 rules applied. Total rules applied 145 place count 13 transition count 12
Applied a total of 145 rules in 18 ms. Remains 13 /79 variables (removed 66) and now considering 12/118 (removed 106) transitions.
// Phase 1: matrix 12 rows 13 cols
[2024-05-30 10:37:29] [INFO ] Computed 5 invariants in 1 ms
[2024-05-30 10:37:29] [INFO ] Implicit Places using invariants in 39 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 40 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/79 places, 12/118 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 12 transition count 10
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 10 transition count 10
Applied a total of 4 rules in 1 ms. Remains 10 /12 variables (removed 2) and now considering 10/12 (removed 2) transitions.
// Phase 1: matrix 10 rows 10 cols
[2024-05-30 10:37:29] [INFO ] Computed 4 invariants in 0 ms
[2024-05-30 10:37:30] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-30 10:37:30] [INFO ] Invariant cache hit.
[2024-05-30 10:37:30] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 10/79 places, 10/118 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 132 ms. Remains : 10/79 places, 10/118 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N02-LTLFireability-08
Product exploration explored 100000 steps with 50000 reset in 76 ms.
Product exploration explored 100000 steps with 50000 reset in 99 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 17 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z4T4N02-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z4T4N02-LTLFireability-08 finished in 399 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((G(p0)||F(G(!p1))))))'
Support contains 18 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-05-30 10:37:30] [INFO ] Computed 6 invariants in 1 ms
[2024-05-30 10:37:30] [INFO ] Implicit Places using invariants in 93 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 99 ms. Remains : 54/79 places, 94/118 transitions.
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p0) p1), p1, (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N02-LTLFireability-09
Product exploration explored 100000 steps with 0 reset in 284 ms.
Stack based approach found an accepted trace after 164 steps with 0 reset with depth 165 and stack size 165 in 1 ms.
FORMULA UtilityControlRoom-COL-Z4T4N02-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N02-LTLFireability-09 finished in 606 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||(F(p1)&&X(G(p2))))))'
Support contains 57 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 2 ms. Remains 79 /79 variables (removed 0) and now considering 118/118 (removed 0) transitions.
// Phase 1: matrix 118 rows 79 cols
[2024-05-30 10:37:30] [INFO ] Computed 6 invariants in 2 ms
[2024-05-30 10:37:30] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-30 10:37:30] [INFO ] Invariant cache hit.
[2024-05-30 10:37:31] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
Running 116 sub problems to find dead transitions.
[2024-05-30 10:37:31] [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 3676 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 4804 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 8552ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 8556ms
Finished structural reductions in LTL mode , in 1 iterations and 8738 ms. Remains : 79/79 places, 118/118 transitions.
Stuttering acceptance computed with spot in 248 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N02-LTLFireability-10
Product exploration explored 100000 steps with 29375 reset in 575 ms.
Product exploration explored 100000 steps with 29342 reset in 368 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) p1 p2))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 9 factoid took 391 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 9 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) p1 p2))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p0)]
Knowledge based reduction with 9 factoid took 472 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 142 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-30 10:37:42] [INFO ] Invariant cache hit.
[2024-05-30 10:37:42] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2024-05-30 10:37:42] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2024-05-30 10:37:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 10:37:42] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2024-05-30 10:37:42] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2024-05-30 10:37:42] [INFO ] Computed and/alt/rep : 116/178/116 causal constraints (skipped 0 transitions) in 16 ms.
[2024-05-30 10:37:43] [INFO ] Added : 59 causal constraints over 12 iterations in 261 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 13 out of 79 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 118/118 transitions.
Applied a total of 0 rules in 1 ms. Remains 79 /79 variables (removed 0) and now considering 118/118 (removed 0) transitions.
[2024-05-30 10:37:43] [INFO ] Invariant cache hit.
[2024-05-30 10:37:43] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-30 10:37:43] [INFO ] Invariant cache hit.
[2024-05-30 10:37:43] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
Running 116 sub problems to find dead transitions.
[2024-05-30 10:37:43] [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 3695 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 4215 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 7984ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 7988ms
Finished structural reductions in LTL mode , in 1 iterations and 8191 ms. Remains : 79/79 places, 118/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 : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 170 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 145 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 9 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 192 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 148 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-30 10:37:52] [INFO ] Invariant cache hit.
[2024-05-30 10:37:52] [INFO ] [Real]Absence check using 6 positive place invariants in 8 ms returned sat
[2024-05-30 10:37:52] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2024-05-30 10:37:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 10:37:52] [INFO ] [Nat]Absence check using 6 positive place invariants in 7 ms returned sat
[2024-05-30 10:37:52] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2024-05-30 10:37:52] [INFO ] Computed and/alt/rep : 116/178/116 causal constraints (skipped 0 transitions) in 15 ms.
[2024-05-30 10:37:53] [INFO ] Added : 59 causal constraints over 12 iterations in 218 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 29393 reset in 257 ms.
Product exploration explored 100000 steps with 29321 reset in 277 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (NOT 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: 0
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 79 transition count 118
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 40 place count 79 transition count 110
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 40 place count 79 transition count 118
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 2 with 8 rules applied. Total rules applied 48 place count 79 transition count 118
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 72 place count 55 transition count 94
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 2 with 24 rules applied. Total rules applied 96 place count 55 transition count 94
Deduced a syphon composed of 16 places in 0 ms
Applied a total of 96 rules in 26 ms. Remains 55 /79 variables (removed 24) and now considering 94/118 (removed 24) transitions.
[2024-05-30 10:37:54] [INFO ] Redundant transitions in 2 ms returned []
Running 92 sub problems to find dead transitions.
// Phase 1: matrix 94 rows 55 cols
[2024-05-30 10:37:54] [INFO ] Computed 6 invariants in 1 ms
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
[2024-05-30 10:37:54] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 3 ms to minimize.
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
[2024-05-30 10:37:54] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 2 ms to minimize.
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 2/8 constraints. Problems are: Problem set: 24 solved, 68 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/8 constraints. Problems are: Problem set: 24 solved, 68 unsolved
At refinement iteration 5 (OVERLAPS) 94/149 variables, 55/63 constraints. Problems are: Problem set: 24 solved, 68 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 0/63 constraints. Problems are: Problem set: 24 solved, 68 unsolved
At refinement iteration 7 (OVERLAPS) 0/149 variables, 0/63 constraints. Problems are: Problem set: 24 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Real declared 149/149 variables, and 63 constraints, problems are : Problem set: 24 solved, 68 unsolved in 2240 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 24 solved, 68 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 68 unsolved
At refinement iteration 1 (OVERLAPS) 18/55 variables, 6/6 constraints. Problems are: Problem set: 24 solved, 68 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 2/8 constraints. Problems are: Problem set: 24 solved, 68 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/8 constraints. Problems are: Problem set: 24 solved, 68 unsolved
At refinement iteration 4 (OVERLAPS) 94/149 variables, 55/63 constraints. Problems are: Problem set: 24 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 68/131 constraints. Problems are: Problem set: 24 solved, 68 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 0/131 constraints. Problems are: Problem set: 24 solved, 68 unsolved
At refinement iteration 7 (OVERLAPS) 0/149 variables, 0/131 constraints. Problems are: Problem set: 24 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Int declared 149/149 variables, and 131 constraints, problems are : Problem set: 24 solved, 68 unsolved in 2164 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 68/92 constraints, Known Traps: 2/2 constraints]
After SMT, in 4441ms problems are : Problem set: 24 solved, 68 unsolved
Search for dead transitions found 24 dead transitions in 4442ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 55/79 places, 70/118 transitions.
Graph (complete) has 106 edges and 55 vertex of which 39 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 39 /55 variables (removed 16) and now considering 70/70 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 39/79 places, 70/118 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4482 ms. Remains : 39/79 places, 70/118 transitions.
Support contains 13 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 4 ms. Remains 55 /79 variables (removed 24) and now considering 94/118 (removed 24) transitions.
// Phase 1: matrix 94 rows 55 cols
[2024-05-30 10:37:58] [INFO ] Computed 6 invariants in 1 ms
[2024-05-30 10:37:58] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-30 10:37:58] [INFO ] Invariant cache hit.
[2024-05-30 10:37:58] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
Running 92 sub problems to find dead transitions.
[2024-05-30 10:37:58] [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 2631 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 3273 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 6002ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 6004ms
Starting structural reductions in LTL mode, iteration 1 : 55/79 places, 94/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6210 ms. Remains : 55/79 places, 94/118 transitions.
Treatment of property UtilityControlRoom-COL-Z4T4N02-LTLFireability-10 finished in 33882 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(G(!p0)) U (p1&&X(G(!p0))))))'
Support contains 13 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.
[2024-05-30 10:38:04] [INFO ] Invariant cache hit.
[2024-05-30 10:38:04] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-30 10:38:04] [INFO ] Invariant cache hit.
[2024-05-30 10:38:04] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
Running 92 sub problems to find dead transitions.
[2024-05-30 10:38:04] [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 2712 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 2506 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 5288ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 5291ms
Starting structural reductions in LTL mode, iteration 1 : 55/79 places, 94/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5449 ms. Remains : 55/79 places, 94/118 transitions.
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), p0, true]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N02-LTLFireability-12
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z4T4N02-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N02-LTLFireability-12 finished in 5642 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(F(!p0)) U G(p1))))'
Support contains 10 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-05-30 10:38:10] [INFO ] Invariant cache hit.
[2024-05-30 10:38:10] [INFO ] Implicit Places using invariants in 119 ms returned [40]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 122 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 130 ms. Remains : 54/79 places, 94/118 transitions.
Stuttering acceptance computed with spot in 193 ms :[(NOT p1), (NOT p1), p0, (AND p0 p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N02-LTLFireability-14
Product exploration explored 100000 steps with 9084 reset in 359 ms.
Stack based approach found an accepted trace after 12215 steps with 1106 reset with depth 8 and stack size 8 in 43 ms.
FORMULA UtilityControlRoom-COL-Z4T4N02-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N02-LTLFireability-14 finished in 752 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(G((F(p1)||p0)))))'
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 4 ms. Remains 55 /79 variables (removed 24) and now considering 94/118 (removed 24) transitions.
[2024-05-30 10:38:11] [INFO ] Invariant cache hit.
[2024-05-30 10:38:11] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-30 10:38:11] [INFO ] Invariant cache hit.
[2024-05-30 10:38:11] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
Running 92 sub problems to find dead transitions.
[2024-05-30 10:38:11] [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 1692 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 3220 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 4979ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 4981ms
Starting structural reductions in LTL mode, iteration 1 : 55/79 places, 94/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5137 ms. Remains : 55/79 places, 94/118 transitions.
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N02-LTLFireability-15
Product exploration explored 100000 steps with 7242 reset in 276 ms.
Product exploration explored 100000 steps with 7247 reset in 301 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 (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 240 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 211 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 52 steps (0 resets) in 10 ms. (4 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 2 factoid took 342 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 265 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 272 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
[2024-05-30 10:38:18] [INFO ] Invariant cache hit.
[2024-05-30 10:38:18] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-05-30 10:38:18] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2024-05-30 10:38:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 10:38:18] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-05-30 10:38:18] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2024-05-30 10:38:18] [INFO ] Computed and/alt/rep : 92/154/92 causal constraints (skipped 0 transitions) in 14 ms.
[2024-05-30 10:38:19] [INFO ] Added : 92 causal constraints over 19 iterations in 285 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 15 out of 55 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 94/94 transitions.
Applied a total of 0 rules in 2 ms. Remains 55 /55 variables (removed 0) and now considering 94/94 (removed 0) transitions.
[2024-05-30 10:38:19] [INFO ] Invariant cache hit.
[2024-05-30 10:38:19] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-30 10:38:19] [INFO ] Invariant cache hit.
[2024-05-30 10:38:19] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
Running 92 sub problems to find dead transitions.
[2024-05-30 10:38:19] [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 2612 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 3304 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 5986ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 5988ms
Finished structural reductions in LTL mode , in 1 iterations and 6154 ms. Remains : 55/55 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 : [(AND (NOT p0) (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 235 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 54 steps (0 resets) in 12 ms. (4 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 2 factoid took 322 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
[2024-05-30 10:38:26] [INFO ] Invariant cache hit.
[2024-05-30 10:38:26] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2024-05-30 10:38:26] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2024-05-30 10:38:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 10:38:27] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2024-05-30 10:38:27] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2024-05-30 10:38:27] [INFO ] Computed and/alt/rep : 92/154/92 causal constraints (skipped 0 transitions) in 12 ms.
[2024-05-30 10:38:27] [INFO ] Added : 92 causal constraints over 19 iterations in 305 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 7245 reset in 276 ms.
Product exploration explored 100000 steps with 7266 reset in 300 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 15 out of 55 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 55/55 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 55 transition count 102
Deduced a syphon composed of 8 places in 3 ms
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 55 transition count 102
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 16 places in 1 ms
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 55 transition count 102
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 24 place count 55 transition count 94
Deduced a syphon composed of 16 places in 0 ms
Applied a total of 24 rules in 14 ms. Remains 55 /55 variables (removed 0) and now considering 94/94 (removed 0) transitions.
[2024-05-30 10:38:28] [INFO ] Redundant transitions in 3 ms returned []
Running 92 sub problems to find dead transitions.
// Phase 1: matrix 94 rows 55 cols
[2024-05-30 10:38:28] [INFO ] Computed 6 invariants in 1 ms
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
[2024-05-30 10:38:29] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 1/7 constraints. Problems are: Problem set: 12 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/7 constraints. Problems are: Problem set: 12 solved, 80 unsolved
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
At refinement iteration 5 (OVERLAPS) 94/149 variables, 55/62 constraints. Problems are: Problem set: 24 solved, 68 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 0/62 constraints. Problems are: Problem set: 24 solved, 68 unsolved
At refinement iteration 7 (OVERLAPS) 0/149 variables, 0/62 constraints. Problems are: Problem set: 24 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Real declared 149/149 variables, and 62 constraints, problems are : Problem set: 24 solved, 68 unsolved in 2570 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 24 solved, 68 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 68 unsolved
At refinement iteration 1 (OVERLAPS) 18/55 variables, 6/6 constraints. Problems are: Problem set: 24 solved, 68 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 1/7 constraints. Problems are: Problem set: 24 solved, 68 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/7 constraints. Problems are: Problem set: 24 solved, 68 unsolved
At refinement iteration 4 (OVERLAPS) 94/149 variables, 55/62 constraints. Problems are: Problem set: 24 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 68/130 constraints. Problems are: Problem set: 24 solved, 68 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 0/130 constraints. Problems are: Problem set: 24 solved, 68 unsolved
At refinement iteration 7 (OVERLAPS) 0/149 variables, 0/130 constraints. Problems are: Problem set: 24 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Int declared 149/149 variables, and 130 constraints, problems are : Problem set: 24 solved, 68 unsolved in 2205 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 68/92 constraints, Known Traps: 1/1 constraints]
After SMT, in 4829ms problems are : Problem set: 24 solved, 68 unsolved
Search for dead transitions found 24 dead transitions in 4831ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 55/55 places, 70/94 transitions.
Graph (complete) has 106 edges and 55 vertex of which 39 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.0 ms
Discarding 16 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 39 /55 variables (removed 16) and now considering 70/70 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 39/55 places, 70/94 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4859 ms. Remains : 39/55 places, 70/94 transitions.
Support contains 15 out of 55 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 94/94 transitions.
Applied a total of 0 rules in 1 ms. Remains 55 /55 variables (removed 0) and now considering 94/94 (removed 0) transitions.
// Phase 1: matrix 94 rows 55 cols
[2024-05-30 10:38:33] [INFO ] Computed 6 invariants in 1 ms
[2024-05-30 10:38:33] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-30 10:38:33] [INFO ] Invariant cache hit.
[2024-05-30 10:38:33] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
Running 92 sub problems to find dead transitions.
[2024-05-30 10:38:33] [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 2559 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 3177 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 5807ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 5810ms
Finished structural reductions in LTL mode , in 1 iterations and 5965 ms. Remains : 55/55 places, 94/94 transitions.
Treatment of property UtilityControlRoom-COL-Z4T4N02-LTLFireability-15 finished in 28322 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-COL-Z4T4N02-LTLFireability-00
Stuttering acceptance computed with spot in 197 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 5 ms. Remains 77 /79 variables (removed 2) and now considering 116/118 (removed 2) transitions.
// Phase 1: matrix 116 rows 77 cols
[2024-05-30 10:38:39] [INFO ] Computed 6 invariants in 2 ms
[2024-05-30 10:38:39] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-30 10:38:39] [INFO ] Invariant cache hit.
[2024-05-30 10:38:40] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
Running 106 sub problems to find dead transitions.
[2024-05-30 10:38:40] [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 3557 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 4059 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 7698ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 7700ms
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 7894 ms. Remains : 77/79 places, 116/118 transitions.
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N02-LTLFireability-00
Product exploration explored 100000 steps with 7894 reset in 738 ms.
Product exploration explored 100000 steps with 7924 reset in 607 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 (NOT (AND (NOT p0) p1 (NOT p2)))), (X p0), (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 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 516 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 135 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p2) p0 (NOT p1))]
RANDOM walk for 60 steps (0 resets) in 12 ms. (4 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X p0), (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 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT (OR p2 p0 p1))), (F (NOT (OR p2 p0 (NOT p1)))), (F (NOT p1)), (F p2), (F (NOT (OR p2 (NOT p0) p1))), (F (NOT (AND (NOT p2) p0 p1)))]
Knowledge based reduction with 6 factoid took 961 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 154 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p2) p0 (NOT p1))]
Stuttering acceptance computed with spot in 159 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 4 ms. Remains 77 /77 variables (removed 0) and now considering 116/116 (removed 0) transitions.
[2024-05-30 10:38:51] [INFO ] Invariant cache hit.
[2024-05-30 10:38:51] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-30 10:38:51] [INFO ] Invariant cache hit.
[2024-05-30 10:38:51] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
[2024-05-30 10:38:51] [INFO ] Redundant transitions in 5 ms returned []
Running 106 sub problems to find dead transitions.
[2024-05-30 10:38:51] [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 3353 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 2530 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 5946ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 5949ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 6169 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 (NOT p2)), (X p2), (X (AND (NOT p2) p0 p1)), (X (NOT (AND (NOT p2) p0 p1))), (X (X (NOT p2))), (X (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 p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 449 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 118 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p2) p0 (NOT p1))]
RANDOM walk for 44 steps (0 resets) in 7 ms. (5 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 (NOT p2)), (X p2), (X (AND (NOT p2) p0 p1)), (X (NOT (AND (NOT p2) p0 p1))), (X (X (NOT p2))), (X (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 p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT (OR p2 p0 p1))), (F (NOT (OR p2 p0 (NOT p1)))), (F (NOT p1)), (F p2), (F (NOT (OR p2 (NOT p0) p1))), (F (NOT (AND (NOT p2) p0 p1)))]
Knowledge based reduction with 4 factoid took 571 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 104 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p2) p0 (NOT p1))]
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p2) p0 (NOT p1))]
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p2) p0 (NOT p1))]
Product exploration explored 100000 steps with 7862 reset in 596 ms.
Product exploration explored 100000 steps with 7913 reset in 602 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-05-30 10:38:59] [INFO ] Invariant cache hit.
[2024-05-30 10:39:00] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-30 10:39:00] [INFO ] Invariant cache hit.
[2024-05-30 10:39:00] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
[2024-05-30 10:39:00] [INFO ] Redundant transitions in 1 ms returned []
Running 106 sub problems to find dead transitions.
[2024-05-30 10:39:00] [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 3480 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 4085 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 7605ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 7607ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7747 ms. Remains : 77/77 places, 116/116 transitions.
Treatment of property UtilityControlRoom-COL-Z4T4N02-LTLFireability-00 finished in 28219 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-COL-Z4T4N02-LTLFireability-05
Stuttering acceptance computed with spot in 143 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 10 ms. Remains 14 /79 variables (removed 65) and now considering 12/118 (removed 106) transitions.
// Phase 1: matrix 12 rows 14 cols
[2024-05-30 10:39:08] [INFO ] Computed 6 invariants in 0 ms
[2024-05-30 10:39:08] [INFO ] Implicit Places using invariants in 39 ms returned [0, 7]
[2024-05-30 10:39:08] [INFO ] Actually due to overlaps returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 41 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 52 ms. Remains : 13/79 places, 12/118 transitions.
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N02-LTLFireability-05
Product exploration explored 100000 steps with 20769 reset in 355 ms.
Product exploration explored 100000 steps with 20720 reset in 473 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 133 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 118 ms :[p0, p0, p0]
RANDOM walk for 17 steps (0 resets) in 5 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 124 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 107 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 141 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-05-30 10:39:09] [INFO ] Computed 5 invariants in 0 ms
[2024-05-30 10:39:09] [INFO ] Implicit Places using invariants in 43 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 44 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 0 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 45 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 159 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 143 ms :[p0, p0, p0]
RANDOM walk for 20 steps (0 resets) in 4 ms. (4 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 328 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 148 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 144 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 140 ms :[p0, p0, p0]
Product exploration explored 100000 steps with 20616 reset in 104 ms.
Product exploration explored 100000 steps with 20705 reset in 120 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 146 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 2 ms. Remains 12 /12 variables (removed 0) and now considering 14/12 (removed -2) transitions.
[2024-05-30 10:39:11] [INFO ] Redundant transitions in 0 ms returned []
Running 12 sub problems to find dead transitions.
// Phase 1: matrix 14 rows 12 cols
[2024-05-30 10:39:11] [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-05-30 10:39:11] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
[2024-05-30 10:39:11] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 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 243 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 133 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 382ms problems are : Problem set: 4 solved, 8 unsolved
Search for dead transitions found 4 dead transitions in 382ms
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 395 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-05-30 10:39:11] [INFO ] Computed 4 invariants in 0 ms
[2024-05-30 10:39:11] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-30 10:39:11] [INFO ] Invariant cache hit.
[2024-05-30 10:39:11] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
Running 10 sub problems to find dead transitions.
[2024-05-30 10:39:11] [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 144 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 171 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 320ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 322ms
Finished structural reductions in LTL mode , in 1 iterations and 393 ms. Remains : 12/12 places, 12/12 transitions.
Treatment of property UtilityControlRoom-COL-Z4T4N02-LTLFireability-05 finished in 4344 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||(F(p1)&&X(G(p2))))))'
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(G((F(p1)||p0)))))'
Found a Lengthening insensitive property : UtilityControlRoom-COL-Z4T4N02-LTLFireability-15
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 15 out of 79 places. Attempting structural reductions.
Starting structural reductions in LI_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 0 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 15 ms. Remains 37 /79 variables (removed 42) and now considering 68/118 (removed 50) transitions.
// Phase 1: matrix 68 rows 37 cols
[2024-05-30 10:39:12] [INFO ] Computed 6 invariants in 1 ms
[2024-05-30 10:39:12] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-30 10:39:12] [INFO ] Invariant cache hit.
[2024-05-30 10:39:12] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
Running 58 sub problems to find dead transitions.
[2024-05-30 10:39:12] [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 1160 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 1664 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 2867ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 2870ms
Starting structural reductions in LI_LTL mode, iteration 1 : 37/79 places, 68/118 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 3016 ms. Remains : 37/79 places, 68/118 transitions.
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N02-LTLFireability-15
Product exploration explored 100000 steps with 9776 reset in 336 ms.
Product exploration explored 100000 steps with 9720 reset in 363 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 (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 205 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 32 steps (0 resets) in 6 ms. (4 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 2 factoid took 258 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
[2024-05-30 10:39:17] [INFO ] Invariant cache hit.
[2024-05-30 10:39:17] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-05-30 10:39:17] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2024-05-30 10:39:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 10:39:17] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-05-30 10:39:17] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2024-05-30 10:39:17] [INFO ] Computed and/alt/rep : 58/128/58 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-30 10:39:18] [INFO ] Added : 55 causal constraints over 12 iterations in 149 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 15 out of 37 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 68/68 transitions.
Applied a total of 0 rules in 1 ms. Remains 37 /37 variables (removed 0) and now considering 68/68 (removed 0) transitions.
[2024-05-30 10:39:18] [INFO ] Invariant cache hit.
[2024-05-30 10:39:18] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-30 10:39:18] [INFO ] Invariant cache hit.
[2024-05-30 10:39:18] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
Running 58 sub problems to find dead transitions.
[2024-05-30 10:39:18] [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 1447 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 1681 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 3172ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 3173ms
Finished structural reductions in LTL mode , in 1 iterations and 3307 ms. Remains : 37/37 places, 68/68 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 231 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 30 steps (0 resets) in 4 ms. (6 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 2 factoid took 318 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
[2024-05-30 10:39:22] [INFO ] Invariant cache hit.
[2024-05-30 10:39:22] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2024-05-30 10:39:22] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2024-05-30 10:39:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 10:39:22] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2024-05-30 10:39:22] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2024-05-30 10:39:22] [INFO ] Computed and/alt/rep : 58/128/58 causal constraints (skipped 0 transitions) in 10 ms.
[2024-05-30 10:39:23] [INFO ] Added : 55 causal constraints over 12 iterations in 148 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 9777 reset in 347 ms.
Product exploration explored 100000 steps with 9690 reset in 333 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 15 out of 37 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 37/37 places, 68/68 transitions.
Applied a total of 0 rules in 1 ms. Remains 37 /37 variables (removed 0) and now considering 68/68 (removed 0) transitions.
[2024-05-30 10:39:24] [INFO ] Redundant transitions in 0 ms returned []
Running 58 sub problems to find dead transitions.
[2024-05-30 10:39:24] [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 1325 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 1719 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 3074ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 3075ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3081 ms. Remains : 37/37 places, 68/68 transitions.
Support contains 15 out of 37 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 68/68 transitions.
Applied a total of 0 rules in 1 ms. Remains 37 /37 variables (removed 0) and now considering 68/68 (removed 0) transitions.
[2024-05-30 10:39:27] [INFO ] Invariant cache hit.
[2024-05-30 10:39:27] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-30 10:39:27] [INFO ] Invariant cache hit.
[2024-05-30 10:39:27] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
Running 58 sub problems to find dead transitions.
[2024-05-30 10:39:27] [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 1395 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 1714 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 3166ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 3167ms
Finished structural reductions in LTL mode , in 1 iterations and 3301 ms. Remains : 37/37 places, 68/68 transitions.
Treatment of property UtilityControlRoom-COL-Z4T4N02-LTLFireability-15 finished in 18352 ms.
[2024-05-30 10:39:30] [INFO ] Flatten gal took : 21 ms
[2024-05-30 10:39:30] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 12 ms.
[2024-05-30 10:39:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 79 places, 118 transitions and 344 arcs took 9 ms.
Total runtime 189124 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running UtilityControlRoom-COL-Z4T4N02

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/411/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 79
TRANSITIONS: 118
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.001s, Sys 0.004s]


SAVING FILE /home/mcc/execution/411/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 2617
MODEL NAME: /home/mcc/execution/411/model
79 places, 118 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA UtilityControlRoom-COL-Z4T4N02-LTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA UtilityControlRoom-COL-Z4T4N02-LTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA UtilityControlRoom-COL-Z4T4N02-LTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA UtilityControlRoom-COL-Z4T4N02-LTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717065575903

--------------------
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

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-COL-Z4T4N02"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is UtilityControlRoom-COL-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 r443-smll-171701109800108"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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