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.r268-smll-171654406700020.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 ParamProductionCell-PT-1, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r268-smll-171654406700020
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 752K
-rw-r--r-- 1 mcc users 8.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Apr 23 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 23 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K Apr 12 20:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 183K Apr 12 20:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Apr 12 20:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 112K Apr 12 20:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 174K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ParamProductionCell-PT-1-LTLFireability-00
FORMULA_NAME ParamProductionCell-PT-1-LTLFireability-01
FORMULA_NAME ParamProductionCell-PT-1-LTLFireability-02
FORMULA_NAME ParamProductionCell-PT-1-LTLFireability-03
FORMULA_NAME ParamProductionCell-PT-1-LTLFireability-04
FORMULA_NAME ParamProductionCell-PT-1-LTLFireability-05
FORMULA_NAME ParamProductionCell-PT-1-LTLFireability-06
FORMULA_NAME ParamProductionCell-PT-1-LTLFireability-07
FORMULA_NAME ParamProductionCell-PT-1-LTLFireability-08
FORMULA_NAME ParamProductionCell-PT-1-LTLFireability-09
FORMULA_NAME ParamProductionCell-PT-1-LTLFireability-10
FORMULA_NAME ParamProductionCell-PT-1-LTLFireability-11
FORMULA_NAME ParamProductionCell-PT-1-LTLFireability-12
FORMULA_NAME ParamProductionCell-PT-1-LTLFireability-13
FORMULA_NAME ParamProductionCell-PT-1-LTLFireability-14
FORMULA_NAME ParamProductionCell-PT-1-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716651726156

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ParamProductionCell-PT-1
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-25 15:42:08] [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-25 15:42:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 15:42:08] [INFO ] Load time of PNML (sax parser for PT used): 179 ms
[2024-05-25 15:42:08] [INFO ] Transformed 231 places.
[2024-05-25 15:42:08] [INFO ] Transformed 202 transitions.
[2024-05-25 15:42:08] [INFO ] Found NUPN structural information;
[2024-05-25 15:42:08] [INFO ] Parsed PT model containing 231 places and 202 transitions and 846 arcs in 400 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ParamProductionCell-PT-1-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 56 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 202/202 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 225 transition count 196
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 225 transition count 196
Applied a total of 12 rules in 92 ms. Remains 225 /231 variables (removed 6) and now considering 196/202 (removed 6) transitions.
// Phase 1: matrix 196 rows 225 cols
[2024-05-25 15:42:09] [INFO ] Computed 59 invariants in 45 ms
[2024-05-25 15:42:10] [INFO ] Implicit Places using invariants in 857 ms returned [1, 15, 16, 18, 19, 42, 46, 47, 59, 65, 73, 78, 79, 98, 114, 119, 159, 160, 162, 164, 165, 188, 190, 191, 194, 201]
Discarding 26 places :
Implicit Place search using SMT only with invariants took 923 ms to find 26 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 199/231 places, 196/202 transitions.
Applied a total of 0 rules in 20 ms. Remains 199 /199 variables (removed 0) and now considering 196/196 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1076 ms. Remains : 199/231 places, 196/202 transitions.
Support contains 56 out of 199 places after structural reductions.
[2024-05-25 15:42:10] [INFO ] Flatten gal took : 95 ms
[2024-05-25 15:42:10] [INFO ] Flatten gal took : 36 ms
[2024-05-25 15:42:10] [INFO ] Input system was already deterministic with 196 transitions.
Reduction of identical properties reduced properties to check from 31 to 30
RANDOM walk for 40000 steps (8 resets) in 2272 ms. (17 steps per ms) remains 5/30 properties
BEST_FIRST walk for 40003 steps (8 resets) in 312 ms. (127 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 392 ms. (101 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 275 ms. (144 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (8 resets) in 162 ms. (245 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (8 resets) in 92 ms. (430 steps per ms) remains 4/4 properties
// Phase 1: matrix 196 rows 199 cols
[2024-05-25 15:42:12] [INFO ] Computed 33 invariants in 7 ms
[2024-05-25 15:42:12] [INFO ] State equation strengthened by 68 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 116/125 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 29/154 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-25 15:42:12] [INFO ] Deduced a trap composed of 34 places in 91 ms of which 9 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 5/159 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp24 is UNSAT
At refinement iteration 9 (OVERLAPS) 19/178 variables, 10/25 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-25 15:42:12] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 4 ms to minimize.
[2024-05-25 15:42:12] [INFO ] Deduced a trap composed of 97 places in 86 ms of which 2 ms to minimize.
Problem AtomicPropp3 is UNSAT
[2024-05-25 15:42:12] [INFO ] Deduced a trap composed of 90 places in 89 ms of which 3 ms to minimize.
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp18 is UNSAT
After SMT solving in domain Real declared 178/395 variables, and 28 constraints, problems are : Problem set: 4 solved, 0 unsolved in 810 ms.
Refiners :[Positive P Invariants (semi-flows): 13/21 constraints, Generalized P Invariants (flows): 11/12 constraints, State Equation: 0/199 constraints, ReadFeed: 0/68 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 4/4 constraints]
After SMT, in 855ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 4 atomic propositions for a total of 12 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA ParamProductionCell-PT-1-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 199 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 199/199 places, 196/196 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 199 transition count 168
Reduce places removed 28 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 29 rules applied. Total rules applied 57 place count 171 transition count 167
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 58 place count 170 transition count 167
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 58 place count 170 transition count 156
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 80 place count 159 transition count 156
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 132 place count 133 transition count 130
Applied a total of 132 rules in 47 ms. Remains 133 /199 variables (removed 66) and now considering 130/196 (removed 66) transitions.
// Phase 1: matrix 130 rows 133 cols
[2024-05-25 15:42:13] [INFO ] Computed 33 invariants in 3 ms
[2024-05-25 15:42:13] [INFO ] Implicit Places using invariants in 220 ms returned [1, 5, 8, 11, 17, 20, 24, 36, 46, 51, 53, 64, 65, 66, 85, 114, 117, 119, 127]
[2024-05-25 15:42:13] [INFO ] Actually due to overlaps returned [51, 53, 8, 24, 36, 64, 65, 114, 119, 11, 17, 117, 127, 20, 66]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 222 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 118/199 places, 130/196 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 118 transition count 127
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 115 transition count 127
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 6 place count 115 transition count 121
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 18 place count 109 transition count 121
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 76 place count 80 transition count 92
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 78 place count 79 transition count 91
Applied a total of 78 rules in 42 ms. Remains 79 /118 variables (removed 39) and now considering 91/130 (removed 39) transitions.
// Phase 1: matrix 91 rows 79 cols
[2024-05-25 15:42:13] [INFO ] Computed 18 invariants in 1 ms
[2024-05-25 15:42:13] [INFO ] Implicit Places using invariants in 194 ms returned [0, 4, 31, 50]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 195 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 75/199 places, 91/196 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 74 transition count 90
Applied a total of 2 rules in 7 ms. Remains 74 /75 variables (removed 1) and now considering 90/91 (removed 1) transitions.
// Phase 1: matrix 90 rows 74 cols
[2024-05-25 15:42:13] [INFO ] Computed 14 invariants in 0 ms
[2024-05-25 15:42:13] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-25 15:42:13] [INFO ] Invariant cache hit.
[2024-05-25 15:42:14] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-25 15:42:14] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 74/199 places, 90/196 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 775 ms. Remains : 74/199 places, 90/196 transitions.
Stuttering acceptance computed with spot in 360 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-1-LTLFireability-00
Product exploration explored 100000 steps with 1498 reset in 527 ms.
Product exploration explored 100000 steps with 1532 reset in 355 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 114 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 94 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 120 steps (0 resets) in 4 ms. (24 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 108 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 90/90 transitions.
Applied a total of 0 rules in 8 ms. Remains 74 /74 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2024-05-25 15:42:15] [INFO ] Invariant cache hit.
[2024-05-25 15:42:16] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-05-25 15:42:16] [INFO ] Invariant cache hit.
[2024-05-25 15:42:16] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-25 15:42:16] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 410 ms to find 0 implicit places.
[2024-05-25 15:42:16] [INFO ] Redundant transitions in 2 ms returned []
Running 89 sub problems to find dead transitions.
[2024-05-25 15:42:16] [INFO ] Invariant cache hit.
[2024-05-25 15:42:16] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-25 15:42:16] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 3 ms to minimize.
[2024-05-25 15:42:16] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 1 ms to minimize.
[2024-05-25 15:42:16] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-25 15:42:17] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 2 ms to minimize.
[2024-05-25 15:42:17] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2024-05-25 15:42:17] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 1 ms to minimize.
[2024-05-25 15:42:17] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
[2024-05-25 15:42:17] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 2 ms to minimize.
[2024-05-25 15:42:17] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
[2024-05-25 15:42:17] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-05-25 15:42:17] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 2 ms to minimize.
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
[2024-05-25 15:42:17] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-05-25 15:42:17] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2024-05-25 15:42:17] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 2 ms to minimize.
Problem TDEAD18 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
[2024-05-25 15:42:17] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-05-25 15:42:17] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 1 ms to minimize.
[2024-05-25 15:42:17] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-25 15:42:17] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
[2024-05-25 15:42:17] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-05-25 15:42:17] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 2 ms to minimize.
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 20/34 constraints. Problems are: Problem set: 18 solved, 71 unsolved
[2024-05-25 15:42:18] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
Problem TDEAD50 is UNSAT
[2024-05-25 15:42:18] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-25 15:42:18] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
Problem TDEAD65 is UNSAT
[2024-05-25 15:42:18] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 2 ms to minimize.
[2024-05-25 15:42:18] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 2 ms to minimize.
Problem TDEAD71 is UNSAT
Problem TDEAD73 is UNSAT
[2024-05-25 15:42:18] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 2 ms to minimize.
[2024-05-25 15:42:18] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-25 15:42:18] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 2 ms to minimize.
Problem TDEAD80 is UNSAT
Problem TDEAD85 is UNSAT
[2024-05-25 15:42:18] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 9/43 constraints. Problems are: Problem set: 24 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/43 constraints. Problems are: Problem set: 24 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 90/164 variables, 74/117 constraints. Problems are: Problem set: 24 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 67/184 constraints. Problems are: Problem set: 24 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 0/184 constraints. Problems are: Problem set: 24 solved, 65 unsolved
At refinement iteration 7 (OVERLAPS) 0/164 variables, 0/184 constraints. Problems are: Problem set: 24 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 164/164 variables, and 184 constraints, problems are : Problem set: 24 solved, 65 unsolved in 3552 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 74/74 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 24 solved, 65 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 11/11 constraints. Problems are: Problem set: 24 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 15/26 constraints. Problems are: Problem set: 24 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/26 constraints. Problems are: Problem set: 24 solved, 65 unsolved
At refinement iteration 3 (OVERLAPS) 8/74 variables, 3/29 constraints. Problems are: Problem set: 24 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 14/43 constraints. Problems are: Problem set: 24 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 0/43 constraints. Problems are: Problem set: 24 solved, 65 unsolved
At refinement iteration 6 (OVERLAPS) 90/164 variables, 74/117 constraints. Problems are: Problem set: 24 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 67/184 constraints. Problems are: Problem set: 24 solved, 65 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 65/249 constraints. Problems are: Problem set: 24 solved, 65 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/164 variables, 0/249 constraints. Problems are: Problem set: 24 solved, 65 unsolved
At refinement iteration 10 (OVERLAPS) 0/164 variables, 0/249 constraints. Problems are: Problem set: 24 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 164/164 variables, and 249 constraints, problems are : Problem set: 24 solved, 65 unsolved in 3500 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 74/74 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 65/89 constraints, Known Traps: 29/29 constraints]
After SMT, in 7124ms problems are : Problem set: 24 solved, 65 unsolved
Search for dead transitions found 24 dead transitions in 7129ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 74/74 places, 66/90 transitions.
Graph (complete) has 211 edges and 74 vertex of which 66 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 15 ms. Remains 66 /74 variables (removed 8) and now considering 66/66 (removed 0) transitions.
// Phase 1: matrix 66 rows 66 cols
[2024-05-25 15:42:23] [INFO ] Computed 14 invariants in 1 ms
[2024-05-25 15:42:23] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-25 15:42:23] [INFO ] Invariant cache hit.
[2024-05-25 15:42:23] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-05-25 15:42:23] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 66/74 places, 66/90 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7802 ms. Remains : 66/74 places, 66/90 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 120 steps (0 resets) in 5 ms. (20 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 132 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 93 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 178 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1542 reset in 161 ms.
Product exploration explored 100000 steps with 1505 reset in 125 ms.
Built C files in :
/tmp/ltsmin8964912178722174473
[2024-05-25 15:42:24] [INFO ] Computing symmetric may disable matrix : 66 transitions.
[2024-05-25 15:42:24] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:42:24] [INFO ] Computing symmetric may enable matrix : 66 transitions.
[2024-05-25 15:42:24] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:42:24] [INFO ] Computing Do-Not-Accords matrix : 66 transitions.
[2024-05-25 15:42:24] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:42:24] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8964912178722174473
Running compilation step : cd /tmp/ltsmin8964912178722174473;'/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 720 ms.
Running link step : cd /tmp/ltsmin8964912178722174473;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 75 ms.
Running LTSmin : cd /tmp/ltsmin8964912178722174473;'/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/stateBased9046985842038549271.hoa' '--buchi-type=spotba'
LTSmin run took 353 ms.
FORMULA ParamProductionCell-PT-1-LTLFireability-00 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-1-LTLFireability-00 finished in 12655 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((X(F(p0)) U p1)))'
Support contains 4 out of 199 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 199/199 places, 196/196 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 199 transition count 167
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 58 place count 170 transition count 167
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 58 place count 170 transition count 156
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 80 place count 159 transition count 156
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 128 place count 135 transition count 132
Applied a total of 128 rules in 17 ms. Remains 135 /199 variables (removed 64) and now considering 132/196 (removed 64) transitions.
// Phase 1: matrix 132 rows 135 cols
[2024-05-25 15:42:25] [INFO ] Computed 33 invariants in 2 ms
[2024-05-25 15:42:26] [INFO ] Implicit Places using invariants in 221 ms returned [5, 11, 17, 20, 21, 24, 35, 47, 52, 54, 65, 66, 67, 86, 116, 119, 121, 129]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 223 ms to find 18 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 117/199 places, 132/196 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 117 transition count 129
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 114 transition count 129
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 6 place count 114 transition count 127
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 112 transition count 127
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 68 place count 83 transition count 98
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 70 place count 82 transition count 97
Applied a total of 70 rules in 13 ms. Remains 82 /117 variables (removed 35) and now considering 97/132 (removed 35) transitions.
// Phase 1: matrix 97 rows 82 cols
[2024-05-25 15:42:26] [INFO ] Computed 15 invariants in 6 ms
[2024-05-25 15:42:26] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-05-25 15:42:26] [INFO ] Invariant cache hit.
[2024-05-25 15:42:26] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-25 15:42:26] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 82/199 places, 97/196 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 615 ms. Remains : 82/199 places, 97/196 transitions.
Stuttering acceptance computed with spot in 172 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-1-LTLFireability-03
Product exploration explored 100000 steps with 0 reset in 158 ms.
Stack based approach found an accepted trace after 72 steps with 0 reset with depth 73 and stack size 73 in 0 ms.
FORMULA ParamProductionCell-PT-1-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-1-LTLFireability-03 finished in 970 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0 U G((p1||(G(p3)&&p2))))) U G(p4)))'
Support contains 10 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 196/196 transitions.
Applied a total of 0 rules in 2 ms. Remains 199 /199 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 199 cols
[2024-05-25 15:42:26] [INFO ] Computed 33 invariants in 5 ms
[2024-05-25 15:42:27] [INFO ] Implicit Places using invariants in 262 ms returned [26, 30, 31, 36, 55, 85, 87, 101, 103, 179, 190]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 267 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 188/199 places, 196/196 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 186 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 186 transition count 194
Applied a total of 4 rules in 7 ms. Remains 186 /188 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 186 cols
[2024-05-25 15:42:27] [INFO ] Computed 22 invariants in 2 ms
[2024-05-25 15:42:27] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-05-25 15:42:27] [INFO ] Invariant cache hit.
[2024-05-25 15:42:27] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-25 15:42:27] [INFO ] Implicit Places using invariants and state equation in 456 ms returned []
Implicit Place search using SMT with State Equation took 614 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 186/199 places, 194/196 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 891 ms. Remains : 186/199 places, 194/196 transitions.
Stuttering acceptance computed with spot in 766 ms :[(NOT p4), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p1) (NOT p3) (NOT p4))), true, (NOT p3), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (OR (AND p2 p3 (NOT p4)) (AND p0 (NOT p4)) (AND p1 (NOT p4))), (OR (AND p1 (NOT p3) (NOT p4)) (AND p0 (NOT p3) (NOT p4))), (OR (AND p0 (NOT p1) (NOT p3) (NOT p4)) (AND p0 (NOT p1) (NOT p2) (NOT p4))), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : ParamProductionCell-PT-1-LTLFireability-05
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-1-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-1-LTLFireability-05 finished in 1713 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||(G(p1) U X((p2 U p3)))))'
Support contains 6 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 196/196 transitions.
Applied a total of 0 rules in 4 ms. Remains 199 /199 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 199 cols
[2024-05-25 15:42:28] [INFO ] Computed 33 invariants in 2 ms
[2024-05-25 15:42:28] [INFO ] Implicit Places using invariants in 260 ms returned [19, 26, 31, 36, 55, 85, 87, 99, 101, 103, 170, 175, 179, 190]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 264 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 185/199 places, 196/196 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 183 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 183 transition count 194
Applied a total of 4 rules in 7 ms. Remains 183 /185 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 183 cols
[2024-05-25 15:42:28] [INFO ] Computed 19 invariants in 2 ms
[2024-05-25 15:42:29] [INFO ] Implicit Places using invariants in 152 ms returned []
[2024-05-25 15:42:29] [INFO ] Invariant cache hit.
[2024-05-25 15:42:29] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-25 15:42:29] [INFO ] Implicit Places using invariants and state equation in 481 ms returned []
Implicit Place search using SMT with State Equation took 641 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 183/199 places, 194/196 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 916 ms. Remains : 183/199 places, 194/196 transitions.
Stuttering acceptance computed with spot in 282 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ParamProductionCell-PT-1-LTLFireability-06
Product exploration explored 100000 steps with 2380 reset in 181 ms.
Product exploration explored 100000 steps with 2380 reset in 368 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (X (NOT p2)), (X (NOT p3)), (X (AND (NOT p0) (NOT p3) (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p3)))), (X (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3) p2))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (AND (NOT p0) (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p3))))), (X (X (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 122 ms. Reduced automaton from 5 states, 11 edges and 4 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 164 steps (0 resets) in 4 ms. (32 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (X (NOT p2)), (X (NOT p3)), (X (AND (NOT p0) (NOT p3) (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p3)))), (X (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3) p2))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (AND (NOT p0) (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p3))))), (X (X (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 23 factoid took 164 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-25 15:42:31] [INFO ] Invariant cache hit.
[2024-05-25 15:42:31] [INFO ] [Real]Absence check using 19 positive place invariants in 15 ms returned sat
[2024-05-25 15:42:31] [INFO ] [Real]Absence check using state equation in 361 ms returned sat
[2024-05-25 15:42:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:42:31] [INFO ] [Nat]Absence check using 19 positive place invariants in 14 ms returned sat
[2024-05-25 15:42:32] [INFO ] [Nat]Absence check using state equation in 241 ms returned sat
[2024-05-25 15:42:32] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-25 15:42:32] [INFO ] [Nat]Added 68 Read/Feed constraints in 49 ms returned sat
[2024-05-25 15:42:32] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 2 ms to minimize.
[2024-05-25 15:42:32] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 2 ms to minimize.
[2024-05-25 15:42:32] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 2 ms to minimize.
[2024-05-25 15:42:32] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 3 ms to minimize.
[2024-05-25 15:42:32] [INFO ] Deduced a trap composed of 7 places in 124 ms of which 3 ms to minimize.
[2024-05-25 15:42:32] [INFO ] Deduced a trap composed of 7 places in 113 ms of which 3 ms to minimize.
[2024-05-25 15:42:32] [INFO ] Deduced a trap composed of 12 places in 115 ms of which 3 ms to minimize.
[2024-05-25 15:42:33] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 3 ms to minimize.
[2024-05-25 15:42:33] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 2 ms to minimize.
[2024-05-25 15:42:33] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-05-25 15:42:33] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-05-25 15:42:33] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 2 ms to minimize.
[2024-05-25 15:42:33] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1205 ms
[2024-05-25 15:42:33] [INFO ] Computed and/alt/rep : 193/308/193 causal constraints (skipped 0 transitions) in 16 ms.
[2024-05-25 15:42:34] [INFO ] Added : 186 causal constraints over 38 iterations in 926 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 183 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 183/183 places, 194/194 transitions.
Applied a total of 0 rules in 2 ms. Remains 183 /183 variables (removed 0) and now considering 194/194 (removed 0) transitions.
[2024-05-25 15:42:34] [INFO ] Invariant cache hit.
[2024-05-25 15:42:34] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-05-25 15:42:34] [INFO ] Invariant cache hit.
[2024-05-25 15:42:34] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-25 15:42:34] [INFO ] Implicit Places using invariants and state equation in 342 ms returned []
Implicit Place search using SMT with State Equation took 474 ms to find 0 implicit places.
Running 193 sub problems to find dead transitions.
[2024-05-25 15:42:34] [INFO ] Invariant cache hit.
[2024-05-25 15:42:34] [INFO ] State equation strengthened by 68 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-25 15:42:36] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 3 ms to minimize.
[2024-05-25 15:42:36] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 3 ms to minimize.
[2024-05-25 15:42:36] [INFO ] Deduced a trap composed of 7 places in 131 ms of which 2 ms to minimize.
[2024-05-25 15:42:36] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 2 ms to minimize.
[2024-05-25 15:42:36] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 3 ms to minimize.
[2024-05-25 15:42:36] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 3 ms to minimize.
[2024-05-25 15:42:36] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 2 ms to minimize.
[2024-05-25 15:42:36] [INFO ] Deduced a trap composed of 28 places in 95 ms of which 2 ms to minimize.
[2024-05-25 15:42:36] [INFO ] Deduced a trap composed of 41 places in 120 ms of which 2 ms to minimize.
[2024-05-25 15:42:37] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 1 ms to minimize.
[2024-05-25 15:42:37] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-25 15:42:37] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 2 ms to minimize.
[2024-05-25 15:42:37] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 2 ms to minimize.
[2024-05-25 15:42:37] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 1 ms to minimize.
[2024-05-25 15:42:37] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 2 ms to minimize.
[2024-05-25 15:42:37] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
[2024-05-25 15:42:38] [INFO ] Deduced a trap composed of 48 places in 54 ms of which 2 ms to minimize.
[2024-05-25 15:42:38] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 2 ms to minimize.
[2024-05-25 15:42:38] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-05-25 15:42:38] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/182 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-25 15:42:38] [INFO ] Deduced a trap composed of 41 places in 108 ms of which 3 ms to minimize.
[2024-05-25 15:42:38] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 2 ms to minimize.
[2024-05-25 15:42:39] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 2 ms to minimize.
[2024-05-25 15:42:39] [INFO ] Deduced a trap composed of 41 places in 83 ms of which 2 ms to minimize.
[2024-05-25 15:42:39] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 3 ms to minimize.
[2024-05-25 15:42:39] [INFO ] Deduced a trap composed of 40 places in 84 ms of which 2 ms to minimize.
[2024-05-25 15:42:39] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 3 ms to minimize.
[2024-05-25 15:42:39] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 2 ms to minimize.
[2024-05-25 15:42:40] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 2 ms to minimize.
[2024-05-25 15:42:40] [INFO ] Deduced a trap composed of 38 places in 84 ms of which 3 ms to minimize.
[2024-05-25 15:42:40] [INFO ] Deduced a trap composed of 22 places in 92 ms of which 2 ms to minimize.
[2024-05-25 15:42:40] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
[2024-05-25 15:42:40] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 2 ms to minimize.
[2024-05-25 15:42:40] [INFO ] Deduced a trap composed of 32 places in 131 ms of which 3 ms to minimize.
[2024-05-25 15:42:40] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 2 ms to minimize.
[2024-05-25 15:42:40] [INFO ] Deduced a trap composed of 35 places in 65 ms of which 2 ms to minimize.
[2024-05-25 15:42:41] [INFO ] Deduced a trap composed of 39 places in 86 ms of which 1 ms to minimize.
[2024-05-25 15:42:41] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 18/56 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-25 15:42:42] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 2 ms to minimize.
[2024-05-25 15:42:42] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 2 ms to minimize.
[2024-05-25 15:42:42] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/183 variables, 1/60 constraints. Problems are: Problem set: 24 solved, 169 unsolved
[2024-05-25 15:42:45] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
[2024-05-25 15:42:46] [INFO ] Deduced a trap composed of 56 places in 86 ms of which 2 ms to minimize.
[2024-05-25 15:42:46] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 2 ms to minimize.
Problem TDEAD92 is UNSAT
[2024-05-25 15:42:46] [INFO ] Deduced a trap composed of 80 places in 75 ms of which 2 ms to minimize.
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD144 is UNSAT
[2024-05-25 15:42:47] [INFO ] Deduced a trap composed of 78 places in 86 ms of which 2 ms to minimize.
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 5/65 constraints. Problems are: Problem set: 32 solved, 161 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 0/65 constraints. Problems are: Problem set: 32 solved, 161 unsolved
At refinement iteration 8 (OVERLAPS) 194/377 variables, 183/248 constraints. Problems are: Problem set: 32 solved, 161 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/377 variables, 68/316 constraints. Problems are: Problem set: 32 solved, 161 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/377 variables, 0/316 constraints. Problems are: Problem set: 32 solved, 161 unsolved
At refinement iteration 11 (OVERLAPS) 0/377 variables, 0/316 constraints. Problems are: Problem set: 32 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Real declared 377/377 variables, and 316 constraints, problems are : Problem set: 32 solved, 161 unsolved in 24212 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 183/183 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 32 solved, 161 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 11/11 constraints. Problems are: Problem set: 32 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 14/25 constraints. Problems are: Problem set: 32 solved, 161 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/25 constraints. Problems are: Problem set: 32 solved, 161 unsolved
At refinement iteration 3 (OVERLAPS) 17/183 variables, 8/33 constraints. Problems are: Problem set: 32 solved, 161 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 32/65 constraints. Problems are: Problem set: 32 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 0/65 constraints. Problems are: Problem set: 32 solved, 161 unsolved
At refinement iteration 6 (OVERLAPS) 194/377 variables, 183/248 constraints. Problems are: Problem set: 32 solved, 161 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/377 variables, 68/316 constraints. Problems are: Problem set: 32 solved, 161 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/377 variables, 161/477 constraints. Problems are: Problem set: 32 solved, 161 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/377 variables, 0/477 constraints. Problems are: Problem set: 32 solved, 161 unsolved
At refinement iteration 10 (OVERLAPS) 0/377 variables, 0/477 constraints. Problems are: Problem set: 32 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Int declared 377/377 variables, and 477 constraints, problems are : Problem set: 32 solved, 161 unsolved in 17111 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 183/183 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 161/193 constraints, Known Traps: 46/46 constraints]
After SMT, in 41364ms problems are : Problem set: 32 solved, 161 unsolved
Search for dead transitions found 32 dead transitions in 41369ms
Found 32 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 32 transitions
Dead transitions reduction (with SMT) removed 32 transitions
Starting structural reductions in LTL mode, iteration 1 : 183/183 places, 162/194 transitions.
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 167 transition count 162
Applied a total of 16 rules in 2 ms. Remains 167 /183 variables (removed 16) and now considering 162/162 (removed 0) transitions.
// Phase 1: matrix 162 rows 167 cols
[2024-05-25 15:43:16] [INFO ] Computed 19 invariants in 0 ms
[2024-05-25 15:43:16] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-05-25 15:43:16] [INFO ] Invariant cache hit.
[2024-05-25 15:43:16] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-05-25 15:43:16] [INFO ] Implicit Places using invariants and state equation in 408 ms returned []
Implicit Place search using SMT with State Equation took 527 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 167/183 places, 162/194 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42376 ms. Remains : 167/183 places, 162/194 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 111 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 164 steps (0 resets) in 6 ms. (23 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 111 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-25 15:43:17] [INFO ] Invariant cache hit.
[2024-05-25 15:43:17] [INFO ] [Real]Absence check using 19 positive place invariants in 14 ms returned sat
[2024-05-25 15:43:17] [INFO ] [Real]Absence check using state equation in 201 ms returned sat
[2024-05-25 15:43:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:43:17] [INFO ] [Nat]Absence check using 19 positive place invariants in 10 ms returned sat
[2024-05-25 15:43:18] [INFO ] [Nat]Absence check using state equation in 180 ms returned sat
[2024-05-25 15:43:18] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-05-25 15:43:18] [INFO ] [Nat]Added 48 Read/Feed constraints in 15 ms returned sat
[2024-05-25 15:43:18] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 2 ms to minimize.
[2024-05-25 15:43:18] [INFO ] Deduced a trap composed of 5 places in 82 ms of which 2 ms to minimize.
[2024-05-25 15:43:18] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 3 ms to minimize.
[2024-05-25 15:43:18] [INFO ] Deduced a trap composed of 17 places in 137 ms of which 4 ms to minimize.
[2024-05-25 15:43:18] [INFO ] Deduced a trap composed of 7 places in 123 ms of which 3 ms to minimize.
[2024-05-25 15:43:18] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 3 ms to minimize.
[2024-05-25 15:43:18] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 3 ms to minimize.
[2024-05-25 15:43:19] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 3 ms to minimize.
[2024-05-25 15:43:19] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
[2024-05-25 15:43:19] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-25 15:43:19] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 2 ms to minimize.
[2024-05-25 15:43:19] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 2 ms to minimize.
[2024-05-25 15:43:19] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 2 ms to minimize.
[2024-05-25 15:43:19] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 2 ms to minimize.
[2024-05-25 15:43:19] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 2 ms to minimize.
[2024-05-25 15:43:19] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1509 ms
[2024-05-25 15:43:19] [INFO ] Computed and/alt/rep : 161/196/161 causal constraints (skipped 0 transitions) in 13 ms.
[2024-05-25 15:43:20] [INFO ] Added : 161 causal constraints over 33 iterations in 630 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2380 reset in 115 ms.
Product exploration explored 100000 steps with 2380 reset in 187 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 167 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 167/167 places, 162/162 transitions.
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 167 transition count 162
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 14 Pre rules applied. Total rules applied 37 place count 167 transition count 162
Deduced a syphon composed of 51 places in 0 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 51 place count 167 transition count 162
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 62 place count 156 transition count 151
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 73 place count 156 transition count 151
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 77 places in 0 ms
Iterating global reduction 1 with 37 rules applied. Total rules applied 110 place count 156 transition count 151
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 137 place count 129 transition count 124
Deduced a syphon composed of 50 places in 0 ms
Iterating global reduction 1 with 27 rules applied. Total rules applied 164 place count 129 transition count 124
Deduced a syphon composed of 50 places in 0 ms
Applied a total of 164 rules in 66 ms. Remains 129 /167 variables (removed 38) and now considering 124/162 (removed 38) transitions.
[2024-05-25 15:43:21] [INFO ] Redundant transitions in 5 ms returned []
Running 123 sub problems to find dead transitions.
// Phase 1: matrix 124 rows 129 cols
[2024-05-25 15:43:21] [INFO ] Computed 19 invariants in 1 ms
[2024-05-25 15:43:21] [INFO ] State equation strengthened by 48 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-25 15:43:22] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 3 ms to minimize.
[2024-05-25 15:43:22] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 2 ms to minimize.
[2024-05-25 15:43:22] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 2 ms to minimize.
[2024-05-25 15:43:22] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-25 15:43:22] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 2 ms to minimize.
[2024-05-25 15:43:22] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 2 ms to minimize.
[2024-05-25 15:43:22] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2024-05-25 15:43:22] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 2 ms to minimize.
[2024-05-25 15:43:22] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 2 ms to minimize.
[2024-05-25 15:43:22] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-05-25 15:43:22] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-25 15:43:22] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
Problem TDEAD2 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD18 is UNSAT
[2024-05-25 15:43:22] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD26 is UNSAT
[2024-05-25 15:43:22] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 2 ms to minimize.
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
[2024-05-25 15:43:22] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
Problem TDEAD33 is UNSAT
Problem TDEAD36 is UNSAT
[2024-05-25 15:43:22] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
Problem TDEAD38 is UNSAT
Problem TDEAD41 is UNSAT
[2024-05-25 15:43:23] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 2 ms to minimize.
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
[2024-05-25 15:43:23] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 2 ms to minimize.
Problem TDEAD48 is UNSAT
[2024-05-25 15:43:23] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 2 ms to minimize.
[2024-05-25 15:43:23] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 20/38 constraints. Problems are: Problem set: 44 solved, 79 unsolved
[2024-05-25 15:43:23] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-25 15:43:23] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-05-25 15:43:23] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
[2024-05-25 15:43:23] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 2 ms to minimize.
[2024-05-25 15:43:23] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 2 ms to minimize.
[2024-05-25 15:43:23] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-05-25 15:43:23] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 2 ms to minimize.
[2024-05-25 15:43:23] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 2 ms to minimize.
[2024-05-25 15:43:23] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-05-25 15:43:23] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 10/48 constraints. Problems are: Problem set: 46 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/48 constraints. Problems are: Problem set: 46 solved, 77 unsolved
At refinement iteration 4 (OVERLAPS) 1/129 variables, 1/49 constraints. Problems are: Problem set: 46 solved, 77 unsolved
[2024-05-25 15:43:24] [INFO ] Deduced a trap composed of 37 places in 66 ms of which 2 ms to minimize.
[2024-05-25 15:43:24] [INFO ] Deduced a trap composed of 6 places in 80 ms of which 2 ms to minimize.
[2024-05-25 15:43:24] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 2 ms to minimize.
Problem TDEAD63 is UNSAT
Problem TDEAD66 is UNSAT
[2024-05-25 15:43:25] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 2 ms to minimize.
Problem TDEAD74 is UNSAT
Problem TDEAD89 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 4/53 constraints. Problems are: Problem set: 50 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/53 constraints. Problems are: Problem set: 50 solved, 73 unsolved
At refinement iteration 7 (OVERLAPS) 124/253 variables, 129/182 constraints. Problems are: Problem set: 50 solved, 73 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/253 variables, 48/230 constraints. Problems are: Problem set: 50 solved, 73 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/253 variables, 0/230 constraints. Problems are: Problem set: 50 solved, 73 unsolved
At refinement iteration 10 (OVERLAPS) 0/253 variables, 0/230 constraints. Problems are: Problem set: 50 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 253/253 variables, and 230 constraints, problems are : Problem set: 50 solved, 73 unsolved in 5895 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 129/129 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 50 solved, 73 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 10/10 constraints. Problems are: Problem set: 50 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 32/42 constraints. Problems are: Problem set: 50 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/42 constraints. Problems are: Problem set: 50 solved, 73 unsolved
At refinement iteration 3 (OVERLAPS) 51/129 variables, 9/51 constraints. Problems are: Problem set: 50 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 2/53 constraints. Problems are: Problem set: 50 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/53 constraints. Problems are: Problem set: 50 solved, 73 unsolved
At refinement iteration 6 (OVERLAPS) 124/253 variables, 129/182 constraints. Problems are: Problem set: 50 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/253 variables, 48/230 constraints. Problems are: Problem set: 50 solved, 73 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/253 variables, 73/303 constraints. Problems are: Problem set: 50 solved, 73 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/253 variables, 0/303 constraints. Problems are: Problem set: 50 solved, 73 unsolved
At refinement iteration 10 (OVERLAPS) 0/253 variables, 0/303 constraints. Problems are: Problem set: 50 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 253/253 variables, and 303 constraints, problems are : Problem set: 50 solved, 73 unsolved in 3688 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 129/129 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 73/123 constraints, Known Traps: 34/34 constraints]
After SMT, in 9617ms problems are : Problem set: 50 solved, 73 unsolved
Search for dead transitions found 50 dead transitions in 9622ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 129/167 places, 74/162 transitions.
Graph (complete) has 240 edges and 129 vertex of which 79 are kept as prefixes of interest. Removing 50 places using SCC suffix rule.1 ms
Discarding 50 places :
Also discarding 0 output transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 79 transition count 74
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 79 transition count 74
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 3 rules in 7 ms. Remains 79 /129 variables (removed 50) and now considering 74/74 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 79/167 places, 74/162 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 9712 ms. Remains : 79/167 places, 74/162 transitions.
Built C files in :
/tmp/ltsmin11516607615571039344
[2024-05-25 15:43:30] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11516607615571039344
Running compilation step : cd /tmp/ltsmin11516607615571039344;'/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 478 ms.
Running link step : cd /tmp/ltsmin11516607615571039344;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin11516607615571039344;'/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/stateBased1113182158006770744.hoa' '--buchi-type=spotba'
LTSmin run took 305 ms.
FORMULA ParamProductionCell-PT-1-LTLFireability-06 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-1-LTLFireability-06 finished in 63137 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 U p2)))&&p0)))'
Support contains 5 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 196/196 transitions.
Applied a total of 0 rules in 3 ms. Remains 199 /199 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 199 cols
[2024-05-25 15:43:31] [INFO ] Computed 33 invariants in 2 ms
[2024-05-25 15:43:32] [INFO ] Implicit Places using invariants in 294 ms returned [19, 26, 30, 31, 36, 55, 85, 87, 99, 103, 170, 175, 179, 190]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 296 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 185/199 places, 196/196 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 183 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 183 transition count 194
Applied a total of 4 rules in 6 ms. Remains 183 /185 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 183 cols
[2024-05-25 15:43:32] [INFO ] Computed 19 invariants in 2 ms
[2024-05-25 15:43:32] [INFO ] Implicit Places using invariants in 141 ms returned []
[2024-05-25 15:43:32] [INFO ] Invariant cache hit.
[2024-05-25 15:43:32] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-25 15:43:32] [INFO ] Implicit Places using invariants and state equation in 532 ms returned []
Implicit Place search using SMT with State Equation took 677 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 183/199 places, 194/196 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 982 ms. Remains : 183/199 places, 194/196 transitions.
Stuttering acceptance computed with spot in 212 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, (NOT p2), (NOT p2)]
Running random walk in product with property : ParamProductionCell-PT-1-LTLFireability-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-1-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-1-LTLFireability-07 finished in 1221 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||X((G((X(!p1) U ((!p2&&X(!p1))||X(G(!p1)))))||(F(!p3)&&(X(!p1) U ((!p2&&X(!p1))||X(G(!p1))))))))))'
Support contains 9 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 196/196 transitions.
Applied a total of 0 rules in 4 ms. Remains 199 /199 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 199 cols
[2024-05-25 15:43:33] [INFO ] Computed 33 invariants in 1 ms
[2024-05-25 15:43:33] [INFO ] Implicit Places using invariants in 164 ms returned [19, 26, 30, 31, 36, 87, 99, 101, 170, 175, 190]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 168 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 188/199 places, 196/196 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 186 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 186 transition count 194
Applied a total of 4 rules in 8 ms. Remains 186 /188 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 186 cols
[2024-05-25 15:43:33] [INFO ] Computed 22 invariants in 2 ms
[2024-05-25 15:43:33] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-05-25 15:43:33] [INFO ] Invariant cache hit.
[2024-05-25 15:43:33] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-25 15:43:33] [INFO ] Implicit Places using invariants and state equation in 447 ms returned []
Implicit Place search using SMT with State Equation took 570 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 186/199 places, 194/196 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 750 ms. Remains : 186/199 places, 194/196 transitions.
Stuttering acceptance computed with spot in 836 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, (AND (NOT p0) p1), p1, (AND p1 p3), p1, (AND (NOT p0) p1), (AND (NOT p0) p1 p3), (AND (NOT p0) p1), true, (AND p3 p1), (AND p1 p3), (NOT p0), (AND p3 (NOT p0) p1), p3, (AND p3 (NOT p0) (NOT p1))]
Running random walk in product with property : ParamProductionCell-PT-1-LTLFireability-09
Product exploration explored 100000 steps with 25000 reset in 143 ms.
Product exploration explored 100000 steps with 25000 reset in 168 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p3) (NOT p2) (NOT p1)), (X p0), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p0 p3)))), (X (X p0)), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) p3))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 124 ms. Reduced automaton from 17 states, 42 edges and 4 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 220 ms :[true, (AND (NOT p0) p1), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
RANDOM walk for 40000 steps (8 resets) in 195 ms. (204 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 170 ms. (233 steps per ms) remains 1/1 properties
[2024-05-25 15:43:35] [INFO ] Invariant cache hit.
[2024-05-25 15:43:35] [INFO ] State equation strengthened by 68 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Real declared 145/380 variables, and 8 constraints, problems are : Problem set: 1 solved, 0 unsolved in 61 ms.
Refiners :[Positive P Invariants (semi-flows): 8/20 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/186 constraints, ReadFeed: 0/68 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 68ms 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 p3) (NOT p2) (NOT p1)), (X p0), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p0 p3)))), (X (X p0)), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) p3)))), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT p0))]
Knowledge based reduction with 10 factoid took 227 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 268 ms :[true, (AND p1 (NOT p0)), (NOT p0), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 272 ms :[true, (AND p1 (NOT p0)), (NOT p0), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Support contains 5 out of 186 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 194/194 transitions.
Applied a total of 0 rules in 9 ms. Remains 186 /186 variables (removed 0) and now considering 194/194 (removed 0) transitions.
[2024-05-25 15:43:36] [INFO ] Invariant cache hit.
[2024-05-25 15:43:36] [INFO ] Implicit Places using invariants in 330 ms returned []
[2024-05-25 15:43:36] [INFO ] Invariant cache hit.
[2024-05-25 15:43:36] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-25 15:43:37] [INFO ] Implicit Places using invariants and state equation in 498 ms returned []
Implicit Place search using SMT with State Equation took 832 ms to find 0 implicit places.
Running 193 sub problems to find dead transitions.
[2024-05-25 15:43:37] [INFO ] Invariant cache hit.
[2024-05-25 15:43:37] [INFO ] State equation strengthened by 68 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-25 15:43:38] [INFO ] Deduced a trap composed of 5 places in 115 ms of which 3 ms to minimize.
[2024-05-25 15:43:38] [INFO ] Deduced a trap composed of 11 places in 128 ms of which 3 ms to minimize.
[2024-05-25 15:43:39] [INFO ] Deduced a trap composed of 7 places in 123 ms of which 3 ms to minimize.
[2024-05-25 15:43:39] [INFO ] Deduced a trap composed of 26 places in 124 ms of which 2 ms to minimize.
[2024-05-25 15:43:39] [INFO ] Deduced a trap composed of 17 places in 100 ms of which 2 ms to minimize.
[2024-05-25 15:43:39] [INFO ] Deduced a trap composed of 39 places in 95 ms of which 3 ms to minimize.
[2024-05-25 15:43:39] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 2 ms to minimize.
[2024-05-25 15:43:39] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 2 ms to minimize.
[2024-05-25 15:43:39] [INFO ] Deduced a trap composed of 37 places in 78 ms of which 2 ms to minimize.
[2024-05-25 15:43:39] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 2 ms to minimize.
[2024-05-25 15:43:40] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 2 ms to minimize.
[2024-05-25 15:43:40] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 2 ms to minimize.
[2024-05-25 15:43:40] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 3 ms to minimize.
[2024-05-25 15:43:40] [INFO ] Deduced a trap composed of 43 places in 100 ms of which 3 ms to minimize.
[2024-05-25 15:43:40] [INFO ] Deduced a trap composed of 39 places in 103 ms of which 3 ms to minimize.
[2024-05-25 15:43:40] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2024-05-25 15:43:40] [INFO ] Deduced a trap composed of 41 places in 84 ms of which 3 ms to minimize.
[2024-05-25 15:43:40] [INFO ] Deduced a trap composed of 38 places in 83 ms of which 3 ms to minimize.
[2024-05-25 15:43:40] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2024-05-25 15:43:41] [INFO ] Deduced a trap composed of 6 places in 86 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-25 15:43:41] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-25 15:43:41] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 2 ms to minimize.
[2024-05-25 15:43:41] [INFO ] Deduced a trap composed of 28 places in 100 ms of which 2 ms to minimize.
[2024-05-25 15:43:41] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 2 ms to minimize.
[2024-05-25 15:43:42] [INFO ] Deduced a trap composed of 43 places in 71 ms of which 2 ms to minimize.
[2024-05-25 15:43:42] [INFO ] Deduced a trap composed of 42 places in 62 ms of which 2 ms to minimize.
[2024-05-25 15:43:42] [INFO ] Deduced a trap composed of 42 places in 67 ms of which 2 ms to minimize.
[2024-05-25 15:43:42] [INFO ] Deduced a trap composed of 41 places in 50 ms of which 1 ms to minimize.
[2024-05-25 15:43:42] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 2 ms to minimize.
[2024-05-25 15:43:42] [INFO ] Deduced a trap composed of 41 places in 64 ms of which 1 ms to minimize.
[2024-05-25 15:43:43] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-25 15:43:43] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 2 ms to minimize.
[2024-05-25 15:43:43] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 13/52 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-25 15:43:45] [INFO ] Deduced a trap composed of 53 places in 98 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-25 15:43:46] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 1 ms to minimize.
[2024-05-25 15:43:46] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 2 ms to minimize.
[2024-05-25 15:43:46] [INFO ] Deduced a trap composed of 40 places in 92 ms of which 2 ms to minimize.
[2024-05-25 15:43:46] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-25 15:43:48] [INFO ] Deduced a trap composed of 42 places in 57 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/185 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
At refinement iteration 8 (OVERLAPS) 1/186 variables, 2/60 constraints. Problems are: Problem set: 24 solved, 169 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 1/61 constraints. Problems are: Problem set: 24 solved, 169 unsolved
[2024-05-25 15:43:53] [INFO ] Deduced a trap composed of 7 places in 146 ms of which 3 ms to minimize.
[2024-05-25 15:43:53] [INFO ] Deduced a trap composed of 5 places in 146 ms of which 3 ms to minimize.
[2024-05-25 15:43:53] [INFO ] Deduced a trap composed of 53 places in 140 ms of which 4 ms to minimize.
[2024-05-25 15:43:53] [INFO ] Deduced a trap composed of 12 places in 136 ms of which 3 ms to minimize.
[2024-05-25 15:43:54] [INFO ] Deduced a trap composed of 42 places in 125 ms of which 3 ms to minimize.
Problem TDEAD92 is UNSAT
[2024-05-25 15:43:54] [INFO ] Deduced a trap composed of 71 places in 126 ms of which 3 ms to minimize.
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD144 is UNSAT
[2024-05-25 15:43:55] [INFO ] Deduced a trap composed of 67 places in 84 ms of which 3 ms to minimize.
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 7/68 constraints. Problems are: Problem set: 32 solved, 161 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/186 variables, 0/68 constraints. Problems are: Problem set: 32 solved, 161 unsolved
At refinement iteration 12 (OVERLAPS) 194/380 variables, 186/254 constraints. Problems are: Problem set: 32 solved, 161 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/380 variables, 68/322 constraints. Problems are: Problem set: 32 solved, 161 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/380 variables, 0/322 constraints. Problems are: Problem set: 32 solved, 161 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 15 (OVERLAPS) 0/380 variables, 0/322 constraints. Problems are: Problem set: 32 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Real declared 380/380 variables, and 322 constraints, problems are : Problem set: 32 solved, 161 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 186/186 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 32 solved, 161 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 11/11 constraints. Problems are: Problem set: 32 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 1/12 constraints. Problems are: Problem set: 32 solved, 161 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 13/25 constraints. Problems are: Problem set: 32 solved, 161 unsolved
[2024-05-25 15:44:08] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 1/26 constraints. Problems are: Problem set: 32 solved, 161 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 0/26 constraints. Problems are: Problem set: 32 solved, 161 unsolved
At refinement iteration 5 (OVERLAPS) 17/186 variables, 9/35 constraints. Problems are: Problem set: 32 solved, 161 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 1/36 constraints. Problems are: Problem set: 32 solved, 161 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 33/69 constraints. Problems are: Problem set: 32 solved, 161 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 0/69 constraints. Problems are: Problem set: 32 solved, 161 unsolved
At refinement iteration 9 (OVERLAPS) 194/380 variables, 186/255 constraints. Problems are: Problem set: 32 solved, 161 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/380 variables, 68/323 constraints. Problems are: Problem set: 32 solved, 161 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/380 variables, 161/484 constraints. Problems are: Problem set: 32 solved, 161 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/380 variables, 0/484 constraints. Problems are: Problem set: 32 solved, 161 unsolved
At refinement iteration 13 (OVERLAPS) 0/380 variables, 0/484 constraints. Problems are: Problem set: 32 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Int declared 380/380 variables, and 484 constraints, problems are : Problem set: 32 solved, 161 unsolved in 15477 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 186/186 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 161/193 constraints, Known Traps: 47/47 constraints]
After SMT, in 45567ms problems are : Problem set: 32 solved, 161 unsolved
Search for dead transitions found 32 dead transitions in 45572ms
Found 32 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 32 transitions
Dead transitions reduction (with SMT) removed 32 transitions
Starting structural reductions in LTL mode, iteration 1 : 186/186 places, 162/194 transitions.
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 170 transition count 162
Applied a total of 16 rules in 3 ms. Remains 170 /186 variables (removed 16) and now considering 162/162 (removed 0) transitions.
// Phase 1: matrix 162 rows 170 cols
[2024-05-25 15:44:22] [INFO ] Computed 22 invariants in 2 ms
[2024-05-25 15:44:22] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-25 15:44:22] [INFO ] Invariant cache hit.
[2024-05-25 15:44:22] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-05-25 15:44:23] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 439 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 170/186 places, 162/194 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 46857 ms. Remains : 170/186 places, 162/194 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 102 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 229 ms :[true, (AND p1 (NOT p0)), (NOT p0), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
RANDOM walk for 531 steps (0 resets) in 8 ms. (59 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) p0)]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 1 factoid took 132 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[true, (AND p1 (NOT p0)), (NOT p0), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 202 ms :[true, (AND p1 (NOT p0)), (NOT p0), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 211 ms :[true, (AND p1 (NOT p0)), (NOT p0), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Product exploration explored 100000 steps with 25000 reset in 184 ms.
Product exploration explored 100000 steps with 25000 reset in 216 ms.
Applying partial POR strategy [true, false, true, false, false, false]
Stuttering acceptance computed with spot in 203 ms :[true, (AND p1 (NOT p0)), (NOT p0), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Support contains 5 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 162/162 transitions.
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 170 transition count 162
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 11 Pre rules applied. Total rules applied 33 place count 170 transition count 162
Deduced a syphon composed of 44 places in 1 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 44 place count 170 transition count 162
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 52 place count 162 transition count 154
Deduced a syphon composed of 36 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 60 place count 162 transition count 154
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 69 places in 1 ms
Iterating global reduction 1 with 33 rules applied. Total rules applied 93 place count 162 transition count 154
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 115 place count 140 transition count 132
Deduced a syphon composed of 47 places in 0 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 137 place count 140 transition count 132
Deduced a syphon composed of 47 places in 0 ms
Applied a total of 137 rules in 30 ms. Remains 140 /170 variables (removed 30) and now considering 132/162 (removed 30) transitions.
[2024-05-25 15:44:25] [INFO ] Redundant transitions in 6 ms returned []
Running 131 sub problems to find dead transitions.
// Phase 1: matrix 132 rows 140 cols
[2024-05-25 15:44:25] [INFO ] Computed 22 invariants in 1 ms
[2024-05-25 15:44:25] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-05-25 15:44:25] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2024-05-25 15:44:25] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2024-05-25 15:44:26] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-25 15:44:26] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2024-05-25 15:44:26] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-25 15:44:26] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-05-25 15:44:26] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
[2024-05-25 15:44:26] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-25 15:44:26] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-05-25 15:44:26] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 2 ms to minimize.
[2024-05-25 15:44:26] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 2 ms to minimize.
[2024-05-25 15:44:26] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-25 15:44:26] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 2 ms to minimize.
[2024-05-25 15:44:26] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 2 ms to minimize.
Problem TDEAD6 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD11 is UNSAT
[2024-05-25 15:44:26] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-05-25 15:44:26] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 1 ms to minimize.
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD25 is UNSAT
[2024-05-25 15:44:26] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 2 ms to minimize.
[2024-05-25 15:44:26] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 2 ms to minimize.
Problem TDEAD27 is UNSAT
[2024-05-25 15:44:26] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-25 15:44:26] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 20/39 constraints. Problems are: Problem set: 35 solved, 96 unsolved
[2024-05-25 15:44:27] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-25 15:44:27] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
Problem TDEAD28 is UNSAT
[2024-05-25 15:44:27] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
[2024-05-25 15:44:27] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 2 ms to minimize.
Problem TDEAD29 is UNSAT
Problem TDEAD36 is UNSAT
[2024-05-25 15:44:27] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-05-25 15:44:27] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 2 ms to minimize.
[2024-05-25 15:44:27] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 2 ms to minimize.
[2024-05-25 15:44:27] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-05-25 15:44:27] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 1 ms to minimize.
[2024-05-25 15:44:27] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-05-25 15:44:27] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-25 15:44:27] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 2 ms to minimize.
[2024-05-25 15:44:27] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-25 15:44:28] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
Problem TDEAD112 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 14/53 constraints. Problems are: Problem set: 39 solved, 92 unsolved
[2024-05-25 15:44:28] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 1/54 constraints. Problems are: Problem set: 39 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 0/54 constraints. Problems are: Problem set: 39 solved, 92 unsolved
At refinement iteration 6 (OVERLAPS) 1/140 variables, 2/56 constraints. Problems are: Problem set: 39 solved, 92 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 1/57 constraints. Problems are: Problem set: 39 solved, 92 unsolved
[2024-05-25 15:44:30] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-05-25 15:44:30] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 2 ms to minimize.
[2024-05-25 15:44:30] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 2 ms to minimize.
Problem TDEAD18 is UNSAT
[2024-05-25 15:44:30] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 2 ms to minimize.
Problem TDEAD92 is UNSAT
[2024-05-25 15:44:30] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-25 15:44:30] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
Problem TDEAD107 is UNSAT
[2024-05-25 15:44:30] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 3 ms to minimize.
[2024-05-25 15:44:31] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 2 ms to minimize.
Problem TDEAD129 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD79 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/140 variables, 8/65 constraints. Problems are: Problem set: 46 solved, 85 unsolved
[2024-05-25 15:44:31] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 3 ms to minimize.
[2024-05-25 15:44:31] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/140 variables, 2/67 constraints. Problems are: Problem set: 46 solved, 85 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/140 variables, 0/67 constraints. Problems are: Problem set: 46 solved, 85 unsolved
Problem TDEAD14 is UNSAT
At refinement iteration 11 (OVERLAPS) 132/272 variables, 140/207 constraints. Problems are: Problem set: 47 solved, 84 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/272 variables, 49/256 constraints. Problems are: Problem set: 47 solved, 84 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/272 variables, 0/256 constraints. Problems are: Problem set: 47 solved, 84 unsolved
At refinement iteration 14 (OVERLAPS) 0/272 variables, 0/256 constraints. Problems are: Problem set: 47 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 272/272 variables, and 256 constraints, problems are : Problem set: 47 solved, 84 unsolved in 9949 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 140/140 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 45/45 constraints]
Escalating to Integer solving :Problem set: 47 solved, 84 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 11/11 constraints. Problems are: Problem set: 47 solved, 84 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 1/12 constraints. Problems are: Problem set: 47 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 43/55 constraints. Problems are: Problem set: 47 solved, 84 unsolved
[2024-05-25 15:44:35] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
[2024-05-25 15:44:35] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-25 15:44:35] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-25 15:44:35] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 4/59 constraints. Problems are: Problem set: 47 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/59 constraints. Problems are: Problem set: 47 solved, 84 unsolved
At refinement iteration 5 (OVERLAPS) 47/139 variables, 9/68 constraints. Problems are: Problem set: 47 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 2/70 constraints. Problems are: Problem set: 47 solved, 84 unsolved
[2024-05-25 15:44:36] [INFO ] Deduced a trap composed of 36 places in 63 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 1/71 constraints. Problems are: Problem set: 47 solved, 84 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/139 variables, 0/71 constraints. Problems are: Problem set: 47 solved, 84 unsolved
At refinement iteration 9 (OVERLAPS) 1/140 variables, 1/72 constraints. Problems are: Problem set: 47 solved, 84 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/140 variables, 0/72 constraints. Problems are: Problem set: 47 solved, 84 unsolved
At refinement iteration 11 (OVERLAPS) 132/272 variables, 140/212 constraints. Problems are: Problem set: 47 solved, 84 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/272 variables, 49/261 constraints. Problems are: Problem set: 47 solved, 84 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/272 variables, 84/345 constraints. Problems are: Problem set: 47 solved, 84 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/272 variables, 0/345 constraints. Problems are: Problem set: 47 solved, 84 unsolved
At refinement iteration 15 (OVERLAPS) 0/272 variables, 0/345 constraints. Problems are: Problem set: 47 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 272/272 variables, and 345 constraints, problems are : Problem set: 47 solved, 84 unsolved in 7240 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 140/140 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 84/131 constraints, Known Traps: 50/50 constraints]
After SMT, in 17225ms problems are : Problem set: 47 solved, 84 unsolved
Search for dead transitions found 47 dead transitions in 17228ms
Found 47 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 47 transitions
Dead transitions reduction (with SMT) removed 47 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 140/170 places, 85/162 transitions.
Graph (complete) has 294 edges and 140 vertex of which 93 are kept as prefixes of interest. Removing 47 places using SCC suffix rule.1 ms
Discarding 47 places :
Also discarding 0 output transitions
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 1 place count 93 transition count 85
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 0 with 3 rules applied. Total rules applied 4 place count 93 transition count 85
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 4 rules in 7 ms. Remains 93 /140 variables (removed 47) and now considering 85/85 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 93/170 places, 85/162 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 17283 ms. Remains : 93/170 places, 85/162 transitions.
Built C files in :
/tmp/ltsmin6729472881632096912
[2024-05-25 15:44:42] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6729472881632096912
Running compilation step : cd /tmp/ltsmin6729472881632096912;'/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 659 ms.
Running link step : cd /tmp/ltsmin6729472881632096912;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin6729472881632096912;'/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/stateBased14917575295945652330.hoa' '--buchi-type=spotba'
LTSmin run took 504 ms.
FORMULA ParamProductionCell-PT-1-LTLFireability-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-1-LTLFireability-09 finished in 70562 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X(X(X(F(p1)))))))'
Support contains 4 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 196/196 transitions.
Applied a total of 0 rules in 2 ms. Remains 199 /199 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 199 cols
[2024-05-25 15:44:43] [INFO ] Computed 33 invariants in 6 ms
[2024-05-25 15:44:43] [INFO ] Implicit Places using invariants in 311 ms returned [19, 26, 30, 31, 55, 85, 87, 99, 101, 103, 170, 175, 179, 190]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 313 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 185/199 places, 196/196 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 183 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 183 transition count 194
Applied a total of 4 rules in 4 ms. Remains 183 /185 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 183 cols
[2024-05-25 15:44:43] [INFO ] Computed 19 invariants in 2 ms
[2024-05-25 15:44:44] [INFO ] Implicit Places using invariants in 165 ms returned []
[2024-05-25 15:44:44] [INFO ] Invariant cache hit.
[2024-05-25 15:44:44] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-25 15:44:44] [INFO ] Implicit Places using invariants and state equation in 546 ms returned []
Implicit Place search using SMT with State Equation took 713 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 183/199 places, 194/196 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1032 ms. Remains : 183/199 places, 194/196 transitions.
Stuttering acceptance computed with spot in 244 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ParamProductionCell-PT-1-LTLFireability-12
Product exploration explored 100000 steps with 50000 reset in 113 ms.
Product exploration explored 100000 steps with 50000 reset in 162 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 18 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ParamProductionCell-PT-1-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ParamProductionCell-PT-1-LTLFireability-12 finished in 1596 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)) U p0)||F(p1)))'
Support contains 4 out of 199 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 199/199 places, 196/196 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 199 transition count 168
Reduce places removed 28 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 29 rules applied. Total rules applied 57 place count 171 transition count 167
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 58 place count 170 transition count 167
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 58 place count 170 transition count 157
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 78 place count 160 transition count 157
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 132 place count 133 transition count 130
Applied a total of 132 rules in 15 ms. Remains 133 /199 variables (removed 66) and now considering 130/196 (removed 66) transitions.
// Phase 1: matrix 130 rows 133 cols
[2024-05-25 15:44:45] [INFO ] Computed 33 invariants in 1 ms
[2024-05-25 15:44:45] [INFO ] Implicit Places using invariants in 317 ms returned [1, 5, 9, 12, 21, 22, 25, 36, 47, 52, 54, 65, 66, 67, 86, 114, 117, 119, 127]
[2024-05-25 15:44:45] [INFO ] Actually due to overlaps returned [52, 54, 9, 25, 36, 65, 66, 114, 119, 12, 117, 127, 21, 22, 67]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 319 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 118/199 places, 130/196 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 118 transition count 127
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 115 transition count 127
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 6 place count 115 transition count 121
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 18 place count 109 transition count 121
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 74 place count 81 transition count 93
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 76 place count 80 transition count 92
Applied a total of 76 rules in 12 ms. Remains 80 /118 variables (removed 38) and now considering 92/130 (removed 38) transitions.
// Phase 1: matrix 92 rows 80 cols
[2024-05-25 15:44:45] [INFO ] Computed 18 invariants in 1 ms
[2024-05-25 15:44:45] [INFO ] Implicit Places using invariants in 129 ms returned [0, 3, 33, 52]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 143 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 76/199 places, 92/196 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 75 transition count 91
Applied a total of 2 rules in 5 ms. Remains 75 /76 variables (removed 1) and now considering 91/92 (removed 1) transitions.
// Phase 1: matrix 91 rows 75 cols
[2024-05-25 15:44:45] [INFO ] Computed 14 invariants in 1 ms
[2024-05-25 15:44:45] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-25 15:44:45] [INFO ] Invariant cache hit.
[2024-05-25 15:44:45] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-25 15:44:46] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 75/199 places, 91/196 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 871 ms. Remains : 75/199 places, 91/196 transitions.
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ParamProductionCell-PT-1-LTLFireability-13
Product exploration explored 100000 steps with 1493 reset in 177 ms.
Product exploration explored 100000 steps with 1493 reset in 193 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 118 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
RANDOM walk for 39611 steps (8 resets) in 79 ms. (495 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 277 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
[2024-05-25 15:44:47] [INFO ] Invariant cache hit.
[2024-05-25 15:44:47] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2024-05-25 15:44:47] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2024-05-25 15:44:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:44:47] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2024-05-25 15:44:47] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2024-05-25 15:44:47] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-25 15:44:47] [INFO ] [Nat]Added 67 Read/Feed constraints in 13 ms returned sat
[2024-05-25 15:44:47] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2024-05-25 15:44:47] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2024-05-25 15:44:47] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-05-25 15:44:47] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-05-25 15:44:47] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 1 ms to minimize.
[2024-05-25 15:44:47] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-05-25 15:44:48] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 2 ms to minimize.
[2024-05-25 15:44:48] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-25 15:44:48] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 2 ms to minimize.
[2024-05-25 15:44:48] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 2 ms to minimize.
[2024-05-25 15:44:48] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 2 ms to minimize.
[2024-05-25 15:44:48] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 3 ms to minimize.
[2024-05-25 15:44:48] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 661 ms
[2024-05-25 15:44:48] [INFO ] Computed and/alt/rep : 90/214/90 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-25 15:44:48] [INFO ] Added : 78 causal constraints over 16 iterations in 240 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 4 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 91/91 transitions.
Applied a total of 0 rules in 5 ms. Remains 75 /75 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2024-05-25 15:44:48] [INFO ] Invariant cache hit.
[2024-05-25 15:44:48] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-05-25 15:44:48] [INFO ] Invariant cache hit.
[2024-05-25 15:44:48] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-25 15:44:48] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
[2024-05-25 15:44:48] [INFO ] Redundant transitions in 3 ms returned []
Running 90 sub problems to find dead transitions.
[2024-05-25 15:44:48] [INFO ] Invariant cache hit.
[2024-05-25 15:44:48] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-25 15:44:49] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2024-05-25 15:44:49] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-05-25 15:44:49] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-25 15:44:49] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-25 15:44:49] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-05-25 15:44:49] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-25 15:44:49] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 5 ms to minimize.
[2024-05-25 15:44:49] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-25 15:44:49] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-05-25 15:44:49] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
[2024-05-25 15:44:49] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-25 15:44:49] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-25 15:44:49] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 1 ms to minimize.
[2024-05-25 15:44:49] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
Problem TDEAD20 is UNSAT
[2024-05-25 15:44:49] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 2 ms to minimize.
Problem TDEAD22 is UNSAT
[2024-05-25 15:44:50] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
Problem TDEAD25 is UNSAT
[2024-05-25 15:44:50] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 2 ms to minimize.
Problem TDEAD26 is UNSAT
[2024-05-25 15:44:50] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-25 15:44:50] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-05-25 15:44:50] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 2 ms to minimize.
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 20/34 constraints. Problems are: Problem set: 22 solved, 68 unsolved
[2024-05-25 15:44:50] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 2 ms to minimize.
[2024-05-25 15:44:50] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-25 15:44:50] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-25 15:44:50] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 1 ms to minimize.
[2024-05-25 15:44:50] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-25 15:44:50] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-05-25 15:44:50] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
Problem TDEAD51 is UNSAT
[2024-05-25 15:44:50] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-25 15:44:50] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
Problem TDEAD81 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 9/43 constraints. Problems are: Problem set: 24 solved, 66 unsolved
[2024-05-25 15:44:51] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:44:51] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-25 15:44:51] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-25 15:44:51] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-25 15:44:51] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 5/48 constraints. Problems are: Problem set: 24 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/48 constraints. Problems are: Problem set: 24 solved, 66 unsolved
At refinement iteration 5 (OVERLAPS) 91/166 variables, 75/123 constraints. Problems are: Problem set: 24 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 67/190 constraints. Problems are: Problem set: 24 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 0/190 constraints. Problems are: Problem set: 24 solved, 66 unsolved
At refinement iteration 8 (OVERLAPS) 0/166 variables, 0/190 constraints. Problems are: Problem set: 24 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 166/166 variables, and 190 constraints, problems are : Problem set: 24 solved, 66 unsolved in 4407 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 75/75 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 24 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 10/10 constraints. Problems are: Problem set: 24 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 12/22 constraints. Problems are: Problem set: 24 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/22 constraints. Problems are: Problem set: 24 solved, 66 unsolved
At refinement iteration 3 (OVERLAPS) 8/75 variables, 4/26 constraints. Problems are: Problem set: 24 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 22/48 constraints. Problems are: Problem set: 24 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/48 constraints. Problems are: Problem set: 24 solved, 66 unsolved
At refinement iteration 6 (OVERLAPS) 91/166 variables, 75/123 constraints. Problems are: Problem set: 24 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 67/190 constraints. Problems are: Problem set: 24 solved, 66 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/166 variables, 66/256 constraints. Problems are: Problem set: 24 solved, 66 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/166 variables, 0/256 constraints. Problems are: Problem set: 24 solved, 66 unsolved
At refinement iteration 10 (OVERLAPS) 0/166 variables, 0/256 constraints. Problems are: Problem set: 24 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 166/166 variables, and 256 constraints, problems are : Problem set: 24 solved, 66 unsolved in 2052 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 75/75 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 66/90 constraints, Known Traps: 34/34 constraints]
After SMT, in 6487ms problems are : Problem set: 24 solved, 66 unsolved
Search for dead transitions found 24 dead transitions in 6490ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 75/75 places, 67/91 transitions.
Graph (complete) has 218 edges and 75 vertex of which 67 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 67 /75 variables (removed 8) and now considering 67/67 (removed 0) transitions.
// Phase 1: matrix 67 rows 67 cols
[2024-05-25 15:44:55] [INFO ] Computed 14 invariants in 1 ms
[2024-05-25 15:44:55] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-05-25 15:44:55] [INFO ] Invariant cache hit.
[2024-05-25 15:44:55] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-05-25 15:44:55] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 67/75 places, 67/91 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7063 ms. Remains : 67/75 places, 67/91 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 197 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
RANDOM walk for 40000 steps (8 resets) in 58 ms. (677 steps per ms) remains 1/6 properties
BEST_FIRST walk for 440 steps (0 resets) in 4 ms. (88 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 13 factoid took 509 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
[2024-05-25 15:44:56] [INFO ] Invariant cache hit.
[2024-05-25 15:44:56] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2024-05-25 15:44:56] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2024-05-25 15:44:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:44:57] [INFO ] [Nat]Absence check using 14 positive place invariants in 7 ms returned sat
[2024-05-25 15:44:57] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2024-05-25 15:44:57] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-05-25 15:44:57] [INFO ] [Nat]Added 47 Read/Feed constraints in 12 ms returned sat
[2024-05-25 15:44:57] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 2 ms to minimize.
[2024-05-25 15:44:57] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-05-25 15:44:57] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-05-25 15:44:57] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
[2024-05-25 15:44:57] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 2 ms to minimize.
[2024-05-25 15:44:57] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 2 ms to minimize.
[2024-05-25 15:44:57] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-05-25 15:44:57] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
[2024-05-25 15:44:57] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-05-25 15:44:57] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
[2024-05-25 15:44:57] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-25 15:44:57] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-25 15:44:57] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-05-25 15:44:57] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 592 ms
[2024-05-25 15:44:57] [INFO ] Computed and/alt/rep : 66/102/66 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-25 15:44:57] [INFO ] Added : 63 causal constraints over 13 iterations in 154 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Product exploration explored 100000 steps with 1493 reset in 186 ms.
Product exploration explored 100000 steps with 1493 reset in 208 ms.
Built C files in :
/tmp/ltsmin2500970538137043146
[2024-05-25 15:44:58] [INFO ] Computing symmetric may disable matrix : 67 transitions.
[2024-05-25 15:44:58] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:44:58] [INFO ] Computing symmetric may enable matrix : 67 transitions.
[2024-05-25 15:44:58] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:44:58] [INFO ] Computing Do-Not-Accords matrix : 67 transitions.
[2024-05-25 15:44:58] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:44:58] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2500970538137043146
Running compilation step : cd /tmp/ltsmin2500970538137043146;'/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 265 ms.
Running link step : cd /tmp/ltsmin2500970538137043146;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin2500970538137043146;'/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/stateBased8028209315152949777.hoa' '--buchi-type=spotba'
LTSmin run took 239 ms.
FORMULA ParamProductionCell-PT-1-LTLFireability-13 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-1-LTLFireability-13 finished in 13863 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||F(p1)))'
Support contains 3 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 196/196 transitions.
Applied a total of 0 rules in 2 ms. Remains 199 /199 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 199 cols
[2024-05-25 15:44:59] [INFO ] Computed 33 invariants in 2 ms
[2024-05-25 15:44:59] [INFO ] Implicit Places using invariants in 229 ms returned [19, 26, 30, 31, 36, 55, 85, 87, 99, 101, 103, 170, 175, 179, 190]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 230 ms to find 15 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 184/199 places, 196/196 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 182 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 182 transition count 194
Applied a total of 4 rules in 3 ms. Remains 182 /184 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 182 cols
[2024-05-25 15:44:59] [INFO ] Computed 18 invariants in 2 ms
[2024-05-25 15:44:59] [INFO ] Implicit Places using invariants in 163 ms returned []
[2024-05-25 15:44:59] [INFO ] Invariant cache hit.
[2024-05-25 15:44:59] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-25 15:44:59] [INFO ] Implicit Places using invariants and state equation in 332 ms returned []
Implicit Place search using SMT with State Equation took 497 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 182/199 places, 194/196 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 733 ms. Remains : 182/199 places, 194/196 transitions.
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ParamProductionCell-PT-1-LTLFireability-15
Product exploration explored 100000 steps with 666 reset in 160 ms.
Product exploration explored 100000 steps with 666 reset in 190 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 109 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 596 steps (0 resets) in 4 ms. (119 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 5 factoid took 137 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 118 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2024-05-25 15:45:00] [INFO ] Invariant cache hit.
[2024-05-25 15:45:01] [INFO ] [Real]Absence check using 18 positive place invariants in 12 ms returned sat
[2024-05-25 15:45:01] [INFO ] [Real]Absence check using state equation in 300 ms returned sat
[2024-05-25 15:45:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:45:01] [INFO ] [Nat]Absence check using 18 positive place invariants in 13 ms returned sat
[2024-05-25 15:45:01] [INFO ] [Nat]Absence check using state equation in 391 ms returned sat
[2024-05-25 15:45:01] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-25 15:45:02] [INFO ] [Nat]Added 68 Read/Feed constraints in 214 ms returned sat
[2024-05-25 15:45:02] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 2 ms to minimize.
[2024-05-25 15:45:02] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 2 ms to minimize.
[2024-05-25 15:45:02] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 3 ms to minimize.
[2024-05-25 15:45:02] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 2 ms to minimize.
[2024-05-25 15:45:02] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 2 ms to minimize.
[2024-05-25 15:45:02] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 2 ms to minimize.
[2024-05-25 15:45:02] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 1 ms to minimize.
[2024-05-25 15:45:03] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 1 ms to minimize.
[2024-05-25 15:45:03] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 2 ms to minimize.
[2024-05-25 15:45:03] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 3 ms to minimize.
[2024-05-25 15:45:03] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1304 ms
[2024-05-25 15:45:03] [INFO ] Computed and/alt/rep : 193/308/193 causal constraints (skipped 0 transitions) in 17 ms.
[2024-05-25 15:45:05] [INFO ] Added : 165 causal constraints over 33 iterations in 1825 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 1 out of 182 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 194/194 transitions.
Applied a total of 0 rules in 1 ms. Remains 182 /182 variables (removed 0) and now considering 194/194 (removed 0) transitions.
[2024-05-25 15:45:05] [INFO ] Invariant cache hit.
[2024-05-25 15:45:05] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-05-25 15:45:05] [INFO ] Invariant cache hit.
[2024-05-25 15:45:05] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-25 15:45:05] [INFO ] Implicit Places using invariants and state equation in 335 ms returned []
Implicit Place search using SMT with State Equation took 461 ms to find 0 implicit places.
Running 193 sub problems to find dead transitions.
[2024-05-25 15:45:05] [INFO ] Invariant cache hit.
[2024-05-25 15:45:05] [INFO ] State equation strengthened by 68 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-25 15:45:07] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 1 ms to minimize.
[2024-05-25 15:45:07] [INFO ] Deduced a trap composed of 7 places in 104 ms of which 2 ms to minimize.
[2024-05-25 15:45:07] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 2 ms to minimize.
[2024-05-25 15:45:07] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 2 ms to minimize.
[2024-05-25 15:45:07] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 2 ms to minimize.
[2024-05-25 15:45:07] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 2 ms to minimize.
[2024-05-25 15:45:07] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-25 15:45:07] [INFO ] Deduced a trap composed of 40 places in 94 ms of which 3 ms to minimize.
[2024-05-25 15:45:07] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 3 ms to minimize.
[2024-05-25 15:45:07] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 2 ms to minimize.
[2024-05-25 15:45:07] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 2 ms to minimize.
[2024-05-25 15:45:08] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-25 15:45:08] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 3 ms to minimize.
[2024-05-25 15:45:08] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 3 ms to minimize.
[2024-05-25 15:45:08] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 1 ms to minimize.
[2024-05-25 15:45:08] [INFO ] Deduced a trap composed of 6 places in 102 ms of which 2 ms to minimize.
[2024-05-25 15:45:08] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-05-25 15:45:08] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 3 ms to minimize.
[2024-05-25 15:45:08] [INFO ] Deduced a trap composed of 36 places in 58 ms of which 1 ms to minimize.
[2024-05-25 15:45:08] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-25 15:45:08] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 2 ms to minimize.
[2024-05-25 15:45:09] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-25 15:45:09] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 2 ms to minimize.
[2024-05-25 15:45:09] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 2 ms to minimize.
[2024-05-25 15:45:09] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 2 ms to minimize.
[2024-05-25 15:45:09] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 2 ms to minimize.
[2024-05-25 15:45:09] [INFO ] Deduced a trap composed of 46 places in 83 ms of which 2 ms to minimize.
[2024-05-25 15:45:09] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 2 ms to minimize.
[2024-05-25 15:45:10] [INFO ] Deduced a trap composed of 41 places in 61 ms of which 2 ms to minimize.
[2024-05-25 15:45:10] [INFO ] Deduced a trap composed of 38 places in 72 ms of which 2 ms to minimize.
[2024-05-25 15:45:10] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 2 ms to minimize.
[2024-05-25 15:45:10] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 1 ms to minimize.
[2024-05-25 15:45:10] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-25 15:45:10] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 14/51 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-25 15:45:11] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/182 variables, 1/53 constraints. Problems are: Problem set: 20 solved, 173 unsolved
[2024-05-25 15:45:15] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 3 ms to minimize.
[2024-05-25 15:45:15] [INFO ] Deduced a trap composed of 69 places in 122 ms of which 3 ms to minimize.
[2024-05-25 15:45:15] [INFO ] Deduced a trap composed of 14 places in 110 ms of which 2 ms to minimize.
Problem TDEAD92 is UNSAT
[2024-05-25 15:45:16] [INFO ] Deduced a trap composed of 80 places in 69 ms of which 2 ms to minimize.
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
[2024-05-25 15:45:16] [INFO ] Deduced a trap composed of 43 places in 58 ms of which 2 ms to minimize.
Problem TDEAD121 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD144 is UNSAT
[2024-05-25 15:45:16] [INFO ] Deduced a trap composed of 79 places in 111 ms of which 3 ms to minimize.
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 6/59 constraints. Problems are: Problem set: 32 solved, 161 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 0/59 constraints. Problems are: Problem set: 32 solved, 161 unsolved
At refinement iteration 8 (OVERLAPS) 194/376 variables, 182/241 constraints. Problems are: Problem set: 32 solved, 161 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/376 variables, 68/309 constraints. Problems are: Problem set: 32 solved, 161 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/376 variables, 0/309 constraints. Problems are: Problem set: 32 solved, 161 unsolved
At refinement iteration 11 (OVERLAPS) 0/376 variables, 0/309 constraints. Problems are: Problem set: 32 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Real declared 376/376 variables, and 309 constraints, problems are : Problem set: 32 solved, 161 unsolved in 21554 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 182/182 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 41/41 constraints]
Escalating to Integer solving :Problem set: 32 solved, 161 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 11/11 constraints. Problems are: Problem set: 32 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 13/24 constraints. Problems are: Problem set: 32 solved, 161 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 0/24 constraints. Problems are: Problem set: 32 solved, 161 unsolved
At refinement iteration 3 (OVERLAPS) 17/182 variables, 7/31 constraints. Problems are: Problem set: 32 solved, 161 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 28/59 constraints. Problems are: Problem set: 32 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 0/59 constraints. Problems are: Problem set: 32 solved, 161 unsolved
At refinement iteration 6 (OVERLAPS) 194/376 variables, 182/241 constraints. Problems are: Problem set: 32 solved, 161 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/376 variables, 68/309 constraints. Problems are: Problem set: 32 solved, 161 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/376 variables, 161/470 constraints. Problems are: Problem set: 32 solved, 161 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/376 variables, 0/470 constraints. Problems are: Problem set: 32 solved, 161 unsolved
At refinement iteration 10 (OVERLAPS) 0/376 variables, 0/470 constraints. Problems are: Problem set: 32 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Int declared 376/376 variables, and 470 constraints, problems are : Problem set: 32 solved, 161 unsolved in 11154 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 182/182 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 161/193 constraints, Known Traps: 41/41 constraints]
After SMT, in 32732ms problems are : Problem set: 32 solved, 161 unsolved
Search for dead transitions found 32 dead transitions in 32736ms
Found 32 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 32 transitions
Dead transitions reduction (with SMT) removed 32 transitions
Starting structural reductions in LTL mode, iteration 1 : 182/182 places, 162/194 transitions.
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 166 transition count 162
Applied a total of 16 rules in 3 ms. Remains 166 /182 variables (removed 16) and now considering 162/162 (removed 0) transitions.
// Phase 1: matrix 162 rows 166 cols
[2024-05-25 15:45:38] [INFO ] Computed 18 invariants in 1 ms
[2024-05-25 15:45:38] [INFO ] Implicit Places using invariants in 143 ms returned []
[2024-05-25 15:45:38] [INFO ] Invariant cache hit.
[2024-05-25 15:45:38] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-05-25 15:45:39] [INFO ] Implicit Places using invariants and state equation in 376 ms returned []
Implicit Place search using SMT with State Equation took 521 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 166/182 places, 162/194 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 33726 ms. Remains : 166/182 places, 162/194 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p1), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 86 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 596 steps (0 resets) in 4 ms. (119 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 2 factoid took 91 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 130 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2024-05-25 15:45:39] [INFO ] Invariant cache hit.
[2024-05-25 15:45:39] [INFO ] [Real]Absence check using 18 positive place invariants in 19 ms returned sat
[2024-05-25 15:45:40] [INFO ] [Real]Absence check using state equation in 371 ms returned sat
[2024-05-25 15:45:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:45:40] [INFO ] [Nat]Absence check using 18 positive place invariants in 9 ms returned sat
[2024-05-25 15:45:40] [INFO ] [Nat]Absence check using state equation in 294 ms returned sat
[2024-05-25 15:45:40] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-05-25 15:45:40] [INFO ] [Nat]Added 48 Read/Feed constraints in 273 ms returned sat
[2024-05-25 15:45:40] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 2 ms to minimize.
[2024-05-25 15:45:41] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 2 ms to minimize.
[2024-05-25 15:45:41] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 2 ms to minimize.
[2024-05-25 15:45:41] [INFO ] Deduced a trap composed of 7 places in 110 ms of which 3 ms to minimize.
[2024-05-25 15:45:41] [INFO ] Deduced a trap composed of 24 places in 145 ms of which 3 ms to minimize.
[2024-05-25 15:45:41] [INFO ] Deduced a trap composed of 5 places in 130 ms of which 3 ms to minimize.
[2024-05-25 15:45:41] [INFO ] Deduced a trap composed of 14 places in 139 ms of which 3 ms to minimize.
[2024-05-25 15:45:41] [INFO ] Deduced a trap composed of 20 places in 131 ms of which 3 ms to minimize.
[2024-05-25 15:45:42] [INFO ] Deduced a trap composed of 7 places in 124 ms of which 3 ms to minimize.
[2024-05-25 15:45:42] [INFO ] Deduced a trap composed of 7 places in 123 ms of which 3 ms to minimize.
[2024-05-25 15:45:42] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 1 ms to minimize.
[2024-05-25 15:45:42] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1473 ms
[2024-05-25 15:45:42] [INFO ] Computed and/alt/rep : 161/196/161 causal constraints (skipped 0 transitions) in 17 ms.
[2024-05-25 15:45:43] [INFO ] Added : 147 causal constraints over 30 iterations in 1066 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 125 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 666 reset in 161 ms.
Product exploration explored 100000 steps with 666 reset in 189 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 129 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 1 out of 166 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 166/166 places, 162/162 transitions.
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 166 transition count 162
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 13 Pre rules applied. Total rules applied 38 place count 166 transition count 162
Deduced a syphon composed of 51 places in 1 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 51 place count 166 transition count 162
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 62 place count 155 transition count 151
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 73 place count 155 transition count 151
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 78 places in 0 ms
Iterating global reduction 1 with 38 rules applied. Total rules applied 111 place count 155 transition count 151
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 140 place count 126 transition count 122
Deduced a syphon composed of 49 places in 0 ms
Iterating global reduction 1 with 29 rules applied. Total rules applied 169 place count 126 transition count 122
Deduced a syphon composed of 49 places in 0 ms
Applied a total of 169 rules in 24 ms. Remains 126 /166 variables (removed 40) and now considering 122/162 (removed 40) transitions.
[2024-05-25 15:45:44] [INFO ] Redundant transitions in 5 ms returned []
Running 121 sub problems to find dead transitions.
// Phase 1: matrix 122 rows 126 cols
[2024-05-25 15:45:44] [INFO ] Computed 18 invariants in 0 ms
[2024-05-25 15:45:44] [INFO ] State equation strengthened by 48 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-25 15:45:45] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 1 ms to minimize.
[2024-05-25 15:45:45] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 2 ms to minimize.
[2024-05-25 15:45:45] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 2 ms to minimize.
[2024-05-25 15:45:45] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2024-05-25 15:45:45] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 2 ms to minimize.
[2024-05-25 15:45:45] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 2 ms to minimize.
[2024-05-25 15:45:45] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD2 is UNSAT
[2024-05-25 15:45:45] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 2 ms to minimize.
[2024-05-25 15:45:45] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:45:45] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 2 ms to minimize.
Problem TDEAD6 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD16 is UNSAT
[2024-05-25 15:45:45] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 2 ms to minimize.
[2024-05-25 15:45:45] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD23 is UNSAT
[2024-05-25 15:45:45] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 2 ms to minimize.
[2024-05-25 15:45:45] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 2 ms to minimize.
[2024-05-25 15:45:46] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 1 ms to minimize.
[2024-05-25 15:45:46] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
Problem TDEAD25 is UNSAT
[2024-05-25 15:45:46] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
[2024-05-25 15:45:46] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
[2024-05-25 15:45:46] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
Problem TDEAD30 is UNSAT
Problem TDEAD34 is UNSAT
[2024-05-25 15:45:46] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 20/37 constraints. Problems are: Problem set: 45 solved, 76 unsolved
[2024-05-25 15:45:46] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 2 ms to minimize.
[2024-05-25 15:45:46] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-25 15:45:46] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-05-25 15:45:46] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-05-25 15:45:46] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-25 15:45:46] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:45:46] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-25 15:45:46] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-25 15:45:46] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 9/46 constraints. Problems are: Problem set: 45 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/46 constraints. Problems are: Problem set: 45 solved, 76 unsolved
At refinement iteration 4 (OVERLAPS) 1/126 variables, 1/47 constraints. Problems are: Problem set: 45 solved, 76 unsolved
[2024-05-25 15:45:47] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 2 ms to minimize.
[2024-05-25 15:45:47] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 1 ms to minimize.
[2024-05-25 15:45:48] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 2 ms to minimize.
Problem TDEAD61 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD72 is UNSAT
[2024-05-25 15:45:48] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
Problem TDEAD86 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 4/51 constraints. Problems are: Problem set: 49 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/51 constraints. Problems are: Problem set: 49 solved, 72 unsolved
At refinement iteration 7 (OVERLAPS) 122/248 variables, 126/177 constraints. Problems are: Problem set: 49 solved, 72 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 48/225 constraints. Problems are: Problem set: 49 solved, 72 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/248 variables, 0/225 constraints. Problems are: Problem set: 49 solved, 72 unsolved
At refinement iteration 10 (OVERLAPS) 0/248 variables, 0/225 constraints. Problems are: Problem set: 49 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 248/248 variables, and 225 constraints, problems are : Problem set: 49 solved, 72 unsolved in 6764 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 126/126 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 33/33 constraints]
Escalating to Integer solving :Problem set: 49 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 10/10 constraints. Problems are: Problem set: 49 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 32/42 constraints. Problems are: Problem set: 49 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/42 constraints. Problems are: Problem set: 49 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 50/126 variables, 8/50 constraints. Problems are: Problem set: 49 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 1/51 constraints. Problems are: Problem set: 49 solved, 72 unsolved
[2024-05-25 15:45:51] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 1/52 constraints. Problems are: Problem set: 49 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/52 constraints. Problems are: Problem set: 49 solved, 72 unsolved
At refinement iteration 7 (OVERLAPS) 122/248 variables, 126/178 constraints. Problems are: Problem set: 49 solved, 72 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 48/226 constraints. Problems are: Problem set: 49 solved, 72 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/248 variables, 72/298 constraints. Problems are: Problem set: 49 solved, 72 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/248 variables, 0/298 constraints. Problems are: Problem set: 49 solved, 72 unsolved
At refinement iteration 11 (OVERLAPS) 0/248 variables, 0/298 constraints. Problems are: Problem set: 49 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 248/248 variables, and 298 constraints, problems are : Problem set: 49 solved, 72 unsolved in 4398 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 126/126 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 72/121 constraints, Known Traps: 34/34 constraints]
After SMT, in 11189ms problems are : Problem set: 49 solved, 72 unsolved
Search for dead transitions found 49 dead transitions in 11193ms
Found 49 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 49 transitions
Dead transitions reduction (with SMT) removed 49 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 126/166 places, 73/162 transitions.
Graph (complete) has 237 edges and 126 vertex of which 77 are kept as prefixes of interest. Removing 49 places using SCC suffix rule.1 ms
Discarding 49 places :
Also discarding 0 output transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 77 transition count 73
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 77 transition count 73
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 3 rules in 6 ms. Remains 77 /126 variables (removed 49) and now considering 73/73 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 77/166 places, 73/162 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 11236 ms. Remains : 77/166 places, 73/162 transitions.
Built C files in :
/tmp/ltsmin4745398326210795876
[2024-05-25 15:45:55] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4745398326210795876
Running compilation step : cd /tmp/ltsmin4745398326210795876;'/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 771 ms.
Running link step : cd /tmp/ltsmin4745398326210795876;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin4745398326210795876;'/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/stateBased15906878305920718691.hoa' '--buchi-type=spotba'
LTSmin run took 461 ms.
FORMULA ParamProductionCell-PT-1-LTLFireability-15 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-1-LTLFireability-15 finished in 57740 ms.
All properties solved by simple procedures.
Total runtime 228406 ms.

BK_STOP 1716651956821

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ParamProductionCell-PT-1"
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 ParamProductionCell-PT-1, 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 r268-smll-171654406700020"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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