MCC'2024- Execution of r544-smll-171701111100252

About the Execution of LTSMin+red for UtilityControlRoom-PT-Z4T4N04

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
746.336	238814.00	302621.00	1438.80	?TFFT?FFFFTFTFFF	normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r544-smll-171701111100252.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-PT-Z4T4N04, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r544-smll-171701111100252
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 27K Apr 13 05:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 153K Apr 13 05:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 52K Apr 13 05:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 220K Apr 13 05:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 23 08:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Apr 23 08:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 23 08:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 23 08:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 59K Apr 13 05:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 321K Apr 13 05:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 103K Apr 13 05:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 406K Apr 13 05:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 08:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.3K Apr 23 08:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 8 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 128K 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-PT-Z4T4N04-LTLFireability-00
FORMULA_NAME UtilityControlRoom-PT-Z4T4N04-LTLFireability-01
FORMULA_NAME UtilityControlRoom-PT-Z4T4N04-LTLFireability-02
FORMULA_NAME UtilityControlRoom-PT-Z4T4N04-LTLFireability-03
FORMULA_NAME UtilityControlRoom-PT-Z4T4N04-LTLFireability-04
FORMULA_NAME UtilityControlRoom-PT-Z4T4N04-LTLFireability-05
FORMULA_NAME UtilityControlRoom-PT-Z4T4N04-LTLFireability-06
FORMULA_NAME UtilityControlRoom-PT-Z4T4N04-LTLFireability-07
FORMULA_NAME UtilityControlRoom-PT-Z4T4N04-LTLFireability-08
FORMULA_NAME UtilityControlRoom-PT-Z4T4N04-LTLFireability-09
FORMULA_NAME UtilityControlRoom-PT-Z4T4N04-LTLFireability-10
FORMULA_NAME UtilityControlRoom-PT-Z4T4N04-LTLFireability-11
FORMULA_NAME UtilityControlRoom-PT-Z4T4N04-LTLFireability-12
FORMULA_NAME UtilityControlRoom-PT-Z4T4N04-LTLFireability-13
FORMULA_NAME UtilityControlRoom-PT-Z4T4N04-LTLFireability-14
FORMULA_NAME UtilityControlRoom-PT-Z4T4N04-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717277732354

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=UtilityControlRoom-PT-Z4T4N04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 21:35:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 21:35:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 21:35:34] [INFO ] Load time of PNML (sax parser for PT used): 119 ms
[2024-06-01 21:35:34] [INFO ] Transformed 154 places.
[2024-06-01 21:35:34] [INFO ] Transformed 300 transitions.
[2024-06-01 21:35:34] [INFO ] Parsed PT model containing 154 places and 300 transitions and 964 arcs in 314 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 258 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
[2024-06-01 21:35:34] [INFO ] Reduced 12 identical enabling conditions.
[2024-06-01 21:35:34] [INFO ] Reduced 12 identical enabling conditions.
[2024-06-01 21:35:34] [INFO ] Reduced 12 identical enabling conditions.
Ensure Unique test removed 64 transitions
Reduce redundant transitions removed 64 transitions.
FORMULA UtilityControlRoom-PT-Z4T4N04-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z4T4N04-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z4T4N04-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 123 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 28 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 21:35:35] [INFO ] Computed 11 invariants in 28 ms
[2024-06-01 21:35:35] [INFO ] Implicit Places using invariants in 474 ms returned [125]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 521 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 581 ms. Remains : 153/154 places, 236/236 transitions.
Support contains 123 out of 153 places after structural reductions.
[2024-06-01 21:35:35] [INFO ] Flatten gal took : 68 ms
[2024-06-01 21:35:35] [INFO ] Flatten gal took : 39 ms
[2024-06-01 21:35:36] [INFO ] Input system was already deterministic with 236 transitions.
Reduction of identical properties reduced properties to check from 27 to 26
RANDOM walk for 7623 steps (0 resets) in 597 ms. (12 steps per ms) remains 0/26 properties
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 68 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 236/236 transitions.
Applied a total of 0 rules in 5 ms. Remains 153 /153 variables (removed 0) and now considering 236/236 (removed 0) transitions.
// Phase 1: matrix 236 rows 153 cols
[2024-06-01 21:35:36] [INFO ] Computed 10 invariants in 8 ms
[2024-06-01 21:35:36] [INFO ] Implicit Places using invariants in 251 ms returned [124]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 253 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 5 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 263 ms. Remains : 152/153 places, 236/236 transitions.
Stuttering acceptance computed with spot in 367 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N04-LTLFireability-00
Product exploration explored 100000 steps with 14950 reset in 592 ms.
Product exploration explored 100000 steps with 15013 reset in 456 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 94 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 69 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 18 steps (0 resets) in 4 ms. (3 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 101 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 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 236 rows 152 cols
[2024-06-01 21:35:38] [INFO ] Computed 9 invariants in 5 ms
[2024-06-01 21:35:39] [INFO ] [Real]Absence check using 9 positive place invariants in 7 ms returned sat
[2024-06-01 21:35:39] [INFO ] [Real]Absence check using state equation in 200 ms returned sat
[2024-06-01 21:35:39] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 21:35:39] [INFO ] [Nat]Absence check using 9 positive place invariants in 9 ms returned sat
[2024-06-01 21:35:40] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2024-06-01 21:35:40] [INFO ] Computed and/alt/rep : 232/356/232 causal constraints (skipped 0 transitions) in 67 ms.
[2024-06-01 21:35:41] [INFO ] Added : 232 causal constraints over 47 iterations in 1131 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 40 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 21:35:41] [INFO ] Computed 9 invariants in 2 ms
[2024-06-01 21:35:41] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-06-01 21:35:41] [INFO ] Invariant cache hit.
[2024-06-01 21:35:41] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
[2024-06-01 21:35:41] [INFO ] Redundant transitions in 12 ms returned []
Running 200 sub problems to find dead transitions.
[2024-06-01 21:35: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 6876 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 8301 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 15382ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 15396ms
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 15788 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 137 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 12 steps (0 resets) in 4 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 156 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 69 ms :[(NOT p0), (NOT p0)]
[2024-06-01 21:35:57] [INFO ] Invariant cache hit.
[2024-06-01 21:35:57] [INFO ] [Real]Absence check using 9 positive place invariants in 6 ms returned sat
[2024-06-01 21:35:58] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2024-06-01 21:35:58] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 21:35:58] [INFO ] [Nat]Absence check using 9 positive place invariants in 7 ms returned sat
[2024-06-01 21:35:58] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2024-06-01 21:35:58] [INFO ] Computed and/alt/rep : 200/448/200 causal constraints (skipped 0 transitions) in 19 ms.
[2024-06-01 21:35:58] [INFO ] Added : 111 causal constraints over 23 iterations in 485 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 20442 reset in 475 ms.
Product exploration explored 100000 steps with 20463 reset in 627 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 7 ms. Remains 132 /132 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-06-01 21:36:00] [INFO ] Invariant cache hit.
[2024-06-01 21:36:00] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-06-01 21:36:00] [INFO ] Invariant cache hit.
[2024-06-01 21:36:00] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
[2024-06-01 21:36:00] [INFO ] Redundant transitions in 10 ms returned []
Running 200 sub problems to find dead transitions.
[2024-06-01 21:36:00] [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 6447 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 7783 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 14314ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 14326ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 14641 ms. Remains : 132/132 places, 216/216 transitions.
Treatment of property UtilityControlRoom-PT-Z4T4N04-LTLFireability-00 finished in 38122 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 15 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 21:36:14] [INFO ] Computed 10 invariants in 1 ms
[2024-06-01 21:36:15] [INFO ] Implicit Places using invariants in 415 ms returned [76]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 420 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 440 ms. Remains : 104/153 places, 188/236 transitions.
Stuttering acceptance computed with spot in 191 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N04-LTLFireability-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z4T4N04-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N04-LTLFireability-02 finished in 689 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 10 ms. Remains 105 /153 variables (removed 48) and now considering 188/236 (removed 48) transitions.
[2024-06-01 21:36:15] [INFO ] Invariant cache hit.
[2024-06-01 21:36:15] [INFO ] Implicit Places using invariants in 132 ms returned [76]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 133 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/153 places, 188/236 transitions.
Applied a total of 0 rules in 3 ms. Remains 104 /104 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 147 ms. Remains : 104/153 places, 188/236 transitions.
Stuttering acceptance computed with spot in 140 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-PT-Z4T4N04-LTLFireability-03
Product exploration explored 100000 steps with 1418 reset in 214 ms.
Product exploration explored 100000 steps with 1465 reset in 315 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 125 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 143 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 400 steps (0 resets) in 9 ms. (40 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 126 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 148 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 24 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 188/188 transitions.
Applied a total of 0 rules in 2 ms. Remains 104 /104 variables (removed 0) and now considering 188/188 (removed 0) transitions.
// Phase 1: matrix 188 rows 104 cols
[2024-06-01 21:36:17] [INFO ] Computed 9 invariants in 1 ms
[2024-06-01 21:36:17] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-06-01 21:36:17] [INFO ] Invariant cache hit.
[2024-06-01 21:36:17] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
Running 184 sub problems to find dead transitions.
[2024-06-01 21:36:17] [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 5015 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 6221 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 11324ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 11337ms
Finished structural reductions in LTL mode , in 1 iterations and 11525 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 83 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 143 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 646 steps (0 resets) in 6 ms. (92 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 207 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 149 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 1464 reset in 220 ms.
Product exploration explored 100000 steps with 1425 reset in 250 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 149 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 0 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 18 ms. Remains 89 /104 variables (removed 15) and now considering 124/188 (removed 64) transitions.
[2024-06-01 21:36:30] [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 21:36:30] [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 21:36:31] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 17 ms to minimize.
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
[2024-06-01 21:36:31] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 3 ms to minimize.
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
[2024-06-01 21:36:31] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 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 TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 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 2821 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 2023 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 4886ms problems are : Problem set: 32 solved, 76 unsolved
Search for dead transitions found 32 dead transitions in 4889ms
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 7 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 4932 ms. Remains : 69/104 places, 92/188 transitions.
Support contains 24 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 188/188 transitions.
Applied a total of 0 rules in 2 ms. Remains 104 /104 variables (removed 0) and now considering 188/188 (removed 0) transitions.
// Phase 1: matrix 188 rows 104 cols
[2024-06-01 21:36:35] [INFO ] Computed 9 invariants in 1 ms
[2024-06-01 21:36:35] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-06-01 21:36:35] [INFO ] Invariant cache hit.
[2024-06-01 21:36:35] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
Running 184 sub problems to find dead transitions.
[2024-06-01 21:36:35] [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 4952 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 6254 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 11265ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 11268ms
Finished structural reductions in LTL mode , in 1 iterations and 11499 ms. Remains : 104/104 places, 188/188 transitions.
Treatment of property UtilityControlRoom-PT-Z4T4N04-LTLFireability-03 finished in 31362 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 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 21:36:46] [INFO ] Computed 10 invariants in 1 ms
[2024-06-01 21:36:46] [INFO ] Implicit Places using invariants in 114 ms returned [76]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 117 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 122 ms. Remains : 104/153 places, 188/236 transitions.
Stuttering acceptance computed with spot in 565 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-PT-Z4T4N04-LTLFireability-04
Product exploration explored 100000 steps with 21397 reset in 209 ms.
Product exploration explored 100000 steps with 21361 reset in 204 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) p1))), (X p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p2)), (X (X (AND p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 119 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 332 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 1108 ms. (36 steps per ms) remains 6/21 properties
BEST_FIRST walk for 40004 steps (8 resets) in 749 ms. (53 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 256 ms. (155 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 202 ms. (197 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 184 ms. (216 steps per ms) remains 6/6 properties
// Phase 1: matrix 188 rows 104 cols
[2024-06-01 21:36:49] [INFO ] Computed 9 invariants in 2 ms
Problem apf4 is UNSAT
Problem apf11 is UNSAT
Problem apf16 is UNSAT
Problem apf17 is UNSAT
Problem apf18 is UNSAT
Problem apf19 is UNSAT
After SMT solving in domain Real declared 28/292 variables, and 0 constraints, problems are : Problem set: 6 solved, 0 unsolved in 28 ms.
Refiners :[Positive P Invariants (semi-flows): 0/9 constraints, State Equation: 0/104 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 48ms problems are : Problem set: 6 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 6 invariant AP formulas.
Knowledge obtained : [(AND p1 p2 p0 p3), (X (NOT (AND (NOT p0) p1))), (X p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p2)), (X (X (AND p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p0)), (X (X p1)), (G (OR p0 p1 (NOT p2))), (G (OR p0 (NOT p1) (NOT p2))), (G (OR (NOT p0) p2)), (G (OR p0 p1 (NOT p2) (NOT p3))), (G (OR (NOT p0) p2 (NOT p3))), (G (OR p0 (NOT p1) (NOT p2) (NOT p3)))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p1) p2))), (F (NOT (AND p0 p2 p3))), (F (NOT (OR p1 (NOT p2)))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1) p2 (NOT p3)))), (F (NOT p3)), (F (NOT (AND p2 p3))), (F (NOT (AND p1 p2 p3))), (F (NOT (OR p0 p1 p2 (NOT p3)))), (F (NOT (OR p1 p2))), (F (NOT (OR p2 (NOT p3)))), (F (NOT (AND p0 p2))), (F (NOT (OR (NOT p1) p2 (NOT p3)))), (F (NOT (OR p1 (NOT p2) (NOT p3)))), (F (NOT (OR p1 p2 (NOT p3)))), (F (NOT (OR p0 p1 p2))), (F (NOT (AND p1 p2))), (F (NOT p2)), (F (NOT (OR p0 (NOT p1) p2)))]
Knowledge based reduction with 24 factoid took 828 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 307 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 305 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 1 ms. Remains 104 /104 variables (removed 0) and now considering 188/188 (removed 0) transitions.
[2024-06-01 21:36:50] [INFO ] Invariant cache hit.
[2024-06-01 21:36:50] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-01 21:36:50] [INFO ] Invariant cache hit.
[2024-06-01 21:36:51] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
Running 184 sub problems to find dead transitions.
[2024-06-01 21:36:51] [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 4999 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 6344 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 11417ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 11424ms
Finished structural reductions in LTL mode , in 1 iterations and 11646 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 93 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 301 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 718 steps (0 resets) in 10 ms. (65 steps per ms) remains 0/13 properties
Knowledge obtained : [(AND p2 p3 p1)]
False Knowledge obtained : [(F (NOT (OR p2 (NOT p3)))), (F (NOT (OR p1 (NOT p2)))), (F (NOT (OR (NOT p1) p2 (NOT p3)))), (F (NOT (AND p2 p3))), (F (NOT (AND p1 p2 p3))), (F (NOT (OR (NOT p1) p2))), (F (NOT p1)), (F (NOT (OR p1 p2 (NOT p3)))), (F (NOT p3)), (F (NOT (AND p1 p2))), (F (NOT p2)), (F (NOT (OR p1 p2))), (F (NOT (OR p1 (NOT p2) (NOT p3))))]
Knowledge based reduction with 1 factoid took 397 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 434 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 301 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 297 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 21432 reset in 210 ms.
Product exploration explored 100000 steps with 21412 reset in 226 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 2 ms. Remains 104 /104 variables (removed 0) and now considering 188/188 (removed 0) transitions.
[2024-06-01 21:37:04] [INFO ] Invariant cache hit.
[2024-06-01 21:37:04] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-06-01 21:37:04] [INFO ] Invariant cache hit.
[2024-06-01 21:37:05] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
Running 184 sub problems to find dead transitions.
[2024-06-01 21:37: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 5036 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 6330 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 11422ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 11425ms
Finished structural reductions in LTL mode , in 1 iterations and 11654 ms. Remains : 104/104 places, 188/188 transitions.
Treatment of property UtilityControlRoom-PT-Z4T4N04-LTLFireability-04 finished in 29738 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 17 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 21:37:16] [INFO ] Computed 10 invariants in 1 ms
[2024-06-01 21:37:16] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-01 21:37:16] [INFO ] Invariant cache hit.
[2024-06-01 21:37:16] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
[2024-06-01 21:37:16] [INFO ] Redundant transitions in 2 ms returned []
Running 132 sub problems to find dead transitions.
[2024-06-01 21:37:16] [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 3060 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 4053 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 7270ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 7273ms
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 7601 ms. Remains : 85/153 places, 152/236 transitions.
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N04-LTLFireability-05
Product exploration explored 100000 steps with 8497 reset in 465 ms.
Product exploration explored 100000 steps with 8596 reset in 477 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 p1), (X (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 5 factoid took 278 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 70 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 71 steps (0 resets) in 5 ms. (11 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 p1), (X (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (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 612 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 72 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2024-06-01 21:37:26] [INFO ] Invariant cache hit.
[2024-06-01 21:37:26] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2024-06-01 21:37:27] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2024-06-01 21:37:27] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 21:37:27] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2024-06-01 21:37:27] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2024-06-01 21:37:27] [INFO ] Computed and/alt/rep : 132/224/132 causal constraints (skipped 0 transitions) in 13 ms.
[2024-06-01 21:37:27] [INFO ] Added : 4 causal constraints over 1 iterations in 40 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 4 ms. Remains 85 /85 variables (removed 0) and now considering 152/152 (removed 0) transitions.
[2024-06-01 21:37:27] [INFO ] Invariant cache hit.
[2024-06-01 21:37:27] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-06-01 21:37:27] [INFO ] Invariant cache hit.
[2024-06-01 21:37:27] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
[2024-06-01 21:37:27] [INFO ] Redundant transitions in 1 ms returned []
Running 132 sub problems to find dead transitions.
[2024-06-01 21:37:27] [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 3142 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 4121 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 7378ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 7380ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7581 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 364 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 72 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 98 steps (0 resets) in 5 ms. (16 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 542 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 72 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2024-06-01 21:37:36] [INFO ] Invariant cache hit.
[2024-06-01 21:37:36] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2024-06-01 21:37:36] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2024-06-01 21:37:36] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 21:37:37] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2024-06-01 21:37:37] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2024-06-01 21:37:37] [INFO ] Computed and/alt/rep : 132/224/132 causal constraints (skipped 0 transitions) in 12 ms.
[2024-06-01 21:37:37] [INFO ] Added : 4 causal constraints over 1 iterations in 48 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 8536 reset in 568 ms.
Product exploration explored 100000 steps with 8609 reset in 556 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 6 ms. Remains 85 /85 variables (removed 0) and now considering 152/152 (removed 0) transitions.
[2024-06-01 21:37:38] [INFO ] Invariant cache hit.
[2024-06-01 21:37:38] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-06-01 21:37:38] [INFO ] Invariant cache hit.
[2024-06-01 21:37:38] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
[2024-06-01 21:37:38] [INFO ] Redundant transitions in 1 ms returned []
Running 132 sub problems to find dead transitions.
[2024-06-01 21:37:38] [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 3172 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 4098 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 7376ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 7378ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7532 ms. Remains : 85/85 places, 152/152 transitions.
Treatment of property UtilityControlRoom-PT-Z4T4N04-LTLFireability-05 finished in 29733 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 U p1)&&G(p2)))) U p3))'
Support contains 29 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
Applied a total of 176 rules in 10 ms. Remains 73 /153 variables (removed 80) and now considering 140/236 (removed 96) transitions.
// Phase 1: matrix 140 rows 73 cols
[2024-06-01 21:37:46] [INFO ] Computed 10 invariants in 1 ms
[2024-06-01 21:37:46] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-06-01 21:37:46] [INFO ] Invariant cache hit.
[2024-06-01 21:37:46] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
[2024-06-01 21:37:46] [INFO ] Redundant transitions in 1 ms returned []
Running 136 sub problems to find dead transitions.
[2024-06-01 21:37:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 4/73 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (OVERLAPS) 140/213 variables, 73/83 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 0/213 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 213/213 variables, and 83 constraints, problems are : Problem set: 0 solved, 136 unsolved in 2949 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 4/73 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (OVERLAPS) 140/213 variables, 73/83 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 136/219 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (OVERLAPS) 0/213 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 213/213 variables, and 219 constraints, problems are : Problem set: 0 solved, 136 unsolved in 4297 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 0/0 constraints]
After SMT, in 7367ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 7369ms
Starting structural reductions in SI_LTL mode, iteration 1 : 73/153 places, 140/236 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7534 ms. Remains : 73/153 places, 140/236 transitions.
Stuttering acceptance computed with spot in 238 ms :[(NOT p3), (OR (NOT p3) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N04-LTLFireability-06
Product exploration explored 100000 steps with 2477 reset in 495 ms.
Stack based approach found an accepted trace after 252 steps with 8 reset with depth 76 and stack size 76 in 1 ms.
FORMULA UtilityControlRoom-PT-Z4T4N04-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N04-LTLFireability-06 finished in 8402 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 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 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 153 transition count 176
Reduce places removed 60 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 75 rules applied. Total rules applied 135 place count 93 transition count 161
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 135 place count 93 transition count 146
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 165 place count 78 transition count 146
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 168 place count 75 transition count 143
Iterating global reduction 2 with 3 rules applied. Total rules applied 171 place count 75 transition count 143
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 173 place count 73 transition count 111
Iterating global reduction 2 with 2 rules applied. Total rules applied 175 place count 73 transition count 111
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 183 place count 65 transition count 103
Iterating global reduction 2 with 8 rules applied. Total rules applied 191 place count 65 transition count 103
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 199 place count 57 transition count 87
Iterating global reduction 2 with 8 rules applied. Total rules applied 207 place count 57 transition count 87
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 215 place count 49 transition count 71
Iterating global reduction 2 with 8 rules applied. Total rules applied 223 place count 49 transition count 71
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 231 place count 49 transition count 63
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 263 place count 33 transition count 47
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 264 place count 33 transition count 46
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 265 place count 32 transition count 38
Ensure Unique test removed 1 places
Iterating global reduction 3 with 2 rules applied. Total rules applied 267 place count 31 transition count 38
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 271 place count 27 transition count 30
Iterating global reduction 3 with 4 rules applied. Total rules applied 275 place count 27 transition count 30
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 278 place count 24 transition count 27
Iterating global reduction 3 with 3 rules applied. Total rules applied 281 place count 24 transition count 27
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 284 place count 24 transition count 24
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 290 place count 21 transition count 21
Applied a total of 290 rules in 28 ms. Remains 21 /153 variables (removed 132) and now considering 21/236 (removed 215) transitions.
// Phase 1: matrix 21 rows 21 cols
[2024-06-01 21:37:54] [INFO ] Computed 9 invariants in 0 ms
[2024-06-01 21:37:54] [INFO ] Implicit Places using invariants in 60 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 63 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/153 places, 21/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 17
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 11 rules applied. Total rules applied 11 place count 13 transition count 17
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 14 place count 13 transition count 14
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 25 place count 7 transition count 9
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 27 place count 6 transition count 8
Applied a total of 27 rules in 3 ms. Remains 6 /20 variables (removed 14) and now considering 8/21 (removed 13) transitions.
// Phase 1: matrix 8 rows 6 cols
[2024-06-01 21:37:54] [INFO ] Computed 2 invariants in 0 ms
[2024-06-01 21:37:54] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-06-01 21:37:54] [INFO ] Invariant cache hit.
[2024-06-01 21:37:54] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 6/153 places, 8/236 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 194 ms. Remains : 6/153 places, 8/236 transitions.
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N04-LTLFireability-08
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z4T4N04-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N04-LTLFireability-08 finished in 317 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G((X(((G(p0) U X(p1))||p2)) U p1)))))'
Support contains 6 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 5 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 21:37:55] [INFO ] Computed 10 invariants in 1 ms
[2024-06-01 21:37:55] [INFO ] Implicit Places using invariants in 289 ms returned []
[2024-06-01 21:37:55] [INFO ] Invariant cache hit.
[2024-06-01 21:37:55] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 487 ms to find 0 implicit places.
Running 184 sub problems to find dead transitions.
[2024-06-01 21:37:55] [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 5070 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 8002 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 13252ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 13256ms
Starting structural reductions in LTL mode, iteration 1 : 105/153 places, 188/236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13749 ms. Remains : 105/153 places, 188/236 transitions.
Stuttering acceptance computed with spot in 652 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N04-LTLFireability-09
Product exploration explored 100000 steps with 444 reset in 248 ms.
Stack based approach found an accepted trace after 8053 steps with 37 reset with depth 1036 and stack size 1036 in 23 ms.
FORMULA UtilityControlRoom-PT-Z4T4N04-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N04-LTLFireability-09 finished in 14711 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))&&(p1||G(p2)))))'
Support contains 3 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 236/236 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 106 transition count 189
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 106 transition count 189
Applied a total of 94 rules in 4 ms. Remains 106 /153 variables (removed 47) and now considering 189/236 (removed 47) transitions.
// Phase 1: matrix 189 rows 106 cols
[2024-06-01 21:38:09] [INFO ] Computed 10 invariants in 1 ms
[2024-06-01 21:38:10] [INFO ] Implicit Places using invariants in 228 ms returned [77]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 237 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 105/153 places, 189/236 transitions.
Applied a total of 0 rules in 1 ms. Remains 105 /105 variables (removed 0) and now considering 189/189 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 243 ms. Remains : 105/153 places, 189/236 transitions.
Stuttering acceptance computed with spot in 271 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (NOT p2)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N04-LTLFireability-11
Entered a terminal (fully accepting) state of product in 38 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z4T4N04-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N04-LTLFireability-11 finished in 538 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (F(!p1)&&(!p1||G(p2)||X(F(!p3)))))))'
Support contains 7 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 236/236 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 106 transition count 189
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 106 transition count 189
Applied a total of 94 rules in 2 ms. Remains 106 /153 variables (removed 47) and now considering 189/236 (removed 47) transitions.
// Phase 1: matrix 189 rows 106 cols
[2024-06-01 21:38:10] [INFO ] Computed 10 invariants in 2 ms
[2024-06-01 21:38:10] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-06-01 21:38:10] [INFO ] Invariant cache hit.
[2024-06-01 21:38:10] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
Running 185 sub problems to find dead transitions.
[2024-06-01 21:38:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (OVERLAPS) 4/106 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (OVERLAPS) 189/295 variables, 106/116 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (OVERLAPS) 0/295 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Real declared 295/295 variables, and 116 constraints, problems are : Problem set: 0 solved, 185 unsolved in 5272 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 185 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (OVERLAPS) 4/106 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (OVERLAPS) 189/295 variables, 106/116 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 185/301 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/295 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (OVERLAPS) 0/295 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Int declared 295/295 variables, and 301 constraints, problems are : Problem set: 0 solved, 185 unsolved in 7039 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 0/0 constraints]
After SMT, in 12455ms problems are : Problem set: 0 solved, 185 unsolved
Search for dead transitions found 0 dead transitions in 12458ms
Starting structural reductions in LTL mode, iteration 1 : 106/153 places, 189/236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12725 ms. Remains : 106/153 places, 189/236 transitions.
Stuttering acceptance computed with spot in 337 ms :[(AND p3 (NOT p2)), p1, p3, p1, p1, p1, (OR p1 p3), (OR p1 (AND (NOT p2) p3))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N04-LTLFireability-12
Product exploration explored 100000 steps with 50000 reset in 127 ms.
Product exploration explored 100000 steps with 50000 reset in 126 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 p2 (NOT p3) (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X p2), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND p1 p0))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p1 p2 (NOT p0) p3)))), (X (X (NOT (AND p1 p2 p3)))), (X (X (NOT (AND p1 p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND p1 p0 p3)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0) p3)))), (X (X (NOT (AND p1 (NOT p2) p3))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p3)), (X (X (NOT p3))), (X (X (AND p1 (NOT p3)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (AND (NOT p1) p3))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (AND (NOT p1) p2 p3))), (X (X (NOT (AND (NOT p1) p2 p3)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 14 factoid took 18 ms. Reduced automaton from 8 states, 20 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-PT-Z4T4N04-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-PT-Z4T4N04-LTLFireability-12 finished in 13369 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(p1))))'
Support contains 5 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 21:38:23] [INFO ] Computed 10 invariants in 1 ms
[2024-06-01 21:38:23] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-06-01 21:38:23] [INFO ] Invariant cache hit.
[2024-06-01 21:38:23] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
Running 184 sub problems to find dead transitions.
[2024-06-01 21:38:23] [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 5067 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 7642 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 12875ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 12877ms
Starting structural reductions in LTL mode, iteration 1 : 105/153 places, 188/236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13137 ms. Remains : 105/153 places, 188/236 transitions.
Stuttering acceptance computed with spot in 81 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N04-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z4T4N04-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N04-LTLFireability-13 finished in 13232 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 1 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 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 153 transition count 173
Reduce places removed 63 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 142 place count 90 transition count 157
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 142 place count 90 transition count 141
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 174 place count 74 transition count 141
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 176 place count 72 transition count 109
Iterating global reduction 2 with 2 rules applied. Total rules applied 178 place count 72 transition count 109
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 186 place count 64 transition count 101
Iterating global reduction 2 with 8 rules applied. Total rules applied 194 place count 64 transition count 101
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 202 place count 56 transition count 85
Iterating global reduction 2 with 8 rules applied. Total rules applied 210 place count 56 transition count 85
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 217 place count 49 transition count 71
Iterating global reduction 2 with 7 rules applied. Total rules applied 224 place count 49 transition count 71
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 231 place count 49 transition count 64
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 263 place count 33 transition count 48
Applied a total of 263 rules in 16 ms. Remains 33 /153 variables (removed 120) and now considering 48/236 (removed 188) transitions.
// Phase 1: matrix 48 rows 33 cols
[2024-06-01 21:38:36] [INFO ] Computed 10 invariants in 0 ms
[2024-06-01 21:38:36] [INFO ] Implicit Places using invariants in 64 ms returned [24]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 65 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 32/153 places, 48/236 transitions.
Applied a total of 0 rules in 2 ms. Remains 32 /32 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 84 ms. Remains : 32/153 places, 48/236 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N04-LTLFireability-14
Product exploration explored 100000 steps with 1043 reset in 212 ms.
Stack based approach found an accepted trace after 182 steps with 1 reset with depth 93 and stack size 93 in 1 ms.
FORMULA UtilityControlRoom-PT-Z4T4N04-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N04-LTLFireability-14 finished in 341 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&X((p0&&F(p1)))))))'
Support contains 2 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 2 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 21:38:37] [INFO ] Computed 10 invariants in 1 ms
[2024-06-01 21:38:37] [INFO ] Implicit Places using invariants in 161 ms returned [76]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 163 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 167 ms. Remains : 104/153 places, 188/236 transitions.
Stuttering acceptance computed with spot in 141 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N04-LTLFireability-15
Product exploration explored 100000 steps with 583 reset in 152 ms.
Stack based approach found an accepted trace after 2461 steps with 12 reset with depth 470 and stack size 470 in 6 ms.
FORMULA UtilityControlRoom-PT-Z4T4N04-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N04-LTLFireability-15 finished in 483 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-PT-Z4T4N04-LTLFireability-00
Stuttering acceptance computed with spot in 79 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 8 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 21:38:37] [INFO ] Computed 10 invariants in 2 ms
[2024-06-01 21:38:38] [INFO ] Implicit Places using invariants in 163 ms returned [104]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 165 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 3 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 176 ms. Remains : 132/153 places, 216/236 transitions.
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N04-LTLFireability-00
Product exploration explored 100000 steps with 20550 reset in 381 ms.
Product exploration explored 100000 steps with 20491 reset in 386 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 117 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 83 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 25 steps (0 resets) in 4 ms. (5 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 140 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 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 216 rows 132 cols
[2024-06-01 21:38:39] [INFO ] Computed 9 invariants in 1 ms
[2024-06-01 21:38:39] [INFO ] [Real]Absence check using 9 positive place invariants in 6 ms returned sat
[2024-06-01 21:38:39] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2024-06-01 21:38:39] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 21:38:39] [INFO ] [Nat]Absence check using 9 positive place invariants in 6 ms returned sat
[2024-06-01 21:38:40] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2024-06-01 21:38:40] [INFO ] Computed and/alt/rep : 200/448/200 causal constraints (skipped 0 transitions) in 17 ms.
[2024-06-01 21:38:40] [INFO ] Added : 141 causal constraints over 29 iterations in 520 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 3 ms. Remains 132 /132 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-06-01 21:38:40] [INFO ] Invariant cache hit.
[2024-06-01 21:38:40] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-06-01 21:38:40] [INFO ] Invariant cache hit.
[2024-06-01 21:38:40] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
[2024-06-01 21:38:40] [INFO ] Redundant transitions in 1 ms returned []
Running 200 sub problems to find dead transitions.
[2024-06-01 21:38:40] [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 6121 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 7940 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 14117ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 14121ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 14370 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 117 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 68 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 20 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 142 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 110 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
[2024-06-01 21:38:55] [INFO ] Invariant cache hit.
[2024-06-01 21:38:55] [INFO ] [Real]Absence check using 9 positive place invariants in 7 ms returned sat
[2024-06-01 21:38:55] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2024-06-01 21:38:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 21:38:56] [INFO ] [Nat]Absence check using 9 positive place invariants in 6 ms returned sat
[2024-06-01 21:38:56] [INFO ] [Nat]Absence check using state equation in 104 ms returned sat
[2024-06-01 21:38:56] [INFO ] Computed and/alt/rep : 200/448/200 causal constraints (skipped 0 transitions) in 17 ms.
[2024-06-01 21:38:56] [INFO ] Added : 111 causal constraints over 23 iterations in 410 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 20428 reset in 454 ms.
Product exploration explored 100000 steps with 20484 reset in 480 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 21:38:57] [INFO ] Invariant cache hit.
[2024-06-01 21:38:57] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-06-01 21:38:57] [INFO ] Invariant cache hit.
[2024-06-01 21:38:57] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
[2024-06-01 21:38:57] [INFO ] Redundant transitions in 1 ms returned []
Running 200 sub problems to find dead transitions.
[2024-06-01 21:38:57] [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 6270 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 7971 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 14307ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 14310ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 14572 ms. Remains : 132/132 places, 216/216 transitions.
Treatment of property UtilityControlRoom-PT-Z4T4N04-LTLFireability-00 finished in 34467 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-PT-Z4T4N04-LTLFireability-03
Stuttering acceptance computed with spot in 253 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 7 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 21:39:12] [INFO ] Computed 10 invariants in 1 ms
[2024-06-01 21:39:12] [INFO ] Implicit Places using invariants in 104 ms returned [0, 53]
[2024-06-01 21:39:12] [INFO ] Actually due to overlaps returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 114 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 123 ms. Remains : 69/153 places, 92/236 transitions.
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N04-LTLFireability-03
Product exploration explored 100000 steps with 3039 reset in 199 ms.
Product exploration explored 100000 steps with 3076 reset in 214 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 77 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 137 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 311 steps (0 resets) in 6 ms. (44 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 122 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 142 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 138 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 5 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 21:39:13] [INFO ] Computed 9 invariants in 15 ms
[2024-06-01 21:39:13] [INFO ] Implicit Places using invariants in 82 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 87 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 93 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 80 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 138 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 177 steps (0 resets) in 7 ms. (22 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 124 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 140 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 3006 reset in 204 ms.
Product exploration explored 100000 steps with 2978 reset in 211 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 143 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 5 ms. Remains 68 /68 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2024-06-01 21:39:15] [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 21:39:15] [INFO ] Computed 8 invariants in 2 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 21:39:15] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
[2024-06-01 21:39:15] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
[2024-06-01 21:39:15] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
[2024-06-01 21:39:15] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
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 1521 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 1105 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 2641ms problems are : Problem set: 16 solved, 60 unsolved
Search for dead transitions found 16 dead transitions in 2643ms
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.8 ms
Discarding 16 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 10 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 2664 ms. Remains : 52/68 places, 76/92 transitions.
Support contains 24 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 92/92 transitions.
Applied a total of 0 rules in 1 ms. Remains 68 /68 variables (removed 0) and now considering 92/92 (removed 0) transitions.
// Phase 1: matrix 92 rows 68 cols
[2024-06-01 21:39:18] [INFO ] Computed 8 invariants in 1 ms
[2024-06-01 21:39:18] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-06-01 21:39:18] [INFO ] Invariant cache hit.
[2024-06-01 21:39:18] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
Running 76 sub problems to find dead transitions.
[2024-06-01 21:39:18] [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 1300 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 1343 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 2668ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 2669ms
Finished structural reductions in LTL mode , in 1 iterations and 2803 ms. Remains : 68/68 places, 92/92 transitions.
Treatment of property UtilityControlRoom-PT-Z4T4N04-LTLFireability-03 finished in 8645 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-PT-Z4T4N04-LTLFireability-04
Stuttering acceptance computed with spot in 412 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 21:39:21] [INFO ] Computed 10 invariants in 1 ms
[2024-06-01 21:39:21] [INFO ] Implicit Places using invariants in 107 ms returned [0, 57]
[2024-06-01 21:39:21] [INFO ] Actually due to overlaps returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 117 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 12 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 139 ms. Remains : 69/153 places, 92/236 transitions.
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N04-LTLFireability-04
Product exploration explored 100000 steps with 22761 reset in 156 ms.
Product exploration explored 100000 steps with 22832 reset in 168 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) p1))), (X p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p2)), (X (X (AND p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 184 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 438 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 589 ms. (67 steps per ms) remains 6/21 properties
BEST_FIRST walk for 40004 steps (8 resets) in 194 ms. (205 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 240 ms. (165 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 195 ms. (204 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 200 ms. (199 steps per ms) remains 6/6 properties
// Phase 1: matrix 92 rows 69 cols
[2024-06-01 21:39:23] [INFO ] Computed 9 invariants in 0 ms
Problem apf4 is UNSAT
Problem apf11 is UNSAT
Problem apf16 is UNSAT
Problem apf17 is UNSAT
Problem apf18 is UNSAT
Problem apf19 is UNSAT
After SMT solving in domain Real declared 28/161 variables, and 0 constraints, problems are : Problem set: 6 solved, 0 unsolved in 22 ms.
Refiners :[Positive P Invariants (semi-flows): 0/9 constraints, State Equation: 0/69 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 37ms problems are : Problem set: 6 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 6 invariant AP formulas.
Knowledge obtained : [(AND p1 p2 p0 p3), (X (NOT (AND (NOT p0) p1))), (X p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p2)), (X (X (AND p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p0)), (X (X p1)), (G (OR p0 p1 (NOT p2))), (G (OR p0 (NOT p1) (NOT p2))), (G (OR (NOT p0) p2)), (G (OR p0 p1 (NOT p2) (NOT p3))), (G (OR (NOT p0) p2 (NOT p3))), (G (OR p0 (NOT p1) (NOT p2) (NOT p3)))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p1) p2))), (F (NOT (AND p0 p2 p3))), (F (NOT (OR p1 (NOT p2)))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1) p2 (NOT p3)))), (F (NOT p3)), (F (NOT (AND p2 p3))), (F (NOT (AND p1 p2 p3))), (F (NOT (OR p0 p1 p2 (NOT p3)))), (F (NOT (OR p1 p2))), (F (NOT (OR p2 (NOT p3)))), (F (NOT (AND p0 p2))), (F (NOT (OR (NOT p1) p2 (NOT p3)))), (F (NOT (OR p1 (NOT p2) (NOT p3)))), (F (NOT (OR p1 p2 (NOT p3)))), (F (NOT (OR p0 p1 p2))), (F (NOT (AND p1 p2))), (F (NOT p2)), (F (NOT (OR p0 (NOT p1) p2)))]
Knowledge based reduction with 24 factoid took 758 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 295 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 444 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 21:39:24] [INFO ] Invariant cache hit.
[2024-06-01 21:39:24] [INFO ] Implicit Places using invariants in 54 ms returned [56]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 64 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 68/69 places, 92/92 transitions.
Applied a total of 0 rules in 0 ms. Remains 68 /68 variables (removed 0) and now considering 92/92 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 68 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 81 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 302 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 287 steps (0 resets) in 6 ms. (41 steps per ms) remains 0/13 properties
Knowledge obtained : [(AND p2 p3 p1)]
False Knowledge obtained : [(F (NOT (OR p2 (NOT p3)))), (F (NOT (OR p1 (NOT p2)))), (F (NOT (OR (NOT p1) p2 (NOT p3)))), (F (NOT (AND p2 p3))), (F (NOT (AND p1 p2 p3))), (F (NOT (OR (NOT p1) p2))), (F (NOT p1)), (F (NOT (OR p1 p2 (NOT p3)))), (F (NOT p3)), (F (NOT (AND p1 p2))), (F (NOT p2)), (F (NOT (OR p1 p2))), (F (NOT (OR p1 (NOT p2) (NOT p3))))]
Knowledge based reduction with 1 factoid took 373 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 292 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 297 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 303 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 22800 reset in 163 ms.
Product exploration explored 100000 steps with 22804 reset in 177 ms.
Support contains 28 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 92/92 transitions.
Applied a total of 0 rules in 1 ms. Remains 68 /68 variables (removed 0) and now considering 92/92 (removed 0) transitions.
// Phase 1: matrix 92 rows 68 cols
[2024-06-01 21:39:26] [INFO ] Computed 8 invariants in 1 ms
[2024-06-01 21:39:27] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-06-01 21:39:27] [INFO ] Invariant cache hit.
[2024-06-01 21:39:27] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
Running 88 sub problems to find dead transitions.
[2024-06-01 21:39:27] [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 1485 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 1379 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 2886ms problems are : Problem set: 0 solved, 88 unsolved
Search for dead transitions found 0 dead transitions in 2887ms
Finished structural reductions in LTL mode , in 1 iterations and 3010 ms. Remains : 68/68 places, 92/92 transitions.
Treatment of property UtilityControlRoom-PT-Z4T4N04-LTLFireability-04 finished in 9144 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 21:39:30] [INFO ] Flatten gal took : 23 ms
[2024-06-01 21:39:30] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 19 ms.
[2024-06-01 21:39:30] [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 236105 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : UtilityControlRoom-PT-Z4T4N04-LTLFireability-00
FORMULA UtilityControlRoom-PT-Z4T4N04-LTLFireability-03 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA UtilityControlRoom-PT-Z4T4N04-LTLFireability-04 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : UtilityControlRoom-PT-Z4T4N04-LTLFireability-05

BK_STOP 1717277971168

--------------------
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-PT-Z4T4N04-LTLFireability-00
ltl formula formula --ltl=/tmp/2635/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.050 real 0.000 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2635/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2635/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2635/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2635/ltl_0_
pnml2lts-mc( 0/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 1/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 3/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 2/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

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

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

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
*** 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) [0x55a709fc34f4]
1: pnml2lts-mc(+0xa6596) [0x55a709fc3596]
2: /lib/x86_64-linux-gnu/libc.so.6(+0x3c050) [0x7f4040e2f050]
3: pnml2lts-mc(+0x430585) [0x55a70a34d585]
4: pnml2lts-mc(+0x1708c9) [0x55a70a08d8c9]
5: pnml2lts-mc(+0x169cd4) [0x55a70a086cd4]
6: pnml2lts-mc(+0x27153f) [0x55a70a18e53f]
7: pnml2lts-mc(+0xba280) [0x55a709fd7280]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3e55d) [0x7f4040e3155d]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3e69a) [0x7f4040e3169a]
10: pnml2lts-mc(+0xa5681) [0x55a709fc2681]
11: pnml2lts-mc(+0xa5a10) [0x55a709fc2a10]
12: pnml2lts-mc(+0xa73a2) [0x55a709fc43a2]
13: pnml2lts-mc(+0x92139) [0x55a709faf139]
14: pnml2lts-mc(+0x9311d) [0x55a709fb011d]
15: pnml2lts-mc(+0x83fdb) [0x55a709fa0fdb]
16: pnml2lts-mc(+0x64a5d) [0x55a709f81a5d]
17: pnml2lts-mc(+0x64af0) [0x55a709f81af0]
18: pnml2lts-mc(+0x62aca) [0x55a709f7faca]
19: /lib/x86_64-linux-gnu/libc.so.6(+0x2724a) [0x7f4040e1a24a]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0x85) [0x7f4040e1a305]
21: pnml2lts-mc(+0x6485e) [0x55a709f8185e]
0: pnml2lts-mc(+0xa64f4) [0x55a709fc34f4]
1: pnml2lts-mc(+0xa6596) [0x55a709fc3596]
2: /lib/x86_64-linux-gnu/libc.so.6(+0x3c050) [0x7f4040e2f050]
3: pnml2lts-mc(+0x430585) [0x55a70a34d585]
4: pnml2lts-mc(+0x1708c9) [0x55a70a08d8c9]
5: pnml2lts-mc(+0x169cd4) [0x55a70a086cd4]
6: pnml2lts-mc(+0x27153f) [0x55a70a18e53f]
7: pnml2lts-mc(+0xba280) [0x55a709fd7280]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3e55d) [0x7f4040e3155d]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3e69a) [0x7f4040e3169a]
10: pnml2lts-mc(+0xa5681) [0x55a709fc2681]
11: pnml2lts-mc(+0xa5a10) [0x55a709fc2a10]
12: pnml2lts-mc(+0xa73a2) [0x55a709fc43a2]
13: pnml2lts-mc(+0x92139) [0x55a709faf139]
14: pnml2lts-mc(+0x9311d) [0x55a709fb011d]
15: pnml2lts-mc(+0x83fdb) [0x55a709fa0fdb]
16: pnml2lts-mc(+0x64a5d) [0x55a709f81a5d]
17: pnml2lts-mc(+0x64af0) [0x55a709f81af0]
18: pnml2lts-mc(+0x62aca) [0x55a709f7faca]
19: /lib/x86_64-linux-gnu/libc.so.6(+0x2724a) [0x7f4040e1a24a]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0x85) [0x7f4040e1a305]
21: pnml2lts-mc(+0x6485e) [0x55a709f8185e]
0: pnml2lts-mc(+0xa64f4) [0x55a709fc34f4]
1: pnml2lts-mc(+0xa6596) [0x55a709fc3596]
2: /lib/x86_64-linux-gnu/libc.so.6(+0x3c050) [0x7f4040e2f050]
3: pnml2lts-mc(+0x430585) [0x55a70a34d585]
4: pnml2lts-mc(+0x1708c9) [0x55a70a08d8c9]
5: pnml2lts-mc(+0x169cd4) [0x55a70a086cd4]
6: pnml2lts-mc(+0x27153f) [0x55a70a18e53f]
7: pnml2lts-mc(+0xba280) [0x55a709fd7280]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3e55d) [0x7f4040e3155d]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3e69a) [0x7f4040e3169a]
10: pnml2lts-mc(+0xa5681) [0x55a709fc2681]
11: pnml2lts-mc(+0xa5a10) [0x55a709fc2a10]
12: pnml2lts-mc(+0xa73a2) [0x55a709fc43a2]
13: pnml2lts-mc(+0x92139) [0x55a709faf139]
14: pnml2lts-mc(+0x9311d) [0x55a709fb011d]
15: pnml2lts-mc(+0x83fdb) [0x55a709fa0fdb]
16: pnml2lts-mc(+0x64a5d) [0x55a709f81a5d]
17: pnml2lts-mc(+0x64af0) [0x55a709f81af0]
18: pnml2lts-mc(+0x62aca) [0x55a709f7faca]
19: /lib/x86_64-linux-gnu/libc.so.6(+0x2724a) [0x7f4040e1a24a]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0x85) [0x7f4040e1a305]
21: pnml2lts-mc(+0x6485e) [0x55a709f8185e]
ltl formula name UtilityControlRoom-PT-Z4T4N04-LTLFireability-03
ltl formula formula --ltl=/tmp/2635/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
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
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2635/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2635/ltl_1_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.010 user 0.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2635/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2635/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( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~63!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 32
pnml2lts-mc( 0/ 4): unique states count: 196
pnml2lts-mc( 0/ 4): unique transitions count: 1021
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 2
pnml2lts-mc( 0/ 4): - claim found count: 19
pnml2lts-mc( 0/ 4): - claim success count: 200
pnml2lts-mc( 0/ 4): - cum. max stack depth: 168
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 200 states 1045 transitions, fanout: 5.225
pnml2lts-mc( 0/ 4): Total exploration time 0.020 sec (0.010 sec minimum, 0.012 sec on average)
pnml2lts-mc( 0/ 4): States per second: 10000, Transitions per second: 52250
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 32.4 B/state, compr.: 5.2%
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-PT-Z4T4N04-LTLFireability-04
ltl formula formula --ltl=/tmp/2635/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 153 places, 236 transitions and 688 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.000 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2635/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2635/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2635/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2635/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: 6048
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 2289
pnml2lts-mc( 0/ 4): - cum. max stack depth: 43
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2289 states 8925 transitions, fanout: 3.899
pnml2lts-mc( 0/ 4): Total exploration time 0.040 sec (0.030 sec minimum, 0.032 sec on average)
pnml2lts-mc( 0/ 4): States per second: 57225, Transitions per second: 223125
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-PT-Z4T4N04-LTLFireability-05
ltl formula formula --ltl=/tmp/2635/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
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.080 real 0.010 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2635/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2635/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2635/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2635/ltl_3_
pnml2lts-mc( 1/ 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:
malloc_consolidate(): unaligned fastbin chunk detected
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:
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-PT-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-PT-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-171701111100252"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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