Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 13K Apr 13 05:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 13 05:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 24K Apr 13 05:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 113K Apr 13 05:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Apr 23 08:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 37K Apr 23 08:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Apr 23 08:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 33K Apr 23 08:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 43K Apr 13 05:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 242K Apr 13 05:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 96K Apr 13 05:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 422K Apr 13 05:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.0K Apr 23 08:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.2K Apr 23 08:03 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 70K 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-Z2T3N06-LTLFireability-00
FORMULA_NAME UtilityControlRoom-PT-Z2T3N06-LTLFireability-01
FORMULA_NAME UtilityControlRoom-PT-Z2T3N06-LTLFireability-02
FORMULA_NAME UtilityControlRoom-PT-Z2T3N06-LTLFireability-03
FORMULA_NAME UtilityControlRoom-PT-Z2T3N06-LTLFireability-04
FORMULA_NAME UtilityControlRoom-PT-Z2T3N06-LTLFireability-05
FORMULA_NAME UtilityControlRoom-PT-Z2T3N06-LTLFireability-06
FORMULA_NAME UtilityControlRoom-PT-Z2T3N06-LTLFireability-07
FORMULA_NAME UtilityControlRoom-PT-Z2T3N06-LTLFireability-08
FORMULA_NAME UtilityControlRoom-PT-Z2T3N06-LTLFireability-09
FORMULA_NAME UtilityControlRoom-PT-Z2T3N06-LTLFireability-10
FORMULA_NAME UtilityControlRoom-PT-Z2T3N06-LTLFireability-11
FORMULA_NAME UtilityControlRoom-PT-Z2T3N06-LTLFireability-12
FORMULA_NAME UtilityControlRoom-PT-Z2T3N06-LTLFireability-13
FORMULA_NAME UtilityControlRoom-PT-Z2T3N06-LTLFireability-14
FORMULA_NAME UtilityControlRoom-PT-Z2T3N06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717104011831

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=UtilityControlRoom-PT-Z2T3N06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-30 21:20:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-30 21:20:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 21:20:14] [INFO ] Load time of PNML (sax parser for PT used): 100 ms
[2024-05-30 21:20:14] [INFO ] Transformed 106 places.
[2024-05-30 21:20:14] [INFO ] Transformed 162 transitions.
[2024-05-30 21:20:14] [INFO ] Parsed PT model containing 106 places and 162 transitions and 510 arcs in 315 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
[2024-05-30 21:20:14] [INFO ] Reduced 6 identical enabling conditions.
[2024-05-30 21:20:14] [INFO ] Reduced 6 identical enabling conditions.
[2024-05-30 21:20:14] [INFO ] Reduced 6 identical enabling conditions.
[2024-05-30 21:20:14] [INFO ] Reduced 6 identical enabling conditions.
[2024-05-30 21:20:14] [INFO ] Reduced 6 identical enabling conditions.
[2024-05-30 21:20:14] [INFO ] Reduced 6 identical enabling conditions.
[2024-05-30 21:20:14] [INFO ] Reduced 6 identical enabling conditions.
Ensure Unique test removed 24 transitions
Reduce redundant transitions removed 24 transitions.
FORMULA UtilityControlRoom-PT-Z2T3N06-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z2T3N06-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z2T3N06-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z2T3N06-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 84 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 138/138 transitions.
Applied a total of 0 rules in 17 ms. Remains 106 /106 variables (removed 0) and now considering 138/138 (removed 0) transitions.
// Phase 1: matrix 138 rows 106 cols
[2024-05-30 21:20:14] [INFO ] Computed 15 invariants in 23 ms
[2024-05-30 21:20:15] [INFO ] Implicit Places using invariants in 347 ms returned [75]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 419 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 105/106 places, 138/138 transitions.
Applied a total of 0 rules in 5 ms. Remains 105 /105 variables (removed 0) and now considering 138/138 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 472 ms. Remains : 105/106 places, 138/138 transitions.
Support contains 84 out of 105 places after structural reductions.
[2024-05-30 21:20:15] [INFO ] Flatten gal took : 85 ms
[2024-05-30 21:20:15] [INFO ] Flatten gal took : 31 ms
[2024-05-30 21:20:15] [INFO ] Input system was already deterministic with 138 transitions.
Reduction of identical properties reduced properties to check from 17 to 16
RANDOM walk for 898 steps (0 resets) in 178 ms. (5 steps per ms) remains 0/16 properties
FORMULA UtilityControlRoom-PT-Z2T3N06-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(G(p1))&&p0)))'
Support contains 18 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 138/138 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 93 transition count 126
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 93 transition count 126
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 36 place count 87 transition count 120
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 0 with 12 rules applied. Total rules applied 48 place count 87 transition count 108
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 86 transition count 96
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 86 transition count 96
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 56 place count 80 transition count 90
Iterating global reduction 0 with 6 rules applied. Total rules applied 62 place count 80 transition count 90
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 68 place count 74 transition count 78
Iterating global reduction 0 with 6 rules applied. Total rules applied 74 place count 74 transition count 78
Applied a total of 74 rules in 107 ms. Remains 74 /105 variables (removed 31) and now considering 78/138 (removed 60) transitions.
// Phase 1: matrix 78 rows 74 cols
[2024-05-30 21:20:16] [INFO ] Computed 14 invariants in 10 ms
[2024-05-30 21:20:16] [INFO ] Implicit Places using invariants in 211 ms returned []
[2024-05-30 21:20:16] [INFO ] Invariant cache hit.
[2024-05-30 21:20:17] [INFO ] Implicit Places using invariants and state equation in 595 ms returned []
Implicit Place search using SMT with State Equation took 812 ms to find 0 implicit places.
[2024-05-30 21:20:17] [INFO ] Redundant transitions in 4 ms returned []
Running 66 sub problems to find dead transitions.
[2024-05-30 21:20:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (OVERLAPS) 6/74 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 78/152 variables, 74/88 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (OVERLAPS) 0/152 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 152/152 variables, and 88 constraints, problems are : Problem set: 0 solved, 66 unsolved in 1825 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 74/74 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (OVERLAPS) 6/74 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 78/152 variables, 74/88 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 66/154 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (OVERLAPS) 0/152 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 152/152 variables, and 154 constraints, problems are : Problem set: 0 solved, 66 unsolved in 1601 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 74/74 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints]
After SMT, in 3548ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 3570ms
Starting structural reductions in SI_LTL mode, iteration 1 : 74/105 places, 78/138 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4520 ms. Remains : 74/105 places, 78/138 transitions.
Stuttering acceptance computed with spot in 320 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N06-LTLFireability-00
Product exploration explored 100000 steps with 0 reset in 659 ms.
Stack based approach found an accepted trace after 660 steps with 0 reset with depth 661 and stack size 661 in 3 ms.
FORMULA UtilityControlRoom-PT-Z2T3N06-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N06-LTLFireability-00 finished in 5636 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 6 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 138/138 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 93 transition count 126
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 93 transition count 126
Applied a total of 24 rules in 7 ms. Remains 93 /105 variables (removed 12) and now considering 126/138 (removed 12) transitions.
// Phase 1: matrix 126 rows 93 cols
[2024-05-30 21:20:21] [INFO ] Computed 14 invariants in 2 ms
[2024-05-30 21:20:21] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-30 21:20:21] [INFO ] Invariant cache hit.
[2024-05-30 21:20:22] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
Running 120 sub problems to find dead transitions.
[2024-05-30 21:20:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 6/93 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 126/219 variables, 93/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 0/219 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 107 constraints, problems are : Problem set: 0 solved, 120 unsolved in 3189 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 6/93 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 126/219 variables, 93/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 120/227 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 0/219 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 227 constraints, problems are : Problem set: 0 solved, 120 unsolved in 4309 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
After SMT, in 7592ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 7597ms
Starting structural reductions in LTL mode, iteration 1 : 93/105 places, 126/138 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7815 ms. Remains : 93/105 places, 126/138 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N06-LTLFireability-01
Product exploration explored 100000 steps with 50000 reset in 195 ms.
Product exploration explored 100000 steps with 50000 reset in 191 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 25 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-PT-Z2T3N06-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-PT-Z2T3N06-LTLFireability-01 finished in 8366 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(F(p1)&&(!p2 U (G(!p2)||(!p2&&G(!p1)))))))'
Support contains 36 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 138/138 transitions.
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 12 Pre rules applied. Total rules applied 0 place count 105 transition count 126
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 93 transition count 126
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 81 transition count 114
Applied a total of 48 rules in 25 ms. Remains 81 /105 variables (removed 24) and now considering 114/138 (removed 24) transitions.
// Phase 1: matrix 114 rows 81 cols
[2024-05-30 21:20:30] [INFO ] Computed 14 invariants in 5 ms
[2024-05-30 21:20:30] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-30 21:20:30] [INFO ] Invariant cache hit.
[2024-05-30 21:20:30] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
[2024-05-30 21:20:30] [INFO ] Redundant transitions in 3 ms returned []
Running 108 sub problems to find dead transitions.
[2024-05-30 21:20:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 6/81 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 114/195 variables, 81/95 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 0/195 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 95 constraints, problems are : Problem set: 0 solved, 108 unsolved in 2649 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 81/81 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 6/81 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 114/195 variables, 81/95 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 108/203 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 0/195 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 203 constraints, problems are : Problem set: 0 solved, 108 unsolved in 3404 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 81/81 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 6130ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 6134ms
Starting structural reductions in SI_LTL mode, iteration 1 : 81/105 places, 114/138 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6375 ms. Remains : 81/105 places, 114/138 transitions.
Stuttering acceptance computed with spot in 510 ms :[(OR (NOT p1) p2), p2, (AND (NOT p0) p2), (AND p2 p1), (AND p2 p1 (NOT p0)), p1, (AND p1 (NOT p0)), true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N06-LTLFireability-02
Entered a terminal (fully accepting) state of product in 18 steps with 0 reset in 1 ms.
FORMULA UtilityControlRoom-PT-Z2T3N06-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N06-LTLFireability-02 finished in 6915 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(p1)||G((X(p3)&&p2))||p0)))'
Support contains 30 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 138/138 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 93 transition count 126
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 93 transition count 126
Applied a total of 24 rules in 9 ms. Remains 93 /105 variables (removed 12) and now considering 126/138 (removed 12) transitions.
// Phase 1: matrix 126 rows 93 cols
[2024-05-30 21:20:37] [INFO ] Computed 14 invariants in 6 ms
[2024-05-30 21:20:37] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-30 21:20:37] [INFO ] Invariant cache hit.
[2024-05-30 21:20:37] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
Running 120 sub problems to find dead transitions.
[2024-05-30 21:20:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 6/93 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 126/219 variables, 93/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 0/219 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 107 constraints, problems are : Problem set: 0 solved, 120 unsolved in 3686 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 6/93 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 126/219 variables, 93/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 120/227 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 0/219 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 227 constraints, problems are : Problem set: 0 solved, 120 unsolved in 4437 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
After SMT, in 8230ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 8233ms
Starting structural reductions in LTL mode, iteration 1 : 93/105 places, 126/138 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8544 ms. Remains : 93/105 places, 126/138 transitions.
Stuttering acceptance computed with spot in 212 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N06-LTLFireability-03
Product exploration explored 100000 steps with 50000 reset in 247 ms.
Product exploration explored 100000 steps with 50000 reset in 304 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) p2 (NOT p3)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p0)), (X p1), (X (X (NOT p3))), (X (X (NOT (AND (NOT p1) p2 p3))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)))))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 20 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-PT-Z2T3N06-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-PT-Z2T3N06-LTLFireability-03 finished in 9353 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&&F(p1))))'
Support contains 12 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 138/138 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 93 transition count 126
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 93 transition count 126
Applied a total of 24 rules in 10 ms. Remains 93 /105 variables (removed 12) and now considering 126/138 (removed 12) transitions.
[2024-05-30 21:20:46] [INFO ] Invariant cache hit.
[2024-05-30 21:20:46] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-30 21:20:46] [INFO ] Invariant cache hit.
[2024-05-30 21:20:46] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
Running 120 sub problems to find dead transitions.
[2024-05-30 21:20:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 6/93 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 126/219 variables, 93/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 0/219 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 107 constraints, problems are : Problem set: 0 solved, 120 unsolved in 3184 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 6/93 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 126/219 variables, 93/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 120/227 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 0/219 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 227 constraints, problems are : Problem set: 0 solved, 120 unsolved in 5016 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
After SMT, in 8288ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 8295ms
Starting structural reductions in LTL mode, iteration 1 : 93/105 places, 126/138 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8583 ms. Remains : 93/105 places, 126/138 transitions.
Stuttering acceptance computed with spot in 130 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N06-LTLFireability-05
Product exploration explored 100000 steps with 50000 reset in 117 ms.
Product exploration explored 100000 steps with 50000 reset in 213 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 15 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-PT-Z2T3N06-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-PT-Z2T3N06-LTLFireability-05 finished in 9078 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(X(F(!p0))))))'
Support contains 6 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 138/138 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 105 transition count 114
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 60 place count 81 transition count 102
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 60 place count 81 transition count 90
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 84 place count 69 transition count 90
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 85 place count 68 transition count 78
Iterating global reduction 2 with 1 rules applied. Total rules applied 86 place count 68 transition count 78
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 92 place count 62 transition count 72
Iterating global reduction 2 with 6 rules applied. Total rules applied 98 place count 62 transition count 72
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 104 place count 56 transition count 60
Iterating global reduction 2 with 6 rules applied. Total rules applied 110 place count 56 transition count 60
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 116 place count 50 transition count 54
Iterating global reduction 2 with 6 rules applied. Total rules applied 122 place count 50 transition count 54
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 128 place count 50 transition count 48
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 128 place count 50 transition count 42
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 140 place count 44 transition count 42
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 25 rules applied. Total rules applied 165 place count 31 transition count 30
Applied a total of 165 rules in 43 ms. Remains 31 /105 variables (removed 74) and now considering 30/138 (removed 108) transitions.
// Phase 1: matrix 30 rows 31 cols
[2024-05-30 21:20:55] [INFO ] Computed 13 invariants in 1 ms
[2024-05-30 21:20:55] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-30 21:20:55] [INFO ] Invariant cache hit.
[2024-05-30 21:20:55] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
[2024-05-30 21:20:55] [INFO ] Redundant transitions in 0 ms returned []
Running 24 sub problems to find dead transitions.
[2024-05-30 21:20:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (OVERLAPS) 6/31 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 30/61 variables, 31/44 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (OVERLAPS) 0/61 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 61/61 variables, and 44 constraints, problems are : Problem set: 0 solved, 24 unsolved in 447 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (OVERLAPS) 6/31 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 30/61 variables, 31/44 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 24/68 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 0/61 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 61/61 variables, and 68 constraints, problems are : Problem set: 0 solved, 24 unsolved in 376 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
After SMT, in 832ms problems are : Problem set: 0 solved, 24 unsolved
Search for dead transitions found 0 dead transitions in 834ms
Starting structural reductions in SI_LTL mode, iteration 1 : 31/105 places, 30/138 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1041 ms. Remains : 31/105 places, 30/138 transitions.
Stuttering acceptance computed with spot in 133 ms :[p0, p0, p0]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N06-LTLFireability-06
Product exploration explored 100000 steps with 4812 reset in 187 ms.
Stack based approach found an accepted trace after 366 steps with 14 reset with depth 42 and stack size 42 in 1 ms.
FORMULA UtilityControlRoom-PT-Z2T3N06-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N06-LTLFireability-06 finished in 1378 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||G(F(p0)))))'
Support contains 6 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 138/138 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 93 transition count 126
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 93 transition count 126
Applied a total of 24 rules in 5 ms. Remains 93 /105 variables (removed 12) and now considering 126/138 (removed 12) transitions.
// Phase 1: matrix 126 rows 93 cols
[2024-05-30 21:20:56] [INFO ] Computed 14 invariants in 2 ms
[2024-05-30 21:20:57] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-30 21:20:57] [INFO ] Invariant cache hit.
[2024-05-30 21:20:57] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
Running 120 sub problems to find dead transitions.
[2024-05-30 21:20:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 6/93 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 126/219 variables, 93/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 0/219 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 107 constraints, problems are : Problem set: 0 solved, 120 unsolved in 3624 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 6/93 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 126/219 variables, 93/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 120/227 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 0/219 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 227 constraints, problems are : Problem set: 0 solved, 120 unsolved in 5337 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
After SMT, in 9006ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 9008ms
Starting structural reductions in LTL mode, iteration 1 : 93/105 places, 126/138 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9215 ms. Remains : 93/105 places, 126/138 transitions.
Stuttering acceptance computed with spot in 161 ms :[false, false, (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N06-LTLFireability-07
Product exploration explored 100000 steps with 5342 reset in 264 ms.
Product exploration explored 100000 steps with 5260 reset in 274 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 120 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) 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 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 136 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
[2024-05-30 21:21:07] [INFO ] Invariant cache hit.
[2024-05-30 21:21:07] [INFO ] [Real]Absence check using 14 positive place invariants in 12 ms returned sat
[2024-05-30 21:21:07] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2024-05-30 21:21:07] [INFO ] Computed and/alt/rep : 120/186/120 causal constraints (skipped 0 transitions) in 21 ms.
[2024-05-30 21:21:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 21:21:07] [INFO ] [Nat]Absence check using 14 positive place invariants in 12 ms returned sat
[2024-05-30 21:21:07] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2024-05-30 21:21:07] [INFO ] Computed and/alt/rep : 120/186/120 causal constraints (skipped 0 transitions) in 13 ms.
[2024-05-30 21:21:08] [INFO ] Added : 20 causal constraints over 5 iterations in 99 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 6 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 126/126 transitions.
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 12 Pre rules applied. Total rules applied 0 place count 93 transition count 114
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 81 transition count 114
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 0 with 60 rules applied. Total rules applied 84 place count 51 transition count 84
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 96 place count 51 transition count 72
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 97 place count 50 transition count 60
Ensure Unique test removed 1 places
Iterating global reduction 1 with 2 rules applied. Total rules applied 99 place count 49 transition count 60
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 105 place count 43 transition count 48
Iterating global reduction 1 with 6 rules applied. Total rules applied 111 place count 43 transition count 48
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 117 place count 37 transition count 42
Iterating global reduction 1 with 6 rules applied. Total rules applied 123 place count 37 transition count 42
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 129 place count 37 transition count 36
Applied a total of 129 rules in 27 ms. Remains 37 /93 variables (removed 56) and now considering 36/126 (removed 90) transitions.
// Phase 1: matrix 36 rows 37 cols
[2024-05-30 21:21:08] [INFO ] Computed 13 invariants in 0 ms
[2024-05-30 21:21:08] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-30 21:21:08] [INFO ] Invariant cache hit.
[2024-05-30 21:21:08] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
[2024-05-30 21:21:08] [INFO ] Redundant transitions in 0 ms returned []
Running 30 sub problems to find dead transitions.
[2024-05-30 21:21:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (OVERLAPS) 6/37 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 36/73 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 0/73 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 73/73 variables, and 50 constraints, problems are : Problem set: 0 solved, 30 unsolved in 505 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 37/37 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (OVERLAPS) 6/37 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 36/73 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 30/80 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (OVERLAPS) 0/73 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 73/73 variables, and 80 constraints, problems are : Problem set: 0 solved, 30 unsolved in 395 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 37/37 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
After SMT, in 909ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 910ms
Starting structural reductions in SI_LTL mode, iteration 1 : 37/93 places, 36/126 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1070 ms. Remains : 37/93 places, 36/126 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 p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 122 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 141 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 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
[2024-05-30 21:21:09] [INFO ] Invariant cache hit.
[2024-05-30 21:21:09] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2024-05-30 21:21:09] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-30 21:21:09] [INFO ] Computed and/alt/rep : 30/42/30 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-30 21:21:09] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 174 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5978 reset in 197 ms.
Product exploration explored 100000 steps with 5979 reset in 240 ms.
Built C files in :
/tmp/ltsmin6424034679691361916
[2024-05-30 21:21:10] [INFO ] Computing symmetric may disable matrix : 36 transitions.
[2024-05-30 21:21:10] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 21:21:10] [INFO ] Computing symmetric may enable matrix : 36 transitions.
[2024-05-30 21:21:10] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 21:21:10] [INFO ] Computing Do-Not-Accords matrix : 36 transitions.
[2024-05-30 21:21:10] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 21:21:10] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6424034679691361916
Running compilation step : cd /tmp/ltsmin6424034679691361916;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 593 ms.
Running link step : cd /tmp/ltsmin6424034679691361916;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin6424034679691361916;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11220427644343927540.hoa' '--buchi-type=spotba'
LTSmin run took 5050 ms.
FORMULA UtilityControlRoom-PT-Z2T3N06-LTLFireability-07 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-PT-Z2T3N06-LTLFireability-07 finished in 19179 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((p1||F(p2))&&p0))))'
Support contains 5 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 138/138 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 105 transition count 116
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 55 place count 83 transition count 105
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 55 place count 83 transition count 95
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 75 place count 73 transition count 95
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 76 place count 72 transition count 94
Iterating global reduction 2 with 1 rules applied. Total rules applied 77 place count 72 transition count 94
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 119 place count 51 transition count 73
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 120 place count 51 transition count 72
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 121 place count 50 transition count 60
Iterating global reduction 2 with 1 rules applied. Total rules applied 122 place count 50 transition count 60
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 128 place count 44 transition count 49
Iterating global reduction 2 with 6 rules applied. Total rules applied 134 place count 44 transition count 49
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 139 place count 39 transition count 44
Iterating global reduction 2 with 5 rules applied. Total rules applied 144 place count 39 transition count 44
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 149 place count 39 transition count 39
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 3 with 8 rules applied. Total rules applied 157 place count 35 transition count 35
Applied a total of 157 rules in 18 ms. Remains 35 /105 variables (removed 70) and now considering 35/138 (removed 103) transitions.
// Phase 1: matrix 35 rows 35 cols
[2024-05-30 21:21:16] [INFO ] Computed 14 invariants in 0 ms
[2024-05-30 21:21:16] [INFO ] Implicit Places using invariants in 48 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 49 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 34/105 places, 35/138 transitions.
Applied a total of 0 rules in 1 ms. Remains 34 /34 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 69 ms. Remains : 34/105 places, 35/138 transitions.
Stuttering acceptance computed with spot in 82 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N06-LTLFireability-08
Product exploration explored 100000 steps with 846 reset in 196 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 0 ms.
FORMULA UtilityControlRoom-PT-Z2T3N06-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N06-LTLFireability-08 finished in 365 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)))'
Support contains 4 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 138/138 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 105 transition count 116
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 55 place count 83 transition count 105
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 55 place count 83 transition count 94
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 77 place count 72 transition count 94
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 78 place count 71 transition count 93
Iterating global reduction 2 with 1 rules applied. Total rules applied 79 place count 71 transition count 93
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 101 place count 60 transition count 82
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 103 place count 59 transition count 81
Applied a total of 103 rules in 30 ms. Remains 59 /105 variables (removed 46) and now considering 81/138 (removed 57) transitions.
// Phase 1: matrix 81 rows 59 cols
[2024-05-30 21:21:16] [INFO ] Computed 14 invariants in 1 ms
[2024-05-30 21:21:16] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-30 21:21:16] [INFO ] Invariant cache hit.
[2024-05-30 21:21:16] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
[2024-05-30 21:21:16] [INFO ] Redundant transitions in 1 ms returned []
Running 68 sub problems to find dead transitions.
[2024-05-30 21:21:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (OVERLAPS) 6/59 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (OVERLAPS) 81/140 variables, 59/73 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 6 (OVERLAPS) 0/140 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 73 constraints, problems are : Problem set: 0 solved, 68 unsolved in 1461 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 59/59 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 68 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (OVERLAPS) 6/59 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (OVERLAPS) 81/140 variables, 59/73 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 68/141 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 7 (OVERLAPS) 0/140 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 141 constraints, problems are : Problem set: 0 solved, 68 unsolved in 2008 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 59/59 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 0/0 constraints]
After SMT, in 3510ms problems are : Problem set: 0 solved, 68 unsolved
Search for dead transitions found 0 dead transitions in 3512ms
Starting structural reductions in SI_LTL mode, iteration 1 : 59/105 places, 81/138 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3750 ms. Remains : 59/105 places, 81/138 transitions.
Stuttering acceptance computed with spot in 190 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N06-LTLFireability-09
Product exploration explored 100000 steps with 1990 reset in 157 ms.
Stack based approach found an accepted trace after 1290 steps with 17 reset with depth 167 and stack size 167 in 2 ms.
FORMULA UtilityControlRoom-PT-Z2T3N06-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N06-LTLFireability-09 finished in 4118 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 138/138 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 105 transition count 114
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 60 place count 81 transition count 102
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 60 place count 81 transition count 90
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 84 place count 69 transition count 90
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 106 place count 58 transition count 79
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 108 place count 57 transition count 78
Applied a total of 108 rules in 23 ms. Remains 57 /105 variables (removed 48) and now considering 78/138 (removed 60) transitions.
// Phase 1: matrix 78 rows 57 cols
[2024-05-30 21:21:20] [INFO ] Computed 14 invariants in 1 ms
[2024-05-30 21:21:20] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-30 21:21:20] [INFO ] Invariant cache hit.
[2024-05-30 21:21:20] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
[2024-05-30 21:21:20] [INFO ] Redundant transitions in 2 ms returned []
Running 65 sub problems to find dead transitions.
[2024-05-30 21:21:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 6/57 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 78/135 variables, 57/71 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (OVERLAPS) 0/135 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 135/135 variables, and 71 constraints, problems are : Problem set: 0 solved, 65 unsolved in 1857 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 57/57 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 6/57 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 78/135 variables, 57/71 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 65/136 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (OVERLAPS) 0/135 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 135/135 variables, and 136 constraints, problems are : Problem set: 0 solved, 65 unsolved in 1964 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 57/57 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints]
After SMT, in 3870ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 3872ms
Starting structural reductions in SI_LTL mode, iteration 1 : 57/105 places, 78/138 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4095 ms. Remains : 57/105 places, 78/138 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N06-LTLFireability-12
Product exploration explored 100000 steps with 0 reset in 283 ms.
Stack based approach found an accepted trace after 274 steps with 0 reset with depth 275 and stack size 275 in 1 ms.
FORMULA UtilityControlRoom-PT-Z2T3N06-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N06-LTLFireability-12 finished in 4429 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 138/138 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 105 transition count 114
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 60 place count 81 transition count 102
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 60 place count 81 transition count 90
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 84 place count 69 transition count 90
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 106 place count 58 transition count 79
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 108 place count 57 transition count 78
Applied a total of 108 rules in 15 ms. Remains 57 /105 variables (removed 48) and now considering 78/138 (removed 60) transitions.
// Phase 1: matrix 78 rows 57 cols
[2024-05-30 21:21:25] [INFO ] Computed 14 invariants in 1 ms
[2024-05-30 21:21:25] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-30 21:21:25] [INFO ] Invariant cache hit.
[2024-05-30 21:21:25] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2024-05-30 21:21:25] [INFO ] Redundant transitions in 2 ms returned []
Running 65 sub problems to find dead transitions.
[2024-05-30 21:21:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 6/57 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 78/135 variables, 57/71 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (OVERLAPS) 0/135 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 135/135 variables, and 71 constraints, problems are : Problem set: 0 solved, 65 unsolved in 1700 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 57/57 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 6/57 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 78/135 variables, 57/71 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 65/136 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (OVERLAPS) 0/135 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 135/135 variables, and 136 constraints, problems are : Problem set: 0 solved, 65 unsolved in 1671 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 57/57 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints]
After SMT, in 3418ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 3419ms
Starting structural reductions in SI_LTL mode, iteration 1 : 57/105 places, 78/138 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3610 ms. Remains : 57/105 places, 78/138 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N06-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 220 ms.
Stack based approach found an accepted trace after 587 steps with 0 reset with depth 588 and stack size 588 in 2 ms.
FORMULA UtilityControlRoom-PT-Z2T3N06-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N06-LTLFireability-13 finished in 3886 ms.
All properties solved by simple procedures.
Total runtime 75254 ms.

BK_STOP 1717104088981

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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