Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r544-smll-171701110700100.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is UtilityControlRoom-COL-Z4T3N10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r544-smll-171701110700100
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 412K
-rw-r--r-- 1 mcc users 8.0K Apr 13 05:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Apr 13 05:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 13 05:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 13 05:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 08:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 23 08:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K 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 11K Apr 13 05:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Apr 13 05:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 13 05:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 13 05:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 08:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K 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-Z4T3N10-LTLFireability-00
FORMULA_NAME UtilityControlRoom-COL-Z4T3N10-LTLFireability-01
FORMULA_NAME UtilityControlRoom-COL-Z4T3N10-LTLFireability-02
FORMULA_NAME UtilityControlRoom-COL-Z4T3N10-LTLFireability-03
FORMULA_NAME UtilityControlRoom-COL-Z4T3N10-LTLFireability-04
FORMULA_NAME UtilityControlRoom-COL-Z4T3N10-LTLFireability-05
FORMULA_NAME UtilityControlRoom-COL-Z4T3N10-LTLFireability-06
FORMULA_NAME UtilityControlRoom-COL-Z4T3N10-LTLFireability-07
FORMULA_NAME UtilityControlRoom-COL-Z4T3N10-LTLFireability-08
FORMULA_NAME UtilityControlRoom-COL-Z4T3N10-LTLFireability-09
FORMULA_NAME UtilityControlRoom-COL-Z4T3N10-LTLFireability-10
FORMULA_NAME UtilityControlRoom-COL-Z4T3N10-LTLFireability-11
FORMULA_NAME UtilityControlRoom-COL-Z4T3N10-LTLFireability-12
FORMULA_NAME UtilityControlRoom-COL-Z4T3N10-LTLFireability-13
FORMULA_NAME UtilityControlRoom-COL-Z4T3N10-LTLFireability-14
FORMULA_NAME UtilityControlRoom-COL-Z4T3N10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717262421060

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=UtilityControlRoom-COL-Z4T3N10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 17:20:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 17:20:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 17:20:23] [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-06-01 17:20:23] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 17:20:24] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1232 ms
[2024-06-01 17:20:24] [INFO ] Imported 13 HL places and 12 HL transitions for a total of 376 PT places and 750.0 transition bindings in 27 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
[2024-06-01 17:20:24] [INFO ] Built PT skeleton of HLPN with 13 places and 12 transitions 37 arcs in 7 ms.
[2024-06-01 17:20:24] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Initial state reduction rules removed 2 formulas.
FORMULA UtilityControlRoom-COL-Z4T3N10-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z4T3N10-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 10 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 12 to 8
RANDOM walk for 3883 steps (0 resets) in 132 ms. (29 steps per ms) remains 0/8 properties
[2024-06-01 17:20:24] [INFO ] Flatten gal took : 23 ms
[2024-06-01 17:20:24] [INFO ] Flatten gal took : 6 ms
Transition timeout forces synchronizations/join behavior on parameter c of sort Cli
Domain [Cli(10), Z(4), Z(4)] of place MovetoZ breaks symmetries in sort Z
[2024-06-01 17:20:24] [INFO ] Unfolded HLPN to a Petri net with 376 places and 750 transitions 2410 arcs in 52 ms.
[2024-06-01 17:20:24] [INFO ] Unfolded 14 HLPN properties in 1 ms.
[2024-06-01 17:20:24] [INFO ] Reduced 30 identical enabling conditions.
[2024-06-01 17:20:24] [INFO ] Reduced 30 identical enabling conditions.
[2024-06-01 17:20:24] [INFO ] Reduced 30 identical enabling conditions.
[2024-06-01 17:20:24] [INFO ] Reduced 30 identical enabling conditions.
[2024-06-01 17:20:24] [INFO ] Reduced 30 identical enabling conditions.
[2024-06-01 17:20:24] [INFO ] Reduced 30 identical enabling conditions.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
Support contains 335 out of 376 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 376/376 places, 590/590 transitions.
Applied a total of 0 rules in 20 ms. Remains 376 /376 variables (removed 0) and now considering 590/590 (removed 0) transitions.
// Phase 1: matrix 590 rows 376 cols
[2024-06-01 17:20:25] [INFO ] Computed 23 invariants in 47 ms
[2024-06-01 17:20:25] [INFO ] Implicit Places using invariants in 512 ms returned [305]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 566 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 375/376 places, 590/590 transitions.
Applied a total of 0 rules in 9 ms. Remains 375 /375 variables (removed 0) and now considering 590/590 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 615 ms. Remains : 375/376 places, 590/590 transitions.
Support contains 335 out of 375 places after structural reductions.
[2024-06-01 17:20:26] [INFO ] Flatten gal took : 105 ms
[2024-06-01 17:20:26] [INFO ] Flatten gal took : 138 ms
[2024-06-01 17:20:26] [INFO ] Input system was already deterministic with 590 transitions.
Reduction of identical properties reduced properties to check from 15 to 12
RANDOM walk for 725 steps (0 resets) in 158 ms. (4 steps per ms) remains 0/12 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(X(F(((G(p0) U !p1)||G(!p0)))))||F(p2)))'
Support contains 95 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 255 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 255 transition count 470
Applied a total of 240 rules in 41 ms. Remains 255 /375 variables (removed 120) and now considering 470/590 (removed 120) transitions.
// Phase 1: matrix 470 rows 255 cols
[2024-06-01 17:20:27] [INFO ] Computed 22 invariants in 9 ms
[2024-06-01 17:20:27] [INFO ] Implicit Places using invariants in 189 ms returned []
[2024-06-01 17:20:27] [INFO ] Invariant cache hit.
[2024-06-01 17:20:28] [INFO ] Implicit Places using invariants and state equation in 409 ms returned []
Implicit Place search using SMT with State Equation took 601 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2024-06-01 17:20:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (OVERLAPS) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
No progress, stopping.
After SMT solving in domain Real declared 725/725 variables, and 277 constraints, problems are : Problem set: 0 solved, 460 unsolved in 29895 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 460/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/725 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 725/725 variables, and 737 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
After SMT, in 61506ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 61537ms
Starting structural reductions in LTL mode, iteration 1 : 255/375 places, 470/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62186 ms. Remains : 255/375 places, 470/590 transitions.
Stuttering acceptance computed with spot in 337 ms :[(AND (NOT p2) p1 p0), (AND (NOT p2) p1 p0), (AND (NOT p2) p1 p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N10-LTLFireability-00
Product exploration explored 100000 steps with 11103 reset in 1767 ms.
Product exploration explored 100000 steps with 11272 reset in 1659 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 p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1 p0))))]
False Knowledge obtained : [(X (X (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 276 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1)]
RANDOM walk for 43 steps (0 resets) in 6 ms. (6 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1 p0))))]
False Knowledge obtained : [(X (X (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p1), (F p0), (F p2), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT (OR (NOT p0) p2 (NOT p1))))]
Knowledge based reduction with 4 factoid took 404 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1)]
Stuttering acceptance computed with spot in 128 ms :[(AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1)]
Support contains 95 out of 255 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 470/470 transitions.
Applied a total of 0 rules in 11 ms. Remains 255 /255 variables (removed 0) and now considering 470/470 (removed 0) transitions.
[2024-06-01 17:21:34] [INFO ] Invariant cache hit.
[2024-06-01 17:21:34] [INFO ] Implicit Places using invariants in 170 ms returned []
[2024-06-01 17:21:34] [INFO ] Invariant cache hit.
[2024-06-01 17:21:35] [INFO ] Implicit Places using invariants and state equation in 351 ms returned []
Implicit Place search using SMT with State Equation took 524 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2024-06-01 17:21:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (OVERLAPS) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
No progress, stopping.
After SMT solving in domain Real declared 725/725 variables, and 277 constraints, problems are : Problem set: 0 solved, 460 unsolved in 29621 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 460/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/725 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 725/725 variables, and 737 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
After SMT, in 60816ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 60825ms
Finished structural reductions in LTL mode , in 1 iterations and 61362 ms. Remains : 255/255 places, 470/470 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2) p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 343 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1)]
RANDOM walk for 78 steps (0 resets) in 8 ms. (8 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2) p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p1), (F p0), (F p2), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT (OR (NOT p0) p2 (NOT p1))))]
Knowledge based reduction with 3 factoid took 396 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1)]
Stuttering acceptance computed with spot in 131 ms :[(AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1)]
Stuttering acceptance computed with spot in 127 ms :[(AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1)]
Product exploration explored 100000 steps with 10945 reset in 1522 ms.
Product exploration explored 100000 steps with 11224 reset in 1517 ms.
Applying partial POR strategy [false, false, true]
Stuttering acceptance computed with spot in 134 ms :[(AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1)]
Support contains 95 out of 255 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 255/255 places, 470/470 transitions.
Applied a total of 0 rules in 28 ms. Remains 255 /255 variables (removed 0) and now considering 470/470 (removed 0) transitions.
[2024-06-01 17:22:40] [INFO ] Redundant transitions in 37 ms returned []
Running 460 sub problems to find dead transitions.
[2024-06-01 17:22:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (OVERLAPS) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
No progress, stopping.
After SMT solving in domain Real declared 725/725 variables, and 277 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 460/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/725 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 725/725 variables, and 737 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
After SMT, in 61048ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 61055ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61129 ms. Remains : 255/255 places, 470/470 transitions.
Support contains 95 out of 255 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 470/470 transitions.
Applied a total of 0 rules in 6 ms. Remains 255 /255 variables (removed 0) and now considering 470/470 (removed 0) transitions.
[2024-06-01 17:23:41] [INFO ] Invariant cache hit.
[2024-06-01 17:23:42] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-06-01 17:23:42] [INFO ] Invariant cache hit.
[2024-06-01 17:23:42] [INFO ] Implicit Places using invariants and state equation in 345 ms returned []
Implicit Place search using SMT with State Equation took 469 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2024-06-01 17:23:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (OVERLAPS) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
No progress, stopping.
After SMT solving in domain Real declared 725/725 variables, and 277 constraints, problems are : Problem set: 0 solved, 460 unsolved in 29683 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 460/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/725 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 725/725 variables, and 737 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
After SMT, in 60773ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 60782ms
Finished structural reductions in LTL mode , in 1 iterations and 61263 ms. Remains : 255/255 places, 470/470 transitions.
Treatment of property UtilityControlRoom-COL-Z4T3N10-LTLFireability-00 finished in 256001 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))))'
Support contains 10 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 255 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 255 transition count 470
Applied a total of 240 rules in 25 ms. Remains 255 /375 variables (removed 120) and now considering 470/590 (removed 120) transitions.
[2024-06-01 17:24:43] [INFO ] Invariant cache hit.
[2024-06-01 17:24:43] [INFO ] Implicit Places using invariants in 194 ms returned []
[2024-06-01 17:24:43] [INFO ] Invariant cache hit.
[2024-06-01 17:24:44] [INFO ] Implicit Places using invariants and state equation in 395 ms returned []
Implicit Place search using SMT with State Equation took 598 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2024-06-01 17:24:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (OVERLAPS) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
No progress, stopping.
After SMT solving in domain Real declared 725/725 variables, and 277 constraints, problems are : Problem set: 0 solved, 460 unsolved in 29545 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 460/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/725 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 725/725 variables, and 737 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
After SMT, in 60550ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 60557ms
Starting structural reductions in LTL mode, iteration 1 : 255/375 places, 470/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61183 ms. Remains : 255/375 places, 470/590 transitions.
Stuttering acceptance computed with spot in 144 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N10-LTLFireability-01
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA UtilityControlRoom-COL-Z4T3N10-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T3N10-LTLFireability-01 finished in 61362 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||(p1&&X(X(X(X(F(p0)))))))))'
Support contains 210 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Applied a total of 0 rules in 6 ms. Remains 375 /375 variables (removed 0) and now considering 590/590 (removed 0) transitions.
// Phase 1: matrix 590 rows 375 cols
[2024-06-01 17:25:44] [INFO ] Computed 22 invariants in 12 ms
[2024-06-01 17:25:44] [INFO ] Implicit Places using invariants in 196 ms returned []
[2024-06-01 17:25:45] [INFO ] Invariant cache hit.
[2024-06-01 17:25:45] [INFO ] Implicit Places using invariants and state equation in 472 ms returned []
Implicit Place search using SMT with State Equation took 675 ms to find 0 implicit places.
Running 580 sub problems to find dead transitions.
[2024-06-01 17:25:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 2 (OVERLAPS) 10/375 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/375 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 4 (OVERLAPS) 590/965 variables, 375/397 constraints. Problems are: Problem set: 0 solved, 580 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 965/965 variables, and 397 constraints, problems are : Problem set: 0 solved, 580 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 375/375 constraints, PredecessorRefiner: 580/580 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 580 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 2 (OVERLAPS) 10/375 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/375 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 4 (OVERLAPS) 590/965 variables, 375/397 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/965 variables, 580/977 constraints. Problems are: Problem set: 0 solved, 580 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 965/965 variables, and 977 constraints, problems are : Problem set: 0 solved, 580 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 375/375 constraints, PredecessorRefiner: 580/580 constraints, Known Traps: 0/0 constraints]
After SMT, in 60989ms problems are : Problem set: 0 solved, 580 unsolved
Search for dead transitions found 0 dead transitions in 60997ms
Finished structural reductions in LTL mode , in 1 iterations and 61681 ms. Remains : 375/375 places, 590/590 transitions.
Stuttering acceptance computed with spot in 245 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N10-LTLFireability-02
Product exploration explored 100000 steps with 20000 reset in 531 ms.
Product exploration explored 100000 steps with 20000 reset in 561 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 101 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 115 steps (0 resets) in 5 ms. (19 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 117 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 199 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 50 out of 375 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Applied a total of 0 rules in 7 ms. Remains 375 /375 variables (removed 0) and now considering 590/590 (removed 0) transitions.
[2024-06-01 17:26:48] [INFO ] Invariant cache hit.
[2024-06-01 17:26:48] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-06-01 17:26:48] [INFO ] Invariant cache hit.
[2024-06-01 17:26:49] [INFO ] Implicit Places using invariants and state equation in 462 ms returned []
Implicit Place search using SMT with State Equation took 643 ms to find 0 implicit places.
Running 580 sub problems to find dead transitions.
[2024-06-01 17:26:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 2 (OVERLAPS) 10/375 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/375 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 4 (OVERLAPS) 590/965 variables, 375/397 constraints. Problems are: Problem set: 0 solved, 580 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 965/965 variables, and 397 constraints, problems are : Problem set: 0 solved, 580 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 375/375 constraints, PredecessorRefiner: 580/580 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 580 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 2 (OVERLAPS) 10/375 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/375 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 4 (OVERLAPS) 590/965 variables, 375/397 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/965 variables, 580/977 constraints. Problems are: Problem set: 0 solved, 580 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 965/965 variables, and 977 constraints, problems are : Problem set: 0 solved, 580 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 375/375 constraints, PredecessorRefiner: 580/580 constraints, Known Traps: 0/0 constraints]
After SMT, in 60931ms problems are : Problem set: 0 solved, 580 unsolved
Search for dead transitions found 0 dead transitions in 60940ms
Finished structural reductions in LTL mode , in 1 iterations and 61592 ms. Remains : 375/375 places, 590/590 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 96 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 202 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 92 steps (0 resets) in 6 ms. (13 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 113 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 206 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 205 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 20000 reset in 301 ms.
Product exploration explored 100000 steps with 20000 reset in 338 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 202 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 50 out of 375 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Performed 160 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 160 rules applied. Total rules applied 160 place count 375 transition count 590
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 200 place count 375 transition count 550
Discarding 123 places :
Symmetric choice reduction at 2 with 123 rule applications. Total rules 323 place count 252 transition count 310
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 2 with 123 rules applied. Total rules applied 446 place count 252 transition count 310
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 476 place count 222 transition count 280
Deduced a syphon composed of 40 places in 1 ms
Iterating global reduction 2 with 30 rules applied. Total rules applied 506 place count 222 transition count 280
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 70 places in 0 ms
Iterating global reduction 2 with 30 rules applied. Total rules applied 536 place count 222 transition count 310
Deduced a syphon composed of 70 places in 0 ms
Applied a total of 536 rules in 90 ms. Remains 222 /375 variables (removed 153) and now considering 310/590 (removed 280) transitions.
[2024-06-01 17:27:52] [INFO ] Redundant transitions in 5 ms returned []
Running 270 sub problems to find dead transitions.
// Phase 1: matrix 310 rows 222 cols
[2024-06-01 17:27:52] [INFO ] Computed 22 invariants in 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-06-01 17:27:54] [INFO ] Deduced a trap composed of 81 places in 121 ms of which 24 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/212 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (OVERLAPS) 10/222 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-06-01 17:27:59] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 2 ms to minimize.
[2024-06-01 17:27:59] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
Problem TDEAD1 is UNSAT
[2024-06-01 17:27:59] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-06-01 17:27:59] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 2 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-06-01 17:27:59] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-06-01 17:27:59] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-06-01 17:27:59] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 2 ms to minimize.
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
[2024-06-01 17:27:59] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
Problem TDEAD8 is UNSAT
[2024-06-01 17:27:59] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 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 TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/222 variables, 9/32 constraints. Problems are: Problem set: 90 solved, 180 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/222 variables, 0/32 constraints. Problems are: Problem set: 90 solved, 180 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD220 is UNSAT
At refinement iteration 6 (OVERLAPS) 310/532 variables, 222/254 constraints. Problems are: Problem set: 100 solved, 170 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/532 variables, 0/254 constraints. Problems are: Problem set: 100 solved, 170 unsolved
At refinement iteration 8 (OVERLAPS) 0/532 variables, 0/254 constraints. Problems are: Problem set: 100 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Real declared 532/532 variables, and 254 constraints, problems are : Problem set: 100 solved, 170 unsolved in 14582 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 222/222 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 100 solved, 170 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 1/1 constraints. Problems are: Problem set: 100 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 0/1 constraints. Problems are: Problem set: 100 solved, 170 unsolved
At refinement iteration 2 (OVERLAPS) 80/222 variables, 22/23 constraints. Problems are: Problem set: 100 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 9/32 constraints. Problems are: Problem set: 100 solved, 170 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/222 variables, 0/32 constraints. Problems are: Problem set: 100 solved, 170 unsolved
At refinement iteration 5 (OVERLAPS) 310/532 variables, 222/254 constraints. Problems are: Problem set: 100 solved, 170 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/532 variables, 170/424 constraints. Problems are: Problem set: 100 solved, 170 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/532 variables, 0/424 constraints. Problems are: Problem set: 100 solved, 170 unsolved
At refinement iteration 8 (OVERLAPS) 0/532 variables, 0/424 constraints. Problems are: Problem set: 100 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Int declared 532/532 variables, and 424 constraints, problems are : Problem set: 100 solved, 170 unsolved in 11423 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 222/222 constraints, PredecessorRefiner: 170/270 constraints, Known Traps: 10/10 constraints]
After SMT, in 26220ms problems are : Problem set: 100 solved, 170 unsolved
Search for dead transitions found 100 dead transitions in 26226ms
Found 100 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 100 transitions
Dead transitions reduction (with SMT) removed 100 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 222/375 places, 210/590 transitions.
Graph (complete) has 400 edges and 222 vertex of which 152 are kept as prefixes of interest. Removing 70 places using SCC suffix rule.4 ms
Discarding 70 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 places
Applied a total of 1 rules in 23 ms. Remains 151 /222 variables (removed 71) and now considering 210/210 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 151/375 places, 210/590 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 26367 ms. Remains : 151/375 places, 210/590 transitions.
Support contains 50 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 255 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 255 transition count 470
Applied a total of 240 rules in 6 ms. Remains 255 /375 variables (removed 120) and now considering 470/590 (removed 120) transitions.
// Phase 1: matrix 470 rows 255 cols
[2024-06-01 17:28:18] [INFO ] Computed 22 invariants in 3 ms
[2024-06-01 17:28:18] [INFO ] Implicit Places using invariants in 158 ms returned []
[2024-06-01 17:28:18] [INFO ] Invariant cache hit.
[2024-06-01 17:28:19] [INFO ] Implicit Places using invariants and state equation in 335 ms returned []
Implicit Place search using SMT with State Equation took 496 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2024-06-01 17:28:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (OVERLAPS) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
No progress, stopping.
After SMT solving in domain Real declared 725/725 variables, and 277 constraints, problems are : Problem set: 0 solved, 460 unsolved in 29802 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 460/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/725 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 725/725 variables, and 737 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
After SMT, in 60617ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 60623ms
Starting structural reductions in LTL mode, iteration 1 : 255/375 places, 470/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61126 ms. Remains : 255/375 places, 470/590 transitions.
Treatment of property UtilityControlRoom-COL-Z4T3N10-LTLFireability-02 finished in 215196 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)||G(!p0))))'
Support contains 10 out of 375 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 0 with 160 rules applied. Total rules applied 160 place count 375 transition count 430
Reduce places removed 160 places and 0 transitions.
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 360 place count 215 transition count 390
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 360 place count 215 transition count 350
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 440 place count 175 transition count 350
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 443 place count 172 transition count 230
Iterating global reduction 2 with 3 rules applied. Total rules applied 446 place count 172 transition count 230
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 476 place count 142 transition count 200
Iterating global reduction 2 with 30 rules applied. Total rules applied 506 place count 142 transition count 200
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 536 place count 112 transition count 140
Iterating global reduction 2 with 30 rules applied. Total rules applied 566 place count 112 transition count 140
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 596 place count 82 transition count 110
Iterating global reduction 2 with 30 rules applied. Total rules applied 626 place count 82 transition count 110
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 656 place count 82 transition count 80
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 656 place count 82 transition count 70
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 676 place count 72 transition count 70
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 696 place count 62 transition count 60
Applied a total of 696 rules in 47 ms. Remains 62 /375 variables (removed 313) and now considering 60/590 (removed 530) transitions.
// Phase 1: matrix 60 rows 62 cols
[2024-06-01 17:29:20] [INFO ] Computed 22 invariants in 1 ms
[2024-06-01 17:29:20] [INFO ] Implicit Places using invariants in 67 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 70 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/375 places, 60/590 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 120 ms. Remains : 61/375 places, 60/590 transitions.
Stuttering acceptance computed with spot in 43 ms :[false]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N10-LTLFireability-04
Product exploration explored 100000 steps with 0 reset in 241 ms.
Stack based approach found an accepted trace after 1106 steps with 0 reset with depth 1107 and stack size 1107 in 5 ms.
FORMULA UtilityControlRoom-COL-Z4T3N10-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T3N10-LTLFireability-04 finished in 427 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(X(G((X(p0) U !p1)))) U G(p2))))'
Support contains 215 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Applied a total of 0 rules in 5 ms. Remains 375 /375 variables (removed 0) and now considering 590/590 (removed 0) transitions.
// Phase 1: matrix 590 rows 375 cols
[2024-06-01 17:29:20] [INFO ] Computed 22 invariants in 6 ms
[2024-06-01 17:29:20] [INFO ] Implicit Places using invariants in 176 ms returned []
[2024-06-01 17:29:20] [INFO ] Invariant cache hit.
[2024-06-01 17:29:21] [INFO ] Implicit Places using invariants and state equation in 421 ms returned []
Implicit Place search using SMT with State Equation took 598 ms to find 0 implicit places.
Running 580 sub problems to find dead transitions.
[2024-06-01 17:29:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 2 (OVERLAPS) 10/375 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/375 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 4 (OVERLAPS) 590/965 variables, 375/397 constraints. Problems are: Problem set: 0 solved, 580 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 965/965 variables, and 397 constraints, problems are : Problem set: 0 solved, 580 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 375/375 constraints, PredecessorRefiner: 580/580 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 580 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 2 (OVERLAPS) 10/375 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/375 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 4 (OVERLAPS) 590/965 variables, 375/397 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/965 variables, 580/977 constraints. Problems are: Problem set: 0 solved, 580 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 965/965 variables, and 977 constraints, problems are : Problem set: 0 solved, 580 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 375/375 constraints, PredecessorRefiner: 580/580 constraints, Known Traps: 0/0 constraints]
After SMT, in 60991ms problems are : Problem set: 0 solved, 580 unsolved
Search for dead transitions found 0 dead transitions in 60999ms
Finished structural reductions in LTL mode , in 1 iterations and 61605 ms. Remains : 375/375 places, 590/590 transitions.
Stuttering acceptance computed with spot in 206 ms :[(NOT p2), (NOT p2), p1, p1]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N10-LTLFireability-05
Product exploration explored 100000 steps with 1739 reset in 752 ms.
Product exploration explored 100000 steps with 1677 reset in 794 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 p2) p1 (NOT p0)), (X (NOT p2)), (X (AND (NOT p2) p1)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1))))]
Knowledge based reduction with 6 factoid took 252 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 250 ms :[(NOT p2), (NOT p2), p1, p1]
RANDOM walk for 162 steps (0 resets) in 7 ms. (20 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2)), (X (AND (NOT p2) p1)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (F p2), (F (NOT p1)), (F p0)]
Knowledge based reduction with 6 factoid took 338 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[(NOT p2), (NOT p2), p1, p1]
Stuttering acceptance computed with spot in 179 ms :[(NOT p2), (NOT p2), p1, p1]
[2024-06-01 17:30:25] [INFO ] Invariant cache hit.
[2024-06-01 17:30:27] [INFO ] [Real]Absence check using 22 positive place invariants in 35 ms returned sat
[2024-06-01 17:30:28] [INFO ] [Real]Absence check using state equation in 1222 ms returned sat
[2024-06-01 17:30:28] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 17:30:30] [INFO ] [Nat]Absence check using 22 positive place invariants in 26 ms returned sat
[2024-06-01 17:30:31] [INFO ] [Nat]Absence check using state equation in 567 ms returned sat
[2024-06-01 17:30:31] [INFO ] Computed and/alt/rep : 580/890/580 causal constraints (skipped 0 transitions) in 59 ms.
[2024-06-01 17:30:34] [INFO ] Added : 356 causal constraints over 72 iterations in 3866 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 215 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Applied a total of 0 rules in 4 ms. Remains 375 /375 variables (removed 0) and now considering 590/590 (removed 0) transitions.
[2024-06-01 17:30:35] [INFO ] Invariant cache hit.
[2024-06-01 17:30:35] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-06-01 17:30:35] [INFO ] Invariant cache hit.
[2024-06-01 17:30:35] [INFO ] Implicit Places using invariants and state equation in 435 ms returned []
Implicit Place search using SMT with State Equation took 602 ms to find 0 implicit places.
Running 580 sub problems to find dead transitions.
[2024-06-01 17:30:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 2 (OVERLAPS) 10/375 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/375 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 4 (OVERLAPS) 590/965 variables, 375/397 constraints. Problems are: Problem set: 0 solved, 580 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 965/965 variables, and 397 constraints, problems are : Problem set: 0 solved, 580 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 375/375 constraints, PredecessorRefiner: 580/580 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 580 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 2 (OVERLAPS) 10/375 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/375 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 4 (OVERLAPS) 590/965 variables, 375/397 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/965 variables, 580/977 constraints. Problems are: Problem set: 0 solved, 580 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 965/965 variables, and 977 constraints, problems are : Problem set: 0 solved, 580 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 375/375 constraints, PredecessorRefiner: 580/580 constraints, Known Traps: 0/0 constraints]
After SMT, in 61031ms problems are : Problem set: 0 solved, 580 unsolved
Search for dead transitions found 0 dead transitions in 61040ms
Finished structural reductions in LTL mode , in 1 iterations and 61650 ms. Remains : 375/375 places, 590/590 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) p1 (NOT p0)), (X (NOT p2)), (X (X p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2)))]
Knowledge based reduction with 3 factoid took 160 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[(NOT p2), (NOT p2), p1, p1]
RANDOM walk for 162 steps (0 resets) in 6 ms. (23 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2)), (X (X p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (F p2), (F (NOT p1)), (F p0)]
Knowledge based reduction with 3 factoid took 242 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[(NOT p2), (NOT p2), p1, p1]
Stuttering acceptance computed with spot in 176 ms :[(NOT p2), (NOT p2), p1, p1]
[2024-06-01 17:31:37] [INFO ] Invariant cache hit.
[2024-06-01 17:31:39] [INFO ] [Real]Absence check using 22 positive place invariants in 33 ms returned sat
[2024-06-01 17:31:41] [INFO ] [Real]Absence check using state equation in 1230 ms returned sat
[2024-06-01 17:31:41] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 17:31:43] [INFO ] [Nat]Absence check using 22 positive place invariants in 26 ms returned sat
[2024-06-01 17:31:43] [INFO ] [Nat]Absence check using state equation in 582 ms returned sat
[2024-06-01 17:31:43] [INFO ] Computed and/alt/rep : 580/890/580 causal constraints (skipped 0 transitions) in 129 ms.
[2024-06-01 17:31:47] [INFO ] Added : 356 causal constraints over 72 iterations in 3818 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 208 ms :[(NOT p2), (NOT p2), p1, p1]
Product exploration explored 100000 steps with 1679 reset in 738 ms.
Product exploration explored 100000 steps with 1704 reset in 796 ms.
Support contains 215 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Applied a total of 0 rules in 5 ms. Remains 375 /375 variables (removed 0) and now considering 590/590 (removed 0) transitions.
[2024-06-01 17:31:49] [INFO ] Invariant cache hit.
[2024-06-01 17:31:49] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-06-01 17:31:49] [INFO ] Invariant cache hit.
[2024-06-01 17:31:50] [INFO ] Implicit Places using invariants and state equation in 428 ms returned []
Implicit Place search using SMT with State Equation took 587 ms to find 0 implicit places.
Running 580 sub problems to find dead transitions.
[2024-06-01 17:31:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 2 (OVERLAPS) 10/375 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/375 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 4 (OVERLAPS) 590/965 variables, 375/397 constraints. Problems are: Problem set: 0 solved, 580 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 965/965 variables, and 397 constraints, problems are : Problem set: 0 solved, 580 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 375/375 constraints, PredecessorRefiner: 580/580 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 580 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 2 (OVERLAPS) 10/375 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/375 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 4 (OVERLAPS) 590/965 variables, 375/397 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/965 variables, 580/977 constraints. Problems are: Problem set: 0 solved, 580 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 965/965 variables, and 977 constraints, problems are : Problem set: 0 solved, 580 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 375/375 constraints, PredecessorRefiner: 580/580 constraints, Known Traps: 0/0 constraints]
After SMT, in 61030ms problems are : Problem set: 0 solved, 580 unsolved
Search for dead transitions found 0 dead transitions in 61040ms
Finished structural reductions in LTL mode , in 1 iterations and 61640 ms. Remains : 375/375 places, 590/590 transitions.
Treatment of property UtilityControlRoom-COL-Z4T3N10-LTLFireability-05 finished in 210798 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((G(!p1)||p0))) U p1)))'
Support contains 55 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 255 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 255 transition count 470
Applied a total of 240 rules in 6 ms. Remains 255 /375 variables (removed 120) and now considering 470/590 (removed 120) transitions.
// Phase 1: matrix 470 rows 255 cols
[2024-06-01 17:32:51] [INFO ] Computed 22 invariants in 4 ms
[2024-06-01 17:32:51] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-06-01 17:32:51] [INFO ] Invariant cache hit.
[2024-06-01 17:32:51] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 454 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2024-06-01 17:32:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (OVERLAPS) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
No progress, stopping.
After SMT solving in domain Real declared 725/725 variables, and 277 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 460/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/725 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 725/725 variables, and 737 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
After SMT, in 60994ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 61000ms
Starting structural reductions in LTL mode, iteration 1 : 255/375 places, 470/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61462 ms. Remains : 255/375 places, 470/590 transitions.
Stuttering acceptance computed with spot in 209 ms :[(NOT p1), (NOT p1), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N10-LTLFireability-06
Product exploration explored 100000 steps with 2360 reset in 512 ms.
Product exploration explored 100000 steps with 2351 reset in 544 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 168 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 15 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 289 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) p1), (AND (NOT p0) p1), false, false]
RANDOM walk for 234 steps (0 resets) in 19 ms. (11 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT (OR (NOT p0) (NOT p1)))), (F p1), (F (NOT (OR p0 (NOT p1)))), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 4 factoid took 290 ms. Reduced automaton from 6 states, 15 edges and 2 AP (stutter insensitive) to 6 states, 15 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 240 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) p1), (AND (NOT p0) p1), false, false]
Stuttering acceptance computed with spot in 393 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) p1), (AND (NOT p0) p1), false, false]
[2024-06-01 17:33:55] [INFO ] Invariant cache hit.
[2024-06-01 17:33:57] [INFO ] [Real]Absence check using 22 positive place invariants in 29 ms returned sat
[2024-06-01 17:33:58] [INFO ] [Real]Absence check using state equation in 605 ms returned sat
[2024-06-01 17:33:58] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 17:34:00] [INFO ] [Nat]Absence check using 22 positive place invariants in 27 ms returned sat
[2024-06-01 17:34:00] [INFO ] [Nat]Absence check using state equation in 399 ms returned sat
[2024-06-01 17:34:00] [INFO ] Computed and/alt/rep : 460/770/460 causal constraints (skipped 0 transitions) in 45 ms.
[2024-06-01 17:34:02] [INFO ] Added : 196 causal constraints over 40 iterations in 1637 ms. Result :sat
Could not prove EG (NOT p0)
[2024-06-01 17:34:02] [INFO ] Invariant cache hit.
[2024-06-01 17:34:02] [INFO ] [Real]Absence check using 22 positive place invariants in 27 ms returned sat
[2024-06-01 17:34:02] [INFO ] [Real]Absence check using state equation in 344 ms returned sat
[2024-06-01 17:34:02] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 17:34:03] [INFO ] [Nat]Absence check using 22 positive place invariants in 20 ms returned sat
[2024-06-01 17:34:03] [INFO ] [Nat]Absence check using state equation in 366 ms returned sat
[2024-06-01 17:34:03] [INFO ] Computed and/alt/rep : 460/770/460 causal constraints (skipped 0 transitions) in 46 ms.
[2024-06-01 17:34:05] [INFO ] Added : 284 causal constraints over 57 iterations in 2299 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 55 out of 255 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 255/255 places, 470/470 transitions.
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 40 Pre rules applied. Total rules applied 0 place count 255 transition count 430
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 0 with 80 rules applied. Total rules applied 80 place count 215 transition count 430
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 0 with 80 rules applied. Total rules applied 160 place count 175 transition count 390
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 200 place count 175 transition count 350
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 220 place count 165 transition count 340
Applied a total of 220 rules in 29 ms. Remains 165 /255 variables (removed 90) and now considering 340/470 (removed 130) transitions.
// Phase 1: matrix 340 rows 165 cols
[2024-06-01 17:34:05] [INFO ] Computed 22 invariants in 3 ms
[2024-06-01 17:34:05] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-06-01 17:34:05] [INFO ] Invariant cache hit.
[2024-06-01 17:34:06] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 383 ms to find 0 implicit places.
[2024-06-01 17:34:06] [INFO ] Redundant transitions in 5 ms returned []
Running 290 sub problems to find dead transitions.
[2024-06-01 17:34:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (OVERLAPS) 10/165 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (OVERLAPS) 340/505 variables, 165/187 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/505 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (OVERLAPS) 0/505 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 290 unsolved
No progress, stopping.
After SMT solving in domain Real declared 505/505 variables, and 187 constraints, problems are : Problem set: 0 solved, 290 unsolved in 13095 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 290 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (OVERLAPS) 10/165 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (OVERLAPS) 340/505 variables, 165/187 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/505 variables, 290/477 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/505 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 7 (OVERLAPS) 0/505 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 290 unsolved
No progress, stopping.
After SMT solving in domain Int declared 505/505 variables, and 477 constraints, problems are : Problem set: 0 solved, 290 unsolved in 21164 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 0/0 constraints]
After SMT, in 34931ms problems are : Problem set: 0 solved, 290 unsolved
Search for dead transitions found 0 dead transitions in 34936ms
Starting structural reductions in SI_LTL mode, iteration 1 : 165/255 places, 340/470 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 35361 ms. Remains : 165/255 places, 340/470 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 (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (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 7 factoid took 381 ms. Reduced automaton from 6 states, 15 edges and 2 AP (stutter insensitive) to 6 states, 15 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 251 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) p1), (AND (NOT p0) p1), false, false]
RANDOM walk for 117 steps (0 resets) in 22 ms. (5 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F (NOT (OR (NOT p0) (NOT p1)))), (F p1), (F (NOT (OR p0 (NOT p1)))), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 519 ms. Reduced automaton from 6 states, 15 edges and 2 AP (stutter insensitive) to 6 states, 15 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 258 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) p1), (AND (NOT p0) p1), false, false]
Stuttering acceptance computed with spot in 237 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) p1), (AND (NOT p0) p1), false, false]
[2024-06-01 17:34:42] [INFO ] Invariant cache hit.
[2024-06-01 17:34:44] [INFO ] [Real]Absence check using 22 positive place invariants in 19 ms returned sat
[2024-06-01 17:34:44] [INFO ] [Real]Absence check using state equation in 247 ms returned sat
[2024-06-01 17:34:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 17:34:46] [INFO ] [Nat]Absence check using 22 positive place invariants in 16 ms returned sat
[2024-06-01 17:34:46] [INFO ] [Nat]Absence check using state equation in 197 ms returned sat
[2024-06-01 17:34:46] [INFO ] Computed and/alt/rep : 290/640/290 causal constraints (skipped 0 transitions) in 31 ms.
[2024-06-01 17:34:47] [INFO ] Added : 181 causal constraints over 37 iterations in 1197 ms. Result :sat
Could not prove EG (NOT p0)
[2024-06-01 17:34:47] [INFO ] Invariant cache hit.
[2024-06-01 17:34:48] [INFO ] [Real]Absence check using 22 positive place invariants in 18 ms returned sat
[2024-06-01 17:34:48] [INFO ] [Real]Absence check using state equation in 181 ms returned sat
[2024-06-01 17:34:48] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 17:34:48] [INFO ] [Nat]Absence check using 22 positive place invariants in 14 ms returned sat
[2024-06-01 17:34:48] [INFO ] [Nat]Absence check using state equation in 177 ms returned sat
[2024-06-01 17:34:48] [INFO ] Computed and/alt/rep : 290/640/290 causal constraints (skipped 0 transitions) in 32 ms.
[2024-06-01 17:34:49] [INFO ] Added : 109 causal constraints over 22 iterations in 670 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 240 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) p1), (AND (NOT p0) p1), false, false]
Product exploration explored 100000 steps with 3577 reset in 1419 ms.
Product exploration explored 100000 steps with 3617 reset in 1399 ms.
Support contains 55 out of 165 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 165/165 places, 340/340 transitions.
Applied a total of 0 rules in 12 ms. Remains 165 /165 variables (removed 0) and now considering 340/340 (removed 0) transitions.
[2024-06-01 17:34:52] [INFO ] Invariant cache hit.
[2024-06-01 17:34:52] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-06-01 17:34:52] [INFO ] Invariant cache hit.
[2024-06-01 17:34:52] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
[2024-06-01 17:34:52] [INFO ] Redundant transitions in 1 ms returned []
Running 290 sub problems to find dead transitions.
[2024-06-01 17:34:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (OVERLAPS) 10/165 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (OVERLAPS) 340/505 variables, 165/187 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/505 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (OVERLAPS) 0/505 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 290 unsolved
No progress, stopping.
After SMT solving in domain Real declared 505/505 variables, and 187 constraints, problems are : Problem set: 0 solved, 290 unsolved in 13105 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 290 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (OVERLAPS) 10/165 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (OVERLAPS) 340/505 variables, 165/187 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/505 variables, 290/477 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/505 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 7 (OVERLAPS) 0/505 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 290 unsolved
No progress, stopping.
After SMT solving in domain Int declared 505/505 variables, and 477 constraints, problems are : Problem set: 0 solved, 290 unsolved in 21729 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 0/0 constraints]
After SMT, in 35458ms problems are : Problem set: 0 solved, 290 unsolved
Search for dead transitions found 0 dead transitions in 35462ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 35862 ms. Remains : 165/165 places, 340/340 transitions.
Treatment of property UtilityControlRoom-COL-Z4T3N10-LTLFireability-06 finished in 157111 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)&&X(G(p1)))))'
Support contains 95 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 255 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 255 transition count 470
Applied a total of 240 rules in 8 ms. Remains 255 /375 variables (removed 120) and now considering 470/590 (removed 120) transitions.
// Phase 1: matrix 470 rows 255 cols
[2024-06-01 17:35:28] [INFO ] Computed 22 invariants in 3 ms
[2024-06-01 17:35:28] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-06-01 17:35:28] [INFO ] Invariant cache hit.
[2024-06-01 17:35:28] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 392 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2024-06-01 17:35:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (OVERLAPS) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
No progress, stopping.
After SMT solving in domain Real declared 725/725 variables, and 277 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 460/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/725 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 725/725 variables, and 737 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
After SMT, in 61007ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 61014ms
Starting structural reductions in LTL mode, iteration 1 : 255/375 places, 470/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61416 ms. Remains : 255/375 places, 470/590 transitions.
Stuttering acceptance computed with spot in 174 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N10-LTLFireability-07
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA UtilityControlRoom-COL-Z4T3N10-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T3N10-LTLFireability-07 finished in 61613 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||(F(p0)&&p1))))'
Support contains 20 out of 375 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 0 with 160 rules applied. Total rules applied 160 place count 375 transition count 430
Reduce places removed 160 places and 0 transitions.
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 360 place count 215 transition count 390
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 360 place count 215 transition count 350
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 440 place count 175 transition count 350
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 443 place count 172 transition count 230
Iterating global reduction 2 with 3 rules applied. Total rules applied 446 place count 172 transition count 230
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 476 place count 142 transition count 200
Iterating global reduction 2 with 30 rules applied. Total rules applied 506 place count 142 transition count 200
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 536 place count 112 transition count 140
Iterating global reduction 2 with 30 rules applied. Total rules applied 566 place count 112 transition count 140
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 596 place count 82 transition count 110
Iterating global reduction 2 with 30 rules applied. Total rules applied 626 place count 82 transition count 110
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 656 place count 82 transition count 80
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 656 place count 82 transition count 70
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 676 place count 72 transition count 70
Applied a total of 676 rules in 34 ms. Remains 72 /375 variables (removed 303) and now considering 70/590 (removed 520) transitions.
// Phase 1: matrix 70 rows 72 cols
[2024-06-01 17:36:29] [INFO ] Computed 22 invariants in 0 ms
[2024-06-01 17:36:30] [INFO ] Implicit Places using invariants in 60 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 69 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 71/375 places, 70/590 transitions.
Applied a total of 0 rules in 2 ms. Remains 71 /71 variables (removed 0) and now considering 70/70 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 105 ms. Remains : 71/375 places, 70/590 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N10-LTLFireability-08
Product exploration explored 100000 steps with 5341 reset in 201 ms.
Product exploration explored 100000 steps with 5355 reset in 220 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 4 factoid took 126 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 70 steps (0 resets) in 4 ms. (14 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F p0)]
Knowledge based reduction with 4 factoid took 148 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 70 rows 71 cols
[2024-06-01 17:36:31] [INFO ] Computed 21 invariants in 0 ms
[2024-06-01 17:36:31] [INFO ] [Real]Absence check using 21 positive place invariants in 7 ms returned sat
[2024-06-01 17:36:31] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2024-06-01 17:36:31] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 17:36:31] [INFO ] [Nat]Absence check using 21 positive place invariants in 7 ms returned sat
[2024-06-01 17:36:31] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2024-06-01 17:36:31] [INFO ] Computed and/alt/rep : 60/90/60 causal constraints (skipped 0 transitions) in 7 ms.
[2024-06-01 17:36:31] [INFO ] Added : 15 causal constraints over 3 iterations in 61 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 10 out of 71 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 71/71 places, 70/70 transitions.
Applied a total of 0 rules in 2 ms. Remains 71 /71 variables (removed 0) and now considering 70/70 (removed 0) transitions.
[2024-06-01 17:36:31] [INFO ] Invariant cache hit.
[2024-06-01 17:36:31] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-06-01 17:36:31] [INFO ] Invariant cache hit.
[2024-06-01 17:36:31] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
[2024-06-01 17:36:31] [INFO ] Redundant transitions in 0 ms returned []
Running 60 sub problems to find dead transitions.
[2024-06-01 17:36:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 10/71 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 70/141 variables, 71/92 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 0/141 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 141/141 variables, and 92 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1121 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 71/71 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 10/71 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 70/141 variables, 71/92 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 60/152 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 0/141 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 141/141 variables, and 152 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1134 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 71/71 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 2286ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 2287ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2509 ms. Remains : 71/71 places, 70/70 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), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 126 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 65 steps (0 resets) in 6 ms. (9 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
[2024-06-01 17:36:34] [INFO ] Invariant cache hit.
[2024-06-01 17:36:34] [INFO ] [Real]Absence check using 21 positive place invariants in 7 ms returned sat
[2024-06-01 17:36:34] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2024-06-01 17:36:34] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 17:36:34] [INFO ] [Nat]Absence check using 21 positive place invariants in 7 ms returned sat
[2024-06-01 17:36:34] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2024-06-01 17:36:34] [INFO ] Computed and/alt/rep : 60/90/60 causal constraints (skipped 0 transitions) in 10 ms.
[2024-06-01 17:36:34] [INFO ] Added : 14 causal constraints over 3 iterations in 38 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5344 reset in 198 ms.
Product exploration explored 100000 steps with 5357 reset in 219 ms.
Support contains 10 out of 71 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 71/71 places, 70/70 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 61 transition count 60
Applied a total of 20 rules in 4 ms. Remains 61 /71 variables (removed 10) and now considering 60/70 (removed 10) transitions.
// Phase 1: matrix 60 rows 61 cols
[2024-06-01 17:36:35] [INFO ] Computed 21 invariants in 0 ms
[2024-06-01 17:36:35] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-06-01 17:36:35] [INFO ] Invariant cache hit.
[2024-06-01 17:36:35] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
[2024-06-01 17:36:35] [INFO ] Redundant transitions in 0 ms returned []
Running 40 sub problems to find dead transitions.
[2024-06-01 17:36:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 11/61 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 60/121 variables, 61/82 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 0/121 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 121/121 variables, and 82 constraints, problems are : Problem set: 0 solved, 40 unsolved in 723 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 61/61 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 11/61 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 60/121 variables, 61/82 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 40/122 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 0/121 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 121/121 variables, and 122 constraints, problems are : Problem set: 0 solved, 40 unsolved in 675 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 61/61 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
After SMT, in 1438ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1442ms
Starting structural reductions in SI_LTL mode, iteration 1 : 61/71 places, 60/70 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1626 ms. Remains : 61/71 places, 60/70 transitions.
Treatment of property UtilityControlRoom-COL-Z4T3N10-LTLFireability-08 finished in 6866 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&G(F(p1))))))'
Support contains 95 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 255 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 255 transition count 470
Applied a total of 240 rules in 6 ms. Remains 255 /375 variables (removed 120) and now considering 470/590 (removed 120) transitions.
// Phase 1: matrix 470 rows 255 cols
[2024-06-01 17:36:36] [INFO ] Computed 22 invariants in 3 ms
[2024-06-01 17:36:36] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-01 17:36:36] [INFO ] Invariant cache hit.
[2024-06-01 17:36:37] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2024-06-01 17:36:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (OVERLAPS) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
No progress, stopping.
After SMT solving in domain Real declared 725/725 variables, and 277 constraints, problems are : Problem set: 0 solved, 460 unsolved in 25248 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 460/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/725 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 725/725 variables, and 737 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
After SMT, in 56191ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 56196ms
Starting structural reductions in LTL mode, iteration 1 : 255/375 places, 470/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56503 ms. Remains : 255/375 places, 470/590 transitions.
Stuttering acceptance computed with spot in 230 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N10-LTLFireability-09
Product exploration explored 100000 steps with 8032 reset in 936 ms.
Product exploration explored 100000 steps with 8069 reset in 954 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 122 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 15 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1), (X (X p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 148 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p1), (NOT p1)]
Support contains 45 out of 255 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 255/255 places, 470/470 transitions.
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 0 with 80 rules applied. Total rules applied 80 place count 215 transition count 430
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 120 place count 215 transition count 390
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 140 place count 205 transition count 380
Applied a total of 140 rules in 15 ms. Remains 205 /255 variables (removed 50) and now considering 380/470 (removed 90) transitions.
// Phase 1: matrix 380 rows 205 cols
[2024-06-01 17:37:35] [INFO ] Computed 22 invariants in 2 ms
[2024-06-01 17:37:36] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-06-01 17:37:36] [INFO ] Invariant cache hit.
[2024-06-01 17:37:36] [INFO ] Implicit Places using invariants and state equation in 323 ms returned []
Implicit Place search using SMT with State Equation took 442 ms to find 0 implicit places.
[2024-06-01 17:37:36] [INFO ] Redundant transitions in 1 ms returned []
Running 330 sub problems to find dead transitions.
[2024-06-01 17:37:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 2 (OVERLAPS) 10/205 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 4 (OVERLAPS) 380/585 variables, 205/227 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/585 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 6 (OVERLAPS) 0/585 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 330 unsolved
No progress, stopping.
After SMT solving in domain Real declared 585/585 variables, and 227 constraints, problems are : Problem set: 0 solved, 330 unsolved in 14979 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 330/330 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 330 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 2 (OVERLAPS) 10/205 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 4 (OVERLAPS) 380/585 variables, 205/227 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/585 variables, 330/557 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/585 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 7 (OVERLAPS) 0/585 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 330 unsolved
No progress, stopping.
After SMT solving in domain Int declared 585/585 variables, and 557 constraints, problems are : Problem set: 0 solved, 330 unsolved in 24027 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 330/330 constraints, Known Traps: 0/0 constraints]
After SMT, in 39594ms problems are : Problem set: 0 solved, 330 unsolved
Search for dead transitions found 0 dead transitions in 39598ms
Starting structural reductions in SI_LTL mode, iteration 1 : 205/255 places, 380/470 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 40065 ms. Remains : 205/255 places, 380/470 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 : [p1]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 158 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 189 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p1]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 176 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 7846 reset in 902 ms.
Product exploration explored 100000 steps with 7877 reset in 914 ms.
Support contains 45 out of 205 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 205/205 places, 380/380 transitions.
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 40 Pre rules applied. Total rules applied 0 place count 205 transition count 340
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 0 with 80 rules applied. Total rules applied 80 place count 165 transition count 340
Applied a total of 80 rules in 9 ms. Remains 165 /205 variables (removed 40) and now considering 340/380 (removed 40) transitions.
// Phase 1: matrix 340 rows 165 cols
[2024-06-01 17:38:18] [INFO ] Computed 22 invariants in 2 ms
[2024-06-01 17:38:18] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-06-01 17:38:18] [INFO ] Invariant cache hit.
[2024-06-01 17:38:18] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
[2024-06-01 17:38:18] [INFO ] Redundant transitions in 1 ms returned []
Running 290 sub problems to find dead transitions.
[2024-06-01 17:38:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (OVERLAPS) 10/165 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (OVERLAPS) 340/505 variables, 165/187 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/505 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (OVERLAPS) 0/505 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 290 unsolved
No progress, stopping.
After SMT solving in domain Real declared 505/505 variables, and 187 constraints, problems are : Problem set: 0 solved, 290 unsolved in 11099 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 290 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (OVERLAPS) 10/165 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (OVERLAPS) 340/505 variables, 165/187 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/505 variables, 290/477 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/505 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 7 (OVERLAPS) 0/505 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 290 unsolved
No progress, stopping.
After SMT solving in domain Int declared 505/505 variables, and 477 constraints, problems are : Problem set: 0 solved, 290 unsolved in 20127 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 0/0 constraints]
After SMT, in 31804ms problems are : Problem set: 0 solved, 290 unsolved
Search for dead transitions found 0 dead transitions in 31807ms
Starting structural reductions in SI_LTL mode, iteration 1 : 165/205 places, 340/380 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 32151 ms. Remains : 165/205 places, 340/380 transitions.
Treatment of property UtilityControlRoom-COL-Z4T3N10-LTLFireability-09 finished in 134002 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)||(X(p2)&&(X(!p1) U ((!p2&&X(!p1))||X(G(!p1)))))))'
Support contains 70 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 255 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 255 transition count 470
Applied a total of 240 rules in 6 ms. Remains 255 /375 variables (removed 120) and now considering 470/590 (removed 120) transitions.
// Phase 1: matrix 470 rows 255 cols
[2024-06-01 17:38:50] [INFO ] Computed 22 invariants in 3 ms
[2024-06-01 17:38:50] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-06-01 17:38:50] [INFO ] Invariant cache hit.
[2024-06-01 17:38:51] [INFO ] Implicit Places using invariants and state equation in 306 ms returned []
Implicit Place search using SMT with State Equation took 455 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2024-06-01 17:38:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (OVERLAPS) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
No progress, stopping.
After SMT solving in domain Real declared 725/725 variables, and 277 constraints, problems are : Problem set: 0 solved, 460 unsolved in 25334 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 460/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/725 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 725/725 variables, and 737 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
After SMT, in 56342ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 56347ms
Starting structural reductions in LTL mode, iteration 1 : 255/375 places, 470/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56810 ms. Remains : 255/375 places, 470/590 transitions.
Stuttering acceptance computed with spot in 279 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), p1, p1, (AND (NOT p1) (NOT p2)), false, true, (NOT p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N10-LTLFireability-10
Entered a terminal (fully accepting) state of product in 7 steps with 3 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z4T3N10-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T3N10-LTLFireability-10 finished in 57114 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)||p0)))'
Support contains 85 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 255 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 255 transition count 470
Applied a total of 240 rules in 4 ms. Remains 255 /375 variables (removed 120) and now considering 470/590 (removed 120) transitions.
[2024-06-01 17:39:47] [INFO ] Invariant cache hit.
[2024-06-01 17:39:48] [INFO ] Implicit Places using invariants in 234 ms returned []
[2024-06-01 17:39:48] [INFO ] Invariant cache hit.
[2024-06-01 17:39:48] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 553 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2024-06-01 17:39:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (OVERLAPS) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
No progress, stopping.
After SMT solving in domain Real declared 725/725 variables, and 277 constraints, problems are : Problem set: 0 solved, 460 unsolved in 25747 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 460/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/725 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 725/725 variables, and 737 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
After SMT, in 56673ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 56679ms
Starting structural reductions in LTL mode, iteration 1 : 255/375 places, 470/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57239 ms. Remains : 255/375 places, 470/590 transitions.
Stuttering acceptance computed with spot in 125 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N10-LTLFireability-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z4T3N10-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T3N10-LTLFireability-11 finished in 57385 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))||((p1&&F(p2)) U X(!p3))))'
Support contains 115 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 255 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 255 transition count 470
Applied a total of 240 rules in 5 ms. Remains 255 /375 variables (removed 120) and now considering 470/590 (removed 120) transitions.
[2024-06-01 17:40:45] [INFO ] Invariant cache hit.
[2024-06-01 17:40:45] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-01 17:40:45] [INFO ] Invariant cache hit.
[2024-06-01 17:40:45] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2024-06-01 17:40:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (OVERLAPS) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
No progress, stopping.
After SMT solving in domain Real declared 725/725 variables, and 277 constraints, problems are : Problem set: 0 solved, 460 unsolved in 25379 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 460/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/725 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 725/725 variables, and 737 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
After SMT, in 56281ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 56289ms
Starting structural reductions in LTL mode, iteration 1 : 255/375 places, 470/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56643 ms. Remains : 255/375 places, 470/590 transitions.
Stuttering acceptance computed with spot in 318 ms :[(AND p0 p3), (AND p0 p3), (AND (NOT p2) p3 p0), (AND p0 p3), p0, (AND (NOT p2) p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N10-LTLFireability-12
Product exploration explored 100000 steps with 50000 reset in 220 ms.
Product exploration explored 100000 steps with 50000 reset in 237 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p1 (NOT p2) p3 p0))), (X (NOT (AND p3 p0))), (X (NOT (AND (NOT p1) p3 p0))), (X (NOT (AND p1 p3 p0))), (X (NOT (AND (NOT p2) p3 p0))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p1 (NOT p2) p3 p0)))), (X (X (NOT (AND p3 p0)))), (X (X (NOT (AND (NOT p1) p3 p0)))), (X (X (NOT (AND p1 p3 p0)))), (X (X (NOT (AND (NOT p2) p3 p0))))]
False Knowledge obtained : [(X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (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 17 factoid took 17 ms. Reduced automaton from 6 states, 10 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z4T3N10-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z4T3N10-LTLFireability-12 finished in 57463 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||(X(p0)&&F(p1))))'
Support contains 60 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 255 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 255 transition count 470
Applied a total of 240 rules in 6 ms. Remains 255 /375 variables (removed 120) and now considering 470/590 (removed 120) transitions.
[2024-06-01 17:41:42] [INFO ] Invariant cache hit.
[2024-06-01 17:41:42] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-06-01 17:41:42] [INFO ] Invariant cache hit.
[2024-06-01 17:41:43] [INFO ] Implicit Places using invariants and state equation in 320 ms returned []
Implicit Place search using SMT with State Equation took 502 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2024-06-01 17:41:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (OVERLAPS) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
No progress, stopping.
After SMT solving in domain Real declared 725/725 variables, and 277 constraints, problems are : Problem set: 0 solved, 460 unsolved in 25334 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 460/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/725 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 2)
(s1 0)
(s2 0)
(s3 1)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 1)
(s15 0)
(s16 0)
(s17 0)
(s18 1)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 1)
(s34 1)
(s35 0)
(s36 0)
(s37 0)
(s38 1)
(s39 0)
(s40 0)
(s41 0)
(s42 1)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 1)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 1)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 725/725 variables, and 737 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30061 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
After SMT, in 56285ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 56291ms
Starting structural reductions in LTL mode, iteration 1 : 255/375 places, 470/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56803 ms. Remains : 255/375 places, 470/590 transitions.
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N10-LTLFireability-13
Product exploration explored 100000 steps with 50000 reset in 292 ms.
Product exploration explored 100000 steps with 50000 reset in 304 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (AND (NOT p1) p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 13 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z4T3N10-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z4T3N10-LTLFireability-13 finished in 57586 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G(!p1)&&X(F(p0)))))'
Support contains 55 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 255 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 255 transition count 470
Applied a total of 240 rules in 7 ms. Remains 255 /375 variables (removed 120) and now considering 470/590 (removed 120) transitions.
[2024-06-01 17:42:40] [INFO ] Invariant cache hit.
[2024-06-01 17:42:40] [INFO ] Implicit Places using invariants in 262 ms returned []
[2024-06-01 17:42:40] [INFO ] Invariant cache hit.
[2024-06-01 17:42:41] [INFO ] Implicit Places using invariants and state equation in 466 ms returned []
Implicit Place search using SMT with State Equation took 751 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2024-06-01 17:42:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (OVERLAPS) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
No progress, stopping.
After SMT solving in domain Real declared 725/725 variables, and 277 constraints, problems are : Problem set: 0 solved, 460 unsolved in 25187 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 460/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/725 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 725/725 variables, and 737 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
After SMT, in 56156ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 56164ms
Starting structural reductions in LTL mode, iteration 1 : 255/375 places, 470/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56924 ms. Remains : 255/375 places, 470/590 transitions.
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p0) p1), p1, (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N10-LTLFireability-14
Product exploration explored 100000 steps with 1860 reset in 1932 ms.
Product exploration explored 100000 steps with 1900 reset in 1988 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (OR (NOT p0) p1)), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1))]
False Knowledge obtained : [(X (X (OR (NOT p0) p1))), (X (X (NOT (OR (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 273 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) p1), p1, (NOT p0)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 13 steps (0 resets) in 7 ms. (1 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (OR (NOT p0) p1)), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1))]
False Knowledge obtained : [(X (X (OR (NOT p0) p1))), (X (X (NOT (OR (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) p1))), (F p0)]
Knowledge based reduction with 5 factoid took 420 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) p1), p1, (NOT p0)]
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p0) p1), p1, (NOT p0)]
[2024-06-01 17:43:42] [INFO ] Invariant cache hit.
[2024-06-01 17:43:44] [INFO ] [Real]Absence check using 22 positive place invariants in 24 ms returned sat
[2024-06-01 17:43:44] [INFO ] [Real]Absence check using state equation in 529 ms returned sat
[2024-06-01 17:43:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 17:43:46] [INFO ] [Nat]Absence check using 22 positive place invariants in 20 ms returned sat
[2024-06-01 17:43:46] [INFO ] [Nat]Absence check using state equation in 376 ms returned sat
[2024-06-01 17:43:46] [INFO ] Computed and/alt/rep : 460/770/460 causal constraints (skipped 0 transitions) in 35 ms.
[2024-06-01 17:43:48] [INFO ] Added : 196 causal constraints over 40 iterations in 1292 ms. Result :sat
Could not prove EG (NOT p0)
[2024-06-01 17:43:48] [INFO ] Invariant cache hit.
[2024-06-01 17:43:48] [INFO ] [Real]Absence check using 22 positive place invariants in 22 ms returned sat
[2024-06-01 17:43:48] [INFO ] [Real]Absence check using state equation in 300 ms returned sat
[2024-06-01 17:43:48] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 17:43:49] [INFO ] [Nat]Absence check using 22 positive place invariants in 18 ms returned sat
[2024-06-01 17:43:49] [INFO ] [Nat]Absence check using state equation in 243 ms returned sat
[2024-06-01 17:43:49] [INFO ] Computed and/alt/rep : 460/770/460 causal constraints (skipped 0 transitions) in 43 ms.
[2024-06-01 17:43:49] [INFO ] Added : 0 causal constraints over 0 iterations in 83 ms. Result :sat
Could not prove EG p1
Support contains 55 out of 255 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 470/470 transitions.
Applied a total of 0 rules in 3 ms. Remains 255 /255 variables (removed 0) and now considering 470/470 (removed 0) transitions.
[2024-06-01 17:43:49] [INFO ] Invariant cache hit.
[2024-06-01 17:43:49] [INFO ] Implicit Places using invariants in 180 ms returned []
[2024-06-01 17:43:49] [INFO ] Invariant cache hit.
[2024-06-01 17:43:49] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 480 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2024-06-01 17:43:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (OVERLAPS) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
No progress, stopping.
After SMT solving in domain Real declared 725/725 variables, and 277 constraints, problems are : Problem set: 0 solved, 460 unsolved in 25544 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 460/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/725 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 725/725 variables, and 737 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
After SMT, in 56458ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 56465ms
Finished structural reductions in LTL mode , in 1 iterations and 56950 ms. Remains : 255/255 places, 470/470 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) p1), (X (OR (NOT p0) p1)), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1))]
False Knowledge obtained : [(X (X (OR (NOT p0) p1))), (X (X (NOT (OR (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 412 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) p1), p1, (NOT p0)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 10 steps (0 resets) in 5 ms. (1 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (OR (NOT p0) p1)), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1))]
False Knowledge obtained : [(X (X (OR (NOT p0) p1))), (X (X (NOT (OR (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) p1))), (F p0)]
Knowledge based reduction with 5 factoid took 399 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) p1), p1, (NOT p0)]
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p0) p1), p1, (NOT p0)]
[2024-06-01 17:44:47] [INFO ] Invariant cache hit.
[2024-06-01 17:44:49] [INFO ] [Real]Absence check using 22 positive place invariants in 24 ms returned sat
[2024-06-01 17:44:49] [INFO ] [Real]Absence check using state equation in 539 ms returned sat
[2024-06-01 17:44:49] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 17:44:51] [INFO ] [Nat]Absence check using 22 positive place invariants in 22 ms returned sat
[2024-06-01 17:44:51] [INFO ] [Nat]Absence check using state equation in 379 ms returned sat
[2024-06-01 17:44:51] [INFO ] Computed and/alt/rep : 460/770/460 causal constraints (skipped 0 transitions) in 35 ms.
[2024-06-01 17:44:53] [INFO ] Added : 196 causal constraints over 40 iterations in 1316 ms. Result :sat
Could not prove EG (NOT p0)
[2024-06-01 17:44:53] [INFO ] Invariant cache hit.
[2024-06-01 17:44:53] [INFO ] [Real]Absence check using 22 positive place invariants in 23 ms returned sat
[2024-06-01 17:44:53] [INFO ] [Real]Absence check using state equation in 307 ms returned sat
[2024-06-01 17:44:53] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 17:44:54] [INFO ] [Nat]Absence check using 22 positive place invariants in 19 ms returned sat
[2024-06-01 17:44:54] [INFO ] [Nat]Absence check using state equation in 253 ms returned sat
[2024-06-01 17:44:54] [INFO ] Computed and/alt/rep : 460/770/460 causal constraints (skipped 0 transitions) in 36 ms.
[2024-06-01 17:44:54] [INFO ] Added : 0 causal constraints over 0 iterations in 74 ms. Result :sat
Could not prove EG p1
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) p1), p1, (NOT p0)]
Product exploration explored 100000 steps with 1924 reset in 1923 ms.
Product exploration explored 100000 steps with 1914 reset in 1912 ms.
Applying partial POR strategy [false, false, true]
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p0) p1), p1, (NOT p0)]
Support contains 55 out of 255 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 255/255 places, 470/470 transitions.
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 40 Pre rules applied. Total rules applied 0 place count 255 transition count 510
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 255 transition count 510
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 80 places in 0 ms
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 255 transition count 510
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 120 place count 255 transition count 470
Deduced a syphon composed of 80 places in 0 ms
Applied a total of 120 rules in 18 ms. Remains 255 /255 variables (removed 0) and now considering 470/470 (removed 0) transitions.
[2024-06-01 17:44:58] [INFO ] Redundant transitions in 2 ms returned []
Running 460 sub problems to find dead transitions.
// Phase 1: matrix 470 rows 255 cols
[2024-06-01 17:44:58] [INFO ] Computed 22 invariants in 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
[2024-06-01 17:45:03] [INFO ] Deduced a trap composed of 91 places in 123 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/245 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (OVERLAPS) 10/255 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 460 unsolved
[2024-06-01 17:45:10] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
Problem TDEAD15 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD45 is UNSAT
[2024-06-01 17:45:11] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 2 ms to minimize.
Problem TDEAD150 is UNSAT
[2024-06-01 17:45:11] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
Problem TDEAD151 is UNSAT
[2024-06-01 17:45:11] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
Problem TDEAD152 is UNSAT
[2024-06-01 17:45:11] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
Problem TDEAD153 is UNSAT
[2024-06-01 17:45:11] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
[2024-06-01 17:45:11] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
Problem TDEAD156 is UNSAT
[2024-06-01 17:45:11] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
Problem TDEAD157 is UNSAT
[2024-06-01 17:45:11] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 3 ms to minimize.
Problem TDEAD158 is UNSAT
[2024-06-01 17:45:11] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 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 TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 10/33 constraints. Problems are: Problem set: 120 solved, 340 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 0/33 constraints. Problems are: Problem set: 120 solved, 340 unsolved
At refinement iteration 6 (OVERLAPS) 470/725 variables, 255/288 constraints. Problems are: Problem set: 120 solved, 340 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/725 variables, 0/288 constraints. Problems are: Problem set: 120 solved, 340 unsolved
At refinement iteration 8 (OVERLAPS) 0/725 variables, 0/288 constraints. Problems are: Problem set: 120 solved, 340 unsolved
No progress, stopping.
After SMT solving in domain Real declared 725/725 variables, and 288 constraints, problems are : Problem set: 120 solved, 340 unsolved in 26850 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 120 solved, 340 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 1/1 constraints. Problems are: Problem set: 120 solved, 340 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 0/1 constraints. Problems are: Problem set: 120 solved, 340 unsolved
At refinement iteration 2 (OVERLAPS) 90/255 variables, 22/23 constraints. Problems are: Problem set: 120 solved, 340 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 10/33 constraints. Problems are: Problem set: 120 solved, 340 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 0/33 constraints. Problems are: Problem set: 120 solved, 340 unsolved
At refinement iteration 5 (OVERLAPS) 470/725 variables, 255/288 constraints. Problems are: Problem set: 120 solved, 340 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/725 variables, 340/628 constraints. Problems are: Problem set: 120 solved, 340 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/725 variables, 0/628 constraints. Problems are: Problem set: 120 solved, 340 unsolved
At refinement iteration 8 (OVERLAPS) 0/725 variables, 0/628 constraints. Problems are: Problem set: 120 solved, 340 unsolved
No progress, stopping.
After SMT solving in domain Int declared 725/725 variables, and 628 constraints, problems are : Problem set: 120 solved, 340 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 340/460 constraints, Known Traps: 11/11 constraints]
After SMT, in 57451ms problems are : Problem set: 120 solved, 340 unsolved
Search for dead transitions found 120 dead transitions in 57457ms
Found 120 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 120 transitions
Dead transitions reduction (with SMT) removed 120 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 255/255 places, 350/470 transitions.
Graph (complete) has 530 edges and 255 vertex of which 175 are kept as prefixes of interest. Removing 80 places using SCC suffix rule.2 ms
Discarding 80 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 175 /255 variables (removed 80) and now considering 350/350 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 175/255 places, 350/470 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 57490 ms. Remains : 175/255 places, 350/470 transitions.
Support contains 55 out of 255 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 470/470 transitions.
Applied a total of 0 rules in 2 ms. Remains 255 /255 variables (removed 0) and now considering 470/470 (removed 0) transitions.
// Phase 1: matrix 470 rows 255 cols
[2024-06-01 17:45:56] [INFO ] Computed 22 invariants in 2 ms
[2024-06-01 17:45:56] [INFO ] Implicit Places using invariants in 180 ms returned []
[2024-06-01 17:45:56] [INFO ] Invariant cache hit.
[2024-06-01 17:45:56] [INFO ] Implicit Places using invariants and state equation in 348 ms returned []
Implicit Place search using SMT with State Equation took 540 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2024-06-01 17:45:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (OVERLAPS) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
No progress, stopping.
After SMT solving in domain Real declared 725/725 variables, and 277 constraints, problems are : Problem set: 0 solved, 460 unsolved in 25612 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 460/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/725 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 725/725 variables, and 737 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
After SMT, in 56507ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 56514ms
Finished structural reductions in LTL mode , in 1 iterations and 57057 ms. Remains : 255/255 places, 470/470 transitions.
Treatment of property UtilityControlRoom-COL-Z4T3N10-LTLFireability-14 finished in 253014 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(((G(p0) U !p1)||G(!p0)))))||F(p2)))'
Found a Shortening insensitive property : UtilityControlRoom-COL-Z4T3N10-LTLFireability-00
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p2) p1 p0), (AND (NOT p2) p1 p0), (AND (NOT p2) p1 p0)]
Support contains 95 out of 375 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 255 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 255 transition count 470
Applied a total of 240 rules in 10 ms. Remains 255 /375 variables (removed 120) and now considering 470/590 (removed 120) transitions.
[2024-06-01 17:46:53] [INFO ] Invariant cache hit.
[2024-06-01 17:46:53] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-06-01 17:46:53] [INFO ] Invariant cache hit.
[2024-06-01 17:46:54] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 410 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2024-06-01 17:46:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (OVERLAPS) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
No progress, stopping.
After SMT solving in domain Real declared 725/725 variables, and 277 constraints, problems are : Problem set: 0 solved, 460 unsolved in 25467 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 460/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/725 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 725/725 variables, and 737 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
After SMT, in 56420ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 56426ms
Starting structural reductions in LI_LTL mode, iteration 1 : 255/375 places, 470/590 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 56847 ms. Remains : 255/375 places, 470/590 transitions.
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N10-LTLFireability-00
Product exploration explored 100000 steps with 11167 reset in 1506 ms.
Product exploration explored 100000 steps with 11062 reset in 1531 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 p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1 p0))))]
False Knowledge obtained : [(X (X (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 340 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1)]
RANDOM walk for 38 steps (0 resets) in 8 ms. (4 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1 p0))))]
False Knowledge obtained : [(X (X (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p1), (F p0), (F p2), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT (OR (NOT p0) p2 (NOT p1))))]
Knowledge based reduction with 4 factoid took 442 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 189 ms :[(AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1)]
Stuttering acceptance computed with spot in 187 ms :[(AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1)]
Support contains 95 out of 255 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 470/470 transitions.
Applied a total of 0 rules in 2 ms. Remains 255 /255 variables (removed 0) and now considering 470/470 (removed 0) transitions.
[2024-06-01 17:47:54] [INFO ] Invariant cache hit.
[2024-06-01 17:47:55] [INFO ] Implicit Places using invariants in 200 ms returned []
[2024-06-01 17:47:55] [INFO ] Invariant cache hit.
[2024-06-01 17:47:55] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 488 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2024-06-01 17:47:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (OVERLAPS) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
No progress, stopping.
After SMT solving in domain Real declared 725/725 variables, and 277 constraints, problems are : Problem set: 0 solved, 460 unsolved in 25305 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 460/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/725 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 725/725 variables, and 737 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
After SMT, in 56171ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 56177ms
Finished structural reductions in LTL mode , in 1 iterations and 56669 ms. Remains : 255/255 places, 470/470 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2) p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 231 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1)]
RANDOM walk for 42 steps (0 resets) in 6 ms. (6 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2) p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p1), (F p0), (F p2), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT (OR (NOT p0) p2 (NOT p1))))]
Knowledge based reduction with 3 factoid took 339 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1)]
Stuttering acceptance computed with spot in 106 ms :[(AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1)]
Stuttering acceptance computed with spot in 116 ms :[(AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1)]
Product exploration explored 100000 steps with 11177 reset in 1450 ms.
Product exploration explored 100000 steps with 11306 reset in 1467 ms.
Applying partial POR strategy [false, false, true]
Stuttering acceptance computed with spot in 116 ms :[(AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1)]
Support contains 95 out of 255 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 255/255 places, 470/470 transitions.
Applied a total of 0 rules in 6 ms. Remains 255 /255 variables (removed 0) and now considering 470/470 (removed 0) transitions.
[2024-06-01 17:48:55] [INFO ] Redundant transitions in 3 ms returned []
Running 460 sub problems to find dead transitions.
[2024-06-01 17:48:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (OVERLAPS) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
No progress, stopping.
After SMT solving in domain Real declared 725/725 variables, and 277 constraints, problems are : Problem set: 0 solved, 460 unsolved in 25204 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 460/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/725 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 725/725 variables, and 737 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
After SMT, in 56086ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 56093ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 56109 ms. Remains : 255/255 places, 470/470 transitions.
Support contains 95 out of 255 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 470/470 transitions.
Applied a total of 0 rules in 1 ms. Remains 255 /255 variables (removed 0) and now considering 470/470 (removed 0) transitions.
[2024-06-01 17:49:51] [INFO ] Invariant cache hit.
[2024-06-01 17:49:51] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-06-01 17:49:52] [INFO ] Invariant cache hit.
[2024-06-01 17:49:52] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 396 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2024-06-01 17:49:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (OVERLAPS) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
No progress, stopping.
After SMT solving in domain Real declared 725/725 variables, and 277 constraints, problems are : Problem set: 0 solved, 460 unsolved in 25302 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 460/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/725 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 2)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 725/725 variables, and 737 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
After SMT, in 56203ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 56209ms
Finished structural reductions in LTL mode , in 1 iterations and 56608 ms. Remains : 255/255 places, 470/470 transitions.
Treatment of property UtilityControlRoom-COL-Z4T3N10-LTLFireability-00 finished in 235176 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||(p1&&X(X(X(X(F(p0)))))))))'
Found a Shortening insensitive property : UtilityControlRoom-COL-Z4T3N10-LTLFireability-02
Stuttering acceptance computed with spot in 183 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 210 out of 375 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 0 with 120 rules applied. Total rules applied 120 place count 315 transition count 530
Applied a total of 120 rules in 10 ms. Remains 315 /375 variables (removed 60) and now considering 530/590 (removed 60) transitions.
// Phase 1: matrix 530 rows 315 cols
[2024-06-01 17:50:48] [INFO ] Computed 22 invariants in 5 ms
[2024-06-01 17:50:49] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-06-01 17:50:49] [INFO ] Invariant cache hit.
[2024-06-01 17:50:49] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 489 ms to find 0 implicit places.
Running 490 sub problems to find dead transitions.
[2024-06-01 17:50:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/305 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 2 (OVERLAPS) 10/315 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/315 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 4 (OVERLAPS) 530/845 variables, 315/337 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/845 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 490 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (OVERLAPS) 0/845 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 490 unsolved
No progress, stopping.
After SMT solving in domain Real declared 845/845 variables, and 337 constraints, problems are : Problem set: 0 solved, 490 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 315/315 constraints, PredecessorRefiner: 490/490 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 490 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/305 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 2 (OVERLAPS) 10/315 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/315 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 4 (OVERLAPS) 530/845 variables, 315/337 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/845 variables, 490/827 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/845 variables, 0/827 constraints. Problems are: Problem set: 0 solved, 490 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 845/845 variables, and 827 constraints, problems are : Problem set: 0 solved, 490 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 315/315 constraints, PredecessorRefiner: 490/490 constraints, Known Traps: 0/0 constraints]
After SMT, in 61294ms problems are : Problem set: 0 solved, 490 unsolved
Search for dead transitions found 0 dead transitions in 61300ms
Starting structural reductions in LI_LTL mode, iteration 1 : 315/375 places, 530/590 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 61801 ms. Remains : 315/375 places, 530/590 transitions.
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N10-LTLFireability-02
Product exploration explored 100000 steps with 19995 reset in 634 ms.
Product exploration explored 100000 steps with 19991 reset in 661 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 86 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 78 steps (0 resets) in 5 ms. (13 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 178 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 50 out of 315 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 315/315 places, 530/530 transitions.
Applied a total of 0 rules in 1 ms. Remains 315 /315 variables (removed 0) and now considering 530/530 (removed 0) transitions.
[2024-06-01 17:51:52] [INFO ] Invariant cache hit.
[2024-06-01 17:51:52] [INFO ] Implicit Places using invariants in 150 ms returned []
[2024-06-01 17:51:52] [INFO ] Invariant cache hit.
[2024-06-01 17:51:53] [INFO ] Implicit Places using invariants and state equation in 343 ms returned []
Implicit Place search using SMT with State Equation took 495 ms to find 0 implicit places.
Running 490 sub problems to find dead transitions.
[2024-06-01 17:51:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/305 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 2 (OVERLAPS) 10/315 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/315 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 4 (OVERLAPS) 530/845 variables, 315/337 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/845 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 490 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (OVERLAPS) 0/845 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 490 unsolved
No progress, stopping.
After SMT solving in domain Real declared 845/845 variables, and 337 constraints, problems are : Problem set: 0 solved, 490 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 315/315 constraints, PredecessorRefiner: 490/490 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 490 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/305 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 2 (OVERLAPS) 10/315 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/315 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 4 (OVERLAPS) 530/845 variables, 315/337 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/845 variables, 490/827 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/845 variables, 0/827 constraints. Problems are: Problem set: 0 solved, 490 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 845/845 variables, and 827 constraints, problems are : Problem set: 0 solved, 490 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 315/315 constraints, PredecessorRefiner: 490/490 constraints, Known Traps: 0/0 constraints]
After SMT, in 61205ms problems are : Problem set: 0 solved, 490 unsolved
Search for dead transitions found 0 dead transitions in 61214ms
Finished structural reductions in LTL mode , in 1 iterations and 61713 ms. Remains : 315/315 places, 530/530 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 75 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 100 steps (0 resets) in 5 ms. (16 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 96 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 256 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 19995 reset in 409 ms.
Product exploration explored 100000 steps with 19994 reset in 437 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 193 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 50 out of 315 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 315/315 places, 530/530 transitions.
Performed 160 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 160 rules applied. Total rules applied 160 place count 315 transition count 530
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 200 place count 315 transition count 490
Discarding 123 places :
Symmetric choice reduction at 2 with 123 rule applications. Total rules 323 place count 192 transition count 250
Deduced a syphon composed of 40 places in 0 ms
Ensure Unique test removed 1 places
Iterating global reduction 2 with 124 rules applied. Total rules applied 447 place count 191 transition count 250
Deduced a syphon composed of 40 places in 0 ms
Applied a total of 447 rules in 18 ms. Remains 191 /315 variables (removed 124) and now considering 250/530 (removed 280) transitions.
[2024-06-01 17:52:56] [INFO ] Redundant transitions in 0 ms returned []
Running 210 sub problems to find dead transitions.
// Phase 1: matrix 250 rows 191 cols
[2024-06-01 17:52:56] [INFO ] Computed 21 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 17:52:57] [INFO ] Deduced a trap composed of 81 places in 70 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (OVERLAPS) 10/191 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 17:53:00] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-06-01 17:53:00] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
Problem TDEAD1 is UNSAT
[2024-06-01 17:53:00] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-06-01 17:53:00] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-06-01 17:53:00] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-06-01 17:53:00] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-06-01 17:53:00] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-06-01 17:53:00] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
Problem TDEAD7 is UNSAT
[2024-06-01 17:53:00] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
Problem TDEAD8 is UNSAT
[2024-06-01 17:53:00] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 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
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 10/32 constraints. Problems are: Problem set: 40 solved, 170 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 0/32 constraints. Problems are: Problem set: 40 solved, 170 unsolved
At refinement iteration 6 (OVERLAPS) 250/441 variables, 191/223 constraints. Problems are: Problem set: 40 solved, 170 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/441 variables, 0/223 constraints. Problems are: Problem set: 40 solved, 170 unsolved
At refinement iteration 8 (OVERLAPS) 0/441 variables, 0/223 constraints. Problems are: Problem set: 40 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Real declared 441/441 variables, and 223 constraints, problems are : Problem set: 40 solved, 170 unsolved in 9237 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 191/191 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 40 solved, 170 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 1/1 constraints. Problems are: Problem set: 40 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 0/1 constraints. Problems are: Problem set: 40 solved, 170 unsolved
At refinement iteration 2 (OVERLAPS) 50/191 variables, 21/22 constraints. Problems are: Problem set: 40 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 10/32 constraints. Problems are: Problem set: 40 solved, 170 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/32 constraints. Problems are: Problem set: 40 solved, 170 unsolved
At refinement iteration 5 (OVERLAPS) 250/441 variables, 191/223 constraints. Problems are: Problem set: 40 solved, 170 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/441 variables, 170/393 constraints. Problems are: Problem set: 40 solved, 170 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/441 variables, 0/393 constraints. Problems are: Problem set: 40 solved, 170 unsolved
At refinement iteration 8 (OVERLAPS) 0/441 variables, 0/393 constraints. Problems are: Problem set: 40 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Int declared 441/441 variables, and 393 constraints, problems are : Problem set: 40 solved, 170 unsolved in 7927 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 191/191 constraints, PredecessorRefiner: 170/210 constraints, Known Traps: 11/11 constraints]
After SMT, in 17279ms problems are : Problem set: 40 solved, 170 unsolved
Search for dead transitions found 40 dead transitions in 17281ms
Found 40 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 40 transitions
Dead transitions reduction (with SMT) removed 40 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 191/315 places, 210/530 transitions.
Graph (complete) has 300 edges and 191 vertex of which 151 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Discarding 40 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 151 /191 variables (removed 40) and now considering 210/210 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 151/315 places, 210/530 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 17312 ms. Remains : 151/315 places, 210/530 transitions.
Support contains 50 out of 315 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 315/315 places, 530/530 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 195 transition count 410
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 195 transition count 410
Applied a total of 240 rules in 4 ms. Remains 195 /315 variables (removed 120) and now considering 410/530 (removed 120) transitions.
// Phase 1: matrix 410 rows 195 cols
[2024-06-01 17:53:13] [INFO ] Computed 22 invariants in 2 ms
[2024-06-01 17:53:14] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-06-01 17:53:14] [INFO ] Invariant cache hit.
[2024-06-01 17:53:14] [INFO ] Implicit Places using invariants and state equation in 289 ms returned []
Implicit Place search using SMT with State Equation took 426 ms to find 0 implicit places.
Running 370 sub problems to find dead transitions.
[2024-06-01 17:53:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 2 (OVERLAPS) 10/195 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 4 (OVERLAPS) 410/605 variables, 195/217 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/605 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 6 (OVERLAPS) 0/605 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 370 unsolved
No progress, stopping.
After SMT solving in domain Real declared 605/605 variables, and 217 constraints, problems are : Problem set: 0 solved, 370 unsolved in 16351 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 195/195 constraints, PredecessorRefiner: 370/370 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 370 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 2 (OVERLAPS) 10/195 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 4 (OVERLAPS) 410/605 variables, 195/217 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/605 variables, 370/587 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/605 variables, 0/587 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 7 (OVERLAPS) 0/605 variables, 0/587 constraints. Problems are: Problem set: 0 solved, 370 unsolved
No progress, stopping.
After SMT solving in domain Int declared 605/605 variables, and 587 constraints, problems are : Problem set: 0 solved, 370 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 195/195 constraints, PredecessorRefiner: 370/370 constraints, Known Traps: 0/0 constraints]
After SMT, in 47549ms problems are : Problem set: 0 solved, 370 unsolved
Search for dead transitions found 0 dead transitions in 47554ms
Starting structural reductions in LTL mode, iteration 1 : 195/315 places, 410/530 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47987 ms. Remains : 195/315 places, 410/530 transitions.
Treatment of property UtilityControlRoom-COL-Z4T3N10-LTLFireability-02 finished in 193446 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(X(G((X(p0) U !p1)))) U G(p2))))'
Found a Lengthening insensitive property : UtilityControlRoom-COL-Z4T3N10-LTLFireability-05
Stuttering acceptance computed with spot in 163 ms :[(NOT p2), (NOT p2), p1, p1]
Support contains 215 out of 375 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 40 Pre rules applied. Total rules applied 0 place count 375 transition count 550
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 0 with 80 rules applied. Total rules applied 80 place count 335 transition count 550
Applied a total of 80 rules in 9 ms. Remains 335 /375 variables (removed 40) and now considering 550/590 (removed 40) transitions.
// Phase 1: matrix 550 rows 335 cols
[2024-06-01 17:54:02] [INFO ] Computed 22 invariants in 5 ms
[2024-06-01 17:54:02] [INFO ] Implicit Places using invariants in 157 ms returned []
[2024-06-01 17:54:02] [INFO ] Invariant cache hit.
[2024-06-01 17:54:02] [INFO ] Implicit Places using invariants and state equation in 359 ms returned []
Implicit Place search using SMT with State Equation took 545 ms to find 0 implicit places.
Running 540 sub problems to find dead transitions.
[2024-06-01 17:54:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/325 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/325 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 2 (OVERLAPS) 10/335 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/335 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 4 (OVERLAPS) 550/885 variables, 335/357 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/885 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 540 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 885/885 variables, and 357 constraints, problems are : Problem set: 0 solved, 540 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 335/335 constraints, PredecessorRefiner: 540/540 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 540 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/325 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/325 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 2 (OVERLAPS) 10/335 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/335 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 4 (OVERLAPS) 550/885 variables, 335/357 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/885 variables, 540/897 constraints. Problems are: Problem set: 0 solved, 540 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 885/885 variables, and 897 constraints, problems are : Problem set: 0 solved, 540 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 335/335 constraints, PredecessorRefiner: 540/540 constraints, Known Traps: 0/0 constraints]
After SMT, in 61081ms problems are : Problem set: 0 solved, 540 unsolved
Search for dead transitions found 0 dead transitions in 61087ms
Starting structural reductions in LI_LTL mode, iteration 1 : 335/375 places, 550/590 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 61646 ms. Remains : 335/375 places, 550/590 transitions.
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N10-LTLFireability-05
Product exploration explored 100000 steps with 1723 reset in 745 ms.
Product exploration explored 100000 steps with 1778 reset in 768 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 p2) p1 (NOT p0)), (X (NOT p2)), (X (AND (NOT p2) p1)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1))))]
Knowledge based reduction with 6 factoid took 221 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(NOT p2), (NOT p2), p1, p1]
RANDOM walk for 158 steps (0 resets) in 8 ms. (17 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2)), (X (AND (NOT p2) p1)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (F p2), (F (NOT p1)), (F p0)]
Knowledge based reduction with 6 factoid took 283 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(NOT p2), (NOT p2), p1, p1]
Stuttering acceptance computed with spot in 144 ms :[(NOT p2), (NOT p2), p1, p1]
[2024-06-01 17:55:06] [INFO ] Invariant cache hit.
[2024-06-01 17:55:08] [INFO ] [Real]Absence check using 22 positive place invariants in 26 ms returned sat
[2024-06-01 17:55:08] [INFO ] [Real]Absence check using state equation in 676 ms returned sat
[2024-06-01 17:55:08] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 17:55:10] [INFO ] [Nat]Absence check using 22 positive place invariants in 20 ms returned sat
[2024-06-01 17:55:11] [INFO ] [Nat]Absence check using state equation in 498 ms returned sat
[2024-06-01 17:55:11] [INFO ] Computed and/alt/rep : 540/1010/540 causal constraints (skipped 0 transitions) in 42 ms.
[2024-06-01 17:55:14] [INFO ] Added : 433 causal constraints over 87 iterations in 3565 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 215 out of 335 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 335/335 places, 550/550 transitions.
Applied a total of 0 rules in 2 ms. Remains 335 /335 variables (removed 0) and now considering 550/550 (removed 0) transitions.
[2024-06-01 17:55:14] [INFO ] Invariant cache hit.
[2024-06-01 17:55:14] [INFO ] Implicit Places using invariants in 203 ms returned []
[2024-06-01 17:55:14] [INFO ] Invariant cache hit.
[2024-06-01 17:55:15] [INFO ] Implicit Places using invariants and state equation in 652 ms returned []
Implicit Place search using SMT with State Equation took 868 ms to find 0 implicit places.
Running 540 sub problems to find dead transitions.
[2024-06-01 17:55:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/325 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/325 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 2 (OVERLAPS) 10/335 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/335 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 4 (OVERLAPS) 550/885 variables, 335/357 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/885 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 540 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 885/885 variables, and 357 constraints, problems are : Problem set: 0 solved, 540 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 335/335 constraints, PredecessorRefiner: 540/540 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 540 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/325 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/325 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 2 (OVERLAPS) 10/335 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/335 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 4 (OVERLAPS) 550/885 variables, 335/357 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/885 variables, 540/897 constraints. Problems are: Problem set: 0 solved, 540 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 885/885 variables, and 897 constraints, problems are : Problem set: 0 solved, 540 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 335/335 constraints, PredecessorRefiner: 540/540 constraints, Known Traps: 0/0 constraints]
After SMT, in 60962ms problems are : Problem set: 0 solved, 540 unsolved
Search for dead transitions found 0 dead transitions in 60969ms
Finished structural reductions in LTL mode , in 1 iterations and 61842 ms. Remains : 335/335 places, 550/550 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) p1 (NOT p0)), (X (NOT p2)), (X (X p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2)))]
Knowledge based reduction with 3 factoid took 147 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(NOT p2), (NOT p2), p1, p1]
RANDOM walk for 155 steps (0 resets) in 6 ms. (22 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2)), (X (X p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (F p2), (F (NOT p1)), (F p0)]
Knowledge based reduction with 3 factoid took 215 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(NOT p2), (NOT p2), p1, p1]
Stuttering acceptance computed with spot in 144 ms :[(NOT p2), (NOT p2), p1, p1]
[2024-06-01 17:56:17] [INFO ] Invariant cache hit.
[2024-06-01 17:56:19] [INFO ] [Real]Absence check using 22 positive place invariants in 24 ms returned sat
[2024-06-01 17:56:19] [INFO ] [Real]Absence check using state equation in 620 ms returned sat
[2024-06-01 17:56:19] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 17:56:21] [INFO ] [Nat]Absence check using 22 positive place invariants in 19 ms returned sat
[2024-06-01 17:56:22] [INFO ] [Nat]Absence check using state equation in 467 ms returned sat
[2024-06-01 17:56:22] [INFO ] Computed and/alt/rep : 540/1010/540 causal constraints (skipped 0 transitions) in 45 ms.
[2024-06-01 17:56:25] [INFO ] Added : 433 causal constraints over 87 iterations in 3565 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 142 ms :[(NOT p2), (NOT p2), p1, p1]
Product exploration explored 100000 steps with 1719 reset in 701 ms.
Product exploration explored 100000 steps with 1708 reset in 717 ms.
Support contains 215 out of 335 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 335/335 places, 550/550 transitions.
Applied a total of 0 rules in 14 ms. Remains 335 /335 variables (removed 0) and now considering 550/550 (removed 0) transitions.
[2024-06-01 17:56:27] [INFO ] Invariant cache hit.
[2024-06-01 17:56:27] [INFO ] Implicit Places using invariants in 152 ms returned []
[2024-06-01 17:56:27] [INFO ] Invariant cache hit.
[2024-06-01 17:56:27] [INFO ] Implicit Places using invariants and state equation in 372 ms returned []
Implicit Place search using SMT with State Equation took 554 ms to find 0 implicit places.
Running 540 sub problems to find dead transitions.
[2024-06-01 17:56:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/325 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/325 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 2 (OVERLAPS) 10/335 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/335 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 4 (OVERLAPS) 550/885 variables, 335/357 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/885 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 540 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 885/885 variables, and 357 constraints, problems are : Problem set: 0 solved, 540 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 335/335 constraints, PredecessorRefiner: 540/540 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 540 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/325 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/325 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 2 (OVERLAPS) 10/335 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/335 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 4 (OVERLAPS) 550/885 variables, 335/357 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/885 variables, 540/897 constraints. Problems are: Problem set: 0 solved, 540 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 885/885 variables, and 897 constraints, problems are : Problem set: 0 solved, 540 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 335/335 constraints, PredecessorRefiner: 540/540 constraints, Known Traps: 0/0 constraints]
After SMT, in 60914ms problems are : Problem set: 0 solved, 540 unsolved
Search for dead transitions found 0 dead transitions in 60921ms
Finished structural reductions in LTL mode , in 1 iterations and 61492 ms. Remains : 335/335 places, 550/550 transitions.
Treatment of property UtilityControlRoom-COL-Z4T3N10-LTLFireability-05 finished in 206823 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((G(!p1)||p0))) U p1)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||(F(p0)&&p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&G(F(p1))))))'
Found a Shortening insensitive property : UtilityControlRoom-COL-Z4T3N10-LTLFireability-09
Stuttering acceptance computed with spot in 223 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Support contains 95 out of 375 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Performed 160 Post agglomeration using F-continuation condition.Transition count delta: 160
Iterating post reduction 0 with 160 rules applied. Total rules applied 160 place count 375 transition count 430
Reduce places removed 160 places and 0 transitions.
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 360 place count 215 transition count 390
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 380 place count 205 transition count 380
Applied a total of 380 rules in 43 ms. Remains 205 /375 variables (removed 170) and now considering 380/590 (removed 210) transitions.
// Phase 1: matrix 380 rows 205 cols
[2024-06-01 17:57:29] [INFO ] Computed 22 invariants in 2 ms
[2024-06-01 17:57:29] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-06-01 17:57:29] [INFO ] Invariant cache hit.
[2024-06-01 17:57:29] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
Running 330 sub problems to find dead transitions.
[2024-06-01 17:57:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 2 (OVERLAPS) 10/205 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 4 (OVERLAPS) 380/585 variables, 205/227 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/585 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 6 (OVERLAPS) 0/585 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 330 unsolved
No progress, stopping.
After SMT solving in domain Real declared 585/585 variables, and 227 constraints, problems are : Problem set: 0 solved, 330 unsolved in 15082 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 330/330 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 330 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 2 (OVERLAPS) 10/205 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 4 (OVERLAPS) 380/585 variables, 205/227 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/585 variables, 330/557 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/585 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 7 (OVERLAPS) 0/585 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 330 unsolved
No progress, stopping.
After SMT solving in domain Int declared 585/585 variables, and 557 constraints, problems are : Problem set: 0 solved, 330 unsolved in 25897 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 330/330 constraints, Known Traps: 0/0 constraints]
After SMT, in 41494ms problems are : Problem set: 0 solved, 330 unsolved
Search for dead transitions found 0 dead transitions in 41498ms
Starting structural reductions in LI_LTL mode, iteration 1 : 205/375 places, 380/590 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 41814 ms. Remains : 205/375 places, 380/590 transitions.
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N10-LTLFireability-09
Product exploration explored 100000 steps with 7661 reset in 746 ms.
Product exploration explored 100000 steps with 7654 reset in 773 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 128 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 5 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1), (X (X p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 187 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 136 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 138 ms :[(NOT p1), (NOT p1)]
Support contains 45 out of 205 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 205/205 places, 380/380 transitions.
Applied a total of 0 rules in 8 ms. Remains 205 /205 variables (removed 0) and now considering 380/380 (removed 0) transitions.
[2024-06-01 17:58:13] [INFO ] Invariant cache hit.
[2024-06-01 17:58:13] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-06-01 17:58:13] [INFO ] Invariant cache hit.
[2024-06-01 17:58:13] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
[2024-06-01 17:58:13] [INFO ] Redundant transitions in 1 ms returned []
Running 330 sub problems to find dead transitions.
[2024-06-01 17:58:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 2 (OVERLAPS) 10/205 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 4 (OVERLAPS) 380/585 variables, 205/227 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/585 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 6 (OVERLAPS) 0/585 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 330 unsolved
No progress, stopping.
After SMT solving in domain Real declared 585/585 variables, and 227 constraints, problems are : Problem set: 0 solved, 330 unsolved in 15839 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 330/330 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 330 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 2 (OVERLAPS) 10/205 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 4 (OVERLAPS) 380/585 variables, 205/227 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/585 variables, 330/557 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/585 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 7 (OVERLAPS) 0/585 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 330 unsolved
No progress, stopping.
After SMT solving in domain Int declared 585/585 variables, and 557 constraints, problems are : Problem set: 0 solved, 330 unsolved in 26216 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 330/330 constraints, Known Traps: 0/0 constraints]
After SMT, in 42650ms problems are : Problem set: 0 solved, 330 unsolved
Search for dead transitions found 0 dead transitions in 42654ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 43005 ms. Remains : 205/205 places, 380/380 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 : [p1]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 173 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 5 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [p1]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 298 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 131 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 7893 reset in 949 ms.
Product exploration explored 100000 steps with 7888 reset in 973 ms.
Support contains 45 out of 205 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 205/205 places, 380/380 transitions.
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 40 Pre rules applied. Total rules applied 0 place count 205 transition count 340
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 0 with 80 rules applied. Total rules applied 80 place count 165 transition count 340
Applied a total of 80 rules in 7 ms. Remains 165 /205 variables (removed 40) and now considering 340/380 (removed 40) transitions.
// Phase 1: matrix 340 rows 165 cols
[2024-06-01 17:58:59] [INFO ] Computed 22 invariants in 1 ms
[2024-06-01 17:58:59] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-06-01 17:58:59] [INFO ] Invariant cache hit.
[2024-06-01 17:58:59] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
[2024-06-01 17:58:59] [INFO ] Redundant transitions in 1 ms returned []
Running 290 sub problems to find dead transitions.
[2024-06-01 17:58:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (OVERLAPS) 10/165 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (OVERLAPS) 340/505 variables, 165/187 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/505 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (OVERLAPS) 0/505 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 290 unsolved
No progress, stopping.
After SMT solving in domain Real declared 505/505 variables, and 187 constraints, problems are : Problem set: 0 solved, 290 unsolved in 11222 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 290 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (OVERLAPS) 10/165 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (OVERLAPS) 340/505 variables, 165/187 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/505 variables, 290/477 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/505 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 7 (OVERLAPS) 0/505 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 290 unsolved
No progress, stopping.
After SMT solving in domain Int declared 505/505 variables, and 477 constraints, problems are : Problem set: 0 solved, 290 unsolved in 19579 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 0/0 constraints]
After SMT, in 31405ms problems are : Problem set: 0 solved, 290 unsolved
Search for dead transitions found 0 dead transitions in 31408ms
Starting structural reductions in SI_LTL mode, iteration 1 : 165/205 places, 340/380 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 31757 ms. Remains : 165/205 places, 340/380 transitions.
Treatment of property UtilityControlRoom-COL-Z4T3N10-LTLFireability-09 finished in 122024 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G(!p1)&&X(F(p0)))))'
Found a Shortening insensitive property : UtilityControlRoom-COL-Z4T3N10-LTLFireability-14
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) p1), p1, (NOT p0)]
Support contains 55 out of 375 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Performed 160 Post agglomeration using F-continuation condition.Transition count delta: 160
Iterating post reduction 0 with 160 rules applied. Total rules applied 160 place count 375 transition count 430
Reduce places removed 160 places and 0 transitions.
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 360 place count 215 transition count 390
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 360 place count 215 transition count 350
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 440 place count 175 transition count 350
Applied a total of 440 rules in 20 ms. Remains 175 /375 variables (removed 200) and now considering 350/590 (removed 240) transitions.
// Phase 1: matrix 350 rows 175 cols
[2024-06-01 17:59:31] [INFO ] Computed 22 invariants in 2 ms
[2024-06-01 17:59:31] [INFO ] Implicit Places using invariants in 202 ms returned []
[2024-06-01 17:59:31] [INFO ] Invariant cache hit.
[2024-06-01 17:59:31] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 513 ms to find 0 implicit places.
Running 340 sub problems to find dead transitions.
[2024-06-01 17:59:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 2 (OVERLAPS) 10/175 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 4 (OVERLAPS) 350/525 variables, 175/197 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/525 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 6 (OVERLAPS) 0/525 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 340 unsolved
No progress, stopping.
After SMT solving in domain Real declared 525/525 variables, and 197 constraints, problems are : Problem set: 0 solved, 340 unsolved in 13354 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 340/340 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 340 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 2 (OVERLAPS) 10/175 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 4 (OVERLAPS) 350/525 variables, 175/197 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/525 variables, 340/537 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/525 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 7 (OVERLAPS) 0/525 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 340 unsolved
No progress, stopping.
After SMT solving in domain Int declared 525/525 variables, and 537 constraints, problems are : Problem set: 0 solved, 340 unsolved in 26827 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 340/340 constraints, Known Traps: 0/0 constraints]
After SMT, in 40835ms problems are : Problem set: 0 solved, 340 unsolved
Search for dead transitions found 0 dead transitions in 40839ms
Starting structural reductions in LI_LTL mode, iteration 1 : 175/375 places, 350/590 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 41375 ms. Remains : 175/375 places, 350/590 transitions.
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N10-LTLFireability-14
Product exploration explored 100000 steps with 2285 reset in 1529 ms.
Product exploration explored 100000 steps with 2234 reset in 1553 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (OR (NOT p0) p1)), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1))]
False Knowledge obtained : [(X (X (OR (NOT p0) p1))), (X (X (NOT (OR (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 266 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) p1), p1, (NOT p0)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 12 steps (0 resets) in 5 ms. (2 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (OR (NOT p0) p1)), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1))]
False Knowledge obtained : [(X (X (OR (NOT p0) p1))), (X (X (NOT (OR (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) p1))), (F p0)]
Knowledge based reduction with 5 factoid took 415 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p0) p1), p1, (NOT p0)]
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p0) p1), p1, (NOT p0)]
[2024-06-01 18:00:16] [INFO ] Invariant cache hit.
[2024-06-01 18:00:18] [INFO ] [Real]Absence check using 22 positive place invariants in 18 ms returned sat
[2024-06-01 18:00:18] [INFO ] [Real]Absence check using state equation in 322 ms returned sat
[2024-06-01 18:00:18] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 18:00:20] [INFO ] [Nat]Absence check using 22 positive place invariants in 17 ms returned sat
[2024-06-01 18:00:20] [INFO ] [Nat]Absence check using state equation in 222 ms returned sat
[2024-06-01 18:00:20] [INFO ] Computed and/alt/rep : 340/730/340 causal constraints (skipped 0 transitions) in 37 ms.
[2024-06-01 18:00:21] [INFO ] Added : 243 causal constraints over 49 iterations in 1238 ms. Result :sat
Could not prove EG (NOT p0)
[2024-06-01 18:00:21] [INFO ] Invariant cache hit.
[2024-06-01 18:00:21] [INFO ] [Real]Absence check using 22 positive place invariants in 17 ms returned sat
[2024-06-01 18:00:21] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2024-06-01 18:00:21] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 18:00:22] [INFO ] [Nat]Absence check using 22 positive place invariants in 14 ms returned sat
[2024-06-01 18:00:22] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2024-06-01 18:00:22] [INFO ] Computed and/alt/rep : 340/730/340 causal constraints (skipped 0 transitions) in 23 ms.
[2024-06-01 18:00:22] [INFO ] Added : 0 causal constraints over 0 iterations in 50 ms. Result :sat
Could not prove EG p1
Support contains 55 out of 175 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 350/350 transitions.
Applied a total of 0 rules in 1 ms. Remains 175 /175 variables (removed 0) and now considering 350/350 (removed 0) transitions.
[2024-06-01 18:00:22] [INFO ] Invariant cache hit.
[2024-06-01 18:00:22] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-06-01 18:00:22] [INFO ] Invariant cache hit.
[2024-06-01 18:00:22] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
Running 340 sub problems to find dead transitions.
[2024-06-01 18:00:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 2 (OVERLAPS) 10/175 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 4 (OVERLAPS) 350/525 variables, 175/197 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/525 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 6 (OVERLAPS) 0/525 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 340 unsolved
No progress, stopping.
After SMT solving in domain Real declared 525/525 variables, and 197 constraints, problems are : Problem set: 0 solved, 340 unsolved in 13520 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 340/340 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 340 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 2 (OVERLAPS) 10/175 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 4 (OVERLAPS) 350/525 variables, 175/197 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/525 variables, 340/537 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/525 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 7 (OVERLAPS) 0/525 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 340 unsolved
No progress, stopping.
After SMT solving in domain Int declared 525/525 variables, and 537 constraints, problems are : Problem set: 0 solved, 340 unsolved in 24740 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 340/340 constraints, Known Traps: 0/0 constraints]
After SMT, in 38837ms problems are : Problem set: 0 solved, 340 unsolved
Search for dead transitions found 0 dead transitions in 38841ms
Finished structural reductions in LTL mode , in 1 iterations and 39150 ms. Remains : 175/175 places, 350/350 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) p1), (X (OR (NOT p0) p1)), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1))]
False Knowledge obtained : [(X (X (OR (NOT p0) p1))), (X (X (NOT (OR (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 294 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) p1), p1, (NOT p0)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 17 steps (0 resets) in 7 ms. (2 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (OR (NOT p0) p1)), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1))]
False Knowledge obtained : [(X (X (OR (NOT p0) p1))), (X (X (NOT (OR (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) p1))), (F p0)]
Knowledge based reduction with 5 factoid took 363 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) p1), p1, (NOT p0)]
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) p1), p1, (NOT p0)]
[2024-06-01 18:01:02] [INFO ] Invariant cache hit.
[2024-06-01 18:01:03] [INFO ] [Real]Absence check using 22 positive place invariants in 18 ms returned sat
[2024-06-01 18:01:04] [INFO ] [Real]Absence check using state equation in 316 ms returned sat
[2024-06-01 18:01:04] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 18:01:05] [INFO ] [Nat]Absence check using 22 positive place invariants in 15 ms returned sat
[2024-06-01 18:01:05] [INFO ] [Nat]Absence check using state equation in 208 ms returned sat
[2024-06-01 18:01:05] [INFO ] Computed and/alt/rep : 340/730/340 causal constraints (skipped 0 transitions) in 26 ms.
[2024-06-01 18:01:07] [INFO ] Added : 243 causal constraints over 49 iterations in 1298 ms. Result :sat
Could not prove EG (NOT p0)
[2024-06-01 18:01:07] [INFO ] Invariant cache hit.
[2024-06-01 18:01:07] [INFO ] [Real]Absence check using 22 positive place invariants in 17 ms returned sat
[2024-06-01 18:01:07] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2024-06-01 18:01:07] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 18:01:07] [INFO ] [Nat]Absence check using 22 positive place invariants in 16 ms returned sat
[2024-06-01 18:01:07] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2024-06-01 18:01:08] [INFO ] Computed and/alt/rep : 340/730/340 causal constraints (skipped 0 transitions) in 63 ms.
[2024-06-01 18:01:08] [INFO ] Added : 0 causal constraints over 0 iterations in 116 ms. Result :sat
Could not prove EG p1
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) p1), p1, (NOT p0)]
Product exploration explored 100000 steps with 2209 reset in 1516 ms.
Product exploration explored 100000 steps with 2233 reset in 1529 ms.
Applying partial POR strategy [false, false, true]
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p0) p1), p1, (NOT p0)]
Support contains 55 out of 175 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 175/175 places, 350/350 transitions.
Applied a total of 0 rules in 11 ms. Remains 175 /175 variables (removed 0) and now considering 350/350 (removed 0) transitions.
[2024-06-01 18:01:11] [INFO ] Redundant transitions in 1 ms returned []
Running 340 sub problems to find dead transitions.
[2024-06-01 18:01:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 2 (OVERLAPS) 10/175 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 4 (OVERLAPS) 350/525 variables, 175/197 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/525 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 6 (OVERLAPS) 0/525 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 340 unsolved
No progress, stopping.
After SMT solving in domain Real declared 525/525 variables, and 197 constraints, problems are : Problem set: 0 solved, 340 unsolved in 13507 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 340/340 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 340 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 2 (OVERLAPS) 10/175 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 4 (OVERLAPS) 350/525 variables, 175/197 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/525 variables, 340/537 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/525 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 7 (OVERLAPS) 0/525 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 340 unsolved
No progress, stopping.
After SMT solving in domain Int declared 525/525 variables, and 537 constraints, problems are : Problem set: 0 solved, 340 unsolved in 25770 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 340/340 constraints, Known Traps: 0/0 constraints]
After SMT, in 39885ms problems are : Problem set: 0 solved, 340 unsolved
Search for dead transitions found 0 dead transitions in 39890ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 39920 ms. Remains : 175/175 places, 350/350 transitions.
Support contains 55 out of 175 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 350/350 transitions.
Applied a total of 0 rules in 1 ms. Remains 175 /175 variables (removed 0) and now considering 350/350 (removed 0) transitions.
[2024-06-01 18:01:51] [INFO ] Invariant cache hit.
[2024-06-01 18:01:51] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-06-01 18:01:51] [INFO ] Invariant cache hit.
[2024-06-01 18:01:51] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 407 ms to find 0 implicit places.
Running 340 sub problems to find dead transitions.
[2024-06-01 18:01:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 2 (OVERLAPS) 10/175 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 4 (OVERLAPS) 350/525 variables, 175/197 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/525 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 6 (OVERLAPS) 0/525 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 340 unsolved
No progress, stopping.
After SMT solving in domain Real declared 525/525 variables, and 197 constraints, problems are : Problem set: 0 solved, 340 unsolved in 13526 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 340/340 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 340 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 2 (OVERLAPS) 10/175 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 4 (OVERLAPS) 350/525 variables, 175/197 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/525 variables, 340/537 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/525 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 7 (OVERLAPS) 0/525 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 340 unsolved
No progress, stopping.
After SMT solving in domain Int declared 525/525 variables, and 537 constraints, problems are : Problem set: 0 solved, 340 unsolved in 25837 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 340/340 constraints, Known Traps: 0/0 constraints]
After SMT, in 39922ms problems are : Problem set: 0 solved, 340 unsolved
Search for dead transitions found 0 dead transitions in 39927ms
Finished structural reductions in LTL mode , in 1 iterations and 40336 ms. Remains : 175/175 places, 350/350 transitions.
Treatment of property UtilityControlRoom-COL-Z4T3N10-LTLFireability-14 finished in 180727 ms.
[2024-06-01 18:02:31] [INFO ] Flatten gal took : 58 ms
[2024-06-01 18:02:31] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/LTLFireability.sr.xml took 23 ms.
[2024-06-01 18:02:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 375 places, 590 transitions and 1720 arcs took 10 ms.
Total runtime 2529033 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : UtilityControlRoom-COL-Z4T3N10-LTLFireability-00
Could not compute solution for formula : UtilityControlRoom-COL-Z4T3N10-LTLFireability-02
Could not compute solution for formula : UtilityControlRoom-COL-Z4T3N10-LTLFireability-05
Could not compute solution for formula : UtilityControlRoom-COL-Z4T3N10-LTLFireability-06
Could not compute solution for formula : UtilityControlRoom-COL-Z4T3N10-LTLFireability-08
Could not compute solution for formula : UtilityControlRoom-COL-Z4T3N10-LTLFireability-09
Could not compute solution for formula : UtilityControlRoom-COL-Z4T3N10-LTLFireability-14

BK_STOP 1717265466029

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name UtilityControlRoom-COL-Z4T3N10-LTLFireability-00
ltl formula formula --ltl=/tmp/4002/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 375 places, 590 transitions and 1720 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.080 real 0.000 user 0.030 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4002/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4002/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4002/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4002/ltl_0_
pnml2lts-mc( 3/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
ltl formula name UtilityControlRoom-COL-Z4T3N10-LTLFireability-02
ltl formula formula --ltl=/tmp/4002/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 375 places, 590 transitions and 1720 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.020 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4002/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4002/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4002/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4002/ltl_1_
pnml2lts-mc( 2/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
pnml2lts-mc( 1/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
malloc_consolidate(): unaligned fastbin chunk detected
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): unaligned fastbin chunk detected
ltl formula name UtilityControlRoom-COL-Z4T3N10-LTLFireability-05
ltl formula formula --ltl=/tmp/4002/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 375 places, 590 transitions and 1720 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.010 user 0.030 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4002/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4002/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4002/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4002/ltl_2_
pnml2lts-mc( 3/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 1/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): unaligned fastbin chunk detected
malloc_consolidate(): unaligned fastbin chunk detected
ltl formula name UtilityControlRoom-COL-Z4T3N10-LTLFireability-06
ltl formula formula --ltl=/tmp/4002/ltl_3_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 375 places, 590 transitions and 1720 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.010 user 0.030 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4002/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4002/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4002/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4002/ltl_3_
pnml2lts-mc( 2/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 3/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
corrupted size vs. prev_size in fastbins
corrupted size vs. prev_size in fastbins
pnml2lts-mc( 1/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
ltl formula name UtilityControlRoom-COL-Z4T3N10-LTLFireability-08
ltl formula formula --ltl=/tmp/4002/ltl_4_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 375 places, 590 transitions and 1720 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.020 user 0.020 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4002/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4002/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4002/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4002/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 377 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 376, there are 602 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~44 levels ~10000 states ~19640 transitions
pnml2lts-mc( 3/ 4): ~44 levels ~20000 states ~37564 transitions
pnml2lts-mc( 3/ 4): ~44 levels ~40000 states ~74924 transitions
pnml2lts-mc( 3/ 4): ~44 levels ~80000 states ~166120 transitions
pnml2lts-mc( 3/ 4): ~44 levels ~160000 states ~344728 transitions
pnml2lts-mc( 3/ 4): ~44 levels ~320000 states ~688144 transitions
pnml2lts-mc( 2/ 4): ~43 levels ~640000 states ~1950928 transitions
pnml2lts-mc( 2/ 4): ~43 levels ~1280000 states ~3986668 transitions
pnml2lts-mc( 2/ 4): ~43 levels ~2560000 states ~8869300 transitions
pnml2lts-mc( 2/ 4): ~43 levels ~5120000 states ~18365728 transitions
pnml2lts-mc( 2/ 4): ~43 levels ~10240000 states ~37010008 transitions
pnml2lts-mc( 2/ 4): ~43 levels ~20480000 states ~76520408 transitions
ltl formula name UtilityControlRoom-COL-Z4T3N10-LTLFireability-09
ltl formula formula --ltl=/tmp/4002/ltl_5_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 375 places, 590 transitions and 1720 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4002/ltl_5_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4002/ltl_5_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4002/ltl_5_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.120 real 0.040 user 0.020 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4002/ltl_5_
pnml2lts-mc( 1/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): unaligned fastbin chunk detected
ltl formula name UtilityControlRoom-COL-Z4T3N10-LTLFireability-14
ltl formula formula --ltl=/tmp/4002/ltl_6_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 375 places, 590 transitions and 1720 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.120 real 0.020 user 0.030 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4002/ltl_6_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4002/ltl_6_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4002/ltl_6_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4002/ltl_6_
pnml2lts-mc( 1/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
pnml2lts-mc( 2/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
pnml2lts-mc( 0/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:

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-Z4T3N10"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is UtilityControlRoom-COL-Z4T3N10, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r544-smll-171701110700100"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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