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.r444-smll-171701110800124.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 itstools
Input is UtilityControlRoom-COL-Z4T4N06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r444-smll-171701110800124
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 8.1K Apr 13 05:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 13 05:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 13 05:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 13 05:21 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.7K Apr 23 08:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 08:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 13 05:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K Apr 13 05:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 13 05:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K Apr 13 05:36 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-Z4T4N06-LTLFireability-00
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-LTLFireability-01
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-LTLFireability-02
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-LTLFireability-03
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-LTLFireability-04
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-LTLFireability-05
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-LTLFireability-06
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-LTLFireability-07
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-LTLFireability-08
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-LTLFireability-09
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-LTLFireability-10
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-LTLFireability-11
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-LTLFireability-12
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-LTLFireability-13
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-LTLFireability-14
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717092148373

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=UtilityControlRoom-COL-Z4T4N06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202405141337
[2024-05-30 18:02:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-30 18:02:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 18:02:30] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-30 18:02:31] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-30 18:02:31] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1053 ms
[2024-05-30 18:02:32] [INFO ] Imported 13 HL places and 12 HL transitions for a total of 228 PT places and 450.0 transition bindings in 25 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
[2024-05-30 18:02:32] [INFO ] Built PT skeleton of HLPN with 13 places and 12 transitions 37 arcs in 6 ms.
[2024-05-30 18:02:32] [INFO ] Skeletonized 16 HLPN properties in 11 ms.
Initial state reduction rules removed 2 formulas.
FORMULA UtilityControlRoom-COL-Z4T4N06-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z4T4N06-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 11 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 16 to 13
RANDOM walk for 1193 steps (0 resets) in 80 ms. (14 steps per ms) remains 0/13 properties
[2024-05-30 18:02:32] [INFO ] Flatten gal took : 24 ms
[2024-05-30 18:02:32] [INFO ] Flatten gal took : 5 ms
Transition timeout forces synchronizations/join behavior on parameter c of sort Cli
Domain [Cli(6), Z(4), Z(4)] of place MovetoZ breaks symmetries in sort Z
[2024-05-30 18:02:32] [INFO ] Unfolded HLPN to a Petri net with 228 places and 450 transitions 1446 arcs in 49 ms.
[2024-05-30 18:02:32] [INFO ] Unfolded 14 HLPN properties in 1 ms.
[2024-05-30 18:02:32] [INFO ] Reduced 18 identical enabling conditions.
[2024-05-30 18:02:32] [INFO ] Reduced 18 identical enabling conditions.
[2024-05-30 18:02:32] [INFO ] Reduced 18 identical enabling conditions.
[2024-05-30 18:02:32] [INFO ] Reduced 18 identical enabling conditions.
[2024-05-30 18:02:32] [INFO ] Reduced 18 identical enabling conditions.
[2024-05-30 18:02:32] [INFO ] Reduced 18 identical enabling conditions.
[2024-05-30 18:02:32] [INFO ] Reduced 18 identical enabling conditions.
Ensure Unique test removed 96 transitions
Reduce redundant transitions removed 96 transitions.
Support contains 203 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 354/354 transitions.
Applied a total of 0 rules in 18 ms. Remains 228 /228 variables (removed 0) and now considering 354/354 (removed 0) transitions.
// Phase 1: matrix 354 rows 228 cols
[2024-05-30 18:02:32] [INFO ] Computed 15 invariants in 44 ms
[2024-05-30 18:02:33] [INFO ] Implicit Places using invariants in 493 ms returned [185]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 546 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 227/228 places, 354/354 transitions.
Applied a total of 0 rules in 9 ms. Remains 227 /227 variables (removed 0) and now considering 354/354 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 591 ms. Remains : 227/228 places, 354/354 transitions.
Support contains 203 out of 227 places after structural reductions.
[2024-05-30 18:02:33] [INFO ] Flatten gal took : 98 ms
[2024-05-30 18:02:33] [INFO ] Flatten gal took : 115 ms
[2024-05-30 18:02:34] [INFO ] Input system was already deterministic with 354 transitions.
RANDOM walk for 468 steps (0 resets) in 73 ms. (6 steps per ms) remains 0/14 properties
FORMULA UtilityControlRoom-COL-Z4T4N06-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 30 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 354/354 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 155 transition count 282
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 155 transition count 282
Applied a total of 144 rules in 35 ms. Remains 155 /227 variables (removed 72) and now considering 282/354 (removed 72) transitions.
// Phase 1: matrix 282 rows 155 cols
[2024-05-30 18:02:34] [INFO ] Computed 14 invariants in 6 ms
[2024-05-30 18:02:34] [INFO ] Implicit Places using invariants in 179 ms returned []
[2024-05-30 18:02:34] [INFO ] Invariant cache hit.
[2024-05-30 18:02:35] [INFO ] Implicit Places using invariants and state equation in 394 ms returned []
Implicit Place search using SMT with State Equation took 582 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2024-05-30 18:02:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 169 constraints, problems are : Problem set: 0 solved, 276 unsolved in 13186 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 276/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 437/437 variables, and 445 constraints, problems are : Problem set: 0 solved, 276 unsolved in 20154 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
After SMT, in 34237ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 34271ms
Starting structural reductions in LTL mode, iteration 1 : 155/227 places, 282/354 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34894 ms. Remains : 155/227 places, 282/354 transitions.
Stuttering acceptance computed with spot in 320 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N06-LTLFireability-00
Product exploration explored 100000 steps with 1512 reset in 817 ms.
Product exploration explored 100000 steps with 1420 reset in 480 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 : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 120 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 473 steps (0 resets) in 9 ms. (47 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 136 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
[2024-05-30 18:03:11] [INFO ] Invariant cache hit.
[2024-05-30 18:03:12] [INFO ] [Real]Absence check using 14 positive place invariants in 15 ms returned unsat
Proved EG (NOT p0)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 3 factoid took 172 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z4T4N06-LTLFireability-00 FALSE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z4T4N06-LTLFireability-00 finished in 37828 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F((X((!p0 U (G(!p0)||p1))) U (G(X((!p0 U (p1||G(!p0)))))||(X((!p0 U (p1||G(!p0))))&&p2))))) U (G(X(F((X((!p0 U (p1||G(!p0)))) U ((p2&&X((!p0 U (p1||G(!p0)))))||G(X((!p0 U (p1||G(!p0))))))))))||(G(!p2)&&X(F((X((!p0 U (p1||G(!p0)))) U ((p2&&X((!p0 U (p1||G(!p0)))))||G(X((!p0 U (p1||G(!p0)))))))))))))'
Support contains 83 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 354/354 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 155 transition count 282
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 155 transition count 282
Applied a total of 144 rules in 18 ms. Remains 155 /227 variables (removed 72) and now considering 282/354 (removed 72) transitions.
[2024-05-30 18:03:12] [INFO ] Invariant cache hit.
[2024-05-30 18:03:12] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-30 18:03:12] [INFO ] Invariant cache hit.
[2024-05-30 18:03:12] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2024-05-30 18:03:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 169 constraints, problems are : Problem set: 0 solved, 276 unsolved in 15797 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 276/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 437/437 variables, and 445 constraints, problems are : Problem set: 0 solved, 276 unsolved in 22759 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
After SMT, in 39197ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 39207ms
Starting structural reductions in LTL mode, iteration 1 : 155/227 places, 282/354 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39529 ms. Remains : 155/227 places, 282/354 transitions.
Stuttering acceptance computed with spot in 198 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N06-LTLFireability-01
Product exploration explored 100000 steps with 1942 reset in 1211 ms.
Product exploration explored 100000 steps with 1991 reset in 1302 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 (NOT p2)), (X (NOT p2)), (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))))), (X (X (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2)))))]
Knowledge based reduction with 14 factoid took 516 ms. Reduced automaton from 3 states, 10 edges and 3 AP (stutter sensitive) to 3 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 109 steps (0 resets) in 11 ms. (9 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT p2)), (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))))), (X (X (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))), (F (NOT (AND (OR p0 (NOT p2)) (OR (NOT p2) (NOT p1))))), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT p1)), (F p0), (F p2), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1))))]
Knowledge based reduction with 14 factoid took 892 ms. Reduced automaton from 3 states, 10 edges and 3 AP (stutter sensitive) to 3 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 315 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 170 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 83 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 282/282 transitions.
Applied a total of 0 rules in 6 ms. Remains 155 /155 variables (removed 0) and now considering 282/282 (removed 0) transitions.
[2024-05-30 18:03:56] [INFO ] Invariant cache hit.
[2024-05-30 18:03:56] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-30 18:03:56] [INFO ] Invariant cache hit.
[2024-05-30 18:03:57] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2024-05-30 18:03:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 169 constraints, problems are : Problem set: 0 solved, 276 unsolved in 13651 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 276/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 437/437 variables, and 445 constraints, problems are : Problem set: 0 solved, 276 unsolved in 19464 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
After SMT, in 33728ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 33741ms
Finished structural reductions in LTL mode , in 1 iterations and 34053 ms. Remains : 155/155 places, 282/282 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p2)), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (OR (AND (NOT p0) p2) (AND p2 p1)))), (X (NOT p0)), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1))), (X p1), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (OR (AND (NOT p0) p2) (AND p2 p1)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p2 p1))))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1)))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1)))))]
Knowledge based reduction with 14 factoid took 384 ms. Reduced automaton from 3 states, 10 edges and 3 AP (stutter sensitive) to 3 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 173 steps (0 resets) in 9 ms. (17 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p2)), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (OR (AND (NOT p0) p2) (AND p2 p1)))), (X (NOT p0)), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1))), (X p1), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (OR (AND (NOT p0) p2) (AND p2 p1)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p2 p1))))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1)))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1))))), (F (NOT (OR p1 p2 (NOT p0)))), (F (NOT (AND (OR (NOT p1) (NOT p2)) (OR (NOT p2) p0)))), (F (NOT (OR p1 p0))), (F p0), (F p2), (F (NOT (OR (AND p1 (NOT p2)) (AND (NOT p2) (NOT p0))))), (F (NOT (OR p1 (NOT p2) (NOT p0)))), (F (NOT p1))]
Knowledge based reduction with 14 factoid took 881 ms. Reduced automaton from 3 states, 10 edges and 3 AP (stutter sensitive) to 3 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 241 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 178 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 170 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 1942 reset in 2094 ms.
Product exploration explored 100000 steps with 1999 reset in 1670 ms.
Built C files in :
/tmp/ltsmin4830113647059658827
[2024-05-30 18:04:36] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4830113647059658827
Running compilation step : cd /tmp/ltsmin4830113647059658827;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1242 ms.
Running link step : cd /tmp/ltsmin4830113647059658827;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin4830113647059658827;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7641568568515336518.hoa' '--buchi-type=spotba'
LTSmin run took 271 ms.
FORMULA UtilityControlRoom-COL-Z4T4N06-LTLFireability-01 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-COL-Z4T4N06-LTLFireability-01 finished in 86218 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U p1))'
Support contains 149 out of 227 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 227/227 places, 354/354 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 221 transition count 348
Applied a total of 12 rules in 38 ms. Remains 221 /227 variables (removed 6) and now considering 348/354 (removed 6) transitions.
// Phase 1: matrix 348 rows 221 cols
[2024-05-30 18:04:38] [INFO ] Computed 14 invariants in 5 ms
[2024-05-30 18:04:38] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-30 18:04:38] [INFO ] Invariant cache hit.
[2024-05-30 18:04:38] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 386 ms to find 0 implicit places.
[2024-05-30 18:04:39] [INFO ] Redundant transitions in 28 ms returned []
Running 318 sub problems to find dead transitions.
[2024-05-30 18:04:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/215 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 2 (OVERLAPS) 6/221 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 4 (OVERLAPS) 348/569 variables, 221/235 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/569 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 6 (OVERLAPS) 0/569 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 318 unsolved
No progress, stopping.
After SMT solving in domain Real declared 569/569 variables, and 235 constraints, problems are : Problem set: 0 solved, 318 unsolved in 19132 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 221/221 constraints, PredecessorRefiner: 318/318 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 318 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/215 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 2 (OVERLAPS) 6/221 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 4 (OVERLAPS) 348/569 variables, 221/235 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/569 variables, 318/553 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/569 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 7 (OVERLAPS) 0/569 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 318 unsolved
No progress, stopping.
After SMT solving in domain Int declared 569/569 variables, and 553 constraints, problems are : Problem set: 0 solved, 318 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 221/221 constraints, PredecessorRefiner: 318/318 constraints, Known Traps: 0/0 constraints]
After SMT, in 49751ms problems are : Problem set: 0 solved, 318 unsolved
Search for dead transitions found 0 dead transitions in 49759ms
Starting structural reductions in SI_LTL mode, iteration 1 : 221/227 places, 348/354 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 50223 ms. Remains : 221/227 places, 348/354 transitions.
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N06-LTLFireability-02
Product exploration explored 100000 steps with 44660 reset in 1868 ms.
Product exploration explored 100000 steps with 44637 reset in 1668 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 445 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[true, (NOT p1)]
RANDOM walk for 56 steps (0 resets) in 6 ms. (8 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT (OR p1 (NOT p0)))), (F (NOT (AND (NOT p1) (NOT p0)))), (F p0)]
Knowledge based reduction with 3 factoid took 653 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[true, (NOT p1)]
Stuttering acceptance computed with spot in 68 ms :[true, (NOT p1)]
[2024-05-30 18:05:33] [INFO ] Invariant cache hit.
[2024-05-30 18:05:35] [INFO ] [Real]Absence check using 14 positive place invariants in 27 ms returned sat
[2024-05-30 18:05:35] [INFO ] [Real]Absence check using state equation in 354 ms returned sat
[2024-05-30 18:05:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 18:05:36] [INFO ] [Nat]Absence check using 14 positive place invariants in 20 ms returned sat
[2024-05-30 18:05:36] [INFO ] [Nat]Absence check using state equation in 384 ms returned sat
[2024-05-30 18:05:37] [INFO ] Computed and/alt/rep : 318/480/318 causal constraints (skipped 0 transitions) in 45 ms.
[2024-05-30 18:05:39] [INFO ] Added : 265 causal constraints over 54 iterations in 2039 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 149 out of 221 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 221/221 places, 348/348 transitions.
Applied a total of 0 rules in 19 ms. Remains 221 /221 variables (removed 0) and now considering 348/348 (removed 0) transitions.
[2024-05-30 18:05:39] [INFO ] Invariant cache hit.
[2024-05-30 18:05:39] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-30 18:05:39] [INFO ] Invariant cache hit.
[2024-05-30 18:05:39] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
[2024-05-30 18:05:39] [INFO ] Redundant transitions in 6 ms returned []
Running 318 sub problems to find dead transitions.
[2024-05-30 18:05:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/215 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 2 (OVERLAPS) 6/221 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 4 (OVERLAPS) 348/569 variables, 221/235 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/569 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 6 (OVERLAPS) 0/569 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 318 unsolved
No progress, stopping.
After SMT solving in domain Real declared 569/569 variables, and 235 constraints, problems are : Problem set: 0 solved, 318 unsolved in 21847 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 221/221 constraints, PredecessorRefiner: 318/318 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 318 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/215 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 2 (OVERLAPS) 6/221 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 4 (OVERLAPS) 348/569 variables, 221/235 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/569 variables, 318/553 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/569 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 7 (OVERLAPS) 0/569 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 318 unsolved
No progress, stopping.
After SMT solving in domain Int declared 569/569 variables, and 553 constraints, problems are : Problem set: 0 solved, 318 unsolved in 28240 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 221/221 constraints, PredecessorRefiner: 318/318 constraints, Known Traps: 0/0 constraints]
After SMT, in 50416ms problems are : Problem set: 0 solved, 318 unsolved
Search for dead transitions found 0 dead transitions in 50422ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 50760 ms. Remains : 221/221 places, 348/348 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 p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 459 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p1)]
RANDOM walk for 48 steps (0 resets) in 7 ms. (6 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT (OR p1 (NOT p0)))), (F (NOT (AND (NOT p1) (NOT p0)))), (F p0)]
Knowledge based reduction with 3 factoid took 632 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p1)]
Stuttering acceptance computed with spot in 63 ms :[true, (NOT p1)]
[2024-05-30 18:06:31] [INFO ] Invariant cache hit.
[2024-05-30 18:06:32] [INFO ] [Real]Absence check using 14 positive place invariants in 26 ms returned sat
[2024-05-30 18:06:32] [INFO ] [Real]Absence check using state equation in 373 ms returned sat
[2024-05-30 18:06:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 18:06:33] [INFO ] [Nat]Absence check using 14 positive place invariants in 17 ms returned sat
[2024-05-30 18:06:34] [INFO ] [Nat]Absence check using state equation in 356 ms returned sat
[2024-05-30 18:06:34] [INFO ] Computed and/alt/rep : 318/480/318 causal constraints (skipped 0 transitions) in 50 ms.
[2024-05-30 18:06:36] [INFO ] Added : 265 causal constraints over 54 iterations in 2243 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p1)]
Product exploration explored 100000 steps with 44678 reset in 1815 ms.
Product exploration explored 100000 steps with 44697 reset in 1816 ms.
Built C files in :
/tmp/ltsmin9214999202340887749
[2024-05-30 18:06:40] [INFO ] Computing symmetric may disable matrix : 348 transitions.
[2024-05-30 18:06:40] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 18:06:40] [INFO ] Computing symmetric may enable matrix : 348 transitions.
[2024-05-30 18:06:40] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 18:06:40] [INFO ] Computing Do-Not-Accords matrix : 348 transitions.
[2024-05-30 18:06:40] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 18:06:40] [INFO ] Built C files in 93ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9214999202340887749
Running compilation step : cd /tmp/ltsmin9214999202340887749;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1357 ms.
Running link step : cd /tmp/ltsmin9214999202340887749;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin9214999202340887749;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3871294417452830503.hoa' '--buchi-type=spotba'
LTSmin run took 4627 ms.
FORMULA UtilityControlRoom-COL-Z4T4N06-LTLFireability-02 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-COL-Z4T4N06-LTLFireability-02 finished in 127812 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 12 out of 227 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 227/227 places, 354/354 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 227 transition count 258
Reduce places removed 96 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 216 place count 131 transition count 234
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 216 place count 131 transition count 210
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 264 place count 107 transition count 210
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 267 place count 104 transition count 138
Iterating global reduction 2 with 3 rules applied. Total rules applied 270 place count 104 transition count 138
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 288 place count 86 transition count 120
Iterating global reduction 2 with 18 rules applied. Total rules applied 306 place count 86 transition count 120
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 324 place count 68 transition count 84
Iterating global reduction 2 with 18 rules applied. Total rules applied 342 place count 68 transition count 84
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 360 place count 50 transition count 66
Iterating global reduction 2 with 18 rules applied. Total rules applied 378 place count 50 transition count 66
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 396 place count 50 transition count 48
Applied a total of 396 rules in 29 ms. Remains 50 /227 variables (removed 177) and now considering 48/354 (removed 306) transitions.
// Phase 1: matrix 48 rows 50 cols
[2024-05-30 18:06:46] [INFO ] Computed 14 invariants in 0 ms
[2024-05-30 18:06:46] [INFO ] Implicit Places using invariants in 145 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 148 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 49/227 places, 48/354 transitions.
Applied a total of 0 rules in 2 ms. Remains 49 /49 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 180 ms. Remains : 49/227 places, 48/354 transitions.
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N06-LTLFireability-03
Product exploration explored 100000 steps with 0 reset in 170 ms.
Stack based approach found an accepted trace after 349 steps with 0 reset with depth 350 and stack size 350 in 1 ms.
FORMULA UtilityControlRoom-COL-Z4T4N06-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N06-LTLFireability-03 finished in 478 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 6 out of 227 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 227/227 places, 354/354 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 227 transition count 258
Reduce places removed 96 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 216 place count 131 transition count 234
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 216 place count 131 transition count 210
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 264 place count 107 transition count 210
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 267 place count 104 transition count 138
Iterating global reduction 2 with 3 rules applied. Total rules applied 270 place count 104 transition count 138
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 288 place count 86 transition count 120
Iterating global reduction 2 with 18 rules applied. Total rules applied 306 place count 86 transition count 120
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 324 place count 68 transition count 84
Iterating global reduction 2 with 18 rules applied. Total rules applied 342 place count 68 transition count 84
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 360 place count 50 transition count 66
Iterating global reduction 2 with 18 rules applied. Total rules applied 378 place count 50 transition count 66
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 396 place count 50 transition count 48
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 25 rules applied. Total rules applied 421 place count 37 transition count 36
Applied a total of 421 rules in 44 ms. Remains 37 /227 variables (removed 190) and now considering 36/354 (removed 318) transitions.
// Phase 1: matrix 36 rows 37 cols
[2024-05-30 18:06:46] [INFO ] Computed 13 invariants in 1 ms
[2024-05-30 18:06:46] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-30 18:06:46] [INFO ] Invariant cache hit.
[2024-05-30 18:06:47] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
[2024-05-30 18:06:47] [INFO ] Redundant transitions in 0 ms returned []
Running 30 sub problems to find dead transitions.
[2024-05-30 18:06:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (OVERLAPS) 6/37 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 36/73 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 0/73 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 73/73 variables, and 50 constraints, problems are : Problem set: 0 solved, 30 unsolved in 541 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 37/37 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (OVERLAPS) 6/37 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 36/73 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 30/80 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (OVERLAPS) 0/73 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 73/73 variables, and 80 constraints, problems are : Problem set: 0 solved, 30 unsolved in 419 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 37/37 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
After SMT, in 971ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 972ms
Starting structural reductions in SI_LTL mode, iteration 1 : 37/227 places, 36/354 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1162 ms. Remains : 37/227 places, 36/354 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N06-LTLFireability-04
Product exploration explored 100000 steps with 0 reset in 270 ms.
Stack based approach found an accepted trace after 182 steps with 0 reset with depth 183 and stack size 183 in 11 ms.
FORMULA UtilityControlRoom-COL-Z4T4N06-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N06-LTLFireability-04 finished in 1501 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 59 out of 227 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 227/227 places, 354/354 transitions.
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 227 transition count 258
Reduce places removed 96 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 216 place count 131 transition count 234
Applied a total of 216 rules in 25 ms. Remains 131 /227 variables (removed 96) and now considering 234/354 (removed 120) transitions.
// Phase 1: matrix 234 rows 131 cols
[2024-05-30 18:06:48] [INFO ] Computed 14 invariants in 3 ms
[2024-05-30 18:06:48] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-30 18:06:48] [INFO ] Invariant cache hit.
[2024-05-30 18:06:48] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
[2024-05-30 18:06:48] [INFO ] Redundant transitions in 3 ms returned []
Running 228 sub problems to find dead transitions.
[2024-05-30 18:06:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (OVERLAPS) 6/131 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (OVERLAPS) 234/365 variables, 131/145 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (OVERLAPS) 0/365 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 145 constraints, problems are : Problem set: 0 solved, 228 unsolved in 9954 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 228 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (OVERLAPS) 6/131 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (OVERLAPS) 234/365 variables, 131/145 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 228/373 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (OVERLAPS) 0/365 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/365 variables, and 373 constraints, problems are : Problem set: 0 solved, 228 unsolved in 12880 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 0/0 constraints]
After SMT, in 23056ms problems are : Problem set: 0 solved, 228 unsolved
Search for dead transitions found 0 dead transitions in 23059ms
Starting structural reductions in SI_LTL mode, iteration 1 : 131/227 places, 234/354 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 23318 ms. Remains : 131/227 places, 234/354 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N06-LTLFireability-05
Product exploration explored 100000 steps with 0 reset in 679 ms.
Stack based approach found an accepted trace after 8617 steps with 0 reset with depth 8618 and stack size 8618 in 69 ms.
FORMULA UtilityControlRoom-COL-Z4T4N06-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N06-LTLFireability-05 finished in 24144 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(G(!p0)))||F(p1))))'
Support contains 42 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 354/354 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 155 transition count 282
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 155 transition count 282
Applied a total of 144 rules in 6 ms. Remains 155 /227 variables (removed 72) and now considering 282/354 (removed 72) transitions.
// Phase 1: matrix 282 rows 155 cols
[2024-05-30 18:07:12] [INFO ] Computed 14 invariants in 2 ms
[2024-05-30 18:07:12] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-30 18:07:12] [INFO ] Invariant cache hit.
[2024-05-30 18:07:12] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 279 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2024-05-30 18:07:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 169 constraints, problems are : Problem set: 0 solved, 276 unsolved in 13134 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 276/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 437/437 variables, and 445 constraints, problems are : Problem set: 0 solved, 276 unsolved in 22091 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
After SMT, in 35750ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 35754ms
Starting structural reductions in LTL mode, iteration 1 : 155/227 places, 282/354 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36041 ms. Remains : 155/227 places, 282/354 transitions.
Stuttering acceptance computed with spot in 177 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N06-LTLFireability-06
Product exploration explored 100000 steps with 50000 reset in 197 ms.
Product exploration explored 100000 steps with 50000 reset in 209 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 18 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z4T4N06-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z4T4N06-LTLFireability-06 finished in 36665 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(!p1))))'
Support contains 12 out of 227 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 227/227 places, 354/354 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 227 transition count 258
Reduce places removed 96 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 216 place count 131 transition count 234
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 216 place count 131 transition count 210
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 264 place count 107 transition count 210
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 267 place count 104 transition count 138
Iterating global reduction 2 with 3 rules applied. Total rules applied 270 place count 104 transition count 138
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 288 place count 86 transition count 120
Iterating global reduction 2 with 18 rules applied. Total rules applied 306 place count 86 transition count 120
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 324 place count 68 transition count 84
Iterating global reduction 2 with 18 rules applied. Total rules applied 342 place count 68 transition count 84
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 360 place count 50 transition count 66
Iterating global reduction 2 with 18 rules applied. Total rules applied 378 place count 50 transition count 66
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 396 place count 50 transition count 48
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 396 place count 50 transition count 42
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 408 place count 44 transition count 42
Applied a total of 408 rules in 19 ms. Remains 44 /227 variables (removed 183) and now considering 42/354 (removed 312) transitions.
// Phase 1: matrix 42 rows 44 cols
[2024-05-30 18:07:49] [INFO ] Computed 14 invariants in 1 ms
[2024-05-30 18:07:49] [INFO ] Implicit Places using invariants in 55 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 57 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/227 places, 42/354 transitions.
Applied a total of 0 rules in 8 ms. Remains 43 /43 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 85 ms. Remains : 43/227 places, 42/354 transitions.
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p0) p1), (NOT p0), p1]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N06-LTLFireability-07
Product exploration explored 100000 steps with 6779 reset in 260 ms.
Product exploration explored 100000 steps with 6790 reset in 340 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 119 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) p1), (NOT p0), p1]
RANDOM walk for 108 steps (0 resets) in 5 ms. (18 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 250 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) p1), (NOT p0), p1]
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p0) p1), (NOT p0), p1]
// Phase 1: matrix 42 rows 43 cols
[2024-05-30 18:07:50] [INFO ] Computed 13 invariants in 0 ms
[2024-05-30 18:07:50] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-30 18:07:50] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-30 18:07:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 18:07:50] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2024-05-30 18:07:50] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-30 18:07:50] [INFO ] Computed and/alt/rep : 36/54/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-30 18:07:50] [INFO ] Added : 11 causal constraints over 3 iterations in 24 ms. Result :sat
Could not prove EG p1
Support contains 12 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 42/42 transitions.
Applied a total of 0 rules in 2 ms. Remains 43 /43 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2024-05-30 18:07:50] [INFO ] Invariant cache hit.
[2024-05-30 18:07:51] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-30 18:07:51] [INFO ] Invariant cache hit.
[2024-05-30 18:07:51] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2024-05-30 18:07:51] [INFO ] Redundant transitions in 0 ms returned []
Running 36 sub problems to find dead transitions.
[2024-05-30 18:07:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (OVERLAPS) 6/43 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (OVERLAPS) 42/85 variables, 43/56 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (OVERLAPS) 0/85 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Real declared 85/85 variables, and 56 constraints, problems are : Problem set: 0 solved, 36 unsolved in 538 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 43/43 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 36 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (OVERLAPS) 6/43 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (OVERLAPS) 42/85 variables, 43/56 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 36/92 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (OVERLAPS) 0/85 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Int declared 85/85 variables, and 92 constraints, problems are : Problem set: 0 solved, 36 unsolved in 513 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 43/43 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
After SMT, in 1058ms problems are : Problem set: 0 solved, 36 unsolved
Search for dead transitions found 0 dead transitions in 1059ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1157 ms. Remains : 43/43 places, 42/42 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 115 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) p1), (NOT p0), p1]
RANDOM walk for 85 steps (0 resets) in 5 ms. (14 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 179 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) p1), (NOT p0), p1]
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) p1), (NOT p0), p1]
[2024-05-30 18:07:52] [INFO ] Invariant cache hit.
[2024-05-30 18:07:52] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2024-05-30 18:07:52] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-30 18:07:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 18:07:52] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-05-30 18:07:53] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-30 18:07:53] [INFO ] Computed and/alt/rep : 36/54/36 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-30 18:07:53] [INFO ] Added : 11 causal constraints over 3 iterations in 37 ms. Result :sat
Could not prove EG p1
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) p1), (NOT p0), p1]
Product exploration explored 100000 steps with 6723 reset in 249 ms.
Product exploration explored 100000 steps with 6725 reset in 269 ms.
Built C files in :
/tmp/ltsmin5511020971077373621
[2024-05-30 18:07:53] [INFO ] Computing symmetric may disable matrix : 42 transitions.
[2024-05-30 18:07:53] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 18:07:53] [INFO ] Computing symmetric may enable matrix : 42 transitions.
[2024-05-30 18:07:53] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 18:07:53] [INFO ] Computing Do-Not-Accords matrix : 42 transitions.
[2024-05-30 18:07:53] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 18:07:53] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5511020971077373621
Running compilation step : cd /tmp/ltsmin5511020971077373621;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 295 ms.
Running link step : cd /tmp/ltsmin5511020971077373621;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin5511020971077373621;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16768209769091539232.hoa' '--buchi-type=spotba'
LTSmin run took 7401 ms.
FORMULA UtilityControlRoom-COL-Z4T4N06-LTLFireability-07 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-COL-Z4T4N06-LTLFireability-07 finished in 12295 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||X(F((!p1 U (G(!p1)||(!p1&&F(p2)))))))))'
Support contains 42 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 354/354 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 155 transition count 282
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 155 transition count 282
Applied a total of 144 rules in 6 ms. Remains 155 /227 variables (removed 72) and now considering 282/354 (removed 72) transitions.
// Phase 1: matrix 282 rows 155 cols
[2024-05-30 18:08:01] [INFO ] Computed 14 invariants in 2 ms
[2024-05-30 18:08:01] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-30 18:08:01] [INFO ] Invariant cache hit.
[2024-05-30 18:08:01] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2024-05-30 18:08:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 169 constraints, problems are : Problem set: 0 solved, 276 unsolved in 15094 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 276/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 437/437 variables, and 445 constraints, problems are : Problem set: 0 solved, 276 unsolved in 21654 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
After SMT, in 37299ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 37303ms
Starting structural reductions in LTL mode, iteration 1 : 155/227 places, 282/354 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37619 ms. Remains : 155/227 places, 282/354 transitions.
Stuttering acceptance computed with spot in 246 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, (AND (NOT p0) p1), (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N06-LTLFireability-09
Product exploration explored 100000 steps with 1311 reset in 815 ms.
Product exploration explored 100000 steps with 1390 reset in 544 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 6 factoid took 293 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[p1, p1, p1, (AND p1 (NOT p2))]
RANDOM walk for 155 steps (0 resets) in 5 ms. (25 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F p1), (F p2), (F (NOT (OR (NOT p1) p2))), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 6 factoid took 538 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[p1, p1, p1, (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 156 ms :[p1, p1, p1, (AND p1 (NOT p2))]
Support contains 36 out of 155 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 282/282 transitions.
Applied a total of 0 rules in 2 ms. Remains 155 /155 variables (removed 0) and now considering 282/282 (removed 0) transitions.
[2024-05-30 18:08:42] [INFO ] Invariant cache hit.
[2024-05-30 18:08:42] [INFO ] Implicit Places using invariants in 150 ms returned []
[2024-05-30 18:08:42] [INFO ] Invariant cache hit.
[2024-05-30 18:08:42] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 459 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2024-05-30 18:08:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 169 constraints, problems are : Problem set: 0 solved, 276 unsolved in 11820 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 276/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 437/437 variables, and 445 constraints, problems are : Problem set: 0 solved, 276 unsolved in 20803 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
After SMT, in 33175ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 33182ms
Finished structural reductions in LTL mode , in 1 iterations and 33645 ms. Remains : 155/155 places, 282/282 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)), (X (X (NOT p2)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 184 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[p1, p1, p1, (AND p1 (NOT p2))]
RANDOM walk for 200 steps (0 resets) in 6 ms. (28 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (X (NOT p2)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT p1))), (F p1), (F p2), (F (NOT (OR (NOT p1) p2))), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 2 factoid took 327 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[p1, p1, p1, (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 183 ms :[p1, p1, p1, (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 190 ms :[p1, p1, p1, (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 1372 reset in 364 ms.
Stack based approach found an accepted trace after 21672 steps with 301 reset with depth 39 and stack size 39 in 82 ms.
FORMULA UtilityControlRoom-COL-Z4T4N06-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N06-LTLFireability-09 finished in 75957 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&&X(p2)))))'
Support contains 36 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 354/354 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 155 transition count 282
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 155 transition count 282
Applied a total of 144 rules in 3 ms. Remains 155 /227 variables (removed 72) and now considering 282/354 (removed 72) transitions.
[2024-05-30 18:09:17] [INFO ] Invariant cache hit.
[2024-05-30 18:09:17] [INFO ] Implicit Places using invariants in 192 ms returned []
[2024-05-30 18:09:17] [INFO ] Invariant cache hit.
[2024-05-30 18:09:17] [INFO ] Implicit Places using invariants and state equation in 332 ms returned []
Implicit Place search using SMT with State Equation took 527 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2024-05-30 18:09:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 169 constraints, problems are : Problem set: 0 solved, 276 unsolved in 13339 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 276/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 437/437 variables, and 445 constraints, problems are : Problem set: 0 solved, 276 unsolved in 21589 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
After SMT, in 35433ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 35440ms
Starting structural reductions in LTL mode, iteration 1 : 155/227 places, 282/354 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35972 ms. Remains : 155/227 places, 282/354 transitions.
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N06-LTLFireability-10
Product exploration explored 100000 steps with 8132 reset in 536 ms.
Product exploration explored 100000 steps with 8149 reset in 507 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 p1)), (X p2), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X p0), (X (X (NOT p1))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Knowledge based reduction with 24 factoid took 357 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
RANDOM walk for 222 steps (0 resets) in 20 ms. (10 steps per ms) remains 0/13 properties
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p1)), (X p2), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X p0), (X (X (NOT p1))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND p0 (NOT p1) (NOT p2)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT (OR p0 p1 p2))), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT p0)), (F (NOT (OR (NOT p0) (NOT p1) p2))), (F p1), (F (NOT (AND p0 (NOT p1)))), (F p2), (F (NOT (OR (NOT p1) p2))), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 24 factoid took 925 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Support contains 36 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 282/282 transitions.
Applied a total of 0 rules in 1 ms. Remains 155 /155 variables (removed 0) and now considering 282/282 (removed 0) transitions.
[2024-05-30 18:09:56] [INFO ] Invariant cache hit.
[2024-05-30 18:09:56] [INFO ] Implicit Places using invariants in 148 ms returned []
[2024-05-30 18:09:56] [INFO ] Invariant cache hit.
[2024-05-30 18:09:56] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 430 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2024-05-30 18:09:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 169 constraints, problems are : Problem set: 0 solved, 276 unsolved in 12040 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 276/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 437/437 variables, and 445 constraints, problems are : Problem set: 0 solved, 276 unsolved in 18399 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
After SMT, in 30778ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 30781ms
Finished structural reductions in LTL mode , in 1 iterations and 31213 ms. Remains : 155/155 places, 282/282 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 p1)), (X p2), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X p0), (X (X (NOT p1))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Knowledge based reduction with 24 factoid took 485 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
RANDOM walk for 293 steps (0 resets) in 19 ms. (14 steps per ms) remains 0/13 properties
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p1)), (X p2), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X p0), (X (X (NOT p1))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND p0 (NOT p1) (NOT p2)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT (OR p0 p1 p2))), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT p0)), (F (NOT (OR (NOT p0) (NOT p1) p2))), (F p1), (F (NOT (AND p0 (NOT p1)))), (F p2), (F (NOT (OR (NOT p1) p2))), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 24 factoid took 947 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 337 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 178 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 190 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 8145 reset in 704 ms.
Product exploration explored 100000 steps with 8262 reset in 418 ms.
Built C files in :
/tmp/ltsmin8381289132075288966
[2024-05-30 18:10:31] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8381289132075288966
Running compilation step : cd /tmp/ltsmin8381289132075288966;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 849 ms.
Running link step : cd /tmp/ltsmin8381289132075288966;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin8381289132075288966;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4479093323575886435.hoa' '--buchi-type=spotba'
LTSmin run took 4411 ms.
FORMULA UtilityControlRoom-COL-Z4T4N06-LTLFireability-10 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-COL-Z4T4N06-LTLFireability-10 finished in 79250 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 54 out of 227 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 227/227 places, 354/354 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 155 transition count 282
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 155 transition count 282
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 0 with 72 rules applied. Total rules applied 216 place count 119 transition count 246
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 0 with 24 rules applied. Total rules applied 240 place count 119 transition count 222
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 243 place count 116 transition count 150
Ensure Unique test removed 1 places
Iterating global reduction 0 with 4 rules applied. Total rules applied 247 place count 115 transition count 150
Applied a total of 247 rules in 22 ms. Remains 115 /227 variables (removed 112) and now considering 150/354 (removed 204) transitions.
// Phase 1: matrix 150 rows 115 cols
[2024-05-30 18:10:36] [INFO ] Computed 13 invariants in 1 ms
[2024-05-30 18:10:36] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-30 18:10:36] [INFO ] Invariant cache hit.
[2024-05-30 18:10:36] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
[2024-05-30 18:10:36] [INFO ] Redundant transitions in 0 ms returned []
Running 126 sub problems to find dead transitions.
[2024-05-30 18:10:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (OVERLAPS) 6/115 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (OVERLAPS) 150/265 variables, 115/128 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/265 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (OVERLAPS) 0/265 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/265 variables, and 128 constraints, problems are : Problem set: 0 solved, 126 unsolved in 3735 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 115/115 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (OVERLAPS) 6/115 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (OVERLAPS) 150/265 variables, 115/128 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/265 variables, 126/254 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/265 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (OVERLAPS) 0/265 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Int declared 265/265 variables, and 254 constraints, problems are : Problem set: 0 solved, 126 unsolved in 4040 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 115/115 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 0/0 constraints]
After SMT, in 7853ms problems are : Problem set: 0 solved, 126 unsolved
Search for dead transitions found 0 dead transitions in 7857ms
Starting structural reductions in SI_LTL mode, iteration 1 : 115/227 places, 150/354 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8094 ms. Remains : 115/227 places, 150/354 transitions.
Stuttering acceptance computed with spot in 102 ms :[true, (NOT p1), (AND (NOT p1) p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N06-LTLFireability-13
Entered a terminal (fully accepting) state of product in 12 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z4T4N06-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N06-LTLFireability-13 finished in 8217 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!p0)))'
Support contains 24 out of 227 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 227/227 places, 354/354 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 155 transition count 282
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 155 transition count 282
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 0 with 72 rules applied. Total rules applied 216 place count 119 transition count 246
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 0 with 24 rules applied. Total rules applied 240 place count 119 transition count 222
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 243 place count 116 transition count 150
Ensure Unique test removed 1 places
Iterating global reduction 0 with 4 rules applied. Total rules applied 247 place count 115 transition count 150
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 265 place count 97 transition count 114
Iterating global reduction 0 with 18 rules applied. Total rules applied 283 place count 97 transition count 114
Applied a total of 283 rules in 43 ms. Remains 97 /227 variables (removed 130) and now considering 114/354 (removed 240) transitions.
// Phase 1: matrix 114 rows 97 cols
[2024-05-30 18:10:44] [INFO ] Computed 13 invariants in 2 ms
[2024-05-30 18:10:45] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-30 18:10:45] [INFO ] Invariant cache hit.
[2024-05-30 18:10:45] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
[2024-05-30 18:10:45] [INFO ] Redundant transitions in 0 ms returned []
Running 90 sub problems to find dead transitions.
[2024-05-30 18:10:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (OVERLAPS) 6/97 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 114/211 variables, 97/110 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (OVERLAPS) 0/211 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 211/211 variables, and 110 constraints, problems are : Problem set: 0 solved, 90 unsolved in 2966 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 97/97 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/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (OVERLAPS) 6/97 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 114/211 variables, 97/110 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 90/200 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (OVERLAPS) 0/211 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 211/211 variables, and 200 constraints, problems are : Problem set: 0 solved, 90 unsolved in 2522 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 97/97 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 0/0 constraints]
After SMT, in 5533ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 5535ms
Starting structural reductions in SI_LTL mode, iteration 1 : 97/227 places, 114/354 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5866 ms. Remains : 97/227 places, 114/354 transitions.
Stuttering acceptance computed with spot in 82 ms :[p0, p0]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N06-LTLFireability-14
Product exploration explored 100000 steps with 3639 reset in 361 ms.
Stack based approach found an accepted trace after 7112 steps with 269 reset with depth 24 and stack size 24 in 40 ms.
FORMULA UtilityControlRoom-COL-Z4T4N06-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N06-LTLFireability-14 finished in 6372 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X(F(p1))))))'
Support contains 59 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 354/354 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 155 transition count 282
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 155 transition count 282
Applied a total of 144 rules in 5 ms. Remains 155 /227 variables (removed 72) and now considering 282/354 (removed 72) transitions.
// Phase 1: matrix 282 rows 155 cols
[2024-05-30 18:10:51] [INFO ] Computed 14 invariants in 8 ms
[2024-05-30 18:10:51] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-05-30 18:10:51] [INFO ] Invariant cache hit.
[2024-05-30 18:10:51] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2024-05-30 18:10:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 169 constraints, problems are : Problem set: 0 solved, 276 unsolved in 14520 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 276/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 437/437 variables, and 445 constraints, problems are : Problem set: 0 solved, 276 unsolved in 18431 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
After SMT, in 33277ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 33281ms
Starting structural reductions in LTL mode, iteration 1 : 155/227 places, 282/354 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33632 ms. Remains : 155/227 places, 282/354 transitions.
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N06-LTLFireability-15
Product exploration explored 100000 steps with 33333 reset in 773 ms.
Product exploration explored 100000 steps with 33333 reset in 749 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 20 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z4T4N06-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z4T4N06-LTLFireability-15 finished in 35324 ms.
All properties solved by simple procedures.
Total runtime 535985 ms.

BK_STOP 1717092686648

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-Z4T4N06"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is UtilityControlRoom-COL-Z4T4N06, 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 r444-smll-171701110800124"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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