MCC'2024- Execution of r443-smll-171701109800116

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

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
681.752	378667.00	468415.00	1772.20	TTFFTTFFFFFFFFFT	normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 7.7K Apr 13 05:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Apr 13 05:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 13 05:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 13 05:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K Apr 23 08:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 23 08:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 23 08:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 08:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 13 05:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K Apr 13 05:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 13 05:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Apr 13 05:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 08:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 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-Z4T4N04-LTLFireability-00
FORMULA_NAME UtilityControlRoom-COL-Z4T4N04-LTLFireability-01
FORMULA_NAME UtilityControlRoom-COL-Z4T4N04-LTLFireability-02
FORMULA_NAME UtilityControlRoom-COL-Z4T4N04-LTLFireability-03
FORMULA_NAME UtilityControlRoom-COL-Z4T4N04-LTLFireability-04
FORMULA_NAME UtilityControlRoom-COL-Z4T4N04-LTLFireability-05
FORMULA_NAME UtilityControlRoom-COL-Z4T4N04-LTLFireability-06
FORMULA_NAME UtilityControlRoom-COL-Z4T4N04-LTLFireability-07
FORMULA_NAME UtilityControlRoom-COL-Z4T4N04-LTLFireability-08
FORMULA_NAME UtilityControlRoom-COL-Z4T4N04-LTLFireability-09
FORMULA_NAME UtilityControlRoom-COL-Z4T4N04-LTLFireability-10
FORMULA_NAME UtilityControlRoom-COL-Z4T4N04-LTLFireability-11
FORMULA_NAME UtilityControlRoom-COL-Z4T4N04-LTLFireability-12
FORMULA_NAME UtilityControlRoom-COL-Z4T4N04-LTLFireability-13
FORMULA_NAME UtilityControlRoom-COL-Z4T4N04-LTLFireability-14
FORMULA_NAME UtilityControlRoom-COL-Z4T4N04-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717065915884

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=UtilityControlRoom-COL-Z4T4N04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 10:45:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-30 10:45:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 10:45:18] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-30 10:45:19] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-30 10:45:19] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1487 ms
[2024-05-30 10:45:19] [INFO ] Imported 13 HL places and 12 HL transitions for a total of 154 PT places and 300.0 transition bindings in 34 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 26 ms.
Working with output stream class java.io.PrintStream
[2024-05-30 10:45:20] [INFO ] Built PT skeleton of HLPN with 13 places and 12 transitions 37 arcs in 8 ms.
[2024-05-30 10:45:20] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Initial state reduction rules removed 3 formulas.
FORMULA UtilityControlRoom-COL-Z4T4N04-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z4T4N04-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z4T4N04-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 12 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 15 to 12
RANDOM walk for 21330 steps (4 resets) in 529 ms. (40 steps per ms) remains 0/12 properties
[2024-05-30 10:45:20] [INFO ] Flatten gal took : 32 ms
[2024-05-30 10:45:20] [INFO ] Flatten gal took : 8 ms
Transition timeout forces synchronizations/join behavior on parameter c of sort Cli
Domain [Cli(4), Z(4), Z(4)] of place MovetoZ breaks symmetries in sort Z
[2024-05-30 10:45:20] [INFO ] Unfolded HLPN to a Petri net with 154 places and 300 transitions 964 arcs in 49 ms.
[2024-05-30 10:45:20] [INFO ] Unfolded 13 HLPN properties in 17 ms.
[2024-05-30 10:45:20] [INFO ] Reduced 12 identical enabling conditions.
[2024-05-30 10:45:20] [INFO ] Reduced 12 identical enabling conditions.
[2024-05-30 10:45:20] [INFO ] Reduced 12 identical enabling conditions.
Ensure Unique test removed 64 transitions
Reduce redundant transitions removed 64 transitions.
Support contains 137 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 236/236 transitions.
Applied a total of 0 rules in 11 ms. Remains 154 /154 variables (removed 0) and now considering 236/236 (removed 0) transitions.
// Phase 1: matrix 236 rows 154 cols
[2024-05-30 10:45:21] [INFO ] Computed 11 invariants in 32 ms
[2024-05-30 10:45:21] [INFO ] Implicit Places using invariants in 359 ms returned [125]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 406 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 153/154 places, 236/236 transitions.
Applied a total of 0 rules in 4 ms. Remains 153 /153 variables (removed 0) and now considering 236/236 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 436 ms. Remains : 153/154 places, 236/236 transitions.
Support contains 137 out of 153 places after structural reductions.
[2024-05-30 10:45:21] [INFO ] Flatten gal took : 49 ms
[2024-05-30 10:45:21] [INFO ] Flatten gal took : 57 ms
[2024-05-30 10:45:21] [INFO ] Input system was already deterministic with 236 transitions.
Reduction of identical properties reduced properties to check from 18 to 14
RANDOM walk for 925 steps (0 resets) in 66 ms. (13 steps per ms) remains 0/14 properties
FORMULA UtilityControlRoom-COL-Z4T4N04-LTLFireability-13 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 68 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 236/236 transitions.
Applied a total of 0 rules in 5 ms. Remains 153 /153 variables (removed 0) and now considering 236/236 (removed 0) transitions.
// Phase 1: matrix 236 rows 153 cols
[2024-05-30 10:45:22] [INFO ] Computed 10 invariants in 5 ms
[2024-05-30 10:45:22] [INFO ] Implicit Places using invariants in 203 ms returned [124]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 205 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 152/153 places, 236/236 transitions.
Applied a total of 0 rules in 4 ms. Remains 152 /152 variables (removed 0) and now considering 236/236 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 215 ms. Remains : 152/153 places, 236/236 transitions.
Stuttering acceptance computed with spot in 231 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N04-LTLFireability-00
Product exploration explored 100000 steps with 14981 reset in 810 ms.
Product exploration explored 100000 steps with 14992 reset in 541 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 132 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 138 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 23 steps (0 resets) in 8 ms. (2 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 147 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 103 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 236 rows 152 cols
[2024-05-30 10:45:24] [INFO ] Computed 9 invariants in 6 ms
[2024-05-30 10:45:25] [INFO ] [Real]Absence check using 9 positive place invariants in 10 ms returned sat
[2024-05-30 10:45:25] [INFO ] [Real]Absence check using state equation in 223 ms returned sat
[2024-05-30 10:45:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 10:45:25] [INFO ] [Nat]Absence check using 9 positive place invariants in 10 ms returned sat
[2024-05-30 10:45:26] [INFO ] [Nat]Absence check using state equation in 200 ms returned sat
[2024-05-30 10:45:26] [INFO ] Computed and/alt/rep : 232/356/232 causal constraints (skipped 0 transitions) in 41 ms.
[2024-05-30 10:45:26] [INFO ] Added : 64 causal constraints over 13 iterations in 515 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 68 out of 152 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 152/152 places, 236/236 transitions.
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 16 Pre rules applied. Total rules applied 0 place count 152 transition count 220
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 136 transition count 220
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 40 place count 132 transition count 216
Applied a total of 40 rules in 72 ms. Remains 132 /152 variables (removed 20) and now considering 216/236 (removed 20) transitions.
// Phase 1: matrix 216 rows 132 cols
[2024-05-30 10:45:26] [INFO ] Computed 9 invariants in 3 ms
[2024-05-30 10:45:26] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-05-30 10:45:26] [INFO ] Invariant cache hit.
[2024-05-30 10:45:27] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
[2024-05-30 10:45:27] [INFO ] Redundant transitions in 9 ms returned []
Running 200 sub problems to find dead transitions.
[2024-05-30 10:45:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 4/132 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 216/348 variables, 132/141 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (OVERLAPS) 0/348 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 348/348 variables, and 141 constraints, problems are : Problem set: 0 solved, 200 unsolved in 10395 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 4/132 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 216/348 variables, 132/141 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 200/341 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 0/348 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 348/348 variables, and 341 constraints, problems are : Problem set: 0 solved, 200 unsolved in 10589 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
After SMT, in 21159ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 21180ms
Starting structural reductions in SI_LTL mode, iteration 1 : 132/152 places, 216/236 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 21582 ms. Remains : 132/152 places, 216/236 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 130 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 85 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 17 steps (0 resets) in 5 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 200 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 223 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
[2024-05-30 10:45:49] [INFO ] Invariant cache hit.
[2024-05-30 10:45:49] [INFO ] [Real]Absence check using 9 positive place invariants in 6 ms returned sat
[2024-05-30 10:45:49] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2024-05-30 10:45:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 10:45:49] [INFO ] [Nat]Absence check using 9 positive place invariants in 6 ms returned sat
[2024-05-30 10:45:49] [INFO ] [Nat]Absence check using state equation in 121 ms returned sat
[2024-05-30 10:45:50] [INFO ] Computed and/alt/rep : 200/448/200 causal constraints (skipped 0 transitions) in 25 ms.
[2024-05-30 10:45:50] [INFO ] Added : 103 causal constraints over 22 iterations in 501 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 20516 reset in 759 ms.
Product exploration explored 100000 steps with 20346 reset in 659 ms.
Support contains 68 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 216/216 transitions.
Applied a total of 0 rules in 13 ms. Remains 132 /132 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-05-30 10:45:52] [INFO ] Invariant cache hit.
[2024-05-30 10:45:52] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-30 10:45:52] [INFO ] Invariant cache hit.
[2024-05-30 10:45:52] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 409 ms to find 0 implicit places.
[2024-05-30 10:45:52] [INFO ] Redundant transitions in 10 ms returned []
Running 200 sub problems to find dead transitions.
[2024-05-30 10:45:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 4/132 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 216/348 variables, 132/141 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (OVERLAPS) 0/348 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 348/348 variables, and 141 constraints, problems are : Problem set: 0 solved, 200 unsolved in 9232 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 4/132 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 216/348 variables, 132/141 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 200/341 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 0/348 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 348/348 variables, and 341 constraints, problems are : Problem set: 0 solved, 200 unsolved in 9952 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
After SMT, in 19310ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 19315ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 19755 ms. Remains : 132/132 places, 216/216 transitions.
Treatment of property UtilityControlRoom-COL-Z4T4N04-LTLFireability-00 finished in 49606 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)||G(p1))))'
Support contains 24 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 236/236 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 105 transition count 188
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 105 transition count 188
Applied a total of 96 rules in 27 ms. Remains 105 /153 variables (removed 48) and now considering 188/236 (removed 48) transitions.
// Phase 1: matrix 188 rows 105 cols
[2024-05-30 10:46:11] [INFO ] Computed 10 invariants in 2 ms
[2024-05-30 10:46:12] [INFO ] Implicit Places using invariants in 139 ms returned [76]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 140 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/153 places, 188/236 transitions.
Applied a total of 0 rules in 6 ms. Remains 104 /104 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 173 ms. Remains : 104/153 places, 188/236 transitions.
Stuttering acceptance computed with spot in 199 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N04-LTLFireability-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z4T4N04-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N04-LTLFireability-02 finished in 401 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0||X(F(p1)))))))'
Support contains 24 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 236/236 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 105 transition count 188
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 105 transition count 188
Applied a total of 96 rules in 15 ms. Remains 105 /153 variables (removed 48) and now considering 188/236 (removed 48) transitions.
[2024-05-30 10:46:12] [INFO ] Invariant cache hit.
[2024-05-30 10:46:12] [INFO ] Implicit Places using invariants in 159 ms returned [76]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 160 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/153 places, 188/236 transitions.
Applied a total of 0 rules in 3 ms. Remains 104 /104 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 178 ms. Remains : 104/153 places, 188/236 transitions.
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N04-LTLFireability-03
Product exploration explored 100000 steps with 1446 reset in 209 ms.
Product exploration explored 100000 steps with 1489 reset in 455 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 120 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 1022 steps (0 resets) in 17 ms. (56 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 183 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 294 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 204 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 24 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 188/188 transitions.
Applied a total of 0 rules in 3 ms. Remains 104 /104 variables (removed 0) and now considering 188/188 (removed 0) transitions.
// Phase 1: matrix 188 rows 104 cols
[2024-05-30 10:46:14] [INFO ] Computed 9 invariants in 2 ms
[2024-05-30 10:46:14] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-05-30 10:46:14] [INFO ] Invariant cache hit.
[2024-05-30 10:46:14] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
Running 184 sub problems to find dead transitions.
[2024-05-30 10:46:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (OVERLAPS) 4/104 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (OVERLAPS) 188/292 variables, 104/113 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (OVERLAPS) 0/292 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Real declared 292/292 variables, and 113 constraints, problems are : Problem set: 0 solved, 184 unsolved in 7776 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 184 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (OVERLAPS) 4/104 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (OVERLAPS) 188/292 variables, 104/113 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 184/297 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (OVERLAPS) 0/292 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Int declared 292/292 variables, and 297 constraints, problems are : Problem set: 0 solved, 184 unsolved in 8780 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints]
After SMT, in 16661ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 16665ms
Finished structural reductions in LTL mode , in 1 iterations and 16981 ms. Remains : 104/104 places, 188/188 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 (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 117 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 163 steps (0 resets) in 10 ms. (14 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 182 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 1406 reset in 359 ms.
Product exploration explored 100000 steps with 1511 reset in 374 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 24 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 188/188 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 20 places in 1 ms
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 104 transition count 200
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 36 place count 104 transition count 184
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 39 place count 101 transition count 136
Deduced a syphon composed of 20 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 42 place count 101 transition count 136
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 54 place count 89 transition count 124
Deduced a syphon composed of 20 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 66 place count 89 transition count 124
Deduced a syphon composed of 20 places in 0 ms
Applied a total of 66 rules in 24 ms. Remains 89 /104 variables (removed 15) and now considering 124/188 (removed 64) transitions.
[2024-05-30 10:46:33] [INFO ] Redundant transitions in 2 ms returned []
Running 108 sub problems to find dead transitions.
// Phase 1: matrix 124 rows 89 cols
[2024-05-30 10:46:33] [INFO ] Computed 9 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 4/89 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-30 10:46:35] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 19 ms to minimize.
Problem TDEAD1 is UNSAT
[2024-05-30 10:46:35] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 2 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-05-30 10:46:35] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 2 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 3/12 constraints. Problems are: Problem set: 24 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/12 constraints. Problems are: Problem set: 24 solved, 84 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD48 is UNSAT
At refinement iteration 5 (OVERLAPS) 124/213 variables, 89/101 constraints. Problems are: Problem set: 32 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 0/101 constraints. Problems are: Problem set: 32 solved, 76 unsolved
At refinement iteration 7 (OVERLAPS) 0/213 variables, 0/101 constraints. Problems are: Problem set: 32 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 213/213 variables, and 101 constraints, problems are : Problem set: 32 solved, 76 unsolved in 3762 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 89/89 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 32 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 32 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 24/89 variables, 9/9 constraints. Problems are: Problem set: 32 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 3/12 constraints. Problems are: Problem set: 32 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/12 constraints. Problems are: Problem set: 32 solved, 76 unsolved
At refinement iteration 4 (OVERLAPS) 124/213 variables, 89/101 constraints. Problems are: Problem set: 32 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 76/177 constraints. Problems are: Problem set: 32 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 0/177 constraints. Problems are: Problem set: 32 solved, 76 unsolved
At refinement iteration 7 (OVERLAPS) 0/213 variables, 0/177 constraints. Problems are: Problem set: 32 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 213/213 variables, and 177 constraints, problems are : Problem set: 32 solved, 76 unsolved in 2671 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 89/89 constraints, PredecessorRefiner: 76/108 constraints, Known Traps: 3/3 constraints]
After SMT, in 6469ms problems are : Problem set: 32 solved, 76 unsolved
Search for dead transitions found 32 dead transitions in 6473ms
Found 32 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 32 transitions
Dead transitions reduction (with SMT) removed 32 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 89/104 places, 92/188 transitions.
Graph (complete) has 108 edges and 89 vertex of which 69 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.2 ms
Discarding 20 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 9 ms. Remains 69 /89 variables (removed 20) and now considering 92/92 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 69/104 places, 92/188 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6517 ms. Remains : 69/104 places, 92/188 transitions.
Support contains 24 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 188/188 transitions.
Applied a total of 0 rules in 2 ms. Remains 104 /104 variables (removed 0) and now considering 188/188 (removed 0) transitions.
// Phase 1: matrix 188 rows 104 cols
[2024-05-30 10:46:40] [INFO ] Computed 9 invariants in 2 ms
[2024-05-30 10:46:40] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-30 10:46:40] [INFO ] Invariant cache hit.
[2024-05-30 10:46:40] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
Running 184 sub problems to find dead transitions.
[2024-05-30 10:46:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (OVERLAPS) 4/104 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (OVERLAPS) 188/292 variables, 104/113 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (OVERLAPS) 0/292 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Real declared 292/292 variables, and 113 constraints, problems are : Problem set: 0 solved, 184 unsolved in 7798 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 184 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (OVERLAPS) 4/104 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (OVERLAPS) 188/292 variables, 104/113 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 184/297 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (OVERLAPS) 0/292 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Int declared 292/292 variables, and 297 constraints, problems are : Problem set: 0 solved, 184 unsolved in 8641 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints]
After SMT, in 16511ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 16515ms
Finished structural reductions in LTL mode , in 1 iterations and 16832 ms. Remains : 104/104 places, 188/188 transitions.
Treatment of property UtilityControlRoom-COL-Z4T4N04-LTLFireability-03 finished in 44906 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((G(!p1)||p0))||X(X(F((p2&&X(!p3)))))))'
Support contains 28 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 236/236 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 105 transition count 188
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 105 transition count 188
Applied a total of 96 rules in 3 ms. Remains 105 /153 variables (removed 48) and now considering 188/236 (removed 48) transitions.
// Phase 1: matrix 188 rows 105 cols
[2024-05-30 10:46:57] [INFO ] Computed 10 invariants in 1 ms
[2024-05-30 10:46:57] [INFO ] Implicit Places using invariants in 132 ms returned [76]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 133 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/153 places, 188/236 transitions.
Applied a total of 0 rules in 1 ms. Remains 104 /104 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 137 ms. Remains : 104/153 places, 188/236 transitions.
Stuttering acceptance computed with spot in 733 ms :[(OR (AND p1 (NOT p2)) (AND p1 p3)), (OR (AND p1 (NOT p2)) (AND p1 p3)), (OR (AND (NOT p0) p1 (NOT p2)) (AND (NOT p0) p1 p3)), (AND p1 p3), (AND (NOT p0) p1 p3), (OR (NOT p2) p3), (OR (AND (NOT p0) p1 (NOT p2)) (AND (NOT p0) p1 p3)), (OR (AND (NOT p0) p1 (NOT p2)) (AND (NOT p0) p1 p3)), (OR (NOT p2) p3), p3]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N04-LTLFireability-04
Product exploration explored 100000 steps with 21446 reset in 208 ms.
Product exploration explored 100000 steps with 21409 reset in 255 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 p2 p0 p3), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p1), (X p0), (X (X p2)), (X (X (AND p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 176 ms. Reduced automaton from 10 states, 33 edges and 4 AP (stutter sensitive) to 8 states, 26 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 490 ms :[(OR (NOT p2) p3), p3, (OR (AND p1 (NOT p2)) (AND p1 p3)), (OR (AND (NOT p0) p1 (NOT p2)) (AND (NOT p0) p1 p3)), (AND p1 p3), (AND (NOT p0) p1 p3), (OR (AND (NOT p0) p1 (NOT p2)) (AND (NOT p0) p1 p3)), (OR (AND (NOT p0) p1 (NOT p2)) (AND (NOT p0) p1 p3))]
Reduction of identical properties reduced properties to check from 26 to 21
RANDOM walk for 40000 steps (8 resets) in 1685 ms. (23 steps per ms) remains 6/21 properties
BEST_FIRST walk for 40002 steps (8 resets) in 281 ms. (141 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 679 ms. (58 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 84 ms. (470 steps per ms) remains 6/6 properties
// Phase 1: matrix 188 rows 104 cols
[2024-05-30 10:47:00] [INFO ] Computed 9 invariants in 1 ms
Problem apf5 is UNSAT
Problem apf7 is UNSAT
Problem apf12 is UNSAT
Problem apf15 is UNSAT
Problem apf16 is UNSAT
Problem apf21 is UNSAT
After SMT solving in domain Real declared 28/292 variables, and 0 constraints, problems are : Problem set: 6 solved, 0 unsolved in 25 ms.
Refiners :[Positive P Invariants (semi-flows): 0/9 constraints, State Equation: 0/104 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 48ms problems are : Problem set: 6 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 6 invariant AP formulas.
Knowledge obtained : [(AND p1 p2 p0 p3), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p1), (X p0), (X (X p2)), (X (X (AND p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X p0)), (X (X p1)), (G (OR (NOT p0) p2)), (G (OR p0 (NOT p1) (NOT p2) (NOT p3))), (G (OR p0 p1 (NOT p2) (NOT p3))), (G (OR p0 p1 (NOT p2))), (G (OR p0 (NOT p1) (NOT p2))), (G (OR (NOT p0) p2 (NOT p3)))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p1)), (F (NOT (AND p1 p2 p3))), (F (NOT (OR p0 (NOT p1) p2 (NOT p3)))), (F (NOT p0)), (F (NOT (OR p1 (NOT p2) (NOT p3)))), (F (NOT p3)), (F (NOT (AND p2 p3))), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR p0 p1 p2 (NOT p3)))), (F (NOT (OR p1 p2 (NOT p3)))), (F (NOT (OR p1 p2))), (F (NOT (AND p1 p2))), (F (NOT (AND p0 p2 p3))), (F (NOT (AND p0 p2))), (F (NOT (OR p2 (NOT p3)))), (F (NOT (OR p1 (NOT p2)))), (F (NOT (OR p0 p1 p2))), (F (NOT (OR (NOT p1) p2 (NOT p3))))]
Knowledge based reduction with 24 factoid took 1134 ms. Reduced automaton from 8 states, 26 edges and 4 AP (stutter sensitive) to 8 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 457 ms :[(OR (NOT p2) p3), p3, (OR (AND p1 (NOT p2)) (AND p1 p3)), (AND p1 p3), (AND (NOT p2) p3 p1), (AND (NOT p2) p3 p1), (AND (NOT p2) p3 p1), (AND (NOT p2) p3 p1)]
Stuttering acceptance computed with spot in 446 ms :[(OR (NOT p2) p3), p3, (OR (AND p1 (NOT p2)) (AND p1 p3)), (AND p1 p3), (AND (NOT p2) p3 p1), (AND (NOT p2) p3 p1), (AND (NOT p2) p3 p1), (AND (NOT p2) p3 p1)]
Support contains 28 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 188/188 transitions.
Applied a total of 0 rules in 3 ms. Remains 104 /104 variables (removed 0) and now considering 188/188 (removed 0) transitions.
[2024-05-30 10:47:02] [INFO ] Invariant cache hit.
[2024-05-30 10:47:02] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-30 10:47:02] [INFO ] Invariant cache hit.
[2024-05-30 10:47:02] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
Running 184 sub problems to find dead transitions.
[2024-05-30 10:47:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (OVERLAPS) 4/104 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (OVERLAPS) 188/292 variables, 104/113 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (OVERLAPS) 0/292 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Real declared 292/292 variables, and 113 constraints, problems are : Problem set: 0 solved, 184 unsolved in 7008 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 184 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (OVERLAPS) 4/104 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (OVERLAPS) 188/292 variables, 104/113 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 184/297 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (OVERLAPS) 0/292 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Int declared 292/292 variables, and 297 constraints, problems are : Problem set: 0 solved, 184 unsolved in 7087 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints]
After SMT, in 14208ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 14212ms
Finished structural reductions in LTL mode , in 1 iterations and 14535 ms. Remains : 104/104 places, 188/188 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 p2 p3 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 108 ms. Reduced automaton from 8 states, 18 edges and 3 AP (stutter sensitive) to 8 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 347 ms :[(OR (NOT p2) p3), p3, (OR (AND p1 (NOT p2)) (AND p1 p3)), (AND p1 p3), (AND (NOT p2) p3 p1), (AND (NOT p2) p3 p1), (AND (NOT p2) p3 p1), (AND (NOT p2) p3 p1)]
RANDOM walk for 546 steps (0 resets) in 17 ms. (30 steps per ms) remains 0/13 properties
Knowledge obtained : [(AND p2 p3 p1)]
False Knowledge obtained : [(F (NOT (OR p1 p2))), (F (NOT (OR p2 (NOT p3)))), (F (NOT (OR (NOT p1) p2 (NOT p3)))), (F (NOT (AND p1 p2 p3))), (F (NOT (OR p1 (NOT p2)))), (F (NOT (OR p1 p2 (NOT p3)))), (F (NOT p1)), (F (NOT p2)), (F (NOT p3)), (F (NOT (AND p2 p3))), (F (NOT (AND p1 p2))), (F (NOT (OR p1 (NOT p2) (NOT p3)))), (F (NOT (OR (NOT p1) p2)))]
Knowledge based reduction with 1 factoid took 509 ms. Reduced automaton from 8 states, 18 edges and 3 AP (stutter sensitive) to 8 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 426 ms :[(OR (NOT p2) p3), p3, (OR (AND p1 (NOT p2)) (AND p1 p3)), (AND p1 p3), (AND (NOT p2) p3 p1), (AND (NOT p2) p3 p1), (AND (NOT p2) p3 p1), (AND (NOT p2) p3 p1)]
Stuttering acceptance computed with spot in 404 ms :[(OR (NOT p2) p3), p3, (OR (AND p1 (NOT p2)) (AND p1 p3)), (AND p1 p3), (AND (NOT p2) p3 p1), (AND (NOT p2) p3 p1), (AND (NOT p2) p3 p1), (AND (NOT p2) p3 p1)]
Stuttering acceptance computed with spot in 381 ms :[(OR (NOT p2) p3), p3, (OR (AND p1 (NOT p2)) (AND p1 p3)), (AND p1 p3), (AND (NOT p2) p3 p1), (AND (NOT p2) p3 p1), (AND (NOT p2) p3 p1), (AND (NOT p2) p3 p1)]
Product exploration explored 100000 steps with 21403 reset in 355 ms.
Product exploration explored 100000 steps with 21347 reset in 379 ms.
Support contains 28 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 188/188 transitions.
Applied a total of 0 rules in 3 ms. Remains 104 /104 variables (removed 0) and now considering 188/188 (removed 0) transitions.
[2024-05-30 10:47:20] [INFO ] Invariant cache hit.
[2024-05-30 10:47:20] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-30 10:47:20] [INFO ] Invariant cache hit.
[2024-05-30 10:47:20] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
Running 184 sub problems to find dead transitions.
[2024-05-30 10:47:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (OVERLAPS) 4/104 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (OVERLAPS) 188/292 variables, 104/113 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (OVERLAPS) 0/292 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Real declared 292/292 variables, and 113 constraints, problems are : Problem set: 0 solved, 184 unsolved in 7663 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 184 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (OVERLAPS) 4/104 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (OVERLAPS) 188/292 variables, 104/113 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 184/297 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (OVERLAPS) 0/292 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Int declared 292/292 variables, and 297 constraints, problems are : Problem set: 0 solved, 184 unsolved in 9251 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints]
After SMT, in 16998ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 17004ms
Finished structural reductions in LTL mode , in 1 iterations and 17277 ms. Remains : 104/104 places, 188/188 transitions.
Treatment of property UtilityControlRoom-COL-Z4T4N04-LTLFireability-04 finished in 40184 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Support contains 41 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 236/236 transitions.
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 153 transition count 172
Reduce places removed 64 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 144 place count 89 transition count 156
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 152 place count 85 transition count 152
Applied a total of 152 rules in 36 ms. Remains 85 /153 variables (removed 68) and now considering 152/236 (removed 84) transitions.
// Phase 1: matrix 152 rows 85 cols
[2024-05-30 10:47:37] [INFO ] Computed 10 invariants in 2 ms
[2024-05-30 10:47:37] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-30 10:47:37] [INFO ] Invariant cache hit.
[2024-05-30 10:47:37] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
[2024-05-30 10:47:37] [INFO ] Redundant transitions in 2 ms returned []
Running 132 sub problems to find dead transitions.
[2024-05-30 10:47:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 4/85 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (OVERLAPS) 152/237 variables, 85/95 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (OVERLAPS) 0/237 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 237/237 variables, and 95 constraints, problems are : Problem set: 0 solved, 132 unsolved in 4195 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 85/85 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 4/85 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (OVERLAPS) 152/237 variables, 85/95 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 132/227 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (OVERLAPS) 0/237 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 237/237 variables, and 227 constraints, problems are : Problem set: 0 solved, 132 unsolved in 6593 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 85/85 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 0/0 constraints]
After SMT, in 10901ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 10904ms
Starting structural reductions in SI_LTL mode, iteration 1 : 85/153 places, 152/236 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11098 ms. Remains : 85/153 places, 152/236 transitions.
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N04-LTLFireability-05
Product exploration explored 100000 steps with 8364 reset in 656 ms.
Product exploration explored 100000 steps with 8528 reset in 503 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 311 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 74 steps (0 resets) in 5 ms. (12 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT (AND (NOT p1) (NOT p0)))), (F p0), (F (NOT (OR p1 (NOT p0))))]
Knowledge based reduction with 5 factoid took 528 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2024-05-30 10:47:50] [INFO ] Invariant cache hit.
[2024-05-30 10:47:51] [INFO ] [Real]Absence check using 10 positive place invariants in 18 ms returned sat
[2024-05-30 10:47:51] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2024-05-30 10:47:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 10:47:52] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2024-05-30 10:47:52] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2024-05-30 10:47:52] [INFO ] Computed and/alt/rep : 132/224/132 causal constraints (skipped 0 transitions) in 20 ms.
[2024-05-30 10:47:53] [INFO ] Added : 132 causal constraints over 28 iterations in 613 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Support contains 41 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 152/152 transitions.
Applied a total of 0 rules in 6 ms. Remains 85 /85 variables (removed 0) and now considering 152/152 (removed 0) transitions.
[2024-05-30 10:47:53] [INFO ] Invariant cache hit.
[2024-05-30 10:47:53] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-30 10:47:53] [INFO ] Invariant cache hit.
[2024-05-30 10:47:53] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
[2024-05-30 10:47:53] [INFO ] Redundant transitions in 2 ms returned []
Running 132 sub problems to find dead transitions.
[2024-05-30 10:47:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 4/85 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (OVERLAPS) 152/237 variables, 85/95 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (OVERLAPS) 0/237 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 237/237 variables, and 95 constraints, problems are : Problem set: 0 solved, 132 unsolved in 4963 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 85/85 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 4/85 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (OVERLAPS) 152/237 variables, 85/95 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 132/227 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (OVERLAPS) 0/237 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 237/237 variables, and 227 constraints, problems are : Problem set: 0 solved, 132 unsolved in 6624 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 85/85 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 0/0 constraints]
After SMT, in 11740ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 11743ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 11945 ms. Remains : 85/85 places, 152/152 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)), (X (X (NOT (AND (NOT p1) p0)))), (X (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) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 397 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 62 steps (0 resets) in 5 ms. (10 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (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) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT (AND (NOT p1) (NOT p0)))), (F p0), (F (NOT (OR p1 (NOT p0))))]
Knowledge based reduction with 5 factoid took 559 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2024-05-30 10:48:06] [INFO ] Invariant cache hit.
[2024-05-30 10:48:07] [INFO ] [Real]Absence check using 10 positive place invariants in 17 ms returned sat
[2024-05-30 10:48:07] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2024-05-30 10:48:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 10:48:08] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2024-05-30 10:48:08] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
[2024-05-30 10:48:08] [INFO ] Computed and/alt/rep : 132/224/132 causal constraints (skipped 0 transitions) in 20 ms.
[2024-05-30 10:48:08] [INFO ] Added : 132 causal constraints over 28 iterations in 624 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 8403 reset in 859 ms.
Product exploration explored 100000 steps with 8559 reset in 573 ms.
Support contains 41 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 152/152 transitions.
Applied a total of 0 rules in 4 ms. Remains 85 /85 variables (removed 0) and now considering 152/152 (removed 0) transitions.
[2024-05-30 10:48:10] [INFO ] Invariant cache hit.
[2024-05-30 10:48:10] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-30 10:48:10] [INFO ] Invariant cache hit.
[2024-05-30 10:48:10] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
[2024-05-30 10:48:10] [INFO ] Redundant transitions in 0 ms returned []
Running 132 sub problems to find dead transitions.
[2024-05-30 10:48:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 4/85 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (OVERLAPS) 152/237 variables, 85/95 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (OVERLAPS) 0/237 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 237/237 variables, and 95 constraints, problems are : Problem set: 0 solved, 132 unsolved in 4832 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 85/85 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 4/85 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (OVERLAPS) 152/237 variables, 85/95 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 132/227 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (OVERLAPS) 0/237 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 237/237 variables, and 227 constraints, problems are : Problem set: 0 solved, 132 unsolved in 6166 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 85/85 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 0/0 constraints]
After SMT, in 11155ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 11157ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 11322 ms. Remains : 85/85 places, 152/152 transitions.
Treatment of property UtilityControlRoom-COL-Z4T4N04-LTLFireability-05 finished in 44351 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&F(((p1 U p2)&&G(!p3)))))))'
Support contains 29 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 236/236 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 105 transition count 188
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 105 transition count 188
Applied a total of 96 rules in 4 ms. Remains 105 /153 variables (removed 48) and now considering 188/236 (removed 48) transitions.
// Phase 1: matrix 188 rows 105 cols
[2024-05-30 10:48:21] [INFO ] Computed 10 invariants in 2 ms
[2024-05-30 10:48:21] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-30 10:48:21] [INFO ] Invariant cache hit.
[2024-05-30 10:48:22] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
Running 184 sub problems to find dead transitions.
[2024-05-30 10:48:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (OVERLAPS) 4/105 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (OVERLAPS) 188/293 variables, 105/115 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (OVERLAPS) 0/293 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 115 constraints, problems are : Problem set: 0 solved, 184 unsolved in 7610 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 184 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (OVERLAPS) 4/105 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (OVERLAPS) 188/293 variables, 105/115 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 184/299 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (OVERLAPS) 0/293 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/293 variables, and 299 constraints, problems are : Problem set: 0 solved, 184 unsolved in 10025 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints]
After SMT, in 17897ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 17901ms
Starting structural reductions in LTL mode, iteration 1 : 105/153 places, 188/236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18166 ms. Remains : 105/153 places, 188/236 transitions.
Stuttering acceptance computed with spot in 293 ms :[(OR (NOT p0) (NOT p2) p3), (OR (NOT p0) (NOT p2) p3), (OR (NOT p2) p3), (NOT p2), p3]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N04-LTLFireability-06
Product exploration explored 100000 steps with 2072 reset in 733 ms.
Stack based approach found an accepted trace after 42018 steps with 888 reset with depth 199 and stack size 199 in 220 ms.
FORMULA UtilityControlRoom-COL-Z4T4N04-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N04-LTLFireability-06 finished in 19447 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(F(p0)) U p1))))'
Support contains 45 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 236/236 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 105 transition count 188
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 105 transition count 188
Applied a total of 96 rules in 3 ms. Remains 105 /153 variables (removed 48) and now considering 188/236 (removed 48) transitions.
[2024-05-30 10:48:41] [INFO ] Invariant cache hit.
[2024-05-30 10:48:41] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-30 10:48:41] [INFO ] Invariant cache hit.
[2024-05-30 10:48:41] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
Running 184 sub problems to find dead transitions.
[2024-05-30 10:48:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (OVERLAPS) 4/105 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (OVERLAPS) 188/293 variables, 105/115 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (OVERLAPS) 0/293 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 115 constraints, problems are : Problem set: 0 solved, 184 unsolved in 7490 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 184 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (OVERLAPS) 4/105 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (OVERLAPS) 188/293 variables, 105/115 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 184/299 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (OVERLAPS) 0/293 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/293 variables, and 299 constraints, problems are : Problem set: 0 solved, 184 unsolved in 10879 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints]
After SMT, in 18593ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 18595ms
Starting structural reductions in LTL mode, iteration 1 : 105/153 places, 188/236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18745 ms. Remains : 105/153 places, 188/236 transitions.
Stuttering acceptance computed with spot in 265 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N04-LTLFireability-08
Product exploration explored 100000 steps with 6905 reset in 378 ms.
Product exploration explored 100000 steps with 6988 reset in 395 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 212 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 229 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
RANDOM walk for 76 steps (0 resets) in 7 ms. (9 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F p1)]
Knowledge based reduction with 2 factoid took 317 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 258 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 253 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
[2024-05-30 10:49:02] [INFO ] Invariant cache hit.
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F p1), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 2 factoid took 493 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z4T4N04-LTLFireability-08 FALSE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z4T4N04-LTLFireability-08 finished in 21871 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(G((p1&&F(p2))))&&p0)))'
Support contains 41 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 236/236 transitions.
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 153 transition count 172
Reduce places removed 64 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 144 place count 89 transition count 156
Applied a total of 144 rules in 19 ms. Remains 89 /153 variables (removed 64) and now considering 156/236 (removed 80) transitions.
// Phase 1: matrix 156 rows 89 cols
[2024-05-30 10:49:03] [INFO ] Computed 10 invariants in 3 ms
[2024-05-30 10:49:03] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-30 10:49:03] [INFO ] Invariant cache hit.
[2024-05-30 10:49:03] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
[2024-05-30 10:49:03] [INFO ] Redundant transitions in 0 ms returned []
Running 152 sub problems to find dead transitions.
[2024-05-30 10:49:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 4/89 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 156/245 variables, 89/99 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/245 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (OVERLAPS) 0/245 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 245/245 variables, and 99 constraints, problems are : Problem set: 0 solved, 152 unsolved in 5890 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 89/89 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 4/89 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 156/245 variables, 89/99 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/245 variables, 152/251 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (OVERLAPS) 0/245 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Int declared 245/245 variables, and 251 constraints, problems are : Problem set: 0 solved, 152 unsolved in 7167 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 89/89 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 0/0 constraints]
After SMT, in 13221ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 13225ms
Starting structural reductions in SI_LTL mode, iteration 1 : 89/153 places, 156/236 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13462 ms. Remains : 89/153 places, 156/236 transitions.
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N04-LTLFireability-09
Product exploration explored 100000 steps with 533 reset in 1203 ms.
Stack based approach found an accepted trace after 4307 steps with 29 reset with depth 65 and stack size 65 in 45 ms.
FORMULA UtilityControlRoom-COL-Z4T4N04-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N04-LTLFireability-09 finished in 14906 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 21 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 236/236 transitions.
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 153 transition count 172
Reduce places removed 64 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 144 place count 89 transition count 156
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 144 place count 89 transition count 140
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 176 place count 73 transition count 140
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 184 place count 69 transition count 136
Applied a total of 184 rules in 12 ms. Remains 69 /153 variables (removed 84) and now considering 136/236 (removed 100) transitions.
// Phase 1: matrix 136 rows 69 cols
[2024-05-30 10:49:17] [INFO ] Computed 10 invariants in 1 ms
[2024-05-30 10:49:18] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-30 10:49:18] [INFO ] Invariant cache hit.
[2024-05-30 10:49:18] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
[2024-05-30 10:49:18] [INFO ] Redundant transitions in 0 ms returned []
Running 116 sub problems to find dead transitions.
[2024-05-30 10:49:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (OVERLAPS) 4/69 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (OVERLAPS) 136/205 variables, 69/79 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (OVERLAPS) 0/205 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 205/205 variables, and 79 constraints, problems are : Problem set: 0 solved, 116 unsolved in 3861 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 69/69 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (OVERLAPS) 4/69 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (OVERLAPS) 136/205 variables, 69/79 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 116/195 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (OVERLAPS) 0/205 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 205/205 variables, and 195 constraints, problems are : Problem set: 0 solved, 116 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 69/69 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 0/0 constraints]
After SMT, in 8996ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 8999ms
Starting structural reductions in SI_LTL mode, iteration 1 : 69/153 places, 136/236 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9237 ms. Remains : 69/153 places, 136/236 transitions.
Stuttering acceptance computed with spot in 57 ms :[p0]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N04-LTLFireability-10
Product exploration explored 100000 steps with 0 reset in 447 ms.
Stack based approach found an accepted trace after 184 steps with 0 reset with depth 185 and stack size 185 in 1 ms.
FORMULA UtilityControlRoom-COL-Z4T4N04-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N04-LTLFireability-10 finished in 9776 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0 U G(p1))&&X(X(X(X(F(p2)))))))'
Support contains 85 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 236/236 transitions.
Applied a total of 0 rules in 2 ms. Remains 153 /153 variables (removed 0) and now considering 236/236 (removed 0) transitions.
// Phase 1: matrix 236 rows 153 cols
[2024-05-30 10:49:27] [INFO ] Computed 10 invariants in 3 ms
[2024-05-30 10:49:27] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-30 10:49:27] [INFO ] Invariant cache hit.
[2024-05-30 10:49:28] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
Running 232 sub problems to find dead transitions.
[2024-05-30 10:49:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (OVERLAPS) 4/153 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 4 (OVERLAPS) 236/389 variables, 153/163 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/389 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 6 (OVERLAPS) 0/389 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 232 unsolved
No progress, stopping.
After SMT solving in domain Real declared 389/389 variables, and 163 constraints, problems are : Problem set: 0 solved, 232 unsolved in 12595 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 232 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (OVERLAPS) 4/153 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 4 (OVERLAPS) 236/389 variables, 153/163 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/389 variables, 232/395 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/389 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 7 (OVERLAPS) 0/389 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 232 unsolved
No progress, stopping.
After SMT solving in domain Int declared 389/389 variables, and 395 constraints, problems are : Problem set: 0 solved, 232 unsolved in 16144 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 0/0 constraints]
After SMT, in 28961ms problems are : Problem set: 0 solved, 232 unsolved
Search for dead transitions found 0 dead transitions in 28965ms
Finished structural reductions in LTL mode , in 1 iterations and 29243 ms. Remains : 153/153 places, 236/236 transitions.
Stuttering acceptance computed with spot in 327 ms :[(OR (NOT p2) (NOT p1)), true, (NOT p1), (NOT p1), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N04-LTLFireability-11
Entered a terminal (fully accepting) state of product in 7 steps with 1 reset in 1 ms.
FORMULA UtilityControlRoom-COL-Z4T4N04-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N04-LTLFireability-11 finished in 29600 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p1)&&p0)))'
Support contains 20 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 236/236 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 105 transition count 188
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 105 transition count 188
Applied a total of 96 rules in 3 ms. Remains 105 /153 variables (removed 48) and now considering 188/236 (removed 48) transitions.
// Phase 1: matrix 188 rows 105 cols
[2024-05-30 10:49:57] [INFO ] Computed 10 invariants in 5 ms
[2024-05-30 10:49:57] [INFO ] Implicit Places using invariants in 198 ms returned [76]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 200 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/153 places, 188/236 transitions.
Applied a total of 0 rules in 1 ms. Remains 104 /104 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 204 ms. Remains : 104/153 places, 188/236 transitions.
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N04-LTLFireability-14
Product exploration explored 100000 steps with 6351 reset in 878 ms.
Stack based approach found an accepted trace after 45636 steps with 2887 reset with depth 8 and stack size 8 in 298 ms.
FORMULA UtilityControlRoom-COL-Z4T4N04-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N04-LTLFireability-14 finished in 1500 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 4 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 236/236 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 153 transition count 172
Reduce places removed 64 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 144 place count 89 transition count 156
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 144 place count 89 transition count 140
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 176 place count 73 transition count 140
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 179 place count 70 transition count 92
Iterating global reduction 2 with 3 rules applied. Total rules applied 182 place count 70 transition count 92
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 194 place count 58 transition count 80
Iterating global reduction 2 with 12 rules applied. Total rules applied 206 place count 58 transition count 80
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 218 place count 46 transition count 56
Iterating global reduction 2 with 12 rules applied. Total rules applied 230 place count 46 transition count 56
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 242 place count 34 transition count 44
Iterating global reduction 2 with 12 rules applied. Total rules applied 254 place count 34 transition count 44
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 266 place count 34 transition count 32
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 266 place count 34 transition count 28
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 274 place count 30 transition count 28
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 17 rules applied. Total rules applied 291 place count 21 transition count 20
Applied a total of 291 rules in 16 ms. Remains 21 /153 variables (removed 132) and now considering 20/236 (removed 216) transitions.
// Phase 1: matrix 20 rows 21 cols
[2024-05-30 10:49:58] [INFO ] Computed 9 invariants in 1 ms
[2024-05-30 10:49:58] [INFO ] Implicit Places using invariants in 33 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 34 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/153 places, 20/236 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 20 transition count 16
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 16 transition count 16
Applied a total of 8 rules in 1 ms. Remains 16 /20 variables (removed 4) and now considering 16/20 (removed 4) transitions.
// Phase 1: matrix 16 rows 16 cols
[2024-05-30 10:49:58] [INFO ] Computed 8 invariants in 0 ms
[2024-05-30 10:49:58] [INFO ] Implicit Places using invariants in 35 ms returned [4, 5, 6, 7]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 36 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 12/153 places, 16/236 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 12 transition count 12
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 12 place count 8 transition count 8
Applied a total of 12 rules in 1 ms. Remains 8 /12 variables (removed 4) and now considering 8/16 (removed 8) transitions.
// Phase 1: matrix 8 rows 8 cols
[2024-05-30 10:49:58] [INFO ] Computed 4 invariants in 0 ms
[2024-05-30 10:49:58] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-30 10:49:58] [INFO ] Invariant cache hit.
[2024-05-30 10:49:58] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 8/153 places, 8/236 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 150 ms. Remains : 8/153 places, 8/236 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N04-LTLFireability-15
Product exploration explored 100000 steps with 50000 reset in 120 ms.
Product exploration explored 100000 steps with 50000 reset in 120 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 31 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z4T4N04-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z4T4N04-LTLFireability-15 finished in 486 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)))'
Found a Shortening insensitive property : UtilityControlRoom-COL-Z4T4N04-LTLFireability-00
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Support contains 68 out of 153 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 153/153 places, 236/236 transitions.
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 16 Pre rules applied. Total rules applied 0 place count 153 transition count 220
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 137 transition count 220
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 40 place count 133 transition count 216
Applied a total of 40 rules in 14 ms. Remains 133 /153 variables (removed 20) and now considering 216/236 (removed 20) transitions.
// Phase 1: matrix 216 rows 133 cols
[2024-05-30 10:49:59] [INFO ] Computed 10 invariants in 3 ms
[2024-05-30 10:49:59] [INFO ] Implicit Places using invariants in 238 ms returned [104]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 240 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 132/153 places, 216/236 transitions.
Applied a total of 0 rules in 6 ms. Remains 132 /132 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 260 ms. Remains : 132/153 places, 216/236 transitions.
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N04-LTLFireability-00
Product exploration explored 100000 steps with 20531 reset in 629 ms.
Product exploration explored 100000 steps with 20532 reset in 499 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))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 148 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 82 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 15 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 154 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 96 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 216 rows 132 cols
[2024-05-30 10:50:01] [INFO ] Computed 9 invariants in 1 ms
[2024-05-30 10:50:02] [INFO ] [Real]Absence check using 9 positive place invariants in 9 ms returned sat
[2024-05-30 10:50:02] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2024-05-30 10:50:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 10:50:02] [INFO ] [Nat]Absence check using 9 positive place invariants in 10 ms returned sat
[2024-05-30 10:50:02] [INFO ] [Nat]Absence check using state equation in 169 ms returned sat
[2024-05-30 10:50:02] [INFO ] Computed and/alt/rep : 200/448/200 causal constraints (skipped 0 transitions) in 27 ms.
[2024-05-30 10:50:03] [INFO ] Added : 163 causal constraints over 33 iterations in 963 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 68 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 216/216 transitions.
Applied a total of 0 rules in 6 ms. Remains 132 /132 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-05-30 10:50:03] [INFO ] Invariant cache hit.
[2024-05-30 10:50:03] [INFO ] Implicit Places using invariants in 141 ms returned []
[2024-05-30 10:50:03] [INFO ] Invariant cache hit.
[2024-05-30 10:50:04] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
[2024-05-30 10:50:04] [INFO ] Redundant transitions in 1 ms returned []
Running 200 sub problems to find dead transitions.
[2024-05-30 10:50:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 4/132 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 216/348 variables, 132/141 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (OVERLAPS) 0/348 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 348/348 variables, and 141 constraints, problems are : Problem set: 0 solved, 200 unsolved in 9892 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 4/132 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 216/348 variables, 132/141 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 200/341 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 0/348 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 348/348 variables, and 341 constraints, problems are : Problem set: 0 solved, 200 unsolved in 12036 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
After SMT, in 22020ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 22024ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 22448 ms. Remains : 132/132 places, 216/216 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 143 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 24 steps (0 resets) in 5 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 189 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 101 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
[2024-05-30 10:50:26] [INFO ] Invariant cache hit.
[2024-05-30 10:50:27] [INFO ] [Real]Absence check using 9 positive place invariants in 9 ms returned sat
[2024-05-30 10:50:27] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2024-05-30 10:50:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 10:50:27] [INFO ] [Nat]Absence check using 9 positive place invariants in 10 ms returned sat
[2024-05-30 10:50:27] [INFO ] [Nat]Absence check using state equation in 170 ms returned sat
[2024-05-30 10:50:27] [INFO ] Computed and/alt/rep : 200/448/200 causal constraints (skipped 0 transitions) in 30 ms.
[2024-05-30 10:50:28] [INFO ] Added : 103 causal constraints over 22 iterations in 403 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 20472 reset in 459 ms.
Product exploration explored 100000 steps with 20490 reset in 474 ms.
Support contains 68 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 216/216 transitions.
Applied a total of 0 rules in 3 ms. Remains 132 /132 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-05-30 10:50:29] [INFO ] Invariant cache hit.
[2024-05-30 10:50:29] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-05-30 10:50:29] [INFO ] Invariant cache hit.
[2024-05-30 10:50:29] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 396 ms to find 0 implicit places.
[2024-05-30 10:50:29] [INFO ] Redundant transitions in 1 ms returned []
Running 200 sub problems to find dead transitions.
[2024-05-30 10:50:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 4/132 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 216/348 variables, 132/141 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (OVERLAPS) 0/348 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 348/348 variables, and 141 constraints, problems are : Problem set: 0 solved, 200 unsolved in 8144 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 4/132 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 216/348 variables, 132/141 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 200/341 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 0/348 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 348/348 variables, and 341 constraints, problems are : Problem set: 0 solved, 200 unsolved in 11082 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
After SMT, in 19320ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 19327ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 19735 ms. Remains : 132/132 places, 216/216 transitions.
Treatment of property UtilityControlRoom-COL-Z4T4N04-LTLFireability-00 finished in 49724 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0||X(F(p1)))))))'
Found a Lengthening insensitive property : UtilityControlRoom-COL-Z4T4N04-LTLFireability-03
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 24 out of 153 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 153/153 places, 236/236 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 153 transition count 172
Reduce places removed 64 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 144 place count 89 transition count 156
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 147 place count 86 transition count 108
Iterating global reduction 2 with 3 rules applied. Total rules applied 150 place count 86 transition count 108
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 162 place count 74 transition count 96
Iterating global reduction 2 with 12 rules applied. Total rules applied 174 place count 74 transition count 96
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 182 place count 70 transition count 92
Applied a total of 182 rules in 9 ms. Remains 70 /153 variables (removed 83) and now considering 92/236 (removed 144) transitions.
// Phase 1: matrix 92 rows 70 cols
[2024-05-30 10:50:49] [INFO ] Computed 10 invariants in 0 ms
[2024-05-30 10:50:49] [INFO ] Implicit Places using invariants in 62 ms returned [0, 53]
[2024-05-30 10:50:49] [INFO ] Actually due to overlaps returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 64 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 69/153 places, 92/236 transitions.
Applied a total of 0 rules in 1 ms. Remains 69 /69 variables (removed 0) and now considering 92/92 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 77 ms. Remains : 69/153 places, 92/236 transitions.
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N04-LTLFireability-03
Product exploration explored 100000 steps with 3072 reset in 320 ms.
Product exploration explored 100000 steps with 3086 reset in 298 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 151 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 327 steps (0 resets) in 8 ms. (36 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 149 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 24 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 92/92 transitions.
Applied a total of 0 rules in 1 ms. Remains 69 /69 variables (removed 0) and now considering 92/92 (removed 0) transitions.
// Phase 1: matrix 92 rows 69 cols
[2024-05-30 10:50:50] [INFO ] Computed 9 invariants in 1 ms
[2024-05-30 10:50:51] [INFO ] Implicit Places using invariants in 86 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 88 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 68/69 places, 92/92 transitions.
Applied a total of 0 rules in 0 ms. Remains 68 /68 variables (removed 0) and now considering 92/92 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 89 ms. Remains : 68/69 places, 92/92 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 (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 111 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 250 steps (0 resets) in 5 ms. (41 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 177 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 3121 reset in 325 ms.
Product exploration explored 100000 steps with 3160 reset in 351 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 24 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 92/92 transitions.
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 16 Pre rules applied. Total rules applied 0 place count 68 transition count 92
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 68 transition count 92
Deduced a syphon composed of 16 places in 0 ms
Applied a total of 16 rules in 4 ms. Remains 68 /68 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2024-05-30 10:50:53] [INFO ] Redundant transitions in 0 ms returned []
Running 76 sub problems to find dead transitions.
// Phase 1: matrix 92 rows 68 cols
[2024-05-30 10:50:53] [INFO ] Computed 8 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 4/68 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-30 10:50:53] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 2 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-05-30 10:50:53] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
Problem TDEAD1 is UNSAT
[2024-05-30 10:50:53] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 1 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-05-30 10:50:53] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 4/12 constraints. Problems are: Problem set: 16 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/12 constraints. Problems are: Problem set: 16 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 92/160 variables, 68/80 constraints. Problems are: Problem set: 16 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 0/80 constraints. Problems are: Problem set: 16 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 0/160 variables, 0/80 constraints. Problems are: Problem set: 16 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 160/160 variables, and 80 constraints, problems are : Problem set: 16 solved, 60 unsolved in 2090 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 16 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 16 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 20/68 variables, 8/8 constraints. Problems are: Problem set: 16 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 4/12 constraints. Problems are: Problem set: 16 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/12 constraints. Problems are: Problem set: 16 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 92/160 variables, 68/80 constraints. Problems are: Problem set: 16 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 60/140 constraints. Problems are: Problem set: 16 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 0/140 constraints. Problems are: Problem set: 16 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 0/160 variables, 0/140 constraints. Problems are: Problem set: 16 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 160/160 variables, and 140 constraints, problems are : Problem set: 16 solved, 60 unsolved in 1742 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 60/76 constraints, Known Traps: 4/4 constraints]
After SMT, in 3851ms problems are : Problem set: 16 solved, 60 unsolved
Search for dead transitions found 16 dead transitions in 3853ms
Found 16 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 16 transitions
Dead transitions reduction (with SMT) removed 16 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 68/68 places, 76/92 transitions.
Graph (complete) has 72 edges and 68 vertex of which 52 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 52 /68 variables (removed 16) and now considering 76/76 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 52/68 places, 76/92 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3870 ms. Remains : 52/68 places, 76/92 transitions.
Support contains 24 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 92/92 transitions.
Applied a total of 0 rules in 1 ms. Remains 68 /68 variables (removed 0) and now considering 92/92 (removed 0) transitions.
// Phase 1: matrix 92 rows 68 cols
[2024-05-30 10:50:57] [INFO ] Computed 8 invariants in 1 ms
[2024-05-30 10:50:57] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-30 10:50:57] [INFO ] Invariant cache hit.
[2024-05-30 10:50:57] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
Running 76 sub problems to find dead transitions.
[2024-05-30 10:50:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 4/68 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (OVERLAPS) 92/160 variables, 68/76 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (OVERLAPS) 0/160 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 160/160 variables, and 76 constraints, problems are : Problem set: 0 solved, 76 unsolved in 2069 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 4/68 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (OVERLAPS) 92/160 variables, 68/76 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 76/152 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (OVERLAPS) 0/160 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 160/160 variables, and 152 constraints, problems are : Problem set: 0 solved, 76 unsolved in 2206 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 0/0 constraints]
After SMT, in 4293ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 4295ms
Finished structural reductions in LTL mode , in 1 iterations and 4449 ms. Remains : 68/68 places, 92/92 transitions.
Treatment of property UtilityControlRoom-COL-Z4T4N04-LTLFireability-03 finished in 12508 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((G(!p1)||p0))||X(X(F((p2&&X(!p3)))))))'
Found a Shortening insensitive property : UtilityControlRoom-COL-Z4T4N04-LTLFireability-04
Stuttering acceptance computed with spot in 584 ms :[(OR (AND p1 (NOT p2)) (AND p1 p3)), (OR (AND p1 (NOT p2)) (AND p1 p3)), (OR (AND (NOT p0) p1 (NOT p2)) (AND (NOT p0) p1 p3)), (AND p1 p3), (AND (NOT p0) p1 p3), (OR (NOT p2) p3), (OR (AND (NOT p0) p1 (NOT p2)) (AND (NOT p0) p1 p3)), (OR (AND (NOT p0) p1 (NOT p2)) (AND (NOT p0) p1 p3)), (OR (NOT p2) p3), p3]
Support contains 28 out of 153 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 153/153 places, 236/236 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 153 transition count 172
Reduce places removed 64 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 144 place count 89 transition count 156
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 147 place count 86 transition count 108
Iterating global reduction 2 with 3 rules applied. Total rules applied 150 place count 86 transition count 108
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 162 place count 74 transition count 96
Iterating global reduction 2 with 12 rules applied. Total rules applied 174 place count 74 transition count 96
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 182 place count 70 transition count 92
Applied a total of 182 rules in 11 ms. Remains 70 /153 variables (removed 83) and now considering 92/236 (removed 144) transitions.
// Phase 1: matrix 92 rows 70 cols
[2024-05-30 10:51:02] [INFO ] Computed 10 invariants in 1 ms
[2024-05-30 10:51:02] [INFO ] Implicit Places using invariants in 141 ms returned [0, 57]
[2024-05-30 10:51:02] [INFO ] Actually due to overlaps returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 150 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 69/153 places, 92/236 transitions.
Applied a total of 0 rules in 3 ms. Remains 69 /69 variables (removed 0) and now considering 92/92 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 164 ms. Remains : 69/153 places, 92/236 transitions.
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N04-LTLFireability-04
Product exploration explored 100000 steps with 22795 reset in 280 ms.
Product exploration explored 100000 steps with 22774 reset in 305 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p2 p0 p3), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p1), (X p0), (X (X p2)), (X (X (AND p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 166 ms. Reduced automaton from 10 states, 33 edges and 4 AP (stutter sensitive) to 8 states, 26 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 476 ms :[(OR (NOT p2) p3), p3, (OR (AND p1 (NOT p2)) (AND p1 p3)), (OR (AND (NOT p0) p1 (NOT p2)) (AND (NOT p0) p1 p3)), (AND p1 p3), (AND (NOT p0) p1 p3), (OR (AND (NOT p0) p1 (NOT p2)) (AND (NOT p0) p1 p3)), (OR (AND (NOT p0) p1 (NOT p2)) (AND (NOT p0) p1 p3))]
Reduction of identical properties reduced properties to check from 26 to 21
RANDOM walk for 40000 steps (8 resets) in 746 ms. (53 steps per ms) remains 6/21 properties
BEST_FIRST walk for 40003 steps (8 resets) in 179 ms. (222 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 274 ms. (145 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 290 ms. (137 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 222 ms. (179 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 171 ms. (232 steps per ms) remains 6/6 properties
// Phase 1: matrix 92 rows 69 cols
[2024-05-30 10:51:04] [INFO ] Computed 9 invariants in 1 ms
Problem apf5 is UNSAT
Problem apf7 is UNSAT
Problem apf12 is UNSAT
Problem apf15 is UNSAT
Problem apf16 is UNSAT
Problem apf21 is UNSAT
After SMT solving in domain Real declared 28/161 variables, and 0 constraints, problems are : Problem set: 6 solved, 0 unsolved in 24 ms.
Refiners :[Positive P Invariants (semi-flows): 0/9 constraints, State Equation: 0/69 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 37ms problems are : Problem set: 6 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 6 invariant AP formulas.
Knowledge obtained : [(AND p1 p2 p0 p3), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p1), (X p0), (X (X p2)), (X (X (AND p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X p0)), (X (X p1)), (G (OR (NOT p0) p2)), (G (OR p0 (NOT p1) (NOT p2) (NOT p3))), (G (OR p0 p1 (NOT p2) (NOT p3))), (G (OR p0 p1 (NOT p2))), (G (OR p0 (NOT p1) (NOT p2))), (G (OR (NOT p0) p2 (NOT p3)))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p1)), (F (NOT (AND p1 p2 p3))), (F (NOT (OR p0 (NOT p1) p2 (NOT p3)))), (F (NOT p0)), (F (NOT (OR p1 (NOT p2) (NOT p3)))), (F (NOT p3)), (F (NOT (AND p2 p3))), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR p0 p1 p2 (NOT p3)))), (F (NOT (OR p1 p2 (NOT p3)))), (F (NOT (OR p1 p2))), (F (NOT (AND p1 p2))), (F (NOT (AND p0 p2 p3))), (F (NOT (AND p0 p2))), (F (NOT (OR p2 (NOT p3)))), (F (NOT (OR p1 (NOT p2)))), (F (NOT (OR p0 p1 p2))), (F (NOT (OR (NOT p1) p2 (NOT p3))))]
Knowledge based reduction with 24 factoid took 1000 ms. Reduced automaton from 8 states, 26 edges and 4 AP (stutter sensitive) to 8 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 515 ms :[(OR (NOT p2) p3), p3, (OR (AND p1 (NOT p2)) (AND p1 p3)), (AND p1 p3), (AND (NOT p2) p3 p1), (AND (NOT p2) p3 p1), (AND (NOT p2) p3 p1), (AND (NOT p2) p3 p1)]
Stuttering acceptance computed with spot in 437 ms :[(OR (NOT p2) p3), p3, (OR (AND p1 (NOT p2)) (AND p1 p3)), (AND p1 p3), (AND (NOT p2) p3 p1), (AND (NOT p2) p3 p1), (AND (NOT p2) p3 p1), (AND (NOT p2) p3 p1)]
Support contains 28 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 92/92 transitions.
Applied a total of 0 rules in 1 ms. Remains 69 /69 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2024-05-30 10:51:06] [INFO ] Invariant cache hit.
[2024-05-30 10:51:06] [INFO ] Implicit Places using invariants in 93 ms returned [56]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 94 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 68/69 places, 92/92 transitions.
Applied a total of 0 rules in 1 ms. Remains 68 /68 variables (removed 0) and now considering 92/92 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 96 ms. Remains : 68/69 places, 92/92 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 p2 p3 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 118 ms. Reduced automaton from 8 states, 18 edges and 3 AP (stutter sensitive) to 8 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 465 ms :[(OR (NOT p2) p3), p3, (OR (AND p1 (NOT p2)) (AND p1 p3)), (AND p1 p3), (AND (NOT p2) p3 p1), (AND (NOT p2) p3 p1), (AND (NOT p2) p3 p1), (AND (NOT p2) p3 p1)]
RANDOM walk for 167 steps (0 resets) in 6 ms. (23 steps per ms) remains 0/13 properties
Knowledge obtained : [(AND p2 p3 p1)]
False Knowledge obtained : [(F (NOT (OR p1 p2))), (F (NOT (OR p2 (NOT p3)))), (F (NOT (OR (NOT p1) p2 (NOT p3)))), (F (NOT (AND p1 p2 p3))), (F (NOT (OR p1 (NOT p2)))), (F (NOT (OR p1 p2 (NOT p3)))), (F (NOT p1)), (F (NOT p2)), (F (NOT p3)), (F (NOT (AND p2 p3))), (F (NOT (AND p1 p2))), (F (NOT (OR p1 (NOT p2) (NOT p3)))), (F (NOT (OR (NOT p1) p2)))]
Knowledge based reduction with 1 factoid took 498 ms. Reduced automaton from 8 states, 18 edges and 3 AP (stutter sensitive) to 8 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 424 ms :[(OR (NOT p2) p3), p3, (OR (AND p1 (NOT p2)) (AND p1 p3)), (AND p1 p3), (AND (NOT p2) p3 p1), (AND (NOT p2) p3 p1), (AND (NOT p2) p3 p1), (AND (NOT p2) p3 p1)]
Stuttering acceptance computed with spot in 424 ms :[(OR (NOT p2) p3), p3, (OR (AND p1 (NOT p2)) (AND p1 p3)), (AND p1 p3), (AND (NOT p2) p3 p1), (AND (NOT p2) p3 p1), (AND (NOT p2) p3 p1), (AND (NOT p2) p3 p1)]
Stuttering acceptance computed with spot in 440 ms :[(OR (NOT p2) p3), p3, (OR (AND p1 (NOT p2)) (AND p1 p3)), (AND p1 p3), (AND (NOT p2) p3 p1), (AND (NOT p2) p3 p1), (AND (NOT p2) p3 p1), (AND (NOT p2) p3 p1)]
Product exploration explored 100000 steps with 22810 reset in 277 ms.
Product exploration explored 100000 steps with 22792 reset in 305 ms.
Support contains 28 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 92/92 transitions.
Applied a total of 0 rules in 1 ms. Remains 68 /68 variables (removed 0) and now considering 92/92 (removed 0) transitions.
// Phase 1: matrix 92 rows 68 cols
[2024-05-30 10:51:09] [INFO ] Computed 8 invariants in 5 ms
[2024-05-30 10:51:09] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-30 10:51:09] [INFO ] Invariant cache hit.
[2024-05-30 10:51:10] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
Running 88 sub problems to find dead transitions.
[2024-05-30 10:51:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 4/68 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (OVERLAPS) 92/160 variables, 68/76 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (OVERLAPS) 0/160 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Real declared 160/160 variables, and 76 constraints, problems are : Problem set: 0 solved, 88 unsolved in 2346 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 88 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 4/68 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (OVERLAPS) 92/160 variables, 68/76 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 88/164 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (OVERLAPS) 0/160 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Int declared 160/160 variables, and 164 constraints, problems are : Problem set: 0 solved, 88 unsolved in 2215 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 0/0 constraints]
After SMT, in 4580ms problems are : Problem set: 0 solved, 88 unsolved
Search for dead transitions found 0 dead transitions in 4582ms
Finished structural reductions in LTL mode , in 1 iterations and 4749 ms. Remains : 68/68 places, 92/92 transitions.
Treatment of property UtilityControlRoom-COL-Z4T4N04-LTLFireability-04 finished in 13074 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
[2024-05-30 10:51:14] [INFO ] Flatten gal took : 37 ms
[2024-05-30 10:51:14] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 11 ms.
[2024-05-30 10:51:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 153 places, 236 transitions and 688 arcs took 10 ms.
Total runtime 356882 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running UtilityControlRoom-COL-Z4T4N04

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 153
TRANSITIONS: 236
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.005s, Sys 0.005s]

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

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

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

Process ID: 2749
MODEL NAME: /home/mcc/execution/413/model
153 places, 236 transitions.

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

BK_STOP 1717066294551

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="UtilityControlRoom-COL-Z4T4N04"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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