Execution Chart

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

Trace from the execution

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

--------------------
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 1717265662917

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=UtilityControlRoom-COL-Z4T4N04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 18:14:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 18:14:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 18:14:24] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-06-01 18:14:25] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 18:14:25] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 979 ms
[2024-06-01 18:14:26] [INFO ] Imported 13 HL places and 12 HL transitions for a total of 154 PT places and 300.0 transition bindings in 24 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
[2024-06-01 18:14:26] [INFO ] Built PT skeleton of HLPN with 13 places and 12 transitions 37 arcs in 6 ms.
[2024-06-01 18:14:26] [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 21820 steps (4 resets) in 556 ms. (39 steps per ms) remains 0/12 properties
[2024-06-01 18:14:26] [INFO ] Flatten gal took : 23 ms
[2024-06-01 18:14:26] [INFO ] Flatten gal took : 5 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-06-01 18:14:26] [INFO ] Unfolded HLPN to a Petri net with 154 places and 300 transitions 964 arcs in 36 ms.
[2024-06-01 18:14:26] [INFO ] Unfolded 13 HLPN properties in 1 ms.
[2024-06-01 18:14:26] [INFO ] Reduced 12 identical enabling conditions.
[2024-06-01 18:14:26] [INFO ] Reduced 12 identical enabling conditions.
[2024-06-01 18:14:26] [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 12 ms. Remains 154 /154 variables (removed 0) and now considering 236/236 (removed 0) transitions.
// Phase 1: matrix 236 rows 154 cols
[2024-06-01 18:14:26] [INFO ] Computed 11 invariants in 36 ms
[2024-06-01 18:14:27] [INFO ] Implicit Places using invariants in 333 ms returned [125]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 384 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 418 ms. Remains : 153/154 places, 236/236 transitions.
Support contains 137 out of 153 places after structural reductions.
[2024-06-01 18:14:27] [INFO ] Flatten gal took : 48 ms
[2024-06-01 18:14:27] [INFO ] Flatten gal took : 62 ms
[2024-06-01 18:14:27] [INFO ] Input system was already deterministic with 236 transitions.
Reduction of identical properties reduced properties to check from 18 to 14
RANDOM walk for 617 steps (0 resets) in 43 ms. (14 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 8 ms. Remains 153 /153 variables (removed 0) and now considering 236/236 (removed 0) transitions.
// Phase 1: matrix 236 rows 153 cols
[2024-06-01 18:14:28] [INFO ] Computed 10 invariants in 6 ms
[2024-06-01 18:14:28] [INFO ] Implicit Places using invariants in 265 ms returned [124]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 268 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 6 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 282 ms. Remains : 152/153 places, 236/236 transitions.
Stuttering acceptance computed with spot in 270 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N04-LTLFireability-00
Product exploration explored 100000 steps with 15033 reset in 738 ms.
Product exploration explored 100000 steps with 15000 reset in 529 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 115 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 21 steps (0 resets) in 9 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 125 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 79 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 236 rows 152 cols
[2024-06-01 18:14:30] [INFO ] Computed 9 invariants in 6 ms
[2024-06-01 18:14:31] [INFO ] [Real]Absence check using 9 positive place invariants in 9 ms returned sat
[2024-06-01 18:14:31] [INFO ] [Real]Absence check using state equation in 175 ms returned sat
[2024-06-01 18:14:31] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 18:14:31] [INFO ] [Nat]Absence check using 9 positive place invariants in 9 ms returned sat
[2024-06-01 18:14:31] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2024-06-01 18:14:31] [INFO ] Computed and/alt/rep : 232/356/232 causal constraints (skipped 0 transitions) in 35 ms.
[2024-06-01 18:14:32] [INFO ] Added : 64 causal constraints over 13 iterations in 374 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 0 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 41 ms. Remains 132 /152 variables (removed 20) and now considering 216/236 (removed 20) transitions.
// Phase 1: matrix 216 rows 132 cols
[2024-06-01 18:14:32] [INFO ] Computed 9 invariants in 6 ms
[2024-06-01 18:14:32] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-06-01 18:14:32] [INFO ] Invariant cache hit.
[2024-06-01 18:14:32] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
[2024-06-01 18:14:32] [INFO ] Redundant transitions in 12 ms returned []
Running 200 sub problems to find dead transitions.
[2024-06-01 18:14:32] [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 7685 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 8773 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 16639ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 16655ms
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 17045 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 148 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 18 steps (0 resets) in 6 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 161 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 83 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
[2024-06-01 18:14:49] [INFO ] Invariant cache hit.
[2024-06-01 18:14:50] [INFO ] [Real]Absence check using 9 positive place invariants in 7 ms returned sat
[2024-06-01 18:14:50] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2024-06-01 18:14:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 18:14:50] [INFO ] [Nat]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-06-01 18:14:50] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2024-06-01 18:14:50] [INFO ] Computed and/alt/rep : 200/448/200 causal constraints (skipped 0 transitions) in 22 ms.
[2024-06-01 18:14:51] [INFO ] Added : 103 causal constraints over 22 iterations in 455 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 20451 reset in 569 ms.
Product exploration explored 100000 steps with 20467 reset in 631 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 8 ms. Remains 132 /132 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-06-01 18:14:52] [INFO ] Invariant cache hit.
[2024-06-01 18:14:52] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-06-01 18:14:52] [INFO ] Invariant cache hit.
[2024-06-01 18:14:52] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
[2024-06-01 18:14:52] [INFO ] Redundant transitions in 11 ms returned []
Running 200 sub problems to find dead transitions.
[2024-06-01 18:14: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 7330 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 8496 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 15938ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 15943ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 16313 ms. Remains : 132/132 places, 216/216 transitions.
Treatment of property UtilityControlRoom-COL-Z4T4N04-LTLFireability-00 finished in 40511 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 17 ms. Remains 105 /153 variables (removed 48) and now considering 188/236 (removed 48) transitions.
// Phase 1: matrix 188 rows 105 cols
[2024-06-01 18:15:08] [INFO ] Computed 10 invariants in 1 ms
[2024-06-01 18:15:08] [INFO ] Implicit Places using invariants in 126 ms returned [76]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 128 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 5 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 151 ms. Remains : 104/153 places, 188/236 transitions.
Stuttering acceptance computed with spot in 183 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 358 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 12 ms. Remains 105 /153 variables (removed 48) and now considering 188/236 (removed 48) transitions.
[2024-06-01 18:15:09] [INFO ] Invariant cache hit.
[2024-06-01 18:15:09] [INFO ] Implicit Places using invariants in 121 ms returned [76]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 128 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 4 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 144 ms. Remains : 104/153 places, 188/236 transitions.
Stuttering acceptance computed with spot in 208 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 1475 reset in 238 ms.
Product exploration explored 100000 steps with 1489 reset in 361 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 86 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 153 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 347 steps (0 resets) in 10 ms. (31 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 136 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 165 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 157 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-06-01 18:15:10] [INFO ] Computed 9 invariants in 2 ms
[2024-06-01 18:15:10] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-06-01 18:15:10] [INFO ] Invariant cache hit.
[2024-06-01 18:15:11] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
Running 184 sub problems to find dead transitions.
[2024-06-01 18:15:11] [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 5705 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 7181 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 12970ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 12975ms
Finished structural reductions in LTL mode , in 1 iterations and 13211 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 94 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 170 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 337 steps (0 resets) in 6 ms. (48 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 144 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 166 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 1446 reset in 236 ms.
Product exploration explored 100000 steps with 1470 reset in 268 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 188 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 21 ms. Remains 89 /104 variables (removed 15) and now considering 124/188 (removed 64) transitions.
[2024-06-01 18:15:26] [INFO ] Redundant transitions in 1 ms returned []
Running 108 sub problems to find dead transitions.
// Phase 1: matrix 124 rows 89 cols
[2024-06-01 18:15:26] [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-06-01 18:15:26] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 14 ms to minimize.
Problem TDEAD1 is UNSAT
[2024-06-01 18:15:26] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 2 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-06-01 18:15:26] [INFO ] Deduced a trap composed of 15 places in 46 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 2765 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 2140 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 4942ms problems are : Problem set: 32 solved, 76 unsolved
Search for dead transitions found 32 dead transitions in 4946ms
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 8 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 4988 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 1 ms. Remains 104 /104 variables (removed 0) and now considering 188/188 (removed 0) transitions.
// Phase 1: matrix 188 rows 104 cols
[2024-06-01 18:15:31] [INFO ] Computed 9 invariants in 1 ms
[2024-06-01 18:15:31] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-06-01 18:15:31] [INFO ] Invariant cache hit.
[2024-06-01 18:15:31] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
Running 184 sub problems to find dead transitions.
[2024-06-01 18:15:31] [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 5943 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 7149 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 13159ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 13163ms
Finished structural reductions in LTL mode , in 1 iterations and 13408 ms. Remains : 104/104 places, 188/188 transitions.
Treatment of property UtilityControlRoom-COL-Z4T4N04-LTLFireability-03 finished in 35322 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-06-01 18:15:44] [INFO ] Computed 10 invariants in 1 ms
[2024-06-01 18:15:44] [INFO ] Implicit Places using invariants in 119 ms returned [76]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 121 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 126 ms. Remains : 104/153 places, 188/236 transitions.
Stuttering acceptance computed with spot in 490 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 21384 reset in 260 ms.
Product exploration explored 100000 steps with 21442 reset in 237 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND 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 145 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 376 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 1022 ms. (39 steps per ms) remains 6/21 properties
BEST_FIRST walk for 40002 steps (8 resets) in 263 ms. (151 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 537 ms. (74 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 233 ms. (170 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 86 ms. (459 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 165 ms. (240 steps per ms) remains 6/6 properties
// Phase 1: matrix 188 rows 104 cols
[2024-06-01 18:15:46] [INFO ] Computed 9 invariants in 3 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 26 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 49ms 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 870 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 417 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 354 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 2 ms. Remains 104 /104 variables (removed 0) and now considering 188/188 (removed 0) transitions.
[2024-06-01 18:15:48] [INFO ] Invariant cache hit.
[2024-06-01 18:15:48] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-06-01 18:15:48] [INFO ] Invariant cache hit.
[2024-06-01 18:15:48] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
Running 184 sub problems to find dead transitions.
[2024-06-01 18:15:48] [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 5897 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 7277 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 13256ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 13259ms
Finished structural reductions in LTL mode , in 1 iterations and 13468 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 102 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 354 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 352 steps (0 resets) in 11 ms. (29 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 564 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 360 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 333 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 334 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 21368 reset in 232 ms.
Product exploration explored 100000 steps with 21389 reset in 244 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 1 ms. Remains 104 /104 variables (removed 0) and now considering 188/188 (removed 0) transitions.
[2024-06-01 18:16:04] [INFO ] Invariant cache hit.
[2024-06-01 18:16:04] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-01 18:16:04] [INFO ] Invariant cache hit.
[2024-06-01 18:16:05] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
Running 184 sub problems to find dead transitions.
[2024-06-01 18:16:05] [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 5719 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 6967 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 12756ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 12760ms
Finished structural reductions in LTL mode , in 1 iterations and 13001 ms. Remains : 104/104 places, 188/188 transitions.
Treatment of property UtilityControlRoom-COL-Z4T4N04-LTLFireability-04 finished in 33397 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 27 ms. Remains 85 /153 variables (removed 68) and now considering 152/236 (removed 84) transitions.
// Phase 1: matrix 152 rows 85 cols
[2024-06-01 18:16:17] [INFO ] Computed 10 invariants in 2 ms
[2024-06-01 18:16:17] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-06-01 18:16:17] [INFO ] Invariant cache hit.
[2024-06-01 18:16:18] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
[2024-06-01 18:16:18] [INFO ] Redundant transitions in 2 ms returned []
Running 132 sub problems to find dead transitions.
[2024-06-01 18:16:18] [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 3549 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 4887 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 8568ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 8571ms
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 8753 ms. Remains : 85/153 places, 152/236 transitions.
Stuttering acceptance computed with spot in 89 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 8262 reset in 532 ms.
Product exploration explored 100000 steps with 8513 reset in 555 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 310 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 78 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 59 steps (0 resets) in 5 ms. (9 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 410 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 81 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2024-06-01 18:16:28] [INFO ] Invariant cache hit.
[2024-06-01 18:16:29] [INFO ] [Real]Absence check using 10 positive place invariants in 12 ms returned sat
[2024-06-01 18:16:29] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2024-06-01 18:16:29] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 18:16:29] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2024-06-01 18:16:30] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2024-06-01 18:16:30] [INFO ] Computed and/alt/rep : 132/224/132 causal constraints (skipped 0 transitions) in 18 ms.
[2024-06-01 18:16:30] [INFO ] Added : 132 causal constraints over 28 iterations in 470 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-06-01 18:16:30] [INFO ] Invariant cache hit.
[2024-06-01 18:16:30] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-06-01 18:16:30] [INFO ] Invariant cache hit.
[2024-06-01 18:16:30] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
[2024-06-01 18:16:30] [INFO ] Redundant transitions in 1 ms returned []
Running 132 sub problems to find dead transitions.
[2024-06-01 18:16:30] [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 3783 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 4924 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 8827ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 8829ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 8986 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 343 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 162 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 56 steps (0 resets) in 4 ms. (11 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 438 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 80 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2024-06-01 18:16:40] [INFO ] Invariant cache hit.
[2024-06-01 18:16:41] [INFO ] [Real]Absence check using 10 positive place invariants in 14 ms returned sat
[2024-06-01 18:16:41] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2024-06-01 18:16:41] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 18:16:41] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2024-06-01 18:16:41] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2024-06-01 18:16:41] [INFO ] Computed and/alt/rep : 132/224/132 causal constraints (skipped 0 transitions) in 16 ms.
[2024-06-01 18:16:42] [INFO ] Added : 132 causal constraints over 28 iterations in 455 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 8681 reset in 651 ms.
Product exploration explored 100000 steps with 8548 reset in 667 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 5 ms. Remains 85 /85 variables (removed 0) and now considering 152/152 (removed 0) transitions.
[2024-06-01 18:16:43] [INFO ] Invariant cache hit.
[2024-06-01 18:16:43] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-06-01 18:16:43] [INFO ] Invariant cache hit.
[2024-06-01 18:16:43] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
[2024-06-01 18:16:43] [INFO ] Redundant transitions in 0 ms returned []
Running 132 sub problems to find dead transitions.
[2024-06-01 18:16:43] [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 3541 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 4768 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 8427ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 8429ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 8580 ms. Remains : 85/85 places, 152/152 transitions.
Treatment of property UtilityControlRoom-COL-Z4T4N04-LTLFireability-05 finished in 34541 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-06-01 18:16:52] [INFO ] Computed 10 invariants in 2 ms
[2024-06-01 18:16:52] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-06-01 18:16:52] [INFO ] Invariant cache hit.
[2024-06-01 18:16:52] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
Running 184 sub problems to find dead transitions.
[2024-06-01 18:16:52] [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 6037 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 8505 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 14725ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 14729ms
Starting structural reductions in LTL mode, iteration 1 : 105/153 places, 188/236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14946 ms. Remains : 105/153 places, 188/236 transitions.
Stuttering acceptance computed with spot in 268 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 2096 reset in 613 ms.
Product exploration explored 100000 steps with 2080 reset in 612 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 p2) (NOT p1) p3), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p0 (NOT p2) p1 (NOT p3)))), (X (NOT (OR (AND p0 p2 (NOT p3)) (AND p0 p1 (NOT p3))))), (X (NOT p0)), (X (NOT (OR (AND p0 (NOT p2) (NOT p1)) (AND p0 p3)))), (X p1), (X (X (NOT (AND p0 (NOT p2) p1 (NOT p3))))), (X (X (NOT (OR (AND p0 p2 (NOT p3)) (AND p0 p1 (NOT p3))))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p2) p1 (NOT p3)))), (X (X (NOT (AND (NOT p2) p1 (NOT p3))))), (X (X (OR (AND p2 (NOT p3)) (AND p1 (NOT p3))))), (X (X (NOT (OR (AND p2 (NOT p3)) (AND p1 (NOT p3)))))), (X (X (OR (AND (NOT p2) (NOT p1)) p3))), (X (X (NOT (OR (AND (NOT p2) (NOT p1)) p3)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (OR (AND p0 (NOT p2) (NOT p1)) (AND p0 p3)))), (X (X (NOT (OR (AND p0 (NOT p2) (NOT p1)) (AND p0 p3))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 925 ms. Reduced automaton from 5 states, 12 edges and 4 AP (stutter sensitive) to 13 states, 38 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 668 ms :[(OR (NOT p2) (NOT p0) p3), (OR (NOT p2) (NOT p0) p3), (OR (NOT p2) p3), (NOT p2), p3, (AND p0 (NOT p1) (NOT p2) (NOT p3)), (AND p0 (NOT p1) (NOT p2) p3), false, (AND p0 (NOT p1) p2 p3), (AND p0 p1 (NOT p2) (NOT p3)), (AND p0 p1 (NOT p2) p3), false, (AND p0 p1 p2 p3)]
Reduction of identical properties reduced properties to check from 19 to 18
RANDOM walk for 40000 steps (8 resets) in 373 ms. (106 steps per ms) remains 4/18 properties
BEST_FIRST walk for 40004 steps (8 resets) in 254 ms. (156 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 182 ms. (218 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 233 ms. (170 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 238 ms. (167 steps per ms) remains 4/4 properties
[2024-06-01 18:17:10] [INFO ] Invariant cache hit.
Problem apf2 is UNSAT
Problem apf6 is UNSAT
Problem apf11 is UNSAT
Problem apf14 is UNSAT
After SMT solving in domain Real declared 29/293 variables, and 0 constraints, problems are : Problem set: 4 solved, 0 unsolved in 33 ms.
Refiners :[Positive P Invariants (semi-flows): 0/10 constraints, State Equation: 0/105 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 110ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1) p3), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p0 (NOT p2) p1 (NOT p3)))), (X (NOT (OR (AND p0 p2 (NOT p3)) (AND p0 p1 (NOT p3))))), (X (NOT p0)), (X (NOT (OR (AND p0 (NOT p2) (NOT p1)) (AND p0 p3)))), (X p1), (X (X (NOT (AND p0 (NOT p2) p1 (NOT p3))))), (X (X (NOT (OR (AND p0 p2 (NOT p3)) (AND p0 p1 (NOT p3)))))), (G (OR (NOT p0) (NOT p1) p2 (NOT p3))), (G (OR (NOT p0) p1 (NOT p2) p3)), (G (OR (NOT p0) (NOT p1) p2 p3)), (G (OR (NOT p0) p1 (NOT p2) (NOT p3)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p2) p1 (NOT p3)))), (X (X (NOT (AND (NOT p2) p1 (NOT p3))))), (X (X (OR (AND p2 (NOT p3)) (AND p1 (NOT p3))))), (X (X (NOT (OR (AND p2 (NOT p3)) (AND p1 (NOT p3)))))), (X (X (OR (AND (NOT p2) (NOT p1)) p3))), (X (X (NOT (OR (AND (NOT p2) (NOT p1)) p3)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (OR (AND p0 (NOT p2) (NOT p1)) (AND p0 p3)))), (X (X (NOT (OR (AND p0 (NOT p2) (NOT p1)) (AND p0 p3))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND (OR (NOT p0) p1 p2) (OR (NOT p0) (NOT p3))))), (F (NOT (AND (OR (NOT p1) p3) (OR (NOT p2) p3)))), (F (NOT (OR (NOT p0) p1 p2 p3))), (F (NOT (AND (OR (NOT p0) (NOT p1) p3) (OR (NOT p0) (NOT p2) p3)))), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2) p3))), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2) (NOT p3)))), (F (NOT (OR (NOT p1) p2))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (OR (AND (NOT p1) (NOT p2)) p3))), (F p2), (F p1), (F p0), (F (NOT (OR (NOT p1) p2 p3))), (F (NOT p3)), (F (NOT (OR (NOT p0) p1 p2 (NOT p3))))]
Knowledge based reduction with 14 factoid took 1737 ms. Reduced automaton from 13 states, 38 edges and 4 AP (stutter insensitive) to 14 states, 41 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 703 ms :[(OR (NOT p2) (NOT p0) p3), (OR (NOT p0) (NOT p2) p3), (OR (NOT p2) p3), (NOT p2), p3, (AND p0 (NOT p2) (NOT p3) (NOT p1)), (AND p0 (NOT p2) p3 (NOT p1)), false, (AND p0 p2 p3 (NOT p1)), (AND p0 (NOT p2) (NOT p3) p1), (AND p0 (NOT p2) p3 p1), false, (AND p0 p2 p3 p1), (AND p1 (NOT p2) (NOT p3) p0)]
Stuttering acceptance computed with spot in 703 ms :[(OR (NOT p2) (NOT p0) p3), (OR (NOT p0) (NOT p2) p3), (OR (NOT p2) p3), (NOT p2), p3, (AND p0 (NOT p2) (NOT p3) (NOT p1)), (AND p0 (NOT p2) p3 (NOT p1)), false, (AND p0 p2 p3 (NOT p1)), (AND p0 (NOT p2) (NOT p3) p1), (AND p0 (NOT p2) p3 p1), false, (AND p0 p2 p3 p1), (AND p1 (NOT p2) (NOT p3) p0)]
[2024-06-01 18:17:14] [INFO ] Invariant cache hit.
Proved EG (NOT p2)
[2024-06-01 18:17:14] [INFO ] Invariant cache hit.
[2024-06-01 18:17:14] [INFO ] [Real]Absence check using 10 positive place invariants in 13 ms returned sat
[2024-06-01 18:17:14] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2024-06-01 18:17:14] [INFO ] Computed and/alt/rep : 184/308/184 causal constraints (skipped 0 transitions) in 17 ms.
[2024-06-01 18:17:14] [INFO ] Added : 4 causal constraints over 1 iterations in 51 ms. Result :sat
Could not prove EG (NOT p0)
[2024-06-01 18:17:14] [INFO ] Invariant cache hit.
[2024-06-01 18:17:14] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2024-06-01 18:17:15] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2024-06-01 18:17:15] [INFO ] Computed and/alt/rep : 184/308/184 causal constraints (skipped 0 transitions) in 19 ms.
[2024-06-01 18:17:15] [INFO ] Added : 0 causal constraints over 0 iterations in 39 ms. Result :sat
Could not prove EG p3
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1) p3), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p0 (NOT p2) p1 (NOT p3)))), (X (NOT (OR (AND p0 p2 (NOT p3)) (AND p0 p1 (NOT p3))))), (X (NOT p0)), (X (NOT (OR (AND p0 (NOT p2) (NOT p1)) (AND p0 p3)))), (X p1), (X (X (NOT (AND p0 (NOT p2) p1 (NOT p3))))), (X (X (NOT (OR (AND p0 p2 (NOT p3)) (AND p0 p1 (NOT p3)))))), (G (OR (NOT p0) (NOT p1) p2 (NOT p3))), (G (OR (NOT p0) p1 (NOT p2) p3)), (G (OR (NOT p0) (NOT p1) p2 p3)), (G (OR (NOT p0) p1 (NOT p2) (NOT p3)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p2) p1 (NOT p3)))), (X (X (NOT (AND (NOT p2) p1 (NOT p3))))), (X (X (OR (AND p2 (NOT p3)) (AND p1 (NOT p3))))), (X (X (NOT (OR (AND p2 (NOT p3)) (AND p1 (NOT p3)))))), (X (X (OR (AND (NOT p2) (NOT p1)) p3))), (X (X (NOT (OR (AND (NOT p2) (NOT p1)) p3)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (OR (AND p0 (NOT p2) (NOT p1)) (AND p0 p3)))), (X (X (NOT (OR (AND p0 (NOT p2) (NOT p1)) (AND p0 p3))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND (OR (NOT p0) p1 p2) (OR (NOT p0) (NOT p3))))), (F (NOT (AND (OR (NOT p1) p3) (OR (NOT p2) p3)))), (F (NOT (OR (NOT p0) p1 p2 p3))), (F (NOT (AND (OR (NOT p0) (NOT p1) p3) (OR (NOT p0) (NOT p2) p3)))), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2) p3))), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2) (NOT p3)))), (F (NOT (OR (NOT p1) p2))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (OR (AND (NOT p1) (NOT p2)) p3))), (F p2), (F p1), (F p0), (F (NOT (OR (NOT p1) p2 p3))), (F (NOT p3)), (F (NOT (OR (NOT p0) p1 p2 (NOT p3)))), (G (NOT p2))]
Property proved to be false thanks to negative knowledge :(G (NOT p2))
Knowledge based reduction with 14 factoid took 1633 ms. Reduced automaton from 14 states, 41 edges and 4 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z4T4N04-LTLFireability-06 FALSE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z4T4N04-LTLFireability-06 finished in 24346 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-06-01 18:17:16] [INFO ] Invariant cache hit.
[2024-06-01 18:17:16] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-06-01 18:17:16] [INFO ] Invariant cache hit.
[2024-06-01 18:17:16] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
Running 184 sub problems to find dead transitions.
[2024-06-01 18:17:16] [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 5736 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 8641 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 14549ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 14554ms
Starting structural reductions in LTL mode, iteration 1 : 105/153 places, 188/236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14709 ms. Remains : 105/153 places, 188/236 transitions.
Stuttering acceptance computed with spot in 219 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 6995 reset in 334 ms.
Product exploration explored 100000 steps with 6819 reset in 347 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 198 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 210 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
RANDOM walk for 49 steps (0 resets) in 5 ms. (8 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 284 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 211 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 213 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
[2024-06-01 18:17:33] [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 427 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 17414 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 12 ms. Remains 89 /153 variables (removed 64) and now considering 156/236 (removed 80) transitions.
// Phase 1: matrix 156 rows 89 cols
[2024-06-01 18:17:34] [INFO ] Computed 10 invariants in 1 ms
[2024-06-01 18:17:34] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-06-01 18:17:34] [INFO ] Invariant cache hit.
[2024-06-01 18:17:34] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
[2024-06-01 18:17:34] [INFO ] Redundant transitions in 0 ms returned []
Running 152 sub problems to find dead transitions.
[2024-06-01 18:17:34] [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 4544 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 5481 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 10138ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 10143ms
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 10326 ms. Remains : 89/153 places, 156/236 transitions.
Stuttering acceptance computed with spot in 162 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 597 reset in 1091 ms.
Stack based approach found an accepted trace after 211 steps with 0 reset with depth 212 and stack size 212 in 3 ms.
FORMULA UtilityControlRoom-COL-Z4T4N04-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N04-LTLFireability-09 finished in 11605 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 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
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 16 ms. Remains 69 /153 variables (removed 84) and now considering 136/236 (removed 100) transitions.
// Phase 1: matrix 136 rows 69 cols
[2024-06-01 18:17:45] [INFO ] Computed 10 invariants in 1 ms
[2024-06-01 18:17:45] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-06-01 18:17:45] [INFO ] Invariant cache hit.
[2024-06-01 18:17:45] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
[2024-06-01 18:17:45] [INFO ] Redundant transitions in 0 ms returned []
Running 116 sub problems to find dead transitions.
[2024-06-01 18:17:45] [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 2848 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 4229 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 7184ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 7186ms
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 7367 ms. Remains : 69/153 places, 136/236 transitions.
Stuttering acceptance computed with spot in 42 ms :[p0]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N04-LTLFireability-10
Product exploration explored 100000 steps with 0 reset in 443 ms.
Stack based approach found an accepted trace after 1008 steps with 0 reset with depth 1009 and stack size 1009 in 7 ms.
FORMULA UtilityControlRoom-COL-Z4T4N04-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N04-LTLFireability-10 finished in 7874 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-06-01 18:17:53] [INFO ] Computed 10 invariants in 2 ms
[2024-06-01 18:17:53] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-06-01 18:17:53] [INFO ] Invariant cache hit.
[2024-06-01 18:17:53] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
Running 232 sub problems to find dead transitions.
[2024-06-01 18:17:53] [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 9749 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 13009 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 22938ms problems are : Problem set: 0 solved, 232 unsolved
Search for dead transitions found 0 dead transitions in 22942ms
Finished structural reductions in LTL mode , in 1 iterations and 23191 ms. Remains : 153/153 places, 236/236 transitions.
Stuttering acceptance computed with spot in 295 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 42 steps with 7 reset in 1 ms.
FORMULA UtilityControlRoom-COL-Z4T4N04-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N04-LTLFireability-11 finished in 23510 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-06-01 18:18:17] [INFO ] Computed 10 invariants in 10 ms
[2024-06-01 18:18:17] [INFO ] Implicit Places using invariants in 153 ms returned [76]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 154 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 158 ms. Remains : 104/153 places, 188/236 transitions.
Stuttering acceptance computed with spot in 84 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 6314 reset in 508 ms.
Stack based approach found an accepted trace after 46076 steps with 2921 reset with depth 8 and stack size 8 in 268 ms.
FORMULA UtilityControlRoom-COL-Z4T4N04-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N04-LTLFireability-14 finished in 1034 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-06-01 18:18:18] [INFO ] Computed 9 invariants in 0 ms
[2024-06-01 18:18:18] [INFO ] Implicit Places using invariants in 38 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 39 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-06-01 18:18:18] [INFO ] Computed 8 invariants in 0 ms
[2024-06-01 18:18:18] [INFO ] Implicit Places using invariants in 33 ms returned [4, 5, 6, 7]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 34 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-06-01 18:18:18] [INFO ] Computed 4 invariants in 0 ms
[2024-06-01 18:18:18] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-06-01 18:18:18] [INFO ] Invariant cache hit.
[2024-06-01 18:18:18] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 42 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 133 ms. Remains : 8/153 places, 8/236 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N04-LTLFireability-15
Product exploration explored 100000 steps with 50000 reset in 70 ms.
Product exploration explored 100000 steps with 50000 reset in 78 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 13 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 348 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 76 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 0 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 10 ms. Remains 133 /153 variables (removed 20) and now considering 216/236 (removed 20) transitions.
// Phase 1: matrix 216 rows 133 cols
[2024-06-01 18:18:18] [INFO ] Computed 10 invariants in 2 ms
[2024-06-01 18:18:18] [INFO ] Implicit Places using invariants in 177 ms returned [104]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 179 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 195 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 20494 reset in 407 ms.
Product exploration explored 100000 steps with 20464 reset in 412 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 141 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 85 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 17 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 80 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 216 rows 132 cols
[2024-06-01 18:18:20] [INFO ] Computed 9 invariants in 2 ms
[2024-06-01 18:18:20] [INFO ] [Real]Absence check using 9 positive place invariants in 7 ms returned sat
[2024-06-01 18:18:20] [INFO ] [Real]Absence check using state equation in 113 ms returned sat
[2024-06-01 18:18:20] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 18:18:20] [INFO ] [Nat]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-06-01 18:18:21] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
[2024-06-01 18:18:21] [INFO ] Computed and/alt/rep : 200/448/200 causal constraints (skipped 0 transitions) in 19 ms.
[2024-06-01 18:18:21] [INFO ] Added : 163 causal constraints over 33 iterations in 695 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 5 ms. Remains 132 /132 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-06-01 18:18:21] [INFO ] Invariant cache hit.
[2024-06-01 18:18:21] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-06-01 18:18:21] [INFO ] Invariant cache hit.
[2024-06-01 18:18:22] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
[2024-06-01 18:18:22] [INFO ] Redundant transitions in 0 ms returned []
Running 200 sub problems to find dead transitions.
[2024-06-01 18:18:22] [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 7466 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 8855 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 16392ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 16395ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 16708 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 129 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 78 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 155 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 82 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
[2024-06-01 18:18:39] [INFO ] Invariant cache hit.
[2024-06-01 18:18:39] [INFO ] [Real]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-06-01 18:18:39] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2024-06-01 18:18:39] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 18:18:39] [INFO ] [Nat]Absence check using 9 positive place invariants in 9 ms returned sat
[2024-06-01 18:18:39] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2024-06-01 18:18:39] [INFO ] Computed and/alt/rep : 200/448/200 causal constraints (skipped 0 transitions) in 22 ms.
[2024-06-01 18:18:40] [INFO ] Added : 103 causal constraints over 22 iterations in 497 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 20460 reset in 493 ms.
Product exploration explored 100000 steps with 20385 reset in 507 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 4 ms. Remains 132 /132 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-06-01 18:18:41] [INFO ] Invariant cache hit.
[2024-06-01 18:18:41] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-06-01 18:18:41] [INFO ] Invariant cache hit.
[2024-06-01 18:18:41] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
[2024-06-01 18:18:41] [INFO ] Redundant transitions in 1 ms returned []
Running 200 sub problems to find dead transitions.
[2024-06-01 18:18:41] [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 7200 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 8902 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 16171ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 16175ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 16450 ms. Remains : 132/132 places, 216/216 transitions.
Treatment of property UtilityControlRoom-COL-Z4T4N04-LTLFireability-00 finished in 39292 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 172 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 10 ms. Remains 70 /153 variables (removed 83) and now considering 92/236 (removed 144) transitions.
// Phase 1: matrix 92 rows 70 cols
[2024-06-01 18:18:58] [INFO ] Computed 10 invariants in 0 ms
[2024-06-01 18:18:58] [INFO ] Implicit Places using invariants in 76 ms returned [0, 53]
[2024-06-01 18:18:58] [INFO ] Actually due to overlaps returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 88 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 2 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 103 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 3008 reset in 216 ms.
Product exploration explored 100000 steps with 2969 reset in 233 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 92 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 157 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 170 steps (0 resets) in 4 ms. (34 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 135 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 162 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 163 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-06-01 18:18:59] [INFO ] Computed 9 invariants in 1 ms
[2024-06-01 18:18:59] [INFO ] Implicit Places using invariants in 60 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 62 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 65 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 82 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 276 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 196 steps (0 resets) in 5 ms. (32 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 134 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 157 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 3005 reset in 207 ms.
Product exploration explored 100000 steps with 3045 reset in 219 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 157 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-06-01 18:19:01] [INFO ] Redundant transitions in 0 ms returned []
Running 76 sub problems to find dead transitions.
// Phase 1: matrix 92 rows 68 cols
[2024-06-01 18:19:01] [INFO ] Computed 8 invariants in 1 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-06-01 18:19:01] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-06-01 18:19:01] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
Problem TDEAD1 is UNSAT
[2024-06-01 18:19:01] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-06-01 18:19:01] [INFO ] Deduced a trap composed of 11 places in 24 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 1631 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 1243 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 2892ms problems are : Problem set: 16 solved, 60 unsolved
Search for dead transitions found 16 dead transitions in 2893ms
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.2 ms
Discarding 16 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 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 2913 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 0 ms. Remains 68 /68 variables (removed 0) and now considering 92/92 (removed 0) transitions.
// Phase 1: matrix 92 rows 68 cols
[2024-06-01 18:19:04] [INFO ] Computed 8 invariants in 1 ms
[2024-06-01 18:19:04] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-06-01 18:19:04] [INFO ] Invariant cache hit.
[2024-06-01 18:19:04] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
Running 76 sub problems to find dead transitions.
[2024-06-01 18:19:04] [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 1489 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 1603 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 3106ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 3109ms
Finished structural reductions in LTL mode , in 1 iterations and 3220 ms. Remains : 68/68 places, 92/92 transitions.
Treatment of property UtilityControlRoom-COL-Z4T4N04-LTLFireability-03 finished in 9602 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 478 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 9 ms. Remains 70 /153 variables (removed 83) and now considering 92/236 (removed 144) transitions.
// Phase 1: matrix 92 rows 70 cols
[2024-06-01 18:19:08] [INFO ] Computed 10 invariants in 1 ms
[2024-06-01 18:19:08] [INFO ] Implicit Places using invariants in 80 ms returned [0, 57]
[2024-06-01 18:19:08] [INFO ] Actually due to overlaps returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 82 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 2 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 94 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 22782 reset in 184 ms.
Product exploration explored 100000 steps with 22773 reset in 196 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 126 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 366 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 280 ms. (142 steps per ms) remains 6/21 properties
BEST_FIRST walk for 40003 steps (8 resets) in 63 ms. (625 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 45 ms. (869 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 88 ms. (449 steps per ms) remains 6/6 properties
// Phase 1: matrix 92 rows 69 cols
[2024-06-01 18:19:09] [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 27 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 45ms 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 898 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 325 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 345 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-06-01 18:19:10] [INFO ] Invariant cache hit.
[2024-06-01 18:19:11] [INFO ] Implicit Places using invariants in 72 ms returned [56]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 73 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 75 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 88 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 341 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 580 steps (0 resets) in 8 ms. (64 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 413 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 339 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 357 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 428 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 22829 reset in 189 ms.
Product exploration explored 100000 steps with 22820 reset in 192 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 0 ms. Remains 68 /68 variables (removed 0) and now considering 92/92 (removed 0) transitions.
// Phase 1: matrix 92 rows 68 cols
[2024-06-01 18:19:13] [INFO ] Computed 8 invariants in 1 ms
[2024-06-01 18:19:13] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-06-01 18:19:13] [INFO ] Invariant cache hit.
[2024-06-01 18:19:13] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
Running 88 sub problems to find dead transitions.
[2024-06-01 18:19:13] [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 1795 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 1637 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 3447ms problems are : Problem set: 0 solved, 88 unsolved
Search for dead transitions found 0 dead transitions in 3449ms
Finished structural reductions in LTL mode , in 1 iterations and 3572 ms. Remains : 68/68 places, 92/92 transitions.
Treatment of property UtilityControlRoom-COL-Z4T4N04-LTLFireability-04 finished in 9682 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-06-01 18:19:17] [INFO ] Flatten gal took : 23 ms
[2024-06-01 18:19:17] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 8 ms.
[2024-06-01 18:19:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 153 places, 236 transitions and 688 arcs took 7 ms.
Total runtime 292641 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : UtilityControlRoom-COL-Z4T4N04-LTLFireability-00
FORMULA UtilityControlRoom-COL-Z4T4N04-LTLFireability-03 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA UtilityControlRoom-COL-Z4T4N04-LTLFireability-04 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : UtilityControlRoom-COL-Z4T4N04-LTLFireability-05

BK_STOP 1717265958120

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

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

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

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

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

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa64f4) [0x5593136f54f4]
1: pnml2lts-mc(+0xa6596) [0x5593136f5596]
2: /lib/x86_64-linux-gnu/libc.so.6(+0x3c050) [0x7ffbf8b3b050]
3: pnml2lts-mc(+0x430585) [0x559313a7f585]
4: pnml2lts-mc(+0x1708c9) [0x5593137bf8c9]
5: pnml2lts-mc(+0x169cd4) [0x5593137b8cd4]
6: pnml2lts-mc(+0x27153f) [0x5593138c053f]
7: pnml2lts-mc(+0xba280) [0x559313709280]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3e55d) [0x7ffbf8b3d55d]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3e69a) [0x7ffbf8b3d69a]
10: pnml2lts-mc(+0xa5681) [0x5593136f4681]
11: pnml2lts-mc(+0xa5a10) [0x5593136f4a10]
12: pnml2lts-mc(+0xa73a2) [0x5593136f63a2]
13: pnml2lts-mc(+0x92139) [0x5593136e1139]
14: pnml2lts-mc(+0x9311d) [0x5593136e211d]
15: pnml2lts-mc(+0x83fdb) [0x5593136d2fdb]
0: pnml2lts-mc(+0xa64f4) [0x5593136f54f4]
16: pnml2lts-mc(+0x64a5d) [0x5593136b3a5d]
1: pnml2lts-mc(+0xa6596) [0x5593136f5596]
17: pnml2lts-mc(+0x64af0) [0x5593136b3af0]
18: pnml2lts-mc(+0x62aca) [0x5593136b1aca]
2: /lib/x86_64-linux-gnu/libc.so.6(+0x3c050) [0x7ffbf8b3b050]
19: /lib/x86_64-linux-gnu/libc.so.6(+0x2724a) [0x7ffbf8b2624a]
3: pnml2lts-mc(+0x430585) [0x559313a7f585]
4: pnml2lts-mc(+0x1708c9) [0x5593137bf8c9]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0x85) [0x7ffbf8b26305]
5: pnml2lts-mc(+0x169cd4) [0x5593137b8cd4]
21: pnml2lts-mc(+0x6485e) [0x5593136b385e]
6: pnml2lts-mc(+0x27153f) [0x5593138c053f]
7: pnml2lts-mc(+0xba280) [0x559313709280]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3e55d) [0x7ffbf8b3d55d]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3e69a) [0x7ffbf8b3d69a]
10: pnml2lts-mc(+0xa5681) [0x5593136f4681]
11: pnml2lts-mc(+0xa5a10) [0x5593136f4a10]
12: pnml2lts-mc(+0xa73a2) [0x5593136f63a2]
13: pnml2lts-mc(+0x92139) [0x5593136e1139]
14: pnml2lts-mc(+0x9311d) [0x5593136e211d]
15: pnml2lts-mc(+0x83fdb) [0x5593136d2fdb]
16: pnml2lts-mc(+0x64a5d) [0x5593136b3a5d]
17: pnml2lts-mc(+0x64af0) [0x5593136b3af0]
0: pnml2lts-mc(+0xa64f4) [0x5593136f54f4]
18: pnml2lts-mc(+0x62aca) [0x5593136b1aca]
19: /lib/x86_64-linux-gnu/libc.so.6(+0x2724a) [0x7ffbf8b2624a]
1: pnml2lts-mc(+0xa6596) [0x5593136f5596]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0x85) [0x7ffbf8b26305]
2: /lib/x86_64-linux-gnu/libc.so.6(+0x3c050) [0x7ffbf8b3b050]
21: pnml2lts-mc(+0x6485e) [0x5593136b385e]
3: pnml2lts-mc(+0x430585) [0x559313a7f585]
4: pnml2lts-mc(+0x1708c9) [0x5593137bf8c9]
5: pnml2lts-mc(+0x169cd4) [0x5593137b8cd4]
6: pnml2lts-mc(+0x27153f) [0x5593138c053f]
7: pnml2lts-mc(+0xba280) [0x559313709280]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3e55d) [0x7ffbf8b3d55d]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3e69a) [0x7ffbf8b3d69a]
10: pnml2lts-mc(+0xa5681) [0x5593136f4681]
11: pnml2lts-mc(+0xa5a10) [0x5593136f4a10]
12: pnml2lts-mc(+0xa73a2) [0x5593136f63a2]
13: pnml2lts-mc(+0x92139) [0x5593136e1139]
14: pnml2lts-mc(+0x9311d) [0x5593136e211d]
15: pnml2lts-mc(+0x83fdb) [0x5593136d2fdb]
16: pnml2lts-mc(+0x64a5d) [0x5593136b3a5d]
17: pnml2lts-mc(+0x64af0) [0x5593136b3af0]
18: pnml2lts-mc(+0x62aca) [0x5593136b1aca]
19: /lib/x86_64-linux-gnu/libc.so.6(+0x2724a) [0x7ffbf8b2624a]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0x85) [0x7ffbf8b26305]
21: pnml2lts-mc(+0x6485e) [0x5593136b385e]
0: pnml2lts-mc(+0xa64f4) [0x5593136f54f4]
1: pnml2lts-mc(+0xa6596) [0x5593136f5596]
2: /lib/x86_64-linux-gnu/libc.so.6(+0x3c050) [0x7ffbf8b3b050]
3: pnml2lts-mc(+0x430585) [0x559313a7f585]
4: pnml2lts-mc(+0x1708c9) [0x5593137bf8c9]
5: pnml2lts-mc(+0x169cd4) [0x5593137b8cd4]
6: pnml2lts-mc(+0x27153f) [0x5593138c053f]
7: pnml2lts-mc(+0xba280) [0x559313709280]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3e55d) [0x7ffbf8b3d55d]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3e69a) [0x7ffbf8b3d69a]
10: pnml2lts-mc(+0xa5681) [0x5593136f4681]
11: pnml2lts-mc(+0xa5a10) [0x5593136f4a10]
12: pnml2lts-mc(+0xa73a2) [0x5593136f63a2]
13: pnml2lts-mc(+0x92139) [0x5593136e1139]
14: pnml2lts-mc(+0x9311d) [0x5593136e211d]
15: pnml2lts-mc(+0x83fdb) [0x5593136d2fdb]
16: pnml2lts-mc(+0x64a5d) [0x5593136b3a5d]
17: pnml2lts-mc(+0x64af0) [0x5593136b3af0]
18: pnml2lts-mc(+0x62aca) [0x5593136b1aca]
19: /lib/x86_64-linux-gnu/libc.so.6(+0x2724a) [0x7ffbf8b2624a]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0x85) [0x7ffbf8b26305]
21: pnml2lts-mc(+0x6485e) [0x5593136b385e]
ltl formula name UtilityControlRoom-COL-Z4T4N04-LTLFireability-03
ltl formula formula --ltl=/tmp/3094/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 153 places, 236 transitions and 688 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.010 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3094/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3094/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3094/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3094/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 155 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 154, there are 319 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~31!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 25
pnml2lts-mc( 0/ 4): unique states count: 141
pnml2lts-mc( 0/ 4): unique transitions count: 899
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 1
pnml2lts-mc( 0/ 4): - claim found count: 7
pnml2lts-mc( 0/ 4): - claim success count: 147
pnml2lts-mc( 0/ 4): - cum. max stack depth: 122
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 147 states 940 transitions, fanout: 6.395
pnml2lts-mc( 0/ 4): Total exploration time 0.020 sec (0.020 sec minimum, 0.020 sec on average)
pnml2lts-mc( 0/ 4): States per second: 7350, Transitions per second: 47000
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 31.5 B/state, compr.: 5.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 236 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name UtilityControlRoom-COL-Z4T4N04-LTLFireability-04
ltl formula formula --ltl=/tmp/3094/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 153 places, 236 transitions and 688 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.000 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3094/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3094/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3094/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3094/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 10 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 155 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 154, there are 743 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 2224
pnml2lts-mc( 0/ 4): unique states count: 2224
pnml2lts-mc( 0/ 4): unique transitions count: 7940
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 6027
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 2301
pnml2lts-mc( 0/ 4): - cum. max stack depth: 43
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2301 states 8743 transitions, fanout: 3.800
pnml2lts-mc( 0/ 4): Total exploration time 0.030 sec (0.030 sec minimum, 0.030 sec on average)
pnml2lts-mc( 0/ 4): States per second: 76700, Transitions per second: 291433
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 22.6 B/state, compr.: 3.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 236 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name UtilityControlRoom-COL-Z4T4N04-LTLFireability-05
ltl formula formula --ltl=/tmp/3094/ltl_3_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 153 places, 236 transitions and 688 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.010 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3094/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3094/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3094/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3094/ltl_3_
pnml2lts-mc( 1/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 0/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

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

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

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

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is UtilityControlRoom-COL-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 r544-smll-171701110800116"
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 ;