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.r069-tall-171620504300348.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 greatspnxred
Input is CircularTrains-PT-096, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-tall-171620504300348
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 14:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Apr 12 14:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 12 14:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 103K Apr 12 14:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 73K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716430325099

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CircularTrains-PT-096
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 02:12:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-23 02:12:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 02:12:06] [INFO ] Load time of PNML (sax parser for PT used): 62 ms
[2024-05-23 02:12:06] [INFO ] Transformed 192 places.
[2024-05-23 02:12:06] [INFO ] Transformed 96 transitions.
[2024-05-23 02:12:06] [INFO ] Parsed PT model containing 192 places and 96 transitions and 384 arcs in 162 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CircularTrains-PT-096-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-096-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 50 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 96/96 transitions.
Applied a total of 0 rules in 20 ms. Remains 192 /192 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 192 cols
[2024-05-23 02:12:06] [INFO ] Computed 97 invariants in 31 ms
[2024-05-23 02:12:07] [INFO ] Implicit Places using invariants in 327 ms returned [1, 4, 8, 10, 14, 20, 27, 29, 39, 49, 109, 115, 116, 123, 125, 144, 155, 162, 174, 177, 182, 183, 186, 189]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 357 ms to find 24 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 168/192 places, 96/96 transitions.
Applied a total of 0 rules in 7 ms. Remains 168 /168 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 400 ms. Remains : 168/192 places, 96/96 transitions.
Support contains 50 out of 168 places after structural reductions.
[2024-05-23 02:12:07] [INFO ] Flatten gal took : 30 ms
[2024-05-23 02:12:07] [INFO ] Flatten gal took : 13 ms
[2024-05-23 02:12:07] [INFO ] Input system was already deterministic with 96 transitions.
Support contains 48 out of 168 places (down from 50) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 27 to 25
RANDOM walk for 559 steps (0 resets) in 72 ms. (7 steps per ms) remains 0/25 properties
FORMULA CircularTrains-PT-096-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||(F((G(p2)&&p1))&&F(p0))))'
Support contains 6 out of 168 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 168/168 places, 96/96 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 168 transition count 80
Reduce places removed 16 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 17 rules applied. Total rules applied 33 place count 152 transition count 79
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 34 place count 151 transition count 79
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 34 place count 151 transition count 73
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 46 place count 145 transition count 73
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 58 place count 139 transition count 67
Applied a total of 58 rules in 37 ms. Remains 139 /168 variables (removed 29) and now considering 67/96 (removed 29) transitions.
// Phase 1: matrix 67 rows 139 cols
[2024-05-23 02:12:08] [INFO ] Computed 73 invariants in 3 ms
[2024-05-23 02:12:08] [INFO ] Implicit Places using invariants in 121 ms returned [2, 23, 120, 122, 124, 130, 135, 136]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 122 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 131/168 places, 67/96 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 131 transition count 65
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 129 transition count 64
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 128 transition count 64
Applied a total of 6 rules in 8 ms. Remains 128 /131 variables (removed 3) and now considering 64/67 (removed 3) transitions.
// Phase 1: matrix 64 rows 128 cols
[2024-05-23 02:12:08] [INFO ] Computed 65 invariants in 4 ms
[2024-05-23 02:12:08] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-05-23 02:12:08] [INFO ] Invariant cache hit.
[2024-05-23 02:12:08] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 128/168 places, 64/96 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 388 ms. Remains : 128/168 places, 64/96 transitions.
Stuttering acceptance computed with spot in 432 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CircularTrains-PT-096-LTLFireability-00
Product exploration explored 100000 steps with 0 reset in 658 ms.
Product exploration explored 100000 steps with 0 reset in 522 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) p2 p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND p1 p2 p0))), (X (NOT p1)), (X (X (NOT (AND p1 p2 (NOT p0)))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) p0))), (X (AND p2 (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (OR (AND (NOT p1) p0) (AND (NOT p2) p0))), (X (NOT (OR (AND (NOT p1) p0) (AND (NOT p2) p0)))), (X (AND p2 p0)), (X (NOT (AND p2 p0))), (X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0)))), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))))), (X p0), (X (NOT p0)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (OR (AND (NOT p1) p0) (AND (NOT p2) p0)))), (X (X (NOT (OR (AND (NOT p1) p0) (AND (NOT p2) p0))))), (X (X (AND p1 p2 p0))), (X (X (NOT (AND p1 p2 p0)))), (X (X (AND p2 p0))), (X (X (NOT (AND p2 p0)))), (X (X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0)))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 6 factoid took 981 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter insensitive) to 5 states, 16 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 213 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), false, false]
RANDOM walk for 1697 steps (0 resets) in 72 ms. (23 steps per ms) remains 0/11 properties
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND p1 p2 p0))), (X (NOT p1)), (X (X (NOT (AND p1 p2 (NOT p0)))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) p0))), (X (AND p2 (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (OR (AND (NOT p1) p0) (AND (NOT p2) p0))), (X (NOT (OR (AND (NOT p1) p0) (AND (NOT p2) p0)))), (X (AND p2 p0)), (X (NOT (AND p2 p0))), (X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0)))), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))))), (X p0), (X (NOT p0)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (OR (AND (NOT p1) p0) (AND (NOT p2) p0)))), (X (X (NOT (OR (AND (NOT p1) p0) (AND (NOT p2) p0))))), (X (X (AND p1 p2 p0))), (X (X (NOT (AND p1 p2 p0)))), (X (X (AND p2 p0))), (X (X (NOT (AND p2 p0)))), (X (X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0)))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p0 p2))), (F (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (F (NOT (AND p0 p2))), (F (NOT (OR p0 (NOT p2)))), (F (NOT p2)), (F (NOT (OR p0 (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2)))), (F (NOT (AND (OR p0 p1) (OR p0 p2)))), (F p1), (F (NOT p0)), (F (NOT (OR (NOT p0) p2)))]
Knowledge based reduction with 6 factoid took 1395 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter insensitive) to 5 states, 16 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 192 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), false, false]
Stuttering acceptance computed with spot in 174 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), false, false]
Support contains 6 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Applied a total of 0 rules in 9 ms. Remains 128 /128 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-05-23 02:12:13] [INFO ] Invariant cache hit.
[2024-05-23 02:12:13] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-23 02:12:13] [INFO ] Invariant cache hit.
[2024-05-23 02:12:13] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
[2024-05-23 02:12:13] [INFO ] Redundant transitions in 1 ms returned []
Running 32 sub problems to find dead transitions.
[2024-05-23 02:12:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 63/127 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/128 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 64/192 variables, 128/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (OVERLAPS) 0/192 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 193 constraints, problems are : Problem set: 0 solved, 32 unsolved in 830 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 63/127 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/128 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 64/192 variables, 128/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 32/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 225 constraints, problems are : Problem set: 0 solved, 32 unsolved in 1641 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
After SMT, in 2494ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 2503ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2703 ms. Remains : 128/128 places, 64/64 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) p2), (X (NOT (AND p0 p1 p2))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1 p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X (AND p0 p2)), (X (NOT (AND p0 p2))), (X p0), (X (NOT p0)), (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (X p2)), (X (X (NOT p2))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X p0)), (X (X (NOT p0))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 6 factoid took 1147 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter insensitive) to 5 states, 16 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 215 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), false, false]
RANDOM walk for 1232 steps (0 resets) in 27 ms. (44 steps per ms) remains 0/11 properties
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND p0 p1 p2))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1 p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X (AND p0 p2)), (X (NOT (AND p0 p2))), (X p0), (X (NOT p0)), (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (X p2)), (X (X (NOT p2))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X p0)), (X (X (NOT p0))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p0 p2))), (F (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (F (NOT (AND p0 p2))), (F (NOT (OR p0 (NOT p2)))), (F (NOT p2)), (F (NOT (OR p0 (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2)))), (F (NOT (AND (OR p0 p1) (OR p0 p2)))), (F p1), (F (NOT p0)), (F (NOT (OR (NOT p0) p2)))]
Knowledge based reduction with 6 factoid took 1657 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter insensitive) to 5 states, 16 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 231 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), false, false]
Stuttering acceptance computed with spot in 192 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), false, false]
Stuttering acceptance computed with spot in 237 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), false, false]
Product exploration explored 100000 steps with 0 reset in 377 ms.
Product exploration explored 100000 steps with 0 reset in 456 ms.
Support contains 6 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Applied a total of 0 rules in 3 ms. Remains 128 /128 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-05-23 02:12:20] [INFO ] Invariant cache hit.
[2024-05-23 02:12:20] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-23 02:12:20] [INFO ] Invariant cache hit.
[2024-05-23 02:12:20] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
[2024-05-23 02:12:20] [INFO ] Redundant transitions in 1 ms returned []
Running 32 sub problems to find dead transitions.
[2024-05-23 02:12:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 63/127 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/128 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 64/192 variables, 128/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (OVERLAPS) 0/192 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 193 constraints, problems are : Problem set: 0 solved, 32 unsolved in 655 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 63/127 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/128 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 64/192 variables, 128/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 32/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 225 constraints, problems are : Problem set: 0 solved, 32 unsolved in 1660 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
After SMT, in 2327ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 2328ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2548 ms. Remains : 128/128 places, 64/64 transitions.
Treatment of property CircularTrains-PT-096-LTLFireability-00 finished in 15160 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((X(p1)&&p0))))'
Support contains 4 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 96/96 transitions.
Applied a total of 0 rules in 5 ms. Remains 168 /168 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 168 cols
[2024-05-23 02:12:23] [INFO ] Computed 73 invariants in 6 ms
[2024-05-23 02:12:23] [INFO ] Implicit Places using invariants in 92 ms returned [3, 29, 146, 148, 150, 163, 164]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 93 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 161/168 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 161 /161 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 99 ms. Remains : 161/168 places, 96/96 transitions.
Stuttering acceptance computed with spot in 134 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : CircularTrains-PT-096-LTLFireability-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CircularTrains-PT-096-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-096-LTLFireability-01 finished in 364 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&F(G(p0))))))'
Support contains 2 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 96/96 transitions.
Applied a total of 0 rules in 2 ms. Remains 168 /168 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2024-05-23 02:12:23] [INFO ] Invariant cache hit.
[2024-05-23 02:12:23] [INFO ] Implicit Places using invariants in 106 ms returned [3, 29, 146, 148, 150, 158, 163, 164]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 107 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 160/168 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 160 /160 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 110 ms. Remains : 160/168 places, 96/96 transitions.
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-096-LTLFireability-02
Entered a terminal (fully accepting) state of product in 39 steps with 0 reset in 1 ms.
FORMULA CircularTrains-PT-096-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-096-LTLFireability-02 finished in 225 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)||(F(p2)&&p1))))'
Support contains 6 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 96/96 transitions.
Applied a total of 0 rules in 2 ms. Remains 168 /168 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2024-05-23 02:12:23] [INFO ] Invariant cache hit.
[2024-05-23 02:12:23] [INFO ] Implicit Places using invariants in 95 ms returned [3, 29, 146, 158, 163, 164]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 96 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 162/168 places, 96/96 transitions.
Applied a total of 0 rules in 2 ms. Remains 162 /162 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 100 ms. Remains : 162/168 places, 96/96 transitions.
Stuttering acceptance computed with spot in 137 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CircularTrains-PT-096-LTLFireability-04
Product exploration explored 100000 steps with 1491 reset in 420 ms.
Product exploration explored 100000 steps with 1548 reset in 441 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1 (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Knowledge based reduction with 3 factoid took 369 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
RANDOM walk for 326 steps (0 resets) in 12 ms. (25 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1 (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F p1), (F p0), (F p2), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p1) p2)))]
Knowledge based reduction with 3 factoid took 515 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 161 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
// Phase 1: matrix 96 rows 162 cols
[2024-05-23 02:12:26] [INFO ] Computed 67 invariants in 2 ms
[2024-05-23 02:12:26] [INFO ] [Real]Absence check using 61 positive place invariants in 10 ms returned sat
[2024-05-23 02:12:26] [INFO ] [Real]Absence check using 61 positive and 6 generalized place invariants in 5 ms returned sat
[2024-05-23 02:12:26] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2024-05-23 02:12:26] [INFO ] Computed and/alt/rep : 64/96/64 causal constraints (skipped 0 transitions) in 16 ms.
[2024-05-23 02:12:26] [INFO ] Added : 61 causal constraints over 13 iterations in 293 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
[2024-05-23 02:12:26] [INFO ] Invariant cache hit.
[2024-05-23 02:12:26] [INFO ] [Real]Absence check using 61 positive place invariants in 11 ms returned sat
[2024-05-23 02:12:26] [INFO ] [Real]Absence check using 61 positive and 6 generalized place invariants in 6 ms returned sat
[2024-05-23 02:12:26] [INFO ] [Real]Absence check using state equation in 166 ms returned sat
[2024-05-23 02:12:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:12:27] [INFO ] [Nat]Absence check using 61 positive place invariants in 12 ms returned sat
[2024-05-23 02:12:27] [INFO ] [Nat]Absence check using 61 positive and 6 generalized place invariants in 5 ms returned sat
[2024-05-23 02:12:27] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2024-05-23 02:12:27] [INFO ] Computed and/alt/rep : 64/96/64 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-23 02:12:27] [INFO ] Added : 61 causal constraints over 13 iterations in 329 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 6 out of 162 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 162 /162 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2024-05-23 02:12:27] [INFO ] Invariant cache hit.
[2024-05-23 02:12:27] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-23 02:12:27] [INFO ] Invariant cache hit.
[2024-05-23 02:12:27] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
Running 64 sub problems to find dead transitions.
[2024-05-23 02:12:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 61/159 variables, 61/62 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (OVERLAPS) 3/162 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (OVERLAPS) 96/258 variables, 162/229 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (OVERLAPS) 0/258 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 229 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1830 ms.
Refiners :[Positive P Invariants (semi-flows): 61/61 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 61/159 variables, 61/62 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (OVERLAPS) 3/162 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (OVERLAPS) 96/258 variables, 162/229 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 64/293 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 10 (OVERLAPS) 0/258 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 293 constraints, problems are : Problem set: 0 solved, 64 unsolved in 6607 ms.
Refiners :[Positive P Invariants (semi-flows): 61/61 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
After SMT, in 8448ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 8450ms
Finished structural reductions in LTL mode , in 1 iterations and 8662 ms. Remains : 162/162 places, 96/96 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X p2), (X (NOT p2)), (X (NOT p1)), (X p1), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Knowledge based reduction with 2 factoid took 304 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
RANDOM walk for 227 steps (0 resets) in 6 ms. (32 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X p2), (X (NOT p2)), (X (NOT p1)), (X p1), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F p1), (F p0), (F p2), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p1) p2)))]
Knowledge based reduction with 2 factoid took 445 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 151 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
[2024-05-23 02:12:37] [INFO ] Invariant cache hit.
[2024-05-23 02:12:37] [INFO ] [Real]Absence check using 61 positive place invariants in 10 ms returned sat
[2024-05-23 02:12:37] [INFO ] [Real]Absence check using 61 positive and 6 generalized place invariants in 4 ms returned sat
[2024-05-23 02:12:37] [INFO ] [Real]Absence check using state equation in 176 ms returned sat
[2024-05-23 02:12:37] [INFO ] Computed and/alt/rep : 64/96/64 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-23 02:12:37] [INFO ] Added : 61 causal constraints over 13 iterations in 271 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
[2024-05-23 02:12:37] [INFO ] Invariant cache hit.
[2024-05-23 02:12:38] [INFO ] [Real]Absence check using 61 positive place invariants in 10 ms returned sat
[2024-05-23 02:12:38] [INFO ] [Real]Absence check using 61 positive and 6 generalized place invariants in 6 ms returned sat
[2024-05-23 02:12:38] [INFO ] [Real]Absence check using state equation in 176 ms returned sat
[2024-05-23 02:12:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:12:38] [INFO ] [Nat]Absence check using 61 positive place invariants in 9 ms returned sat
[2024-05-23 02:12:38] [INFO ] [Nat]Absence check using 61 positive and 6 generalized place invariants in 5 ms returned sat
[2024-05-23 02:12:38] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2024-05-23 02:12:38] [INFO ] Computed and/alt/rep : 64/96/64 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-23 02:12:38] [INFO ] Added : 61 causal constraints over 13 iterations in 319 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 143 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Product exploration explored 100000 steps with 1488 reset in 378 ms.
Product exploration explored 100000 steps with 1497 reset in 404 ms.
Applying partial POR strategy [false, true, true, false]
Stuttering acceptance computed with spot in 169 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Support contains 6 out of 162 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 162/162 places, 96/96 transitions.
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 162 transition count 96
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 29 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 162 transition count 96
Deduced a syphon composed of 29 places in 0 ms
Applied a total of 29 rules in 22 ms. Remains 162 /162 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2024-05-23 02:12:40] [INFO ] Redundant transitions in 2 ms returned []
Running 64 sub problems to find dead transitions.
// Phase 1: matrix 96 rows 162 cols
[2024-05-23 02:12:40] [INFO ] Computed 67 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 61/159 variables, 61/62 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2024-05-23 02:12:40] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 7 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-05-23 02:12:40] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-05-23 02:12:40] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
[2024-05-23 02:12:40] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
[2024-05-23 02:12:40] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2024-05-23 02:12:40] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
[2024-05-23 02:12:40] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
[2024-05-23 02:12:40] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 1 ms to minimize.
[2024-05-23 02:12:40] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-05-23 02:12:40] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
[2024-05-23 02:12:40] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
[2024-05-23 02:12:40] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
[2024-05-23 02:12:40] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-23 02:12:40] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
[2024-05-23 02:12:40] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
Problem TDEAD32 is UNSAT
[2024-05-23 02:12:41] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 1 ms to minimize.
[2024-05-23 02:12:41] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
Problem TDEAD39 is UNSAT
[2024-05-23 02:12:41] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
Problem TDEAD40 is UNSAT
[2024-05-23 02:12:41] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
Problem TDEAD43 is UNSAT
[2024-05-23 02:12:41] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD64 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 20/84 constraints. Problems are: Problem set: 20 solved, 44 unsolved
[2024-05-23 02:12:41] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-05-23 02:12:41] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
[2024-05-23 02:12:41] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
Problem TDEAD7 is UNSAT
[2024-05-23 02:12:41] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
[2024-05-23 02:12:41] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
Problem TDEAD12 is UNSAT
[2024-05-23 02:12:41] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 1 ms to minimize.
Problem TDEAD13 is UNSAT
[2024-05-23 02:12:41] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD45 is UNSAT
[2024-05-23 02:12:41] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
Problem TDEAD46 is UNSAT
[2024-05-23 02:12:41] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
Problem TDEAD6 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD53 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 9/93 constraints. Problems are: Problem set: 29 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 0/93 constraints. Problems are: Problem set: 29 solved, 35 unsolved
At refinement iteration 7 (OVERLAPS) 3/162 variables, 3/96 constraints. Problems are: Problem set: 29 solved, 35 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 0/96 constraints. Problems are: Problem set: 29 solved, 35 unsolved
At refinement iteration 9 (OVERLAPS) 96/258 variables, 162/258 constraints. Problems are: Problem set: 29 solved, 35 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 0/258 constraints. Problems are: Problem set: 29 solved, 35 unsolved
At refinement iteration 11 (OVERLAPS) 0/258 variables, 0/258 constraints. Problems are: Problem set: 29 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 258 constraints, problems are : Problem set: 29 solved, 35 unsolved in 2206 ms.
Refiners :[Positive P Invariants (semi-flows): 61/61 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 29 solved, 35 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 29 solved, 35 unsolved
At refinement iteration 1 (OVERLAPS) 90/159 variables, 61/61 constraints. Problems are: Problem set: 29 solved, 35 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 3/64 constraints. Problems are: Problem set: 29 solved, 35 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 29/93 constraints. Problems are: Problem set: 29 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/93 constraints. Problems are: Problem set: 29 solved, 35 unsolved
At refinement iteration 5 (OVERLAPS) 3/162 variables, 3/96 constraints. Problems are: Problem set: 29 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/96 constraints. Problems are: Problem set: 29 solved, 35 unsolved
At refinement iteration 7 (OVERLAPS) 96/258 variables, 162/258 constraints. Problems are: Problem set: 29 solved, 35 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 35/293 constraints. Problems are: Problem set: 29 solved, 35 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 0/293 constraints. Problems are: Problem set: 29 solved, 35 unsolved
At refinement iteration 10 (OVERLAPS) 0/258 variables, 0/293 constraints. Problems are: Problem set: 29 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 293 constraints, problems are : Problem set: 29 solved, 35 unsolved in 1717 ms.
Refiners :[Positive P Invariants (semi-flows): 61/61 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 35/64 constraints, Known Traps: 29/29 constraints]
After SMT, in 3950ms problems are : Problem set: 29 solved, 35 unsolved
Search for dead transitions found 29 dead transitions in 3951ms
Found 29 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 29 transitions
Dead transitions reduction (with SMT) removed 29 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 162/162 places, 67/96 transitions.
Graph (complete) has 264 edges and 162 vertex of which 133 are kept as prefixes of interest. Removing 29 places using SCC suffix rule.3 ms
Discarding 29 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 13 ms. Remains 133 /162 variables (removed 29) and now considering 67/67 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 133/162 places, 67/96 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3993 ms. Remains : 133/162 places, 67/96 transitions.
Support contains 6 out of 162 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 96/96 transitions.
Applied a total of 0 rules in 3 ms. Remains 162 /162 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 162 cols
[2024-05-23 02:12:44] [INFO ] Computed 67 invariants in 2 ms
[2024-05-23 02:12:44] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-23 02:12:44] [INFO ] Invariant cache hit.
[2024-05-23 02:12:44] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
Running 64 sub problems to find dead transitions.
[2024-05-23 02:12:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 61/159 variables, 61/62 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (OVERLAPS) 3/162 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (OVERLAPS) 96/258 variables, 162/229 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (OVERLAPS) 0/258 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 229 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1705 ms.
Refiners :[Positive P Invariants (semi-flows): 61/61 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 61/159 variables, 61/62 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (OVERLAPS) 3/162 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (OVERLAPS) 96/258 variables, 162/229 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 64/293 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 10 (OVERLAPS) 0/258 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 293 constraints, problems are : Problem set: 0 solved, 64 unsolved in 6603 ms.
Refiners :[Positive P Invariants (semi-flows): 61/61 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
After SMT, in 8319ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 8321ms
Finished structural reductions in LTL mode , in 1 iterations and 8539 ms. Remains : 162/162 places, 96/96 transitions.
Treatment of property CircularTrains-PT-096-LTLFireability-04 finished in 28942 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((G((X(p1)||p0))||(X(F(p3))&&p2))))'
Support contains 6 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 168 /168 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 168 cols
[2024-05-23 02:12:52] [INFO ] Computed 73 invariants in 1 ms
[2024-05-23 02:12:52] [INFO ] Implicit Places using invariants in 131 ms returned [29, 146, 148, 158, 163, 164]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 132 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 162/168 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 162 /162 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 135 ms. Remains : 162/168 places, 96/96 transitions.
Stuttering acceptance computed with spot in 261 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p3) (NOT p1)), true, (NOT p3)]
Running random walk in product with property : CircularTrains-PT-096-LTLFireability-05
Entered a terminal (fully accepting) state of product in 304 steps with 72 reset in 2 ms.
FORMULA CircularTrains-PT-096-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-096-LTLFireability-05 finished in 415 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 168 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 168/168 places, 96/96 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 168 transition count 78
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 36 place count 150 transition count 78
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 36 place count 150 transition count 73
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 46 place count 145 transition count 73
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 58 place count 139 transition count 67
Applied a total of 58 rules in 21 ms. Remains 139 /168 variables (removed 29) and now considering 67/96 (removed 29) transitions.
// Phase 1: matrix 67 rows 139 cols
[2024-05-23 02:12:53] [INFO ] Computed 73 invariants in 2 ms
[2024-05-23 02:12:53] [INFO ] Implicit Places using invariants in 93 ms returned [2, 23, 120, 122, 124, 130, 135, 136]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 105 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 131/168 places, 67/96 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 131 transition count 65
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 129 transition count 64
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 128 transition count 64
Applied a total of 6 rules in 6 ms. Remains 128 /131 variables (removed 3) and now considering 64/67 (removed 3) transitions.
// Phase 1: matrix 64 rows 128 cols
[2024-05-23 02:12:53] [INFO ] Computed 65 invariants in 2 ms
[2024-05-23 02:12:53] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-23 02:12:53] [INFO ] Invariant cache hit.
[2024-05-23 02:12:53] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 128/168 places, 64/96 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 352 ms. Remains : 128/168 places, 64/96 transitions.
Stuttering acceptance computed with spot in 162 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-096-LTLFireability-07
Product exploration explored 100000 steps with 1460 reset in 368 ms.
Product exploration explored 100000 steps with 1487 reset in 404 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 139 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 73 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 91 steps (0 resets) in 6 ms. (13 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 206 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Applied a total of 0 rules in 9 ms. Remains 128 /128 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-05-23 02:12:54] [INFO ] Invariant cache hit.
[2024-05-23 02:12:54] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-23 02:12:54] [INFO ] Invariant cache hit.
[2024-05-23 02:12:55] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
[2024-05-23 02:12:55] [INFO ] Redundant transitions in 1 ms returned []
Running 32 sub problems to find dead transitions.
[2024-05-23 02:12:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 63/127 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/128 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 64/192 variables, 128/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (OVERLAPS) 0/192 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 193 constraints, problems are : Problem set: 0 solved, 32 unsolved in 608 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 63/127 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/128 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 64/192 variables, 128/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 32/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 225 constraints, problems are : Problem set: 0 solved, 32 unsolved in 1548 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
After SMT, in 2162ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 2163ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2344 ms. Remains : 128/128 places, 64/64 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]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 148 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 100 steps (0 resets) in 4 ms. (20 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 194 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 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1496 reset in 381 ms.
Product exploration explored 100000 steps with 1504 reset in 411 ms.
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Applied a total of 0 rules in 3 ms. Remains 128 /128 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-05-23 02:12:58] [INFO ] Invariant cache hit.
[2024-05-23 02:12:58] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-23 02:12:58] [INFO ] Invariant cache hit.
[2024-05-23 02:12:58] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
[2024-05-23 02:12:58] [INFO ] Redundant transitions in 0 ms returned []
Running 32 sub problems to find dead transitions.
[2024-05-23 02:12:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 63/127 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/128 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 64/192 variables, 128/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (OVERLAPS) 0/192 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 193 constraints, problems are : Problem set: 0 solved, 32 unsolved in 657 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 63/127 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/128 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 64/192 variables, 128/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 32/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 225 constraints, problems are : Problem set: 0 solved, 32 unsolved in 1707 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
After SMT, in 2374ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 2374ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2560 ms. Remains : 128/128 places, 64/64 transitions.
Treatment of property CircularTrains-PT-096-LTLFireability-07 finished in 8251 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 168 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 168/168 places, 96/96 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 168 transition count 78
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 36 place count 150 transition count 78
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 36 place count 150 transition count 72
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 48 place count 144 transition count 72
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 60 place count 138 transition count 66
Applied a total of 60 rules in 8 ms. Remains 138 /168 variables (removed 30) and now considering 66/96 (removed 30) transitions.
// Phase 1: matrix 66 rows 138 cols
[2024-05-23 02:13:01] [INFO ] Computed 73 invariants in 1 ms
[2024-05-23 02:13:01] [INFO ] Implicit Places using invariants in 84 ms returned [2, 23, 119, 121, 123, 129, 134, 135]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 84 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 130/168 places, 66/96 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 130 transition count 64
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 128 transition count 64
Applied a total of 4 rules in 4 ms. Remains 128 /130 variables (removed 2) and now considering 64/66 (removed 2) transitions.
// Phase 1: matrix 64 rows 128 cols
[2024-05-23 02:13:01] [INFO ] Computed 65 invariants in 1 ms
[2024-05-23 02:13:01] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-23 02:13:01] [INFO ] Invariant cache hit.
[2024-05-23 02:13:01] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 128/168 places, 64/96 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 263 ms. Remains : 128/168 places, 64/96 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : CircularTrains-PT-096-LTLFireability-08
Product exploration explored 100000 steps with 0 reset in 340 ms.
Product exploration explored 100000 steps with 0 reset in 411 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)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 160 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
RANDOM walk for 65 steps (0 resets) in 4 ms. (13 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 1 factoid took 171 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2024-05-23 02:13:02] [INFO ] Invariant cache hit.
[2024-05-23 02:13:02] [INFO ] [Real]Absence check using 63 positive place invariants in 9 ms returned sat
[2024-05-23 02:13:02] [INFO ] [Real]Absence check using 63 positive and 2 generalized place invariants in 4 ms returned sat
[2024-05-23 02:13:02] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2024-05-23 02:13:02] [INFO ] Computed and/alt/rep : 32/64/32 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-23 02:13:02] [INFO ] Added : 30 causal constraints over 6 iterations in 75 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Applied a total of 0 rules in 3 ms. Remains 128 /128 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-05-23 02:13:02] [INFO ] Invariant cache hit.
[2024-05-23 02:13:03] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-23 02:13:03] [INFO ] Invariant cache hit.
[2024-05-23 02:13:03] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
[2024-05-23 02:13:03] [INFO ] Redundant transitions in 0 ms returned []
Running 32 sub problems to find dead transitions.
[2024-05-23 02:13:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 63/127 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/128 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 64/192 variables, 128/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (OVERLAPS) 0/192 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 193 constraints, problems are : Problem set: 0 solved, 32 unsolved in 653 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 63/127 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/128 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 64/192 variables, 128/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 32/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 225 constraints, problems are : Problem set: 0 solved, 32 unsolved in 1589 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
After SMT, in 2263ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 2263ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2458 ms. Remains : 128/128 places, 64/64 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)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 186 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
RANDOM walk for 71 steps (0 resets) in 4 ms. (14 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 1 factoid took 197 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
[2024-05-23 02:13:05] [INFO ] Invariant cache hit.
[2024-05-23 02:13:05] [INFO ] [Real]Absence check using 63 positive place invariants in 9 ms returned sat
[2024-05-23 02:13:05] [INFO ] [Real]Absence check using 63 positive and 2 generalized place invariants in 4 ms returned sat
[2024-05-23 02:13:06] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2024-05-23 02:13:06] [INFO ] Computed and/alt/rep : 32/64/32 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-23 02:13:06] [INFO ] Added : 30 causal constraints over 6 iterations in 68 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 317 ms.
Product exploration explored 100000 steps with 0 reset in 383 ms.
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 128 /128 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-05-23 02:13:06] [INFO ] Invariant cache hit.
[2024-05-23 02:13:06] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-23 02:13:06] [INFO ] Invariant cache hit.
[2024-05-23 02:13:07] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
[2024-05-23 02:13:07] [INFO ] Redundant transitions in 1 ms returned []
Running 32 sub problems to find dead transitions.
[2024-05-23 02:13:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 63/127 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/128 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 64/192 variables, 128/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (OVERLAPS) 0/192 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 193 constraints, problems are : Problem set: 0 solved, 32 unsolved in 655 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 63/127 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/128 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 64/192 variables, 128/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 32/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 225 constraints, problems are : Problem set: 0 solved, 32 unsolved in 1575 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
After SMT, in 2235ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 2235ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2406 ms. Remains : 128/128 places, 64/64 transitions.
Treatment of property CircularTrains-PT-096-LTLFireability-08 finished in 8067 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(F(((X(p0)||F(!p1)) U (G((X(p0)||F(!p1)))||(!p2&&(X(p0)||F(!p1)))))))||(!p2&&F(((X(p0)||F(!p1)) U (G((X(p0)||F(!p1)))||(!p2&&(X(p0)||F(!p1))))))))))'
Support contains 4 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 96/96 transitions.
Applied a total of 0 rules in 3 ms. Remains 168 /168 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 168 cols
[2024-05-23 02:13:09] [INFO ] Computed 73 invariants in 1 ms
[2024-05-23 02:13:09] [INFO ] Implicit Places using invariants in 86 ms returned [3, 146, 148, 150, 158, 163, 164]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 87 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 161/168 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 161 /161 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 92 ms. Remains : 161/168 places, 96/96 transitions.
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), false]
Running random walk in product with property : CircularTrains-PT-096-LTLFireability-09
Product exploration explored 100000 steps with 5629 reset in 398 ms.
Product exploration explored 100000 steps with 5716 reset in 430 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 p2 (NOT p1) p0), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (X (NOT (AND p2 p1 (NOT p0)))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p2 p1 p0))), (X (X (NOT (AND p2 p1 p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 552 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), false]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 40000 steps (8 resets) in 238 ms. (167 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 1/1 properties
// Phase 1: matrix 96 rows 161 cols
[2024-05-23 02:13:11] [INFO ] Computed 66 invariants in 0 ms
Problem apf2 is UNSAT
After SMT solving in domain Real declared 4/257 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 10 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, Generalized P Invariants (flows): 0/3 constraints, State Equation: 0/161 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 14ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (X (NOT (AND p2 p1 (NOT p0))))), (G (OR (NOT p1) p0 (NOT p2)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p2 p1 p0))), (X (X (NOT (AND p2 p1 p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p1) (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p1) p0))), (F p1), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR (NOT p1) (NOT p0))))]
Knowledge based reduction with 6 factoid took 705 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) p1), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) p1), (AND p1 (NOT p0))]
Support contains 4 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 96/96 transitions.
Applied a total of 0 rules in 2 ms. Remains 161 /161 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2024-05-23 02:13:12] [INFO ] Invariant cache hit.
[2024-05-23 02:13:12] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-23 02:13:12] [INFO ] Invariant cache hit.
[2024-05-23 02:13:12] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
Running 64 sub problems to find dead transitions.
[2024-05-23 02:13:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 63/160 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 1/161 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 96/257 variables, 161/227 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/257 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 0/257 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 257/257 variables, and 227 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1520 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 63/160 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 1/161 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 96/257 variables, 161/227 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/257 variables, 64/291 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (OVERLAPS) 0/257 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 257/257 variables, and 291 constraints, problems are : Problem set: 0 solved, 64 unsolved in 4041 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
After SMT, in 5575ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 5576ms
Finished structural reductions in LTL mode , in 1 iterations and 5770 ms. Remains : 161/161 places, 96/96 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 p2 (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X p0)]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 309 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) p1), (AND p1 (NOT p0))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 501 steps (0 resets) in 11 ms. (41 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X p0)]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT p2)), (F (NOT p0)), (F (NOT (OR (NOT p1) p0)))]
Knowledge based reduction with 3 factoid took 496 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) p1), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) p1), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) p1), (AND p1 (NOT p0))]
Product exploration explored 100000 steps with 5745 reset in 407 ms.
Product exploration explored 100000 steps with 5543 reset in 441 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) p1), (AND p1 (NOT p0))]
Support contains 4 out of 161 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 161/161 places, 96/96 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 161 transition count 96
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 31 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 161 transition count 96
Deduced a syphon composed of 31 places in 0 ms
Applied a total of 31 rules in 9 ms. Remains 161 /161 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2024-05-23 02:13:20] [INFO ] Redundant transitions in 2 ms returned []
Running 64 sub problems to find dead transitions.
// Phase 1: matrix 96 rows 161 cols
[2024-05-23 02:13:20] [INFO ] Computed 66 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 63/160 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2024-05-23 02:13:20] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-05-23 02:13:20] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
[2024-05-23 02:13:20] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2024-05-23 02:13:20] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
[2024-05-23 02:13:20] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 4 ms to minimize.
[2024-05-23 02:13:20] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 4 ms to minimize.
[2024-05-23 02:13:20] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
[2024-05-23 02:13:20] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
[2024-05-23 02:13:20] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
[2024-05-23 02:13:20] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-05-23 02:13:20] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2024-05-23 02:13:20] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
[2024-05-23 02:13:20] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 1 ms to minimize.
[2024-05-23 02:13:20] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-23 02:13:20] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
[2024-05-23 02:13:20] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
Problem TDEAD30 is UNSAT
[2024-05-23 02:13:20] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
[2024-05-23 02:13:20] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
Problem TDEAD37 is UNSAT
[2024-05-23 02:13:20] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
Problem TDEAD38 is UNSAT
[2024-05-23 02:13:20] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD62 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 20/85 constraints. Problems are: Problem set: 20 solved, 44 unsolved
[2024-05-23 02:13:21] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
[2024-05-23 02:13:21] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 1 ms to minimize.
Problem TDEAD48 is UNSAT
Problem TDEAD51 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 2/87 constraints. Problems are: Problem set: 22 solved, 42 unsolved
[2024-05-23 02:13:21] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-05-23 02:13:21] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-05-23 02:13:21] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
[2024-05-23 02:13:21] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
[2024-05-23 02:13:21] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
[2024-05-23 02:13:21] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 2 ms to minimize.
[2024-05-23 02:13:21] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 2 ms to minimize.
Problem TDEAD42 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 7/94 constraints. Problems are: Problem set: 29 solved, 35 unsolved
[2024-05-23 02:13:21] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
Problem TDEAD7 is UNSAT
[2024-05-23 02:13:21] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD43 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/96 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/96 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 8 (OVERLAPS) 1/161 variables, 1/97 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 0/97 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 10 (OVERLAPS) 96/257 variables, 161/258 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/257 variables, 0/258 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 12 (OVERLAPS) 0/257 variables, 0/258 constraints. Problems are: Problem set: 31 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 257/257 variables, and 258 constraints, problems are : Problem set: 31 solved, 33 unsolved in 2233 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 31 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 94/160 variables, 63/63 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 2/65 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 31/96 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/96 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 5 (OVERLAPS) 1/161 variables, 1/97 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/97 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 96/257 variables, 161/258 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 33/291 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/257 variables, 0/291 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 10 (OVERLAPS) 0/257 variables, 0/291 constraints. Problems are: Problem set: 31 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 257/257 variables, and 291 constraints, problems are : Problem set: 31 solved, 33 unsolved in 1343 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 33/64 constraints, Known Traps: 31/31 constraints]
After SMT, in 3585ms problems are : Problem set: 31 solved, 33 unsolved
Search for dead transitions found 31 dead transitions in 3585ms
Found 31 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 31 transitions
Dead transitions reduction (with SMT) removed 31 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 161/161 places, 65/96 transitions.
Graph (complete) has 260 edges and 161 vertex of which 130 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.2 ms
Discarding 31 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 130 /161 variables (removed 31) and now considering 65/65 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 130/161 places, 65/96 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3605 ms. Remains : 130/161 places, 65/96 transitions.
Support contains 4 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 161 /161 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 161 cols
[2024-05-23 02:13:23] [INFO ] Computed 66 invariants in 0 ms
[2024-05-23 02:13:23] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-23 02:13:23] [INFO ] Invariant cache hit.
[2024-05-23 02:13:23] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
Running 64 sub problems to find dead transitions.
[2024-05-23 02:13:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 63/160 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 1/161 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 96/257 variables, 161/227 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/257 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 0/257 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 257/257 variables, and 227 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1568 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 63/160 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 1/161 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 96/257 variables, 161/227 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/257 variables, 64/291 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (OVERLAPS) 0/257 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 257/257 variables, and 291 constraints, problems are : Problem set: 0 solved, 64 unsolved in 4085 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
After SMT, in 5661ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 5662ms
Finished structural reductions in LTL mode , in 1 iterations and 5843 ms. Remains : 161/161 places, 96/96 transitions.
Treatment of property CircularTrains-PT-096-LTLFireability-09 finished in 20208 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(X(X(((G(p0) U p1)||F(p2)))))))'
Support contains 6 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 168 /168 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 168 cols
[2024-05-23 02:13:29] [INFO ] Computed 73 invariants in 1 ms
[2024-05-23 02:13:29] [INFO ] Implicit Places using invariants in 85 ms returned [3, 29, 146, 148, 150, 158, 163]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 86 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 161/168 places, 96/96 transitions.
Applied a total of 0 rules in 5 ms. Remains 161 /161 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 94 ms. Remains : 161/168 places, 96/96 transitions.
Stuttering acceptance computed with spot in 275 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : CircularTrains-PT-096-LTLFireability-10
Product exploration explored 100000 steps with 6715 reset in 365 ms.
Product exploration explored 100000 steps with 6836 reset in 402 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) p2)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 86 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 7 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 281 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0))]
RANDOM walk for 267 steps (0 resets) in 8 ms. (29 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2)]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p2))), (F p0), (F (NOT (OR p0 p1 p2))), (F p1), (F (NOT p2)), (F (NOT (OR (NOT p0) p1 p2))), (F (NOT (OR p0 p2)))]
Knowledge based reduction with 1 factoid took 248 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 7 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 284 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 248 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0))]
Support contains 6 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 96/96 transitions.
Applied a total of 0 rules in 2 ms. Remains 161 /161 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 161 cols
[2024-05-23 02:13:31] [INFO ] Computed 66 invariants in 1 ms
[2024-05-23 02:13:31] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-23 02:13:31] [INFO ] Invariant cache hit.
[2024-05-23 02:13:32] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
Running 64 sub problems to find dead transitions.
[2024-05-23 02:13:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 62/159 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 2/161 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 96/257 variables, 161/227 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/257 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 0/257 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 257/257 variables, and 227 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1587 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 62/159 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 2/161 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 96/257 variables, 161/227 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/257 variables, 64/291 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (OVERLAPS) 0/257 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 257/257 variables, and 291 constraints, problems are : Problem set: 0 solved, 64 unsolved in 5033 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
After SMT, in 6627ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 6629ms
Finished structural reductions in LTL mode , in 1 iterations and 6832 ms. Remains : 161/161 places, 96/96 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 69 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 7 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 264 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0))]
RANDOM walk for 254 steps (0 resets) in 7 ms. (31 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2)]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p2))), (F p0), (F (NOT (OR p0 p1 p2))), (F p1), (F (NOT p2)), (F (NOT (OR (NOT p0) p1 p2))), (F (NOT (OR p0 p2)))]
Knowledge based reduction with 1 factoid took 241 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 7 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 278 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 272 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 278 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 6853 reset in 355 ms.
Product exploration explored 100000 steps with 6314 reset in 391 ms.
Applying partial POR strategy [false, false, false, false, true, true, true]
Stuttering acceptance computed with spot in 349 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0))]
Support contains 6 out of 161 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 161/161 places, 96/96 transitions.
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 161 transition count 96
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 28 place count 161 transition count 96
Deduced a syphon composed of 30 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 30 place count 161 transition count 96
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 31 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 161 transition count 96
Deduced a syphon composed of 31 places in 0 ms
Applied a total of 31 rules in 11 ms. Remains 161 /161 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2024-05-23 02:13:41] [INFO ] Redundant transitions in 1 ms returned []
Running 64 sub problems to find dead transitions.
// Phase 1: matrix 96 rows 161 cols
[2024-05-23 02:13:41] [INFO ] Computed 66 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 62/159 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2024-05-23 02:13:41] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-05-23 02:13:41] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
[2024-05-23 02:13:41] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
[2024-05-23 02:13:41] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2024-05-23 02:13:41] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
[2024-05-23 02:13:41] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 1 ms to minimize.
[2024-05-23 02:13:41] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
[2024-05-23 02:13:41] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
[2024-05-23 02:13:41] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-05-23 02:13:41] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-23 02:13:41] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-23 02:13:41] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
Problem TDEAD50 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD60 is UNSAT
[2024-05-23 02:13:42] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
[2024-05-23 02:13:42] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
Problem TDEAD62 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD51 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 14/78 constraints. Problems are: Problem set: 14 solved, 50 unsolved
[2024-05-23 02:13:42] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-05-23 02:13:42] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-05-23 02:13:42] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
[2024-05-23 02:13:42] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-23 02:13:42] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
[2024-05-23 02:13:42] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
Problem TDEAD31 is UNSAT
[2024-05-23 02:13:42] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
[2024-05-23 02:13:42] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
Problem TDEAD37 is UNSAT
[2024-05-23 02:13:42] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
Problem TDEAD38 is UNSAT
[2024-05-23 02:13:42] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD41 is UNSAT
[2024-05-23 02:13:42] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
Problem TDEAD42 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD32 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 11/89 constraints. Problems are: Problem set: 25 solved, 39 unsolved
[2024-05-23 02:13:42] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-05-23 02:13:42] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
Problem TDEAD7 is UNSAT
[2024-05-23 02:13:42] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
Problem TDEAD12 is UNSAT
[2024-05-23 02:13:42] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
Problem TDEAD13 is UNSAT
[2024-05-23 02:13:42] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
Problem TDEAD43 is UNSAT
[2024-05-23 02:13:42] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD48 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 6/95 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 0/95 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 2/161 variables, 2/97 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/97 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 9 (OVERLAPS) 96/257 variables, 161/258 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/257 variables, 0/258 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 11 (OVERLAPS) 0/257 variables, 0/258 constraints. Problems are: Problem set: 31 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 257/257 variables, and 258 constraints, problems are : Problem set: 31 solved, 33 unsolved in 2272 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 31 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 93/159 variables, 62/62 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 2/64 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 31/95 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/95 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 5 (OVERLAPS) 2/161 variables, 2/97 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/97 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 96/257 variables, 161/258 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 33/291 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/257 variables, 0/291 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 10 (OVERLAPS) 0/257 variables, 0/291 constraints. Problems are: Problem set: 31 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 257/257 variables, and 291 constraints, problems are : Problem set: 31 solved, 33 unsolved in 1469 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 33/64 constraints, Known Traps: 31/31 constraints]
After SMT, in 3750ms problems are : Problem set: 31 solved, 33 unsolved
Search for dead transitions found 31 dead transitions in 3752ms
Found 31 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 31 transitions
Dead transitions reduction (with SMT) removed 31 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 161/161 places, 65/96 transitions.
Graph (complete) has 260 edges and 161 vertex of which 130 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.2 ms
Discarding 31 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 8 ms. Remains 130 /161 variables (removed 31) and now considering 65/65 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 130/161 places, 65/96 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3780 ms. Remains : 130/161 places, 65/96 transitions.
Support contains 6 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 96/96 transitions.
Applied a total of 0 rules in 0 ms. Remains 161 /161 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 161 cols
[2024-05-23 02:13:45] [INFO ] Computed 66 invariants in 1 ms
[2024-05-23 02:13:45] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-23 02:13:45] [INFO ] Invariant cache hit.
[2024-05-23 02:13:45] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
Running 64 sub problems to find dead transitions.
[2024-05-23 02:13:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 62/159 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 2/161 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 96/257 variables, 161/227 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/257 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 0/257 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 257/257 variables, and 227 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1561 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 62/159 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 2/161 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 96/257 variables, 161/227 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/257 variables, 64/291 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (OVERLAPS) 0/257 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 257/257 variables, and 291 constraints, problems are : Problem set: 0 solved, 64 unsolved in 5073 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
After SMT, in 6642ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 6642ms
Finished structural reductions in LTL mode , in 1 iterations and 6834 ms. Remains : 161/161 places, 96/96 transitions.
Treatment of property CircularTrains-PT-096-LTLFireability-10 finished in 22413 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 168 /168 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 168 cols
[2024-05-23 02:13:51] [INFO ] Computed 73 invariants in 1 ms
[2024-05-23 02:13:52] [INFO ] Implicit Places using invariants in 96 ms returned [3, 29, 146, 148, 150, 158, 163, 164]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 99 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 160/168 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 160 /160 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 102 ms. Remains : 160/168 places, 96/96 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-096-LTLFireability-11
Product exploration explored 100000 steps with 1487 reset in 354 ms.
Product exploration explored 100000 steps with 1472 reset in 401 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 74 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 63 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 333 steps (0 resets) in 7 ms. (41 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 99 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 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 96 rows 160 cols
[2024-05-23 02:13:53] [INFO ] Computed 65 invariants in 2 ms
[2024-05-23 02:13:53] [INFO ] [Real]Absence check using 63 positive place invariants in 9 ms returned sat
[2024-05-23 02:13:53] [INFO ] [Real]Absence check using 63 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-23 02:13:53] [INFO ] [Real]Absence check using state equation in 175 ms returned sat
[2024-05-23 02:13:53] [INFO ] Computed and/alt/rep : 64/96/64 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-23 02:13:53] [INFO ] Added : 61 causal constraints over 13 iterations in 227 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 160/160 places, 96/96 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 160 transition count 66
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 60 place count 130 transition count 66
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 60 place count 130 transition count 64
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 64 place count 128 transition count 64
Applied a total of 64 rules in 7 ms. Remains 128 /160 variables (removed 32) and now considering 64/96 (removed 32) transitions.
// Phase 1: matrix 64 rows 128 cols
[2024-05-23 02:13:53] [INFO ] Computed 65 invariants in 1 ms
[2024-05-23 02:13:53] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-23 02:13:53] [INFO ] Invariant cache hit.
[2024-05-23 02:13:53] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
[2024-05-23 02:13:53] [INFO ] Redundant transitions in 1 ms returned []
Running 32 sub problems to find dead transitions.
[2024-05-23 02:13:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 63/127 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/128 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 64/192 variables, 128/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (OVERLAPS) 0/192 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 193 constraints, problems are : Problem set: 0 solved, 32 unsolved in 675 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 63/127 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/128 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 64/192 variables, 128/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 32/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 225 constraints, problems are : Problem set: 0 solved, 32 unsolved in 1336 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
After SMT, in 2020ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 2021ms
Starting structural reductions in SI_LTL mode, iteration 1 : 128/160 places, 64/96 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2233 ms. Remains : 128/160 places, 64/96 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))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 122 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 86 steps (0 resets) in 6 ms. (12 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 225 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
[2024-05-23 02:13:56] [INFO ] Invariant cache hit.
[2024-05-23 02:13:56] [INFO ] [Real]Absence check using 63 positive place invariants in 8 ms returned sat
[2024-05-23 02:13:56] [INFO ] [Real]Absence check using 63 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-23 02:13:56] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2024-05-23 02:13:56] [INFO ] Computed and/alt/rep : 32/64/32 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-23 02:13:56] [INFO ] Added : 30 causal constraints over 6 iterations in 71 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2913 reset in 384 ms.
Product exploration explored 100000 steps with 2870 reset in 410 ms.
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 128 /128 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-05-23 02:13:57] [INFO ] Invariant cache hit.
[2024-05-23 02:13:57] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-23 02:13:57] [INFO ] Invariant cache hit.
[2024-05-23 02:13:57] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
[2024-05-23 02:13:57] [INFO ] Redundant transitions in 0 ms returned []
Running 32 sub problems to find dead transitions.
[2024-05-23 02:13:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 63/127 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/128 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 64/192 variables, 128/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (OVERLAPS) 0/192 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 193 constraints, problems are : Problem set: 0 solved, 32 unsolved in 643 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 63/127 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/128 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 64/192 variables, 128/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 32/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 225 constraints, problems are : Problem set: 0 solved, 32 unsolved in 1348 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
After SMT, in 1995ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 1996ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2175 ms. Remains : 128/128 places, 64/64 transitions.
Treatment of property CircularTrains-PT-096-LTLFireability-11 finished in 7898 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)&&F(G(p1)))))'
Support contains 4 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 168 /168 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 168 cols
[2024-05-23 02:13:59] [INFO ] Computed 73 invariants in 1 ms
[2024-05-23 02:13:59] [INFO ] Implicit Places using invariants in 92 ms returned [3, 29, 146, 148, 150, 158, 164]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 93 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 161/168 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 161 /161 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 95 ms. Remains : 161/168 places, 96/96 transitions.
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CircularTrains-PT-096-LTLFireability-12
Product exploration explored 100000 steps with 0 reset in 328 ms.
Product exploration explored 100000 steps with 0 reset in 399 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 182 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 221 steps (0 resets) in 6 ms. (31 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 277 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 4 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 161 /161 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 161 cols
[2024-05-23 02:14:01] [INFO ] Computed 66 invariants in 1 ms
[2024-05-23 02:14:01] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-23 02:14:01] [INFO ] Invariant cache hit.
[2024-05-23 02:14:01] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
Running 64 sub problems to find dead transitions.
[2024-05-23 02:14:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 63/160 variables, 63/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (OVERLAPS) 1/161 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (OVERLAPS) 96/257 variables, 161/227 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (OVERLAPS) 0/257 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 257/257 variables, and 227 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1760 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 63/160 variables, 63/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (OVERLAPS) 1/161 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (OVERLAPS) 96/257 variables, 161/227 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 64/291 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/257 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 10 (OVERLAPS) 0/257 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 257/257 variables, and 291 constraints, problems are : Problem set: 0 solved, 64 unsolved in 4661 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
After SMT, in 6428ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 6430ms
Finished structural reductions in LTL mode , in 1 iterations and 6621 ms. Remains : 161/161 places, 96/96 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 (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 130 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 272 steps (0 resets) in 7 ms. (34 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 190 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 238 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 333 ms.
Product exploration explored 100000 steps with 0 reset in 386 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 4 out of 161 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 161/161 places, 96/96 transitions.
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 161 transition count 96
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 28 place count 161 transition count 96
Deduced a syphon composed of 30 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 30 place count 161 transition count 96
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 31 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 161 transition count 96
Deduced a syphon composed of 31 places in 0 ms
Applied a total of 31 rules in 13 ms. Remains 161 /161 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2024-05-23 02:14:10] [INFO ] Redundant transitions in 0 ms returned []
Running 64 sub problems to find dead transitions.
// Phase 1: matrix 96 rows 161 cols
[2024-05-23 02:14:10] [INFO ] Computed 66 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 63/160 variables, 63/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2024-05-23 02:14:10] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 0 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-05-23 02:14:10] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
[2024-05-23 02:14:10] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 0 ms to minimize.
[2024-05-23 02:14:10] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
[2024-05-23 02:14:10] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
[2024-05-23 02:14:10] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
[2024-05-23 02:14:10] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
[2024-05-23 02:14:10] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 1 ms to minimize.
[2024-05-23 02:14:10] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-05-23 02:14:11] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
[2024-05-23 02:14:11] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
[2024-05-23 02:14:11] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
[2024-05-23 02:14:11] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-23 02:14:11] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
[2024-05-23 02:14:11] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
Problem TDEAD30 is UNSAT
[2024-05-23 02:14:11] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
[2024-05-23 02:14:11] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD37 is UNSAT
[2024-05-23 02:14:11] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
Problem TDEAD38 is UNSAT
[2024-05-23 02:14:11] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
Problem TDEAD41 is UNSAT
[2024-05-23 02:14:11] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD62 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 20/85 constraints. Problems are: Problem set: 20 solved, 44 unsolved
[2024-05-23 02:14:11] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-05-23 02:14:11] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-05-23 02:14:11] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
[2024-05-23 02:14:11] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
[2024-05-23 02:14:11] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
[2024-05-23 02:14:11] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD43 is UNSAT
[2024-05-23 02:14:11] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
Problem TDEAD44 is UNSAT
[2024-05-23 02:14:11] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
Problem TDEAD6 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD51 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 8/93 constraints. Problems are: Problem set: 28 solved, 36 unsolved
[2024-05-23 02:14:11] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-05-23 02:14:11] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
Problem TDEAD7 is UNSAT
[2024-05-23 02:14:11] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
Problem TDEAD48 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 3/96 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/96 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 8 (OVERLAPS) 1/161 variables, 1/97 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 0/97 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 10 (OVERLAPS) 96/257 variables, 161/258 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/257 variables, 0/258 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 12 (OVERLAPS) 0/257 variables, 0/258 constraints. Problems are: Problem set: 31 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 257/257 variables, and 258 constraints, problems are : Problem set: 31 solved, 33 unsolved in 2314 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 31 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 94/160 variables, 63/63 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 2/65 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 31/96 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/96 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 5 (OVERLAPS) 1/161 variables, 1/97 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/97 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 96/257 variables, 161/258 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 33/291 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/257 variables, 0/291 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 10 (OVERLAPS) 0/257 variables, 0/291 constraints. Problems are: Problem set: 31 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 257/257 variables, and 291 constraints, problems are : Problem set: 31 solved, 33 unsolved in 1696 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 33/64 constraints, Known Traps: 31/31 constraints]
After SMT, in 4019ms problems are : Problem set: 31 solved, 33 unsolved
Search for dead transitions found 31 dead transitions in 4020ms
Found 31 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 31 transitions
Dead transitions reduction (with SMT) removed 31 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 161/161 places, 65/96 transitions.
Graph (complete) has 260 edges and 161 vertex of which 130 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.1 ms
Discarding 31 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 130 /161 variables (removed 31) and now considering 65/65 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 130/161 places, 65/96 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4057 ms. Remains : 130/161 places, 65/96 transitions.
Support contains 4 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 161 /161 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 161 cols
[2024-05-23 02:14:14] [INFO ] Computed 66 invariants in 0 ms
[2024-05-23 02:14:14] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-23 02:14:14] [INFO ] Invariant cache hit.
[2024-05-23 02:14:14] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
Running 64 sub problems to find dead transitions.
[2024-05-23 02:14:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 63/160 variables, 63/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (OVERLAPS) 1/161 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (OVERLAPS) 96/257 variables, 161/227 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (OVERLAPS) 0/257 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 257/257 variables, and 227 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1720 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 63/160 variables, 63/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (OVERLAPS) 1/161 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (OVERLAPS) 96/257 variables, 161/227 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 64/291 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/257 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 10 (OVERLAPS) 0/257 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 257/257 variables, and 291 constraints, problems are : Problem set: 0 solved, 64 unsolved in 4771 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
After SMT, in 6499ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 6500ms
Finished structural reductions in LTL mode , in 1 iterations and 6702 ms. Remains : 161/161 places, 96/96 transitions.
Treatment of property CircularTrains-PT-096-LTLFireability-12 finished in 21260 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 168 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 168/168 places, 96/96 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 168 transition count 79
Reduce places removed 17 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 18 rules applied. Total rules applied 35 place count 151 transition count 78
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 36 place count 150 transition count 78
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 36 place count 150 transition count 72
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 48 place count 144 transition count 72
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 60 place count 138 transition count 66
Applied a total of 60 rules in 8 ms. Remains 138 /168 variables (removed 30) and now considering 66/96 (removed 30) transitions.
// Phase 1: matrix 66 rows 138 cols
[2024-05-23 02:14:21] [INFO ] Computed 73 invariants in 1 ms
[2024-05-23 02:14:21] [INFO ] Implicit Places using invariants in 87 ms returned [2, 23, 119, 121, 123, 134, 135]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 97 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 131/168 places, 66/96 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 131 transition count 65
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 130 transition count 65
Applied a total of 2 rules in 2 ms. Remains 130 /131 variables (removed 1) and now considering 65/66 (removed 1) transitions.
// Phase 1: matrix 65 rows 130 cols
[2024-05-23 02:14:21] [INFO ] Computed 66 invariants in 1 ms
[2024-05-23 02:14:21] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-23 02:14:21] [INFO ] Invariant cache hit.
[2024-05-23 02:14:21] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 130/168 places, 65/96 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 286 ms. Remains : 130/168 places, 65/96 transitions.
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CircularTrains-PT-096-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 338 ms.
Product exploration explored 100000 steps with 0 reset in 418 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 260 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 103 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 79 steps (0 resets) in 5 ms. (13 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F p1)]
Knowledge based reduction with 1 factoid took 327 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 115 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2024-05-23 02:14:23] [INFO ] Invariant cache hit.
[2024-05-23 02:14:23] [INFO ] [Real]Absence check using 63 positive place invariants in 9 ms returned sat
[2024-05-23 02:14:23] [INFO ] [Real]Absence check using 63 positive and 3 generalized place invariants in 5 ms returned sat
[2024-05-23 02:14:23] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2024-05-23 02:14:23] [INFO ] Computed and/alt/rep : 33/65/33 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-23 02:14:23] [INFO ] Added : 30 causal constraints over 6 iterations in 75 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 4 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 65/65 transitions.
Applied a total of 0 rules in 2 ms. Remains 130 /130 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2024-05-23 02:14:23] [INFO ] Invariant cache hit.
[2024-05-23 02:14:23] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-23 02:14:23] [INFO ] Invariant cache hit.
[2024-05-23 02:14:23] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2024-05-23 02:14:23] [INFO ] Redundant transitions in 0 ms returned []
Running 33 sub problems to find dead transitions.
[2024-05-23 02:14:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (OVERLAPS) 63/129 variables, 63/64 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (OVERLAPS) 1/130 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 65/195 variables, 130/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (OVERLAPS) 0/195 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 196 constraints, problems are : Problem set: 0 solved, 33 unsolved in 773 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (OVERLAPS) 63/129 variables, 63/64 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (OVERLAPS) 1/130 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 65/195 variables, 130/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 33/229 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 10 (OVERLAPS) 0/195 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 229 constraints, problems are : Problem set: 0 solved, 33 unsolved in 1466 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints]
After SMT, in 2246ms problems are : Problem set: 0 solved, 33 unsolved
Search for dead transitions found 0 dead transitions in 2247ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2425 ms. Remains : 130/130 places, 65/65 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))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 262 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 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 79 steps (0 resets) in 5 ms. (13 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F p1)]
Knowledge based reduction with 1 factoid took 289 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 114 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2024-05-23 02:14:26] [INFO ] Invariant cache hit.
[2024-05-23 02:14:26] [INFO ] [Real]Absence check using 63 positive place invariants in 9 ms returned sat
[2024-05-23 02:14:26] [INFO ] [Real]Absence check using 63 positive and 3 generalized place invariants in 5 ms returned sat
[2024-05-23 02:14:26] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2024-05-23 02:14:26] [INFO ] Computed and/alt/rep : 33/65/33 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-23 02:14:27] [INFO ] Added : 30 causal constraints over 6 iterations in 78 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 335 ms.
Product exploration explored 100000 steps with 0 reset in 418 ms.
Support contains 4 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 65/65 transitions.
Applied a total of 0 rules in 2 ms. Remains 130 /130 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2024-05-23 02:14:27] [INFO ] Invariant cache hit.
[2024-05-23 02:14:28] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-23 02:14:28] [INFO ] Invariant cache hit.
[2024-05-23 02:14:28] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
[2024-05-23 02:14:28] [INFO ] Redundant transitions in 0 ms returned []
Running 33 sub problems to find dead transitions.
[2024-05-23 02:14:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (OVERLAPS) 63/129 variables, 63/64 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (OVERLAPS) 1/130 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 65/195 variables, 130/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (OVERLAPS) 0/195 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 196 constraints, problems are : Problem set: 0 solved, 33 unsolved in 756 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (OVERLAPS) 63/129 variables, 63/64 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (OVERLAPS) 1/130 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 65/195 variables, 130/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 33/229 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 10 (OVERLAPS) 0/195 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 229 constraints, problems are : Problem set: 0 solved, 33 unsolved in 1449 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints]
After SMT, in 2213ms problems are : Problem set: 0 solved, 33 unsolved
Search for dead transitions found 0 dead transitions in 2213ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2413 ms. Remains : 130/130 places, 65/65 transitions.
Treatment of property CircularTrains-PT-096-LTLFireability-13 finished in 9308 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(G(p1))))'
Support contains 4 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 168 /168 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 168 cols
[2024-05-23 02:14:30] [INFO ] Computed 73 invariants in 1 ms
[2024-05-23 02:14:30] [INFO ] Implicit Places using invariants in 87 ms returned [3, 29, 146, 148, 150, 158, 163, 164]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 87 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 160/168 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 160 /160 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 91 ms. Remains : 160/168 places, 96/96 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CircularTrains-PT-096-LTLFireability-15
Product exploration explored 100000 steps with 1489 reset in 359 ms.
Product exploration explored 100000 steps with 1486 reset in 386 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 93 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 274 steps (0 resets) in 7 ms. (34 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 9 factoid took 110 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 96 rows 160 cols
[2024-05-23 02:14:31] [INFO ] Computed 65 invariants in 1 ms
[2024-05-23 02:14:31] [INFO ] [Real]Absence check using 63 positive place invariants in 9 ms returned sat
[2024-05-23 02:14:31] [INFO ] [Real]Absence check using 63 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-23 02:14:32] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2024-05-23 02:14:32] [INFO ] Computed and/alt/rep : 64/96/64 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-23 02:14:32] [INFO ] Added : 61 causal constraints over 13 iterations in 194 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 160 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 160 /160 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2024-05-23 02:14:32] [INFO ] Invariant cache hit.
[2024-05-23 02:14:32] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-23 02:14:32] [INFO ] Invariant cache hit.
[2024-05-23 02:14:32] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
Running 64 sub problems to find dead transitions.
[2024-05-23 02:14:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 63/159 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 1/160 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 96/256 variables, 160/225 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 0/256 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 225 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1525 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 63/159 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 1/160 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 96/256 variables, 160/225 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 64/289 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (OVERLAPS) 0/256 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 289 constraints, problems are : Problem set: 0 solved, 64 unsolved in 4119 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
After SMT, in 5650ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 5652ms
Finished structural reductions in LTL mode , in 1 iterations and 5838 ms. Remains : 160/160 places, 96/96 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 66 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 196 steps (0 resets) in 5 ms. (32 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 94 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-23 02:14:38] [INFO ] Invariant cache hit.
[2024-05-23 02:14:38] [INFO ] [Real]Absence check using 63 positive place invariants in 10 ms returned sat
[2024-05-23 02:14:38] [INFO ] [Real]Absence check using 63 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-23 02:14:38] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
[2024-05-23 02:14:38] [INFO ] Computed and/alt/rep : 64/96/64 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-23 02:14:39] [INFO ] Added : 61 causal constraints over 13 iterations in 286 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1496 reset in 366 ms.
Product exploration explored 100000 steps with 1481 reset in 392 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 160/160 places, 96/96 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 160 transition count 96
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 30 place count 160 transition count 96
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 32 place count 160 transition count 96
Deduced a syphon composed of 32 places in 0 ms
Applied a total of 32 rules in 7 ms. Remains 160 /160 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2024-05-23 02:14:40] [INFO ] Redundant transitions in 0 ms returned []
Running 64 sub problems to find dead transitions.
// Phase 1: matrix 96 rows 160 cols
[2024-05-23 02:14:40] [INFO ] Computed 65 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 63/159 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2024-05-23 02:14:40] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
[2024-05-23 02:14:40] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
[2024-05-23 02:14:40] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
[2024-05-23 02:14:40] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
[2024-05-23 02:14:40] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
[2024-05-23 02:14:40] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
[2024-05-23 02:14:40] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-05-23 02:14:40] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
[2024-05-23 02:14:40] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
[2024-05-23 02:14:40] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
[2024-05-23 02:14:40] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
[2024-05-23 02:14:40] [INFO ] Deduced a trap composed of 2 places in 13 ms of which 0 ms to minimize.
Problem TDEAD36 is UNSAT
[2024-05-23 02:14:40] [INFO ] Deduced a trap composed of 2 places in 13 ms of which 1 ms to minimize.
Problem TDEAD37 is UNSAT
[2024-05-23 02:14:40] [INFO ] Deduced a trap composed of 2 places in 13 ms of which 0 ms to minimize.
Problem TDEAD40 is UNSAT
[2024-05-23 02:14:40] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
Problem TDEAD41 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD59 is UNSAT
[2024-05-23 02:14:41] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
[2024-05-23 02:14:41] [INFO ] Deduced a trap composed of 2 places in 12 ms of which 0 ms to minimize.
Problem TDEAD61 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD54 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 17/81 constraints. Problems are: Problem set: 17 solved, 47 unsolved
[2024-05-23 02:14:41] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-05-23 02:14:41] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
[2024-05-23 02:14:41] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
[2024-05-23 02:14:41] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
[2024-05-23 02:14:41] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
Problem TDEAD30 is UNSAT
[2024-05-23 02:14:41] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
Problem TDEAD42 is UNSAT
[2024-05-23 02:14:41] [INFO ] Deduced a trap composed of 2 places in 13 ms of which 0 ms to minimize.
Problem TDEAD47 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD16 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 7/88 constraints. Problems are: Problem set: 24 solved, 40 unsolved
[2024-05-23 02:14:41] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-05-23 02:14:41] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-05-23 02:14:41] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
[2024-05-23 02:14:41] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-23 02:14:41] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 1 ms to minimize.
[2024-05-23 02:14:41] [INFO ] Deduced a trap composed of 2 places in 13 ms of which 1 ms to minimize.
Problem TDEAD6 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 6/94 constraints. Problems are: Problem set: 30 solved, 34 unsolved
[2024-05-23 02:14:41] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-05-23 02:14:41] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 1 ms to minimize.
Problem TDEAD7 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 2/96 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 0/96 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 8 (OVERLAPS) 1/160 variables, 1/97 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/160 variables, 0/97 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 10 (OVERLAPS) 96/256 variables, 160/257 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/256 variables, 0/257 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 12 (OVERLAPS) 0/256 variables, 0/257 constraints. Problems are: Problem set: 32 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 257 constraints, problems are : Problem set: 32 solved, 32 unsolved in 2400 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 32 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 95/159 variables, 63/63 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 1/64 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 32/96 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/96 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 5 (OVERLAPS) 1/160 variables, 1/97 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 0/97 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 96/256 variables, 160/257 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 32/289 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/256 variables, 0/289 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 10 (OVERLAPS) 0/256 variables, 0/289 constraints. Problems are: Problem set: 32 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 289 constraints, problems are : Problem set: 32 solved, 32 unsolved in 1533 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 32/64 constraints, Known Traps: 32/32 constraints]
After SMT, in 3942ms problems are : Problem set: 32 solved, 32 unsolved
Search for dead transitions found 32 dead transitions in 3944ms
Found 32 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 32 transitions
Dead transitions reduction (with SMT) removed 32 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 160/160 places, 64/96 transitions.
Graph (complete) has 256 edges and 160 vertex of which 128 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.1 ms
Discarding 32 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 128 /160 variables (removed 32) and now considering 64/64 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 128/160 places, 64/96 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3966 ms. Remains : 128/160 places, 64/96 transitions.
Support contains 2 out of 160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 96/96 transitions.
Applied a total of 0 rules in 0 ms. Remains 160 /160 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 160 cols
[2024-05-23 02:14:44] [INFO ] Computed 65 invariants in 2 ms
[2024-05-23 02:14:44] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-23 02:14:44] [INFO ] Invariant cache hit.
[2024-05-23 02:14:44] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
Running 64 sub problems to find dead transitions.
[2024-05-23 02:14:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 63/159 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 1/160 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 96/256 variables, 160/225 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 0/256 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 225 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1508 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 63/159 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 1/160 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 96/256 variables, 160/225 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 64/289 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (OVERLAPS) 0/256 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 289 constraints, problems are : Problem set: 0 solved, 64 unsolved in 4095 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
After SMT, in 5609ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 5610ms
Finished structural reductions in LTL mode , in 1 iterations and 5801 ms. Remains : 160/160 places, 96/96 transitions.
Treatment of property CircularTrains-PT-096-LTLFireability-15 finished in 19639 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||(F((G(p2)&&p1))&&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)||(F(p2)&&p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(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' '!(F(G(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' '!(F((G(F(((X(p0)||F(!p1)) U (G((X(p0)||F(!p1)))||(!p2&&(X(p0)||F(!p1)))))))||(!p2&&F(((X(p0)||F(!p1)) U (G((X(p0)||F(!p1)))||(!p2&&(X(p0)||F(!p1))))))))))'
Found a Shortening insensitive property : CircularTrains-PT-096-LTLFireability-09
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), false]
Support contains 4 out of 168 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 168/168 places, 96/96 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 168 transition count 78
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 36 place count 150 transition count 78
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 36 place count 150 transition count 73
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 46 place count 145 transition count 73
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 58 place count 139 transition count 67
Applied a total of 58 rules in 8 ms. Remains 139 /168 variables (removed 29) and now considering 67/96 (removed 29) transitions.
// Phase 1: matrix 67 rows 139 cols
[2024-05-23 02:14:50] [INFO ] Computed 73 invariants in 1 ms
[2024-05-23 02:14:50] [INFO ] Implicit Places using invariants in 81 ms returned [2, 120, 122, 124, 130, 135, 136]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 82 ms to find 7 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 132/168 places, 67/96 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 132 transition count 66
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 131 transition count 65
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 130 transition count 65
Applied a total of 4 rules in 8 ms. Remains 130 /132 variables (removed 2) and now considering 65/67 (removed 2) transitions.
// Phase 1: matrix 65 rows 130 cols
[2024-05-23 02:14:50] [INFO ] Computed 66 invariants in 1 ms
[2024-05-23 02:14:50] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-23 02:14:50] [INFO ] Invariant cache hit.
[2024-05-23 02:14:50] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 130/168 places, 65/96 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 279 ms. Remains : 130/168 places, 65/96 transitions.
Running random walk in product with property : CircularTrains-PT-096-LTLFireability-09
Product exploration explored 100000 steps with 6413 reset in 404 ms.
Product exploration explored 100000 steps with 6473 reset in 446 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 p2 (NOT p1) p0), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (X (NOT (AND p2 p1 (NOT p0)))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p2 p1 p0))), (X (X (NOT (AND p2 p1 p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 482 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), false]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 40000 steps (8 resets) in 231 ms. (172 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 1/1 properties
[2024-05-23 02:14:52] [INFO ] Invariant cache hit.
Problem apf2 is UNSAT
After SMT solving in domain Real declared 4/195 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 12 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, Generalized P Invariants (flows): 0/3 constraints, State Equation: 0/130 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 14ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (X (NOT (AND p2 p1 (NOT p0))))), (G (OR (NOT p1) p0 (NOT p2)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p2 p1 p0))), (X (X (NOT (AND p2 p1 p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p1) (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p1) p0))), (F p1), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR (NOT p1) (NOT p0))))]
Knowledge based reduction with 6 factoid took 751 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) p1), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) p1), (AND p1 (NOT p0))]
Support contains 4 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 65/65 transitions.
Applied a total of 0 rules in 2 ms. Remains 130 /130 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2024-05-23 02:14:53] [INFO ] Invariant cache hit.
[2024-05-23 02:14:53] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-23 02:14:53] [INFO ] Invariant cache hit.
[2024-05-23 02:14:53] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
Running 33 sub problems to find dead transitions.
[2024-05-23 02:14:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 63/129 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (OVERLAPS) 1/130 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (OVERLAPS) 65/195 variables, 130/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (OVERLAPS) 0/195 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 196 constraints, problems are : Problem set: 0 solved, 33 unsolved in 658 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 63/129 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (OVERLAPS) 1/130 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (OVERLAPS) 65/195 variables, 130/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 33/229 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (OVERLAPS) 0/195 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 229 constraints, problems are : Problem set: 0 solved, 33 unsolved in 1602 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints]
After SMT, in 2266ms problems are : Problem set: 0 solved, 33 unsolved
Search for dead transitions found 0 dead transitions in 2267ms
Finished structural reductions in LTL mode , in 1 iterations and 2436 ms. Remains : 130/130 places, 65/65 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 p2 (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X p0)]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 379 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) p1), (AND p1 (NOT p0))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 219 steps (0 resets) in 9 ms. (21 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X p0)]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT p2)), (F (NOT p0)), (F (NOT (OR (NOT p1) p0)))]
Knowledge based reduction with 3 factoid took 511 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) p1), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) p1), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) p1), (AND p1 (NOT p0))]
Product exploration explored 100000 steps with 6225 reset in 411 ms.
Product exploration explored 100000 steps with 6379 reset in 441 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p0) p1), (AND p1 (NOT p0))]
Support contains 4 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 65/65 transitions.
Applied a total of 0 rules in 1 ms. Remains 130 /130 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2024-05-23 02:14:58] [INFO ] Redundant transitions in 1 ms returned []
Running 33 sub problems to find dead transitions.
[2024-05-23 02:14:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 63/129 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (OVERLAPS) 1/130 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (OVERLAPS) 65/195 variables, 130/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (OVERLAPS) 0/195 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 196 constraints, problems are : Problem set: 0 solved, 33 unsolved in 679 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 63/129 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (OVERLAPS) 1/130 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (OVERLAPS) 65/195 variables, 130/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 33/229 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (OVERLAPS) 0/195 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 229 constraints, problems are : Problem set: 0 solved, 33 unsolved in 1581 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints]
After SMT, in 2267ms problems are : Problem set: 0 solved, 33 unsolved
Search for dead transitions found 0 dead transitions in 2268ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2275 ms. Remains : 130/130 places, 65/65 transitions.
Support contains 4 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 65/65 transitions.
Applied a total of 0 rules in 1 ms. Remains 130 /130 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2024-05-23 02:15:00] [INFO ] Invariant cache hit.
[2024-05-23 02:15:00] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-23 02:15:00] [INFO ] Invariant cache hit.
[2024-05-23 02:15:00] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
Running 33 sub problems to find dead transitions.
[2024-05-23 02:15:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 63/129 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (OVERLAPS) 1/130 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (OVERLAPS) 65/195 variables, 130/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (OVERLAPS) 0/195 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 196 constraints, problems are : Problem set: 0 solved, 33 unsolved in 680 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 63/129 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (OVERLAPS) 1/130 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (OVERLAPS) 65/195 variables, 130/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 33/229 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (OVERLAPS) 0/195 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 229 constraints, problems are : Problem set: 0 solved, 33 unsolved in 1628 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints]
After SMT, in 2327ms problems are : Problem set: 0 solved, 33 unsolved
Search for dead transitions found 0 dead transitions in 2327ms
Finished structural reductions in LTL mode , in 1 iterations and 2490 ms. Remains : 130/130 places, 65/65 transitions.
Treatment of property CircularTrains-PT-096-LTLFireability-09 finished in 12526 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(X(X(((G(p0) U p1)||F(p2)))))))'
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 : CircularTrains-PT-096-LTLFireability-11
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 168 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 168/168 places, 96/96 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 168 transition count 79
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 34 place count 151 transition count 79
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 34 place count 151 transition count 72
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 48 place count 144 transition count 72
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 58 place count 139 transition count 67
Applied a total of 58 rules in 5 ms. Remains 139 /168 variables (removed 29) and now considering 67/96 (removed 29) transitions.
// Phase 1: matrix 67 rows 139 cols
[2024-05-23 02:15:03] [INFO ] Computed 73 invariants in 1 ms
[2024-05-23 02:15:03] [INFO ] Implicit Places using invariants in 79 ms returned [2, 23, 120, 122, 124, 130, 135, 136]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 80 ms to find 8 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 131/168 places, 67/96 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 131 transition count 65
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 129 transition count 65
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 129 transition count 64
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 128 transition count 64
Applied a total of 6 rules in 3 ms. Remains 128 /131 variables (removed 3) and now considering 64/67 (removed 3) transitions.
// Phase 1: matrix 64 rows 128 cols
[2024-05-23 02:15:03] [INFO ] Computed 65 invariants in 1 ms
[2024-05-23 02:15:03] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-23 02:15:03] [INFO ] Invariant cache hit.
[2024-05-23 02:15:03] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 128/168 places, 64/96 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 247 ms. Remains : 128/168 places, 64/96 transitions.
Running random walk in product with property : CircularTrains-PT-096-LTLFireability-11
Product exploration explored 100000 steps with 2911 reset in 379 ms.
Product exploration explored 100000 steps with 2894 reset in 414 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))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 119 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 72 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 168 steps (0 resets) in 7 ms. (21 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 115 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
[2024-05-23 02:15:04] [INFO ] Invariant cache hit.
[2024-05-23 02:15:04] [INFO ] [Real]Absence check using 63 positive place invariants in 8 ms returned sat
[2024-05-23 02:15:04] [INFO ] [Real]Absence check using 63 positive and 2 generalized place invariants in 4 ms returned sat
[2024-05-23 02:15:04] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2024-05-23 02:15:04] [INFO ] Computed and/alt/rep : 32/64/32 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-23 02:15:04] [INFO ] Added : 30 causal constraints over 6 iterations in 69 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 128 /128 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-05-23 02:15:04] [INFO ] Invariant cache hit.
[2024-05-23 02:15:05] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-23 02:15:05] [INFO ] Invariant cache hit.
[2024-05-23 02:15:05] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
[2024-05-23 02:15:05] [INFO ] Redundant transitions in 0 ms returned []
Running 32 sub problems to find dead transitions.
[2024-05-23 02:15:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 63/127 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/128 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 64/192 variables, 128/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (OVERLAPS) 0/192 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 193 constraints, problems are : Problem set: 0 solved, 32 unsolved in 634 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 63/127 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/128 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 64/192 variables, 128/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 32/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 225 constraints, problems are : Problem set: 0 solved, 32 unsolved in 1580 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
After SMT, in 2218ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 2218ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2391 ms. Remains : 128/128 places, 64/64 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))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 128 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 93 steps (0 resets) in 5 ms. (15 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 132 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
[2024-05-23 02:15:07] [INFO ] Invariant cache hit.
[2024-05-23 02:15:07] [INFO ] [Real]Absence check using 63 positive place invariants in 10 ms returned sat
[2024-05-23 02:15:07] [INFO ] [Real]Absence check using 63 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-23 02:15:07] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2024-05-23 02:15:07] [INFO ] Computed and/alt/rep : 32/64/32 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-23 02:15:08] [INFO ] Added : 30 causal constraints over 6 iterations in 70 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2886 reset in 391 ms.
Product exploration explored 100000 steps with 2891 reset in 433 ms.
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 128 /128 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-05-23 02:15:09] [INFO ] Invariant cache hit.
[2024-05-23 02:15:09] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-23 02:15:09] [INFO ] Invariant cache hit.
[2024-05-23 02:15:09] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
[2024-05-23 02:15:09] [INFO ] Redundant transitions in 0 ms returned []
Running 32 sub problems to find dead transitions.
[2024-05-23 02:15:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 63/127 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/128 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 64/192 variables, 128/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (OVERLAPS) 0/192 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 193 constraints, problems are : Problem set: 0 solved, 32 unsolved in 662 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 63/127 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/128 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 64/192 variables, 128/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 32/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 225 constraints, problems are : Problem set: 0 solved, 32 unsolved in 1631 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
After SMT, in 2298ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 2299ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2485 ms. Remains : 128/128 places, 64/64 transitions.
Treatment of property CircularTrains-PT-096-LTLFireability-11 finished in 8498 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)&&F(G(p1)))))'
Found a Shortening insensitive property : CircularTrains-PT-096-LTLFireability-12
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 4 out of 168 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 168/168 places, 96/96 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 168 transition count 78
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 36 place count 150 transition count 78
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 36 place count 150 transition count 73
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 46 place count 145 transition count 73
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 58 place count 139 transition count 67
Applied a total of 58 rules in 9 ms. Remains 139 /168 variables (removed 29) and now considering 67/96 (removed 29) transitions.
// Phase 1: matrix 67 rows 139 cols
[2024-05-23 02:15:11] [INFO ] Computed 73 invariants in 1 ms
[2024-05-23 02:15:11] [INFO ] Implicit Places using invariants in 86 ms returned [2, 23, 120, 122, 124, 130, 136]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 103 ms to find 7 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 132/168 places, 67/96 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 132 transition count 66
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 131 transition count 66
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 131 transition count 65
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 130 transition count 65
Applied a total of 4 rules in 4 ms. Remains 130 /132 variables (removed 2) and now considering 65/67 (removed 2) transitions.
// Phase 1: matrix 65 rows 130 cols
[2024-05-23 02:15:11] [INFO ] Computed 66 invariants in 1 ms
[2024-05-23 02:15:11] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-23 02:15:11] [INFO ] Invariant cache hit.
[2024-05-23 02:15:12] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 130/168 places, 65/96 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 297 ms. Remains : 130/168 places, 65/96 transitions.
Running random walk in product with property : CircularTrains-PT-096-LTLFireability-12
Product exploration explored 100000 steps with 0 reset in 327 ms.
Product exploration explored 100000 steps with 0 reset in 441 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 226 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 253 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 161 steps (0 resets) in 6 ms. (23 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 279 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 4 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 65/65 transitions.
Applied a total of 0 rules in 1 ms. Remains 130 /130 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2024-05-23 02:15:13] [INFO ] Invariant cache hit.
[2024-05-23 02:15:14] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-23 02:15:14] [INFO ] Invariant cache hit.
[2024-05-23 02:15:14] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
Running 33 sub problems to find dead transitions.
[2024-05-23 02:15:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (OVERLAPS) 63/129 variables, 63/64 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (OVERLAPS) 1/130 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 65/195 variables, 130/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (OVERLAPS) 0/195 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 196 constraints, problems are : Problem set: 0 solved, 33 unsolved in 782 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (OVERLAPS) 63/129 variables, 63/64 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (OVERLAPS) 1/130 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 65/195 variables, 130/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 33/229 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 10 (OVERLAPS) 0/195 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 229 constraints, problems are : Problem set: 0 solved, 33 unsolved in 1735 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints]
After SMT, in 2524ms problems are : Problem set: 0 solved, 33 unsolved
Search for dead transitions found 0 dead transitions in 2524ms
Finished structural reductions in LTL mode , in 1 iterations and 2700 ms. Remains : 130/130 places, 65/65 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)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 217 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 149 steps (0 resets) in 6 ms. (21 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 272 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 333 ms.
Product exploration explored 100000 steps with 0 reset in 435 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 4 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 65/65 transitions.
Applied a total of 0 rules in 4 ms. Remains 130 /130 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2024-05-23 02:15:18] [INFO ] Redundant transitions in 0 ms returned []
Running 33 sub problems to find dead transitions.
[2024-05-23 02:15:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (OVERLAPS) 63/129 variables, 63/64 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (OVERLAPS) 1/130 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 65/195 variables, 130/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (OVERLAPS) 0/195 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 196 constraints, problems are : Problem set: 0 solved, 33 unsolved in 778 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (OVERLAPS) 63/129 variables, 63/64 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (OVERLAPS) 1/130 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 65/195 variables, 130/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 33/229 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 10 (OVERLAPS) 0/195 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 229 constraints, problems are : Problem set: 0 solved, 33 unsolved in 1751 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints]
After SMT, in 2538ms problems are : Problem set: 0 solved, 33 unsolved
Search for dead transitions found 0 dead transitions in 2539ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2551 ms. Remains : 130/130 places, 65/65 transitions.
Support contains 4 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 65/65 transitions.
Applied a total of 0 rules in 2 ms. Remains 130 /130 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2024-05-23 02:15:21] [INFO ] Invariant cache hit.
[2024-05-23 02:15:21] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-23 02:15:21] [INFO ] Invariant cache hit.
[2024-05-23 02:15:21] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
Running 33 sub problems to find dead transitions.
[2024-05-23 02:15:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (OVERLAPS) 63/129 variables, 63/64 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (OVERLAPS) 1/130 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 65/195 variables, 130/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (OVERLAPS) 0/195 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 196 constraints, problems are : Problem set: 0 solved, 33 unsolved in 774 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (OVERLAPS) 63/129 variables, 63/64 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (OVERLAPS) 1/130 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 65/195 variables, 130/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 33/229 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 10 (OVERLAPS) 0/195 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 229 constraints, problems are : Problem set: 0 solved, 33 unsolved in 1735 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints]
After SMT, in 2514ms problems are : Problem set: 0 solved, 33 unsolved
Search for dead transitions found 0 dead transitions in 2514ms
Finished structural reductions in LTL mode , in 1 iterations and 2697 ms. Remains : 130/130 places, 65/65 transitions.
Treatment of property CircularTrains-PT-096-LTLFireability-12 finished in 12497 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(G(p1))))'
Found a Lengthening insensitive property : CircularTrains-PT-096-LTLFireability-15
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 168 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 168/168 places, 96/96 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 168 transition count 80
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 152 transition count 80
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 32 place count 152 transition count 72
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 48 place count 144 transition count 72
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 60 place count 138 transition count 66
Applied a total of 60 rules in 9 ms. Remains 138 /168 variables (removed 30) and now considering 66/96 (removed 30) transitions.
// Phase 1: matrix 66 rows 138 cols
[2024-05-23 02:15:24] [INFO ] Computed 73 invariants in 2 ms
[2024-05-23 02:15:24] [INFO ] Implicit Places using invariants in 90 ms returned [2, 23, 119, 121, 123, 129, 134, 135]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 106 ms to find 8 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 130/168 places, 66/96 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 130 transition count 65
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 129 transition count 65
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 129 transition count 64
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 128 transition count 64
Applied a total of 4 rules in 3 ms. Remains 128 /130 variables (removed 2) and now considering 64/66 (removed 2) transitions.
// Phase 1: matrix 64 rows 128 cols
[2024-05-23 02:15:24] [INFO ] Computed 65 invariants in 0 ms
[2024-05-23 02:15:24] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-23 02:15:24] [INFO ] Invariant cache hit.
[2024-05-23 02:15:24] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 128/168 places, 64/96 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 309 ms. Remains : 128/168 places, 64/96 transitions.
Running random walk in product with property : CircularTrains-PT-096-LTLFireability-15
Product exploration explored 100000 steps with 2936 reset in 384 ms.
Product exploration explored 100000 steps with 2889 reset in 437 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 274 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 149 steps (0 resets) in 5 ms. (24 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1))), (F p0)]
Knowledge based reduction with 5 factoid took 301 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-23 02:15:26] [INFO ] Invariant cache hit.
[2024-05-23 02:15:26] [INFO ] [Real]Absence check using 63 positive place invariants in 12 ms returned sat
[2024-05-23 02:15:26] [INFO ] [Real]Absence check using 63 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-23 02:15:26] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2024-05-23 02:15:26] [INFO ] Computed and/alt/rep : 32/64/32 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-23 02:15:26] [INFO ] Added : 30 causal constraints over 6 iterations in 82 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 128 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 128 /128 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-05-23 02:15:26] [INFO ] Invariant cache hit.
[2024-05-23 02:15:26] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-23 02:15:26] [INFO ] Invariant cache hit.
[2024-05-23 02:15:26] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
Running 32 sub problems to find dead transitions.
[2024-05-23 02:15:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 63/127 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/128 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 64/192 variables, 128/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (OVERLAPS) 0/192 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 193 constraints, problems are : Problem set: 0 solved, 32 unsolved in 662 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 63/127 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/128 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 64/192 variables, 128/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 32/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 225 constraints, problems are : Problem set: 0 solved, 32 unsolved in 1529 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
After SMT, in 2197ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 2199ms
Finished structural reductions in LTL mode , in 1 iterations and 2372 ms. Remains : 128/128 places, 64/64 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)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 197 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 81 steps (0 resets) in 4 ms. (16 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 126 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-23 02:15:29] [INFO ] Invariant cache hit.
[2024-05-23 02:15:29] [INFO ] [Real]Absence check using 63 positive place invariants in 9 ms returned sat
[2024-05-23 02:15:29] [INFO ] [Real]Absence check using 63 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-23 02:15:29] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2024-05-23 02:15:29] [INFO ] Computed and/alt/rep : 32/64/32 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-23 02:15:29] [INFO ] Added : 30 causal constraints over 6 iterations in 83 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2930 reset in 399 ms.
Product exploration explored 100000 steps with 2929 reset in 432 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Applied a total of 0 rules in 4 ms. Remains 128 /128 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-05-23 02:15:31] [INFO ] Redundant transitions in 1 ms returned []
Running 32 sub problems to find dead transitions.
[2024-05-23 02:15:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 63/127 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/128 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 64/192 variables, 128/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (OVERLAPS) 0/192 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 193 constraints, problems are : Problem set: 0 solved, 32 unsolved in 718 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 63/127 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/128 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 64/192 variables, 128/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 32/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 225 constraints, problems are : Problem set: 0 solved, 32 unsolved in 1540 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
After SMT, in 2262ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 2263ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2275 ms. Remains : 128/128 places, 64/64 transitions.
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 128 /128 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-05-23 02:15:33] [INFO ] Invariant cache hit.
[2024-05-23 02:15:33] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-23 02:15:33] [INFO ] Invariant cache hit.
[2024-05-23 02:15:33] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
Running 32 sub problems to find dead transitions.
[2024-05-23 02:15:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 63/127 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/128 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 64/192 variables, 128/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (OVERLAPS) 0/192 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 193 constraints, problems are : Problem set: 0 solved, 32 unsolved in 662 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 63/127 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/128 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 64/192 variables, 128/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 32/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 225 constraints, problems are : Problem set: 0 solved, 32 unsolved in 1554 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
After SMT, in 2219ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 2220ms
Finished structural reductions in LTL mode , in 1 iterations and 2394 ms. Remains : 128/128 places, 64/64 transitions.
Treatment of property CircularTrains-PT-096-LTLFireability-15 finished in 11548 ms.
[2024-05-23 02:15:35] [INFO ] Flatten gal took : 9 ms
[2024-05-23 02:15:35] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2024-05-23 02:15:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 168 places, 96 transitions and 336 arcs took 2 ms.
Total runtime 209397 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running CircularTrains-PT-096

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 168
TRANSITIONS: 96
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.005s, Sys 0.000s]


SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.001s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 4814
MODEL NAME: /home/mcc/execution/412/model
168 places, 96 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA CircularTrains-PT-096-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CircularTrains-PT-096-LTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CircularTrains-PT-096-LTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CircularTrains-PT-096-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CircularTrains-PT-096-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CircularTrains-PT-096-LTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CircularTrains-PT-096-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CircularTrains-PT-096-LTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CircularTrains-PT-096-LTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CircularTrains-PT-096-LTLFireability-04 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716430925550

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

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="CircularTrains-PT-096"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is CircularTrains-PT-096, 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 r069-tall-171620504300348"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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