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.r092-tall-171624189600604.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 DES-PT-00a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r092-tall-171624189600604
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 408K
-rw-r--r-- 1 mcc users 4.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 22 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K Apr 12 08:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 85K Apr 12 08:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Apr 12 08:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 12 08:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 31K May 18 16:42 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 DES-PT-00a-LTLFireability-00
FORMULA_NAME DES-PT-00a-LTLFireability-01
FORMULA_NAME DES-PT-00a-LTLFireability-02
FORMULA_NAME DES-PT-00a-LTLFireability-03
FORMULA_NAME DES-PT-00a-LTLFireability-04
FORMULA_NAME DES-PT-00a-LTLFireability-05
FORMULA_NAME DES-PT-00a-LTLFireability-06
FORMULA_NAME DES-PT-00a-LTLFireability-07
FORMULA_NAME DES-PT-00a-LTLFireability-08
FORMULA_NAME DES-PT-00a-LTLFireability-09
FORMULA_NAME DES-PT-00a-LTLFireability-10
FORMULA_NAME DES-PT-00a-LTLFireability-11
FORMULA_NAME DES-PT-00a-LTLFireability-12
FORMULA_NAME DES-PT-00a-LTLFireability-13
FORMULA_NAME DES-PT-00a-LTLFireability-14
FORMULA_NAME DES-PT-00a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716334715124

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-00a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-21 23:38:36] [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-21 23:38:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:38:36] [INFO ] Load time of PNML (sax parser for PT used): 58 ms
[2024-05-21 23:38:36] [INFO ] Transformed 115 places.
[2024-05-21 23:38:36] [INFO ] Transformed 76 transitions.
[2024-05-21 23:38:36] [INFO ] Found NUPN structural information;
[2024-05-21 23:38:36] [INFO ] Parsed PT model containing 115 places and 76 transitions and 373 arcs in 147 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
FORMULA DES-PT-00a-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-00a-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-00a-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 49 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 62/62 transitions.
Applied a total of 0 rules in 11 ms. Remains 115 /115 variables (removed 0) and now considering 62/62 (removed 0) transitions.
// Phase 1: matrix 62 rows 115 cols
[2024-05-21 23:38:36] [INFO ] Computed 57 invariants in 7 ms
[2024-05-21 23:38:36] [INFO ] Implicit Places using invariants in 211 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 240 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 114/115 places, 62/62 transitions.
Applied a total of 0 rules in 2 ms. Remains 114 /114 variables (removed 0) and now considering 62/62 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 268 ms. Remains : 114/115 places, 62/62 transitions.
Support contains 49 out of 114 places after structural reductions.
[2024-05-21 23:38:37] [INFO ] Flatten gal took : 27 ms
[2024-05-21 23:38:37] [INFO ] Flatten gal took : 12 ms
[2024-05-21 23:38:37] [INFO ] Input system was already deterministic with 62 transitions.
Support contains 43 out of 114 places (down from 49) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 25 to 18
RANDOM walk for 5268 steps (114 resets) in 212 ms. (24 steps per ms) remains 0/18 properties
Computed a total of 1 stabilizing places and 1 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(G(p0)))'
Support contains 2 out of 114 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 114/114 places, 62/62 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 114 transition count 61
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 113 transition count 61
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 112 transition count 60
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 112 transition count 60
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 110 transition count 58
Applied a total of 8 rules in 69 ms. Remains 110 /114 variables (removed 4) and now considering 58/62 (removed 4) transitions.
// Phase 1: matrix 58 rows 110 cols
[2024-05-21 23:38:37] [INFO ] Computed 56 invariants in 5 ms
[2024-05-21 23:38:37] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-21 23:38:37] [INFO ] Invariant cache hit.
[2024-05-21 23:38:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 23:38:37] [INFO ] Implicit Places using invariants and state equation in 142 ms returned [28]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 244 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 109/114 places, 58/62 transitions.
Applied a total of 0 rules in 7 ms. Remains 109 /109 variables (removed 0) and now considering 58/58 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 320 ms. Remains : 109/114 places, 58/62 transitions.
Stuttering acceptance computed with spot in 275 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-00a-LTLFireability-01
Product exploration explored 100000 steps with 2671 reset in 396 ms.
Product exploration explored 100000 steps with 2630 reset in 250 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
RANDOM walk for 8 steps (0 resets) in 6 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Support contains 2 out of 109 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 109/109 places, 58/58 transitions.
Applied a total of 0 rules in 6 ms. Remains 109 /109 variables (removed 0) and now considering 58/58 (removed 0) transitions.
// Phase 1: matrix 58 rows 109 cols
[2024-05-21 23:38:39] [INFO ] Computed 55 invariants in 4 ms
[2024-05-21 23:38:39] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-21 23:38:39] [INFO ] Invariant cache hit.
[2024-05-21 23:38:39] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
[2024-05-21 23:38:39] [INFO ] Redundant transitions in 19 ms returned []
Running 57 sub problems to find dead transitions.
[2024-05-21 23:38:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 1/109 variables, 33/44 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 11/55 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-21 23:38:40] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 8 ms to minimize.
[2024-05-21 23:38:40] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-21 23:38:40] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (OVERLAPS) 58/167 variables, 109/167 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/167 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 9 (OVERLAPS) 0/167 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 167/167 variables, and 167 constraints, problems are : Problem set: 0 solved, 57 unsolved in 1745 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 57 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 1/109 variables, 33/44 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 11/55 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (OVERLAPS) 58/167 variables, 109/167 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/167 variables, 57/224 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/167 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 9 (OVERLAPS) 0/167 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Int declared 167/167 variables, and 224 constraints, problems are : Problem set: 0 solved, 57 unsolved in 2023 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 3/3 constraints]
After SMT, in 3812ms problems are : Problem set: 0 solved, 57 unsolved
Search for dead transitions found 0 dead transitions in 3823ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 4057 ms. Remains : 109/109 places, 58/58 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
RANDOM walk for 8 steps (0 resets) in 5 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2655 reset in 169 ms.
Stack based approach found an accepted trace after 18047 steps with 494 reset with depth 68 and stack size 68 in 32 ms.
FORMULA DES-PT-00a-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property DES-PT-00a-LTLFireability-01 finished in 6326 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 2 out of 114 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 114/114 places, 62/62 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 114 transition count 61
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 113 transition count 61
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 112 transition count 60
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 112 transition count 60
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 110 transition count 58
Applied a total of 8 rules in 18 ms. Remains 110 /114 variables (removed 4) and now considering 58/62 (removed 4) transitions.
// Phase 1: matrix 58 rows 110 cols
[2024-05-21 23:38:43] [INFO ] Computed 56 invariants in 4 ms
[2024-05-21 23:38:43] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-21 23:38:43] [INFO ] Invariant cache hit.
[2024-05-21 23:38:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 23:38:44] [INFO ] Implicit Places using invariants and state equation in 100 ms returned [28]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 177 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 109/114 places, 58/62 transitions.
Applied a total of 0 rules in 4 ms. Remains 109 /109 variables (removed 0) and now considering 58/58 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 199 ms. Remains : 109/114 places, 58/62 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-00a-LTLFireability-02
Stuttering criterion allowed to conclude after 280 steps with 37 reset in 6 ms.
FORMULA DES-PT-00a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-00a-LTLFireability-02 finished in 289 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 U p2)&&p0))))'
Support contains 7 out of 114 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 114/114 places, 62/62 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 114 transition count 61
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 113 transition count 61
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 112 transition count 60
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 112 transition count 60
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 110 transition count 58
Applied a total of 8 rules in 13 ms. Remains 110 /114 variables (removed 4) and now considering 58/62 (removed 4) transitions.
[2024-05-21 23:38:44] [INFO ] Invariant cache hit.
[2024-05-21 23:38:44] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-21 23:38:44] [INFO ] Invariant cache hit.
[2024-05-21 23:38:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 23:38:44] [INFO ] Implicit Places using invariants and state equation in 104 ms returned [28]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 177 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 109/114 places, 58/62 transitions.
Applied a total of 0 rules in 4 ms. Remains 109 /109 variables (removed 0) and now considering 58/58 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 194 ms. Remains : 109/114 places, 58/62 transitions.
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : DES-PT-00a-LTLFireability-03
Stuttering criterion allowed to conclude after 32 steps with 0 reset in 1 ms.
FORMULA DES-PT-00a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-00a-LTLFireability-03 finished in 310 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)||(p1&&X(p2))))))'
Support contains 4 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 62/62 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 113 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 113 transition count 61
Applied a total of 2 rules in 7 ms. Remains 113 /114 variables (removed 1) and now considering 61/62 (removed 1) transitions.
// Phase 1: matrix 61 rows 113 cols
[2024-05-21 23:38:44] [INFO ] Computed 56 invariants in 1 ms
[2024-05-21 23:38:44] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-21 23:38:44] [INFO ] Invariant cache hit.
[2024-05-21 23:38:44] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-21 23:38:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 1/113 variables, 34/45 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 11/56 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-21 23:38:45] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-21 23:38:45] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:38:45] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:38:45] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 61/174 variables, 113/173 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 0/174 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 174/174 variables, and 173 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1760 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 113/113 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 1/113 variables, 34/45 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 11/56 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 61/174 variables, 113/173 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/174 variables, 60/233 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 0/174 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 174/174 variables, and 233 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1981 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 113/113 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 4/4 constraints]
After SMT, in 3768ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 3770ms
Starting structural reductions in LTL mode, iteration 1 : 113/114 places, 61/62 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3939 ms. Remains : 113/114 places, 61/62 transitions.
Stuttering acceptance computed with spot in 262 ms :[true, (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : DES-PT-00a-LTLFireability-04
Product exploration explored 100000 steps with 25000 reset in 338 ms.
Product exploration explored 100000 steps with 25000 reset in 374 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p2 p0 p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 148 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[true, (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (882 resets) in 234 ms. (170 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (186 resets) in 156 ms. (254 steps per ms) remains 1/1 properties
[2024-05-21 23:38:49] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/11 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 69/80 variables, 30/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/102 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 56/158 variables, 102/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 14/172 variables, 9/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/172 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/172 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/174 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/174 variables, 2/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/174 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/174 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 174/174 variables, and 169 constraints, problems are : Problem set: 0 solved, 1 unsolved in 126 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 113/113 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/11 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 69/80 variables, 30/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/102 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 23:38:50] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 20 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 56/158 variables, 102/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 14/172 variables, 9/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/172 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/172 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/172 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/174 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/174 variables, 2/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/174 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/174 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 174/174 variables, and 171 constraints, problems are : Problem set: 0 solved, 1 unsolved in 310 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 113/113 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 458ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 40 ms.
Support contains 4 out of 113 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 113/113 places, 61/61 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 113 transition count 59
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 2 place count 113 transition count 58
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 112 transition count 58
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 8 place count 110 transition count 56
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 13 place count 110 transition count 56
Applied a total of 13 rules in 32 ms. Remains 110 /113 variables (removed 3) and now considering 56/61 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 110/113 places, 56/61 transitions.
RANDOM walk for 8554 steps (104 resets) in 57 ms. (147 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p2 p0 p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p2))), (F (NOT p2)), (F (NOT p0)), (F (NOT (OR (NOT p0) p2)))]
Knowledge based reduction with 7 factoid took 295 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[true, (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 201 ms :[true, (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 61/61 transitions.
Applied a total of 0 rules in 3 ms. Remains 113 /113 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2024-05-21 23:38:51] [INFO ] Invariant cache hit.
[2024-05-21 23:38:51] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-21 23:38:51] [INFO ] Invariant cache hit.
[2024-05-21 23:38:51] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-21 23:38:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 1/113 variables, 34/45 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 11/56 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-21 23:38:51] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-21 23:38:52] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:38:52] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-05-21 23:38:52] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 61/174 variables, 113/173 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 0/174 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 174/174 variables, and 173 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1647 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 113/113 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 1/113 variables, 34/45 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 11/56 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 61/174 variables, 113/173 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/174 variables, 60/233 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 0/174 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 174/174 variables, and 233 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1949 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 113/113 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 4/4 constraints]
After SMT, in 3608ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 3609ms
Finished structural reductions in LTL mode , in 1 iterations and 3855 ms. Remains : 113/113 places, 61/61 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p2)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 74 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[true, (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (903 resets) in 174 ms. (228 steps per ms) remains 1/4 properties
BEST_FIRST walk for 34207 steps (160 resets) in 58 ms. (579 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p2)]
False Knowledge obtained : [(F (NOT (OR p0 p2))), (F (NOT p2)), (F (NOT p0)), (F (NOT (OR (NOT p0) p2)))]
Knowledge based reduction with 1 factoid took 163 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[true, (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 178 ms :[true, (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 163 ms :[true, (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 25000 reset in 142 ms.
Product exploration explored 100000 steps with 25000 reset in 156 ms.
Applying partial POR strategy [true, true, true, false, false, false]
Stuttering acceptance computed with spot in 176 ms :[true, (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 113 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 113/113 places, 61/61 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 113 transition count 61
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 113 transition count 61
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 113 transition count 61
Deduced a syphon composed of 3 places in 1 ms
Applied a total of 3 rules in 18 ms. Remains 113 /113 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2024-05-21 23:38:56] [INFO ] Redundant transitions in 0 ms returned []
Running 60 sub problems to find dead transitions.
// Phase 1: matrix 61 rows 113 cols
[2024-05-21 23:38:56] [INFO ] Computed 56 invariants in 1 ms
[2024-05-21 23:38:56] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 1/113 variables, 34/45 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 11/56 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-21 23:38:57] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
Problem TDEAD8 is UNSAT
[2024-05-21 23:38:57] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-05-21 23:38:57] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:38:57] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 4/60 constraints. Problems are: Problem set: 2 solved, 58 unsolved
[2024-05-21 23:38:57] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
Problem TDEAD50 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 1/61 constraints. Problems are: Problem set: 3 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 0/61 constraints. Problems are: Problem set: 3 solved, 57 unsolved
At refinement iteration 7 (OVERLAPS) 61/174 variables, 113/174 constraints. Problems are: Problem set: 3 solved, 57 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 1/175 constraints. Problems are: Problem set: 3 solved, 57 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/174 variables, 0/175 constraints. Problems are: Problem set: 3 solved, 57 unsolved
At refinement iteration 10 (OVERLAPS) 0/174 variables, 0/175 constraints. Problems are: Problem set: 3 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 174/174 variables, and 175 constraints, problems are : Problem set: 3 solved, 57 unsolved in 1640 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 113/113 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 3 solved, 57 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 11/11 constraints. Problems are: Problem set: 3 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 0/11 constraints. Problems are: Problem set: 3 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 4/113 variables, 34/45 constraints. Problems are: Problem set: 3 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 11/56 constraints. Problems are: Problem set: 3 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 5/61 constraints. Problems are: Problem set: 3 solved, 57 unsolved
[2024-05-21 23:38:58] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 1/62 constraints. Problems are: Problem set: 3 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 0/62 constraints. Problems are: Problem set: 3 solved, 57 unsolved
At refinement iteration 7 (OVERLAPS) 61/174 variables, 113/175 constraints. Problems are: Problem set: 3 solved, 57 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 1/176 constraints. Problems are: Problem set: 3 solved, 57 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/174 variables, 57/233 constraints. Problems are: Problem set: 3 solved, 57 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/174 variables, 0/233 constraints. Problems are: Problem set: 3 solved, 57 unsolved
At refinement iteration 11 (OVERLAPS) 0/174 variables, 0/233 constraints. Problems are: Problem set: 3 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Int declared 174/174 variables, and 233 constraints, problems are : Problem set: 3 solved, 57 unsolved in 2871 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 113/113 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 57/60 constraints, Known Traps: 6/6 constraints]
After SMT, in 4565ms problems are : Problem set: 3 solved, 57 unsolved
Search for dead transitions found 3 dead transitions in 4566ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 113/113 places, 58/61 transitions.
Graph (complete) has 374 edges and 113 vertex of which 110 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 110 /113 variables (removed 3) and now considering 58/58 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 110/113 places, 58/61 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4597 ms. Remains : 110/113 places, 58/61 transitions.
Built C files in :
/tmp/ltsmin13234984869868969244
[2024-05-21 23:39:01] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13234984869868969244
Running compilation step : cd /tmp/ltsmin13234984869868969244;'/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 285 ms.
Running link step : cd /tmp/ltsmin13234984869868969244;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin13234984869868969244;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4767900547974116238.hoa' '--buchi-type=spotba'
LTSmin run took 2572 ms.
FORMULA DES-PT-00a-LTLFireability-04 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-00a-LTLFireability-04 finished in 19866 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 1 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 62/62 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 113 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 113 transition count 61
Applied a total of 2 rules in 3 ms. Remains 113 /114 variables (removed 1) and now considering 61/62 (removed 1) transitions.
// Phase 1: matrix 61 rows 113 cols
[2024-05-21 23:39:04] [INFO ] Computed 56 invariants in 1 ms
[2024-05-21 23:39:04] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-05-21 23:39:04] [INFO ] Invariant cache hit.
[2024-05-21 23:39:04] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-21 23:39:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 1/113 variables, 34/45 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 11/56 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-21 23:39:05] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-21 23:39:05] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 0 ms to minimize.
[2024-05-21 23:39:05] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-21 23:39:05] [INFO ] Deduced a trap composed of 12 places in 15 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 61/174 variables, 113/173 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 0/174 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 174/174 variables, and 173 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1657 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 113/113 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 1/113 variables, 34/45 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 11/56 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 61/174 variables, 113/173 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/174 variables, 60/233 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 0/174 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 174/174 variables, and 233 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1835 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 113/113 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 4/4 constraints]
After SMT, in 3537ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 3537ms
Starting structural reductions in LTL mode, iteration 1 : 113/114 places, 61/62 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3807 ms. Remains : 113/114 places, 61/62 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-00a-LTLFireability-05
Product exploration explored 100000 steps with 50000 reset in 143 ms.
Product exploration explored 100000 steps with 50000 reset in 154 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Detected a total of 1/113 stabilizing places and 1/61 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 14 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-00a-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-00a-LTLFireability-05 finished in 4195 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&&F(p1)))||G(!p2))))'
Support contains 4 out of 114 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 114/114 places, 62/62 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 114 transition count 61
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 113 transition count 61
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 112 transition count 60
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 112 transition count 60
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 110 transition count 58
Applied a total of 8 rules in 15 ms. Remains 110 /114 variables (removed 4) and now considering 58/62 (removed 4) transitions.
// Phase 1: matrix 58 rows 110 cols
[2024-05-21 23:39:08] [INFO ] Computed 56 invariants in 1 ms
[2024-05-21 23:39:08] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-21 23:39:08] [INFO ] Invariant cache hit.
[2024-05-21 23:39:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 23:39:08] [INFO ] Implicit Places using invariants and state equation in 138 ms returned [28]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 259 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 109/114 places, 58/62 transitions.
Applied a total of 0 rules in 4 ms. Remains 109 /109 variables (removed 0) and now considering 58/58 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 278 ms. Remains : 109/114 places, 58/62 transitions.
Stuttering acceptance computed with spot in 75 ms :[(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (AND p2 (NOT p1))]
Running random walk in product with property : DES-PT-00a-LTLFireability-06
Product exploration explored 100000 steps with 9942 reset in 188 ms.
Product exploration explored 100000 steps with 9883 reset in 195 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p0) p2))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 104 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter insensitive) to 2 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (AND p2 (NOT p1))]
RANDOM walk for 40000 steps (1052 resets) in 226 ms. (176 steps per ms) remains 1/10 properties
BEST_FIRST walk for 40003 steps (231 resets) in 158 ms. (251 steps per ms) remains 1/1 properties
// Phase 1: matrix 58 rows 109 cols
[2024-05-21 23:39:09] [INFO ] Computed 55 invariants in 1 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 66/76 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/98 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 52/150 variables, 98/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/150 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 15/165 variables, 9/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/165 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/165 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/167 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/167 variables, 2/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/167 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/167 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 167/167 variables, and 164 constraints, problems are : Problem set: 0 solved, 1 unsolved in 129 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Int declared 10/167 variables, and 2 constraints, problems are : Problem set: 1 solved, 0 unsolved in 15 ms.
Refiners :[Positive P Invariants (semi-flows): 2/33 constraints, Generalized P Invariants (flows): 0/22 constraints, State Equation: 0/109 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 159ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p0) p2))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p0)), (X (X (NOT p1))), (G (OR p2 p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT (AND p0 (NOT p2)))), (F (NOT (OR (NOT p2) p1))), (F (NOT (OR p0 p2))), (F p2), (F (NOT (OR (NOT p0) p1))), (F (NOT p0)), (F (NOT (OR p0 (NOT p2)))), (F (NOT p1))]
Knowledge based reduction with 22 factoid took 357 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter insensitive) to 2 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 139 ms :[(OR (AND (NOT p0) p2) (AND p0 (NOT p1))), (NOT p1)]
Stuttering acceptance computed with spot in 54 ms :[(OR (AND (NOT p0) p2) (AND p0 (NOT p1))), (NOT p1)]
Support contains 4 out of 109 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 109/109 places, 58/58 transitions.
Applied a total of 0 rules in 4 ms. Remains 109 /109 variables (removed 0) and now considering 58/58 (removed 0) transitions.
[2024-05-21 23:39:10] [INFO ] Invariant cache hit.
[2024-05-21 23:39:10] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-05-21 23:39:10] [INFO ] Invariant cache hit.
[2024-05-21 23:39:10] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
[2024-05-21 23:39:10] [INFO ] Redundant transitions in 10 ms returned []
Running 57 sub problems to find dead transitions.
[2024-05-21 23:39:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 1/109 variables, 33/44 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 11/55 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-21 23:39:11] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:39:11] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-21 23:39:11] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (OVERLAPS) 58/167 variables, 109/167 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/167 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 9 (OVERLAPS) 0/167 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 167/167 variables, and 167 constraints, problems are : Problem set: 0 solved, 57 unsolved in 1523 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 57 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 1/109 variables, 33/44 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 11/55 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (OVERLAPS) 58/167 variables, 109/167 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/167 variables, 57/224 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/167 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 9 (OVERLAPS) 0/167 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Int declared 167/167 variables, and 224 constraints, problems are : Problem set: 0 solved, 57 unsolved in 1900 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 3/3 constraints]
After SMT, in 3445ms problems are : Problem set: 0 solved, 57 unsolved
Search for dead transitions found 0 dead transitions in 3446ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3762 ms. Remains : 109/109 places, 58/58 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X p0), (X p1), (X (X p2)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 124 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(OR (AND (NOT p0) p2) (AND p0 (NOT p1))), (NOT p1)]
RANDOM walk for 1914 steps (50 resets) in 8 ms. (212 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X p0), (X p1), (X (X p2)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 p2))), (F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT p0)), (F (NOT (OR p0 (NOT p2)))), (F p2), (F (NOT (AND p0 (NOT p2)))), (F (NOT (OR (NOT p0) p1))), (F (NOT p1))]
Knowledge based reduction with 17 factoid took 421 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(OR (AND (NOT p0) p2) (AND p0 (NOT p1))), (NOT p1)]
Stuttering acceptance computed with spot in 63 ms :[(OR (AND (NOT p0) p2) (AND p0 (NOT p1))), (NOT p1)]
Stuttering acceptance computed with spot in 65 ms :[(OR (AND (NOT p0) p2) (AND p0 (NOT p1))), (NOT p1)]
Product exploration explored 100000 steps with 9973 reset in 175 ms.
Product exploration explored 100000 steps with 10047 reset in 197 ms.
Built C files in :
/tmp/ltsmin1564467143888300959
[2024-05-21 23:39:15] [INFO ] Computing symmetric may disable matrix : 58 transitions.
[2024-05-21 23:39:15] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:39:15] [INFO ] Computing symmetric may enable matrix : 58 transitions.
[2024-05-21 23:39:15] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:39:15] [INFO ] Computing Do-Not-Accords matrix : 58 transitions.
[2024-05-21 23:39:15] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:39:15] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1564467143888300959
Running compilation step : cd /tmp/ltsmin1564467143888300959;'/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 177 ms.
Running link step : cd /tmp/ltsmin1564467143888300959;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin1564467143888300959;'/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/stateBased16298309131042936937.hoa' '--buchi-type=spotba'
LTSmin run took 148 ms.
FORMULA DES-PT-00a-LTLFireability-06 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-00a-LTLFireability-06 finished in 7181 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)&&X((F(G(p3))&&p2))&&p0)))'
Support contains 6 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 62/62 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 113 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 113 transition count 61
Applied a total of 2 rules in 1 ms. Remains 113 /114 variables (removed 1) and now considering 61/62 (removed 1) transitions.
// Phase 1: matrix 61 rows 113 cols
[2024-05-21 23:39:15] [INFO ] Computed 56 invariants in 1 ms
[2024-05-21 23:39:15] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-05-21 23:39:15] [INFO ] Invariant cache hit.
[2024-05-21 23:39:15] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-21 23:39:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 1/113 variables, 34/45 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 11/56 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-21 23:39:16] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-21 23:39:16] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:39:16] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-21 23:39:16] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 61/174 variables, 113/173 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 0/174 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 174/174 variables, and 173 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1586 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 113/113 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 1/113 variables, 34/45 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 11/56 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 61/174 variables, 113/173 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/174 variables, 60/233 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 0/174 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 174/174 variables, and 233 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1892 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 113/113 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 4/4 constraints]
After SMT, in 3507ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 3511ms
Starting structural reductions in LTL mode, iteration 1 : 113/114 places, 61/62 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3764 ms. Remains : 113/114 places, 61/62 transitions.
Stuttering acceptance computed with spot in 201 ms :[(OR (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (OR (NOT p0) (NOT p1) (NOT p2) (NOT p3)), true, (NOT p1), (OR (NOT p2) (NOT p3)), (NOT p3)]
Running random walk in product with property : DES-PT-00a-LTLFireability-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-00a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-00a-LTLFireability-07 finished in 3981 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(p0))||F(p1)))'
Support contains 14 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 62/62 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 113 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 113 transition count 61
Applied a total of 2 rules in 5 ms. Remains 113 /114 variables (removed 1) and now considering 61/62 (removed 1) transitions.
[2024-05-21 23:39:19] [INFO ] Invariant cache hit.
[2024-05-21 23:39:19] [INFO ] Implicit Places using invariants in 181 ms returned []
[2024-05-21 23:39:19] [INFO ] Invariant cache hit.
[2024-05-21 23:39:19] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-21 23:39:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 1/113 variables, 34/45 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 11/56 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-21 23:39:20] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-21 23:39:20] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 5 ms to minimize.
[2024-05-21 23:39:20] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-21 23:39:20] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 61/174 variables, 113/173 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 0/174 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 174/174 variables, and 173 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1594 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 113/113 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 1/113 variables, 34/45 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 11/56 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 61/174 variables, 113/173 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/174 variables, 60/233 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 0/174 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 174/174 variables, and 233 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1883 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 113/113 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 4/4 constraints]
After SMT, in 3507ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 3508ms
Starting structural reductions in LTL mode, iteration 1 : 113/114 places, 61/62 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3803 ms. Remains : 113/114 places, 61/62 transitions.
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-00a-LTLFireability-08
Stuttering criterion allowed to conclude after 72 steps with 2 reset in 0 ms.
FORMULA DES-PT-00a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-00a-LTLFireability-08 finished in 3939 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&&X(p1)))||(F(p2)&&F(p0))))'
Support contains 5 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 62/62 transitions.
Applied a total of 0 rules in 1 ms. Remains 114 /114 variables (removed 0) and now considering 62/62 (removed 0) transitions.
// Phase 1: matrix 62 rows 114 cols
[2024-05-21 23:39:23] [INFO ] Computed 56 invariants in 3 ms
[2024-05-21 23:39:23] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-21 23:39:23] [INFO ] Invariant cache hit.
[2024-05-21 23:39:23] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
Running 61 sub problems to find dead transitions.
[2024-05-21 23:39:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 113/113 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 13/126 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (OVERLAPS) 1/114 variables, 33/159 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 10/170 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-21 23:39:24] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-21 23:39:24] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 2 ms to minimize.
[2024-05-21 23:39:24] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/114 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (OVERLAPS) 62/176 variables, 114/287 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-21 23:39:25] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/176 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/176 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 12 (OVERLAPS) 0/176 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 176/176 variables, and 288 constraints, problems are : Problem set: 0 solved, 61 unsolved in 2203 ms.
Refiners :[Domain max(s): 114/114 constraints, Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 114/114 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 113/113 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 13/126 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (OVERLAPS) 1/114 variables, 33/159 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 10/170 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 4/174 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (OVERLAPS) 62/176 variables, 114/288 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/176 variables, 61/349 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-21 23:39:27] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/176 variables, 1/350 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/176 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-21 23:39:28] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/176 variables, 1/351 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/176 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 14 (OVERLAPS) 0/176 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 176/176 variables, and 351 constraints, problems are : Problem set: 0 solved, 61 unsolved in 4950 ms.
Refiners :[Domain max(s): 114/114 constraints, Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 114/114 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 6/6 constraints]
After SMT, in 7197ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 7199ms
Finished structural reductions in LTL mode , in 1 iterations and 7445 ms. Remains : 114/114 places, 62/62 transitions.
Stuttering acceptance computed with spot in 215 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : DES-PT-00a-LTLFireability-10
Product exploration explored 100000 steps with 18201 reset in 176 ms.
Product exploration explored 100000 steps with 18186 reset in 221 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 167 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (NOT p0), (NOT p2)]
RANDOM walk for 18 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p2), (F p0)]
Knowledge based reduction with 9 factoid took 218 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 122 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (NOT p0), (NOT p2)]
[2024-05-21 23:39:32] [INFO ] Invariant cache hit.
[2024-05-21 23:39:32] [INFO ] [Real]Absence check using 33 positive place invariants in 5 ms returned sat
[2024-05-21 23:39:32] [INFO ] [Real]Absence check using 33 positive and 23 generalized place invariants in 23 ms returned sat
[2024-05-21 23:39:32] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2024-05-21 23:39:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:39:32] [INFO ] [Nat]Absence check using 33 positive place invariants in 5 ms returned sat
[2024-05-21 23:39:32] [INFO ] [Nat]Absence check using 33 positive and 23 generalized place invariants in 9 ms returned sat
[2024-05-21 23:39:32] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2024-05-21 23:39:32] [INFO ] Computed and/alt/rep : 59/174/59 causal constraints (skipped 2 transitions) in 6 ms.
[2024-05-21 23:39:33] [INFO ] Added : 57 causal constraints over 13 iterations in 247 ms. Result :sat
Could not prove EG (NOT p2)
[2024-05-21 23:39:33] [INFO ] Invariant cache hit.
[2024-05-21 23:39:33] [INFO ] [Real]Absence check using 33 positive place invariants in 6 ms returned sat
[2024-05-21 23:39:33] [INFO ] [Real]Absence check using 33 positive and 23 generalized place invariants in 80 ms returned sat
[2024-05-21 23:39:33] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2024-05-21 23:39:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:39:33] [INFO ] [Nat]Absence check using 33 positive place invariants in 5 ms returned sat
[2024-05-21 23:39:33] [INFO ] [Nat]Absence check using 33 positive and 23 generalized place invariants in 8 ms returned sat
[2024-05-21 23:39:33] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2024-05-21 23:39:33] [INFO ] Computed and/alt/rep : 59/174/59 causal constraints (skipped 2 transitions) in 13 ms.
[2024-05-21 23:39:33] [INFO ] Added : 22 causal constraints over 5 iterations in 85 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 114 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 62/62 transitions.
Applied a total of 0 rules in 0 ms. Remains 114 /114 variables (removed 0) and now considering 62/62 (removed 0) transitions.
[2024-05-21 23:39:33] [INFO ] Invariant cache hit.
[2024-05-21 23:39:33] [INFO ] Implicit Places using invariants in 162 ms returned []
[2024-05-21 23:39:33] [INFO ] Invariant cache hit.
[2024-05-21 23:39:34] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 412 ms to find 0 implicit places.
Running 61 sub problems to find dead transitions.
[2024-05-21 23:39:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 113/113 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 13/126 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (OVERLAPS) 1/114 variables, 33/159 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 10/170 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-21 23:39:34] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-21 23:39:35] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
[2024-05-21 23:39:35] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/114 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (OVERLAPS) 62/176 variables, 114/287 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-21 23:39:35] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/176 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/176 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 12 (OVERLAPS) 0/176 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 176/176 variables, and 288 constraints, problems are : Problem set: 0 solved, 61 unsolved in 2258 ms.
Refiners :[Domain max(s): 114/114 constraints, Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 114/114 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 113/113 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 13/126 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (OVERLAPS) 1/114 variables, 33/159 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 10/170 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 4/174 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (OVERLAPS) 62/176 variables, 114/288 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/176 variables, 61/349 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-21 23:39:37] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/176 variables, 1/350 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/176 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-21 23:39:38] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/176 variables, 1/351 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/176 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 14 (OVERLAPS) 0/176 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 176/176 variables, and 351 constraints, problems are : Problem set: 0 solved, 61 unsolved in 4822 ms.
Refiners :[Domain max(s): 114/114 constraints, Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 114/114 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 6/6 constraints]
After SMT, in 7102ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 7106ms
Finished structural reductions in LTL mode , in 1 iterations and 7518 ms. Remains : 114/114 places, 62/62 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 137 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 132 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (NOT p0), (NOT p2)]
RANDOM walk for 18 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p2), (F p0)]
Knowledge based reduction with 4 factoid took 109 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 123 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (NOT p0), (NOT p2)]
[2024-05-21 23:39:41] [INFO ] Invariant cache hit.
[2024-05-21 23:39:41] [INFO ] [Real]Absence check using 33 positive place invariants in 6 ms returned sat
[2024-05-21 23:39:41] [INFO ] [Real]Absence check using 33 positive and 23 generalized place invariants in 22 ms returned sat
[2024-05-21 23:39:41] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2024-05-21 23:39:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:39:42] [INFO ] [Nat]Absence check using 33 positive place invariants in 5 ms returned sat
[2024-05-21 23:39:42] [INFO ] [Nat]Absence check using 33 positive and 23 generalized place invariants in 8 ms returned sat
[2024-05-21 23:39:42] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2024-05-21 23:39:42] [INFO ] Computed and/alt/rep : 59/174/59 causal constraints (skipped 2 transitions) in 5 ms.
[2024-05-21 23:39:42] [INFO ] Added : 57 causal constraints over 13 iterations in 179 ms. Result :sat
Could not prove EG (NOT p2)
[2024-05-21 23:39:42] [INFO ] Invariant cache hit.
[2024-05-21 23:39:42] [INFO ] [Real]Absence check using 33 positive place invariants in 5 ms returned sat
[2024-05-21 23:39:42] [INFO ] [Real]Absence check using 33 positive and 23 generalized place invariants in 22 ms returned sat
[2024-05-21 23:39:42] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2024-05-21 23:39:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:39:42] [INFO ] [Nat]Absence check using 33 positive place invariants in 5 ms returned sat
[2024-05-21 23:39:42] [INFO ] [Nat]Absence check using 33 positive and 23 generalized place invariants in 9 ms returned sat
[2024-05-21 23:39:42] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2024-05-21 23:39:42] [INFO ] Computed and/alt/rep : 59/174/59 causal constraints (skipped 2 transitions) in 5 ms.
[2024-05-21 23:39:42] [INFO ] Added : 22 causal constraints over 5 iterations in 71 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (NOT p0), (NOT p2)]
Product exploration explored 100000 steps with 18183 reset in 207 ms.
Product exploration explored 100000 steps with 18189 reset in 212 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 256 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (NOT p0), (NOT p2)]
Support contains 3 out of 114 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 114/114 places, 62/62 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 114 transition count 62
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 114 transition count 62
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 113 transition count 61
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 113 transition count 61
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 113 transition count 61
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 5 rules in 7 ms. Remains 113 /114 variables (removed 1) and now considering 61/62 (removed 1) transitions.
[2024-05-21 23:39:43] [INFO ] Redundant transitions in 1 ms returned []
Running 60 sub problems to find dead transitions.
// Phase 1: matrix 61 rows 113 cols
[2024-05-21 23:39:43] [INFO ] Computed 56 invariants in 2 ms
[2024-05-21 23:39:43] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 1/113 variables, 34/45 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 11/56 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-21 23:39:44] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
Problem TDEAD8 is UNSAT
[2024-05-21 23:39:44] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-05-21 23:39:44] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
[2024-05-21 23:39:44] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 4/60 constraints. Problems are: Problem set: 2 solved, 58 unsolved
[2024-05-21 23:39:44] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 0 ms to minimize.
Problem TDEAD50 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 1/61 constraints. Problems are: Problem set: 3 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 0/61 constraints. Problems are: Problem set: 3 solved, 57 unsolved
At refinement iteration 7 (OVERLAPS) 61/174 variables, 113/174 constraints. Problems are: Problem set: 3 solved, 57 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 1/175 constraints. Problems are: Problem set: 3 solved, 57 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/174 variables, 0/175 constraints. Problems are: Problem set: 3 solved, 57 unsolved
At refinement iteration 10 (OVERLAPS) 0/174 variables, 0/175 constraints. Problems are: Problem set: 3 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 174/174 variables, and 175 constraints, problems are : Problem set: 3 solved, 57 unsolved in 1537 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 113/113 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 3 solved, 57 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 11/11 constraints. Problems are: Problem set: 3 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 0/11 constraints. Problems are: Problem set: 3 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 4/113 variables, 34/45 constraints. Problems are: Problem set: 3 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 11/56 constraints. Problems are: Problem set: 3 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 5/61 constraints. Problems are: Problem set: 3 solved, 57 unsolved
[2024-05-21 23:39:45] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 1/62 constraints. Problems are: Problem set: 3 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 0/62 constraints. Problems are: Problem set: 3 solved, 57 unsolved
At refinement iteration 7 (OVERLAPS) 61/174 variables, 113/175 constraints. Problems are: Problem set: 3 solved, 57 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 1/176 constraints. Problems are: Problem set: 3 solved, 57 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/174 variables, 57/233 constraints. Problems are: Problem set: 3 solved, 57 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/174 variables, 0/233 constraints. Problems are: Problem set: 3 solved, 57 unsolved
At refinement iteration 11 (OVERLAPS) 0/174 variables, 0/233 constraints. Problems are: Problem set: 3 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Int declared 174/174 variables, and 233 constraints, problems are : Problem set: 3 solved, 57 unsolved in 2138 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 113/113 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 57/60 constraints, Known Traps: 6/6 constraints]
After SMT, in 3697ms problems are : Problem set: 3 solved, 57 unsolved
Search for dead transitions found 3 dead transitions in 3698ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 113/114 places, 58/62 transitions.
Graph (complete) has 374 edges and 113 vertex of which 110 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 8 ms. Remains 110 /113 variables (removed 3) and now considering 58/58 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 110/114 places, 58/62 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3746 ms. Remains : 110/114 places, 58/62 transitions.
Built C files in :
/tmp/ltsmin11334162273525785217
[2024-05-21 23:39:47] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11334162273525785217
Running compilation step : cd /tmp/ltsmin11334162273525785217;'/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 170 ms.
Running link step : cd /tmp/ltsmin11334162273525785217;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin11334162273525785217;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9854423694092790454.hoa' '--buchi-type=spotba'
LTSmin run took 3928 ms.
FORMULA DES-PT-00a-LTLFireability-10 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-00a-LTLFireability-10 finished in 27902 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(F(p1))))'
Support contains 3 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 62/62 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 113 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 113 transition count 61
Applied a total of 2 rules in 2 ms. Remains 113 /114 variables (removed 1) and now considering 61/62 (removed 1) transitions.
// Phase 1: matrix 61 rows 113 cols
[2024-05-21 23:39:51] [INFO ] Computed 56 invariants in 1 ms
[2024-05-21 23:39:51] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-21 23:39:51] [INFO ] Invariant cache hit.
[2024-05-21 23:39:51] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-21 23:39:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 1/113 variables, 34/45 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 11/56 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-21 23:39:52] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-21 23:39:52] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:39:52] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-21 23:39:52] [INFO ] Deduced a trap composed of 12 places in 16 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 61/174 variables, 113/173 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 0/174 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 174/174 variables, and 173 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1596 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 113/113 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 1/113 variables, 34/45 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 11/56 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 61/174 variables, 113/173 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/174 variables, 60/233 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 0/174 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 174/174 variables, and 233 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1911 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 113/113 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 4/4 constraints]
After SMT, in 3546ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 3546ms
Starting structural reductions in LTL mode, iteration 1 : 113/114 places, 61/62 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3740 ms. Remains : 113/114 places, 61/62 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-00a-LTLFireability-11
Stuttering criterion allowed to conclude after 49 steps with 1 reset in 0 ms.
FORMULA DES-PT-00a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-00a-LTLFireability-11 finished in 3865 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))&&F(p1)))'
Support contains 5 out of 114 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 114/114 places, 62/62 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 114 transition count 61
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 113 transition count 61
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 112 transition count 60
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 112 transition count 60
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 110 transition count 58
Applied a total of 8 rules in 8 ms. Remains 110 /114 variables (removed 4) and now considering 58/62 (removed 4) transitions.
// Phase 1: matrix 58 rows 110 cols
[2024-05-21 23:39:55] [INFO ] Computed 56 invariants in 2 ms
[2024-05-21 23:39:55] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-21 23:39:55] [INFO ] Invariant cache hit.
[2024-05-21 23:39:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 23:39:55] [INFO ] Implicit Places using invariants and state equation in 92 ms returned [28]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 185 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 109/114 places, 58/62 transitions.
Applied a total of 0 rules in 2 ms. Remains 109 /109 variables (removed 0) and now considering 58/58 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 197 ms. Remains : 109/114 places, 58/62 transitions.
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : DES-PT-00a-LTLFireability-12
Product exploration explored 100000 steps with 3352 reset in 148 ms.
Product exploration explored 100000 steps with 3324 reset in 167 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 101 ms. Reduced automaton from 4 states, 7 edges and 2 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)]
RANDOM walk for 273 steps (6 resets) in 7 ms. (34 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 98 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 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 109 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 109/109 places, 58/58 transitions.
Applied a total of 0 rules in 2 ms. Remains 109 /109 variables (removed 0) and now considering 58/58 (removed 0) transitions.
// Phase 1: matrix 58 rows 109 cols
[2024-05-21 23:39:56] [INFO ] Computed 55 invariants in 5 ms
[2024-05-21 23:39:56] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-21 23:39:56] [INFO ] Invariant cache hit.
[2024-05-21 23:39:56] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
[2024-05-21 23:39:56] [INFO ] Redundant transitions in 10 ms returned []
Running 57 sub problems to find dead transitions.
[2024-05-21 23:39:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 1/109 variables, 33/44 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 11/55 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-21 23:39:57] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:39:57] [INFO ] Deduced a trap composed of 11 places in 17 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-21 23:39:57] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (OVERLAPS) 58/167 variables, 109/167 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/167 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 9 (OVERLAPS) 0/167 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 167/167 variables, and 167 constraints, problems are : Problem set: 0 solved, 57 unsolved in 1458 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 57 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 1/109 variables, 33/44 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 11/55 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (OVERLAPS) 58/167 variables, 109/167 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/167 variables, 57/224 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/167 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 9 (OVERLAPS) 0/167 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Int declared 167/167 variables, and 224 constraints, problems are : Problem set: 0 solved, 57 unsolved in 1984 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 3/3 constraints]
After SMT, in 3452ms problems are : Problem set: 0 solved, 57 unsolved
Search for dead transitions found 0 dead transitions in 3452ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3712 ms. Remains : 109/109 places, 58/58 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 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 67 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 166 steps (4 resets) in 4 ms. (33 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 69 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 59 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3320 reset in 151 ms.
Product exploration explored 100000 steps with 3320 reset in 166 ms.
Built C files in :
/tmp/ltsmin5798683821458210391
[2024-05-21 23:40:00] [INFO ] Computing symmetric may disable matrix : 58 transitions.
[2024-05-21 23:40:00] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:40:00] [INFO ] Computing symmetric may enable matrix : 58 transitions.
[2024-05-21 23:40:00] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:40:00] [INFO ] Computing Do-Not-Accords matrix : 58 transitions.
[2024-05-21 23:40:00] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:40:00] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5798683821458210391
Running compilation step : cd /tmp/ltsmin5798683821458210391;'/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 173 ms.
Running link step : cd /tmp/ltsmin5798683821458210391;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin5798683821458210391;'/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/stateBased12282319074431745434.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 109 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 109/109 places, 58/58 transitions.
Applied a total of 0 rules in 4 ms. Remains 109 /109 variables (removed 0) and now considering 58/58 (removed 0) transitions.
[2024-05-21 23:40:16] [INFO ] Invariant cache hit.
[2024-05-21 23:40:16] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-21 23:40:16] [INFO ] Invariant cache hit.
[2024-05-21 23:40:16] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
[2024-05-21 23:40:16] [INFO ] Redundant transitions in 12 ms returned []
Running 57 sub problems to find dead transitions.
[2024-05-21 23:40:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 1/109 variables, 33/44 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 11/55 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-21 23:40:16] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
[2024-05-21 23:40:16] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-21 23:40:16] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (OVERLAPS) 58/167 variables, 109/167 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/167 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 9 (OVERLAPS) 0/167 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 167/167 variables, and 167 constraints, problems are : Problem set: 0 solved, 57 unsolved in 1446 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 57 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 1/109 variables, 33/44 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 11/55 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (OVERLAPS) 58/167 variables, 109/167 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/167 variables, 57/224 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/167 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 9 (OVERLAPS) 0/167 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Int declared 167/167 variables, and 224 constraints, problems are : Problem set: 0 solved, 57 unsolved in 1986 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 3/3 constraints]
After SMT, in 3444ms problems are : Problem set: 0 solved, 57 unsolved
Search for dead transitions found 0 dead transitions in 3445ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3642 ms. Remains : 109/109 places, 58/58 transitions.
Built C files in :
/tmp/ltsmin14898098185824606169
[2024-05-21 23:40:19] [INFO ] Computing symmetric may disable matrix : 58 transitions.
[2024-05-21 23:40:19] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:40:19] [INFO ] Computing symmetric may enable matrix : 58 transitions.
[2024-05-21 23:40:19] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:40:19] [INFO ] Computing Do-Not-Accords matrix : 58 transitions.
[2024-05-21 23:40:19] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:40:19] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14898098185824606169
Running compilation step : cd /tmp/ltsmin14898098185824606169;'/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 227 ms.
Running link step : cd /tmp/ltsmin14898098185824606169;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin14898098185824606169;'/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/stateBased912202170710654885.hoa' '--buchi-type=spotba'
LTSmin run took 13090 ms.
FORMULA DES-PT-00a-LTLFireability-12 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-00a-LTLFireability-12 finished in 37719 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(p1))||(p2&&F(p3)))&&p0)))'
Support contains 6 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 62/62 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 113 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 113 transition count 61
Applied a total of 2 rules in 3 ms. Remains 113 /114 variables (removed 1) and now considering 61/62 (removed 1) transitions.
// Phase 1: matrix 61 rows 113 cols
[2024-05-21 23:40:33] [INFO ] Computed 56 invariants in 2 ms
[2024-05-21 23:40:33] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-21 23:40:33] [INFO ] Invariant cache hit.
[2024-05-21 23:40:33] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-21 23:40:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 1/113 variables, 34/45 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 11/56 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-21 23:40:33] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-21 23:40:33] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-05-21 23:40:33] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-21 23:40:33] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 61/174 variables, 113/173 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 0/174 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 174/174 variables, and 173 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1552 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 113/113 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 1/113 variables, 34/45 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 11/56 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 61/174 variables, 113/173 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/174 variables, 60/233 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 0/174 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 174/174 variables, and 233 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1891 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 113/113 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 4/4 constraints]
After SMT, in 3453ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 3453ms
Starting structural reductions in LTL mode, iteration 1 : 113/114 places, 61/62 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3630 ms. Remains : 113/114 places, 61/62 transitions.
Stuttering acceptance computed with spot in 198 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), true, (NOT p1), (AND (NOT p3) (NOT p1))]
Running random walk in product with property : DES-PT-00a-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-00a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-00a-LTLFireability-13 finished in 3854 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(F(p1))))'
Support contains 4 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 62/62 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 113 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 113 transition count 61
Applied a total of 2 rules in 3 ms. Remains 113 /114 variables (removed 1) and now considering 61/62 (removed 1) transitions.
[2024-05-21 23:40:36] [INFO ] Invariant cache hit.
[2024-05-21 23:40:37] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-21 23:40:37] [INFO ] Invariant cache hit.
[2024-05-21 23:40:37] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-21 23:40:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 1/113 variables, 34/45 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 11/56 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-21 23:40:37] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-21 23:40:37] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:40:37] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-21 23:40:37] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 61/174 variables, 113/173 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 0/174 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 174/174 variables, and 173 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1596 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 113/113 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 1/113 variables, 34/45 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 11/56 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 61/174 variables, 113/173 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/174 variables, 60/233 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 0/174 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 174/174 variables, and 233 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1881 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 113/113 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 4/4 constraints]
After SMT, in 3486ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 3487ms
Starting structural reductions in LTL mode, iteration 1 : 113/114 places, 61/62 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3665 ms. Remains : 113/114 places, 61/62 transitions.
Stuttering acceptance computed with spot in 114 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-00a-LTLFireability-14
Product exploration explored 100000 steps with 18212 reset in 129 ms.
Product exploration explored 100000 steps with 18186 reset in 149 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 107 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 18 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 9 factoid took 146 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 p1), (NOT p1)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p1), (NOT p1)]
[2024-05-21 23:40:41] [INFO ] Invariant cache hit.
[2024-05-21 23:40:41] [INFO ] [Real]Absence check using 34 positive place invariants in 5 ms returned sat
[2024-05-21 23:40:41] [INFO ] [Real]Absence check using 34 positive and 22 generalized place invariants in 5 ms returned sat
[2024-05-21 23:40:41] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2024-05-21 23:40:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:40:41] [INFO ] [Nat]Absence check using 34 positive place invariants in 6 ms returned sat
[2024-05-21 23:40:41] [INFO ] [Nat]Absence check using 34 positive and 22 generalized place invariants in 5 ms returned sat
[2024-05-21 23:40:41] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2024-05-21 23:40:41] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:40:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2024-05-21 23:40:41] [INFO ] Computed and/alt/rep : 58/168/58 causal constraints (skipped 2 transitions) in 4 ms.
[2024-05-21 23:40:41] [INFO ] Added : 55 causal constraints over 11 iterations in 97 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 out of 113 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 113/113 places, 61/61 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 113 transition count 60
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 112 transition count 60
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 110 transition count 58
Applied a total of 6 rules in 9 ms. Remains 110 /113 variables (removed 3) and now considering 58/61 (removed 3) transitions.
// Phase 1: matrix 58 rows 110 cols
[2024-05-21 23:40:41] [INFO ] Computed 56 invariants in 2 ms
[2024-05-21 23:40:41] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-21 23:40:41] [INFO ] Invariant cache hit.
[2024-05-21 23:40:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 23:40:42] [INFO ] Implicit Places using invariants and state equation in 98 ms returned [28]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 171 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 109/113 places, 58/61 transitions.
Applied a total of 0 rules in 3 ms. Remains 109 /109 variables (removed 0) and now considering 58/58 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 183 ms. Remains : 109/113 places, 58/61 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 10 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-00a-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-00a-LTLFireability-14 finished in 5132 ms.
All properties solved by simple procedures.
Total runtime 125918 ms.

BK_STOP 1716334842168

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="DES-PT-00a"
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 DES-PT-00a, 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 r092-tall-171624189600604"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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