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-171701110600044.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-Z2T4N02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r544-smll-171701110600044
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 7.0K Apr 13 05:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Apr 13 05:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 13 05:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 13 05:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Apr 23 08:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 08:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K 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 14K Apr 13 05:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Apr 13 05:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 13 05:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Apr 13 05:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 08:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 23 08:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 8 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 29K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME UtilityControlRoom-COL-Z2T4N02-LTLFireability-00
FORMULA_NAME UtilityControlRoom-COL-Z2T4N02-LTLFireability-01
FORMULA_NAME UtilityControlRoom-COL-Z2T4N02-LTLFireability-02
FORMULA_NAME UtilityControlRoom-COL-Z2T4N02-LTLFireability-03
FORMULA_NAME UtilityControlRoom-COL-Z2T4N02-LTLFireability-04
FORMULA_NAME UtilityControlRoom-COL-Z2T4N02-LTLFireability-05
FORMULA_NAME UtilityControlRoom-COL-Z2T4N02-LTLFireability-06
FORMULA_NAME UtilityControlRoom-COL-Z2T4N02-LTLFireability-07
FORMULA_NAME UtilityControlRoom-COL-Z2T4N02-LTLFireability-08
FORMULA_NAME UtilityControlRoom-COL-Z2T4N02-LTLFireability-09
FORMULA_NAME UtilityControlRoom-COL-Z2T4N02-LTLFireability-10
FORMULA_NAME UtilityControlRoom-COL-Z2T4N02-LTLFireability-11
FORMULA_NAME UtilityControlRoom-COL-Z2T4N02-LTLFireability-12
FORMULA_NAME UtilityControlRoom-COL-Z2T4N02-LTLFireability-13
FORMULA_NAME UtilityControlRoom-COL-Z2T4N02-LTLFireability-14
FORMULA_NAME UtilityControlRoom-COL-Z2T4N02-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717258664038

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-Z2T4N02
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 16:17:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 16:17:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 16:17:46] [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 16:17:46] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 16:17:47] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1029 ms
[2024-06-01 16:17:47] [INFO ] Imported 13 HL places and 12 HL transitions for a total of 38 PT places and 54.0 transition bindings in 26 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
[2024-06-01 16:17:47] [INFO ] Built PT skeleton of HLPN with 13 places and 12 transitions 37 arcs in 6 ms.
[2024-06-01 16:17:47] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 2 formulas.
FORMULA UtilityControlRoom-COL-Z2T4N02-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z2T4N02-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 14 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 11 to 10
RANDOM walk for 1637 steps (0 resets) in 105 ms. (15 steps per ms) remains 0/10 properties
[2024-06-01 16:17:47] [INFO ] Flatten gal took : 22 ms
[2024-06-01 16:17:47] [INFO ] Flatten gal took : 5 ms
Transition timeout forces synchronizations/join behavior on parameter c of sort Cli
Domain [Cli(2), Z(2), Z(2)] of place MovetoZ breaks symmetries in sort Z
[2024-06-01 16:17:47] [INFO ] Unfolded HLPN to a Petri net with 38 places and 54 transitions 170 arcs in 23 ms.
[2024-06-01 16:17:47] [INFO ] Unfolded 14 HLPN properties in 0 ms.
[2024-06-01 16:17:47] [INFO ] Reduced 2 identical enabling conditions.
[2024-06-01 16:17:47] [INFO ] Reduced 2 identical enabling conditions.
[2024-06-01 16:17:47] [INFO ] Reduced 2 identical enabling conditions.
Ensure Unique test removed 8 transitions
Reduce redundant transitions removed 8 transitions.
Support contains 27 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 46/46 transitions.
Applied a total of 0 rules in 9 ms. Remains 38 /38 variables (removed 0) and now considering 46/46 (removed 0) transitions.
// Phase 1: matrix 46 rows 38 cols
[2024-06-01 16:17:47] [INFO ] Computed 7 invariants in 12 ms
[2024-06-01 16:17:47] [INFO ] Implicit Places using invariants in 224 ms returned [27]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 275 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 37/38 places, 46/46 transitions.
Applied a total of 0 rules in 1 ms. Remains 37 /37 variables (removed 0) and now considering 46/46 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 321 ms. Remains : 37/38 places, 46/46 transitions.
Support contains 27 out of 37 places after structural reductions.
[2024-06-01 16:17:48] [INFO ] Flatten gal took : 12 ms
[2024-06-01 16:17:48] [INFO ] Flatten gal took : 14 ms
[2024-06-01 16:17:48] [INFO ] Input system was already deterministic with 46 transitions.
Reduction of identical properties reduced properties to check from 16 to 12
RANDOM walk for 704 steps (0 resets) in 19 ms. (35 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(G(p0)))'
Support contains 4 out of 37 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 46/46 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 33 transition count 42
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 33 transition count 42
Applied a total of 8 rules in 12 ms. Remains 33 /37 variables (removed 4) and now considering 42/46 (removed 4) transitions.
// Phase 1: matrix 42 rows 33 cols
[2024-06-01 16:17:48] [INFO ] Computed 6 invariants in 5 ms
[2024-06-01 16:17:48] [INFO ] Implicit Places using invariants in 80 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 83 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 32/37 places, 42/46 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 98 ms. Remains : 32/37 places, 42/46 transitions.
Stuttering acceptance computed with spot in 263 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N02-LTLFireability-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA UtilityControlRoom-COL-Z2T4N02-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z2T4N02-LTLFireability-00 finished in 452 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 (G(!p0)||(X(X(G(p2)))&&p1))))'
Support contains 9 out of 37 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 46/46 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 33 transition count 42
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 33 transition count 42
Applied a total of 8 rules in 3 ms. Remains 33 /37 variables (removed 4) and now considering 42/46 (removed 4) transitions.
[2024-06-01 16:17:48] [INFO ] Invariant cache hit.
[2024-06-01 16:17:49] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-06-01 16:17:49] [INFO ] Invariant cache hit.
[2024-06-01 16:17:49] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
Running 40 sub problems to find dead transitions.
[2024-06-01 16:17:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 2/33 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 42/75 variables, 33/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 0/75 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 75/75 variables, and 39 constraints, problems are : Problem set: 0 solved, 40 unsolved in 957 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 33/33 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/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 2/33 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 42/75 variables, 33/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 40/79 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 0/75 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 75/75 variables, and 79 constraints, problems are : Problem set: 0 solved, 40 unsolved in 762 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
After SMT, in 1792ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1804ms
Starting structural reductions in LTL mode, iteration 1 : 33/37 places, 42/46 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1961 ms. Remains : 33/37 places, 42/46 transitions.
Stuttering acceptance computed with spot in 266 ms :[true, (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (NOT p2), (AND p0 (NOT p2)), (NOT p2), (AND p0 (NOT p2))]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N02-LTLFireability-01
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z2T4N02-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z2T4N02-LTLFireability-01 finished in 2248 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)))'
Support contains 6 out of 37 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 46/46 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 33 transition count 42
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 33 transition count 42
Applied a total of 8 rules in 3 ms. Remains 33 /37 variables (removed 4) and now considering 42/46 (removed 4) transitions.
[2024-06-01 16:17:51] [INFO ] Invariant cache hit.
[2024-06-01 16:17:51] [INFO ] Implicit Places using invariants in 53 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 65 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 32/37 places, 42/46 transitions.
Applied a total of 0 rules in 0 ms. Remains 32 /32 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 69 ms. Remains : 32/37 places, 42/46 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N02-LTLFireability-02
Product exploration explored 100000 steps with 1651 reset in 346 ms.
Stack based approach found an accepted trace after 179 steps with 5 reset with depth 69 and stack size 69 in 2 ms.
FORMULA UtilityControlRoom-COL-Z2T4N02-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z2T4N02-LTLFireability-02 finished in 530 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U !p1)))'
Support contains 17 out of 37 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 46/46 transitions.
Applied a total of 0 rules in 2 ms. Remains 37 /37 variables (removed 0) and now considering 46/46 (removed 0) transitions.
// Phase 1: matrix 46 rows 37 cols
[2024-06-01 16:17:51] [INFO ] Computed 6 invariants in 2 ms
[2024-06-01 16:17:51] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-06-01 16:17:51] [INFO ] Invariant cache hit.
[2024-06-01 16:17:51] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
Running 44 sub problems to find dead transitions.
[2024-06-01 16:17:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 2/37 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 46/83 variables, 37/43 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (OVERLAPS) 0/83 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 83/83 variables, and 43 constraints, problems are : Problem set: 0 solved, 44 unsolved in 730 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 37/37 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 2/37 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 46/83 variables, 37/43 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 44/87 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 0/83 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 83/83 variables, and 87 constraints, problems are : Problem set: 0 solved, 44 unsolved in 776 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 37/37 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
After SMT, in 1534ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 1536ms
Finished structural reductions in LTL mode , in 1 iterations and 1673 ms. Remains : 37/37 places, 46/46 transitions.
Stuttering acceptance computed with spot in 101 ms :[p1, p1, true]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N02-LTLFireability-03
Product exploration explored 100000 steps with 50000 reset in 173 ms.
Product exploration explored 100000 steps with 50000 reset in 242 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 36 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z2T4N02-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z2T4N02-LTLFireability-03 finished in 2255 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 7 out of 37 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 46/46 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 33 transition count 42
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 33 transition count 42
Applied a total of 8 rules in 2 ms. Remains 33 /37 variables (removed 4) and now considering 42/46 (removed 4) transitions.
// Phase 1: matrix 42 rows 33 cols
[2024-06-01 16:17:53] [INFO ] Computed 6 invariants in 1 ms
[2024-06-01 16:17:54] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-06-01 16:17:54] [INFO ] Invariant cache hit.
[2024-06-01 16:17:54] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
Running 40 sub problems to find dead transitions.
[2024-06-01 16:17:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 2/33 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 42/75 variables, 33/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 0/75 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 75/75 variables, and 39 constraints, problems are : Problem set: 0 solved, 40 unsolved in 629 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 33/33 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/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 2/33 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 42/75 variables, 33/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 40/79 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 0/75 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 75/75 variables, and 79 constraints, problems are : Problem set: 0 solved, 40 unsolved in 753 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
After SMT, in 1407ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1408ms
Starting structural reductions in LTL mode, iteration 1 : 33/37 places, 42/46 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1513 ms. Remains : 33/37 places, 42/46 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N02-LTLFireability-04
Product exploration explored 100000 steps with 26993 reset in 108 ms.
Product exploration explored 100000 steps with 26953 reset in 305 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 128 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 11 steps (0 resets) in 5 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 162 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-06-01 16:17:56] [INFO ] Invariant cache hit.
[2024-06-01 16:17:56] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-06-01 16:17:56] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-06-01 16:17:56] [INFO ] Computed and/alt/rep : 40/62/40 causal constraints (skipped 0 transitions) in 6 ms.
[2024-06-01 16:17:56] [INFO ] Added : 2 causal constraints over 1 iterations in 21 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 7 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2024-06-01 16:17:56] [INFO ] Invariant cache hit.
[2024-06-01 16:17:56] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-06-01 16:17:56] [INFO ] Invariant cache hit.
[2024-06-01 16:17:56] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
Running 40 sub problems to find dead transitions.
[2024-06-01 16:17:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 2/33 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 42/75 variables, 33/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 0/75 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 75/75 variables, and 39 constraints, problems are : Problem set: 0 solved, 40 unsolved in 599 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 33/33 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/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 2/33 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 42/75 variables, 33/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 40/79 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 0/75 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 75/75 variables, and 79 constraints, problems are : Problem set: 0 solved, 40 unsolved in 743 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
After SMT, in 1358ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1367ms
Finished structural reductions in LTL mode , in 1 iterations and 1457 ms. Remains : 33/33 places, 42/42 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 127 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 11 steps (0 resets) in 5 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 151 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-06-01 16:17:58] [INFO ] Invariant cache hit.
[2024-06-01 16:17:59] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-06-01 16:17:59] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-06-01 16:17:59] [INFO ] Computed and/alt/rep : 40/62/40 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 16:17:59] [INFO ] Added : 2 causal constraints over 1 iterations in 19 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 26989 reset in 269 ms.
Product exploration explored 100000 steps with 26986 reset in 243 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 7 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 42/42 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 33 transition count 46
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 33 transition count 46
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 33 transition count 46
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 12 place count 33 transition count 42
Deduced a syphon composed of 8 places in 0 ms
Applied a total of 12 rules in 18 ms. Remains 33 /33 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2024-06-01 16:18:00] [INFO ] Redundant transitions in 0 ms returned []
Running 40 sub problems to find dead transitions.
// Phase 1: matrix 42 rows 33 cols
[2024-06-01 16:18:00] [INFO ] Computed 6 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 16:18:00] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 13 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (OVERLAPS) 2/33 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 16:18:00] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 2 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-06-01 16:18:00] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 2 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 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
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 2/9 constraints. Problems are: Problem set: 12 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/9 constraints. Problems are: Problem set: 12 solved, 28 unsolved
At refinement iteration 6 (OVERLAPS) 42/75 variables, 33/42 constraints. Problems are: Problem set: 12 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/75 variables, 0/42 constraints. Problems are: Problem set: 12 solved, 28 unsolved
At refinement iteration 8 (OVERLAPS) 0/75 variables, 0/42 constraints. Problems are: Problem set: 12 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 75/75 variables, and 42 constraints, problems are : Problem set: 12 solved, 28 unsolved in 764 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 12 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 1/1 constraints. Problems are: Problem set: 12 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 12 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 10/33 variables, 6/7 constraints. Problems are: Problem set: 12 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 2/9 constraints. Problems are: Problem set: 12 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/9 constraints. Problems are: Problem set: 12 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 42/75 variables, 33/42 constraints. Problems are: Problem set: 12 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 28/70 constraints. Problems are: Problem set: 12 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/75 variables, 0/70 constraints. Problems are: Problem set: 12 solved, 28 unsolved
At refinement iteration 8 (OVERLAPS) 0/75 variables, 0/70 constraints. Problems are: Problem set: 12 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 75/75 variables, and 70 constraints, problems are : Problem set: 12 solved, 28 unsolved in 487 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 28/40 constraints, Known Traps: 3/3 constraints]
After SMT, in 1270ms problems are : Problem set: 12 solved, 28 unsolved
Search for dead transitions found 12 dead transitions in 1272ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 33/33 places, 30/42 transitions.
Graph (complete) has 50 edges and 33 vertex of which 25 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 25 /33 variables (removed 8) and now considering 30/30 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 25/33 places, 30/42 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1304 ms. Remains : 25/33 places, 30/42 transitions.
Support contains 7 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 42/42 transitions.
Applied a total of 0 rules in 3 ms. Remains 33 /33 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 33 cols
[2024-06-01 16:18:01] [INFO ] Computed 6 invariants in 2 ms
[2024-06-01 16:18:01] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-06-01 16:18:01] [INFO ] Invariant cache hit.
[2024-06-01 16:18:01] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
Running 40 sub problems to find dead transitions.
[2024-06-01 16:18:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 2/33 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 42/75 variables, 33/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 0/75 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 75/75 variables, and 39 constraints, problems are : Problem set: 0 solved, 40 unsolved in 695 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 33/33 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/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 2/33 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 42/75 variables, 33/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 40/79 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 0/75 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 75/75 variables, and 79 constraints, problems are : Problem set: 0 solved, 40 unsolved in 692 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
After SMT, in 1403ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1404ms
Finished structural reductions in LTL mode , in 1 iterations and 1525 ms. Remains : 33/33 places, 42/42 transitions.
Treatment of property UtilityControlRoom-COL-Z2T4N02-LTLFireability-04 finished in 9020 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 13 out of 37 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 37/37 places, 46/46 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 37 transition count 38
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 29 transition count 34
Applied a total of 20 rules in 9 ms. Remains 29 /37 variables (removed 8) and now considering 34/46 (removed 12) transitions.
// Phase 1: matrix 34 rows 29 cols
[2024-06-01 16:18:03] [INFO ] Computed 6 invariants in 1 ms
[2024-06-01 16:18:03] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-06-01 16:18:03] [INFO ] Invariant cache hit.
[2024-06-01 16:18:03] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2024-06-01 16:18:03] [INFO ] Redundant transitions in 1 ms returned []
Running 32 sub problems to find dead transitions.
[2024-06-01 16:18:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (OVERLAPS) 2/29 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 34/63 variables, 29/35 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 0/63 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 63/63 variables, and 35 constraints, problems are : Problem set: 0 solved, 32 unsolved in 466 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 29/29 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (OVERLAPS) 2/29 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 34/63 variables, 29/35 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 32/67 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 0/63 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 63/63 variables, and 67 constraints, problems are : Problem set: 0 solved, 32 unsolved in 486 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 29/29 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
After SMT, in 962ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 963ms
Starting structural reductions in SI_LTL mode, iteration 1 : 29/37 places, 34/46 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1053 ms. Remains : 29/37 places, 34/46 transitions.
Stuttering acceptance computed with spot in 231 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N02-LTLFireability-05
Product exploration explored 100000 steps with 0 reset in 201 ms.
Stack based approach found an accepted trace after 39 steps with 0 reset with depth 40 and stack size 40 in 1 ms.
FORMULA UtilityControlRoom-COL-Z2T4N02-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z2T4N02-LTLFireability-05 finished in 1501 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((G(F(p1))||p0))))'
Support contains 13 out of 37 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 46/46 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 33 transition count 42
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 33 transition count 42
Applied a total of 8 rules in 3 ms. Remains 33 /37 variables (removed 4) and now considering 42/46 (removed 4) transitions.
// Phase 1: matrix 42 rows 33 cols
[2024-06-01 16:18:04] [INFO ] Computed 6 invariants in 3 ms
[2024-06-01 16:18:04] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-06-01 16:18:04] [INFO ] Invariant cache hit.
[2024-06-01 16:18:04] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
Running 40 sub problems to find dead transitions.
[2024-06-01 16:18:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 2/33 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 42/75 variables, 33/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 0/75 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 75/75 variables, and 39 constraints, problems are : Problem set: 0 solved, 40 unsolved in 712 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 33/33 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/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 2/33 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 42/75 variables, 33/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 40/79 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 0/75 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 75/75 variables, and 79 constraints, problems are : Problem set: 0 solved, 40 unsolved in 672 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
After SMT, in 1395ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1396ms
Starting structural reductions in LTL mode, iteration 1 : 33/37 places, 42/46 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1492 ms. Remains : 33/37 places, 42/46 transitions.
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N02-LTLFireability-06
Product exploration explored 100000 steps with 28465 reset in 136 ms.
Product exploration explored 100000 steps with 28509 reset in 252 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 (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 249 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
RANDOM walk for 38 steps (0 resets) in 5 ms. (6 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F p0), (F (NOT (OR p1 p0))), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT (OR p1 (NOT p0))))]
Knowledge based reduction with 4 factoid took 371 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
Support contains 13 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 42/42 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 29 transition count 38
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 12 place count 29 transition count 34
Applied a total of 12 rules in 7 ms. Remains 29 /33 variables (removed 4) and now considering 34/42 (removed 8) transitions.
// Phase 1: matrix 34 rows 29 cols
[2024-06-01 16:18:07] [INFO ] Computed 6 invariants in 0 ms
[2024-06-01 16:18:07] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-06-01 16:18:07] [INFO ] Invariant cache hit.
[2024-06-01 16:18:07] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2024-06-01 16:18:07] [INFO ] Redundant transitions in 1 ms returned []
Running 32 sub problems to find dead transitions.
[2024-06-01 16:18:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (OVERLAPS) 2/29 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 34/63 variables, 29/35 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 0/63 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 63/63 variables, and 35 constraints, problems are : Problem set: 0 solved, 32 unsolved in 512 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 29/29 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (OVERLAPS) 2/29 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 34/63 variables, 29/35 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 32/67 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 0/63 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 63/63 variables, and 67 constraints, problems are : Problem set: 0 solved, 32 unsolved in 458 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 29/29 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
After SMT, in 980ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 980ms
Starting structural reductions in SI_LTL mode, iteration 1 : 29/33 places, 34/42 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1073 ms. Remains : 29/33 places, 34/42 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (NOT p1)), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 7 factoid took 429 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
RANDOM walk for 130 steps (0 resets) in 5 ms. (21 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (NOT p1)), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 7 factoid took 506 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 215 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Product exploration explored 100000 steps with 28465 reset in 180 ms.
Product exploration explored 100000 steps with 28517 reset in 196 ms.
Support contains 13 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 34/34 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 34/34 (removed 0) transitions.
[2024-06-01 16:18:10] [INFO ] Invariant cache hit.
[2024-06-01 16:18:11] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-06-01 16:18:11] [INFO ] Invariant cache hit.
[2024-06-01 16:18:11] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2024-06-01 16:18:11] [INFO ] Redundant transitions in 1 ms returned []
Running 32 sub problems to find dead transitions.
[2024-06-01 16:18:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (OVERLAPS) 2/29 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 34/63 variables, 29/35 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 0/63 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 63/63 variables, and 35 constraints, problems are : Problem set: 0 solved, 32 unsolved in 473 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 29/29 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (OVERLAPS) 2/29 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 34/63 variables, 29/35 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 32/67 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 0/63 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 63/63 variables, and 67 constraints, problems are : Problem set: 0 solved, 32 unsolved in 533 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 29/29 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
After SMT, in 1014ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 1015ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1105 ms. Remains : 29/29 places, 34/34 transitions.
Treatment of property UtilityControlRoom-COL-Z2T4N02-LTLFireability-06 finished in 7607 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)) U ((p1 U p2)||X(p3))))'
Support contains 18 out of 37 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 46/46 transitions.
Applied a total of 0 rules in 1 ms. Remains 37 /37 variables (removed 0) and now considering 46/46 (removed 0) transitions.
// Phase 1: matrix 46 rows 37 cols
[2024-06-01 16:18:12] [INFO ] Computed 6 invariants in 0 ms
[2024-06-01 16:18:12] [INFO ] Implicit Places using invariants in 45 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 46 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 36/37 places, 46/46 transitions.
Applied a total of 0 rules in 1 ms. Remains 36 /36 variables (removed 0) and now considering 46/46 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 48 ms. Remains : 36/37 places, 46/46 transitions.
Stuttering acceptance computed with spot in 343 ms :[(AND (NOT p2) (NOT p3)), (AND p0 (NOT p3)), (AND (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3)), true, p0, (NOT p2), (AND p0 (NOT p2))]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N02-LTLFireability-08
Entered a terminal (fully accepting) state of product in 14 steps with 1 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z2T4N02-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z2T4N02-LTLFireability-08 finished in 413 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((F(p1)||p0)) U G(p2)))'
Support contains 15 out of 37 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 37/37 places, 46/46 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 37 transition count 38
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 29 transition count 34
Applied a total of 20 rules in 4 ms. Remains 29 /37 variables (removed 8) and now considering 34/46 (removed 12) transitions.
// Phase 1: matrix 34 rows 29 cols
[2024-06-01 16:18:12] [INFO ] Computed 6 invariants in 2 ms
[2024-06-01 16:18:12] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-06-01 16:18:12] [INFO ] Invariant cache hit.
[2024-06-01 16:18:12] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2024-06-01 16:18:12] [INFO ] Redundant transitions in 1 ms returned []
Running 32 sub problems to find dead transitions.
[2024-06-01 16:18:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (OVERLAPS) 2/29 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 34/63 variables, 29/35 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 0/63 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 63/63 variables, and 35 constraints, problems are : Problem set: 0 solved, 32 unsolved in 466 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 29/29 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (OVERLAPS) 2/29 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 34/63 variables, 29/35 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 32/67 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 0/63 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 63/63 variables, and 67 constraints, problems are : Problem set: 0 solved, 32 unsolved in 480 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 29/29 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
After SMT, in 957ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 958ms
Starting structural reductions in SI_LTL mode, iteration 1 : 29/37 places, 34/46 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1039 ms. Remains : 29/37 places, 34/46 transitions.
Stuttering acceptance computed with spot in 181 ms :[(NOT p2), (NOT p1), (AND (NOT p1) p2 (NOT p0)), (AND (NOT p1) (NOT p2) p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N02-LTLFireability-09
Product exploration explored 100000 steps with 37079 reset in 248 ms.
Product exploration explored 100000 steps with 37001 reset in 318 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 p0) (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (NOT (AND p2 p0 (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND p2 p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 12 factoid took 416 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 186 ms :[(NOT p2), (NOT p1), (AND (NOT p1) p2 (NOT p0)), (AND (NOT p1) (NOT p2) p0)]
RANDOM walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (NOT (AND p2 p0 (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND p2 p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p0), (F (NOT (OR p2 (NOT p0) p1))), (F (NOT (OR (NOT p2) (NOT p0) p1))), (F p1), (F p2), (F (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p2) p0 p1)))]
Knowledge based reduction with 12 factoid took 735 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 204 ms :[(NOT p2), (NOT p1), (AND (NOT p1) p2 (NOT p0)), (AND (NOT p1) (NOT p2) p0)]
Stuttering acceptance computed with spot in 215 ms :[(NOT p2), (NOT p1), (AND (NOT p1) p2 (NOT p0)), (AND (NOT p1) (NOT p2) p0)]
[2024-06-01 16:18:16] [INFO ] Invariant cache hit.
[2024-06-01 16:18:16] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-06-01 16:18:16] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-06-01 16:18:16] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:18:16] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-06-01 16:18:16] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-06-01 16:18:16] [INFO ] Computed and/alt/rep : 32/50/32 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 16:18:16] [INFO ] Added : 6 causal constraints over 2 iterations in 20 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 15 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 34/34 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 34/34 (removed 0) transitions.
[2024-06-01 16:18:16] [INFO ] Invariant cache hit.
[2024-06-01 16:18:16] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-06-01 16:18:16] [INFO ] Invariant cache hit.
[2024-06-01 16:18:16] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2024-06-01 16:18:16] [INFO ] Redundant transitions in 1 ms returned []
Running 32 sub problems to find dead transitions.
[2024-06-01 16:18:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (OVERLAPS) 2/29 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 34/63 variables, 29/35 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 0/63 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 63/63 variables, and 35 constraints, problems are : Problem set: 0 solved, 32 unsolved in 431 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 29/29 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (OVERLAPS) 2/29 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 34/63 variables, 29/35 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 32/67 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 0/63 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 63/63 variables, and 67 constraints, problems are : Problem set: 0 solved, 32 unsolved in 541 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 29/29 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
After SMT, in 982ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 982ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1066 ms. Remains : 29/29 places, 34/34 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) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (NOT (AND p2 p0 (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND p2 p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 12 factoid took 416 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 173 ms :[(NOT p2), (NOT p1), (AND (NOT p1) p2 (NOT p0)), (AND (NOT p1) (NOT p2) p0)]
RANDOM walk for 189 steps (0 resets) in 8 ms. (21 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (NOT (AND p2 p0 (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND p2 p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p0), (F (NOT (OR p2 (NOT p0) p1))), (F (NOT (OR (NOT p2) (NOT p0) p1))), (F p1), (F p2), (F (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p2) p0 p1)))]
Knowledge based reduction with 12 factoid took 761 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 183 ms :[(NOT p2), (NOT p1), (AND (NOT p1) p2 (NOT p0)), (AND (NOT p1) (NOT p2) p0)]
Stuttering acceptance computed with spot in 171 ms :[(NOT p2), (NOT p1), (AND (NOT p1) p2 (NOT p0)), (AND (NOT p1) (NOT p2) p0)]
[2024-06-01 16:18:19] [INFO ] Invariant cache hit.
[2024-06-01 16:18:19] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-06-01 16:18:19] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-06-01 16:18:19] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:18:19] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-06-01 16:18:19] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-06-01 16:18:19] [INFO ] Computed and/alt/rep : 32/50/32 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 16:18:19] [INFO ] Added : 6 causal constraints over 2 iterations in 15 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 325 ms :[(NOT p2), (NOT p1), (AND (NOT p1) p2 (NOT p0)), (AND (NOT p1) (NOT p2) p0)]
Product exploration explored 100000 steps with 36893 reset in 215 ms.
Stack based approach found an accepted trace after 62430 steps with 23099 reset with depth 7 and stack size 7 in 146 ms.
FORMULA UtilityControlRoom-COL-Z2T4N02-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z2T4N02-LTLFireability-09 finished in 7451 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) U X(!p1))))'
Support contains 15 out of 37 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 46/46 transitions.
Applied a total of 0 rules in 1 ms. Remains 37 /37 variables (removed 0) and now considering 46/46 (removed 0) transitions.
// Phase 1: matrix 46 rows 37 cols
[2024-06-01 16:18:19] [INFO ] Computed 6 invariants in 1 ms
[2024-06-01 16:18:20] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-06-01 16:18:20] [INFO ] Invariant cache hit.
[2024-06-01 16:18:20] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
Running 44 sub problems to find dead transitions.
[2024-06-01 16:18:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 2/37 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 46/83 variables, 37/43 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (OVERLAPS) 0/83 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 83/83 variables, and 43 constraints, problems are : Problem set: 0 solved, 44 unsolved in 770 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 37/37 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 2/37 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 46/83 variables, 37/43 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 44/87 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 0/83 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 83/83 variables, and 87 constraints, problems are : Problem set: 0 solved, 44 unsolved in 862 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 37/37 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
After SMT, in 1642ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 1643ms
Finished structural reductions in LTL mode , in 1 iterations and 1742 ms. Remains : 37/37 places, 46/46 transitions.
Stuttering acceptance computed with spot in 216 ms :[p1, p1, p1, p1, true, (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N02-LTLFireability-10
Product exploration explored 100000 steps with 33333 reset in 112 ms.
Product exploration explored 100000 steps with 33333 reset in 119 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 18 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z2T4N02-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z2T4N02-LTLFireability-10 finished in 2233 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 7 out of 37 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 46/46 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 33 transition count 42
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 33 transition count 42
Applied a total of 8 rules in 3 ms. Remains 33 /37 variables (removed 4) and now considering 42/46 (removed 4) transitions.
// Phase 1: matrix 42 rows 33 cols
[2024-06-01 16:18:22] [INFO ] Computed 6 invariants in 1 ms
[2024-06-01 16:18:22] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-06-01 16:18:22] [INFO ] Invariant cache hit.
[2024-06-01 16:18:22] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
Running 40 sub problems to find dead transitions.
[2024-06-01 16:18:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 2/33 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 42/75 variables, 33/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 0/75 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 75/75 variables, and 39 constraints, problems are : Problem set: 0 solved, 40 unsolved in 663 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 33/33 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/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 2/33 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 42/75 variables, 33/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 40/79 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 0/75 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 75/75 variables, and 79 constraints, problems are : Problem set: 0 solved, 40 unsolved in 698 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
After SMT, in 1372ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1374ms
Starting structural reductions in LTL mode, iteration 1 : 33/37 places, 42/46 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1462 ms. Remains : 33/37 places, 42/46 transitions.
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N02-LTLFireability-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z2T4N02-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z2T4N02-LTLFireability-11 finished in 1571 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((X(p0)&&G(p1))) U p2)))'
Support contains 9 out of 37 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 46/46 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 33 transition count 42
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 33 transition count 42
Applied a total of 8 rules in 1 ms. Remains 33 /37 variables (removed 4) and now considering 42/46 (removed 4) transitions.
[2024-06-01 16:18:23] [INFO ] Invariant cache hit.
[2024-06-01 16:18:23] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-06-01 16:18:23] [INFO ] Invariant cache hit.
[2024-06-01 16:18:23] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
Running 40 sub problems to find dead transitions.
[2024-06-01 16:18:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 2/33 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 42/75 variables, 33/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 0/75 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 75/75 variables, and 39 constraints, problems are : Problem set: 0 solved, 40 unsolved in 692 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 33/33 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/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 2/33 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 42/75 variables, 33/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 40/79 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 0/75 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 75/75 variables, and 79 constraints, problems are : Problem set: 0 solved, 40 unsolved in 719 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
After SMT, in 1427ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1427ms
Starting structural reductions in LTL mode, iteration 1 : 33/37 places, 42/46 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1515 ms. Remains : 33/37 places, 42/46 transitions.
Stuttering acceptance computed with spot in 216 ms :[(NOT p2), (NOT p2), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N02-LTLFireability-12
Product exploration explored 100000 steps with 50000 reset in 85 ms.
Product exploration explored 100000 steps with 50000 reset in 93 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 p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (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 7 factoid took 16 ms. Reduced automaton from 5 states, 13 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z2T4N02-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z2T4N02-LTLFireability-12 finished in 1951 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!p0)))'
Support contains 7 out of 37 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 37/37 places, 46/46 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 37 transition count 38
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 29 transition count 34
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 20 place count 29 transition count 30
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 28 place count 25 transition count 30
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 32 place count 23 transition count 28
Applied a total of 32 rules in 7 ms. Remains 23 /37 variables (removed 14) and now considering 28/46 (removed 18) transitions.
// Phase 1: matrix 28 rows 23 cols
[2024-06-01 16:18:25] [INFO ] Computed 6 invariants in 0 ms
[2024-06-01 16:18:25] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-06-01 16:18:25] [INFO ] Invariant cache hit.
[2024-06-01 16:18:25] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2024-06-01 16:18:25] [INFO ] Redundant transitions in 1 ms returned []
Running 22 sub problems to find dead transitions.
[2024-06-01 16:18:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (OVERLAPS) 2/23 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (OVERLAPS) 28/51 variables, 23/29 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (OVERLAPS) 0/51 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 51/51 variables, and 29 constraints, problems are : Problem set: 0 solved, 22 unsolved in 369 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 23/23 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (OVERLAPS) 2/23 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (OVERLAPS) 28/51 variables, 23/29 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 22/51 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 0/51 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Int declared 51/51 variables, and 51 constraints, problems are : Problem set: 0 solved, 22 unsolved in 360 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 23/23 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints]
After SMT, in 739ms problems are : Problem set: 0 solved, 22 unsolved
Search for dead transitions found 0 dead transitions in 739ms
Starting structural reductions in SI_LTL mode, iteration 1 : 23/37 places, 28/46 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 826 ms. Remains : 23/37 places, 28/46 transitions.
Stuttering acceptance computed with spot in 83 ms :[p0, p0]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N02-LTLFireability-14
Product exploration explored 100000 steps with 13335 reset in 150 ms.
Stack based approach found an accepted trace after 3273 steps with 437 reset with depth 10 and stack size 10 in 5 ms.
FORMULA UtilityControlRoom-COL-Z2T4N02-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z2T4N02-LTLFireability-14 finished in 1079 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(!p1)||p0)))))'
Support contains 4 out of 37 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 46/46 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 33 transition count 42
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 33 transition count 42
Applied a total of 8 rules in 3 ms. Remains 33 /37 variables (removed 4) and now considering 42/46 (removed 4) transitions.
// Phase 1: matrix 42 rows 33 cols
[2024-06-01 16:18:26] [INFO ] Computed 6 invariants in 1 ms
[2024-06-01 16:18:26] [INFO ] Implicit Places using invariants in 51 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 52 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 32/37 places, 42/46 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 57 ms. Remains : 32/37 places, 42/46 transitions.
Stuttering acceptance computed with spot in 118 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N02-LTLFireability-15
Product exploration explored 100000 steps with 7533 reset in 127 ms.
Product exploration explored 100000 steps with 7539 reset in 135 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 (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 247 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
RANDOM walk for 49 steps (0 resets) in 4 ms. (9 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT (OR p0 (NOT p1)))), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 347 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 4 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 32 cols
[2024-06-01 16:18:28] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 16:18:28] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-06-01 16:18:28] [INFO ] Invariant cache hit.
[2024-06-01 16:18:28] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
Running 40 sub problems to find dead transitions.
[2024-06-01 16:18:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 2/32 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 42/74 variables, 32/37 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 0/74 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 74/74 variables, and 37 constraints, problems are : Problem set: 0 solved, 40 unsolved in 710 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 32/32 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/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 2/32 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 42/74 variables, 32/37 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 40/77 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 0/74 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 74/74 variables, and 77 constraints, problems are : Problem set: 0 solved, 40 unsolved in 650 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
After SMT, in 1369ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1370ms
Finished structural reductions in LTL mode , in 1 iterations and 1471 ms. Remains : 32/32 places, 42/42 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 234 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
RANDOM walk for 47 steps (0 resets) in 4 ms. (9 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT (OR p0 (NOT p1)))), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 375 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 7511 reset in 133 ms.
Product exploration explored 100000 steps with 7521 reset in 143 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 4 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 42/42 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 32 transition count 46
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 32 transition count 46
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 0 with 6 rules applied. Total rules applied 10 place count 32 transition count 48
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 14 place count 32 transition count 44
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 31 transition count 40
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 31 transition count 40
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 29 transition count 38
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 29 transition count 38
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 24 place count 25 transition count 30
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 28 place count 25 transition count 30
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 32 place count 21 transition count 26
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 36 place count 21 transition count 26
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 40 place count 21 transition count 22
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 40 rules in 22 ms. Remains 21 /32 variables (removed 11) and now considering 22/42 (removed 20) transitions.
[2024-06-01 16:18:31] [INFO ] Redundant transitions in 0 ms returned []
Running 20 sub problems to find dead transitions.
// Phase 1: matrix 22 rows 21 cols
[2024-06-01 16:18:31] [INFO ] Computed 5 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 16:18:31] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 2/21 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 16:18:31] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD1 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 1/7 constraints. Problems are: Problem set: 4 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/21 variables, 0/7 constraints. Problems are: Problem set: 4 solved, 16 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
At refinement iteration 6 (OVERLAPS) 22/43 variables, 21/28 constraints. Problems are: Problem set: 8 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/28 constraints. Problems are: Problem set: 8 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 0/43 variables, 0/28 constraints. Problems are: Problem set: 8 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 28 constraints, problems are : Problem set: 8 solved, 12 unsolved in 330 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 8 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 1/1 constraints. Problems are: Problem set: 8 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/13 variables, 0/1 constraints. Problems are: Problem set: 8 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 8/21 variables, 5/6 constraints. Problems are: Problem set: 8 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 1/7 constraints. Problems are: Problem set: 8 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/7 constraints. Problems are: Problem set: 8 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 22/43 variables, 21/28 constraints. Problems are: Problem set: 8 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 12/40 constraints. Problems are: Problem set: 8 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/40 constraints. Problems are: Problem set: 8 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 0/43 variables, 0/40 constraints. Problems are: Problem set: 8 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 40 constraints, problems are : Problem set: 8 solved, 12 unsolved in 196 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 12/20 constraints, Known Traps: 2/2 constraints]
After SMT, in 533ms problems are : Problem set: 8 solved, 12 unsolved
Search for dead transitions found 8 dead transitions in 533ms
Found 8 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 8 transitions
Dead transitions reduction (with SMT) removed 8 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 21/32 places, 14/42 transitions.
Graph (complete) has 22 edges and 21 vertex of which 15 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 1 ms. Remains 15 /21 variables (removed 6) and now considering 14/14 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 15/32 places, 14/42 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 564 ms. Remains : 15/32 places, 14/42 transitions.
Support contains 4 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 32 cols
[2024-06-01 16:18:32] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 16:18:32] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-06-01 16:18:32] [INFO ] Invariant cache hit.
[2024-06-01 16:18:32] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
Running 40 sub problems to find dead transitions.
[2024-06-01 16:18:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 2/32 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 42/74 variables, 32/37 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 0/74 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 74/74 variables, and 37 constraints, problems are : Problem set: 0 solved, 40 unsolved in 734 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 32/32 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/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 2/32 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 42/74 variables, 32/37 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 40/77 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 0/74 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 74/74 variables, and 77 constraints, problems are : Problem set: 0 solved, 40 unsolved in 643 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
After SMT, in 1389ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1391ms
Finished structural reductions in LTL mode , in 1 iterations and 1506 ms. Remains : 32/32 places, 42/42 transitions.
Treatment of property UtilityControlRoom-COL-Z2T4N02-LTLFireability-15 finished in 6809 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Found a Shortening insensitive property : UtilityControlRoom-COL-Z2T4N02-LTLFireability-04
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 7 out of 37 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 37/37 places, 46/46 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 37 transition count 38
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 29 transition count 34
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 20 place count 29 transition count 30
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 28 place count 25 transition count 30
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 32 place count 23 transition count 28
Applied a total of 32 rules in 5 ms. Remains 23 /37 variables (removed 14) and now considering 28/46 (removed 18) transitions.
// Phase 1: matrix 28 rows 23 cols
[2024-06-01 16:18:33] [INFO ] Computed 6 invariants in 1 ms
[2024-06-01 16:18:33] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-06-01 16:18:33] [INFO ] Invariant cache hit.
[2024-06-01 16:18:33] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
Running 22 sub problems to find dead transitions.
[2024-06-01 16:18:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (OVERLAPS) 2/23 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (OVERLAPS) 28/51 variables, 23/29 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (OVERLAPS) 0/51 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 51/51 variables, and 29 constraints, problems are : Problem set: 0 solved, 22 unsolved in 374 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 23/23 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (OVERLAPS) 2/23 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (OVERLAPS) 28/51 variables, 23/29 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 22/51 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 0/51 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Int declared 51/51 variables, and 51 constraints, problems are : Problem set: 0 solved, 22 unsolved in 313 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 23/23 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints]
After SMT, in 701ms problems are : Problem set: 0 solved, 22 unsolved
Search for dead transitions found 0 dead transitions in 701ms
Starting structural reductions in LI_LTL mode, iteration 1 : 23/37 places, 28/46 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 792 ms. Remains : 23/37 places, 28/46 transitions.
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N02-LTLFireability-04
Product exploration explored 100000 steps with 22552 reset in 110 ms.
Stack based approach found an accepted trace after 11905 steps with 2698 reset with depth 27 and stack size 27 in 13 ms.
Treatment of property UtilityControlRoom-COL-Z2T4N02-LTLFireability-04 finished in 1183 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
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((G(F(p1))||p0))))'
Found a Shortening insensitive property : UtilityControlRoom-COL-Z2T4N02-LTLFireability-06
Stuttering acceptance computed with spot in 237 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 13 out of 37 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 37/37 places, 46/46 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 37 transition count 38
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 29 transition count 34
Applied a total of 20 rules in 3 ms. Remains 29 /37 variables (removed 8) and now considering 34/46 (removed 12) transitions.
// Phase 1: matrix 34 rows 29 cols
[2024-06-01 16:18:35] [INFO ] Computed 6 invariants in 0 ms
[2024-06-01 16:18:35] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-06-01 16:18:35] [INFO ] Invariant cache hit.
[2024-06-01 16:18:35] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
Running 32 sub problems to find dead transitions.
[2024-06-01 16:18:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (OVERLAPS) 2/29 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 34/63 variables, 29/35 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 0/63 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 63/63 variables, and 35 constraints, problems are : Problem set: 0 solved, 32 unsolved in 481 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 29/29 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (OVERLAPS) 2/29 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 34/63 variables, 29/35 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 32/67 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 0/63 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 63/63 variables, and 67 constraints, problems are : Problem set: 0 solved, 32 unsolved in 516 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 29/29 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
After SMT, in 1006ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 1007ms
Starting structural reductions in LI_LTL mode, iteration 1 : 29/37 places, 34/46 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1083 ms. Remains : 29/37 places, 34/46 transitions.
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N02-LTLFireability-06
Product exploration explored 100000 steps with 28510 reset in 131 ms.
Product exploration explored 100000 steps with 28539 reset in 142 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 (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 265 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
RANDOM walk for 61 steps (0 resets) in 5 ms. (10 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F p0), (F (NOT (OR p1 p0))), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT (OR p1 (NOT p0))))]
Knowledge based reduction with 4 factoid took 404 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 217 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
Support contains 13 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 34/34 transitions.
Applied a total of 0 rules in 2 ms. Remains 29 /29 variables (removed 0) and now considering 34/34 (removed 0) transitions.
[2024-06-01 16:18:37] [INFO ] Invariant cache hit.
[2024-06-01 16:18:37] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-06-01 16:18:37] [INFO ] Invariant cache hit.
[2024-06-01 16:18:37] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2024-06-01 16:18:37] [INFO ] Redundant transitions in 0 ms returned []
Running 32 sub problems to find dead transitions.
[2024-06-01 16:18:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (OVERLAPS) 2/29 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 34/63 variables, 29/35 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 0/63 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 63/63 variables, and 35 constraints, problems are : Problem set: 0 solved, 32 unsolved in 568 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 29/29 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (OVERLAPS) 2/29 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 34/63 variables, 29/35 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 32/67 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 0/63 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 63/63 variables, and 67 constraints, problems are : Problem set: 0 solved, 32 unsolved in 527 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 29/29 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
After SMT, in 1105ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 1105ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1190 ms. Remains : 29/29 places, 34/34 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (NOT p1)), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 7 factoid took 378 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 219 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
RANDOM walk for 66 steps (0 resets) in 5 ms. (11 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (NOT p1)), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 7 factoid took 630 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 211 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Product exploration explored 100000 steps with 28563 reset in 181 ms.
Product exploration explored 100000 steps with 28538 reset in 190 ms.
Support contains 13 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 34/34 transitions.
Applied a total of 0 rules in 2 ms. Remains 29 /29 variables (removed 0) and now considering 34/34 (removed 0) transitions.
[2024-06-01 16:18:41] [INFO ] Invariant cache hit.
[2024-06-01 16:18:41] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-06-01 16:18:41] [INFO ] Invariant cache hit.
[2024-06-01 16:18:41] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2024-06-01 16:18:41] [INFO ] Redundant transitions in 0 ms returned []
Running 32 sub problems to find dead transitions.
[2024-06-01 16:18:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (OVERLAPS) 2/29 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 34/63 variables, 29/35 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 0/63 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 63/63 variables, and 35 constraints, problems are : Problem set: 0 solved, 32 unsolved in 477 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 29/29 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (OVERLAPS) 2/29 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 34/63 variables, 29/35 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 32/67 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 0/63 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 63/63 variables, and 67 constraints, problems are : Problem set: 0 solved, 32 unsolved in 497 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 29/29 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
After SMT, in 981ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 982ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1072 ms. Remains : 29/29 places, 34/34 transitions.
Treatment of property UtilityControlRoom-COL-Z2T4N02-LTLFireability-06 finished in 7602 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(!p1)||p0)))))'
Found a Shortening insensitive property : UtilityControlRoom-COL-Z2T4N02-LTLFireability-15
Stuttering acceptance computed with spot in 118 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Support contains 4 out of 37 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 37/37 places, 46/46 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 37 transition count 38
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 29 transition count 34
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 20 place count 29 transition count 30
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 28 place count 25 transition count 30
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 24 transition count 26
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 24 transition count 26
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 32 place count 22 transition count 24
Iterating global reduction 2 with 2 rules applied. Total rules applied 34 place count 22 transition count 24
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 36 place count 20 transition count 20
Iterating global reduction 2 with 2 rules applied. Total rules applied 38 place count 20 transition count 20
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 40 place count 18 transition count 18
Iterating global reduction 2 with 2 rules applied. Total rules applied 42 place count 18 transition count 18
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 44 place count 18 transition count 16
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 44 place count 18 transition count 14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 48 place count 16 transition count 14
Applied a total of 48 rules in 14 ms. Remains 16 /37 variables (removed 21) and now considering 14/46 (removed 32) transitions.
// Phase 1: matrix 14 rows 16 cols
[2024-06-01 16:18:42] [INFO ] Computed 6 invariants in 0 ms
[2024-06-01 16:18:42] [INFO ] Implicit Places using invariants in 33 ms returned [0, 7]
[2024-06-01 16:18:42] [INFO ] Actually due to overlaps returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 34 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 15/37 places, 14/46 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 14/14 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 50 ms. Remains : 15/37 places, 14/46 transitions.
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N02-LTLFireability-15
Product exploration explored 100000 steps with 12349 reset in 102 ms.
Product exploration explored 100000 steps with 12335 reset in 107 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 (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 250 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
RANDOM walk for 25 steps (0 resets) in 6 ms. (3 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT (OR p0 (NOT p1)))), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 328 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 4 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 14/14 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 14/14 (removed 0) transitions.
// Phase 1: matrix 14 rows 15 cols
[2024-06-01 16:18:43] [INFO ] Computed 5 invariants in 0 ms
[2024-06-01 16:18:43] [INFO ] Implicit Places using invariants in 33 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 34 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 14/15 places, 14/14 transitions.
Applied a total of 0 rules in 0 ms. Remains 14 /14 variables (removed 0) and now considering 14/14 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 35 ms. Remains : 14/15 places, 14/14 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 230 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
RANDOM walk for 30 steps (0 resets) in 4 ms. (6 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT (OR p0 (NOT p1)))), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 327 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 12282 reset in 98 ms.
Product exploration explored 100000 steps with 12326 reset in 109 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 4 out of 14 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 14/14 places, 14/14 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 14 transition count 16
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 14 transition count 16
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 2 ms. Remains 14 /14 variables (removed 0) and now considering 16/14 (removed -2) transitions.
[2024-06-01 16:18:45] [INFO ] Redundant transitions in 0 ms returned []
Running 14 sub problems to find dead transitions.
// Phase 1: matrix 16 rows 14 cols
[2024-06-01 16:18:45] [INFO ] Computed 4 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 2/14 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-06-01 16:18:45] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
[2024-06-01 16:18:45] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 2/6 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/6 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 16/30 variables, 14/20 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/20 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 0/30 variables, 0/20 constraints. Problems are: Problem set: 4 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 30/30 variables, and 20 constraints, problems are : Problem set: 4 solved, 10 unsolved in 189 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 14/14 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 4 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 4/14 variables, 4/4 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 2/6 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/6 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 16/30 variables, 14/20 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 10/30 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/30 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/30 variables, 0/30 constraints. Problems are: Problem set: 4 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 30/30 variables, and 30 constraints, problems are : Problem set: 4 solved, 10 unsolved in 142 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 14/14 constraints, PredecessorRefiner: 10/14 constraints, Known Traps: 2/2 constraints]
After SMT, in 336ms problems are : Problem set: 4 solved, 10 unsolved
Search for dead transitions found 4 dead transitions in 336ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 14/14 places, 12/14 transitions.
Graph (complete) has 16 edges and 14 vertex of which 12 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 1 ms. Remains 12 /14 variables (removed 2) and now considering 12/12 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 12/14 places, 12/14 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 345 ms. Remains : 12/14 places, 12/14 transitions.
Support contains 4 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 14/14 transitions.
Applied a total of 0 rules in 0 ms. Remains 14 /14 variables (removed 0) and now considering 14/14 (removed 0) transitions.
// Phase 1: matrix 14 rows 14 cols
[2024-06-01 16:18:45] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 16:18:45] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-06-01 16:18:45] [INFO ] Invariant cache hit.
[2024-06-01 16:18:45] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
Running 12 sub problems to find dead transitions.
[2024-06-01 16:18:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 2/14 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 14/28 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 0/28 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 28/28 variables, and 18 constraints, problems are : Problem set: 0 solved, 12 unsolved in 153 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 14/14 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 2/14 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 14/28 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 12/30 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 0/28 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 28/28 variables, and 30 constraints, problems are : Problem set: 0 solved, 12 unsolved in 147 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 14/14 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 305ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 305ms
Finished structural reductions in LTL mode , in 1 iterations and 362 ms. Remains : 14/14 places, 14/14 transitions.
Treatment of property UtilityControlRoom-COL-Z2T4N02-LTLFireability-15 finished in 3751 ms.
[2024-06-01 16:18:46] [INFO ] Flatten gal took : 7 ms
[2024-06-01 16:18:46] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2024-06-01 16:18:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 37 places, 46 transitions and 132 arcs took 7 ms.
Total runtime 60324 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA UtilityControlRoom-COL-Z2T4N02-LTLFireability-04 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA UtilityControlRoom-COL-Z2T4N02-LTLFireability-06 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA UtilityControlRoom-COL-Z2T4N02-LTLFireability-15 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717258726589

--------------------
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-Z2T4N02-LTLFireability-04
ltl formula formula --ltl=/tmp/2467/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 37 places, 46 transitions and 132 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.010 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2467/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2467/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2467/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2467/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 39 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 38, there are 53 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( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33
pnml2lts-mc( 0/ 4): unique states count: 33
pnml2lts-mc( 0/ 4): unique transitions count: 36
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 14
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 59
pnml2lts-mc( 0/ 4): - cum. max stack depth: 23
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 59 states 104 transitions, fanout: 1.763
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 32.0 B/state, compr.: 20.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 46 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name UtilityControlRoom-COL-Z2T4N02-LTLFireability-06
ltl formula formula --ltl=/tmp/2467/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
pnml2lts-mc( 0/ 4): Petri net has 37 places, 46 transitions and 132 arcs
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2467/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2467/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2467/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2467/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 39 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 38, there are 72 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( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 55
pnml2lts-mc( 0/ 4): unique states count: 55
pnml2lts-mc( 0/ 4): unique transitions count: 88
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 59
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 81
pnml2lts-mc( 0/ 4): - cum. max stack depth: 22
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 81 states 218 transitions, fanout: 2.691
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 27.1 B/state, compr.: 17.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 46 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name UtilityControlRoom-COL-Z2T4N02-LTLFireability-15
ltl formula formula --ltl=/tmp/2467/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
pnml2lts-mc( 0/ 4): Petri net has 37 places, 46 transitions and 132 arcs
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
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.010 real 0.000 user 0.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2467/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2467/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2467/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2467/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 38 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 38, there are 54 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( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1117
pnml2lts-mc( 0/ 4): unique states count: 1117
pnml2lts-mc( 0/ 4): unique transitions count: 3816
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 2809
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 1194
pnml2lts-mc( 0/ 4): - cum. max stack depth: 62
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1194 states 4225 transitions, fanout: 3.539
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.010 sec minimum, 0.010 sec on average)
pnml2lts-mc( 0/ 4): States per second: 119400, Transitions per second: 422500
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 13.8 B/state, compr.: 8.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 46 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="UtilityControlRoom-COL-Z2T4N02"
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-Z2T4N02, 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-171701110600044"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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