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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 436K
-rw-r--r-- 1 mcc users 6.7K Apr 13 05:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K Apr 13 05:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 13 05:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 13 05:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Apr 23 08:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 08:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 23 08:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 08:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 13 05:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Apr 13 05:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 13 05:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Apr 13 05:32 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-Z2T3N10-LTLFireability-00
FORMULA_NAME UtilityControlRoom-COL-Z2T3N10-LTLFireability-01
FORMULA_NAME UtilityControlRoom-COL-Z2T3N10-LTLFireability-02
FORMULA_NAME UtilityControlRoom-COL-Z2T3N10-LTLFireability-03
FORMULA_NAME UtilityControlRoom-COL-Z2T3N10-LTLFireability-04
FORMULA_NAME UtilityControlRoom-COL-Z2T3N10-LTLFireability-05
FORMULA_NAME UtilityControlRoom-COL-Z2T3N10-LTLFireability-06
FORMULA_NAME UtilityControlRoom-COL-Z2T3N10-LTLFireability-07
FORMULA_NAME UtilityControlRoom-COL-Z2T3N10-LTLFireability-08
FORMULA_NAME UtilityControlRoom-COL-Z2T3N10-LTLFireability-09
FORMULA_NAME UtilityControlRoom-COL-Z2T3N10-LTLFireability-10
FORMULA_NAME UtilityControlRoom-COL-Z2T3N10-LTLFireability-11
FORMULA_NAME UtilityControlRoom-COL-Z2T3N10-LTLFireability-12
FORMULA_NAME UtilityControlRoom-COL-Z2T3N10-LTLFireability-13
FORMULA_NAME UtilityControlRoom-COL-Z2T3N10-LTLFireability-14
FORMULA_NAME UtilityControlRoom-COL-Z2T3N10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717258222901

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-Z2T3N10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 16:10:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 16:10:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 16:10:25] [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:10:25] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 16:10:26] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 953 ms
[2024-06-01 16:10:26] [INFO ] Imported 13 HL places and 12 HL transitions for a total of 174 PT places and 270.0 transition bindings in 30 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 27 ms.
Working with output stream class java.io.PrintStream
[2024-06-01 16:10:26] [INFO ] Built PT skeleton of HLPN with 13 places and 12 transitions 37 arcs in 6 ms.
[2024-06-01 16:10:26] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 2 formulas.
FORMULA UtilityControlRoom-COL-Z2T3N10-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z2T3N10-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 10 properties that can be checked using skeleton over-approximation.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Reduction of identical properties reduced properties to check from 11 to 9
RANDOM walk for 284 steps (0 resets) in 21 ms. (12 steps per ms) remains 0/9 properties
[2024-06-01 16:10:26] [INFO ] Flatten gal took : 24 ms
[2024-06-01 16:10:26] [INFO ] Flatten gal took : 5 ms
Transition timeout forces synchronizations/join behavior on parameter c of sort Cli
Domain [Cli(10), Z(2), Z(2)] of place MovetoZ breaks symmetries in sort Z
[2024-06-01 16:10:26] [INFO ] Unfolded HLPN to a Petri net with 174 places and 270 transitions 850 arcs in 42 ms.
[2024-06-01 16:10:26] [INFO ] Unfolded 14 HLPN properties in 1 ms.
[2024-06-01 16:10:26] [INFO ] Reduced 10 identical enabling conditions.
[2024-06-01 16:10:26] [INFO ] Reduced 10 identical enabling conditions.
[2024-06-01 16:10:26] [INFO ] Reduced 10 identical enabling conditions.
[2024-06-01 16:10:26] [INFO ] Reduced 10 identical enabling conditions.
[2024-06-01 16:10:26] [INFO ] Reduced 10 identical enabling conditions.
[2024-06-01 16:10:26] [INFO ] Reduced 10 identical enabling conditions.
Ensure Unique test removed 40 transitions
Reduce redundant transitions removed 40 transitions.
Support contains 153 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 230/230 transitions.
Applied a total of 0 rules in 50 ms. Remains 174 /174 variables (removed 0) and now considering 230/230 (removed 0) transitions.
// Phase 1: matrix 230 rows 174 cols
[2024-06-01 16:10:27] [INFO ] Computed 23 invariants in 23 ms
[2024-06-01 16:10:27] [INFO ] Implicit Places using invariants in 440 ms returned [123]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 534 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 173/174 places, 230/230 transitions.
Applied a total of 0 rules in 5 ms. Remains 173 /173 variables (removed 0) and now considering 230/230 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 667 ms. Remains : 173/174 places, 230/230 transitions.
Support contains 153 out of 173 places after structural reductions.
[2024-06-01 16:10:27] [INFO ] Flatten gal took : 51 ms
[2024-06-01 16:10:27] [INFO ] Flatten gal took : 50 ms
[2024-06-01 16:10:28] [INFO ] Input system was already deterministic with 230 transitions.
Reduction of identical properties reduced properties to check from 15 to 11
RANDOM walk for 1038 steps (0 resets) in 79 ms. (12 steps per ms) remains 0/11 properties
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 23 out of 173 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 173 transition count 190
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 100 place count 133 transition count 170
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 100 place count 133 transition count 150
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 140 place count 113 transition count 150
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 160 place count 103 transition count 140
Applied a total of 160 rules in 62 ms. Remains 103 /173 variables (removed 70) and now considering 140/230 (removed 90) transitions.
// Phase 1: matrix 140 rows 103 cols
[2024-06-01 16:10:28] [INFO ] Computed 22 invariants in 3 ms
[2024-06-01 16:10:28] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-06-01 16:10:28] [INFO ] Invariant cache hit.
[2024-06-01 16:10:29] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
[2024-06-01 16:10:29] [INFO ] Redundant transitions in 5 ms returned []
Running 110 sub problems to find dead transitions.
[2024-06-01 16:10:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (OVERLAPS) 10/103 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 140/243 variables, 103/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (OVERLAPS) 0/243 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 243/243 variables, and 125 constraints, problems are : Problem set: 0 solved, 110 unsolved in 4015 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (OVERLAPS) 10/103 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 140/243 variables, 103/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 110/235 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (OVERLAPS) 0/243 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 243/243 variables, and 235 constraints, problems are : Problem set: 0 solved, 110 unsolved in 3959 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints]
After SMT, in 8224ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 8242ms
Starting structural reductions in SI_LTL mode, iteration 1 : 103/173 places, 140/230 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8641 ms. Remains : 103/173 places, 140/230 transitions.
Stuttering acceptance computed with spot in 254 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N10-LTLFireability-00
Product exploration explored 100000 steps with 0 reset in 770 ms.
Stack based approach found an accepted trace after 6294 steps with 0 reset with depth 6295 and stack size 6295 in 51 ms.
FORMULA UtilityControlRoom-COL-Z2T3N10-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N10-LTLFireability-00 finished in 9816 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||G(p1))))'
Support contains 40 out of 173 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 173 transition count 190
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 100 place count 133 transition count 170
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 101 place count 132 transition count 150
Iterating global reduction 2 with 1 rules applied. Total rules applied 102 place count 132 transition count 150
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 112 place count 122 transition count 140
Iterating global reduction 2 with 10 rules applied. Total rules applied 122 place count 122 transition count 140
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 41 rules applied. Total rules applied 163 place count 101 transition count 120
Applied a total of 163 rules in 39 ms. Remains 101 /173 variables (removed 72) and now considering 120/230 (removed 110) transitions.
// Phase 1: matrix 120 rows 101 cols
[2024-06-01 16:10:38] [INFO ] Computed 21 invariants in 4 ms
[2024-06-01 16:10:38] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-06-01 16:10:38] [INFO ] Invariant cache hit.
[2024-06-01 16:10:38] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2024-06-01 16:10:38] [INFO ] Redundant transitions in 4 ms returned []
Running 110 sub problems to find dead transitions.
[2024-06-01 16:10:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (OVERLAPS) 10/101 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 120/221 variables, 101/122 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (OVERLAPS) 0/221 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 221/221 variables, and 122 constraints, problems are : Problem set: 0 solved, 110 unsolved in 3069 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 101/101 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (OVERLAPS) 10/101 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 120/221 variables, 101/122 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 110/232 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (OVERLAPS) 0/221 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 221/221 variables, and 232 constraints, problems are : Problem set: 0 solved, 110 unsolved in 3247 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 101/101 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints]
After SMT, in 6374ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 6378ms
Starting structural reductions in SI_LTL mode, iteration 1 : 101/173 places, 120/230 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6623 ms. Remains : 101/173 places, 120/230 transitions.
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N10-LTLFireability-01
Entered a terminal (fully accepting) state of product in 18 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z2T3N10-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N10-LTLFireability-01 finished in 6744 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 40 out of 173 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 173 transition count 210
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 153 transition count 210
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 0 with 80 rules applied. Total rules applied 120 place count 113 transition count 170
Applied a total of 120 rules in 32 ms. Remains 113 /173 variables (removed 60) and now considering 170/230 (removed 60) transitions.
// Phase 1: matrix 170 rows 113 cols
[2024-06-01 16:10:45] [INFO ] Computed 22 invariants in 2 ms
[2024-06-01 16:10:45] [INFO ] Implicit Places using invariants in 134 ms returned [92]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 135 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 112/173 places, 170/230 transitions.
Applied a total of 0 rules in 9 ms. Remains 112 /112 variables (removed 0) and now considering 170/170 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 176 ms. Remains : 112/173 places, 170/230 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N10-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 454 ms.
Stack based approach found an accepted trace after 98 steps with 0 reset with depth 99 and stack size 99 in 1 ms.
FORMULA UtilityControlRoom-COL-Z2T3N10-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N10-LTLFireability-02 finished in 684 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||F(p1))))'
Support contains 30 out of 173 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 173 transition count 190
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 100 place count 133 transition count 170
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 101 place count 132 transition count 150
Iterating global reduction 2 with 1 rules applied. Total rules applied 102 place count 132 transition count 150
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 112 place count 122 transition count 140
Iterating global reduction 2 with 10 rules applied. Total rules applied 122 place count 122 transition count 140
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 61 rules applied. Total rules applied 183 place count 91 transition count 110
Applied a total of 183 rules in 31 ms. Remains 91 /173 variables (removed 82) and now considering 110/230 (removed 120) transitions.
// Phase 1: matrix 110 rows 91 cols
[2024-06-01 16:10:45] [INFO ] Computed 21 invariants in 1 ms
[2024-06-01 16:10:46] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-06-01 16:10:46] [INFO ] Invariant cache hit.
[2024-06-01 16:10:46] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
[2024-06-01 16:10:46] [INFO ] Redundant transitions in 3 ms returned []
Running 90 sub problems to find dead transitions.
[2024-06-01 16:10:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (OVERLAPS) 10/91 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 110/201 variables, 91/112 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (OVERLAPS) 0/201 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 112 constraints, problems are : Problem set: 0 solved, 90 unsolved in 2399 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (OVERLAPS) 10/91 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 110/201 variables, 91/112 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 90/202 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (OVERLAPS) 0/201 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 202 constraints, problems are : Problem set: 0 solved, 90 unsolved in 2572 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 0/0 constraints]
After SMT, in 5022ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 5024ms
Starting structural reductions in SI_LTL mode, iteration 1 : 91/173 places, 110/230 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5298 ms. Remains : 91/173 places, 110/230 transitions.
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N10-LTLFireability-03
Product exploration explored 100000 steps with 1241 reset in 419 ms.
Stack based approach found an accepted trace after 2200 steps with 26 reset with depth 31 and stack size 31 in 11 ms.
FORMULA UtilityControlRoom-COL-Z2T3N10-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N10-LTLFireability-03 finished in 5841 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 (G(p2)||p1)))'
Support contains 33 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 153 transition count 210
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 153 transition count 210
Applied a total of 40 rules in 9 ms. Remains 153 /173 variables (removed 20) and now considering 210/230 (removed 20) transitions.
// Phase 1: matrix 210 rows 153 cols
[2024-06-01 16:10:51] [INFO ] Computed 22 invariants in 7 ms
[2024-06-01 16:10:51] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-06-01 16:10:51] [INFO ] Invariant cache hit.
[2024-06-01 16:10:52] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2024-06-01 16:10:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (OVERLAPS) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 363/363 variables, and 175 constraints, problems are : Problem set: 0 solved, 200 unsolved in 7828 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 200/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 363/363 variables, and 375 constraints, problems are : Problem set: 0 solved, 200 unsolved in 10837 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
After SMT, in 18830ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 18834ms
Starting structural reductions in LTL mode, iteration 1 : 153/173 places, 210/230 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19128 ms. Remains : 153/173 places, 210/230 transitions.
Stuttering acceptance computed with spot in 210 ms :[(AND (NOT p1) (NOT p2)), p0, (AND p0 (NOT p2)), true, (NOT p2)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N10-LTLFireability-04
Entered a terminal (fully accepting) state of product in 29 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z2T3N10-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N10-LTLFireability-04 finished in 19364 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(F(!p0)) U (X(!p2)||p1)))))'
Support contains 30 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 153 transition count 210
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 153 transition count 210
Applied a total of 40 rules in 7 ms. Remains 153 /173 variables (removed 20) and now considering 210/230 (removed 20) transitions.
[2024-06-01 16:11:11] [INFO ] Invariant cache hit.
[2024-06-01 16:11:11] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-06-01 16:11:11] [INFO ] Invariant cache hit.
[2024-06-01 16:11:11] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2024-06-01 16:11:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (OVERLAPS) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 363/363 variables, and 175 constraints, problems are : Problem set: 0 solved, 200 unsolved in 8165 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 200/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 363/363 variables, and 375 constraints, problems are : Problem set: 0 solved, 200 unsolved in 10943 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
After SMT, in 19240ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 19244ms
Starting structural reductions in LTL mode, iteration 1 : 153/173 places, 210/230 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19583 ms. Remains : 153/173 places, 210/230 transitions.
Stuttering acceptance computed with spot in 266 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2 p0), (AND (NOT p1) p2), (AND (NOT p1) p2 p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N10-LTLFireability-06
Product exploration explored 100000 steps with 7032 reset in 293 ms.
Product exploration explored 100000 steps with 7143 reset in 311 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT p2)), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p1) p2))), (X (NOT p0)), (X (NOT (AND p2 p0))), (X p1), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p2 p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 14 factoid took 344 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2 p0), (AND (NOT p1) p2), (AND (NOT p1) p2 p0)]
RANDOM walk for 552 steps (0 resets) in 27 ms. (19 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT p2)), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p1) p2))), (X (NOT p0)), (X (NOT (AND p2 p0))), (X p1), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p2 p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p2) p0 p1))), (F (NOT (AND p0 (NOT p1)))), (F (NOT p0)), (F p1), (F p2), (F (NOT (OR (NOT p2) p1))), (F (NOT (OR (NOT p2) (NOT p0) p1))), (F (NOT (OR (NOT p2) (NOT p0))))]
Knowledge based reduction with 14 factoid took 617 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2 p0), (AND (NOT p1) p2), (AND (NOT p1) p2 p0)]
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2 p0), (AND (NOT p1) p2), (AND (NOT p1) p2 p0)]
Support contains 30 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 210/210 transitions.
Applied a total of 0 rules in 2 ms. Remains 153 /153 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2024-06-01 16:11:33] [INFO ] Invariant cache hit.
[2024-06-01 16:11:33] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-06-01 16:11:33] [INFO ] Invariant cache hit.
[2024-06-01 16:11:33] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2024-06-01 16:11:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (OVERLAPS) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 363/363 variables, and 175 constraints, problems are : Problem set: 0 solved, 200 unsolved in 8034 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 200/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 363/363 variables, and 375 constraints, problems are : Problem set: 0 solved, 200 unsolved in 10296 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
After SMT, in 18459ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 18462ms
Finished structural reductions in LTL mode , in 1 iterations and 18799 ms. Remains : 153/153 places, 210/210 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p2)), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT p0)), (X (NOT (AND p2 p0))), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 14 factoid took 311 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2 p0), (AND (NOT p1) p2), (AND (NOT p1) p2 p0)]
RANDOM walk for 286 steps (0 resets) in 18 ms. (15 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p2)), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT p0)), (X (NOT (AND p2 p0))), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p2) p0 p1))), (F (NOT (AND p0 (NOT p1)))), (F (NOT p0)), (F p1), (F p2), (F (NOT (OR (NOT p2) p1))), (F (NOT (OR (NOT p2) (NOT p0) p1))), (F (NOT (OR (NOT p2) (NOT p0))))]
Knowledge based reduction with 14 factoid took 658 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2 p0), (AND (NOT p1) p2), (AND (NOT p1) p2 p0)]
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2 p0), (AND (NOT p1) p2), (AND (NOT p1) p2 p0)]
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2 p0), (AND (NOT p1) p2), (AND (NOT p1) p2 p0)]
Product exploration explored 100000 steps with 6918 reset in 239 ms.
Product exploration explored 100000 steps with 7183 reset in 252 ms.
Support contains 30 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 210/210 transitions.
Applied a total of 0 rules in 2 ms. Remains 153 /153 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2024-06-01 16:11:54] [INFO ] Invariant cache hit.
[2024-06-01 16:11:54] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-06-01 16:11:54] [INFO ] Invariant cache hit.
[2024-06-01 16:11:54] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2024-06-01 16:11:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (OVERLAPS) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 363/363 variables, and 175 constraints, problems are : Problem set: 0 solved, 200 unsolved in 6795 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 200/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 363/363 variables, and 375 constraints, problems are : Problem set: 0 solved, 200 unsolved in 9421 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
After SMT, in 16335ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 16338ms
Finished structural reductions in LTL mode , in 1 iterations and 16687 ms. Remains : 153/153 places, 210/210 transitions.
Treatment of property UtilityControlRoom-COL-Z2T3N10-LTLFireability-06 finished in 60085 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((G((!p1||G(p1)))&&F(!p2))||p0))))'
Support contains 73 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Applied a total of 0 rules in 2 ms. Remains 173 /173 variables (removed 0) and now considering 230/230 (removed 0) transitions.
// Phase 1: matrix 230 rows 173 cols
[2024-06-01 16:12:11] [INFO ] Computed 22 invariants in 3 ms
[2024-06-01 16:12:11] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-06-01 16:12:11] [INFO ] Invariant cache hit.
[2024-06-01 16:12:11] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
Running 220 sub problems to find dead transitions.
[2024-06-01 16:12:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 10/173 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 230/403 variables, 173/195 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (OVERLAPS) 0/403 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Real declared 403/403 variables, and 195 constraints, problems are : Problem set: 0 solved, 220 unsolved in 7923 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 10/173 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 230/403 variables, 173/195 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 220/415 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/403 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (OVERLAPS) 0/403 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Int declared 403/403 variables, and 415 constraints, problems are : Problem set: 0 solved, 220 unsolved in 10051 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 0/0 constraints]
After SMT, in 18102ms problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 18105ms
Finished structural reductions in LTL mode , in 1 iterations and 18353 ms. Remains : 173/173 places, 230/230 transitions.
Stuttering acceptance computed with spot in 248 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (NOT p1), false, p2, true]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N10-LTLFireability-07
Entered a terminal (fully accepting) state of product in 65 steps with 20 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z2T3N10-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N10-LTLFireability-07 finished in 18627 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((F(p0) U X(!p1))))))'
Support contains 30 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 153 transition count 210
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 153 transition count 210
Applied a total of 40 rules in 3 ms. Remains 153 /173 variables (removed 20) and now considering 210/230 (removed 20) transitions.
// Phase 1: matrix 210 rows 153 cols
[2024-06-01 16:12:29] [INFO ] Computed 22 invariants in 3 ms
[2024-06-01 16:12:29] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-06-01 16:12:29] [INFO ] Invariant cache hit.
[2024-06-01 16:12:30] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2024-06-01 16:12:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (OVERLAPS) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 363/363 variables, and 175 constraints, problems are : Problem set: 0 solved, 200 unsolved in 6668 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 200/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 363/363 variables, and 375 constraints, problems are : Problem set: 0 solved, 200 unsolved in 9671 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
After SMT, in 16460ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 16463ms
Starting structural reductions in LTL mode, iteration 1 : 153/173 places, 210/230 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16805 ms. Remains : 153/173 places, 210/230 transitions.
Stuttering acceptance computed with spot in 265 ms :[p1, p1, p1, p1, p1, (AND (NOT p0) p1), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N10-LTLFireability-09
Product exploration explored 100000 steps with 19158 reset in 377 ms.
Product exploration explored 100000 steps with 19186 reset in 257 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)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 83 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 302 ms :[p1, p1, p1, p1, p1, (AND (NOT p0) p1), (NOT p0)]
Reduction of identical properties reduced properties to check from 3 to 2
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : [(F p0), (F (NOT p1)), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 1 factoid took 166 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 275 ms :[p1, p1, p1, p1, p1, (AND (NOT p0) p1), (NOT p0)]
Stuttering acceptance computed with spot in 252 ms :[p1, p1, p1, p1, p1, (AND (NOT p0) p1), (NOT p0)]
[2024-06-01 16:12:48] [INFO ] Invariant cache hit.
[2024-06-01 16:12:48] [INFO ] [Real]Absence check using 22 positive place invariants in 15 ms returned sat
[2024-06-01 16:12:48] [INFO ] [Real]Absence check using state equation in 105 ms returned sat
[2024-06-01 16:12:48] [INFO ] Computed and/alt/rep : 200/310/200 causal constraints (skipped 0 transitions) in 21 ms.
[2024-06-01 16:12:49] [INFO ] Added : 0 causal constraints over 0 iterations in 48 ms. Result :sat
Could not prove EG p1
Support contains 30 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 210/210 transitions.
Applied a total of 0 rules in 1 ms. Remains 153 /153 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2024-06-01 16:12:49] [INFO ] Invariant cache hit.
[2024-06-01 16:12:49] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-06-01 16:12:49] [INFO ] Invariant cache hit.
[2024-06-01 16:12:49] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2024-06-01 16:12:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (OVERLAPS) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 363/363 variables, and 175 constraints, problems are : Problem set: 0 solved, 200 unsolved in 6611 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 200/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 363/363 variables, and 375 constraints, problems are : Problem set: 0 solved, 200 unsolved in 9482 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
After SMT, in 16222ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 16225ms
Finished structural reductions in LTL mode , in 1 iterations and 16558 ms. Remains : 153/153 places, 210/210 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 82 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 257 ms :[p1, p1, p1, p1, p1, (AND (NOT p0) p1), (NOT p0)]
Reduction of identical properties reduced properties to check from 3 to 2
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : [(F p0), (F (NOT p1)), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 1 factoid took 145 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 249 ms :[p1, p1, p1, p1, p1, (AND (NOT p0) p1), (NOT p0)]
Stuttering acceptance computed with spot in 256 ms :[p1, p1, p1, p1, p1, (AND (NOT p0) p1), (NOT p0)]
[2024-06-01 16:13:06] [INFO ] Invariant cache hit.
[2024-06-01 16:13:06] [INFO ] [Real]Absence check using 22 positive place invariants in 14 ms returned sat
[2024-06-01 16:13:06] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2024-06-01 16:13:06] [INFO ] Computed and/alt/rep : 200/310/200 causal constraints (skipped 0 transitions) in 18 ms.
[2024-06-01 16:13:06] [INFO ] Added : 0 causal constraints over 0 iterations in 41 ms. Result :sat
Could not prove EG p1
Stuttering acceptance computed with spot in 269 ms :[p1, p1, p1, p1, p1, (AND (NOT p0) p1), (NOT p0)]
Product exploration explored 100000 steps with 19167 reset in 227 ms.
Product exploration explored 100000 steps with 19137 reset in 250 ms.
Applying partial POR strategy [false, false, false, false, false, true, true]
Stuttering acceptance computed with spot in 276 ms :[p1, p1, p1, p1, p1, (AND (NOT p0) p1), (NOT p0)]
Support contains 30 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 210/210 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 30 places in 1 ms
Iterating global reduction 0 with 30 rules applied. Total rules applied 30 place count 153 transition count 210
Deduced a syphon composed of 30 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 0 with 20 rules applied. Total rules applied 50 place count 153 transition count 190
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 152 transition count 170
Deduced a syphon composed of 30 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 152 transition count 170
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 72 place count 132 transition count 140
Deduced a syphon composed of 20 places in 0 ms
Iterating global reduction 0 with 20 rules applied. Total rules applied 92 place count 132 transition count 140
Deduced a syphon composed of 20 places in 0 ms
Applied a total of 92 rules in 29 ms. Remains 132 /153 variables (removed 21) and now considering 140/210 (removed 70) transitions.
[2024-06-01 16:13:08] [INFO ] Redundant transitions in 5 ms returned []
Running 130 sub problems to find dead transitions.
// Phase 1: matrix 140 rows 132 cols
[2024-06-01 16:13:08] [INFO ] Computed 22 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-06-01 16:13:09] [INFO ] Deduced a trap composed of 51 places in 65 ms of which 13 ms to minimize.
[2024-06-01 16:13:09] [INFO ] Deduced a trap composed of 51 places in 60 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (OVERLAPS) 10/132 variables, 20/24 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-06-01 16:13:10] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
Problem TDEAD91 is UNSAT
[2024-06-01 16:13:10] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 2 ms to minimize.
Problem TDEAD92 is UNSAT
[2024-06-01 16:13:10] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
Problem TDEAD93 is UNSAT
[2024-06-01 16:13:10] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
Problem TDEAD94 is UNSAT
[2024-06-01 16:13:10] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
Problem TDEAD95 is UNSAT
[2024-06-01 16:13:10] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
Problem TDEAD96 is UNSAT
[2024-06-01 16:13:10] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
Problem TDEAD97 is UNSAT
[2024-06-01 16:13:10] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
Problem TDEAD98 is UNSAT
[2024-06-01 16:13:10] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
Problem TDEAD99 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 9/33 constraints. Problems are: Problem set: 18 solved, 112 unsolved
[2024-06-01 16:13:11] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
Problem TDEAD90 is UNSAT
Problem TDEAD110 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 1/34 constraints. Problems are: Problem set: 20 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/34 constraints. Problems are: Problem set: 20 solved, 110 unsolved
At refinement iteration 7 (OVERLAPS) 140/272 variables, 132/166 constraints. Problems are: Problem set: 20 solved, 110 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/272 variables, 0/166 constraints. Problems are: Problem set: 20 solved, 110 unsolved
At refinement iteration 9 (OVERLAPS) 0/272 variables, 0/166 constraints. Problems are: Problem set: 20 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 272/272 variables, and 166 constraints, problems are : Problem set: 20 solved, 110 unsolved in 5822 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 20 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 2/2 constraints. Problems are: Problem set: 20 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/2 constraints. Problems are: Problem set: 20 solved, 110 unsolved
At refinement iteration 2 (OVERLAPS) 30/132 variables, 22/24 constraints. Problems are: Problem set: 20 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 10/34 constraints. Problems are: Problem set: 20 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 0/34 constraints. Problems are: Problem set: 20 solved, 110 unsolved
At refinement iteration 5 (OVERLAPS) 140/272 variables, 132/166 constraints. Problems are: Problem set: 20 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/272 variables, 110/276 constraints. Problems are: Problem set: 20 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 0/276 constraints. Problems are: Problem set: 20 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 0/272 variables, 0/276 constraints. Problems are: Problem set: 20 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 272/272 variables, and 276 constraints, problems are : Problem set: 20 solved, 110 unsolved in 3452 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 110/130 constraints, Known Traps: 12/12 constraints]
After SMT, in 9324ms problems are : Problem set: 20 solved, 110 unsolved
Search for dead transitions found 20 dead transitions in 9326ms
Found 20 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 20 transitions
Dead transitions reduction (with SMT) removed 20 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 132/153 places, 120/210 transitions.
Graph (complete) has 240 edges and 132 vertex of which 112 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.2 ms
Discarding 20 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 places
Applied a total of 1 rules in 8 ms. Remains 111 /132 variables (removed 21) and now considering 120/120 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 111/153 places, 120/210 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 9379 ms. Remains : 111/153 places, 120/210 transitions.
Support contains 30 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 210/210 transitions.
Applied a total of 0 rules in 2 ms. Remains 153 /153 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 153 cols
[2024-06-01 16:13:17] [INFO ] Computed 22 invariants in 3 ms
[2024-06-01 16:13:17] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-06-01 16:13:17] [INFO ] Invariant cache hit.
[2024-06-01 16:13:17] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2024-06-01 16:13:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (OVERLAPS) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 363/363 variables, and 175 constraints, problems are : Problem set: 0 solved, 200 unsolved in 6872 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 200/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 363/363 variables, and 375 constraints, problems are : Problem set: 0 solved, 200 unsolved in 9447 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
After SMT, in 16430ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 16433ms
Finished structural reductions in LTL mode , in 1 iterations and 16803 ms. Remains : 153/153 places, 210/210 transitions.
Treatment of property UtilityControlRoom-COL-Z2T3N10-LTLFireability-09 finished in 64478 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)&&F(p1))||(G(p2)&&X(G(!p1))))))'
Support contains 40 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 153 transition count 210
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 153 transition count 210
Applied a total of 40 rules in 12 ms. Remains 153 /173 variables (removed 20) and now considering 210/230 (removed 20) transitions.
[2024-06-01 16:13:34] [INFO ] Invariant cache hit.
[2024-06-01 16:13:34] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-06-01 16:13:34] [INFO ] Invariant cache hit.
[2024-06-01 16:13:34] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2024-06-01 16:13:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (OVERLAPS) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 363/363 variables, and 175 constraints, problems are : Problem set: 0 solved, 200 unsolved in 6758 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 200/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 363/363 variables, and 375 constraints, problems are : Problem set: 0 solved, 200 unsolved in 11039 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
After SMT, in 17915ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 17919ms
Starting structural reductions in LTL mode, iteration 1 : 153/173 places, 210/230 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18193 ms. Remains : 153/173 places, 210/230 transitions.
Stuttering acceptance computed with spot in 296 ms :[true, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p2) p1), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N10-LTLFireability-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z2T3N10-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N10-LTLFireability-10 finished in 18532 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((p1||X(F(p2)))&&p0))))'
Support contains 33 out of 173 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 173 transition count 190
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 100 place count 133 transition count 170
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 100 place count 133 transition count 150
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 140 place count 113 transition count 150
Applied a total of 140 rules in 14 ms. Remains 113 /173 variables (removed 60) and now considering 150/230 (removed 80) transitions.
// Phase 1: matrix 150 rows 113 cols
[2024-06-01 16:13:52] [INFO ] Computed 22 invariants in 1 ms
[2024-06-01 16:13:52] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-06-01 16:13:52] [INFO ] Invariant cache hit.
[2024-06-01 16:13:53] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
[2024-06-01 16:13:53] [INFO ] Redundant transitions in 1 ms returned []
Running 140 sub problems to find dead transitions.
[2024-06-01 16:13:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (OVERLAPS) 10/113 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (OVERLAPS) 150/263 variables, 113/135 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (OVERLAPS) 0/263 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Real declared 263/263 variables, and 135 constraints, problems are : Problem set: 0 solved, 140 unsolved in 3794 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 113/113 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (OVERLAPS) 10/113 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (OVERLAPS) 150/263 variables, 113/135 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 140/275 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (OVERLAPS) 0/263 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Int declared 263/263 variables, and 275 constraints, problems are : Problem set: 0 solved, 140 unsolved in 4543 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 113/113 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 0/0 constraints]
After SMT, in 8395ms problems are : Problem set: 0 solved, 140 unsolved
Search for dead transitions found 0 dead transitions in 8397ms
Starting structural reductions in SI_LTL mode, iteration 1 : 113/173 places, 150/230 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8632 ms. Remains : 113/173 places, 150/230 transitions.
Stuttering acceptance computed with spot in 84 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N10-LTLFireability-11
Product exploration explored 100000 steps with 21925 reset in 855 ms.
Product exploration explored 100000 steps with 21730 reset in 869 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p2), (X (AND (NOT p1) p0)), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (NOT (AND p1 p0 (NOT p2)))), (X p0), (X (NOT p1)), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 9 factoid took 369 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
RANDOM walk for 40000 steps (8 resets) in 942 ms. (42 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 781 ms. (51 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 530 ms. (75 steps per ms) remains 2/2 properties
[2024-06-01 16:14:04] [INFO ] Invariant cache hit.
Problem apf0 is UNSAT
Problem apf2 is UNSAT
After SMT solving in domain Real declared 33/263 variables, and 0 constraints, problems are : Problem set: 2 solved, 0 unsolved in 26 ms.
Refiners :[Positive P Invariants (semi-flows): 0/22 constraints, State Equation: 0/113 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 66ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p2), (X (AND (NOT p1) p0)), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (NOT (AND p1 p0 (NOT p2)))), (X p0), (X (NOT p1)), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT p1))), (G (OR (NOT p0) p2 p1)), (G (OR (NOT p0) p2 (NOT p1)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))))), (X (X p0)), (X (X (NOT p0))), (F (NOT p0)), (F (NOT (AND (OR p0 p2) (OR p2 p1)))), (F p1), (F (NOT p2))]
Knowledge based reduction with 11 factoid took 599 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Support contains 23 out of 113 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 113/113 places, 150/150 transitions.
Applied a total of 0 rules in 4 ms. Remains 113 /113 variables (removed 0) and now considering 150/150 (removed 0) transitions.
[2024-06-01 16:14:05] [INFO ] Invariant cache hit.
[2024-06-01 16:14:05] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-06-01 16:14:05] [INFO ] Invariant cache hit.
[2024-06-01 16:14:05] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
[2024-06-01 16:14:05] [INFO ] Redundant transitions in 3 ms returned []
Running 140 sub problems to find dead transitions.
[2024-06-01 16:14:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (OVERLAPS) 10/113 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (OVERLAPS) 150/263 variables, 113/135 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (OVERLAPS) 0/263 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Real declared 263/263 variables, and 135 constraints, problems are : Problem set: 0 solved, 140 unsolved in 3847 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 113/113 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (OVERLAPS) 10/113 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (OVERLAPS) 150/263 variables, 113/135 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 140/275 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (OVERLAPS) 0/263 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Int declared 263/263 variables, and 275 constraints, problems are : Problem set: 0 solved, 140 unsolved in 4551 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 113/113 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 0/0 constraints]
After SMT, in 8467ms problems are : Problem set: 0 solved, 140 unsolved
Search for dead transitions found 0 dead transitions in 8469ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 8728 ms. Remains : 113/113 places, 150/150 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 124 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
RANDOM walk for 17 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 137 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 585 ms.
Stack based approach found an accepted trace after 35513 steps with 0 reset with depth 35514 and stack size 26382 in 240 ms.
FORMULA UtilityControlRoom-COL-Z2T3N10-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N10-LTLFireability-11 finished in 22393 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))||(!p1 U X(!p2))))'
Support contains 80 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Applied a total of 0 rules in 1 ms. Remains 173 /173 variables (removed 0) and now considering 230/230 (removed 0) transitions.
// Phase 1: matrix 230 rows 173 cols
[2024-06-01 16:14:15] [INFO ] Computed 22 invariants in 2 ms
[2024-06-01 16:14:15] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-06-01 16:14:15] [INFO ] Invariant cache hit.
[2024-06-01 16:14:15] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
Running 220 sub problems to find dead transitions.
[2024-06-01 16:14:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 10/173 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 230/403 variables, 173/195 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (OVERLAPS) 0/403 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Real declared 403/403 variables, and 195 constraints, problems are : Problem set: 0 solved, 220 unsolved in 8415 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 10/173 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 230/403 variables, 173/195 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 220/415 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/403 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (OVERLAPS) 0/403 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Int declared 403/403 variables, and 415 constraints, problems are : Problem set: 0 solved, 220 unsolved in 10302 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 0/0 constraints]
After SMT, in 18836ms problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 18839ms
Finished structural reductions in LTL mode , in 1 iterations and 19113 ms. Remains : 173/173 places, 230/230 transitions.
Stuttering acceptance computed with spot in 297 ms :[(NOT p0), true, (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), p2, p2, (AND (NOT p0) p2), (AND (NOT p0) p2)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N10-LTLFireability-12
Product exploration explored 100000 steps with 50000 reset in 235 ms.
Product exploration explored 100000 steps with 50000 reset in 247 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 p2))), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 18 ms. Reduced automaton from 9 states, 13 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z2T3N10-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z2T3N10-LTLFireability-12 finished in 19933 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||G(p1)))&&X(p0)))'
Support contains 70 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Applied a total of 0 rules in 1 ms. Remains 173 /173 variables (removed 0) and now considering 230/230 (removed 0) transitions.
[2024-06-01 16:14:35] [INFO ] Invariant cache hit.
[2024-06-01 16:14:35] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-06-01 16:14:35] [INFO ] Invariant cache hit.
[2024-06-01 16:14:35] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
Running 220 sub problems to find dead transitions.
[2024-06-01 16:14:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 10/173 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 230/403 variables, 173/195 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (OVERLAPS) 0/403 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Real declared 403/403 variables, and 195 constraints, problems are : Problem set: 0 solved, 220 unsolved in 8262 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 10/173 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 230/403 variables, 173/195 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 220/415 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/403 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (OVERLAPS) 0/403 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Int declared 403/403 variables, and 415 constraints, problems are : Problem set: 0 solved, 220 unsolved in 10108 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 0/0 constraints]
After SMT, in 18483ms problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 18487ms
Finished structural reductions in LTL mode , in 1 iterations and 18756 ms. Remains : 173/173 places, 230/230 transitions.
Stuttering acceptance computed with spot in 191 ms :[(NOT p0), true, (NOT p0), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N10-LTLFireability-13
Entered a terminal (fully accepting) state of product in 23 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z2T3N10-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N10-LTLFireability-13 finished in 18966 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((X(!p0)&&F((G(F(p0))||p1)))))'
Support contains 50 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Applied a total of 0 rules in 1 ms. Remains 173 /173 variables (removed 0) and now considering 230/230 (removed 0) transitions.
[2024-06-01 16:14:54] [INFO ] Invariant cache hit.
[2024-06-01 16:14:54] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-06-01 16:14:54] [INFO ] Invariant cache hit.
[2024-06-01 16:14:54] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
Running 220 sub problems to find dead transitions.
[2024-06-01 16:14:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 10/173 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 230/403 variables, 173/195 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (OVERLAPS) 0/403 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Real declared 403/403 variables, and 195 constraints, problems are : Problem set: 0 solved, 220 unsolved in 8422 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 10/173 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 230/403 variables, 173/195 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 220/415 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/403 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (OVERLAPS) 0/403 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Int declared 403/403 variables, and 415 constraints, problems are : Problem set: 0 solved, 220 unsolved in 10424 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 0/0 constraints]
After SMT, in 18974ms problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 18978ms
Finished structural reductions in LTL mode , in 1 iterations and 19338 ms. Remains : 173/173 places, 230/230 transitions.
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p1) p0), p0, (AND (NOT p1) (NOT p0)), true]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N10-LTLFireability-14
Entered a terminal (fully accepting) state of product in 8 steps with 1 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z2T3N10-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N10-LTLFireability-14 finished in 19505 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 10 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 153 transition count 210
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 153 transition count 210
Applied a total of 40 rules in 3 ms. Remains 153 /173 variables (removed 20) and now considering 210/230 (removed 20) transitions.
// Phase 1: matrix 210 rows 153 cols
[2024-06-01 16:15:13] [INFO ] Computed 22 invariants in 2 ms
[2024-06-01 16:15:13] [INFO ] Implicit Places using invariants in 145 ms returned []
[2024-06-01 16:15:13] [INFO ] Invariant cache hit.
[2024-06-01 16:15:14] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2024-06-01 16:15:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (OVERLAPS) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 363/363 variables, and 175 constraints, problems are : Problem set: 0 solved, 200 unsolved in 7125 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 200/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 363/363 variables, and 375 constraints, problems are : Problem set: 0 solved, 200 unsolved in 9455 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
After SMT, in 16709ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 16714ms
Starting structural reductions in LTL mode, iteration 1 : 153/173 places, 210/230 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17080 ms. Remains : 153/173 places, 210/230 transitions.
Stuttering acceptance computed with spot in 71 ms :[p0, p0]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N10-LTLFireability-15
Product exploration explored 100000 steps with 50000 reset in 127 ms.
Product exploration explored 100000 steps with 50000 reset in 140 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 12 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z2T3N10-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z2T3N10-LTLFireability-15 finished in 17454 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(F(!p0)) U (X(!p2)||p1)))))'
Found a Lengthening insensitive property : UtilityControlRoom-COL-Z2T3N10-LTLFireability-06
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2 p0), (AND (NOT p1) p2), (AND (NOT p1) p2 p0)]
Support contains 30 out of 173 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 173 transition count 190
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 100 place count 133 transition count 170
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 100 place count 133 transition count 150
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 140 place count 113 transition count 150
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 141 place count 112 transition count 130
Iterating global reduction 2 with 1 rules applied. Total rules applied 142 place count 112 transition count 130
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 152 place count 102 transition count 120
Iterating global reduction 2 with 10 rules applied. Total rules applied 162 place count 102 transition count 120
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 172 place count 92 transition count 100
Iterating global reduction 2 with 10 rules applied. Total rules applied 182 place count 92 transition count 100
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 192 place count 82 transition count 90
Iterating global reduction 2 with 10 rules applied. Total rules applied 202 place count 82 transition count 90
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 212 place count 82 transition count 80
Applied a total of 212 rules in 16 ms. Remains 82 /173 variables (removed 91) and now considering 80/230 (removed 150) transitions.
// Phase 1: matrix 80 rows 82 cols
[2024-06-01 16:15:31] [INFO ] Computed 22 invariants in 1 ms
[2024-06-01 16:15:31] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-06-01 16:15:31] [INFO ] Invariant cache hit.
[2024-06-01 16:15:31] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
Running 70 sub problems to find dead transitions.
[2024-06-01 16:15:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (OVERLAPS) 10/82 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 80/162 variables, 82/104 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (OVERLAPS) 0/162 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 104 constraints, problems are : Problem set: 0 solved, 70 unsolved in 1859 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 82/82 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 70 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (OVERLAPS) 10/82 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 80/162 variables, 82/104 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 70/174 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (OVERLAPS) 0/162 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 174 constraints, problems are : Problem set: 0 solved, 70 unsolved in 1862 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 82/82 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 0/0 constraints]
After SMT, in 3745ms problems are : Problem set: 0 solved, 70 unsolved
Search for dead transitions found 0 dead transitions in 3746ms
Starting structural reductions in LI_LTL mode, iteration 1 : 82/173 places, 80/230 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 4003 ms. Remains : 82/173 places, 80/230 transitions.
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N10-LTLFireability-06
Product exploration explored 100000 steps with 6844 reset in 211 ms.
Product exploration explored 100000 steps with 7052 reset in 232 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT p2)), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p1) p2))), (X (NOT p0)), (X (NOT (AND p2 p0))), (X p1), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p2 p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 14 factoid took 380 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2 p0), (AND (NOT p1) p2), (AND (NOT p1) p2 p0)]
RANDOM walk for 235 steps (0 resets) in 7 ms. (29 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT p2)), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p1) p2))), (X (NOT p0)), (X (NOT (AND p2 p0))), (X p1), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p2 p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p2) p0 p1))), (F (NOT (AND p0 (NOT p1)))), (F (NOT p0)), (F p1), (F p2), (F (NOT (OR (NOT p2) p1))), (F (NOT (OR (NOT p2) (NOT p0) p1))), (F (NOT (OR (NOT p2) (NOT p0))))]
Knowledge based reduction with 14 factoid took 558 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2 p0), (AND (NOT p1) p2), (AND (NOT p1) p2 p0)]
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2 p0), (AND (NOT p1) p2), (AND (NOT p1) p2 p0)]
Support contains 30 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 80/80 transitions.
Applied a total of 0 rules in 1 ms. Remains 82 /82 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2024-06-01 16:15:37] [INFO ] Invariant cache hit.
[2024-06-01 16:15:37] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-01 16:15:37] [INFO ] Invariant cache hit.
[2024-06-01 16:15:37] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
Running 70 sub problems to find dead transitions.
[2024-06-01 16:15:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (OVERLAPS) 10/82 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 80/162 variables, 82/104 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (OVERLAPS) 0/162 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 104 constraints, problems are : Problem set: 0 solved, 70 unsolved in 1541 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 82/82 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 70 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (OVERLAPS) 10/82 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 80/162 variables, 82/104 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 70/174 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (OVERLAPS) 0/162 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 174 constraints, problems are : Problem set: 0 solved, 70 unsolved in 1581 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 82/82 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 0/0 constraints]
After SMT, in 3136ms problems are : Problem set: 0 solved, 70 unsolved
Search for dead transitions found 0 dead transitions in 3137ms
Finished structural reductions in LTL mode , in 1 iterations and 3326 ms. Remains : 82/82 places, 80/80 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p2)), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT p0)), (X (NOT (AND p2 p0))), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 14 factoid took 303 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 293 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2 p0), (AND (NOT p1) p2), (AND (NOT p1) p2 p0)]
RANDOM walk for 200 steps (0 resets) in 6 ms. (28 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p2)), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT p0)), (X (NOT (AND p2 p0))), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p2) p0 p1))), (F (NOT (AND p0 (NOT p1)))), (F (NOT p0)), (F p1), (F p2), (F (NOT (OR (NOT p2) p1))), (F (NOT (OR (NOT p2) (NOT p0) p1))), (F (NOT (OR (NOT p2) (NOT p0))))]
Knowledge based reduction with 14 factoid took 616 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2 p0), (AND (NOT p1) p2), (AND (NOT p1) p2 p0)]
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2 p0), (AND (NOT p1) p2), (AND (NOT p1) p2 p0)]
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2 p0), (AND (NOT p1) p2), (AND (NOT p1) p2 p0)]
Product exploration explored 100000 steps with 6695 reset in 212 ms.
Product exploration explored 100000 steps with 6989 reset in 234 ms.
Support contains 30 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 80/80 transitions.
Applied a total of 0 rules in 1 ms. Remains 82 /82 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2024-06-01 16:15:42] [INFO ] Invariant cache hit.
[2024-06-01 16:15:43] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-06-01 16:15:43] [INFO ] Invariant cache hit.
[2024-06-01 16:15:43] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
Running 70 sub problems to find dead transitions.
[2024-06-01 16:15:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (OVERLAPS) 10/82 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 80/162 variables, 82/104 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (OVERLAPS) 0/162 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 104 constraints, problems are : Problem set: 0 solved, 70 unsolved in 1592 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 82/82 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 70 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (OVERLAPS) 10/82 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 80/162 variables, 82/104 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 70/174 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (OVERLAPS) 0/162 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 174 constraints, problems are : Problem set: 0 solved, 70 unsolved in 1665 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 82/82 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 0/0 constraints]
After SMT, in 3277ms problems are : Problem set: 0 solved, 70 unsolved
Search for dead transitions found 0 dead transitions in 3278ms
Finished structural reductions in LTL mode , in 1 iterations and 3445 ms. Remains : 82/82 places, 80/80 transitions.
Treatment of property UtilityControlRoom-COL-Z2T3N10-LTLFireability-06 finished in 15370 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((F(p0) U X(!p1))))))'
[2024-06-01 16:15:46] [INFO ] Flatten gal took : 22 ms
[2024-06-01 16:15:46] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2024-06-01 16:15:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 173 places, 230 transitions and 660 arcs took 8 ms.
Total runtime 321731 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : UtilityControlRoom-COL-Z2T3N10-LTLFireability-06
Could not compute solution for formula : UtilityControlRoom-COL-Z2T3N10-LTLFireability-09

BK_STOP 1717258624262

--------------------
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-Z2T3N10-LTLFireability-06
ltl formula formula --ltl=/tmp/1990/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 173 places, 230 transitions and 660 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.030 real 0.010 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1990/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1990/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1990/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1990/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 174 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 174, there are 365 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): ~53 levels ~10000 states ~19744 transitions
pnml2lts-mc( 1/ 4): ~116 levels ~20000 states ~36204 transitions
pnml2lts-mc( 0/ 4): ~54 levels ~40000 states ~86904 transitions
pnml2lts-mc( 0/ 4): ~54 levels ~80000 states ~190804 transitions
pnml2lts-mc( 0/ 4): ~54 levels ~160000 states ~377288 transitions
pnml2lts-mc( 0/ 4): ~54 levels ~320000 states ~727724 transitions
pnml2lts-mc( 0/ 4): ~54 levels ~640000 states ~1501956 transitions
pnml2lts-mc( 0/ 4): ~408 levels ~1280000 states ~2827004 transitions
pnml2lts-mc( 1/ 4): ~120 levels ~2560000 states ~6812876 transitions
pnml2lts-mc( 1/ 4): ~131 levels ~5120000 states ~13666552 transitions
pnml2lts-mc( 1/ 4): ~207 levels ~10240000 states ~26976908 transitions
pnml2lts-mc( 2/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 12948783
pnml2lts-mc( 0/ 4): unique states count: 12949753
pnml2lts-mc( 0/ 4): unique transitions count: 30928952
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 17971772
pnml2lts-mc( 0/ 4): - claim found count: 198
pnml2lts-mc( 0/ 4): - claim success count: 12949756
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1029
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 12949756 states 30929044 transitions, fanout: 2.388
pnml2lts-mc( 0/ 4): Total exploration time 76.640 sec (76.560 sec minimum, 76.610 sec on average)
pnml2lts-mc( 0/ 4): States per second: 168969, Transitions per second: 403563
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 162.9MB, 13.2 B/state, compr.: 1.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 38.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 230 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 162.9MB (~256.0MB paged-in)
ltl formula name UtilityControlRoom-COL-Z2T3N10-LTLFireability-09
ltl formula formula --ltl=/tmp/1990/ltl_1_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
Warning: program compiled against libxml 210 using older 209
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 173 places, 230 transitions and 660 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.040 real 0.010 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1990/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1990/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1990/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1990/ltl_1_
pnml2lts-mc( 3/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 2/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 1/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 0/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

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

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

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

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

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-Z2T3N10"
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-Z2T3N10, 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-171701110600036"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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