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.r524-tall-171679080200364.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 SafeBus-COL-06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r524-tall-171679080200364
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 8.7K Apr 12 14:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Apr 12 14:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 12 14:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 12 14:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 14:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Apr 12 14:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 12 14:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 123K Apr 12 14:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 42K 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 SafeBus-COL-06-LTLFireability-00
FORMULA_NAME SafeBus-COL-06-LTLFireability-01
FORMULA_NAME SafeBus-COL-06-LTLFireability-02
FORMULA_NAME SafeBus-COL-06-LTLFireability-03
FORMULA_NAME SafeBus-COL-06-LTLFireability-04
FORMULA_NAME SafeBus-COL-06-LTLFireability-05
FORMULA_NAME SafeBus-COL-06-LTLFireability-06
FORMULA_NAME SafeBus-COL-06-LTLFireability-07
FORMULA_NAME SafeBus-COL-06-LTLFireability-08
FORMULA_NAME SafeBus-COL-06-LTLFireability-09
FORMULA_NAME SafeBus-COL-06-LTLFireability-10
FORMULA_NAME SafeBus-COL-06-LTLFireability-11
FORMULA_NAME SafeBus-COL-06-LTLFireability-12
FORMULA_NAME SafeBus-COL-06-LTLFireability-13
FORMULA_NAME SafeBus-COL-06-LTLFireability-14
FORMULA_NAME SafeBus-COL-06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717222305264

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SafeBus-COL-06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:11:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 06:11:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:11:46] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-06-01 06:11:46] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 06:11:46] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 539 ms
[2024-06-01 06:11:47] [INFO ] Detected 1 constant HL places corresponding to 6 PT places.
[2024-06-01 06:11:47] [INFO ] Imported 20 HL places and 14 HL transitions for a total of 150 PT places and 2029.0 transition bindings in 22 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2024-06-01 06:11:47] [INFO ] Built PT skeleton of HLPN with 20 places and 14 transitions 68 arcs in 4 ms.
[2024-06-01 06:11:47] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 4 formulas.
FORMULA SafeBus-COL-06-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-COL-06-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-COL-06-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-COL-06-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3 stabilizing places and 0 stable transitions
Remains 11 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Reduction of identical properties reduced properties to check from 15 to 14
RANDOM walk for 686 steps (0 resets) in 67 ms. (10 steps per ms) remains 0/14 properties
[2024-06-01 06:11:47] [INFO ] Flatten gal took : 13 ms
[2024-06-01 06:11:47] [INFO ] Flatten gal took : 4 ms
Domain [It(6), It(6)] of place AMC breaks symmetries in sort It
[2024-06-01 06:11:47] [INFO ] Unfolded HLPN to a Petri net with 150 places and 463 transitions 2962 arcs in 36 ms.
[2024-06-01 06:11:47] [INFO ] Unfolded 12 HLPN properties in 1 ms.
[2024-06-01 06:11:47] [INFO ] Reduced 24 identical enabling conditions.
[2024-06-01 06:11:47] [INFO ] Reduced 24 identical enabling conditions.
[2024-06-01 06:11:47] [INFO ] Reduced 24 identical enabling conditions.
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 12 places and 12 transitions.
Support contains 138 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 451/451 transitions.
Applied a total of 0 rules in 10 ms. Remains 138 /138 variables (removed 0) and now considering 451/451 (removed 0) transitions.
[2024-06-01 06:11:47] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
// Phase 1: matrix 242 rows 138 cols
[2024-06-01 06:11:47] [INFO ] Computed 29 invariants in 28 ms
[2024-06-01 06:11:47] [INFO ] Implicit Places using invariants in 163 ms returned []
[2024-06-01 06:11:47] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
[2024-06-01 06:11:47] [INFO ] Invariant cache hit.
[2024-06-01 06:11:47] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-01 06:11:47] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
Running 445 sub problems to find dead transitions.
[2024-06-01 06:11:47] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
[2024-06-01 06:11:47] [INFO ] Invariant cache hit.
[2024-06-01 06:11:47] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 445 unsolved
Problem TDEAD31 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD246 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 16/29 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-06-01 06:11:49] [INFO ] Deduced a trap composed of 27 places in 116 ms of which 20 ms to minimize.
[2024-06-01 06:11:50] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 1 ms to minimize.
[2024-06-01 06:11:50] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 1 ms to minimize.
[2024-06-01 06:11:51] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 1 ms to minimize.
[2024-06-01 06:11:51] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 1 ms to minimize.
[2024-06-01 06:11:51] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 1 ms to minimize.
[2024-06-01 06:11:51] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2024-06-01 06:11:51] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 1 ms to minimize.
[2024-06-01 06:11:51] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:11:51] [INFO ] Deduced a trap composed of 45 places in 80 ms of which 3 ms to minimize.
[2024-06-01 06:11:51] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 10 ms to minimize.
[2024-06-01 06:11:51] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 1 ms to minimize.
[2024-06-01 06:11:51] [INFO ] Deduced a trap composed of 33 places in 72 ms of which 1 ms to minimize.
[2024-06-01 06:11:51] [INFO ] Deduced a trap composed of 33 places in 76 ms of which 1 ms to minimize.
[2024-06-01 06:11:52] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 1 ms to minimize.
[2024-06-01 06:11:52] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:11:52] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 1 ms to minimize.
[2024-06-01 06:11:52] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:11:52] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 2 ms to minimize.
[2024-06-01 06:11:52] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 20/49 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-06-01 06:11:54] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 1 ms to minimize.
[2024-06-01 06:11:54] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 1 ms to minimize.
[2024-06-01 06:11:54] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 1 ms to minimize.
[2024-06-01 06:11:54] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 1 ms to minimize.
[2024-06-01 06:11:54] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:11:54] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:11:54] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 0 ms to minimize.
[2024-06-01 06:11:54] [INFO ] Deduced a trap composed of 38 places in 74 ms of which 1 ms to minimize.
[2024-06-01 06:11:54] [INFO ] Deduced a trap composed of 43 places in 75 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 9/58 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-06-01 06:11:57] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 1/59 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-06-01 06:11:58] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 1 ms to minimize.
[2024-06-01 06:11:58] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 2/61 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-06-01 06:12:00] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 1/62 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-06-01 06:12:01] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 1 ms to minimize.
[2024-06-01 06:12:01] [INFO ] Deduced a trap composed of 37 places in 52 ms of which 4 ms to minimize.
[2024-06-01 06:12:01] [INFO ] Deduced a trap composed of 37 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:12:01] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:12:01] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:12:01] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 6/68 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-06-01 06:12:04] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 2 ms to minimize.
[2024-06-01 06:12:04] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 1 ms to minimize.
[2024-06-01 06:12:04] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 3/71 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-06-01 06:12:06] [INFO ] Deduced a trap composed of 44 places in 77 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 1/72 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 0/72 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 11 (OVERLAPS) 242/380 variables, 138/210 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/380 variables, 43/253 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/380 variables, 0/253 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 14 (OVERLAPS) 0/380 variables, 0/253 constraints. Problems are: Problem set: 36 solved, 409 unsolved
No progress, stopping.
After SMT solving in domain Real declared 380/380 variables, and 253 constraints, problems are : Problem set: 36 solved, 409 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 445/445 constraints, Known Traps: 43/43 constraints]
Escalating to Integer solving :Problem set: 36 solved, 409 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 13/13 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 16/29 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 43/72 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/72 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 4 (OVERLAPS) 242/380 variables, 138/210 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/380 variables, 43/253 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 409/662 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-06-01 06:12:25] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:12:25] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:12:30] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 1 ms to minimize.
[2024-06-01 06:12:30] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2024-06-01 06:12:31] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 5/667 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 0/667 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-06-01 06:12:48] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/380 variables, and 668 constraints, problems are : Problem set: 36 solved, 409 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/445 constraints, Known Traps: 49/49 constraints]
After SMT, in 60709ms problems are : Problem set: 36 solved, 409 unsolved
Search for dead transitions found 36 dead transitions in 60727ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in LTL mode, iteration 1 : 138/138 places, 415/451 transitions.
Applied a total of 0 rules in 8 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61076 ms. Remains : 138/138 places, 415/451 transitions.
Support contains 138 out of 138 places after structural reductions.
[2024-06-01 06:12:48] [INFO ] Flatten gal took : 56 ms
[2024-06-01 06:12:48] [INFO ] Flatten gal took : 62 ms
[2024-06-01 06:12:48] [INFO ] Input system was already deterministic with 415 transitions.
Reduction of identical properties reduced properties to check from 17 to 15
RANDOM walk for 1374 steps (0 resets) in 99 ms. (13 steps per ms) remains 0/15 properties
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)||(X(p0)&&F((G(F(p1))||(G(p0)&&F(p1)))))))))'
Support contains 61 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 4 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-06-01 06:12:49] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-06-01 06:12:49] [INFO ] Invariant cache hit.
[2024-06-01 06:12:49] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-01 06:12:49] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-06-01 06:12:49] [INFO ] Invariant cache hit.
[2024-06-01 06:12:49] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-01 06:12:49] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
Running 409 sub problems to find dead transitions.
[2024-06-01 06:12:49] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-06-01 06:12:49] [INFO ] Invariant cache hit.
[2024-06-01 06:12:49] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 16/29 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 06:12:51] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 1 ms to minimize.
[2024-06-01 06:12:51] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
[2024-06-01 06:12:52] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 1 ms to minimize.
[2024-06-01 06:12:52] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
[2024-06-01 06:12:52] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 3 ms to minimize.
[2024-06-01 06:12:52] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2024-06-01 06:12:52] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2024-06-01 06:12:52] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 1 ms to minimize.
[2024-06-01 06:12:52] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 1 ms to minimize.
[2024-06-01 06:12:52] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2024-06-01 06:12:52] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 1 ms to minimize.
[2024-06-01 06:12:52] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 1 ms to minimize.
[2024-06-01 06:12:53] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 1 ms to minimize.
[2024-06-01 06:12:53] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 1 ms to minimize.
[2024-06-01 06:12:53] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 1 ms to minimize.
[2024-06-01 06:12:53] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 06:12:53] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 1 ms to minimize.
[2024-06-01 06:12:53] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 1 ms to minimize.
[2024-06-01 06:12:54] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:12:54] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 1 ms to minimize.
[2024-06-01 06:12:55] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 1 ms to minimize.
[2024-06-01 06:12:55] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 1 ms to minimize.
[2024-06-01 06:12:55] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 0 ms to minimize.
[2024-06-01 06:12:55] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:12:55] [INFO ] Deduced a trap composed of 44 places in 74 ms of which 1 ms to minimize.
[2024-06-01 06:12:55] [INFO ] Deduced a trap composed of 38 places in 73 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 10/55 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 06:12:58] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (OVERLAPS) 242/380 variables, 138/194 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 43/237 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 9 (OVERLAPS) 0/380 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 409 unsolved
No progress, stopping.
After SMT solving in domain Real declared 380/380 variables, and 237 constraints, problems are : Problem set: 0 solved, 409 unsolved in 25659 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 409 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 16/29 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 27/56 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (OVERLAPS) 242/380 variables, 138/194 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/380 variables, 43/237 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 409/646 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 06:13:22] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 1/647 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 0/647 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/380 variables, and 647 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 28/28 constraints]
After SMT, in 56053ms problems are : Problem set: 0 solved, 409 unsolved
Search for dead transitions found 0 dead transitions in 56057ms
Finished structural reductions in LTL mode , in 1 iterations and 56371 ms. Remains : 138/138 places, 415/415 transitions.
Stuttering acceptance computed with spot in 330 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : SafeBus-COL-06-LTLFireability-00
Product exploration explored 100000 steps with 7147 reset in 556 ms.
Product exploration explored 100000 steps with 7152 reset in 517 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 179 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 122 steps (0 resets) in 9 ms. (12 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 6 factoid took 252 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 63 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 61 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 36 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-06-01 06:13:47] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-06-01 06:13:47] [INFO ] Invariant cache hit.
[2024-06-01 06:13:47] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-01 06:13:47] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-06-01 06:13:47] [INFO ] Invariant cache hit.
[2024-06-01 06:13:48] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-01 06:13:48] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
[2024-06-01 06:13:48] [INFO ] Redundant transitions in 25 ms returned []
Running 409 sub problems to find dead transitions.
[2024-06-01 06:13:48] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-06-01 06:13:48] [INFO ] Invariant cache hit.
[2024-06-01 06:13:48] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 16/29 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 06:13:49] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 1 ms to minimize.
[2024-06-01 06:13:49] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2024-06-01 06:13:50] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 0 ms to minimize.
[2024-06-01 06:13:50] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
[2024-06-01 06:13:50] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 1 ms to minimize.
[2024-06-01 06:13:50] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 1 ms to minimize.
[2024-06-01 06:13:50] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 1 ms to minimize.
[2024-06-01 06:13:51] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 1 ms to minimize.
[2024-06-01 06:13:51] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2024-06-01 06:13:51] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 2 ms to minimize.
[2024-06-01 06:13:51] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 1 ms to minimize.
[2024-06-01 06:13:51] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 1 ms to minimize.
[2024-06-01 06:13:51] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 1 ms to minimize.
[2024-06-01 06:13:51] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 1 ms to minimize.
[2024-06-01 06:13:52] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 1 ms to minimize.
[2024-06-01 06:13:52] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 06:13:52] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 1 ms to minimize.
[2024-06-01 06:13:52] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
[2024-06-01 06:13:52] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:13:52] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 1 ms to minimize.
[2024-06-01 06:13:53] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
[2024-06-01 06:13:53] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 1 ms to minimize.
[2024-06-01 06:13:54] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:13:54] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:13:54] [INFO ] Deduced a trap composed of 44 places in 81 ms of which 1 ms to minimize.
[2024-06-01 06:13:54] [INFO ] Deduced a trap composed of 38 places in 65 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 10/55 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 06:13:56] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (OVERLAPS) 242/380 variables, 138/194 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 43/237 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 9 (OVERLAPS) 0/380 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 409 unsolved
No progress, stopping.
After SMT solving in domain Real declared 380/380 variables, and 237 constraints, problems are : Problem set: 0 solved, 409 unsolved in 25572 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 409 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 16/29 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 27/56 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (OVERLAPS) 242/380 variables, 138/194 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/380 variables, 43/237 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 409/646 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 06:14:21] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 1/647 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/380 variables, and 647 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 28/28 constraints]
After SMT, in 55958ms problems are : Problem set: 0 solved, 409 unsolved
Search for dead transitions found 0 dead transitions in 55962ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 56335 ms. Remains : 138/138 places, 415/415 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 7 factoid took 202 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 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 97 steps (0 resets) in 8 ms. (10 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 7 factoid took 317 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 85 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 3990 reset in 1029 ms.
Product exploration explored 100000 steps with 3963 reset in 1053 ms.
Support contains 61 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 28 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-06-01 06:14:47] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-06-01 06:14:47] [INFO ] Invariant cache hit.
[2024-06-01 06:14:47] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-06-01 06:14:47] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-06-01 06:14:47] [INFO ] Invariant cache hit.
[2024-06-01 06:14:47] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-01 06:14:47] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
[2024-06-01 06:14:47] [INFO ] Redundant transitions in 9 ms returned []
Running 409 sub problems to find dead transitions.
[2024-06-01 06:14:47] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-06-01 06:14:47] [INFO ] Invariant cache hit.
[2024-06-01 06:14:47] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 16/29 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 06:14:49] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 1 ms to minimize.
[2024-06-01 06:14:49] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2024-06-01 06:14:49] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 1 ms to minimize.
[2024-06-01 06:14:49] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2024-06-01 06:14:50] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 1 ms to minimize.
[2024-06-01 06:14:50] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 1 ms to minimize.
[2024-06-01 06:14:50] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 1 ms to minimize.
[2024-06-01 06:14:50] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 1 ms to minimize.
[2024-06-01 06:14:50] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 1 ms to minimize.
[2024-06-01 06:14:50] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 1 ms to minimize.
[2024-06-01 06:14:50] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 1 ms to minimize.
[2024-06-01 06:14:50] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 1 ms to minimize.
[2024-06-01 06:14:51] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 0 ms to minimize.
[2024-06-01 06:14:51] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 1 ms to minimize.
[2024-06-01 06:14:51] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 1 ms to minimize.
[2024-06-01 06:14:51] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 06:14:51] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 1 ms to minimize.
[2024-06-01 06:14:51] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 1 ms to minimize.
[2024-06-01 06:14:51] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:14:51] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 1 ms to minimize.
[2024-06-01 06:14:53] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 1 ms to minimize.
[2024-06-01 06:14:53] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 1 ms to minimize.
[2024-06-01 06:14:53] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:14:53] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:14:53] [INFO ] Deduced a trap composed of 44 places in 69 ms of which 1 ms to minimize.
[2024-06-01 06:14:53] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 10/55 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 06:14:55] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (OVERLAPS) 242/380 variables, 138/194 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 43/237 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 9 (OVERLAPS) 0/380 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 409 unsolved
No progress, stopping.
After SMT solving in domain Real declared 380/380 variables, and 237 constraints, problems are : Problem set: 0 solved, 409 unsolved in 25659 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 409 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 16/29 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 27/56 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (OVERLAPS) 242/380 variables, 138/194 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/380 variables, 43/237 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 409/646 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 06:15:20] [INFO ] Deduced a trap composed of 40 places in 56 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 1/647 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/380 variables, and 647 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 28/28 constraints]
After SMT, in 56010ms problems are : Problem set: 0 solved, 409 unsolved
Search for dead transitions found 0 dead transitions in 56015ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 56366 ms. Remains : 138/138 places, 415/415 transitions.
Treatment of property SafeBus-COL-06-LTLFireability-00 finished in 174388 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X(X(p0))))))'
Support contains 12 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 4 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-06-01 06:15:43] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-06-01 06:15:43] [INFO ] Invariant cache hit.
[2024-06-01 06:15:43] [INFO ] Implicit Places using invariants in 120 ms returned [91, 92, 93, 94, 95, 96]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 124 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 132/138 places, 415/415 transitions.
Applied a total of 0 rules in 5 ms. Remains 132 /132 variables (removed 0) and now considering 415/415 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 135 ms. Remains : 132/138 places, 415/415 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SafeBus-COL-06-LTLFireability-01
Product exploration explored 100000 steps with 50000 reset in 142 ms.
Product exploration explored 100000 steps with 50000 reset in 144 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SafeBus-COL-06-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SafeBus-COL-06-LTLFireability-01 finished in 601 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((F(p0)||(X(p1)&&p2)))) U p3))'
Support contains 89 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 5 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-06-01 06:15:44] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-06-01 06:15:44] [INFO ] Invariant cache hit.
[2024-06-01 06:15:44] [INFO ] Implicit Places using invariants in 78 ms returned [91, 92, 93, 94, 95, 96]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 79 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 132/138 places, 415/415 transitions.
Applied a total of 0 rules in 3 ms. Remains 132 /132 variables (removed 0) and now considering 415/415 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 87 ms. Remains : 132/138 places, 415/415 transitions.
Stuttering acceptance computed with spot in 202 ms :[(NOT p3), (OR (NOT p3) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SafeBus-COL-06-LTLFireability-02
Product exploration explored 100000 steps with 8609 reset in 314 ms.
Stack based approach found an accepted trace after 44677 steps with 3864 reset with depth 56 and stack size 56 in 143 ms.
FORMULA SafeBus-COL-06-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property SafeBus-COL-06-LTLFireability-02 finished in 775 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 20 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-06-01 06:15:45] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-06-01 06:15:45] [INFO ] Invariant cache hit.
[2024-06-01 06:15:45] [INFO ] Implicit Places using invariants in 145 ms returned [91, 92, 93, 94, 95, 96]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 146 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 132/138 places, 415/415 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 132 transition count 409
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 126 transition count 409
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -114
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 120 transition count 523
Applied a total of 24 rules in 38 ms. Remains 120 /132 variables (removed 12) and now considering 523/415 (removed -108) transitions.
[2024-06-01 06:15:45] [INFO ] Flow matrix only has 350 transitions (discarded 173 similar events)
// Phase 1: matrix 350 rows 120 cols
[2024-06-01 06:15:45] [INFO ] Computed 23 invariants in 16 ms
[2024-06-01 06:15:45] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-06-01 06:15:45] [INFO ] Flow matrix only has 350 transitions (discarded 173 similar events)
[2024-06-01 06:15:45] [INFO ] Invariant cache hit.
[2024-06-01 06:15:45] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-01 06:15:45] [INFO ] Implicit Places using invariants and state equation in 445 ms returned []
Implicit Place search using SMT with State Equation took 580 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 120/138 places, 523/415 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 784 ms. Remains : 120/138 places, 523/415 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : SafeBus-COL-06-LTLFireability-03
Product exploration explored 100000 steps with 0 reset in 307 ms.
Stack based approach found an accepted trace after 104 steps with 0 reset with depth 105 and stack size 105 in 1 ms.
FORMULA SafeBus-COL-06-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property SafeBus-COL-06-LTLFireability-03 finished in 1144 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 12 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 18 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-06-01 06:15:46] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
// Phase 1: matrix 242 rows 138 cols
[2024-06-01 06:15:46] [INFO ] Computed 29 invariants in 7 ms
[2024-06-01 06:15:46] [INFO ] Implicit Places using invariants in 147 ms returned [91, 92, 93, 94, 95, 96]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 148 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 132/138 places, 415/415 transitions.
Applied a total of 0 rules in 37 ms. Remains 132 /132 variables (removed 0) and now considering 415/415 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 204 ms. Remains : 132/138 places, 415/415 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SafeBus-COL-06-LTLFireability-04
Product exploration explored 100000 steps with 3960 reset in 239 ms.
Product exploration explored 100000 steps with 3907 reset in 228 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 88 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 65 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 65 steps (0 resets) in 5 ms. (10 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 97 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 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Support contains 12 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 415/415 transitions.
Applied a total of 0 rules in 12 ms. Remains 132 /132 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-06-01 06:15:47] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
// Phase 1: matrix 242 rows 132 cols
[2024-06-01 06:15:47] [INFO ] Computed 23 invariants in 2 ms
[2024-06-01 06:15:47] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-06-01 06:15:47] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-06-01 06:15:47] [INFO ] Invariant cache hit.
[2024-06-01 06:15:47] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-01 06:15:47] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 444 ms to find 0 implicit places.
[2024-06-01 06:15:47] [INFO ] Redundant transitions in 5 ms returned []
Running 409 sub problems to find dead transitions.
[2024-06-01 06:15:47] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-06-01 06:15:47] [INFO ] Invariant cache hit.
[2024-06-01 06:15:47] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 06:15:49] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2024-06-01 06:15:49] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 1 ms to minimize.
[2024-06-01 06:15:50] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 1 ms to minimize.
[2024-06-01 06:15:50] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 1 ms to minimize.
[2024-06-01 06:15:50] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 1 ms to minimize.
[2024-06-01 06:15:50] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 1 ms to minimize.
[2024-06-01 06:15:50] [INFO ] Deduced a trap composed of 36 places in 62 ms of which 1 ms to minimize.
[2024-06-01 06:15:50] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 2 ms to minimize.
[2024-06-01 06:15:50] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 1 ms to minimize.
[2024-06-01 06:15:51] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 2 ms to minimize.
[2024-06-01 06:15:51] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
[2024-06-01 06:15:51] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 1 ms to minimize.
[2024-06-01 06:15:51] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 1 ms to minimize.
[2024-06-01 06:15:51] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
[2024-06-01 06:15:51] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2024-06-01 06:15:51] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 1 ms to minimize.
[2024-06-01 06:15:51] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 1 ms to minimize.
[2024-06-01 06:15:51] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2024-06-01 06:15:51] [INFO ] Deduced a trap composed of 35 places in 67 ms of which 1 ms to minimize.
[2024-06-01 06:15:51] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 06:15:52] [INFO ] Deduced a trap composed of 35 places in 75 ms of which 1 ms to minimize.
[2024-06-01 06:15:53] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 1 ms to minimize.
[2024-06-01 06:15:53] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 1 ms to minimize.
[2024-06-01 06:15:53] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 3 ms to minimize.
[2024-06-01 06:15:53] [INFO ] Deduced a trap composed of 20 places in 101 ms of which 1 ms to minimize.
[2024-06-01 06:15:53] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2024-06-01 06:15:53] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 1 ms to minimize.
[2024-06-01 06:15:53] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 1 ms to minimize.
[2024-06-01 06:15:53] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:15:53] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:15:53] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:15:53] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:15:53] [INFO ] Deduced a trap composed of 41 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:15:53] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:15:53] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 15/58 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 06:15:55] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
[2024-06-01 06:15:55] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 0 ms to minimize.
[2024-06-01 06:15:56] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2024-06-01 06:15:56] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:15:56] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:15:56] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 06:15:57] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 1 ms to minimize.
[2024-06-01 06:15:58] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 06:15:59] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 8 (OVERLAPS) 242/374 variables, 132/199 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/374 variables, 43/242 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 06:16:09] [INFO ] Deduced a trap composed of 67 places in 70 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/374 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/374 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 374/374 variables, and 243 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 132/132 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 45/45 constraints]
Escalating to Integer solving :Problem set: 0 solved, 409 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 45/68 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (OVERLAPS) 242/374 variables, 132/200 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 43/243 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 409/652 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/374 variables, 0/652 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 8 (OVERLAPS) 0/374 variables, 0/652 constraints. Problems are: Problem set: 0 solved, 409 unsolved
No progress, stopping.
After SMT solving in domain Int declared 374/374 variables, and 652 constraints, problems are : Problem set: 0 solved, 409 unsolved in 28075 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 132/132 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 45/45 constraints]
After SMT, in 58438ms problems are : Problem set: 0 solved, 409 unsolved
Search for dead transitions found 0 dead transitions in 58443ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 58909 ms. Remains : 132/132 places, 415/415 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 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 70 steps (0 resets) in 4 ms. (14 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 133 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 91 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3962 reset in 210 ms.
Product exploration explored 100000 steps with 3918 reset in 215 ms.
Support contains 12 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 415/415 transitions.
Applied a total of 0 rules in 12 ms. Remains 132 /132 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-06-01 06:16:47] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-06-01 06:16:47] [INFO ] Invariant cache hit.
[2024-06-01 06:16:47] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-06-01 06:16:47] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-06-01 06:16:47] [INFO ] Invariant cache hit.
[2024-06-01 06:16:47] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-01 06:16:47] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 445 ms to find 0 implicit places.
[2024-06-01 06:16:47] [INFO ] Redundant transitions in 3 ms returned []
Running 409 sub problems to find dead transitions.
[2024-06-01 06:16:47] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-06-01 06:16:47] [INFO ] Invariant cache hit.
[2024-06-01 06:16:47] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 06:16:49] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 1 ms to minimize.
[2024-06-01 06:16:49] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 1 ms to minimize.
[2024-06-01 06:16:49] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 1 ms to minimize.
[2024-06-01 06:16:50] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2024-06-01 06:16:50] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 1 ms to minimize.
[2024-06-01 06:16:50] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 1 ms to minimize.
[2024-06-01 06:16:50] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 1 ms to minimize.
[2024-06-01 06:16:50] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 1 ms to minimize.
[2024-06-01 06:16:50] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 1 ms to minimize.
[2024-06-01 06:16:50] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 1 ms to minimize.
[2024-06-01 06:16:50] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 1 ms to minimize.
[2024-06-01 06:16:50] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 1 ms to minimize.
[2024-06-01 06:16:51] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 1 ms to minimize.
[2024-06-01 06:16:51] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 1 ms to minimize.
[2024-06-01 06:16:51] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2024-06-01 06:16:51] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
[2024-06-01 06:16:51] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 1 ms to minimize.
[2024-06-01 06:16:51] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2024-06-01 06:16:51] [INFO ] Deduced a trap composed of 35 places in 65 ms of which 1 ms to minimize.
[2024-06-01 06:16:51] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 06:16:52] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 1 ms to minimize.
[2024-06-01 06:16:52] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 0 ms to minimize.
[2024-06-01 06:16:52] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 1 ms to minimize.
[2024-06-01 06:16:52] [INFO ] Deduced a trap composed of 35 places in 71 ms of which 1 ms to minimize.
[2024-06-01 06:16:53] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2024-06-01 06:16:53] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 1 ms to minimize.
[2024-06-01 06:16:53] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 1 ms to minimize.
[2024-06-01 06:16:53] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 1 ms to minimize.
[2024-06-01 06:16:53] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:16:53] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:16:53] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:16:53] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:16:53] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:16:53] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:16:53] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 15/58 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 06:16:55] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
[2024-06-01 06:16:55] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
[2024-06-01 06:16:56] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 1 ms to minimize.
[2024-06-01 06:16:56] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:16:56] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:16:56] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 06:16:57] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 1 ms to minimize.
[2024-06-01 06:16:57] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 06:16:59] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 8 (OVERLAPS) 242/374 variables, 132/199 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/374 variables, 43/242 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 06:17:09] [INFO ] Deduced a trap composed of 67 places in 73 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/374 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/374 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 374/374 variables, and 243 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 132/132 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 45/45 constraints]
Escalating to Integer solving :Problem set: 0 solved, 409 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 45/68 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (OVERLAPS) 242/374 variables, 132/200 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 43/243 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 409/652 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/374 variables, 0/652 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 8 (OVERLAPS) 0/374 variables, 0/652 constraints. Problems are: Problem set: 0 solved, 409 unsolved
No progress, stopping.
After SMT solving in domain Int declared 374/374 variables, and 652 constraints, problems are : Problem set: 0 solved, 409 unsolved in 29481 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 132/132 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 45/45 constraints]
After SMT, in 59820ms problems are : Problem set: 0 solved, 409 unsolved
Search for dead transitions found 0 dead transitions in 59826ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60292 ms. Remains : 132/132 places, 415/415 transitions.
Treatment of property SafeBus-COL-06-LTLFireability-04 finished in 121414 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 7 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 2 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-06-01 06:17:47] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
// Phase 1: matrix 242 rows 138 cols
[2024-06-01 06:17:47] [INFO ] Computed 29 invariants in 3 ms
[2024-06-01 06:17:47] [INFO ] Implicit Places using invariants in 136 ms returned [91, 92, 93, 94, 95, 96]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 138 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 132/138 places, 415/415 transitions.
Applied a total of 0 rules in 2 ms. Remains 132 /132 variables (removed 0) and now considering 415/415 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 142 ms. Remains : 132/138 places, 415/415 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SafeBus-COL-06-LTLFireability-05
Product exploration explored 100000 steps with 14024 reset in 182 ms.
Product exploration explored 100000 steps with 14094 reset in 191 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 77 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 78 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 23 steps (0 resets) in 4 ms. (4 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 87 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 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
[2024-06-01 06:17:48] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
// Phase 1: matrix 242 rows 132 cols
[2024-06-01 06:17:48] [INFO ] Computed 23 invariants in 3 ms
[2024-06-01 06:17:48] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-01 06:17:48] [INFO ] [Real]Absence check using 10 positive and 13 generalized place invariants in 9 ms returned sat
[2024-06-01 06:17:48] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2024-06-01 06:17:48] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:17:48] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-06-01 06:17:48] [INFO ] [Nat]Absence check using 10 positive and 13 generalized place invariants in 18 ms returned sat
[2024-06-01 06:17:49] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2024-06-01 06:17:49] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-01 06:17:49] [INFO ] [Nat]Added 43 Read/Feed constraints in 12 ms returned sat
[2024-06-01 06:17:49] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:17:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2024-06-01 06:17:49] [INFO ] Computed and/alt/rep : 66/348/66 causal constraints (skipped 170 transitions) in 21 ms.
[2024-06-01 06:17:49] [INFO ] Added : 50 causal constraints over 10 iterations in 213 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 7 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 415/415 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 132 transition count 409
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 126 transition count 409
Applied a total of 12 rules in 11 ms. Remains 126 /132 variables (removed 6) and now considering 409/415 (removed 6) transitions.
[2024-06-01 06:17:49] [INFO ] Flow matrix only has 236 transitions (discarded 173 similar events)
// Phase 1: matrix 236 rows 126 cols
[2024-06-01 06:17:49] [INFO ] Computed 23 invariants in 3 ms
[2024-06-01 06:17:49] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-06-01 06:17:49] [INFO ] Flow matrix only has 236 transitions (discarded 173 similar events)
[2024-06-01 06:17:49] [INFO ] Invariant cache hit.
[2024-06-01 06:17:49] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-01 06:17:49] [INFO ] Implicit Places using invariants and state equation in 327 ms returned []
Implicit Place search using SMT with State Equation took 446 ms to find 0 implicit places.
[2024-06-01 06:17:49] [INFO ] Redundant transitions in 3 ms returned []
Running 403 sub problems to find dead transitions.
[2024-06-01 06:17:49] [INFO ] Flow matrix only has 236 transitions (discarded 173 similar events)
[2024-06-01 06:17:49] [INFO ] Invariant cache hit.
[2024-06-01 06:17:49] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-06-01 06:17:51] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:17:51] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:17:51] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 1 ms to minimize.
[2024-06-01 06:17:52] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2024-06-01 06:17:52] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
[2024-06-01 06:17:52] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2024-06-01 06:17:52] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 1 ms to minimize.
[2024-06-01 06:17:52] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 2 ms to minimize.
[2024-06-01 06:17:52] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 1 ms to minimize.
[2024-06-01 06:17:52] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
[2024-06-01 06:17:52] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 1 ms to minimize.
[2024-06-01 06:17:53] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 1 ms to minimize.
[2024-06-01 06:17:53] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 1 ms to minimize.
[2024-06-01 06:17:53] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:17:53] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:17:53] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 16/39 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-06-01 06:17:54] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 1 ms to minimize.
[2024-06-01 06:17:54] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 1 ms to minimize.
[2024-06-01 06:17:54] [INFO ] Deduced a trap composed of 60 places in 70 ms of which 1 ms to minimize.
[2024-06-01 06:17:54] [INFO ] Deduced a trap composed of 46 places in 62 ms of which 1 ms to minimize.
[2024-06-01 06:17:55] [INFO ] Deduced a trap composed of 65 places in 68 ms of which 1 ms to minimize.
[2024-06-01 06:17:55] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:17:55] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 7/46 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-06-01 06:17:57] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:17:57] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 2 ms to minimize.
[2024-06-01 06:17:57] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-06-01 06:17:58] [INFO ] Deduced a trap composed of 33 places in 77 ms of which 1 ms to minimize.
[2024-06-01 06:17:58] [INFO ] Deduced a trap composed of 39 places in 62 ms of which 1 ms to minimize.
[2024-06-01 06:17:58] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-06-01 06:18:00] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-06-01 06:18:02] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-06-01 06:18:03] [INFO ] Deduced a trap composed of 41 places in 78 ms of which 2 ms to minimize.
[2024-06-01 06:18:03] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:18:03] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 10 (OVERLAPS) 236/362 variables, 126/183 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/362 variables, 43/226 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/362 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 13 (OVERLAPS) 0/362 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 403 unsolved
No progress, stopping.
After SMT solving in domain Real declared 362/362 variables, and 226 constraints, problems are : Problem set: 0 solved, 403 unsolved in 27363 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 403/403 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 403 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 34/57 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-06-01 06:18:19] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-06-01 06:18:21] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
[2024-06-01 06:18:21] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 6 (OVERLAPS) 236/362 variables, 126/186 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/362 variables, 43/229 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/362 variables, 403/632 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/362 variables, 0/632 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 10 (OVERLAPS) 0/362 variables, 0/632 constraints. Problems are: Problem set: 0 solved, 403 unsolved
No progress, stopping.
After SMT solving in domain Int declared 362/362 variables, and 632 constraints, problems are : Problem set: 0 solved, 403 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 403/403 constraints, Known Traps: 37/37 constraints]
After SMT, in 57738ms problems are : Problem set: 0 solved, 403 unsolved
Search for dead transitions found 0 dead transitions in 57743ms
Starting structural reductions in SI_LTL mode, iteration 1 : 126/132 places, 409/415 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 58213 ms. Remains : 126/132 places, 409/415 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 85 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 80 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 22 steps (0 resets) in 6 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 73 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 120 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
[2024-06-01 06:18:47] [INFO ] Flow matrix only has 236 transitions (discarded 173 similar events)
[2024-06-01 06:18:47] [INFO ] Invariant cache hit.
[2024-06-01 06:18:48] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-01 06:18:48] [INFO ] [Real]Absence check using 10 positive and 13 generalized place invariants in 6 ms returned sat
[2024-06-01 06:18:48] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2024-06-01 06:18:48] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:18:48] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-01 06:18:48] [INFO ] [Nat]Absence check using 10 positive and 13 generalized place invariants in 8 ms returned sat
[2024-06-01 06:18:48] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2024-06-01 06:18:48] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-01 06:18:48] [INFO ] [Nat]Added 43 Read/Feed constraints in 19 ms returned sat
[2024-06-01 06:18:48] [INFO ] Deduced a trap composed of 39 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:18:48] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:18:48] [INFO ] Deduced a trap composed of 38 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:18:48] [INFO ] Deduced a trap composed of 39 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:18:48] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:18:48] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 258 ms
[2024-06-01 06:18:48] [INFO ] Computed and/alt/rep : 54/270/54 causal constraints (skipped 176 transitions) in 21 ms.
[2024-06-01 06:18:48] [INFO ] Added : 28 causal constraints over 6 iterations in 129 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 14031 reset in 202 ms.
Product exploration explored 100000 steps with 14116 reset in 198 ms.
Support contains 7 out of 126 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 126/126 places, 409/409 transitions.
Applied a total of 0 rules in 8 ms. Remains 126 /126 variables (removed 0) and now considering 409/409 (removed 0) transitions.
[2024-06-01 06:18:49] [INFO ] Flow matrix only has 236 transitions (discarded 173 similar events)
[2024-06-01 06:18:49] [INFO ] Invariant cache hit.
[2024-06-01 06:18:49] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-06-01 06:18:49] [INFO ] Flow matrix only has 236 transitions (discarded 173 similar events)
[2024-06-01 06:18:49] [INFO ] Invariant cache hit.
[2024-06-01 06:18:49] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-01 06:18:49] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 438 ms to find 0 implicit places.
[2024-06-01 06:18:49] [INFO ] Redundant transitions in 3 ms returned []
Running 403 sub problems to find dead transitions.
[2024-06-01 06:18:49] [INFO ] Flow matrix only has 236 transitions (discarded 173 similar events)
[2024-06-01 06:18:49] [INFO ] Invariant cache hit.
[2024-06-01 06:18:49] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-06-01 06:18:51] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:18:51] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 0 ms to minimize.
[2024-06-01 06:18:51] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 1 ms to minimize.
[2024-06-01 06:18:52] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
[2024-06-01 06:18:52] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
[2024-06-01 06:18:52] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
[2024-06-01 06:18:52] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 1 ms to minimize.
[2024-06-01 06:18:52] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2024-06-01 06:18:52] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 1 ms to minimize.
[2024-06-01 06:18:52] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 1 ms to minimize.
[2024-06-01 06:18:52] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 0 ms to minimize.
[2024-06-01 06:18:53] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
[2024-06-01 06:18:53] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 1 ms to minimize.
[2024-06-01 06:18:53] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 0 ms to minimize.
[2024-06-01 06:18:53] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 0 ms to minimize.
[2024-06-01 06:18:53] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 16/39 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-06-01 06:18:54] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
[2024-06-01 06:18:54] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 1 ms to minimize.
[2024-06-01 06:18:55] [INFO ] Deduced a trap composed of 60 places in 67 ms of which 1 ms to minimize.
[2024-06-01 06:18:55] [INFO ] Deduced a trap composed of 46 places in 62 ms of which 1 ms to minimize.
[2024-06-01 06:18:55] [INFO ] Deduced a trap composed of 65 places in 59 ms of which 1 ms to minimize.
[2024-06-01 06:18:55] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:18:55] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 7/46 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-06-01 06:18:57] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2024-06-01 06:18:57] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 1 ms to minimize.
[2024-06-01 06:18:57] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-06-01 06:18:58] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 1 ms to minimize.
[2024-06-01 06:18:58] [INFO ] Deduced a trap composed of 39 places in 62 ms of which 1 ms to minimize.
[2024-06-01 06:18:58] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-06-01 06:19:00] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-06-01 06:19:02] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-06-01 06:19:03] [INFO ] Deduced a trap composed of 41 places in 73 ms of which 1 ms to minimize.
[2024-06-01 06:19:03] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:19:03] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 10 (OVERLAPS) 236/362 variables, 126/183 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/362 variables, 43/226 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/362 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 13 (OVERLAPS) 0/362 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 403 unsolved
No progress, stopping.
After SMT solving in domain Real declared 362/362 variables, and 226 constraints, problems are : Problem set: 0 solved, 403 unsolved in 26948 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 403/403 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 403 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 34/57 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-06-01 06:19:19] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-06-01 06:19:21] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 1 ms to minimize.
[2024-06-01 06:19:21] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 6 (OVERLAPS) 236/362 variables, 126/186 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/362 variables, 43/229 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/362 variables, 403/632 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/362 variables, 0/632 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 10 (OVERLAPS) 0/362 variables, 0/632 constraints. Problems are: Problem set: 0 solved, 403 unsolved
No progress, stopping.
After SMT solving in domain Int declared 362/362 variables, and 632 constraints, problems are : Problem set: 0 solved, 403 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 403/403 constraints, Known Traps: 37/37 constraints]
After SMT, in 57288ms problems are : Problem set: 0 solved, 403 unsolved
Search for dead transitions found 0 dead transitions in 57293ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 57747 ms. Remains : 126/126 places, 409/409 transitions.
Treatment of property SafeBus-COL-06-LTLFireability-05 finished in 119560 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(X(G((F(p2)&&p1))))&&p0)))'
Support contains 19 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 2 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-06-01 06:19:47] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
// Phase 1: matrix 242 rows 138 cols
[2024-06-01 06:19:47] [INFO ] Computed 29 invariants in 2 ms
[2024-06-01 06:19:47] [INFO ] Implicit Places using invariants in 132 ms returned [91, 92, 93, 94, 95, 96]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 133 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 132/138 places, 415/415 transitions.
Applied a total of 0 rules in 2 ms. Remains 132 /132 variables (removed 0) and now considering 415/415 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 137 ms. Remains : 132/138 places, 415/415 transitions.
Stuttering acceptance computed with spot in 256 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : SafeBus-COL-06-LTLFireability-07
Product exploration explored 100000 steps with 3945 reset in 362 ms.
Stack based approach found an accepted trace after 43113 steps with 1711 reset with depth 65 and stack size 65 in 157 ms.
FORMULA SafeBus-COL-06-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property SafeBus-COL-06-LTLFireability-07 finished in 935 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) U p1)))'
Support contains 31 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 18 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-06-01 06:19:48] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-06-01 06:19:48] [INFO ] Invariant cache hit.
[2024-06-01 06:19:48] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-06-01 06:19:48] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-06-01 06:19:48] [INFO ] Invariant cache hit.
[2024-06-01 06:19:48] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-01 06:19:48] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 427 ms to find 0 implicit places.
[2024-06-01 06:19:48] [INFO ] Redundant transitions in 4 ms returned []
Running 409 sub problems to find dead transitions.
[2024-06-01 06:19:48] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-06-01 06:19:48] [INFO ] Invariant cache hit.
[2024-06-01 06:19:48] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 16/29 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 06:19:50] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 1 ms to minimize.
[2024-06-01 06:19:50] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2024-06-01 06:19:50] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 1 ms to minimize.
[2024-06-01 06:19:51] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2024-06-01 06:19:51] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 1 ms to minimize.
[2024-06-01 06:19:51] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
[2024-06-01 06:19:51] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 1 ms to minimize.
[2024-06-01 06:19:51] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 1 ms to minimize.
[2024-06-01 06:19:51] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 1 ms to minimize.
[2024-06-01 06:19:51] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 1 ms to minimize.
[2024-06-01 06:19:51] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 1 ms to minimize.
[2024-06-01 06:19:51] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 3 ms to minimize.
[2024-06-01 06:19:52] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 1 ms to minimize.
[2024-06-01 06:19:52] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 1 ms to minimize.
[2024-06-01 06:19:52] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 1 ms to minimize.
[2024-06-01 06:19:52] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 06:19:52] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 1 ms to minimize.
[2024-06-01 06:19:52] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 1 ms to minimize.
[2024-06-01 06:19:52] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:19:53] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2024-06-01 06:19:54] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
[2024-06-01 06:19:54] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 1 ms to minimize.
[2024-06-01 06:19:54] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 0 ms to minimize.
[2024-06-01 06:19:54] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:19:54] [INFO ] Deduced a trap composed of 44 places in 67 ms of which 1 ms to minimize.
[2024-06-01 06:19:54] [INFO ] Deduced a trap composed of 38 places in 67 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 10/55 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 06:19:57] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (OVERLAPS) 242/380 variables, 138/194 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 43/237 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 9 (OVERLAPS) 0/380 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 409 unsolved
No progress, stopping.
After SMT solving in domain Real declared 380/380 variables, and 237 constraints, problems are : Problem set: 0 solved, 409 unsolved in 26095 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 409 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 16/29 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 27/56 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (OVERLAPS) 242/380 variables, 138/194 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/380 variables, 43/237 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 409/646 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 06:20:22] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 1/647 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/380 variables, and 647 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 28/28 constraints]
After SMT, in 56458ms problems are : Problem set: 0 solved, 409 unsolved
Search for dead transitions found 0 dead transitions in 56464ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 56924 ms. Remains : 138/138 places, 415/415 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : SafeBus-COL-06-LTLFireability-08
Product exploration explored 100000 steps with 10503 reset in 308 ms.
Product exploration explored 100000 steps with 10506 reset in 306 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 107 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 118 ms :[(NOT p1), (NOT p0), (NOT p1)]
RANDOM walk for 232 steps (0 resets) in 7 ms. (29 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 7 factoid took 175 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 120 ms :[(NOT p1), (NOT p0), (NOT p1)]
[2024-06-01 06:20:46] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-06-01 06:20:46] [INFO ] Invariant cache hit.
[2024-06-01 06:20:46] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-06-01 06:20:46] [INFO ] [Real]Absence check using 13 positive and 16 generalized place invariants in 5 ms returned unsat
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 7 factoid took 203 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA SafeBus-COL-06-LTLFireability-08 FALSE TECHNIQUES KNOWLEDGE
Treatment of property SafeBus-COL-06-LTLFireability-08 finished in 58696 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)))'
Support contains 12 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 4 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-06-01 06:20:46] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-06-01 06:20:46] [INFO ] Invariant cache hit.
[2024-06-01 06:20:46] [INFO ] Implicit Places using invariants in 130 ms returned [91, 92, 93, 94, 95, 96]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 131 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 132/138 places, 415/415 transitions.
Applied a total of 0 rules in 1 ms. Remains 132 /132 variables (removed 0) and now considering 415/415 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 137 ms. Remains : 132/138 places, 415/415 transitions.
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SafeBus-COL-06-LTLFireability-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SafeBus-COL-06-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SafeBus-COL-06-LTLFireability-10 finished in 243 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 7 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 13 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-06-01 06:20:47] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-06-01 06:20:47] [INFO ] Invariant cache hit.
[2024-06-01 06:20:47] [INFO ] Implicit Places using invariants in 133 ms returned [91, 92, 93, 94, 95, 96]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 134 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 132/138 places, 415/415 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 132 transition count 409
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 126 transition count 409
Applied a total of 12 rules in 12 ms. Remains 126 /132 variables (removed 6) and now considering 409/415 (removed 6) transitions.
[2024-06-01 06:20:47] [INFO ] Flow matrix only has 236 transitions (discarded 173 similar events)
// Phase 1: matrix 236 rows 126 cols
[2024-06-01 06:20:47] [INFO ] Computed 23 invariants in 4 ms
[2024-06-01 06:20:47] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-06-01 06:20:47] [INFO ] Flow matrix only has 236 transitions (discarded 173 similar events)
[2024-06-01 06:20:47] [INFO ] Invariant cache hit.
[2024-06-01 06:20:47] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-01 06:20:47] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 435 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 126/138 places, 409/415 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 595 ms. Remains : 126/138 places, 409/415 transitions.
Stuttering acceptance computed with spot in 35 ms :[p0]
Running random walk in product with property : SafeBus-COL-06-LTLFireability-11
Product exploration explored 100000 steps with 0 reset in 262 ms.
Stack based approach found an accepted trace after 107 steps with 0 reset with depth 108 and stack size 108 in 1 ms.
FORMULA SafeBus-COL-06-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property SafeBus-COL-06-LTLFireability-11 finished in 905 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 32 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 20 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-06-01 06:20:47] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
// Phase 1: matrix 242 rows 138 cols
[2024-06-01 06:20:47] [INFO ] Computed 29 invariants in 6 ms
[2024-06-01 06:20:48] [INFO ] Implicit Places using invariants in 119 ms returned [91, 92, 93, 94, 95, 96]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 120 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 132/138 places, 415/415 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 132 transition count 409
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 126 transition count 409
Applied a total of 12 rules in 9 ms. Remains 126 /132 variables (removed 6) and now considering 409/415 (removed 6) transitions.
[2024-06-01 06:20:48] [INFO ] Flow matrix only has 236 transitions (discarded 173 similar events)
// Phase 1: matrix 236 rows 126 cols
[2024-06-01 06:20:48] [INFO ] Computed 23 invariants in 2 ms
[2024-06-01 06:20:48] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-06-01 06:20:48] [INFO ] Flow matrix only has 236 transitions (discarded 173 similar events)
[2024-06-01 06:20:48] [INFO ] Invariant cache hit.
[2024-06-01 06:20:48] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-01 06:20:48] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 367 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 126/138 places, 409/415 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 516 ms. Remains : 126/138 places, 409/415 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : SafeBus-COL-06-LTLFireability-12
Product exploration explored 100000 steps with 0 reset in 411 ms.
Stack based approach found an accepted trace after 307 steps with 0 reset with depth 308 and stack size 308 in 2 ms.
FORMULA SafeBus-COL-06-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property SafeBus-COL-06-LTLFireability-12 finished in 997 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(p1)))'
Support contains 19 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 2 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-06-01 06:20:48] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
// Phase 1: matrix 242 rows 138 cols
[2024-06-01 06:20:48] [INFO ] Computed 29 invariants in 2 ms
[2024-06-01 06:20:49] [INFO ] Implicit Places using invariants in 140 ms returned [91, 92, 93, 94, 95, 96]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 141 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 132/138 places, 415/415 transitions.
Applied a total of 0 rules in 1 ms. Remains 132 /132 variables (removed 0) and now considering 415/415 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 144 ms. Remains : 132/138 places, 415/415 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SafeBus-COL-06-LTLFireability-14
Product exploration explored 100000 steps with 4352 reset in 285 ms.
Product exploration explored 100000 steps with 4345 reset in 295 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 (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 107 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
RANDOM walk for 123 steps (0 resets) in 13 ms. (8 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F p1), (F (NOT (OR p0 p1))), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 302 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 19 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 415/415 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 132 transition count 409
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 126 transition count 409
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -114
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 120 transition count 523
Applied a total of 24 rules in 26 ms. Remains 120 /132 variables (removed 12) and now considering 523/415 (removed -108) transitions.
[2024-06-01 06:20:50] [INFO ] Flow matrix only has 350 transitions (discarded 173 similar events)
// Phase 1: matrix 350 rows 120 cols
[2024-06-01 06:20:50] [INFO ] Computed 23 invariants in 6 ms
[2024-06-01 06:20:50] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-06-01 06:20:50] [INFO ] Flow matrix only has 350 transitions (discarded 173 similar events)
[2024-06-01 06:20:50] [INFO ] Invariant cache hit.
[2024-06-01 06:20:50] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-01 06:20:51] [INFO ] Implicit Places using invariants and state equation in 414 ms returned []
Implicit Place search using SMT with State Equation took 535 ms to find 0 implicit places.
[2024-06-01 06:20:51] [INFO ] Redundant transitions in 4 ms returned []
Running 517 sub problems to find dead transitions.
[2024-06-01 06:20:51] [INFO ] Flow matrix only has 350 transitions (discarded 173 similar events)
[2024-06-01 06:20:51] [INFO ] Invariant cache hit.
[2024-06-01 06:20:51] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 12/23 constraints. Problems are: Problem set: 0 solved, 517 unsolved
[2024-06-01 06:20:54] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 0 ms to minimize.
[2024-06-01 06:20:54] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:20:54] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:20:54] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:20:54] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 0 ms to minimize.
[2024-06-01 06:20:54] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:20:54] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-06-01 06:20:54] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:20:54] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:20:54] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 0 ms to minimize.
[2024-06-01 06:20:54] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 1 ms to minimize.
[2024-06-01 06:20:54] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 1 ms to minimize.
[2024-06-01 06:20:54] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 1 ms to minimize.
[2024-06-01 06:20:54] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-06-01 06:20:55] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-06-01 06:20:55] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 0 ms to minimize.
[2024-06-01 06:20:55] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 0 ms to minimize.
[2024-06-01 06:20:55] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-06-01 06:20:55] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 0 ms to minimize.
[2024-06-01 06:20:55] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 517 unsolved
[2024-06-01 06:20:56] [INFO ] Deduced a trap composed of 22 places in 97 ms of which 1 ms to minimize.
[2024-06-01 06:20:56] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 1 ms to minimize.
[2024-06-01 06:20:56] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 1 ms to minimize.
[2024-06-01 06:20:56] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 1 ms to minimize.
[2024-06-01 06:20:56] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
[2024-06-01 06:20:56] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 1 ms to minimize.
[2024-06-01 06:20:57] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 1 ms to minimize.
[2024-06-01 06:20:57] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 1 ms to minimize.
[2024-06-01 06:20:57] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 1 ms to minimize.
[2024-06-01 06:20:57] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 1 ms to minimize.
[2024-06-01 06:20:57] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-06-01 06:20:57] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 1 ms to minimize.
[2024-06-01 06:20:57] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 1 ms to minimize.
[2024-06-01 06:20:57] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 1 ms to minimize.
[2024-06-01 06:20:58] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 1 ms to minimize.
[2024-06-01 06:20:58] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 1 ms to minimize.
[2024-06-01 06:20:58] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 1 ms to minimize.
[2024-06-01 06:20:58] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 18/61 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 5 (OVERLAPS) 350/470 variables, 120/181 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 43/224 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/470 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 517 unsolved
[2024-06-01 06:21:10] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 1 ms to minimize.
[2024-06-01 06:21:10] [INFO ] Deduced a trap composed of 45 places in 77 ms of which 2 ms to minimize.
[2024-06-01 06:21:10] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 1 ms to minimize.
[2024-06-01 06:21:10] [INFO ] Deduced a trap composed of 54 places in 73 ms of which 0 ms to minimize.
[2024-06-01 06:21:10] [INFO ] Deduced a trap composed of 35 places in 85 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/470 variables, 5/229 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/470 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 517 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 470/470 variables, and 229 constraints, problems are : Problem set: 0 solved, 517 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 120/120 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 517/517 constraints, Known Traps: 43/43 constraints]
Escalating to Integer solving :Problem set: 0 solved, 517 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 12/23 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 43/66 constraints. Problems are: Problem set: 0 solved, 517 unsolved
[2024-06-01 06:21:24] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 1 ms to minimize.
[2024-06-01 06:21:25] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 5 (OVERLAPS) 350/470 variables, 120/188 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 43/231 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/470 variables, 517/748 constraints. Problems are: Problem set: 0 solved, 517 unsolved
[2024-06-01 06:21:46] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/470 variables, 1/749 constraints. Problems are: Problem set: 0 solved, 517 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 470/470 variables, and 749 constraints, problems are : Problem set: 0 solved, 517 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 120/120 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 517/517 constraints, Known Traps: 46/46 constraints]
After SMT, in 61290ms problems are : Problem set: 0 solved, 517 unsolved
Search for dead transitions found 0 dead transitions in 61297ms
Starting structural reductions in SI_LTL mode, iteration 1 : 120/132 places, 523/415 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61869 ms. Remains : 120/132 places, 523/415 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) (NOT p1)))), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 124 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
RANDOM walk for 131 steps (0 resets) in 7 ms. (16 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F p1), (F (NOT (OR p0 p1))), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 13 factoid took 349 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 5606 reset in 360 ms.
Product exploration explored 100000 steps with 5622 reset in 372 ms.
Support contains 19 out of 120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 120/120 places, 523/523 transitions.
Applied a total of 0 rules in 15 ms. Remains 120 /120 variables (removed 0) and now considering 523/523 (removed 0) transitions.
[2024-06-01 06:21:54] [INFO ] Flow matrix only has 350 transitions (discarded 173 similar events)
[2024-06-01 06:21:54] [INFO ] Invariant cache hit.
[2024-06-01 06:21:54] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-06-01 06:21:54] [INFO ] Flow matrix only has 350 transitions (discarded 173 similar events)
[2024-06-01 06:21:54] [INFO ] Invariant cache hit.
[2024-06-01 06:21:54] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-01 06:21:55] [INFO ] Implicit Places using invariants and state equation in 420 ms returned []
Implicit Place search using SMT with State Equation took 545 ms to find 0 implicit places.
[2024-06-01 06:21:55] [INFO ] Redundant transitions in 6 ms returned []
Running 517 sub problems to find dead transitions.
[2024-06-01 06:21:55] [INFO ] Flow matrix only has 350 transitions (discarded 173 similar events)
[2024-06-01 06:21:55] [INFO ] Invariant cache hit.
[2024-06-01 06:21:55] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 12/23 constraints. Problems are: Problem set: 0 solved, 517 unsolved
[2024-06-01 06:21:57] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 1 ms to minimize.
[2024-06-01 06:21:57] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-06-01 06:21:58] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-06-01 06:21:58] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 0 ms to minimize.
[2024-06-01 06:21:58] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:21:58] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:21:58] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-06-01 06:21:58] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 0 ms to minimize.
[2024-06-01 06:21:58] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 0 ms to minimize.
[2024-06-01 06:21:58] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:21:58] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 1 ms to minimize.
[2024-06-01 06:21:58] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 1 ms to minimize.
[2024-06-01 06:21:58] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 1 ms to minimize.
[2024-06-01 06:21:58] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-06-01 06:21:58] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:21:58] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:21:58] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2024-06-01 06:21:59] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 0 ms to minimize.
[2024-06-01 06:21:59] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 0 ms to minimize.
[2024-06-01 06:21:59] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 517 unsolved
[2024-06-01 06:22:00] [INFO ] Deduced a trap composed of 22 places in 92 ms of which 1 ms to minimize.
[2024-06-01 06:22:00] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 0 ms to minimize.
[2024-06-01 06:22:00] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 1 ms to minimize.
[2024-06-01 06:22:00] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 1 ms to minimize.
[2024-06-01 06:22:00] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-06-01 06:22:00] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 0 ms to minimize.
[2024-06-01 06:22:00] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 0 ms to minimize.
[2024-06-01 06:22:00] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 1 ms to minimize.
[2024-06-01 06:22:00] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 1 ms to minimize.
[2024-06-01 06:22:01] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 1 ms to minimize.
[2024-06-01 06:22:01] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-06-01 06:22:01] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 1 ms to minimize.
[2024-06-01 06:22:01] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 0 ms to minimize.
[2024-06-01 06:22:01] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 1 ms to minimize.
[2024-06-01 06:22:01] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 1 ms to minimize.
[2024-06-01 06:22:01] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 1 ms to minimize.
[2024-06-01 06:22:01] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 1 ms to minimize.
[2024-06-01 06:22:01] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 18/61 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 5 (OVERLAPS) 350/470 variables, 120/181 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 43/224 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/470 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 517 unsolved
[2024-06-01 06:22:13] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 1 ms to minimize.
[2024-06-01 06:22:13] [INFO ] Deduced a trap composed of 45 places in 71 ms of which 1 ms to minimize.
[2024-06-01 06:22:13] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 1 ms to minimize.
[2024-06-01 06:22:14] [INFO ] Deduced a trap composed of 54 places in 76 ms of which 0 ms to minimize.
[2024-06-01 06:22:14] [INFO ] Deduced a trap composed of 35 places in 79 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/470 variables, 5/229 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/470 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 10 (OVERLAPS) 0/470 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 517 unsolved
No progress, stopping.
After SMT solving in domain Real declared 470/470 variables, and 229 constraints, problems are : Problem set: 0 solved, 517 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 120/120 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 517/517 constraints, Known Traps: 43/43 constraints]
Escalating to Integer solving :Problem set: 0 solved, 517 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 12/23 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 43/66 constraints. Problems are: Problem set: 0 solved, 517 unsolved
[2024-06-01 06:22:28] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 1 ms to minimize.
[2024-06-01 06:22:28] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 5 (OVERLAPS) 350/470 variables, 120/188 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 43/231 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/470 variables, 517/748 constraints. Problems are: Problem set: 0 solved, 517 unsolved
[2024-06-01 06:22:50] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/470 variables, 1/749 constraints. Problems are: Problem set: 0 solved, 517 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 470/470 variables, and 749 constraints, problems are : Problem set: 0 solved, 517 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 120/120 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 517/517 constraints, Known Traps: 46/46 constraints]
After SMT, in 61238ms problems are : Problem set: 0 solved, 517 unsolved
Search for dead transitions found 0 dead transitions in 61252ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61831 ms. Remains : 120/120 places, 523/523 transitions.
Treatment of property SafeBus-COL-06-LTLFireability-14 finished in 127562 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)||(X(p0)&&F((G(F(p1))||(G(p0)&&F(p1)))))))))'
Found a Shortening insensitive property : SafeBus-COL-06-LTLFireability-00
Stuttering acceptance computed with spot in 199 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 61 out of 138 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 11 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-06-01 06:22:56] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
// Phase 1: matrix 242 rows 138 cols
[2024-06-01 06:22:56] [INFO ] Computed 29 invariants in 3 ms
[2024-06-01 06:22:56] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-06-01 06:22:56] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-06-01 06:22:56] [INFO ] Invariant cache hit.
[2024-06-01 06:22:56] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-01 06:22:57] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
Running 409 sub problems to find dead transitions.
[2024-06-01 06:22:57] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-06-01 06:22:57] [INFO ] Invariant cache hit.
[2024-06-01 06:22:57] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 16/29 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 06:22:58] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 1 ms to minimize.
[2024-06-01 06:22:58] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2024-06-01 06:22:59] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 1 ms to minimize.
[2024-06-01 06:22:59] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 0 ms to minimize.
[2024-06-01 06:22:59] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 1 ms to minimize.
[2024-06-01 06:22:59] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 1 ms to minimize.
[2024-06-01 06:22:59] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
[2024-06-01 06:22:59] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 1 ms to minimize.
[2024-06-01 06:23:00] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 1 ms to minimize.
[2024-06-01 06:23:00] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 1 ms to minimize.
[2024-06-01 06:23:00] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 1 ms to minimize.
[2024-06-01 06:23:00] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 1 ms to minimize.
[2024-06-01 06:23:00] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 0 ms to minimize.
[2024-06-01 06:23:00] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
[2024-06-01 06:23:00] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 1 ms to minimize.
[2024-06-01 06:23:01] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 06:23:01] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 1 ms to minimize.
[2024-06-01 06:23:01] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 1 ms to minimize.
[2024-06-01 06:23:01] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:23:01] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 1 ms to minimize.
[2024-06-01 06:23:02] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 1 ms to minimize.
[2024-06-01 06:23:02] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 1 ms to minimize.
[2024-06-01 06:23:02] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:23:02] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 0 ms to minimize.
[2024-06-01 06:23:03] [INFO ] Deduced a trap composed of 44 places in 69 ms of which 1 ms to minimize.
[2024-06-01 06:23:03] [INFO ] Deduced a trap composed of 38 places in 65 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 10/55 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 06:23:05] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (OVERLAPS) 242/380 variables, 138/194 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 43/237 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 9 (OVERLAPS) 0/380 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 409 unsolved
No progress, stopping.
After SMT solving in domain Real declared 380/380 variables, and 237 constraints, problems are : Problem set: 0 solved, 409 unsolved in 25382 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 409 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 16/29 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 27/56 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (OVERLAPS) 242/380 variables, 138/194 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/380 variables, 43/237 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 409/646 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 06:23:29] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 1/647 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/380 variables, and 647 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 28/28 constraints]
After SMT, in 55729ms problems are : Problem set: 0 solved, 409 unsolved
Search for dead transitions found 0 dead transitions in 55735ms
Finished structural reductions in LI_LTL mode , in 1 iterations and 56050 ms. Remains : 138/138 places, 415/415 transitions.
Running random walk in product with property : SafeBus-COL-06-LTLFireability-00
Product exploration explored 100000 steps with 6787 reset in 393 ms.
Product exploration explored 100000 steps with 7108 reset in 420 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 198 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 216 steps (0 resets) in 8 ms. (24 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 6 factoid took 296 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 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 61 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 13 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-06-01 06:23:54] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-06-01 06:23:54] [INFO ] Invariant cache hit.
[2024-06-01 06:23:54] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-06-01 06:23:54] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-06-01 06:23:54] [INFO ] Invariant cache hit.
[2024-06-01 06:23:54] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-01 06:23:54] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
[2024-06-01 06:23:54] [INFO ] Redundant transitions in 3 ms returned []
Running 409 sub problems to find dead transitions.
[2024-06-01 06:23:54] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-06-01 06:23:54] [INFO ] Invariant cache hit.
[2024-06-01 06:23:54] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 16/29 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 06:23:56] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 1 ms to minimize.
[2024-06-01 06:23:56] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2024-06-01 06:23:57] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 1 ms to minimize.
[2024-06-01 06:23:57] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 1 ms to minimize.
[2024-06-01 06:23:57] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 1 ms to minimize.
[2024-06-01 06:23:57] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 1 ms to minimize.
[2024-06-01 06:23:57] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 1 ms to minimize.
[2024-06-01 06:23:57] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 1 ms to minimize.
[2024-06-01 06:23:57] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2024-06-01 06:23:57] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 1 ms to minimize.
[2024-06-01 06:23:58] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 1 ms to minimize.
[2024-06-01 06:23:58] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 1 ms to minimize.
[2024-06-01 06:23:58] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
[2024-06-01 06:23:58] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 0 ms to minimize.
[2024-06-01 06:23:58] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 1 ms to minimize.
[2024-06-01 06:23:58] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 06:23:59] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 1 ms to minimize.
[2024-06-01 06:23:59] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 1 ms to minimize.
[2024-06-01 06:23:59] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:23:59] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 1 ms to minimize.
[2024-06-01 06:24:00] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 1 ms to minimize.
[2024-06-01 06:24:00] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 1 ms to minimize.
[2024-06-01 06:24:00] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:24:00] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:24:00] [INFO ] Deduced a trap composed of 44 places in 66 ms of which 1 ms to minimize.
[2024-06-01 06:24:00] [INFO ] Deduced a trap composed of 38 places in 68 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 10/55 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 06:24:03] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (OVERLAPS) 242/380 variables, 138/194 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 43/237 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 9 (OVERLAPS) 0/380 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 409 unsolved
No progress, stopping.
After SMT solving in domain Real declared 380/380 variables, and 237 constraints, problems are : Problem set: 0 solved, 409 unsolved in 25522 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 409 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 16/29 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 27/56 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (OVERLAPS) 242/380 variables, 138/194 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/380 variables, 43/237 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 409/646 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 06:24:27] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 1/647 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/380 variables, and 647 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 28/28 constraints]
After SMT, in 55887ms problems are : Problem set: 0 solved, 409 unsolved
Search for dead transitions found 0 dead transitions in 55893ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 56232 ms. Remains : 138/138 places, 415/415 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 7 factoid took 228 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 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 125 steps (0 resets) in 9 ms. (12 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 7 factoid took 311 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 56 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 4053 reset in 1022 ms.
Product exploration explored 100000 steps with 3976 reset in 1025 ms.
Support contains 61 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 8 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-06-01 06:24:53] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-06-01 06:24:53] [INFO ] Invariant cache hit.
[2024-06-01 06:24:53] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-06-01 06:24:53] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-06-01 06:24:53] [INFO ] Invariant cache hit.
[2024-06-01 06:24:53] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-01 06:24:53] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
[2024-06-01 06:24:53] [INFO ] Redundant transitions in 4 ms returned []
Running 409 sub problems to find dead transitions.
[2024-06-01 06:24:53] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-06-01 06:24:53] [INFO ] Invariant cache hit.
[2024-06-01 06:24:53] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 16/29 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 06:24:55] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 1 ms to minimize.
[2024-06-01 06:24:55] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2024-06-01 06:24:56] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 1 ms to minimize.
[2024-06-01 06:24:56] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 1 ms to minimize.
[2024-06-01 06:24:56] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 1 ms to minimize.
[2024-06-01 06:24:56] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 1 ms to minimize.
[2024-06-01 06:24:56] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 1 ms to minimize.
[2024-06-01 06:24:56] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 1 ms to minimize.
[2024-06-01 06:24:56] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2024-06-01 06:24:57] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 1 ms to minimize.
[2024-06-01 06:24:57] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 1 ms to minimize.
[2024-06-01 06:24:57] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 1 ms to minimize.
[2024-06-01 06:24:57] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
[2024-06-01 06:24:57] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 1 ms to minimize.
[2024-06-01 06:24:57] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
[2024-06-01 06:24:57] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 06:24:58] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 1 ms to minimize.
[2024-06-01 06:24:58] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 1 ms to minimize.
[2024-06-01 06:24:58] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:24:58] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2024-06-01 06:24:59] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 1 ms to minimize.
[2024-06-01 06:24:59] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 1 ms to minimize.
[2024-06-01 06:24:59] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 0 ms to minimize.
[2024-06-01 06:24:59] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:24:59] [INFO ] Deduced a trap composed of 44 places in 68 ms of which 1 ms to minimize.
[2024-06-01 06:24:59] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 10/55 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 06:25:02] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (OVERLAPS) 242/380 variables, 138/194 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 43/237 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 9 (OVERLAPS) 0/380 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 409 unsolved
No progress, stopping.
After SMT solving in domain Real declared 380/380 variables, and 237 constraints, problems are : Problem set: 0 solved, 409 unsolved in 25335 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 409 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 16/29 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 27/56 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (OVERLAPS) 242/380 variables, 138/194 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/380 variables, 43/237 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 409/646 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 06:25:26] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 1/647 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/380 variables, and 647 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 28/28 constraints]
After SMT, in 55742ms problems are : Problem set: 0 solved, 409 unsolved
Search for dead transitions found 0 dead transitions in 55748ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 56069 ms. Remains : 138/138 places, 415/415 transitions.
Treatment of property SafeBus-COL-06-LTLFireability-00 finished in 173309 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)))'
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 : SafeBus-COL-06-LTLFireability-05
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Support contains 7 out of 138 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 7 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-06-01 06:25:50] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-06-01 06:25:50] [INFO ] Invariant cache hit.
[2024-06-01 06:25:50] [INFO ] Implicit Places using invariants in 149 ms returned [91, 92, 93, 94, 95, 96]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 151 ms to find 6 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 132/138 places, 415/415 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 132 transition count 409
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 126 transition count 409
Applied a total of 12 rules in 7 ms. Remains 126 /132 variables (removed 6) and now considering 409/415 (removed 6) transitions.
[2024-06-01 06:25:50] [INFO ] Flow matrix only has 236 transitions (discarded 173 similar events)
// Phase 1: matrix 236 rows 126 cols
[2024-06-01 06:25:50] [INFO ] Computed 23 invariants in 1 ms
[2024-06-01 06:25:50] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-06-01 06:25:50] [INFO ] Flow matrix only has 236 transitions (discarded 173 similar events)
[2024-06-01 06:25:50] [INFO ] Invariant cache hit.
[2024-06-01 06:25:50] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-01 06:25:50] [INFO ] Implicit Places using invariants and state equation in 313 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 : 126/138 places, 409/415 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 599 ms. Remains : 126/138 places, 409/415 transitions.
Running random walk in product with property : SafeBus-COL-06-LTLFireability-05
Product exploration explored 100000 steps with 14117 reset in 184 ms.
Product exploration explored 100000 steps with 14059 reset in 193 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(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 92 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 80 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 32 steps (0 resets) in 5 ms. (5 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 112 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 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
[2024-06-01 06:25:51] [INFO ] Flow matrix only has 236 transitions (discarded 173 similar events)
[2024-06-01 06:25:51] [INFO ] Invariant cache hit.
[2024-06-01 06:25:51] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-01 06:25:51] [INFO ] [Real]Absence check using 10 positive and 13 generalized place invariants in 6 ms returned sat
[2024-06-01 06:25:51] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2024-06-01 06:25:51] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:25:51] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-01 06:25:51] [INFO ] [Nat]Absence check using 10 positive and 13 generalized place invariants in 9 ms returned sat
[2024-06-01 06:25:51] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2024-06-01 06:25:51] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-01 06:25:51] [INFO ] [Nat]Added 43 Read/Feed constraints in 15 ms returned sat
[2024-06-01 06:25:51] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:25:52] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:25:52] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 0 ms to minimize.
[2024-06-01 06:25:52] [INFO ] Deduced a trap composed of 39 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:25:52] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 3 ms to minimize.
[2024-06-01 06:25:52] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 259 ms
[2024-06-01 06:25:52] [INFO ] Computed and/alt/rep : 54/270/54 causal constraints (skipped 176 transitions) in 22 ms.
[2024-06-01 06:25:52] [INFO ] Added : 28 causal constraints over 6 iterations in 129 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 7 out of 126 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 126/126 places, 409/409 transitions.
Applied a total of 0 rules in 9 ms. Remains 126 /126 variables (removed 0) and now considering 409/409 (removed 0) transitions.
[2024-06-01 06:25:52] [INFO ] Flow matrix only has 236 transitions (discarded 173 similar events)
[2024-06-01 06:25:52] [INFO ] Invariant cache hit.
[2024-06-01 06:25:52] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-06-01 06:25:52] [INFO ] Flow matrix only has 236 transitions (discarded 173 similar events)
[2024-06-01 06:25:52] [INFO ] Invariant cache hit.
[2024-06-01 06:25:52] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-01 06:25:52] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 427 ms to find 0 implicit places.
[2024-06-01 06:25:52] [INFO ] Redundant transitions in 4 ms returned []
Running 403 sub problems to find dead transitions.
[2024-06-01 06:25:52] [INFO ] Flow matrix only has 236 transitions (discarded 173 similar events)
[2024-06-01 06:25:52] [INFO ] Invariant cache hit.
[2024-06-01 06:25:52] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-06-01 06:25:54] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:25:54] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 0 ms to minimize.
[2024-06-01 06:25:55] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 1 ms to minimize.
[2024-06-01 06:25:55] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 1 ms to minimize.
[2024-06-01 06:25:55] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 1 ms to minimize.
[2024-06-01 06:25:55] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2024-06-01 06:25:55] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 1 ms to minimize.
[2024-06-01 06:25:55] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2024-06-01 06:25:55] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 1 ms to minimize.
[2024-06-01 06:25:55] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2024-06-01 06:25:56] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 2 ms to minimize.
[2024-06-01 06:25:56] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 1 ms to minimize.
[2024-06-01 06:25:56] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 1 ms to minimize.
[2024-06-01 06:25:56] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:25:56] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:25:56] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 16/39 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-06-01 06:25:57] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 0 ms to minimize.
[2024-06-01 06:25:57] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 1 ms to minimize.
[2024-06-01 06:25:57] [INFO ] Deduced a trap composed of 60 places in 66 ms of which 0 ms to minimize.
[2024-06-01 06:25:58] [INFO ] Deduced a trap composed of 46 places in 67 ms of which 0 ms to minimize.
[2024-06-01 06:25:58] [INFO ] Deduced a trap composed of 65 places in 64 ms of which 1 ms to minimize.
[2024-06-01 06:25:58] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:25:58] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 7/46 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-06-01 06:26:00] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 0 ms to minimize.
[2024-06-01 06:26:00] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 1 ms to minimize.
[2024-06-01 06:26:00] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-06-01 06:26:01] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 1 ms to minimize.
[2024-06-01 06:26:01] [INFO ] Deduced a trap composed of 39 places in 62 ms of which 1 ms to minimize.
[2024-06-01 06:26:01] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-06-01 06:26:03] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-06-01 06:26:05] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-06-01 06:26:06] [INFO ] Deduced a trap composed of 41 places in 75 ms of which 0 ms to minimize.
[2024-06-01 06:26:06] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:26:06] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 10 (OVERLAPS) 236/362 variables, 126/183 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/362 variables, 43/226 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/362 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 13 (OVERLAPS) 0/362 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 403 unsolved
No progress, stopping.
After SMT solving in domain Real declared 362/362 variables, and 226 constraints, problems are : Problem set: 0 solved, 403 unsolved in 27083 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 403/403 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 403 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 34/57 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-06-01 06:26:22] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-06-01 06:26:24] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2024-06-01 06:26:24] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 6 (OVERLAPS) 236/362 variables, 126/186 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/362 variables, 43/229 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/362 variables, 403/632 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/362 variables, 0/632 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 10 (OVERLAPS) 0/362 variables, 0/632 constraints. Problems are: Problem set: 0 solved, 403 unsolved
No progress, stopping.
After SMT solving in domain Int declared 362/362 variables, and 632 constraints, problems are : Problem set: 0 solved, 403 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 403/403 constraints, Known Traps: 37/37 constraints]
After SMT, in 57464ms problems are : Problem set: 0 solved, 403 unsolved
Search for dead transitions found 0 dead transitions in 57471ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 57923 ms. Remains : 126/126 places, 409/409 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 204 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 74 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 23 steps (0 resets) in 4 ms. (4 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 98 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
[2024-06-01 06:26:50] [INFO ] Flow matrix only has 236 transitions (discarded 173 similar events)
[2024-06-01 06:26:50] [INFO ] Invariant cache hit.
[2024-06-01 06:26:50] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-01 06:26:50] [INFO ] [Real]Absence check using 10 positive and 13 generalized place invariants in 6 ms returned sat
[2024-06-01 06:26:51] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2024-06-01 06:26:51] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:26:51] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-01 06:26:51] [INFO ] [Nat]Absence check using 10 positive and 13 generalized place invariants in 8 ms returned sat
[2024-06-01 06:26:51] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2024-06-01 06:26:51] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-01 06:26:51] [INFO ] [Nat]Added 43 Read/Feed constraints in 16 ms returned sat
[2024-06-01 06:26:51] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 0 ms to minimize.
[2024-06-01 06:26:51] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:26:51] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:26:51] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:26:51] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 0 ms to minimize.
[2024-06-01 06:26:51] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 244 ms
[2024-06-01 06:26:51] [INFO ] Computed and/alt/rep : 54/270/54 causal constraints (skipped 176 transitions) in 20 ms.
[2024-06-01 06:26:51] [INFO ] Added : 28 causal constraints over 6 iterations in 127 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 14076 reset in 191 ms.
Product exploration explored 100000 steps with 14063 reset in 196 ms.
Support contains 7 out of 126 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 126/126 places, 409/409 transitions.
Applied a total of 0 rules in 7 ms. Remains 126 /126 variables (removed 0) and now considering 409/409 (removed 0) transitions.
[2024-06-01 06:26:52] [INFO ] Flow matrix only has 236 transitions (discarded 173 similar events)
[2024-06-01 06:26:52] [INFO ] Invariant cache hit.
[2024-06-01 06:26:52] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-06-01 06:26:52] [INFO ] Flow matrix only has 236 transitions (discarded 173 similar events)
[2024-06-01 06:26:52] [INFO ] Invariant cache hit.
[2024-06-01 06:26:52] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-01 06:26:52] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 426 ms to find 0 implicit places.
[2024-06-01 06:26:52] [INFO ] Redundant transitions in 3 ms returned []
Running 403 sub problems to find dead transitions.
[2024-06-01 06:26:52] [INFO ] Flow matrix only has 236 transitions (discarded 173 similar events)
[2024-06-01 06:26:52] [INFO ] Invariant cache hit.
[2024-06-01 06:26:52] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-06-01 06:26:53] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:26:54] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:26:54] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 1 ms to minimize.
[2024-06-01 06:26:54] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 1 ms to minimize.
[2024-06-01 06:26:54] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 1 ms to minimize.
[2024-06-01 06:26:54] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
[2024-06-01 06:26:55] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 1 ms to minimize.
[2024-06-01 06:26:55] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 1 ms to minimize.
[2024-06-01 06:26:55] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 1 ms to minimize.
[2024-06-01 06:26:55] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 1 ms to minimize.
[2024-06-01 06:26:55] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 1 ms to minimize.
[2024-06-01 06:26:55] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
[2024-06-01 06:26:55] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 1 ms to minimize.
[2024-06-01 06:26:56] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:26:56] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:26:56] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 16/39 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-06-01 06:26:57] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2024-06-01 06:26:57] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 0 ms to minimize.
[2024-06-01 06:26:57] [INFO ] Deduced a trap composed of 60 places in 67 ms of which 1 ms to minimize.
[2024-06-01 06:26:57] [INFO ] Deduced a trap composed of 46 places in 59 ms of which 0 ms to minimize.
[2024-06-01 06:26:57] [INFO ] Deduced a trap composed of 65 places in 65 ms of which 0 ms to minimize.
[2024-06-01 06:26:57] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:26:57] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 7/46 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-06-01 06:26:59] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:26:59] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2024-06-01 06:27:00] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-06-01 06:27:00] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 0 ms to minimize.
[2024-06-01 06:27:01] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 1 ms to minimize.
[2024-06-01 06:27:01] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-06-01 06:27:02] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-06-01 06:27:05] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-06-01 06:27:06] [INFO ] Deduced a trap composed of 41 places in 73 ms of which 1 ms to minimize.
[2024-06-01 06:27:06] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:27:06] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 10 (OVERLAPS) 236/362 variables, 126/183 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/362 variables, 43/226 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/362 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 13 (OVERLAPS) 0/362 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 403 unsolved
No progress, stopping.
After SMT solving in domain Real declared 362/362 variables, and 226 constraints, problems are : Problem set: 0 solved, 403 unsolved in 26803 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 403/403 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 403 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 34/57 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-06-01 06:27:21] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-06-01 06:27:23] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 1 ms to minimize.
[2024-06-01 06:27:24] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 6 (OVERLAPS) 236/362 variables, 126/186 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/362 variables, 43/229 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/362 variables, 403/632 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/362 variables, 0/632 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 10 (OVERLAPS) 0/362 variables, 0/632 constraints. Problems are: Problem set: 0 solved, 403 unsolved
No progress, stopping.
After SMT solving in domain Int declared 362/362 variables, and 632 constraints, problems are : Problem set: 0 solved, 403 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 403/403 constraints, Known Traps: 37/37 constraints]
After SMT, in 57181ms problems are : Problem set: 0 solved, 403 unsolved
Search for dead transitions found 0 dead transitions in 57187ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 57634 ms. Remains : 126/126 places, 409/409 transitions.
Treatment of property SafeBus-COL-06-LTLFireability-05 finished in 119876 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(p1)))'
Found a Lengthening insensitive property : SafeBus-COL-06-LTLFireability-14
Stuttering acceptance computed with spot in 127 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 19 out of 138 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 5 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-06-01 06:27:49] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
// Phase 1: matrix 242 rows 138 cols
[2024-06-01 06:27:49] [INFO ] Computed 29 invariants in 3 ms
[2024-06-01 06:27:50] [INFO ] Implicit Places using invariants in 126 ms returned [91, 92, 93, 94, 95, 96]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 127 ms to find 6 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 132/138 places, 415/415 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 132 transition count 409
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 126 transition count 409
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -114
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 120 transition count 523
Applied a total of 24 rules in 9 ms. Remains 120 /132 variables (removed 12) and now considering 523/415 (removed -108) transitions.
[2024-06-01 06:27:50] [INFO ] Flow matrix only has 350 transitions (discarded 173 similar events)
// Phase 1: matrix 350 rows 120 cols
[2024-06-01 06:27:50] [INFO ] Computed 23 invariants in 3 ms
[2024-06-01 06:27:50] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-06-01 06:27:50] [INFO ] Flow matrix only has 350 transitions (discarded 173 similar events)
[2024-06-01 06:27:50] [INFO ] Invariant cache hit.
[2024-06-01 06:27:50] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-01 06:27:50] [INFO ] Implicit Places using invariants and state equation in 409 ms returned []
Implicit Place search using SMT with State Equation took 525 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 120/138 places, 523/415 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 667 ms. Remains : 120/138 places, 523/415 transitions.
Running random walk in product with property : SafeBus-COL-06-LTLFireability-14
Product exploration explored 100000 steps with 5610 reset in 358 ms.
Product exploration explored 100000 steps with 5608 reset in 364 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 (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 110 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
RANDOM walk for 138 steps (0 resets) in 8 ms. (15 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F p1), (F (NOT (OR p0 p1))), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 298 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 19 out of 120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 120/120 places, 523/523 transitions.
Applied a total of 0 rules in 18 ms. Remains 120 /120 variables (removed 0) and now considering 523/523 (removed 0) transitions.
[2024-06-01 06:27:52] [INFO ] Flow matrix only has 350 transitions (discarded 173 similar events)
[2024-06-01 06:27:52] [INFO ] Invariant cache hit.
[2024-06-01 06:27:52] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-06-01 06:27:52] [INFO ] Flow matrix only has 350 transitions (discarded 173 similar events)
[2024-06-01 06:27:52] [INFO ] Invariant cache hit.
[2024-06-01 06:27:52] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-01 06:27:52] [INFO ] Implicit Places using invariants and state equation in 403 ms returned []
Implicit Place search using SMT with State Equation took 523 ms to find 0 implicit places.
[2024-06-01 06:27:52] [INFO ] Redundant transitions in 4 ms returned []
Running 517 sub problems to find dead transitions.
[2024-06-01 06:27:52] [INFO ] Flow matrix only has 350 transitions (discarded 173 similar events)
[2024-06-01 06:27:52] [INFO ] Invariant cache hit.
[2024-06-01 06:27:52] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 12/23 constraints. Problems are: Problem set: 0 solved, 517 unsolved
[2024-06-01 06:27:55] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:27:55] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-06-01 06:27:55] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-06-01 06:27:55] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-06-01 06:27:55] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 0 ms to minimize.
[2024-06-01 06:27:56] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:27:56] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-06-01 06:27:56] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:27:56] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:27:56] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:27:56] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 1 ms to minimize.
[2024-06-01 06:27:56] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 0 ms to minimize.
[2024-06-01 06:27:56] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 1 ms to minimize.
[2024-06-01 06:27:56] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-06-01 06:27:56] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
[2024-06-01 06:27:56] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2024-06-01 06:27:56] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 0 ms to minimize.
[2024-06-01 06:27:56] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:27:57] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 1 ms to minimize.
[2024-06-01 06:27:57] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 517 unsolved
[2024-06-01 06:27:58] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 1 ms to minimize.
[2024-06-01 06:27:58] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 1 ms to minimize.
[2024-06-01 06:27:58] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 0 ms to minimize.
[2024-06-01 06:27:58] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 1 ms to minimize.
[2024-06-01 06:27:58] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 0 ms to minimize.
[2024-06-01 06:27:58] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 2 ms to minimize.
[2024-06-01 06:27:58] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 1 ms to minimize.
[2024-06-01 06:27:58] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 1 ms to minimize.
[2024-06-01 06:27:58] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 1 ms to minimize.
[2024-06-01 06:27:59] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
[2024-06-01 06:27:59] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-06-01 06:27:59] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 1 ms to minimize.
[2024-06-01 06:27:59] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 1 ms to minimize.
[2024-06-01 06:27:59] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 1 ms to minimize.
[2024-06-01 06:27:59] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 1 ms to minimize.
[2024-06-01 06:27:59] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 0 ms to minimize.
[2024-06-01 06:27:59] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 1 ms to minimize.
[2024-06-01 06:27:59] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 18/61 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 5 (OVERLAPS) 350/470 variables, 120/181 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 43/224 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/470 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 517 unsolved
[2024-06-01 06:28:11] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 1 ms to minimize.
[2024-06-01 06:28:11] [INFO ] Deduced a trap composed of 45 places in 74 ms of which 1 ms to minimize.
[2024-06-01 06:28:12] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 1 ms to minimize.
[2024-06-01 06:28:12] [INFO ] Deduced a trap composed of 54 places in 77 ms of which 1 ms to minimize.
[2024-06-01 06:28:12] [INFO ] Deduced a trap composed of 35 places in 81 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/470 variables, 5/229 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/470 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 517 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 470/470 variables, and 229 constraints, problems are : Problem set: 0 solved, 517 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 120/120 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 517/517 constraints, Known Traps: 43/43 constraints]
Escalating to Integer solving :Problem set: 0 solved, 517 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 12/23 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 43/66 constraints. Problems are: Problem set: 0 solved, 517 unsolved
[2024-06-01 06:28:26] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 2 ms to minimize.
[2024-06-01 06:28:26] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 5 (OVERLAPS) 350/470 variables, 120/188 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 43/231 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/470 variables, 517/748 constraints. Problems are: Problem set: 0 solved, 517 unsolved
[2024-06-01 06:28:48] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/470 variables, 1/749 constraints. Problems are: Problem set: 0 solved, 517 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 470/470 variables, and 749 constraints, problems are : Problem set: 0 solved, 517 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 120/120 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 517/517 constraints, Known Traps: 46/46 constraints]
After SMT, in 61291ms problems are : Problem set: 0 solved, 517 unsolved
Search for dead transitions found 0 dead transitions in 61297ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61848 ms. Remains : 120/120 places, 523/523 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) (NOT p1)))), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 115 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
RANDOM walk for 142 steps (0 resets) in 7 ms. (17 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F p1), (F (NOT (OR p0 p1))), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 13 factoid took 358 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 5599 reset in 355 ms.
Product exploration explored 100000 steps with 5589 reset in 365 ms.
Support contains 19 out of 120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 120/120 places, 523/523 transitions.
Applied a total of 0 rules in 14 ms. Remains 120 /120 variables (removed 0) and now considering 523/523 (removed 0) transitions.
[2024-06-01 06:28:56] [INFO ] Flow matrix only has 350 transitions (discarded 173 similar events)
[2024-06-01 06:28:56] [INFO ] Invariant cache hit.
[2024-06-01 06:28:56] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-06-01 06:28:56] [INFO ] Flow matrix only has 350 transitions (discarded 173 similar events)
[2024-06-01 06:28:56] [INFO ] Invariant cache hit.
[2024-06-01 06:28:56] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-01 06:28:56] [INFO ] Implicit Places using invariants and state equation in 426 ms returned []
Implicit Place search using SMT with State Equation took 544 ms to find 0 implicit places.
[2024-06-01 06:28:56] [INFO ] Redundant transitions in 6 ms returned []
Running 517 sub problems to find dead transitions.
[2024-06-01 06:28:56] [INFO ] Flow matrix only has 350 transitions (discarded 173 similar events)
[2024-06-01 06:28:56] [INFO ] Invariant cache hit.
[2024-06-01 06:28:56] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 12/23 constraints. Problems are: Problem set: 0 solved, 517 unsolved
[2024-06-01 06:28:59] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 0 ms to minimize.
[2024-06-01 06:28:59] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 0 ms to minimize.
[2024-06-01 06:28:59] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-06-01 06:28:59] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 0 ms to minimize.
[2024-06-01 06:28:59] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:28:59] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 0 ms to minimize.
[2024-06-01 06:28:59] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 0 ms to minimize.
[2024-06-01 06:28:59] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 0 ms to minimize.
[2024-06-01 06:29:00] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 0 ms to minimize.
[2024-06-01 06:29:00] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 0 ms to minimize.
[2024-06-01 06:29:00] [INFO ] Deduced a trap composed of 30 places in 83 ms of which 1 ms to minimize.
[2024-06-01 06:29:00] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 1 ms to minimize.
[2024-06-01 06:29:00] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 1 ms to minimize.
[2024-06-01 06:29:00] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 0 ms to minimize.
[2024-06-01 06:29:00] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-06-01 06:29:00] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 0 ms to minimize.
[2024-06-01 06:29:00] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-06-01 06:29:00] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-06-01 06:29:00] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 0 ms to minimize.
[2024-06-01 06:29:00] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 517 unsolved
[2024-06-01 06:29:01] [INFO ] Deduced a trap composed of 22 places in 94 ms of which 1 ms to minimize.
[2024-06-01 06:29:01] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 1 ms to minimize.
[2024-06-01 06:29:01] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 1 ms to minimize.
[2024-06-01 06:29:02] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 1 ms to minimize.
[2024-06-01 06:29:02] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-06-01 06:29:02] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 1 ms to minimize.
[2024-06-01 06:29:02] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 1 ms to minimize.
[2024-06-01 06:29:02] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 0 ms to minimize.
[2024-06-01 06:29:02] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 1 ms to minimize.
[2024-06-01 06:29:02] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 1 ms to minimize.
[2024-06-01 06:29:02] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 0 ms to minimize.
[2024-06-01 06:29:03] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 1 ms to minimize.
[2024-06-01 06:29:03] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 1 ms to minimize.
[2024-06-01 06:29:03] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 1 ms to minimize.
[2024-06-01 06:29:03] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 1 ms to minimize.
[2024-06-01 06:29:03] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 1 ms to minimize.
[2024-06-01 06:29:03] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 1 ms to minimize.
[2024-06-01 06:29:03] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 18/61 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 5 (OVERLAPS) 350/470 variables, 120/181 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 43/224 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/470 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 517 unsolved
[2024-06-01 06:29:16] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 0 ms to minimize.
[2024-06-01 06:29:16] [INFO ] Deduced a trap composed of 45 places in 73 ms of which 1 ms to minimize.
[2024-06-01 06:29:16] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 1 ms to minimize.
[2024-06-01 06:29:16] [INFO ] Deduced a trap composed of 54 places in 71 ms of which 0 ms to minimize.
[2024-06-01 06:29:16] [INFO ] Deduced a trap composed of 35 places in 78 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/470 variables, 5/229 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/470 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 517 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 470/470 variables, and 229 constraints, problems are : Problem set: 0 solved, 517 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 120/120 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 517/517 constraints, Known Traps: 43/43 constraints]
Escalating to Integer solving :Problem set: 0 solved, 517 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 12/23 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 43/66 constraints. Problems are: Problem set: 0 solved, 517 unsolved
[2024-06-01 06:29:30] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 1 ms to minimize.
[2024-06-01 06:29:30] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 5 (OVERLAPS) 350/470 variables, 120/188 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 43/231 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/470 variables, 517/748 constraints. Problems are: Problem set: 0 solved, 517 unsolved
[2024-06-01 06:29:51] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/470 variables, 1/749 constraints. Problems are: Problem set: 0 solved, 517 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 470/470 variables, and 749 constraints, problems are : Problem set: 0 solved, 517 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 120/120 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 517/517 constraints, Known Traps: 46/46 constraints]
After SMT, in 61245ms problems are : Problem set: 0 solved, 517 unsolved
Search for dead transitions found 0 dead transitions in 61252ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61829 ms. Remains : 120/120 places, 523/523 transitions.
Treatment of property SafeBus-COL-06-LTLFireability-14 finished in 128327 ms.
[2024-06-01 06:29:58] [INFO ] Flatten gal took : 45 ms
[2024-06-01 06:29:58] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 10 ms.
[2024-06-01 06:29:58] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 138 places, 415 transitions and 2620 arcs took 5 ms.
Total runtime 1091806 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : SafeBus-COL-06-LTLFireability-00
FORMULA SafeBus-COL-06-LTLFireability-04 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA SafeBus-COL-06-LTLFireability-05 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA SafeBus-COL-06-LTLFireability-14 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717223438291

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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 SafeBus-COL-06-LTLFireability-00
ltl formula formula --ltl=/tmp/4200/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 138 places, 415 transitions and 2620 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.020 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4200/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4200/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4200/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4200/ltl_0_
pnml2lts-mc( 3/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
double free or corruption (fasttop)
pnml2lts-mc( 1/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 2/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
double free or corruption (fasttop)
double free or corruption (fasttop)
pnml2lts-mc( 0/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
double free or corruption (fasttop)
ltl formula name SafeBus-COL-06-LTLFireability-04
ltl formula formula --ltl=/tmp/4200/ltl_1_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 138 places, 415 transitions and 2620 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.040 real 0.010 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4200/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4200/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4200/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4200/ltl_1_
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 140 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 139, there are 428 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): ~1947 levels ~10000 states ~28320 transitions
pnml2lts-mc( 2/ 4): ~3564 levels ~20000 states ~59540 transitions
pnml2lts-mc( 2/ 4): ~6978 levels ~40000 states ~126196 transitions
pnml2lts-mc( 2/ 4): ~13391 levels ~80000 states ~264580 transitions
pnml2lts-mc( 3/ 4): ~26066 levels ~160000 states ~539424 transitions
pnml2lts-mc( 3/ 4): ~49581 levels ~320000 states ~1115248 transitions
pnml2lts-mc( 3/ 4): ~92562 levels ~640000 states ~2296576 transitions
pnml2lts-mc( 3/ 4): ~169863 levels ~1280000 states ~4731360 transitions
pnml2lts-mc( 3/ 4): ~299731 levels ~2560000 states ~9762140 transitions
pnml2lts-mc( 3/ 4): ~462653 levels ~5120000 states ~20454364 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: 735841
pnml2lts-mc( 0/ 4): unique states count: 7552596
pnml2lts-mc( 0/ 4): unique transitions count: 32398992
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 1764290
pnml2lts-mc( 0/ 4): - claim found count: 23156106
pnml2lts-mc( 0/ 4): - claim success count: 7557176
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1943654
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 7588130 states 32582367 transitions, fanout: 4.294
pnml2lts-mc( 0/ 4): Total exploration time 38.420 sec (38.420 sec minimum, 38.420 sec on average)
pnml2lts-mc( 0/ 4): States per second: 197505, Transitions per second: 848058
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 79.8MB, 11.1 B/state, compr.: 2.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 22.0%/34.0%
pnml2lts-mc( 0/ 4): Stored 418 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 79.8MB (~256.0MB paged-in)
ltl formula name SafeBus-COL-06-LTLFireability-05
ltl formula formula --ltl=/tmp/4200/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 138 places, 415 transitions and 2620 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.020 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4200/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4200/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4200/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4200/ltl_2_
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 140 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 139, there are 418 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): ~18 levels ~10000 states ~13416 transitions
pnml2lts-mc( 2/ 4): ~19 levels ~20000 states ~26484 transitions
pnml2lts-mc( 2/ 4): ~19 levels ~40000 states ~52756 transitions
pnml2lts-mc( 1/ 4): ~19 levels ~80000 states ~105288 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: 81445
pnml2lts-mc( 0/ 4): unique states count: 81445
pnml2lts-mc( 0/ 4): unique transitions count: 105522
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 24608
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 81795
pnml2lts-mc( 0/ 4): - cum. max stack depth: 76
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 81795 states 107193 transitions, fanout: 1.311
pnml2lts-mc( 0/ 4): Total exploration time 0.510 sec (0.510 sec minimum, 0.510 sec on average)
pnml2lts-mc( 0/ 4): States per second: 160382, Transitions per second: 210182
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 1.7MB, 21.9 B/state, compr.: 3.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/1.0%
pnml2lts-mc( 0/ 4): Stored 418 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.7MB (~256.0MB paged-in)
ltl formula name SafeBus-COL-06-LTLFireability-14
ltl formula formula --ltl=/tmp/4200/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 138 places, 415 transitions and 2620 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.040 real 0.010 user 0.020 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4200/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4200/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4200/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4200/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 140 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 139, there are 495 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):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~43!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1510
pnml2lts-mc( 0/ 4): unique states count: 1632
pnml2lts-mc( 0/ 4): unique transitions count: 4895
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 1883
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 1636
pnml2lts-mc( 0/ 4): - cum. max stack depth: 143
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1636 states 4995 transitions, fanout: 3.053
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: 81800, Transitions per second: 249750
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 40.2 B/state, compr.: 7.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 418 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~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="SafeBus-COL-06"
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 SafeBus-COL-06, 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 r524-tall-171679080200364"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SafeBus-COL-06.tgz
mv SafeBus-COL-06 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 ;