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.r512-smll-171654406800036.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is ParamProductionCell-PT-3, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r512-smll-171654406800036
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K 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.1K Apr 23 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K 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 6.5K Apr 12 20:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 46K Apr 12 20:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 12 20:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 12 20:26 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-3-LTLFireability-00
FORMULA_NAME ParamProductionCell-PT-3-LTLFireability-01
FORMULA_NAME ParamProductionCell-PT-3-LTLFireability-02
FORMULA_NAME ParamProductionCell-PT-3-LTLFireability-03
FORMULA_NAME ParamProductionCell-PT-3-LTLFireability-04
FORMULA_NAME ParamProductionCell-PT-3-LTLFireability-05
FORMULA_NAME ParamProductionCell-PT-3-LTLFireability-06
FORMULA_NAME ParamProductionCell-PT-3-LTLFireability-07
FORMULA_NAME ParamProductionCell-PT-3-LTLFireability-08
FORMULA_NAME ParamProductionCell-PT-3-LTLFireability-09
FORMULA_NAME ParamProductionCell-PT-3-LTLFireability-10
FORMULA_NAME ParamProductionCell-PT-3-LTLFireability-11
FORMULA_NAME ParamProductionCell-PT-3-LTLFireability-12
FORMULA_NAME ParamProductionCell-PT-3-LTLFireability-13
FORMULA_NAME ParamProductionCell-PT-3-LTLFireability-14
FORMULA_NAME ParamProductionCell-PT-3-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717243528171

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ParamProductionCell-PT-3
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 12:05:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 12:05:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 12:05:31] [INFO ] Load time of PNML (sax parser for PT used): 206 ms
[2024-06-01 12:05:31] [INFO ] Transformed 231 places.
[2024-06-01 12:05:31] [INFO ] Transformed 202 transitions.
[2024-06-01 12:05:31] [INFO ] Found NUPN structural information;
[2024-06-01 12:05:31] [INFO ] Parsed PT model containing 231 places and 202 transitions and 846 arcs in 544 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 26 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA ParamProductionCell-PT-3-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-3-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-3-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-3-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-3-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-3-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 202/202 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 226 transition count 197
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 226 transition count 197
Applied a total of 10 rules in 98 ms. Remains 226 /231 variables (removed 5) and now considering 197/202 (removed 5) transitions.
// Phase 1: matrix 197 rows 226 cols
[2024-06-01 12:05:31] [INFO ] Computed 59 invariants in 45 ms
[2024-06-01 12:05:32] [INFO ] Implicit Places using invariants in 987 ms returned [16, 18, 19, 24, 31, 35, 36, 41, 42, 47, 59, 64, 65, 73, 99, 101, 114, 115, 117, 119, 120, 160, 161, 165, 166, 191, 192, 195, 196, 202, 217]
Discarding 31 places :
Implicit Place search using SMT only with invariants took 1053 ms to find 31 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 195/231 places, 197/202 transitions.
Applied a total of 0 rules in 24 ms. Remains 195 /195 variables (removed 0) and now considering 197/197 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1226 ms. Remains : 195/231 places, 197/202 transitions.
Support contains 36 out of 195 places after structural reductions.
[2024-06-01 12:05:33] [INFO ] Flatten gal took : 92 ms
[2024-06-01 12:05:33] [INFO ] Flatten gal took : 40 ms
[2024-06-01 12:05:33] [INFO ] Input system was already deterministic with 197 transitions.
RANDOM walk for 18130 steps (4 resets) in 1210 ms. (14 steps per ms) remains 0/18 properties
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0&&F(p1)))||X((X(!p2) U ((!p1&&X(!p2))||X(G(!p2)))))))'
Support contains 6 out of 195 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 197/197 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 194 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 194 transition count 196
Applied a total of 2 rules in 13 ms. Remains 194 /195 variables (removed 1) and now considering 196/197 (removed 1) transitions.
// Phase 1: matrix 196 rows 194 cols
[2024-06-01 12:05:34] [INFO ] Computed 28 invariants in 3 ms
[2024-06-01 12:05:34] [INFO ] Implicit Places using invariants in 225 ms returned [15, 64, 65, 84, 139, 171, 175]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 227 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/195 places, 196/197 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 185 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 185 transition count 194
Applied a total of 4 rules in 11 ms. Remains 185 /187 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 185 cols
[2024-06-01 12:05:34] [INFO ] Computed 21 invariants in 4 ms
[2024-06-01 12:05:34] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-06-01 12:05:34] [INFO ] Invariant cache hit.
[2024-06-01 12:05:34] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-06-01 12:05:35] [INFO ] Implicit Places using invariants and state equation in 443 ms returned []
Implicit Place search using SMT with State Equation took 596 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 185/195 places, 194/197 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 849 ms. Remains : 185/195 places, 194/197 transitions.
Stuttering acceptance computed with spot in 583 ms :[(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (AND (NOT p1) p2), (OR (AND (NOT p1) p2) (AND (NOT p0) p2)), (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (AND (NOT p1) p2), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ParamProductionCell-PT-3-LTLFireability-00
Product exploration explored 100000 steps with 33333 reset in 695 ms.
Product exploration explored 100000 steps with 33333 reset in 404 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 p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) p1 p2))), (X p0), (X (AND p0 (NOT p1))), (X (NOT p1)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 16 factoid took 36 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ParamProductionCell-PT-3-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ParamProductionCell-PT-3-LTLFireability-00 finished in 2703 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(!(X(p0) U !p1)))'
Support contains 4 out of 195 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 197/197 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 194 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 194 transition count 196
Applied a total of 2 rules in 14 ms. Remains 194 /195 variables (removed 1) and now considering 196/197 (removed 1) transitions.
// Phase 1: matrix 196 rows 194 cols
[2024-06-01 12:05:37] [INFO ] Computed 28 invariants in 4 ms
[2024-06-01 12:05:37] [INFO ] Implicit Places using invariants in 229 ms returned [15, 37, 64, 65, 84, 139, 171, 175]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 231 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 186/195 places, 196/197 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 184 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 184 transition count 194
Applied a total of 4 rules in 11 ms. Remains 184 /186 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 184 cols
[2024-06-01 12:05:37] [INFO ] Computed 20 invariants in 2 ms
[2024-06-01 12:05:37] [INFO ] Implicit Places using invariants in 159 ms returned []
[2024-06-01 12:05:37] [INFO ] Invariant cache hit.
[2024-06-01 12:05:37] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-06-01 12:05:37] [INFO ] Implicit Places using invariants and state equation in 477 ms returned []
Implicit Place search using SMT with State Equation took 644 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 184/195 places, 194/197 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 902 ms. Remains : 184/195 places, 194/197 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (AND (NOT p1) p0)]
Running random walk in product with property : ParamProductionCell-PT-3-LTLFireability-01
Product exploration explored 100000 steps with 366 reset in 633 ms.
Stack based approach found an accepted trace after 1186 steps with 5 reset with depth 218 and stack size 218 in 8 ms.
FORMULA ParamProductionCell-PT-3-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-3-LTLFireability-01 finished in 1690 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 5 out of 195 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 197/197 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 194 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 194 transition count 196
Applied a total of 2 rules in 12 ms. Remains 194 /195 variables (removed 1) and now considering 196/197 (removed 1) transitions.
// Phase 1: matrix 196 rows 194 cols
[2024-06-01 12:05:38] [INFO ] Computed 28 invariants in 9 ms
[2024-06-01 12:05:38] [INFO ] Implicit Places using invariants in 213 ms returned [15, 37, 65, 84, 139, 175]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 217 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 188/195 places, 196/197 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 12 ms. Remains 186 /188 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 186 cols
[2024-06-01 12:05:38] [INFO ] Computed 22 invariants in 2 ms
[2024-06-01 12:05:39] [INFO ] Implicit Places using invariants in 207 ms returned []
[2024-06-01 12:05:39] [INFO ] Invariant cache hit.
[2024-06-01 12:05:39] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-06-01 12:05:39] [INFO ] Implicit Places using invariants and state equation in 671 ms returned []
Implicit Place search using SMT with State Equation took 882 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 186/195 places, 194/197 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1126 ms. Remains : 186/195 places, 194/197 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-3-LTLFireability-03
Product exploration explored 100000 steps with 799 reset in 200 ms.
Product exploration explored 100000 steps with 806 reset in 234 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 203 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 500 steps (0 resets) in 7 ms. (62 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 148 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
[2024-06-01 12:05:41] [INFO ] Invariant cache hit.
[2024-06-01 12:05:41] [INFO ] [Real]Absence check using 18 positive place invariants in 13 ms returned sat
[2024-06-01 12:05:41] [INFO ] [Real]Absence check using 18 positive and 4 generalized place invariants in 9 ms returned sat
[2024-06-01 12:05:41] [INFO ] [Real]Absence check using state equation in 379 ms returned sat
[2024-06-01 12:05:41] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:05:42] [INFO ] [Nat]Absence check using 18 positive place invariants in 17 ms returned sat
[2024-06-01 12:05:42] [INFO ] [Nat]Absence check using 18 positive and 4 generalized place invariants in 6 ms returned sat
[2024-06-01 12:05:42] [INFO ] [Nat]Absence check using state equation in 617 ms returned sat
[2024-06-01 12:05:42] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-06-01 12:05:42] [INFO ] [Nat]Added 68 Read/Feed constraints in 36 ms returned sat
[2024-06-01 12:05:42] [INFO ] Deduced a trap composed of 15 places in 171 ms of which 13 ms to minimize.
[2024-06-01 12:05:43] [INFO ] Deduced a trap composed of 5 places in 133 ms of which 5 ms to minimize.
[2024-06-01 12:05:43] [INFO ] Deduced a trap composed of 7 places in 135 ms of which 4 ms to minimize.
[2024-06-01 12:05:43] [INFO ] Deduced a trap composed of 7 places in 115 ms of which 3 ms to minimize.
[2024-06-01 12:05:43] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 3 ms to minimize.
[2024-06-01 12:05:43] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 3 ms to minimize.
[2024-06-01 12:05:44] [INFO ] Deduced a trap composed of 37 places in 82 ms of which 2 ms to minimize.
[2024-06-01 12:05:44] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 2 ms to minimize.
[2024-06-01 12:05:44] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 3 ms to minimize.
[2024-06-01 12:05:44] [INFO ] Deduced a trap composed of 30 places in 103 ms of which 3 ms to minimize.
[2024-06-01 12:05:44] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 3 ms to minimize.
[2024-06-01 12:05:44] [INFO ] Deduced a trap composed of 21 places in 96 ms of which 3 ms to minimize.
[2024-06-01 12:05:44] [INFO ] Deduced a trap composed of 28 places in 88 ms of which 2 ms to minimize.
[2024-06-01 12:05:45] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 2 ms to minimize.
[2024-06-01 12:05:45] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 2 ms to minimize.
[2024-06-01 12:05:45] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 3 ms to minimize.
[2024-06-01 12:05:45] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 2 ms to minimize.
[2024-06-01 12:05:45] [INFO ] Deduced a trap composed of 40 places in 125 ms of which 3 ms to minimize.
[2024-06-01 12:05:45] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 2 ms to minimize.
[2024-06-01 12:05:45] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 3 ms to minimize.
[2024-06-01 12:05:45] [INFO ] Deduced a trap composed of 22 places in 97 ms of which 3 ms to minimize.
[2024-06-01 12:05:46] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 2 ms to minimize.
[2024-06-01 12:05:46] [INFO ] Deduced a trap composed of 26 places in 121 ms of which 3 ms to minimize.
[2024-06-01 12:05:46] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 3 ms to minimize.
[2024-06-01 12:05:46] [INFO ] Deduced a trap composed of 24 places in 111 ms of which 3 ms to minimize.
[2024-06-01 12:05:46] [INFO ] Deduced a trap composed of 25 places in 102 ms of which 3 ms to minimize.
[2024-06-01 12:05:46] [INFO ] Deduced a trap composed of 5 places in 128 ms of which 3 ms to minimize.
[2024-06-01 12:05:46] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 3 ms to minimize.
[2024-06-01 12:05:46] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:05:47] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:05:47] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 2 ms to minimize.
[2024-06-01 12:05:47] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 4555 ms
[2024-06-01 12:05:47] [INFO ] Computed and/alt/rep : 191/319/191 causal constraints (skipped 0 transitions) in 32 ms.
[2024-06-01 12:05:49] [INFO ] Added : 186 causal constraints over 38 iterations in 1841 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 5 out of 186 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 186/186 places, 194/194 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 186 transition count 156
Reduce places removed 38 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 40 rules applied. Total rules applied 78 place count 148 transition count 154
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 80 place count 146 transition count 154
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 80 place count 146 transition count 142
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 104 place count 134 transition count 142
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 188 place count 92 transition count 100
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 3 with 2 rules applied. Total rules applied 190 place count 91 transition count 99
Applied a total of 190 rules in 52 ms. Remains 91 /186 variables (removed 95) and now considering 99/194 (removed 95) transitions.
// Phase 1: matrix 99 rows 91 cols
[2024-06-01 12:05:49] [INFO ] Computed 22 invariants in 1 ms
[2024-06-01 12:05:49] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-06-01 12:05:49] [INFO ] Invariant cache hit.
[2024-06-01 12:05:49] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-06-01 12:05:49] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 427 ms to find 0 implicit places.
[2024-06-01 12:05:49] [INFO ] Redundant transitions in 4 ms returned []
Running 97 sub problems to find dead transitions.
[2024-06-01 12:05:49] [INFO ] Invariant cache hit.
[2024-06-01 12:05:49] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 12:05:50] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:05:50] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 2 ms to minimize.
[2024-06-01 12:05:50] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 2 ms to minimize.
[2024-06-01 12:05:50] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 10 ms to minimize.
[2024-06-01 12:05:50] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:05:50] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 2 ms to minimize.
[2024-06-01 12:05:50] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 3 ms to minimize.
[2024-06-01 12:05:50] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 2 ms to minimize.
[2024-06-01 12:05:50] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:05:50] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 2 ms to minimize.
[2024-06-01 12:05:51] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 2 ms to minimize.
[2024-06-01 12:05:51] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 2 ms to minimize.
[2024-06-01 12:05:51] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:05:51] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:05:51] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:05:51] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:05:51] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 2 ms to minimize.
[2024-06-01 12:05:51] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-06-01 12:05:51] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 2 ms to minimize.
[2024-06-01 12:05:51] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 12:05:51] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:05:51] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:05:51] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:05:51] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 2 ms to minimize.
[2024-06-01 12:05:51] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:05:51] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 2 ms to minimize.
[2024-06-01 12:05:52] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:05:52] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 2 ms to minimize.
[2024-06-01 12:05:52] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 2 ms to minimize.
[2024-06-01 12:05:52] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:05:52] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 2 ms to minimize.
[2024-06-01 12:05:52] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-06-01 12:05:52] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:05:52] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:05:52] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:05:52] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:05:52] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:05:52] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:05:52] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 19/59 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 12:05:53] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:05:53] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 2 ms to minimize.
[2024-06-01 12:05:53] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:05:53] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 12:05:54] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (OVERLAPS) 1/90 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 12:05:55] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:05:55] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:05:55] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 2 ms to minimize.
[2024-06-01 12:05:55] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-06-01 12:05:55] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/90 variables, 5/70 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/90 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (OVERLAPS) 1/91 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 12:05:57] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-06-01 12:05:57] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/91 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/91 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 13 (OVERLAPS) 99/190 variables, 91/164 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/190 variables, 67/231 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/190 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 16 (OVERLAPS) 0/190 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 231 constraints, problems are : Problem set: 0 solved, 97 unsolved in 11650 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 91/91 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 51/51 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 50/70 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 12:06:02] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-06-01 12:06:02] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (OVERLAPS) 1/90 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (OVERLAPS) 1/91 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 12:06:03] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/91 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/91 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (OVERLAPS) 99/190 variables, 91/167 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/190 variables, 67/234 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/190 variables, 97/331 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/190 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 12:06:07] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/190 variables, 1/332 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/190 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 17 (OVERLAPS) 0/190 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 332 constraints, problems are : Problem set: 0 solved, 97 unsolved in 10324 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 91/91 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 55/55 constraints]
After SMT, in 22083ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 22096ms
Starting structural reductions in SI_LTL mode, iteration 1 : 91/186 places, 99/194 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 22591 ms. Remains : 91/186 places, 99/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 (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 250 steps (0 resets) in 7 ms. (31 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 113 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 90 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
[2024-06-01 12:06:12] [INFO ] Invariant cache hit.
[2024-06-01 12:06:12] [INFO ] [Real]Absence check using 18 positive place invariants in 9 ms returned sat
[2024-06-01 12:06:12] [INFO ] [Real]Absence check using 18 positive and 4 generalized place invariants in 4 ms returned sat
[2024-06-01 12:06:12] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2024-06-01 12:06:12] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:06:12] [INFO ] [Nat]Absence check using 18 positive place invariants in 10 ms returned sat
[2024-06-01 12:06:12] [INFO ] [Nat]Absence check using 18 positive and 4 generalized place invariants in 4 ms returned sat
[2024-06-01 12:06:12] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
[2024-06-01 12:06:12] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-06-01 12:06:12] [INFO ] [Nat]Added 67 Read/Feed constraints in 22 ms returned sat
[2024-06-01 12:06:12] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 2 ms to minimize.
[2024-06-01 12:06:12] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 1 ms to minimize.
[2024-06-01 12:06:12] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 1 ms to minimize.
[2024-06-01 12:06:13] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 2 ms to minimize.
[2024-06-01 12:06:13] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 2 ms to minimize.
[2024-06-01 12:06:13] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 2 ms to minimize.
[2024-06-01 12:06:13] [INFO ] Deduced a trap composed of 3 places in 86 ms of which 2 ms to minimize.
[2024-06-01 12:06:13] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
[2024-06-01 12:06:13] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:06:13] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:06:13] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 2 ms to minimize.
[2024-06-01 12:06:13] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 956 ms
[2024-06-01 12:06:13] [INFO ] Computed and/alt/rep : 97/231/97 causal constraints (skipped 0 transitions) in 13 ms.
[2024-06-01 12:06:13] [INFO ] Added : 72 causal constraints over 15 iterations in 330 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1532 reset in 242 ms.
Product exploration explored 100000 steps with 1526 reset in 456 ms.
Support contains 5 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 99/99 transitions.
Applied a total of 0 rules in 7 ms. Remains 91 /91 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2024-06-01 12:06:14] [INFO ] Invariant cache hit.
[2024-06-01 12:06:14] [INFO ] Implicit Places using invariants in 178 ms returned []
[2024-06-01 12:06:14] [INFO ] Invariant cache hit.
[2024-06-01 12:06:15] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-06-01 12:06:15] [INFO ] Implicit Places using invariants and state equation in 350 ms returned []
Implicit Place search using SMT with State Equation took 530 ms to find 0 implicit places.
[2024-06-01 12:06:15] [INFO ] Redundant transitions in 4 ms returned []
Running 97 sub problems to find dead transitions.
[2024-06-01 12:06:15] [INFO ] Invariant cache hit.
[2024-06-01 12:06:15] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 12:06:15] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:06:15] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:06:15] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:06:15] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:06:15] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-06-01 12:06:16] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:06:16] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:06:16] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:06:16] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:06:16] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:06:16] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:06:16] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 2 ms to minimize.
[2024-06-01 12:06:16] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:06:16] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 2 ms to minimize.
[2024-06-01 12:06:16] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-06-01 12:06:16] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:06:16] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:06:16] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-06-01 12:06:16] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:06:16] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 12:06:16] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:06:16] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:06:16] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2024-06-01 12:06:16] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-01 12:06:16] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:06:16] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 2 ms to minimize.
[2024-06-01 12:06:17] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:06:17] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:06:17] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:06:17] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-06-01 12:06:17] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:06:17] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-06-01 12:06:17] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:06:17] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:06:17] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:06:17] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:06:17] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 2 ms to minimize.
[2024-06-01 12:06:17] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:06:17] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 19/59 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 12:06:17] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-06-01 12:06:17] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:06:18] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2024-06-01 12:06:18] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 12:06:18] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (OVERLAPS) 1/90 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 12:06:19] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:06:19] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 2 ms to minimize.
[2024-06-01 12:06:19] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:06:19] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:06:19] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/90 variables, 5/70 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/90 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (OVERLAPS) 1/91 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 12:06:20] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:06:20] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/91 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/91 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 13 (OVERLAPS) 99/190 variables, 91/164 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/190 variables, 67/231 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/190 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 16 (OVERLAPS) 0/190 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 231 constraints, problems are : Problem set: 0 solved, 97 unsolved in 7899 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 91/91 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 51/51 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 50/70 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 12:06:23] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:06:23] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (OVERLAPS) 1/90 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (OVERLAPS) 1/91 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 12:06:24] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/91 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/91 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (OVERLAPS) 99/190 variables, 91/167 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/190 variables, 67/234 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/190 variables, 97/331 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/190 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 12:06:27] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/190 variables, 1/332 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/190 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 17 (OVERLAPS) 0/190 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 332 constraints, problems are : Problem set: 0 solved, 97 unsolved in 6572 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 91/91 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 55/55 constraints]
After SMT, in 14528ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 14533ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 15082 ms. Remains : 91/91 places, 99/99 transitions.
Treatment of property ParamProductionCell-PT-3-LTLFireability-03 finished in 51231 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)||F(G((p1||X(F(p2))))))))'
Support contains 6 out of 195 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 197/197 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 194 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 194 transition count 196
Applied a total of 2 rules in 9 ms. Remains 194 /195 variables (removed 1) and now considering 196/197 (removed 1) transitions.
// Phase 1: matrix 196 rows 194 cols
[2024-06-01 12:06:29] [INFO ] Computed 28 invariants in 1 ms
[2024-06-01 12:06:30] [INFO ] Implicit Places using invariants in 144 ms returned [15, 64, 65, 84, 139, 171, 175]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 145 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/195 places, 196/197 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 185 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 185 transition count 194
Applied a total of 4 rules in 7 ms. Remains 185 /187 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 185 cols
[2024-06-01 12:06:30] [INFO ] Computed 21 invariants in 2 ms
[2024-06-01 12:06:30] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-06-01 12:06:30] [INFO ] Invariant cache hit.
[2024-06-01 12:06:30] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-06-01 12:06:30] [INFO ] Implicit Places using invariants and state equation in 373 ms returned []
Implicit Place search using SMT with State Equation took 491 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 185/195 places, 194/197 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 653 ms. Remains : 185/195 places, 194/197 transitions.
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : ParamProductionCell-PT-3-LTLFireability-04
Product exploration explored 100000 steps with 1612 reset in 182 ms.
Product exploration explored 100000 steps with 1611 reset in 202 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 p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 143 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
RANDOM walk for 1027 steps (0 resets) in 14 ms. (68 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p2), (F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT (OR p2 (NOT p1))))]
Knowledge based reduction with 11 factoid took 292 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
[2024-06-01 12:06:31] [INFO ] Invariant cache hit.
[2024-06-01 12:06:31] [INFO ] [Real]Absence check using 20 positive place invariants in 13 ms returned sat
[2024-06-01 12:06:31] [INFO ] [Real]Absence check using 20 positive and 1 generalized place invariants in 5 ms returned sat
[2024-06-01 12:06:32] [INFO ] [Real]Absence check using state equation in 323 ms returned sat
[2024-06-01 12:06:32] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:06:32] [INFO ] [Nat]Absence check using 20 positive place invariants in 19 ms returned sat
[2024-06-01 12:06:32] [INFO ] [Nat]Absence check using 20 positive and 1 generalized place invariants in 4 ms returned sat
[2024-06-01 12:06:33] [INFO ] [Nat]Absence check using state equation in 515 ms returned sat
[2024-06-01 12:06:33] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-06-01 12:06:33] [INFO ] [Nat]Added 68 Read/Feed constraints in 46 ms returned sat
[2024-06-01 12:06:33] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 3 ms to minimize.
[2024-06-01 12:06:33] [INFO ] Deduced a trap composed of 7 places in 105 ms of which 3 ms to minimize.
[2024-06-01 12:06:33] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 2 ms to minimize.
[2024-06-01 12:06:33] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 2 ms to minimize.
[2024-06-01 12:06:33] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 2 ms to minimize.
[2024-06-01 12:06:33] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 2 ms to minimize.
[2024-06-01 12:06:33] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 2 ms to minimize.
[2024-06-01 12:06:34] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 2 ms to minimize.
[2024-06-01 12:06:34] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 2 ms to minimize.
[2024-06-01 12:06:34] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:06:34] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2024-06-01 12:06:34] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1244 ms
[2024-06-01 12:06:34] [INFO ] Computed and/alt/rep : 191/317/191 causal constraints (skipped 0 transitions) in 23 ms.
[2024-06-01 12:06:36] [INFO ] Added : 177 causal constraints over 36 iterations in 1653 ms. Result :sat
Could not prove EG (AND (NOT p2) (NOT p1))
Support contains 3 out of 185 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 194/194 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 185 transition count 155
Reduce places removed 39 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 40 rules applied. Total rules applied 79 place count 146 transition count 154
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 80 place count 145 transition count 154
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 80 place count 145 transition count 144
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 100 place count 135 transition count 144
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 186 place count 92 transition count 101
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 3 with 2 rules applied. Total rules applied 188 place count 91 transition count 100
Applied a total of 188 rules in 49 ms. Remains 91 /185 variables (removed 94) and now considering 100/194 (removed 94) transitions.
// Phase 1: matrix 100 rows 91 cols
[2024-06-01 12:06:36] [INFO ] Computed 21 invariants in 1 ms
[2024-06-01 12:06:36] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-06-01 12:06:36] [INFO ] Invariant cache hit.
[2024-06-01 12:06:36] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-06-01 12:06:36] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
[2024-06-01 12:06:36] [INFO ] Redundant transitions in 4 ms returned []
Running 98 sub problems to find dead transitions.
[2024-06-01 12:06:36] [INFO ] Invariant cache hit.
[2024-06-01 12:06:36] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-06-01 12:06:37] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 2 ms to minimize.
[2024-06-01 12:06:37] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 2 ms to minimize.
[2024-06-01 12:06:37] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:06:37] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-06-01 12:06:37] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:06:37] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:06:37] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:06:37] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-06-01 12:06:37] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:06:37] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:06:37] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2024-06-01 12:06:37] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:06:37] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 2 ms to minimize.
[2024-06-01 12:06:37] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 2 ms to minimize.
[2024-06-01 12:06:37] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 2 ms to minimize.
[2024-06-01 12:06:37] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:06:37] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 2 ms to minimize.
[2024-06-01 12:06:37] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:06:37] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 2 ms to minimize.
[2024-06-01 12:06:38] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-06-01 12:06:38] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:06:38] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 2 ms to minimize.
[2024-06-01 12:06:38] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:06:38] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:06:38] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 2 ms to minimize.
[2024-06-01 12:06:38] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-06-01 12:06:38] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:06:38] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:06:38] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:06:38] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 2 ms to minimize.
[2024-06-01 12:06:38] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:06:38] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:06:38] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:06:38] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:06:38] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:06:39] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:06:39] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 17/56 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-06-01 12:06:39] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 2/91 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-06-01 12:06:41] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 2 ms to minimize.
[2024-06-01 12:06:41] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:06:41] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 2 ms to minimize.
[2024-06-01 12:06:41] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-06-01 12:06:42] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/91 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/91 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 10 (OVERLAPS) 100/191 variables, 91/155 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/191 variables, 67/222 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/191 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 13 (OVERLAPS) 0/191 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 222 constraints, problems are : Problem set: 0 solved, 98 unsolved in 9488 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 91/91 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 43/43 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 42/61 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 2/91 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-06-01 12:06:47] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (OVERLAPS) 100/191 variables, 91/156 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 67/223 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 98/321 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-06-01 12:06:49] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 2 ms to minimize.
[2024-06-01 12:06:49] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/191 variables, 2/323 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-06-01 12:06:50] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/191 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/191 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 14 (OVERLAPS) 0/191 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 324 constraints, problems are : Problem set: 0 solved, 98 unsolved in 8471 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 91/91 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 47/47 constraints]
After SMT, in 18007ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 18012ms
Starting structural reductions in SI_LTL mode, iteration 1 : 91/185 places, 100/194 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18467 ms. Remains : 91/185 places, 100/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 p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p2) p1))), (X (AND (NOT p2) (NOT p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 128 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 2241 steps (0 resets) in 16 ms. (131 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p2) p1))), (X (AND (NOT p2) (NOT p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p2), (F (NOT (OR (NOT p1) p2))), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 9 factoid took 233 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
[2024-06-01 12:06:55] [INFO ] Invariant cache hit.
[2024-06-01 12:06:55] [INFO ] [Real]Absence check using 19 positive place invariants in 12 ms returned sat
[2024-06-01 12:06:55] [INFO ] [Real]Absence check using 19 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-01 12:06:55] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2024-06-01 12:06:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:06:55] [INFO ] [Nat]Absence check using 19 positive place invariants in 11 ms returned sat
[2024-06-01 12:06:55] [INFO ] [Nat]Absence check using 19 positive and 2 generalized place invariants in 3 ms returned sat
[2024-06-01 12:06:55] [INFO ] [Nat]Absence check using state equation in 116 ms returned sat
[2024-06-01 12:06:55] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-06-01 12:06:55] [INFO ] [Nat]Added 67 Read/Feed constraints in 16 ms returned sat
[2024-06-01 12:06:55] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 2 ms to minimize.
[2024-06-01 12:06:55] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:06:55] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:06:55] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 2 ms to minimize.
[2024-06-01 12:06:55] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:06:56] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:06:56] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 2 ms to minimize.
[2024-06-01 12:06:56] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:06:56] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 2 ms to minimize.
[2024-06-01 12:06:56] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2024-06-01 12:06:56] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 2 ms to minimize.
[2024-06-01 12:06:56] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 2 ms to minimize.
[2024-06-01 12:06:56] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 2 ms to minimize.
[2024-06-01 12:06:56] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 1 ms to minimize.
[2024-06-01 12:06:56] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 2 ms to minimize.
[2024-06-01 12:06:56] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 2 ms to minimize.
[2024-06-01 12:06:56] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 2 ms to minimize.
[2024-06-01 12:06:56] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:06:56] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-06-01 12:06:57] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 2 ms to minimize.
[2024-06-01 12:06:57] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-06-01 12:06:57] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 3 ms to minimize.
[2024-06-01 12:06:57] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-06-01 12:06:57] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 1646 ms
[2024-06-01 12:06:57] [INFO ] Computed and/alt/rep : 98/230/98 causal constraints (skipped 0 transitions) in 13 ms.
[2024-06-01 12:06:57] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:06:57] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:06:57] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 2 ms to minimize.
[2024-06-01 12:06:57] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:06:57] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 265 ms
[2024-06-01 12:06:58] [INFO ] Added : 94 causal constraints over 19 iterations in 700 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 244 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 2943 reset in 235 ms.
Product exploration explored 100000 steps with 2941 reset in 264 ms.
Support contains 3 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 100/100 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 89 transition count 98
Applied a total of 4 rules in 10 ms. Remains 89 /91 variables (removed 2) and now considering 98/100 (removed 2) transitions.
// Phase 1: matrix 98 rows 89 cols
[2024-06-01 12:06:58] [INFO ] Computed 21 invariants in 1 ms
[2024-06-01 12:06:58] [INFO ] Implicit Places using invariants in 194 ms returned [21]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 196 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 88/91 places, 98/100 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 88 transition count 97
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 87 transition count 97
Applied a total of 2 rules in 9 ms. Remains 87 /88 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 87 cols
[2024-06-01 12:06:58] [INFO ] Computed 20 invariants in 2 ms
[2024-06-01 12:06:59] [INFO ] Implicit Places using invariants in 171 ms returned []
[2024-06-01 12:06:59] [INFO ] Invariant cache hit.
[2024-06-01 12:06:59] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-06-01 12:06:59] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 503 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 87/91 places, 97/100 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 718 ms. Remains : 87/91 places, 97/100 transitions.
Treatment of property ParamProductionCell-PT-3-LTLFireability-04 finished in 29607 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 4 out of 195 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 195/195 places, 197/197 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 195 transition count 162
Reduce places removed 35 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 36 rules applied. Total rules applied 71 place count 160 transition count 161
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 159 transition count 161
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 72 place count 159 transition count 151
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 92 place count 149 transition count 151
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 164 place count 113 transition count 115
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 3 with 2 rules applied. Total rules applied 166 place count 112 transition count 114
Applied a total of 166 rules in 29 ms. Remains 112 /195 variables (removed 83) and now considering 114/197 (removed 83) transitions.
// Phase 1: matrix 114 rows 112 cols
[2024-06-01 12:06:59] [INFO ] Computed 28 invariants in 2 ms
[2024-06-01 12:06:59] [INFO ] Implicit Places using invariants in 244 ms returned [10, 22, 37, 38, 78, 99, 101]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 253 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/195 places, 114/197 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 105 transition count 113
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 104 transition count 113
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 104 transition count 110
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 101 transition count 110
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 22 place count 94 transition count 103
Applied a total of 22 rules in 16 ms. Remains 94 /105 variables (removed 11) and now considering 103/114 (removed 11) transitions.
// Phase 1: matrix 103 rows 94 cols
[2024-06-01 12:06:59] [INFO ] Computed 21 invariants in 1 ms
[2024-06-01 12:07:00] [INFO ] Implicit Places using invariants in 198 ms returned []
[2024-06-01 12:07:00] [INFO ] Invariant cache hit.
[2024-06-01 12:07:00] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-06-01 12:07:00] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 514 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 94/195 places, 103/197 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 812 ms. Remains : 94/195 places, 103/197 transitions.
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ParamProductionCell-PT-3-LTLFireability-05
Product exploration explored 100000 steps with 946 reset in 241 ms.
Product exploration explored 100000 steps with 943 reset in 270 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 5 factoid took 376 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 423 steps (0 resets) in 11 ms. (35 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 5 factoid took 550 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 94 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 94/94 places, 103/103 transitions.
Applied a total of 0 rules in 6 ms. Remains 94 /94 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2024-06-01 12:07:02] [INFO ] Invariant cache hit.
[2024-06-01 12:07:02] [INFO ] Implicit Places using invariants in 212 ms returned []
[2024-06-01 12:07:02] [INFO ] Invariant cache hit.
[2024-06-01 12:07:02] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-06-01 12:07:02] [INFO ] Implicit Places using invariants and state equation in 352 ms returned []
Implicit Place search using SMT with State Equation took 566 ms to find 0 implicit places.
[2024-06-01 12:07:02] [INFO ] Redundant transitions in 3 ms returned []
Running 101 sub problems to find dead transitions.
[2024-06-01 12:07:02] [INFO ] Invariant cache hit.
[2024-06-01 12:07:02] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-06-01 12:07:03] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 2 ms to minimize.
[2024-06-01 12:07:03] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 2 ms to minimize.
[2024-06-01 12:07:03] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 2 ms to minimize.
[2024-06-01 12:07:03] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 2 ms to minimize.
[2024-06-01 12:07:03] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-06-01 12:07:03] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 2 ms to minimize.
[2024-06-01 12:07:04] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2024-06-01 12:07:04] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 2 ms to minimize.
[2024-06-01 12:07:04] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 2 ms to minimize.
[2024-06-01 12:07:04] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 2 ms to minimize.
[2024-06-01 12:07:04] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:07:04] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:07:04] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 2 ms to minimize.
[2024-06-01 12:07:04] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:07:04] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
[2024-06-01 12:07:04] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:07:04] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:07:04] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:07:04] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 6 ms to minimize.
[2024-06-01 12:07:04] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-06-01 12:07:04] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 2 ms to minimize.
[2024-06-01 12:07:05] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:07:05] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:07:05] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:07:05] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 2 ms to minimize.
[2024-06-01 12:07:05] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 2 ms to minimize.
[2024-06-01 12:07:05] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:07:05] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 2 ms to minimize.
[2024-06-01 12:07:05] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:07:05] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:07:05] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:07:05] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 2 ms to minimize.
[2024-06-01 12:07:05] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 2 ms to minimize.
[2024-06-01 12:07:05] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 2 ms to minimize.
[2024-06-01 12:07:05] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:07:06] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 16/55 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-06-01 12:07:06] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:07:07] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-06-01 12:07:07] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:07:07] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (OVERLAPS) 1/93 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-06-01 12:07:08] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
[2024-06-01 12:07:08] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:07:08] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/93 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-06-01 12:07:09] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:07:09] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/93 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/93 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 11 (OVERLAPS) 1/94 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/94 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 13 (OVERLAPS) 103/197 variables, 94/160 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/197 variables, 67/227 constraints. Problems are: Problem set: 0 solved, 101 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/197 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 16 (OVERLAPS) 0/197 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 227 constraints, problems are : Problem set: 0 solved, 101 unsolved in 10905 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 94/94 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 45/45 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 44/63 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-06-01 12:07:14] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 1/93 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (OVERLAPS) 1/94 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-06-01 12:07:15] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/94 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/94 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 11 (OVERLAPS) 103/197 variables, 94/162 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/197 variables, 67/229 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/197 variables, 101/330 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/197 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 15 (OVERLAPS) 0/197 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 330 constraints, problems are : Problem set: 0 solved, 101 unsolved in 7473 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 94/94 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 47/47 constraints]
After SMT, in 18417ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 18421ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 19005 ms. Remains : 94/94 places, 103/103 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 5 factoid took 382 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 467 steps (0 resets) in 10 ms. (42 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 5 factoid took 553 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 945 reset in 254 ms.
Product exploration explored 100000 steps with 953 reset in 286 ms.
Support contains 4 out of 94 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 94/94 places, 103/103 transitions.
Applied a total of 0 rules in 6 ms. Remains 94 /94 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2024-06-01 12:07:23] [INFO ] Invariant cache hit.
[2024-06-01 12:07:23] [INFO ] Implicit Places using invariants in 204 ms returned []
[2024-06-01 12:07:23] [INFO ] Invariant cache hit.
[2024-06-01 12:07:23] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-06-01 12:07:23] [INFO ] Implicit Places using invariants and state equation in 352 ms returned []
Implicit Place search using SMT with State Equation took 558 ms to find 0 implicit places.
[2024-06-01 12:07:23] [INFO ] Redundant transitions in 4 ms returned []
Running 101 sub problems to find dead transitions.
[2024-06-01 12:07:23] [INFO ] Invariant cache hit.
[2024-06-01 12:07:23] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-06-01 12:07:24] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 2 ms to minimize.
[2024-06-01 12:07:24] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 2 ms to minimize.
[2024-06-01 12:07:24] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 1 ms to minimize.
[2024-06-01 12:07:24] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2024-06-01 12:07:24] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 2 ms to minimize.
[2024-06-01 12:07:24] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 2 ms to minimize.
[2024-06-01 12:07:24] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 2 ms to minimize.
[2024-06-01 12:07:24] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:07:25] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 2 ms to minimize.
[2024-06-01 12:07:25] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 2 ms to minimize.
[2024-06-01 12:07:25] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 2 ms to minimize.
[2024-06-01 12:07:25] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 2 ms to minimize.
[2024-06-01 12:07:25] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 2 ms to minimize.
[2024-06-01 12:07:25] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:07:25] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 2 ms to minimize.
[2024-06-01 12:07:25] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:07:25] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:07:25] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 2 ms to minimize.
[2024-06-01 12:07:25] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:07:25] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-06-01 12:07:25] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:07:25] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 2 ms to minimize.
[2024-06-01 12:07:25] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:07:26] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:07:26] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:07:26] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:07:26] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:07:26] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 2 ms to minimize.
[2024-06-01 12:07:26] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:07:26] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:07:26] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:07:26] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:07:26] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:07:26] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
[2024-06-01 12:07:26] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:07:26] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 16/55 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-06-01 12:07:27] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-06-01 12:07:27] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-06-01 12:07:28] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-06-01 12:07:28] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (OVERLAPS) 1/93 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-06-01 12:07:29] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
[2024-06-01 12:07:29] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:07:29] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/93 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-06-01 12:07:30] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 2 ms to minimize.
[2024-06-01 12:07:30] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/93 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/93 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 11 (OVERLAPS) 1/94 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/94 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 13 (OVERLAPS) 103/197 variables, 94/160 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/197 variables, 67/227 constraints. Problems are: Problem set: 0 solved, 101 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/197 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 16 (OVERLAPS) 0/197 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 227 constraints, problems are : Problem set: 0 solved, 101 unsolved in 10737 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 94/94 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 45/45 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 44/63 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-06-01 12:07:34] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 1/93 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (OVERLAPS) 1/94 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-06-01 12:07:36] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/94 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/94 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 11 (OVERLAPS) 103/197 variables, 94/162 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/197 variables, 67/229 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/197 variables, 101/330 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/197 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 15 (OVERLAPS) 0/197 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 330 constraints, problems are : Problem set: 0 solved, 101 unsolved in 7841 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 94/94 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 47/47 constraints]
After SMT, in 18613ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 18616ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 19192 ms. Remains : 94/94 places, 103/103 transitions.
Treatment of property ParamProductionCell-PT-3-LTLFireability-05 finished in 42892 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 195 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 197/197 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 194 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 194 transition count 196
Applied a total of 2 rules in 6 ms. Remains 194 /195 variables (removed 1) and now considering 196/197 (removed 1) transitions.
// Phase 1: matrix 196 rows 194 cols
[2024-06-01 12:07:42] [INFO ] Computed 28 invariants in 3 ms
[2024-06-01 12:07:42] [INFO ] Implicit Places using invariants in 271 ms returned [37, 64, 65, 84, 139, 171, 175]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 273 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/195 places, 196/197 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 185 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 185 transition count 194
Applied a total of 4 rules in 5 ms. Remains 185 /187 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 185 cols
[2024-06-01 12:07:42] [INFO ] Computed 21 invariants in 2 ms
[2024-06-01 12:07:42] [INFO ] Implicit Places using invariants in 205 ms returned []
[2024-06-01 12:07:42] [INFO ] Invariant cache hit.
[2024-06-01 12:07:43] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-06-01 12:07:43] [INFO ] Implicit Places using invariants and state equation in 520 ms returned []
Implicit Place search using SMT with State Equation took 727 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 185/195 places, 194/197 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1014 ms. Remains : 185/195 places, 194/197 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-3-LTLFireability-06
Product exploration explored 100000 steps with 1227 reset in 193 ms.
Product exploration explored 100000 steps with 1222 reset in 222 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 308 steps (0 resets) in 4 ms. (61 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 141 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
[2024-06-01 12:07:44] [INFO ] Invariant cache hit.
[2024-06-01 12:07:44] [INFO ] [Real]Absence check using 19 positive place invariants in 17 ms returned sat
[2024-06-01 12:07:44] [INFO ] [Real]Absence check using 19 positive and 2 generalized place invariants in 5 ms returned sat
[2024-06-01 12:07:45] [INFO ] [Real]Absence check using state equation in 442 ms returned sat
[2024-06-01 12:07:45] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:07:45] [INFO ] [Nat]Absence check using 19 positive place invariants in 16 ms returned sat
[2024-06-01 12:07:45] [INFO ] [Nat]Absence check using 19 positive and 2 generalized place invariants in 18 ms returned sat
[2024-06-01 12:07:46] [INFO ] [Nat]Absence check using state equation in 445 ms returned sat
[2024-06-01 12:07:46] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-06-01 12:07:46] [INFO ] [Nat]Added 68 Read/Feed constraints in 47 ms returned sat
[2024-06-01 12:07:46] [INFO ] Deduced a trap composed of 7 places in 131 ms of which 3 ms to minimize.
[2024-06-01 12:07:46] [INFO ] Deduced a trap composed of 5 places in 123 ms of which 3 ms to minimize.
[2024-06-01 12:07:46] [INFO ] Deduced a trap composed of 7 places in 131 ms of which 3 ms to minimize.
[2024-06-01 12:07:46] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 3 ms to minimize.
[2024-06-01 12:07:46] [INFO ] Deduced a trap composed of 12 places in 136 ms of which 3 ms to minimize.
[2024-06-01 12:07:47] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 3 ms to minimize.
[2024-06-01 12:07:47] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 2 ms to minimize.
[2024-06-01 12:07:47] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 3 ms to minimize.
[2024-06-01 12:07:47] [INFO ] Deduced a trap composed of 26 places in 103 ms of which 3 ms to minimize.
[2024-06-01 12:07:47] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 2 ms to minimize.
[2024-06-01 12:07:47] [INFO ] Deduced a trap composed of 27 places in 108 ms of which 2 ms to minimize.
[2024-06-01 12:07:47] [INFO ] Deduced a trap composed of 41 places in 101 ms of which 3 ms to minimize.
[2024-06-01 12:07:48] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 3 ms to minimize.
[2024-06-01 12:07:48] [INFO ] Deduced a trap composed of 41 places in 98 ms of which 3 ms to minimize.
[2024-06-01 12:07:48] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 2 ms to minimize.
[2024-06-01 12:07:48] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 2 ms to minimize.
[2024-06-01 12:07:48] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:07:48] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2391 ms
[2024-06-01 12:07:48] [INFO ] Computed and/alt/rep : 191/309/191 causal constraints (skipped 0 transitions) in 25 ms.
[2024-06-01 12:07:49] [INFO ] Added : 177 causal constraints over 36 iterations in 1030 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 194/194 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 185 transition count 154
Reduce places removed 40 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 41 rules applied. Total rules applied 81 place count 145 transition count 153
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 82 place count 144 transition count 153
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 82 place count 144 transition count 141
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 106 place count 132 transition count 141
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 192 place count 89 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 3 with 2 rules applied. Total rules applied 194 place count 88 transition count 97
Applied a total of 194 rules in 25 ms. Remains 88 /185 variables (removed 97) and now considering 97/194 (removed 97) transitions.
// Phase 1: matrix 97 rows 88 cols
[2024-06-01 12:07:49] [INFO ] Computed 21 invariants in 1 ms
[2024-06-01 12:07:49] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-06-01 12:07:49] [INFO ] Invariant cache hit.
[2024-06-01 12:07:49] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-06-01 12:07:49] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 427 ms to find 0 implicit places.
[2024-06-01 12:07:49] [INFO ] Redundant transitions in 2 ms returned []
Running 95 sub problems to find dead transitions.
[2024-06-01 12:07:49] [INFO ] Invariant cache hit.
[2024-06-01 12:07:49] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 12:07:50] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 2 ms to minimize.
[2024-06-01 12:07:50] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:07:50] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:07:50] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:07:50] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:07:50] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 2 ms to minimize.
[2024-06-01 12:07:50] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:07:50] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 2 ms to minimize.
[2024-06-01 12:07:50] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 2 ms to minimize.
[2024-06-01 12:07:51] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2024-06-01 12:07:51] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:07:51] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
[2024-06-01 12:07:51] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 2 ms to minimize.
[2024-06-01 12:07:51] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 2 ms to minimize.
[2024-06-01 12:07:51] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 2 ms to minimize.
[2024-06-01 12:07:51] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2024-06-01 12:07:51] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:07:51] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:07:51] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:07:51] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 12:07:51] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:07:51] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 2 ms to minimize.
[2024-06-01 12:07:51] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 2 ms to minimize.
[2024-06-01 12:07:51] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:07:51] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:07:51] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:07:52] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:07:52] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:07:52] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 2 ms to minimize.
[2024-06-01 12:07:52] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:07:52] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:07:52] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:07:52] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 2 ms to minimize.
[2024-06-01 12:07:52] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:07:52] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:07:52] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:07:52] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 2 ms to minimize.
[2024-06-01 12:07:52] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 18/57 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 12:07:53] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (OVERLAPS) 2/88 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 12:07:54] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
[2024-06-01 12:07:54] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:07:54] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/88 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (OVERLAPS) 97/185 variables, 88/151 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/185 variables, 67/218 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/185 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 12 (OVERLAPS) 0/185 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 185/185 variables, and 218 constraints, problems are : Problem set: 0 solved, 95 unsolved in 9340 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 88/88 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 42/42 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 41/60 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (OVERLAPS) 2/88 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (OVERLAPS) 97/185 variables, 88/151 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/185 variables, 67/218 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/185 variables, 95/313 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/185 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 11 (OVERLAPS) 0/185 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 185/185 variables, and 313 constraints, problems are : Problem set: 0 solved, 95 unsolved in 5321 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 88/88 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 42/42 constraints]
After SMT, in 14688ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 14689ms
Starting structural reductions in SI_LTL mode, iteration 1 : 88/185 places, 97/194 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15151 ms. Remains : 88/185 places, 97/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 (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 83 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)]
RANDOM walk for 140 steps (0 resets) in 4 ms. (28 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 126 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 103 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
[2024-06-01 12:08:05] [INFO ] Invariant cache hit.
[2024-06-01 12:08:05] [INFO ] [Real]Absence check using 19 positive place invariants in 12 ms returned sat
[2024-06-01 12:08:05] [INFO ] [Real]Absence check using 19 positive and 2 generalized place invariants in 3 ms returned sat
[2024-06-01 12:08:05] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2024-06-01 12:08:05] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:08:05] [INFO ] [Nat]Absence check using 19 positive place invariants in 11 ms returned sat
[2024-06-01 12:08:05] [INFO ] [Nat]Absence check using 19 positive and 2 generalized place invariants in 3 ms returned sat
[2024-06-01 12:08:05] [INFO ] [Nat]Absence check using state equation in 112 ms returned sat
[2024-06-01 12:08:05] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-06-01 12:08:05] [INFO ] [Nat]Added 67 Read/Feed constraints in 19 ms returned sat
[2024-06-01 12:08:05] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 2 ms to minimize.
[2024-06-01 12:08:05] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 2 ms to minimize.
[2024-06-01 12:08:05] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-06-01 12:08:06] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:08:06] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:08:06] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-06-01 12:08:06] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 406 ms
[2024-06-01 12:08:06] [INFO ] Computed and/alt/rep : 95/219/95 causal constraints (skipped 0 transitions) in 9 ms.
[2024-06-01 12:08:06] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:08:06] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:08:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 102 ms
[2024-06-01 12:08:06] [INFO ] Added : 92 causal constraints over 19 iterations in 336 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2560 reset in 125 ms.
Product exploration explored 100000 steps with 2555 reset in 145 ms.
Support contains 2 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 97/97 transitions.
Applied a total of 0 rules in 3 ms. Remains 88 /88 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2024-06-01 12:08:06] [INFO ] Invariant cache hit.
[2024-06-01 12:08:06] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-06-01 12:08:06] [INFO ] Invariant cache hit.
[2024-06-01 12:08:07] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-06-01 12:08:07] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 490 ms to find 0 implicit places.
[2024-06-01 12:08:07] [INFO ] Redundant transitions in 1 ms returned []
Running 95 sub problems to find dead transitions.
[2024-06-01 12:08:07] [INFO ] Invariant cache hit.
[2024-06-01 12:08:07] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 12:08:07] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:08:07] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
[2024-06-01 12:08:07] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 0 ms to minimize.
[2024-06-01 12:08:07] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:08:07] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:08:08] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:08:08] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:08:08] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 2 ms to minimize.
[2024-06-01 12:08:08] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:08:08] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:08:08] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 2 ms to minimize.
[2024-06-01 12:08:08] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 2 ms to minimize.
[2024-06-01 12:08:08] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:08:08] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 2 ms to minimize.
[2024-06-01 12:08:08] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:08:08] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:08:08] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:08:08] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:08:08] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:08:08] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 12:08:08] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 2 ms to minimize.
[2024-06-01 12:08:08] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:08:08] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:08:08] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:08:08] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:08:09] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:08:09] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:08:09] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 2 ms to minimize.
[2024-06-01 12:08:09] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:08:09] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:08:09] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:08:09] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
[2024-06-01 12:08:09] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:08:09] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-06-01 12:08:09] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:08:09] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 2 ms to minimize.
[2024-06-01 12:08:09] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:08:09] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 18/57 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 12:08:10] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (OVERLAPS) 2/88 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 12:08:11] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
[2024-06-01 12:08:11] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:08:11] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/88 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (OVERLAPS) 97/185 variables, 88/151 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/185 variables, 67/218 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/185 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 12 (OVERLAPS) 0/185 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 185/185 variables, and 218 constraints, problems are : Problem set: 0 solved, 95 unsolved in 8151 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 88/88 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 42/42 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 41/60 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (OVERLAPS) 2/88 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (OVERLAPS) 97/185 variables, 88/151 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/185 variables, 67/218 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/185 variables, 95/313 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/185 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 11 (OVERLAPS) 0/185 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 185/185 variables, and 313 constraints, problems are : Problem set: 0 solved, 95 unsolved in 5318 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 88/88 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 42/42 constraints]
After SMT, in 13500ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 13503ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 14006 ms. Remains : 88/88 places, 97/97 transitions.
Treatment of property ParamProductionCell-PT-3-LTLFireability-06 finished in 38425 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||G((F(p0)&&F(p1))))))'
Support contains 4 out of 195 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 197/197 transitions.
Applied a total of 0 rules in 3 ms. Remains 195 /195 variables (removed 0) and now considering 197/197 (removed 0) transitions.
// Phase 1: matrix 197 rows 195 cols
[2024-06-01 12:08:20] [INFO ] Computed 28 invariants in 2 ms
[2024-06-01 12:08:21] [INFO ] Implicit Places using invariants in 245 ms returned [15, 37, 64, 65, 140, 172]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 258 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 189/195 places, 197/197 transitions.
Applied a total of 0 rules in 2 ms. Remains 189 /189 variables (removed 0) and now considering 197/197 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 263 ms. Remains : 189/195 places, 197/197 transitions.
Stuttering acceptance computed with spot in 277 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ParamProductionCell-PT-3-LTLFireability-10
Product exploration explored 100000 steps with 382 reset in 198 ms.
Stack based approach found an accepted trace after 22771 steps with 84 reset with depth 282 and stack size 282 in 52 ms.
FORMULA ParamProductionCell-PT-3-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-3-LTLFireability-10 finished in 827 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((F(G(p0))&&(p1||X(p2)))))'
Support contains 7 out of 195 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 197/197 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 194 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 194 transition count 196
Applied a total of 2 rules in 6 ms. Remains 194 /195 variables (removed 1) and now considering 196/197 (removed 1) transitions.
// Phase 1: matrix 196 rows 194 cols
[2024-06-01 12:08:21] [INFO ] Computed 28 invariants in 2 ms
[2024-06-01 12:08:21] [INFO ] Implicit Places using invariants in 292 ms returned [15, 37, 64, 65, 84, 139, 171]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 294 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/195 places, 196/197 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 185 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 185 transition count 194
Applied a total of 4 rules in 5 ms. Remains 185 /187 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 185 cols
[2024-06-01 12:08:21] [INFO ] Computed 21 invariants in 2 ms
[2024-06-01 12:08:22] [INFO ] Implicit Places using invariants in 213 ms returned []
[2024-06-01 12:08:22] [INFO ] Invariant cache hit.
[2024-06-01 12:08:22] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-06-01 12:08:22] [INFO ] Implicit Places using invariants and state equation in 571 ms returned []
Implicit Place search using SMT with State Equation took 787 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 185/195 places, 194/197 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1095 ms. Remains : 185/195 places, 194/197 transitions.
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ParamProductionCell-PT-3-LTLFireability-12
Product exploration explored 100000 steps with 0 reset in 219 ms.
Stack based approach found an accepted trace after 243 steps with 0 reset with depth 244 and stack size 244 in 1 ms.
FORMULA ParamProductionCell-PT-3-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-3-LTLFireability-12 finished in 1506 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))&&(!p1 U p2)))'
Support contains 9 out of 195 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 197/197 transitions.
Applied a total of 0 rules in 2 ms. Remains 195 /195 variables (removed 0) and now considering 197/197 (removed 0) transitions.
// Phase 1: matrix 197 rows 195 cols
[2024-06-01 12:08:23] [INFO ] Computed 28 invariants in 4 ms
[2024-06-01 12:08:23] [INFO ] Implicit Places using invariants in 275 ms returned [15, 37, 64, 140, 172]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 277 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 190/195 places, 197/197 transitions.
Applied a total of 0 rules in 3 ms. Remains 190 /190 variables (removed 0) and now considering 197/197 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 283 ms. Remains : 190/195 places, 197/197 transitions.
Stuttering acceptance computed with spot in 189 ms :[(NOT p0), true, (OR (NOT p0) (NOT p2)), (OR (NOT p2) (NOT p0))]
Running random walk in product with property : ParamProductionCell-PT-3-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-3-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-3-LTLFireability-13 finished in 498 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 195 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 197/197 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 194 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 194 transition count 196
Applied a total of 2 rules in 6 ms. Remains 194 /195 variables (removed 1) and now considering 196/197 (removed 1) transitions.
// Phase 1: matrix 196 rows 194 cols
[2024-06-01 12:08:23] [INFO ] Computed 28 invariants in 2 ms
[2024-06-01 12:08:23] [INFO ] Implicit Places using invariants in 298 ms returned [15, 37, 64, 65, 84, 171, 175]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 300 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/195 places, 196/197 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 185 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 185 transition count 194
Applied a total of 4 rules in 5 ms. Remains 185 /187 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 185 cols
[2024-06-01 12:08:24] [INFO ] Computed 21 invariants in 1 ms
[2024-06-01 12:08:24] [INFO ] Implicit Places using invariants in 227 ms returned []
[2024-06-01 12:08:24] [INFO ] Invariant cache hit.
[2024-06-01 12:08:24] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-06-01 12:08:24] [INFO ] Implicit Places using invariants and state equation in 673 ms returned []
Implicit Place search using SMT with State Equation took 902 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 185/195 places, 194/197 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1216 ms. Remains : 185/195 places, 194/197 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-3-LTLFireability-15
Product exploration explored 100000 steps with 2387 reset in 193 ms.
Product exploration explored 100000 steps with 2388 reset in 233 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 163 steps (0 resets) in 7 ms. (20 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 138 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 100 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
[2024-06-01 12:08:26] [INFO ] Invariant cache hit.
[2024-06-01 12:08:26] [INFO ] [Real]Absence check using 18 positive place invariants in 17 ms returned sat
[2024-06-01 12:08:26] [INFO ] [Real]Absence check using 18 positive and 3 generalized place invariants in 6 ms returned sat
[2024-06-01 12:08:26] [INFO ] [Real]Absence check using state equation in 319 ms returned sat
[2024-06-01 12:08:26] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:08:26] [INFO ] [Nat]Absence check using 18 positive place invariants in 15 ms returned sat
[2024-06-01 12:08:26] [INFO ] [Nat]Absence check using 18 positive and 3 generalized place invariants in 5 ms returned sat
[2024-06-01 12:08:27] [INFO ] [Nat]Absence check using state equation in 560 ms returned sat
[2024-06-01 12:08:27] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-06-01 12:08:27] [INFO ] [Nat]Added 68 Read/Feed constraints in 35 ms returned sat
[2024-06-01 12:08:27] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 3 ms to minimize.
[2024-06-01 12:08:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2024-06-01 12:08:27] [INFO ] Computed and/alt/rep : 191/317/191 causal constraints (skipped 0 transitions) in 22 ms.
[2024-06-01 12:08:28] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
[2024-06-01 12:08:28] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 2 ms to minimize.
[2024-06-01 12:08:28] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 2 ms to minimize.
[2024-06-01 12:08:29] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 2 ms to minimize.
[2024-06-01 12:08:29] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 2 ms to minimize.
[2024-06-01 12:08:29] [INFO ] Deduced a trap composed of 40 places in 82 ms of which 2 ms to minimize.
[2024-06-01 12:08:29] [INFO ] Deduced a trap composed of 61 places in 80 ms of which 2 ms to minimize.
[2024-06-01 12:08:29] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 2 ms to minimize.
[2024-06-01 12:08:29] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 2 ms to minimize.
[2024-06-01 12:08:29] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 922 ms
[2024-06-01 12:08:29] [INFO ] Added : 186 causal constraints over 38 iterations in 2098 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 194/194 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 185 transition count 155
Reduce places removed 39 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 41 rules applied. Total rules applied 80 place count 146 transition count 153
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 82 place count 144 transition count 153
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 82 place count 144 transition count 141
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 106 place count 132 transition count 141
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 190 place count 90 transition count 99
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 3 with 2 rules applied. Total rules applied 192 place count 89 transition count 98
Applied a total of 192 rules in 23 ms. Remains 89 /185 variables (removed 96) and now considering 98/194 (removed 96) transitions.
// Phase 1: matrix 98 rows 89 cols
[2024-06-01 12:08:29] [INFO ] Computed 21 invariants in 1 ms
[2024-06-01 12:08:29] [INFO ] Implicit Places using invariants in 165 ms returned []
[2024-06-01 12:08:29] [INFO ] Invariant cache hit.
[2024-06-01 12:08:29] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-06-01 12:08:30] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 489 ms to find 0 implicit places.
[2024-06-01 12:08:30] [INFO ] Redundant transitions in 1 ms returned []
Running 96 sub problems to find dead transitions.
[2024-06-01 12:08:30] [INFO ] Invariant cache hit.
[2024-06-01 12:08:30] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-06-01 12:08:30] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 1 ms to minimize.
[2024-06-01 12:08:30] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
[2024-06-01 12:08:30] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:08:31] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:08:31] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:08:31] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:08:31] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 2 ms to minimize.
[2024-06-01 12:08:31] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:08:31] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:08:31] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:08:31] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:08:31] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:08:31] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:08:31] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:08:31] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:08:31] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:08:31] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:08:31] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:08:31] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-06-01 12:08:31] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-06-01 12:08:31] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-06-01 12:08:31] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:08:31] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:08:32] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 2 ms to minimize.
[2024-06-01 12:08:32] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:08:32] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:08:32] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:08:32] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 2 ms to minimize.
[2024-06-01 12:08:32] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:08:32] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-06-01 12:08:32] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:08:32] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 2 ms to minimize.
[2024-06-01 12:08:32] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:08:32] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:08:32] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:08:32] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-06-01 12:08:32] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-06-01 12:08:32] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:08:32] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 19/58 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-06-01 12:08:33] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 1/88 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-06-01 12:08:34] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:08:34] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
[2024-06-01 12:08:35] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/88 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (OVERLAPS) 1/89 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/89 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 11 (OVERLAPS) 98/187 variables, 89/153 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/187 variables, 67/220 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/187 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 14 (OVERLAPS) 0/187 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 187/187 variables, and 220 constraints, problems are : Problem set: 0 solved, 96 unsolved in 8158 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 89/89 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 43/43 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 42/61 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 1/88 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 1/89 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/89 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (OVERLAPS) 98/187 variables, 89/153 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/187 variables, 67/220 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/187 variables, 96/316 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/187 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 13 (OVERLAPS) 0/187 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 187/187 variables, and 316 constraints, problems are : Problem set: 0 solved, 96 unsolved in 6024 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 89/89 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 43/43 constraints]
After SMT, in 14215ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 14217ms
Starting structural reductions in SI_LTL mode, iteration 1 : 89/185 places, 98/194 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14739 ms. Remains : 89/185 places, 98/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 (NOT p0)), (X (X (NOT 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 102 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 80 steps (0 resets) in 4 ms. (16 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 136 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
[2024-06-01 12:08:45] [INFO ] Invariant cache hit.
[2024-06-01 12:08:45] [INFO ] [Real]Absence check using 18 positive place invariants in 12 ms returned sat
[2024-06-01 12:08:45] [INFO ] [Real]Absence check using 18 positive and 3 generalized place invariants in 5 ms returned sat
[2024-06-01 12:08:45] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2024-06-01 12:08:45] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:08:45] [INFO ] [Nat]Absence check using 18 positive place invariants in 11 ms returned sat
[2024-06-01 12:08:45] [INFO ] [Nat]Absence check using 18 positive and 3 generalized place invariants in 4 ms returned sat
[2024-06-01 12:08:45] [INFO ] [Nat]Absence check using state equation in 107 ms returned sat
[2024-06-01 12:08:45] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-06-01 12:08:45] [INFO ] [Nat]Added 67 Read/Feed constraints in 22 ms returned sat
[2024-06-01 12:08:45] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 2 ms to minimize.
[2024-06-01 12:08:45] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-06-01 12:08:45] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-06-01 12:08:45] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 2 ms to minimize.
[2024-06-01 12:08:45] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:08:45] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 390 ms
[2024-06-01 12:08:45] [INFO ] Computed and/alt/rep : 96/228/96 causal constraints (skipped 0 transitions) in 13 ms.
[2024-06-01 12:08:46] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 2 ms to minimize.
[2024-06-01 12:08:46] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 1 ms to minimize.
[2024-06-01 12:08:46] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 2 ms to minimize.
[2024-06-01 12:08:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 264 ms
[2024-06-01 12:08:46] [INFO ] Added : 80 causal constraints over 16 iterations in 576 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4797 reset in 196 ms.
Product exploration explored 100000 steps with 4801 reset in 226 ms.
Support contains 2 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 98/98 transitions.
Applied a total of 0 rules in 4 ms. Remains 89 /89 variables (removed 0) and now considering 98/98 (removed 0) transitions.
[2024-06-01 12:08:47] [INFO ] Invariant cache hit.
[2024-06-01 12:08:47] [INFO ] Implicit Places using invariants in 170 ms returned []
[2024-06-01 12:08:47] [INFO ] Invariant cache hit.
[2024-06-01 12:08:47] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-06-01 12:08:47] [INFO ] Implicit Places using invariants and state equation in 354 ms returned []
Implicit Place search using SMT with State Equation took 528 ms to find 0 implicit places.
[2024-06-01 12:08:47] [INFO ] Redundant transitions in 1 ms returned []
Running 96 sub problems to find dead transitions.
[2024-06-01 12:08:47] [INFO ] Invariant cache hit.
[2024-06-01 12:08:47] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-06-01 12:08:48] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 1 ms to minimize.
[2024-06-01 12:08:48] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 2 ms to minimize.
[2024-06-01 12:08:48] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 2 ms to minimize.
[2024-06-01 12:08:48] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 2 ms to minimize.
[2024-06-01 12:08:48] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:08:48] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 2 ms to minimize.
[2024-06-01 12:08:48] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-06-01 12:08:48] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:08:48] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:08:48] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-06-01 12:08:48] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 3 ms to minimize.
[2024-06-01 12:08:48] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:08:49] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
[2024-06-01 12:08:49] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 2 ms to minimize.
[2024-06-01 12:08:49] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:08:49] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 2 ms to minimize.
[2024-06-01 12:08:49] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 2 ms to minimize.
[2024-06-01 12:08:49] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:08:49] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:08:49] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-06-01 12:08:49] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:08:49] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 2 ms to minimize.
[2024-06-01 12:08:49] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:08:49] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:08:49] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 2 ms to minimize.
[2024-06-01 12:08:49] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:08:49] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 2 ms to minimize.
[2024-06-01 12:08:49] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 2 ms to minimize.
[2024-06-01 12:08:50] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2024-06-01 12:08:50] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:08:50] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 2 ms to minimize.
[2024-06-01 12:08:50] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 2 ms to minimize.
[2024-06-01 12:08:50] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:08:50] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 2 ms to minimize.
[2024-06-01 12:08:50] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:08:50] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:08:50] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:08:50] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 2 ms to minimize.
[2024-06-01 12:08:50] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 19/58 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-06-01 12:08:51] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 1/88 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-06-01 12:08:52] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
[2024-06-01 12:08:53] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
[2024-06-01 12:08:53] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/88 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (OVERLAPS) 1/89 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/89 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 11 (OVERLAPS) 98/187 variables, 89/153 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/187 variables, 67/220 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/187 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 14 (OVERLAPS) 0/187 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 187/187 variables, and 220 constraints, problems are : Problem set: 0 solved, 96 unsolved in 9121 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 89/89 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 43/43 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 42/61 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 1/88 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 1/89 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/89 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (OVERLAPS) 98/187 variables, 89/153 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/187 variables, 67/220 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/187 variables, 96/316 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/187 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 13 (OVERLAPS) 0/187 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 187/187 variables, and 316 constraints, problems are : Problem set: 0 solved, 96 unsolved in 5572 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 89/89 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 43/43 constraints]
After SMT, in 14725ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 14728ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 15270 ms. Remains : 89/89 places, 98/98 transitions.
Treatment of property ParamProductionCell-PT-3-LTLFireability-15 finished in 38653 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Found a Shortening insensitive property : ParamProductionCell-PT-3-LTLFireability-03
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Support contains 5 out of 195 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 195/195 places, 197/197 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 195 transition count 161
Reduce places removed 36 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 37 rules applied. Total rules applied 73 place count 159 transition count 160
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 74 place count 158 transition count 160
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 74 place count 158 transition count 150
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 94 place count 148 transition count 150
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 95 place count 147 transition count 149
Iterating global reduction 3 with 1 rules applied. Total rules applied 96 place count 147 transition count 149
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 176 place count 107 transition count 109
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 3 with 2 rules applied. Total rules applied 178 place count 106 transition count 108
Applied a total of 178 rules in 14 ms. Remains 106 /195 variables (removed 89) and now considering 108/197 (removed 89) transitions.
// Phase 1: matrix 108 rows 106 cols
[2024-06-01 12:09:02] [INFO ] Computed 28 invariants in 1 ms
[2024-06-01 12:09:02] [INFO ] Implicit Places using invariants in 121 ms returned [10, 22, 37, 48, 74, 94]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 122 ms to find 6 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 100/195 places, 108/197 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 100 transition count 106
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 98 transition count 106
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 18 place count 91 transition count 99
Applied a total of 18 rules in 4 ms. Remains 91 /100 variables (removed 9) and now considering 99/108 (removed 9) transitions.
// Phase 1: matrix 99 rows 91 cols
[2024-06-01 12:09:02] [INFO ] Computed 22 invariants in 0 ms
[2024-06-01 12:09:02] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-06-01 12:09:02] [INFO ] Invariant cache hit.
[2024-06-01 12:09:03] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-06-01 12:09:03] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 91/195 places, 99/197 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 458 ms. Remains : 91/195 places, 99/197 transitions.
Running random walk in product with property : ParamProductionCell-PT-3-LTLFireability-03
Product exploration explored 100000 steps with 1531 reset in 183 ms.
Product exploration explored 100000 steps with 1520 reset in 229 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 242 steps (0 resets) in 4 ms. (48 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 129 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 174 ms :[(NOT p0), (NOT p0)]
[2024-06-01 12:09:04] [INFO ] Invariant cache hit.
[2024-06-01 12:09:04] [INFO ] [Real]Absence check using 18 positive place invariants in 13 ms returned sat
[2024-06-01 12:09:04] [INFO ] [Real]Absence check using 18 positive and 4 generalized place invariants in 11 ms returned sat
[2024-06-01 12:09:04] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2024-06-01 12:09:04] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:09:04] [INFO ] [Nat]Absence check using 18 positive place invariants in 13 ms returned sat
[2024-06-01 12:09:04] [INFO ] [Nat]Absence check using 18 positive and 4 generalized place invariants in 3 ms returned sat
[2024-06-01 12:09:04] [INFO ] [Nat]Absence check using state equation in 118 ms returned sat
[2024-06-01 12:09:04] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-06-01 12:09:04] [INFO ] [Nat]Added 67 Read/Feed constraints in 20 ms returned sat
[2024-06-01 12:09:04] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 2 ms to minimize.
[2024-06-01 12:09:04] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 2 ms to minimize.
[2024-06-01 12:09:05] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 2 ms to minimize.
[2024-06-01 12:09:05] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:09:05] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 2 ms to minimize.
[2024-06-01 12:09:05] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 2 ms to minimize.
[2024-06-01 12:09:05] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 2 ms to minimize.
[2024-06-01 12:09:05] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 2 ms to minimize.
[2024-06-01 12:09:05] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 2 ms to minimize.
[2024-06-01 12:09:05] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 2 ms to minimize.
[2024-06-01 12:09:05] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2024-06-01 12:09:05] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 2 ms to minimize.
[2024-06-01 12:09:05] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 2 ms to minimize.
[2024-06-01 12:09:05] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 2 ms to minimize.
[2024-06-01 12:09:05] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:09:05] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2024-06-01 12:09:06] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 2 ms to minimize.
[2024-06-01 12:09:06] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 2 ms to minimize.
[2024-06-01 12:09:06] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 2 ms to minimize.
[2024-06-01 12:09:06] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:09:06] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:09:06] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:09:06] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:09:06] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 2 ms to minimize.
[2024-06-01 12:09:06] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 2 ms to minimize.
[2024-06-01 12:09:06] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 1761 ms
[2024-06-01 12:09:06] [INFO ] Computed and/alt/rep : 97/231/97 causal constraints (skipped 0 transitions) in 13 ms.
[2024-06-01 12:09:06] [INFO ] Added : 77 causal constraints over 16 iterations in 350 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 5 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 99/99 transitions.
Applied a total of 0 rules in 5 ms. Remains 91 /91 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2024-06-01 12:09:06] [INFO ] Invariant cache hit.
[2024-06-01 12:09:07] [INFO ] Implicit Places using invariants in 190 ms returned []
[2024-06-01 12:09:07] [INFO ] Invariant cache hit.
[2024-06-01 12:09:07] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-06-01 12:09:07] [INFO ] Implicit Places using invariants and state equation in 351 ms returned []
Implicit Place search using SMT with State Equation took 544 ms to find 0 implicit places.
[2024-06-01 12:09:07] [INFO ] Redundant transitions in 0 ms returned []
Running 97 sub problems to find dead transitions.
[2024-06-01 12:09:07] [INFO ] Invariant cache hit.
[2024-06-01 12:09:07] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 12:09:08] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 2 ms to minimize.
[2024-06-01 12:09:08] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 2 ms to minimize.
[2024-06-01 12:09:08] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2024-06-01 12:09:08] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-06-01 12:09:08] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 2 ms to minimize.
[2024-06-01 12:09:08] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:09:08] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:09:08] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2024-06-01 12:09:08] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:09:08] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 2 ms to minimize.
[2024-06-01 12:09:08] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:09:08] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:09:08] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:09:08] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 2 ms to minimize.
[2024-06-01 12:09:08] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:09:09] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 2 ms to minimize.
[2024-06-01 12:09:09] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:09:09] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 2 ms to minimize.
[2024-06-01 12:09:09] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2024-06-01 12:09:09] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 12:09:09] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 2 ms to minimize.
[2024-06-01 12:09:09] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:09:09] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:09:09] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:09:09] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 2 ms to minimize.
[2024-06-01 12:09:09] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:09:09] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:09:09] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:09:09] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:09:09] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:09:10] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 2 ms to minimize.
[2024-06-01 12:09:10] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 2 ms to minimize.
[2024-06-01 12:09:10] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:09:10] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 12:09:10] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 12:09:11] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:09:11] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 12:09:12] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 12:09:12] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/89 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/89 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (OVERLAPS) 1/90 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 12:09:14] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 2 ms to minimize.
[2024-06-01 12:09:14] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:09:14] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:09:14] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/90 variables, 4/64 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/90 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 12 (OVERLAPS) 1/91 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/91 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 14 (OVERLAPS) 99/190 variables, 91/156 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/190 variables, 67/223 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/190 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 17 (OVERLAPS) 0/190 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 223 constraints, problems are : Problem set: 0 solved, 97 unsolved in 11518 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 91/91 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 43/43 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 42/62 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 12:09:19] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:09:19] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (OVERLAPS) 1/90 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (OVERLAPS) 1/91 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/91 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (OVERLAPS) 99/190 variables, 91/158 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/190 variables, 67/225 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/190 variables, 97/322 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/190 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 14 (OVERLAPS) 0/190 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 322 constraints, problems are : Problem set: 0 solved, 97 unsolved in 6611 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 91/91 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 45/45 constraints]
After SMT, in 18158ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 18161ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 18720 ms. Remains : 91/91 places, 99/99 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 106 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 95 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 253 steps (0 resets) in 6 ms. (36 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 138 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 91 ms :[(NOT p0), (NOT p0)]
[2024-06-01 12:09:26] [INFO ] Invariant cache hit.
[2024-06-01 12:09:26] [INFO ] [Real]Absence check using 18 positive place invariants in 13 ms returned sat
[2024-06-01 12:09:26] [INFO ] [Real]Absence check using 18 positive and 4 generalized place invariants in 3 ms returned sat
[2024-06-01 12:09:26] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2024-06-01 12:09:26] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:09:26] [INFO ] [Nat]Absence check using 18 positive place invariants in 11 ms returned sat
[2024-06-01 12:09:26] [INFO ] [Nat]Absence check using 18 positive and 4 generalized place invariants in 4 ms returned sat
[2024-06-01 12:09:26] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2024-06-01 12:09:26] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-06-01 12:09:26] [INFO ] [Nat]Added 67 Read/Feed constraints in 21 ms returned sat
[2024-06-01 12:09:26] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 2 ms to minimize.
[2024-06-01 12:09:26] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 2 ms to minimize.
[2024-06-01 12:09:26] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 2 ms to minimize.
[2024-06-01 12:09:27] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:09:27] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:09:27] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 2 ms to minimize.
[2024-06-01 12:09:27] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-06-01 12:09:27] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-06-01 12:09:27] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 2 ms to minimize.
[2024-06-01 12:09:27] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-06-01 12:09:27] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 2 ms to minimize.
[2024-06-01 12:09:27] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 2 ms to minimize.
[2024-06-01 12:09:27] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 2 ms to minimize.
[2024-06-01 12:09:27] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 2 ms to minimize.
[2024-06-01 12:09:27] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 2 ms to minimize.
[2024-06-01 12:09:27] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 2 ms to minimize.
[2024-06-01 12:09:27] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2024-06-01 12:09:28] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2024-06-01 12:09:28] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 2 ms to minimize.
[2024-06-01 12:09:28] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:09:28] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 2 ms to minimize.
[2024-06-01 12:09:28] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:09:28] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:09:28] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-06-01 12:09:28] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 2 ms to minimize.
[2024-06-01 12:09:28] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 1727 ms
[2024-06-01 12:09:28] [INFO ] Computed and/alt/rep : 97/231/97 causal constraints (skipped 0 transitions) in 13 ms.
[2024-06-01 12:09:28] [INFO ] Added : 77 causal constraints over 16 iterations in 352 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1526 reset in 214 ms.
Product exploration explored 100000 steps with 1525 reset in 253 ms.
Support contains 5 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 99/99 transitions.
Applied a total of 0 rules in 5 ms. Remains 91 /91 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2024-06-01 12:09:29] [INFO ] Invariant cache hit.
[2024-06-01 12:09:29] [INFO ] Implicit Places using invariants in 182 ms returned []
[2024-06-01 12:09:29] [INFO ] Invariant cache hit.
[2024-06-01 12:09:29] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-06-01 12:09:29] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 390 ms to find 0 implicit places.
[2024-06-01 12:09:29] [INFO ] Redundant transitions in 1 ms returned []
Running 97 sub problems to find dead transitions.
[2024-06-01 12:09:29] [INFO ] Invariant cache hit.
[2024-06-01 12:09:29] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 12:09:30] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:09:30] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 2 ms to minimize.
[2024-06-01 12:09:30] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 2 ms to minimize.
[2024-06-01 12:09:30] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 2 ms to minimize.
[2024-06-01 12:09:30] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:09:30] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:09:30] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:09:30] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:09:30] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:09:30] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:09:30] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:09:31] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 2 ms to minimize.
[2024-06-01 12:09:31] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 2 ms to minimize.
[2024-06-01 12:09:31] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 2 ms to minimize.
[2024-06-01 12:09:31] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:09:31] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:09:31] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:09:31] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 2 ms to minimize.
[2024-06-01 12:09:31] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:09:31] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 12:09:31] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 2 ms to minimize.
[2024-06-01 12:09:31] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:09:31] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:09:31] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:09:31] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:09:31] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:09:31] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:09:32] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:09:32] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:09:32] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 2 ms to minimize.
[2024-06-01 12:09:32] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:09:32] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:09:32] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 2 ms to minimize.
[2024-06-01 12:09:32] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 12:09:33] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 12:09:33] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:09:33] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 12:09:34] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 12:09:34] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/89 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/89 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (OVERLAPS) 1/90 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 12:09:36] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:09:36] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:09:36] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:09:36] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/90 variables, 4/64 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/90 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 12 (OVERLAPS) 1/91 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/91 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 14 (OVERLAPS) 99/190 variables, 91/156 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/190 variables, 67/223 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/190 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 17 (OVERLAPS) 0/190 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 223 constraints, problems are : Problem set: 0 solved, 97 unsolved in 11095 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 91/91 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 43/43 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 42/62 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 12:09:41] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:09:41] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (OVERLAPS) 1/90 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (OVERLAPS) 1/91 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/91 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (OVERLAPS) 99/190 variables, 91/158 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/190 variables, 67/225 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/190 variables, 97/322 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/190 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 14 (OVERLAPS) 0/190 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 322 constraints, problems are : Problem set: 0 solved, 97 unsolved in 6703 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 91/91 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 45/45 constraints]
After SMT, in 17827ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 17831ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 18234 ms. Remains : 91/91 places, 99/99 transitions.
Treatment of property ParamProductionCell-PT-3-LTLFireability-03 finished in 45311 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)||F(G((p1||X(F(p2))))))))'
Found a Lengthening insensitive property : ParamProductionCell-PT-3-LTLFireability-04
Stuttering acceptance computed with spot in 222 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 6 out of 195 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 195/195 places, 197/197 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 195 transition count 163
Reduce places removed 34 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 35 rules applied. Total rules applied 69 place count 161 transition count 162
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 70 place count 160 transition count 162
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 70 place count 160 transition count 151
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 92 place count 149 transition count 151
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 93 place count 148 transition count 150
Iterating global reduction 3 with 1 rules applied. Total rules applied 94 place count 148 transition count 150
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 170 place count 110 transition count 112
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 3 with 2 rules applied. Total rules applied 172 place count 109 transition count 111
Applied a total of 172 rules in 39 ms. Remains 109 /195 variables (removed 86) and now considering 111/197 (removed 86) transitions.
// Phase 1: matrix 111 rows 109 cols
[2024-06-01 12:09:48] [INFO ] Computed 28 invariants in 1 ms
[2024-06-01 12:09:48] [INFO ] Implicit Places using invariants in 258 ms returned [10, 39, 40, 51, 77, 97, 98]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 260 ms to find 7 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 102/195 places, 111/197 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 102 transition count 110
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 101 transition count 110
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 22 place count 91 transition count 100
Applied a total of 22 rules in 9 ms. Remains 91 /102 variables (removed 11) and now considering 100/111 (removed 11) transitions.
// Phase 1: matrix 100 rows 91 cols
[2024-06-01 12:09:48] [INFO ] Computed 21 invariants in 1 ms
[2024-06-01 12:09:48] [INFO ] Implicit Places using invariants in 194 ms returned []
[2024-06-01 12:09:48] [INFO ] Invariant cache hit.
[2024-06-01 12:09:48] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-06-01 12:09:48] [INFO ] Implicit Places using invariants and state equation in 362 ms returned []
Implicit Place search using SMT with State Equation took 559 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 91/195 places, 100/197 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 868 ms. Remains : 91/195 places, 100/197 transitions.
Running random walk in product with property : ParamProductionCell-PT-3-LTLFireability-04
Product exploration explored 100000 steps with 2947 reset in 242 ms.
Product exploration explored 100000 steps with 2944 reset in 271 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 p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 192 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
RANDOM walk for 1005 steps (0 resets) in 18 ms. (52 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p2), (F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT (OR p2 (NOT p1))))]
Knowledge based reduction with 11 factoid took 433 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
[2024-06-01 12:09:50] [INFO ] Invariant cache hit.
[2024-06-01 12:09:50] [INFO ] [Real]Absence check using 19 positive place invariants in 14 ms returned sat
[2024-06-01 12:09:50] [INFO ] [Real]Absence check using 19 positive and 2 generalized place invariants in 3 ms returned sat
[2024-06-01 12:09:50] [INFO ] [Real]Absence check using state equation in 113 ms returned sat
[2024-06-01 12:09:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:09:50] [INFO ] [Nat]Absence check using 19 positive place invariants in 14 ms returned sat
[2024-06-01 12:09:50] [INFO ] [Nat]Absence check using 19 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-01 12:09:51] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2024-06-01 12:09:51] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-06-01 12:09:51] [INFO ] [Nat]Added 67 Read/Feed constraints in 19 ms returned sat
[2024-06-01 12:09:51] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 2 ms to minimize.
[2024-06-01 12:09:51] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 2 ms to minimize.
[2024-06-01 12:09:51] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 2 ms to minimize.
[2024-06-01 12:09:51] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 2 ms to minimize.
[2024-06-01 12:09:51] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 2 ms to minimize.
[2024-06-01 12:09:51] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 2 ms to minimize.
[2024-06-01 12:09:51] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 1 ms to minimize.
[2024-06-01 12:09:51] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 2 ms to minimize.
[2024-06-01 12:09:51] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2024-06-01 12:09:51] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2024-06-01 12:09:51] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:09:51] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:09:51] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:09:52] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 2 ms to minimize.
[2024-06-01 12:09:52] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 2 ms to minimize.
[2024-06-01 12:09:52] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 2 ms to minimize.
[2024-06-01 12:09:52] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 2 ms to minimize.
[2024-06-01 12:09:52] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 2 ms to minimize.
[2024-06-01 12:09:52] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 2 ms to minimize.
[2024-06-01 12:09:52] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:09:52] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-06-01 12:09:52] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 2 ms to minimize.
[2024-06-01 12:09:52] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 2 ms to minimize.
[2024-06-01 12:09:52] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 2 ms to minimize.
[2024-06-01 12:09:52] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:09:52] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 1793 ms
[2024-06-01 12:09:52] [INFO ] Computed and/alt/rep : 98/230/98 causal constraints (skipped 0 transitions) in 14 ms.
[2024-06-01 12:09:53] [INFO ] Added : 93 causal constraints over 21 iterations in 408 ms. Result :sat
Could not prove EG (AND (NOT p2) (NOT p1))
Support contains 3 out of 91 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 100/100 transitions.
Applied a total of 0 rules in 5 ms. Remains 91 /91 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2024-06-01 12:09:53] [INFO ] Invariant cache hit.
[2024-06-01 12:09:53] [INFO ] Implicit Places using invariants in 176 ms returned []
[2024-06-01 12:09:53] [INFO ] Invariant cache hit.
[2024-06-01 12:09:53] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-06-01 12:09:53] [INFO ] Implicit Places using invariants and state equation in 345 ms returned []
Implicit Place search using SMT with State Equation took 523 ms to find 0 implicit places.
[2024-06-01 12:09:53] [INFO ] Redundant transitions in 1 ms returned []
Running 98 sub problems to find dead transitions.
[2024-06-01 12:09:53] [INFO ] Invariant cache hit.
[2024-06-01 12:09:53] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-06-01 12:09:54] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:09:54] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:09:54] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2024-06-01 12:09:54] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 2 ms to minimize.
[2024-06-01 12:09:54] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2024-06-01 12:09:54] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:09:54] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:09:54] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 2 ms to minimize.
[2024-06-01 12:09:54] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 2 ms to minimize.
[2024-06-01 12:09:55] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 2 ms to minimize.
[2024-06-01 12:09:55] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 2 ms to minimize.
[2024-06-01 12:09:55] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 2 ms to minimize.
[2024-06-01 12:09:55] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:09:55] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:09:55] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:09:55] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 2 ms to minimize.
[2024-06-01 12:09:55] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 2 ms to minimize.
[2024-06-01 12:09:55] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:09:55] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
[2024-06-01 12:09:55] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-06-01 12:09:55] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:09:55] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:09:55] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:09:56] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:09:56] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:09:56] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:09:56] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 2 ms to minimize.
[2024-06-01 12:09:56] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:09:56] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:09:56] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:09:56] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:09:56] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 12/51 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (OVERLAPS) 2/91 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-06-01 12:09:57] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:09:57] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:09:57] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:09:58] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (OVERLAPS) 100/191 variables, 91/148 constraints. Problems are: Problem set: 0 solved, 98 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 67/215 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 11 (OVERLAPS) 0/191 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 215 constraints, problems are : Problem set: 0 solved, 98 unsolved in 7041 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 91/91 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 36/36 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 35/54 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 2/91 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-06-01 12:10:01] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (OVERLAPS) 100/191 variables, 91/149 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 67/216 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 98/314 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-06-01 12:10:03] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/191 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/191 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 13 (OVERLAPS) 0/191 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 315 constraints, problems are : Problem set: 0 solved, 98 unsolved in 6431 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 91/91 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 38/38 constraints]
After SMT, in 13501ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 13504ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 14044 ms. Remains : 91/91 places, 100/100 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 p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p2) p1))), (X (AND (NOT p2) (NOT p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 164 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 962 steps (0 resets) in 12 ms. (74 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p2) p1))), (X (AND (NOT p2) (NOT p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p2), (F (NOT (OR (NOT p1) p2))), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 9 factoid took 333 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
[2024-06-01 12:10:08] [INFO ] Invariant cache hit.
[2024-06-01 12:10:08] [INFO ] [Real]Absence check using 19 positive place invariants in 13 ms returned sat
[2024-06-01 12:10:08] [INFO ] [Real]Absence check using 19 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-01 12:10:08] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2024-06-01 12:10:08] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:10:08] [INFO ] [Nat]Absence check using 19 positive place invariants in 12 ms returned sat
[2024-06-01 12:10:08] [INFO ] [Nat]Absence check using 19 positive and 2 generalized place invariants in 3 ms returned sat
[2024-06-01 12:10:08] [INFO ] [Nat]Absence check using state equation in 121 ms returned sat
[2024-06-01 12:10:08] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-06-01 12:10:08] [INFO ] [Nat]Added 67 Read/Feed constraints in 19 ms returned sat
[2024-06-01 12:10:08] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 2 ms to minimize.
[2024-06-01 12:10:08] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 2 ms to minimize.
[2024-06-01 12:10:08] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-06-01 12:10:09] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 2 ms to minimize.
[2024-06-01 12:10:09] [INFO ] Deduced a trap composed of 6 places in 63 ms of which 1 ms to minimize.
[2024-06-01 12:10:09] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-06-01 12:10:09] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 2 ms to minimize.
[2024-06-01 12:10:09] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 2 ms to minimize.
[2024-06-01 12:10:09] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 2 ms to minimize.
[2024-06-01 12:10:09] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 2 ms to minimize.
[2024-06-01 12:10:09] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 2 ms to minimize.
[2024-06-01 12:10:09] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 2 ms to minimize.
[2024-06-01 12:10:09] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 2 ms to minimize.
[2024-06-01 12:10:09] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 2 ms to minimize.
[2024-06-01 12:10:09] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 2 ms to minimize.
[2024-06-01 12:10:09] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 2 ms to minimize.
[2024-06-01 12:10:10] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 2 ms to minimize.
[2024-06-01 12:10:10] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 3 ms to minimize.
[2024-06-01 12:10:10] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 2 ms to minimize.
[2024-06-01 12:10:10] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 2 ms to minimize.
[2024-06-01 12:10:10] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:10:10] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 1641 ms
[2024-06-01 12:10:10] [INFO ] Computed and/alt/rep : 98/230/98 causal constraints (skipped 0 transitions) in 14 ms.
[2024-06-01 12:10:10] [INFO ] Added : 88 causal constraints over 18 iterations in 361 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 2938 reset in 215 ms.
Product exploration explored 100000 steps with 2942 reset in 230 ms.
Support contains 3 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 100/100 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 89 transition count 98
Applied a total of 4 rules in 5 ms. Remains 89 /91 variables (removed 2) and now considering 98/100 (removed 2) transitions.
// Phase 1: matrix 98 rows 89 cols
[2024-06-01 12:10:11] [INFO ] Computed 21 invariants in 1 ms
[2024-06-01 12:10:11] [INFO ] Implicit Places using invariants in 172 ms returned [21]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 174 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 88/91 places, 98/100 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 88 transition count 97
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 87 transition count 97
Applied a total of 2 rules in 4 ms. Remains 87 /88 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 87 cols
[2024-06-01 12:10:11] [INFO ] Computed 20 invariants in 1 ms
[2024-06-01 12:10:11] [INFO ] Implicit Places using invariants in 151 ms returned []
[2024-06-01 12:10:11] [INFO ] Invariant cache hit.
[2024-06-01 12:10:11] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-06-01 12:10:11] [INFO ] Implicit Places using invariants and state equation in 315 ms returned []
Implicit Place search using SMT with State Equation took 476 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 87/91 places, 97/100 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 661 ms. Remains : 87/91 places, 97/100 transitions.
Treatment of property ParamProductionCell-PT-3-LTLFireability-04 finished in 24298 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Found a Shortening insensitive property : ParamProductionCell-PT-3-LTLFireability-06
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 195 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 195/195 places, 197/197 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 195 transition count 162
Reduce places removed 35 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 36 rules applied. Total rules applied 71 place count 160 transition count 161
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 159 transition count 161
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 72 place count 159 transition count 151
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 92 place count 149 transition count 151
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 93 place count 148 transition count 150
Iterating global reduction 3 with 1 rules applied. Total rules applied 94 place count 148 transition count 150
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 174 place count 108 transition count 110
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 3 with 2 rules applied. Total rules applied 176 place count 107 transition count 109
Applied a total of 176 rules in 19 ms. Remains 107 /195 variables (removed 88) and now considering 109/197 (removed 88) transitions.
// Phase 1: matrix 109 rows 107 cols
[2024-06-01 12:10:12] [INFO ] Computed 28 invariants in 2 ms
[2024-06-01 12:10:12] [INFO ] Implicit Places using invariants in 229 ms returned [23, 37, 38, 49, 75, 95, 96]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 230 ms to find 7 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 100/195 places, 109/197 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 100 transition count 108
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 99 transition count 108
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 99 transition count 105
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 96 transition count 105
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 24 place count 88 transition count 97
Applied a total of 24 rules in 8 ms. Remains 88 /100 variables (removed 12) and now considering 97/109 (removed 12) transitions.
// Phase 1: matrix 97 rows 88 cols
[2024-06-01 12:10:12] [INFO ] Computed 21 invariants in 1 ms
[2024-06-01 12:10:12] [INFO ] Implicit Places using invariants in 150 ms returned []
[2024-06-01 12:10:12] [INFO ] Invariant cache hit.
[2024-06-01 12:10:12] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-06-01 12:10:13] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 433 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 88/195 places, 97/197 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 692 ms. Remains : 88/195 places, 97/197 transitions.
Running random walk in product with property : ParamProductionCell-PT-3-LTLFireability-06
Product exploration explored 100000 steps with 2567 reset in 120 ms.
Product exploration explored 100000 steps with 2569 reset in 138 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 147 steps (0 resets) in 4 ms. (29 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 131 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 84 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
[2024-06-01 12:10:13] [INFO ] Invariant cache hit.
[2024-06-01 12:10:13] [INFO ] [Real]Absence check using 19 positive place invariants in 10 ms returned sat
[2024-06-01 12:10:13] [INFO ] [Real]Absence check using 19 positive and 2 generalized place invariants in 3 ms returned sat
[2024-06-01 12:10:14] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2024-06-01 12:10:14] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:10:14] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2024-06-01 12:10:14] [INFO ] [Nat]Absence check using 19 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-01 12:10:14] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2024-06-01 12:10:14] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-06-01 12:10:14] [INFO ] [Nat]Added 67 Read/Feed constraints in 13 ms returned sat
[2024-06-01 12:10:14] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 2 ms to minimize.
[2024-06-01 12:10:14] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 2 ms to minimize.
[2024-06-01 12:10:14] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:10:14] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:10:14] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 2 ms to minimize.
[2024-06-01 12:10:14] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 306 ms
[2024-06-01 12:10:14] [INFO ] Computed and/alt/rep : 95/219/95 causal constraints (skipped 0 transitions) in 13 ms.
[2024-06-01 12:10:14] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:10:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2024-06-01 12:10:14] [INFO ] Added : 73 causal constraints over 15 iterations in 332 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 97/97 transitions.
Applied a total of 0 rules in 3 ms. Remains 88 /88 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2024-06-01 12:10:14] [INFO ] Invariant cache hit.
[2024-06-01 12:10:15] [INFO ] Implicit Places using invariants in 165 ms returned []
[2024-06-01 12:10:15] [INFO ] Invariant cache hit.
[2024-06-01 12:10:15] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-06-01 12:10:15] [INFO ] Implicit Places using invariants and state equation in 317 ms returned []
Implicit Place search using SMT with State Equation took 485 ms to find 0 implicit places.
[2024-06-01 12:10:15] [INFO ] Redundant transitions in 1 ms returned []
Running 95 sub problems to find dead transitions.
[2024-06-01 12:10:15] [INFO ] Invariant cache hit.
[2024-06-01 12:10:15] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 12:10:16] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:10:16] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:10:16] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-06-01 12:10:16] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 2 ms to minimize.
[2024-06-01 12:10:16] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 2 ms to minimize.
[2024-06-01 12:10:16] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:10:16] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:10:16] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 2 ms to minimize.
[2024-06-01 12:10:16] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 2 ms to minimize.
[2024-06-01 12:10:16] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:10:16] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 2 ms to minimize.
[2024-06-01 12:10:16] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:10:16] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 2 ms to minimize.
[2024-06-01 12:10:16] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:10:16] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:10:16] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 2 ms to minimize.
[2024-06-01 12:10:16] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 2 ms to minimize.
[2024-06-01 12:10:16] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 2 ms to minimize.
[2024-06-01 12:10:17] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:10:17] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 12:10:17] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 2 ms to minimize.
[2024-06-01 12:10:17] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:10:17] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:10:17] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 2 ms to minimize.
[2024-06-01 12:10:17] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:10:17] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:10:17] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:10:17] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 2 ms to minimize.
[2024-06-01 12:10:17] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 2 ms to minimize.
[2024-06-01 12:10:17] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:10:17] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 2 ms to minimize.
[2024-06-01 12:10:17] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:10:18] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 13/52 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 12:10:18] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:10:18] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 2 ms to minimize.
[2024-06-01 12:10:18] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:10:18] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 2 ms to minimize.
[2024-06-01 12:10:19] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:10:19] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 2 ms to minimize.
[2024-06-01 12:10:19] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 12:10:19] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:10:19] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (OVERLAPS) 2/88 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 12:10:20] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:10:20] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:10:20] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:10:20] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:10:20] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:10:21] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/88 variables, 6/69 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/88 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 10 (OVERLAPS) 97/185 variables, 88/157 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/185 variables, 67/224 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/185 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 13 (OVERLAPS) 0/185 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 185/185 variables, and 224 constraints, problems are : Problem set: 0 solved, 95 unsolved in 9348 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 88/88 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 45/64 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (OVERLAPS) 2/88 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 3/69 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (OVERLAPS) 97/185 variables, 88/157 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/185 variables, 67/224 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/185 variables, 95/319 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 12:10:27] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/185 variables, 1/320 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/185 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 12:10:29] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/185 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/185 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 12:10:33] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/185 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/185 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 16 (OVERLAPS) 0/185 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 185/185 variables, and 322 constraints, problems are : Problem set: 0 solved, 95 unsolved in 11725 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 88/88 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 51/51 constraints]
After SMT, in 21097ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 21100ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 21598 ms. Remains : 88/88 places, 97/97 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT 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 79 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 143 steps (0 resets) in 4 ms. (28 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
[2024-06-01 12:10:36] [INFO ] Invariant cache hit.
[2024-06-01 12:10:37] [INFO ] [Real]Absence check using 19 positive place invariants in 11 ms returned sat
[2024-06-01 12:10:37] [INFO ] [Real]Absence check using 19 positive and 2 generalized place invariants in 4 ms returned sat
[2024-06-01 12:10:37] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2024-06-01 12:10:37] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:10:37] [INFO ] [Nat]Absence check using 19 positive place invariants in 10 ms returned sat
[2024-06-01 12:10:37] [INFO ] [Nat]Absence check using 19 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-01 12:10:37] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2024-06-01 12:10:37] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-06-01 12:10:37] [INFO ] [Nat]Added 67 Read/Feed constraints in 15 ms returned sat
[2024-06-01 12:10:37] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 2 ms to minimize.
[2024-06-01 12:10:37] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 2 ms to minimize.
[2024-06-01 12:10:37] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 2 ms to minimize.
[2024-06-01 12:10:37] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 2 ms to minimize.
[2024-06-01 12:10:37] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 2 ms to minimize.
[2024-06-01 12:10:37] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 361 ms
[2024-06-01 12:10:37] [INFO ] Computed and/alt/rep : 95/219/95 causal constraints (skipped 0 transitions) in 14 ms.
[2024-06-01 12:10:38] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-06-01 12:10:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2024-06-01 12:10:38] [INFO ] Added : 73 causal constraints over 15 iterations in 382 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2571 reset in 207 ms.
Product exploration explored 100000 steps with 2567 reset in 240 ms.
Support contains 2 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 97/97 transitions.
Applied a total of 0 rules in 4 ms. Remains 88 /88 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2024-06-01 12:10:38] [INFO ] Invariant cache hit.
[2024-06-01 12:10:38] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-06-01 12:10:38] [INFO ] Invariant cache hit.
[2024-06-01 12:10:39] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-06-01 12:10:39] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 503 ms to find 0 implicit places.
[2024-06-01 12:10:39] [INFO ] Redundant transitions in 0 ms returned []
Running 95 sub problems to find dead transitions.
[2024-06-01 12:10:39] [INFO ] Invariant cache hit.
[2024-06-01 12:10:39] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 12:10:39] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:10:39] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:10:40] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 2 ms to minimize.
[2024-06-01 12:10:40] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 2 ms to minimize.
[2024-06-01 12:10:40] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 2 ms to minimize.
[2024-06-01 12:10:40] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:10:40] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:10:40] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 1 ms to minimize.
[2024-06-01 12:10:40] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:10:40] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:10:40] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 2 ms to minimize.
[2024-06-01 12:10:40] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:10:40] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:10:40] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:10:40] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:10:40] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 2 ms to minimize.
[2024-06-01 12:10:40] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 2 ms to minimize.
[2024-06-01 12:10:40] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-06-01 12:10:40] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:10:40] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 12:10:41] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 2 ms to minimize.
[2024-06-01 12:10:41] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:10:41] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 2 ms to minimize.
[2024-06-01 12:10:41] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 2 ms to minimize.
[2024-06-01 12:10:41] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:10:41] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:10:41] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:10:41] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:10:41] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:10:41] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:10:41] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 2 ms to minimize.
[2024-06-01 12:10:41] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 2 ms to minimize.
[2024-06-01 12:10:41] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 13/52 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 12:10:42] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:10:42] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:10:42] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 2 ms to minimize.
[2024-06-01 12:10:42] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:10:43] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:10:43] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:10:43] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 12:10:43] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:10:43] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (OVERLAPS) 2/88 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 12:10:44] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 2 ms to minimize.
[2024-06-01 12:10:44] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:10:44] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:10:44] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-06-01 12:10:44] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:10:45] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/88 variables, 6/69 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/88 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 10 (OVERLAPS) 97/185 variables, 88/157 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/185 variables, 67/224 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/185 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 13 (OVERLAPS) 0/185 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 185/185 variables, and 224 constraints, problems are : Problem set: 0 solved, 95 unsolved in 9389 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 88/88 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 45/64 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (OVERLAPS) 2/88 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 3/69 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (OVERLAPS) 97/185 variables, 88/157 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/185 variables, 67/224 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/185 variables, 95/319 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 12:10:51] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/185 variables, 1/320 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/185 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 12:10:53] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/185 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/185 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 12:10:56] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/185 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/185 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 16 (OVERLAPS) 0/185 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 185/185 variables, and 322 constraints, problems are : Problem set: 0 solved, 95 unsolved in 11507 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 88/88 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 51/51 constraints]
After SMT, in 20923ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 20925ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 21440 ms. Remains : 88/88 places, 97/97 transitions.
Treatment of property ParamProductionCell-PT-3-LTLFireability-06 finished in 48114 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Found a Shortening insensitive property : ParamProductionCell-PT-3-LTLFireability-15
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 195 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 195/195 places, 197/197 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 195 transition count 163
Reduce places removed 34 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 36 rules applied. Total rules applied 70 place count 161 transition count 161
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 72 place count 159 transition count 161
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 72 place count 159 transition count 150
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 94 place count 148 transition count 150
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 95 place count 147 transition count 149
Iterating global reduction 3 with 1 rules applied. Total rules applied 96 place count 147 transition count 149
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 174 place count 108 transition count 110
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 3 with 2 rules applied. Total rules applied 176 place count 107 transition count 109
Applied a total of 176 rules in 22 ms. Remains 107 /195 variables (removed 88) and now considering 109/197 (removed 88) transitions.
// Phase 1: matrix 109 rows 107 cols
[2024-06-01 12:11:00] [INFO ] Computed 28 invariants in 2 ms
[2024-06-01 12:11:00] [INFO ] Implicit Places using invariants in 236 ms returned [10, 22, 36, 37, 48, 95, 96]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 238 ms to find 7 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 100/195 places, 109/197 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 100 transition count 108
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 99 transition count 108
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 99 transition count 106
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 97 transition count 106
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 22 place count 89 transition count 98
Applied a total of 22 rules in 11 ms. Remains 89 /100 variables (removed 11) and now considering 98/109 (removed 11) transitions.
// Phase 1: matrix 98 rows 89 cols
[2024-06-01 12:11:00] [INFO ] Computed 21 invariants in 1 ms
[2024-06-01 12:11:00] [INFO ] Implicit Places using invariants in 173 ms returned []
[2024-06-01 12:11:00] [INFO ] Invariant cache hit.
[2024-06-01 12:11:01] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-06-01 12:11:01] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 479 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 89/195 places, 98/197 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 752 ms. Remains : 89/195 places, 98/197 transitions.
Running random walk in product with property : ParamProductionCell-PT-3-LTLFireability-15
Product exploration explored 100000 steps with 4801 reset in 190 ms.
Product exploration explored 100000 steps with 4800 reset in 207 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 80 steps (0 resets) in 5 ms. (13 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 135 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 95 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
[2024-06-01 12:11:02] [INFO ] Invariant cache hit.
[2024-06-01 12:11:02] [INFO ] [Real]Absence check using 18 positive place invariants in 12 ms returned sat
[2024-06-01 12:11:02] [INFO ] [Real]Absence check using 18 positive and 3 generalized place invariants in 4 ms returned sat
[2024-06-01 12:11:02] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2024-06-01 12:11:02] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:11:02] [INFO ] [Nat]Absence check using 18 positive place invariants in 11 ms returned sat
[2024-06-01 12:11:02] [INFO ] [Nat]Absence check using 18 positive and 3 generalized place invariants in 4 ms returned sat
[2024-06-01 12:11:02] [INFO ] [Nat]Absence check using state equation in 104 ms returned sat
[2024-06-01 12:11:02] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-06-01 12:11:02] [INFO ] [Nat]Added 67 Read/Feed constraints in 24 ms returned sat
[2024-06-01 12:11:02] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-06-01 12:11:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2024-06-01 12:11:02] [INFO ] Computed and/alt/rep : 96/228/96 causal constraints (skipped 0 transitions) in 12 ms.
[2024-06-01 12:11:02] [INFO ] Added : 17 causal constraints over 4 iterations in 92 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 98/98 transitions.
Applied a total of 0 rules in 3 ms. Remains 89 /89 variables (removed 0) and now considering 98/98 (removed 0) transitions.
[2024-06-01 12:11:02] [INFO ] Invariant cache hit.
[2024-06-01 12:11:03] [INFO ] Implicit Places using invariants in 173 ms returned []
[2024-06-01 12:11:03] [INFO ] Invariant cache hit.
[2024-06-01 12:11:03] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-06-01 12:11:03] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 479 ms to find 0 implicit places.
[2024-06-01 12:11:03] [INFO ] Redundant transitions in 0 ms returned []
Running 96 sub problems to find dead transitions.
[2024-06-01 12:11:03] [INFO ] Invariant cache hit.
[2024-06-01 12:11:03] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-06-01 12:11:04] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 1 ms to minimize.
[2024-06-01 12:11:04] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2024-06-01 12:11:04] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 1 ms to minimize.
[2024-06-01 12:11:04] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 2 ms to minimize.
[2024-06-01 12:11:04] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:11:04] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 4 ms to minimize.
[2024-06-01 12:11:04] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 2 ms to minimize.
[2024-06-01 12:11:04] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:11:04] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 1 ms to minimize.
[2024-06-01 12:11:04] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:11:04] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 2 ms to minimize.
[2024-06-01 12:11:04] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 2 ms to minimize.
[2024-06-01 12:11:04] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 2 ms to minimize.
[2024-06-01 12:11:04] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 2 ms to minimize.
[2024-06-01 12:11:04] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 2 ms to minimize.
[2024-06-01 12:11:05] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 2 ms to minimize.
[2024-06-01 12:11:05] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 2 ms to minimize.
[2024-06-01 12:11:05] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:11:05] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:11:05] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-06-01 12:11:05] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:11:05] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:11:05] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:11:05] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:11:05] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:11:05] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:11:05] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:11:05] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 2 ms to minimize.
[2024-06-01 12:11:05] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 2 ms to minimize.
[2024-06-01 12:11:05] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:11:05] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:11:06] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 2 ms to minimize.
[2024-06-01 12:11:06] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:11:06] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:11:06] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:11:06] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:11:06] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:11:06] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:11:06] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-06-01 12:11:06] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-06-01 12:11:06] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:11:07] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:11:07] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:11:07] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:11:07] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:11:07] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:11:07] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 1/88 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-06-01 12:11:08] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-06-01 12:11:08] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
[2024-06-01 12:11:08] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 3/70 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/88 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (OVERLAPS) 1/89 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-06-01 12:11:09] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/89 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/89 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 12 (OVERLAPS) 98/187 variables, 89/161 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/187 variables, 67/228 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/187 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 15 (OVERLAPS) 0/187 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 187/187 variables, and 228 constraints, problems are : Problem set: 0 solved, 96 unsolved in 11339 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 89/89 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 51/51 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 50/69 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 1/88 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 1/89 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/89 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (OVERLAPS) 98/187 variables, 89/161 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/187 variables, 67/228 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/187 variables, 96/324 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-06-01 12:11:18] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
[2024-06-01 12:11:18] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/187 variables, 2/326 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/187 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 14 (OVERLAPS) 0/187 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 187/187 variables, and 326 constraints, problems are : Problem set: 0 solved, 96 unsolved in 6962 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 89/89 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 53/53 constraints]
After SMT, in 18331ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 18333ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 18823 ms. Remains : 89/89 places, 98/98 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 115 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 101 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 80 steps (0 resets) in 6 ms. (11 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 144 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 101 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
[2024-06-01 12:11:22] [INFO ] Invariant cache hit.
[2024-06-01 12:11:22] [INFO ] [Real]Absence check using 18 positive place invariants in 8 ms returned sat
[2024-06-01 12:11:22] [INFO ] [Real]Absence check using 18 positive and 3 generalized place invariants in 2 ms returned sat
[2024-06-01 12:11:22] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2024-06-01 12:11:22] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:11:22] [INFO ] [Nat]Absence check using 18 positive place invariants in 7 ms returned sat
[2024-06-01 12:11:22] [INFO ] [Nat]Absence check using 18 positive and 3 generalized place invariants in 2 ms returned sat
[2024-06-01 12:11:22] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2024-06-01 12:11:22] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-06-01 12:11:22] [INFO ] [Nat]Added 67 Read/Feed constraints in 16 ms returned sat
[2024-06-01 12:11:22] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:11:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2024-06-01 12:11:22] [INFO ] Computed and/alt/rep : 96/228/96 causal constraints (skipped 0 transitions) in 7 ms.
[2024-06-01 12:11:22] [INFO ] Added : 17 causal constraints over 4 iterations in 55 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4800 reset in 156 ms.
Product exploration explored 100000 steps with 4802 reset in 226 ms.
Support contains 2 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 98/98 transitions.
Applied a total of 0 rules in 4 ms. Remains 89 /89 variables (removed 0) and now considering 98/98 (removed 0) transitions.
[2024-06-01 12:11:23] [INFO ] Invariant cache hit.
[2024-06-01 12:11:23] [INFO ] Implicit Places using invariants in 174 ms returned []
[2024-06-01 12:11:23] [INFO ] Invariant cache hit.
[2024-06-01 12:11:23] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-06-01 12:11:23] [INFO ] Implicit Places using invariants and state equation in 330 ms returned []
Implicit Place search using SMT with State Equation took 507 ms to find 0 implicit places.
[2024-06-01 12:11:23] [INFO ] Redundant transitions in 0 ms returned []
Running 96 sub problems to find dead transitions.
[2024-06-01 12:11:23] [INFO ] Invariant cache hit.
[2024-06-01 12:11:23] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-06-01 12:11:24] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 2 ms to minimize.
[2024-06-01 12:11:24] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 2 ms to minimize.
[2024-06-01 12:11:24] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 2 ms to minimize.
[2024-06-01 12:11:24] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 2 ms to minimize.
[2024-06-01 12:11:24] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:11:24] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 2 ms to minimize.
[2024-06-01 12:11:24] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:11:24] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 2 ms to minimize.
[2024-06-01 12:11:24] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 2 ms to minimize.
[2024-06-01 12:11:25] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 2 ms to minimize.
[2024-06-01 12:11:25] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:11:25] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 2 ms to minimize.
[2024-06-01 12:11:25] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-06-01 12:11:25] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2024-06-01 12:11:25] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:11:25] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:11:25] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:11:25] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 2 ms to minimize.
[2024-06-01 12:11:25] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 2 ms to minimize.
[2024-06-01 12:11:25] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-06-01 12:11:25] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:11:25] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:11:25] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 2 ms to minimize.
[2024-06-01 12:11:25] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:11:26] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-06-01 12:11:26] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 0 ms to minimize.
[2024-06-01 12:11:26] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:11:26] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:11:26] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 2 ms to minimize.
[2024-06-01 12:11:26] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 2 ms to minimize.
[2024-06-01 12:11:26] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:11:26] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 2 ms to minimize.
[2024-06-01 12:11:26] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 2 ms to minimize.
[2024-06-01 12:11:26] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:11:26] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:11:26] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 2 ms to minimize.
[2024-06-01 12:11:26] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 2 ms to minimize.
[2024-06-01 12:11:26] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:11:26] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 2 ms to minimize.
[2024-06-01 12:11:26] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-06-01 12:11:27] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:11:27] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:11:27] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:11:27] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
[2024-06-01 12:11:27] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:11:27] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:11:28] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 1/88 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-06-01 12:11:29] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-06-01 12:11:29] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2024-06-01 12:11:29] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 3/70 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/88 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (OVERLAPS) 1/89 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-06-01 12:11:30] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/89 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/89 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 12 (OVERLAPS) 98/187 variables, 89/161 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/187 variables, 67/228 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/187 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 15 (OVERLAPS) 0/187 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 187/187 variables, and 228 constraints, problems are : Problem set: 0 solved, 96 unsolved in 12046 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 89/89 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 51/51 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 50/69 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 1/88 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 1/89 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/89 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (OVERLAPS) 98/187 variables, 89/161 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/187 variables, 67/228 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/187 variables, 96/324 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-06-01 12:11:39] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:11:39] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/187 variables, 2/326 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/187 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 14 (OVERLAPS) 0/187 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 187/187 variables, and 326 constraints, problems are : Problem set: 0 solved, 96 unsolved in 7772 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 89/89 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 53/53 constraints]
After SMT, in 19848ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 19851ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 20369 ms. Remains : 89/89 places, 98/98 transitions.
Treatment of property ParamProductionCell-PT-3-LTLFireability-15 finished in 43429 ms.
[2024-06-01 12:11:43] [INFO ] Flatten gal took : 15 ms
[2024-06-01 12:11:43] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-06-01 12:11:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 195 places, 197 transitions and 647 arcs took 8 ms.
Total runtime 373043 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA ParamProductionCell-PT-3-LTLFireability-03 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ParamProductionCell-PT-3-LTLFireability-04 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ParamProductionCell-PT-3-LTLFireability-05 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ParamProductionCell-PT-3-LTLFireability-06 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ParamProductionCell-PT-3-LTLFireability-15 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717243957449

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name ParamProductionCell-PT-3-LTLFireability-03
ltl formula formula --ltl=/tmp/5163/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 195 places, 197 transitions and 647 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/5163/ltl_0_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.010 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/5163/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/5163/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/5163/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 197 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 196, there are 203 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~267 levels ~10000 states ~17664 transitions
pnml2lts-mc( 2/ 4): ~267 levels ~20000 states ~38532 transitions
pnml2lts-mc( 0/ 4): ~259 levels ~40000 states ~80852 transitions
pnml2lts-mc( 0/ 4): ~259 levels ~80000 states ~164692 transitions
pnml2lts-mc( 2/ 4): ~267 levels ~160000 states ~404420 transitions
pnml2lts-mc( 0/ 4): ~259 levels ~320000 states ~1669740 transitions
pnml2lts-mc( 0/ 4): ~259 levels ~640000 states ~4256288 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 932984
pnml2lts-mc( 0/ 4): unique states count: 932984
pnml2lts-mc( 0/ 4): unique transitions count: 7074951
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 6612955
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 1038797
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1064
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1038797 states 7908478 transitions, fanout: 7.613
pnml2lts-mc( 0/ 4): Total exploration time 6.980 sec (6.980 sec minimum, 6.980 sec on average)
pnml2lts-mc( 0/ 4): States per second: 148825, Transitions per second: 1133020
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 8.0MB, 9.0 B/state, compr.: 1.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 2.0%/1.0%
pnml2lts-mc( 0/ 4): Stored 197 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 8.0MB (~256.0MB paged-in)
ltl formula name ParamProductionCell-PT-3-LTLFireability-04
ltl formula formula --ltl=/tmp/5163/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 195 places, 197 transitions and 647 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.010 user 0.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/5163/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/5163/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/5163/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/5163/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): There are 196 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 196, there are 282 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~135 levels ~10000 states ~43436 transitions
pnml2lts-mc( 2/ 4): ~135 levels ~20000 states ~86484 transitions
pnml2lts-mc( 2/ 4): ~135 levels ~40000 states ~172356 transitions
pnml2lts-mc( 0/ 4): ~267 levels ~80000 states ~440940 transitions
pnml2lts-mc( 3/ 4): ~245 levels ~160000 states ~958852 transitions
pnml2lts-mc( 2/ 4): ~270 levels ~320000 states ~1980500 transitions
pnml2lts-mc( 2/ 4): ~270 levels ~640000 states ~4008988 transitions
pnml2lts-mc( 3/ 4): ~840 levels ~1280000 states ~8189892 transitions
pnml2lts-mc( 3/ 4): ~66011 levels ~2560000 states ~20521916 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1465261
pnml2lts-mc( 0/ 4): unique states count: 2920074
pnml2lts-mc( 0/ 4): unique transitions count: 25501342
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 18400796
pnml2lts-mc( 0/ 4): - claim found count: 4432979
pnml2lts-mc( 0/ 4): - claim success count: 2985231
pnml2lts-mc( 0/ 4): - cum. max stack depth: 293700
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2986632 states 25964944 transitions, fanout: 8.694
pnml2lts-mc( 0/ 4): Total exploration time 20.110 sec (20.110 sec minimum, 20.110 sec on average)
pnml2lts-mc( 0/ 4): States per second: 148515, Transitions per second: 1291146
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 24.6MB, 8.8 B/state, compr.: 1.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 8.0%/3.0%
pnml2lts-mc( 0/ 4): Stored 197 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 24.6MB (~256.0MB paged-in)
ltl formula name ParamProductionCell-PT-3-LTLFireability-05
ltl formula formula --ltl=/tmp/5163/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 195 places, 197 transitions and 647 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.010 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/5163/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/5163/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/5163/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/5163/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 196 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 196, there are 254 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~328 levels ~10000 states ~49776 transitions
pnml2lts-mc( 1/ 4): ~328 levels ~20000 states ~115880 transitions
pnml2lts-mc( 3/ 4): ~321 levels ~40000 states ~194704 transitions
pnml2lts-mc( 2/ 4): ~330 levels ~80000 states ~467372 transitions
pnml2lts-mc( 2/ 4): ~330 levels ~160000 states ~987548 transitions
pnml2lts-mc( 2/ 4): ~330 levels ~320000 states ~2095984 transitions
pnml2lts-mc( 2/ 4): ~330 levels ~640000 states ~6835428 transitions
pnml2lts-mc( 2/ 4): ~330 levels ~1280000 states ~16621748 transitions
pnml2lts-mc( 2/ 4): ~68300 levels ~2560000 states ~38263400 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1449375
pnml2lts-mc( 0/ 4): unique states count: 2904188
pnml2lts-mc( 0/ 4): unique transitions count: 46776918
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 41623851
pnml2lts-mc( 0/ 4): - claim found count: 4443531
pnml2lts-mc( 0/ 4): - claim success count: 3144006
pnml2lts-mc( 0/ 4): - cum. max stack depth: 289767
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 3152773 states 50654957 transitions, fanout: 16.067
pnml2lts-mc( 0/ 4): Total exploration time 24.270 sec (24.270 sec minimum, 24.270 sec on average)
pnml2lts-mc( 0/ 4): States per second: 129904, Transitions per second: 2087143
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 24.5MB, 8.8 B/state, compr.: 1.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 8.0%/3.0%
pnml2lts-mc( 0/ 4): Stored 197 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 24.5MB (~256.0MB paged-in)
ltl formula name ParamProductionCell-PT-3-LTLFireability-06
ltl formula formula --ltl=/tmp/5163/ltl_3_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 195 places, 197 transitions and 647 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.010 user 0.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/5163/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/5163/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/5163/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/5163/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 197 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 196, there are 202 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~106 levels ~10000 states ~26836 transitions
pnml2lts-mc( 1/ 4): ~106 levels ~20000 states ~60748 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 20320
pnml2lts-mc( 0/ 4): unique states count: 20320
pnml2lts-mc( 0/ 4): unique transitions count: 61632
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 49679
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 26208
pnml2lts-mc( 0/ 4): - cum. max stack depth: 431
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 26208 states 79595 transitions, fanout: 3.037
pnml2lts-mc( 0/ 4): Total exploration time 0.290 sec (0.280 sec minimum, 0.282 sec on average)
pnml2lts-mc( 0/ 4): States per second: 90372, Transitions per second: 274466
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.2MB, 11.0 B/state, compr.: 1.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 197 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.2MB (~256.0MB paged-in)
ltl formula name ParamProductionCell-PT-3-LTLFireability-15
ltl formula formula --ltl=/tmp/5163/ltl_4_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 195 places, 197 transitions and 647 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.020 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/5163/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/5163/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/5163/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/5163/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 197 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 196, there are 202 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 832
pnml2lts-mc( 0/ 4): unique states count: 832
pnml2lts-mc( 0/ 4): unique transitions count: 3741
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 3848
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 1332
pnml2lts-mc( 0/ 4): - cum. max stack depth: 165
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1332 states 6174 transitions, fanout: 4.635
pnml2lts-mc( 0/ 4): Total exploration time 0.020 sec (0.020 sec minimum, 0.020 sec on average)
pnml2lts-mc( 0/ 4): States per second: 66600, Transitions per second: 308700
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 17.8 B/state, compr.: 2.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 197 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is ParamProductionCell-PT-3, 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 r512-smll-171654406800036"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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