About the Execution of GreatSPN+red for CircularTrains-PT-048
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 6196.460 | 515854.00 | 931567.00 | 1995.60 | TTTFTTFFTFTTTTTF | normal |
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-171620504300340.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-048, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-tall-171620504300340
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 640K
-rw-r--r-- 1 mcc users 8.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K 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 May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K Apr 12 14:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 229K Apr 12 14:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Apr 12 14:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K 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 37K 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-048-LTLFireability-00
FORMULA_NAME CircularTrains-PT-048-LTLFireability-01
FORMULA_NAME CircularTrains-PT-048-LTLFireability-02
FORMULA_NAME CircularTrains-PT-048-LTLFireability-03
FORMULA_NAME CircularTrains-PT-048-LTLFireability-04
FORMULA_NAME CircularTrains-PT-048-LTLFireability-05
FORMULA_NAME CircularTrains-PT-048-LTLFireability-06
FORMULA_NAME CircularTrains-PT-048-LTLFireability-07
FORMULA_NAME CircularTrains-PT-048-LTLFireability-08
FORMULA_NAME CircularTrains-PT-048-LTLFireability-09
FORMULA_NAME CircularTrains-PT-048-LTLFireability-10
FORMULA_NAME CircularTrains-PT-048-LTLFireability-11
FORMULA_NAME CircularTrains-PT-048-LTLFireability-12
FORMULA_NAME CircularTrains-PT-048-LTLFireability-13
FORMULA_NAME CircularTrains-PT-048-LTLFireability-14
FORMULA_NAME CircularTrains-PT-048-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716429834052
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-048
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 02:03:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-23 02:03:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 02:03:55] [INFO ] Load time of PNML (sax parser for PT used): 47 ms
[2024-05-23 02:03:55] [INFO ] Transformed 96 places.
[2024-05-23 02:03:55] [INFO ] Transformed 48 transitions.
[2024-05-23 02:03:55] [INFO ] Parsed PT model containing 96 places and 48 transitions and 192 arcs in 144 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CircularTrains-PT-048-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-048-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 50 out of 96 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 48/48 transitions.
Applied a total of 0 rules in 15 ms. Remains 96 /96 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 96 cols
[2024-05-23 02:03:55] [INFO ] Computed 49 invariants in 18 ms
[2024-05-23 02:03:55] [INFO ] Implicit Places using invariants in 224 ms returned [3, 56, 64, 81, 89, 90, 94]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 256 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 89/96 places, 48/48 transitions.
Applied a total of 0 rules in 2 ms. Remains 89 /89 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 299 ms. Remains : 89/96 places, 48/48 transitions.
Support contains 50 out of 89 places after structural reductions.
[2024-05-23 02:03:56] [INFO ] Flatten gal took : 26 ms
[2024-05-23 02:03:56] [INFO ] Flatten gal took : 9 ms
[2024-05-23 02:03:56] [INFO ] Input system was already deterministic with 48 transitions.
Support contains 48 out of 89 places (down from 50) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 1049 ms. (38 steps per ms) remains 1/24 properties
BEST_FIRST walk for 40002 steps (8 resets) in 184 ms. (216 steps per ms) remains 1/1 properties
// Phase 1: matrix 48 rows 89 cols
[2024-05-23 02:03:56] [INFO ] Computed 42 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp17 is UNSAT
After SMT solving in domain Real declared 7/137 variables, and 2 constraints, problems are : Problem set: 1 solved, 0 unsolved in 66 ms.
Refiners :[Positive P Invariants (semi-flows): 2/28 constraints, Generalized P Invariants (flows): 0/14 constraints, State Equation: 0/89 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 89ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
FORMULA CircularTrains-PT-048-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 6 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 48/48 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 89 transition count 46
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 87 transition count 46
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 4 place count 87 transition count 42
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 12 place count 83 transition count 42
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 18 place count 80 transition count 39
Applied a total of 18 rules in 28 ms. Remains 80 /89 variables (removed 9) and now considering 39/48 (removed 9) transitions.
// Phase 1: matrix 39 rows 80 cols
[2024-05-23 02:03:57] [INFO ] Computed 42 invariants in 1 ms
[2024-05-23 02:03:57] [INFO ] Implicit Places using invariants in 236 ms returned [12, 15, 21, 57, 71, 72, 76, 77]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 237 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 72/89 places, 39/48 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 72 transition count 35
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 68 transition count 35
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 67 transition count 34
Applied a total of 10 rules in 10 ms. Remains 67 /72 variables (removed 5) and now considering 34/39 (removed 5) transitions.
// Phase 1: matrix 34 rows 67 cols
[2024-05-23 02:03:57] [INFO ] Computed 34 invariants in 3 ms
[2024-05-23 02:03:57] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-05-23 02:03:57] [INFO ] Invariant cache hit.
[2024-05-23 02:03:57] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 67/89 places, 34/48 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 516 ms. Remains : 67/89 places, 34/48 transitions.
Stuttering acceptance computed with spot in 288 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CircularTrains-PT-048-LTLFireability-01
Product exploration explored 100000 steps with 2749 reset in 460 ms.
Product exploration explored 100000 steps with 2702 reset in 352 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X p1), (X (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 1 factoid took 544 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 97 steps (0 resets) in 8 ms. (10 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 (NOT p0))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X p1), (X (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT (AND (NOT p0) p1))), (F p0)]
Knowledge based reduction with 1 factoid took 607 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 6 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 34/34 transitions.
Applied a total of 0 rules in 7 ms. Remains 67 /67 variables (removed 0) and now considering 34/34 (removed 0) transitions.
[2024-05-23 02:04:00] [INFO ] Invariant cache hit.
[2024-05-23 02:04:00] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-23 02:04:00] [INFO ] Invariant cache hit.
[2024-05-23 02:04:00] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
[2024-05-23 02:04:00] [INFO ] Redundant transitions in 0 ms returned []
Running 18 sub problems to find dead transitions.
[2024-05-23 02:04:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 31/66 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 1/67 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 34/101 variables, 67/101 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 0/101 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 101/101 variables, and 101 constraints, problems are : Problem set: 0 solved, 18 unsolved in 869 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 67/67 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 31/66 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 1/67 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 34/101 variables, 67/101 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 18/119 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/101 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 0/101 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 101/101 variables, and 119 constraints, problems are : Problem set: 0 solved, 18 unsolved in 539 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 67/67 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
After SMT, in 1420ms problems are : Problem set: 0 solved, 18 unsolved
Search for dead transitions found 0 dead transitions in 1421ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1708 ms. Remains : 67/67 places, 34/34 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) p1)]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 423 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 88 steps (0 resets) in 4 ms. (17 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT (AND (NOT p0) p1))), (F p0)]
Knowledge based reduction with 1 factoid took 703 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 2731 reset in 300 ms.
Product exploration explored 100000 steps with 2729 reset in 275 ms.
Support contains 6 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 34/34 transitions.
Applied a total of 0 rules in 3 ms. Remains 67 /67 variables (removed 0) and now considering 34/34 (removed 0) transitions.
[2024-05-23 02:04:03] [INFO ] Invariant cache hit.
[2024-05-23 02:04:03] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-23 02:04:03] [INFO ] Invariant cache hit.
[2024-05-23 02:04:04] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
[2024-05-23 02:04:04] [INFO ] Redundant transitions in 0 ms returned []
Running 18 sub problems to find dead transitions.
[2024-05-23 02:04:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 31/66 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 1/67 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 34/101 variables, 67/101 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 0/101 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 101/101 variables, and 101 constraints, problems are : Problem set: 0 solved, 18 unsolved in 317 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 67/67 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 31/66 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 1/67 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 34/101 variables, 67/101 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 18/119 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/101 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 0/101 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 101/101 variables, and 119 constraints, problems are : Problem set: 0 solved, 18 unsolved in 471 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 67/67 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
After SMT, in 793ms problems are : Problem set: 0 solved, 18 unsolved
Search for dead transitions found 0 dead transitions in 795ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1002 ms. Remains : 67/67 places, 34/34 transitions.
Treatment of property CircularTrains-PT-048-LTLFireability-01 finished in 7951 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)||G(F(p1)))))'
Support contains 4 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 48/48 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 89 transition count 46
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 87 transition count 46
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 4 place count 87 transition count 41
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 14 place count 82 transition count 41
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 20 place count 79 transition count 38
Applied a total of 20 rules in 11 ms. Remains 79 /89 variables (removed 10) and now considering 38/48 (removed 10) transitions.
// Phase 1: matrix 38 rows 79 cols
[2024-05-23 02:04:04] [INFO ] Computed 42 invariants in 1 ms
[2024-05-23 02:04:04] [INFO ] Implicit Places using invariants in 52 ms returned [0, 11, 14, 20, 56, 70, 71, 75, 76]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 53 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 70/89 places, 38/48 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 70 transition count 35
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 67 transition count 35
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 67 transition count 32
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 64 transition count 32
Applied a total of 12 rules in 4 ms. Remains 64 /70 variables (removed 6) and now considering 32/38 (removed 6) transitions.
// Phase 1: matrix 32 rows 64 cols
[2024-05-23 02:04:04] [INFO ] Computed 33 invariants in 1 ms
[2024-05-23 02:04:05] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-23 02:04:05] [INFO ] Invariant cache hit.
[2024-05-23 02:04:05] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 64/89 places, 32/48 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 193 ms. Remains : 64/89 places, 32/48 transitions.
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CircularTrains-PT-048-LTLFireability-02
Product exploration explored 100000 steps with 5508 reset in 239 ms.
Product exploration explored 100000 steps with 5482 reset in 266 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 (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 325 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 167 steps (0 resets) in 6 ms. (23 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 5 factoid took 482 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-23 02:04:06] [INFO ] Invariant cache hit.
[2024-05-23 02:04:06] [INFO ] [Real]Absence check using 31 positive place invariants in 4 ms returned sat
[2024-05-23 02:04:06] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-23 02:04:06] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-23 02:04:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:04:06] [INFO ] [Nat]Absence check using 31 positive place invariants in 4 ms returned sat
[2024-05-23 02:04:06] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-23 02:04:06] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-23 02:04:07] [INFO ] Computed and/alt/rep : 16/32/16 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-23 02:04:07] [INFO ] Added : 14 causal constraints over 3 iterations in 54 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 4 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 32/32 transitions.
Applied a total of 0 rules in 3 ms. Remains 64 /64 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2024-05-23 02:04:07] [INFO ] Invariant cache hit.
[2024-05-23 02:04:07] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-23 02:04:07] [INFO ] Invariant cache hit.
[2024-05-23 02:04:07] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
[2024-05-23 02:04:07] [INFO ] Redundant transitions in 0 ms returned []
Running 16 sub problems to find dead transitions.
[2024-05-23 02:04:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 31/63 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 1/64 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 32/96 variables, 64/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/96 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 96/96 variables, and 97 constraints, problems are : Problem set: 0 solved, 16 unsolved in 226 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 31/63 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 1/64 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 32/96 variables, 64/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 16/113 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/96 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/96 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 96/96 variables, and 113 constraints, problems are : Problem set: 0 solved, 16 unsolved in 355 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 613ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 613ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 757 ms. Remains : 64/64 places, 32/32 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 328 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 5 factoid took 435 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-23 02:04:08] [INFO ] Invariant cache hit.
[2024-05-23 02:04:08] [INFO ] [Real]Absence check using 31 positive place invariants in 3 ms returned sat
[2024-05-23 02:04:08] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-23 02:04:08] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-23 02:04:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:04:08] [INFO ] [Nat]Absence check using 31 positive place invariants in 4 ms returned sat
[2024-05-23 02:04:08] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-23 02:04:08] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2024-05-23 02:04:08] [INFO ] Computed and/alt/rep : 16/32/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-23 02:04:09] [INFO ] Added : 14 causal constraints over 3 iterations in 24 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 5506 reset in 241 ms.
Product exploration explored 100000 steps with 5580 reset in 259 ms.
Support contains 4 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 32/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 64 /64 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2024-05-23 02:04:09] [INFO ] Invariant cache hit.
[2024-05-23 02:04:09] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-23 02:04:09] [INFO ] Invariant cache hit.
[2024-05-23 02:04:09] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2024-05-23 02:04:09] [INFO ] Redundant transitions in 0 ms returned []
Running 16 sub problems to find dead transitions.
[2024-05-23 02:04:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 31/63 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 1/64 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 32/96 variables, 64/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/96 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 96/96 variables, and 97 constraints, problems are : Problem set: 0 solved, 16 unsolved in 214 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 31/63 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 1/64 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 32/96 variables, 64/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 16/113 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/96 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/96 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 96/96 variables, and 113 constraints, problems are : Problem set: 0 solved, 16 unsolved in 354 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 573ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 573ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 693 ms. Remains : 64/64 places, 32/32 transitions.
Treatment of property CircularTrains-PT-048-LTLFireability-02 finished in 5416 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(!p0)&&X(p1)) U X(X((p2 U p3)))))'
Support contains 8 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 48/48 transitions.
Applied a total of 0 rules in 2 ms. Remains 89 /89 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 89 cols
[2024-05-23 02:04:10] [INFO ] Computed 42 invariants in 1 ms
[2024-05-23 02:04:10] [INFO ] Implicit Places using invariants in 72 ms returned [1, 15, 21, 61, 79, 80, 85]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 74 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 82/89 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 82 /82 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 78 ms. Remains : 82/89 places, 48/48 transitions.
Stuttering acceptance computed with spot in 383 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3), true, (AND p0 (NOT p3)), (NOT p3), p0]
Running random walk in product with property : CircularTrains-PT-048-LTLFireability-03
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA CircularTrains-PT-048-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-048-LTLFireability-03 finished in 482 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X((p1&&G(p2))))))'
Support contains 6 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 89 /89 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2024-05-23 02:04:10] [INFO ] Invariant cache hit.
[2024-05-23 02:04:10] [INFO ] Implicit Places using invariants in 96 ms returned [1, 12, 15, 61, 79, 80, 86]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 111 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 82/89 places, 48/48 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 115 ms. Remains : 82/89 places, 48/48 transitions.
Stuttering acceptance computed with spot in 263 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (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))]
Running random walk in product with property : CircularTrains-PT-048-LTLFireability-04
Product exploration explored 100000 steps with 2948 reset in 251 ms.
Product exploration explored 100000 steps with 2953 reset in 268 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) p1 p2), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (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 p1)), (X (X (NOT p1))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2))))]
Knowledge based reduction with 3 factoid took 326 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 207 steps (0 resets) in 10 ms. (18 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (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 p1)), (X (X (NOT p1))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (F (NOT (AND (NOT p0) p2))), (F (NOT (OR p0 p2))), (F (NOT p1)), (F p0), (F (NOT p2)), (F (NOT (AND p1 p2))), (F (NOT (AND p1 p2)))]
Knowledge based reduction with 3 factoid took 444 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 302 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 208 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Support contains 6 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 48/48 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 82 cols
[2024-05-23 02:04:13] [INFO ] Computed 35 invariants in 2 ms
[2024-05-23 02:04:13] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-23 02:04:13] [INFO ] Invariant cache hit.
[2024-05-23 02:04:13] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
Running 32 sub problems to find dead transitions.
[2024-05-23 02:04:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (OVERLAPS) 31/81 variables, 31/32 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (OVERLAPS) 1/82 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 48/130 variables, 82/117 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 0/130 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 117 constraints, problems are : Problem set: 0 solved, 32 unsolved in 605 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 82/82 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/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (OVERLAPS) 31/81 variables, 31/32 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (OVERLAPS) 1/82 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 48/130 variables, 82/117 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 32/149 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 10 (OVERLAPS) 0/130 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 149 constraints, problems are : Problem set: 0 solved, 32 unsolved in 831 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 82/82 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
After SMT, in 1443ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 1443ms
Finished structural reductions in LTL mode , in 1 iterations and 1575 ms. Remains : 82/82 places, 48/48 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) p1 p2)]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (OR (NOT p1) (NOT p2)))), (X (X (NOT (OR (NOT p1) (NOT p2))))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 280 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 229 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 193 steps (0 resets) in 7 ms. (24 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) p1 p2)]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (OR (NOT p1) (NOT p2)))), (X (X (NOT (OR (NOT p1) (NOT p2))))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND (NOT p0) p2))), (F (NOT (OR p0 p2))), (F (NOT p1)), (F p0), (F (NOT p2)), (F (NOT (AND p1 p2))), (F (NOT (AND p1 p2)))]
Knowledge based reduction with 1 factoid took 468 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 212 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 238 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Product exploration explored 100000 steps with 2957 reset in 250 ms.
Product exploration explored 100000 steps with 2959 reset in 259 ms.
Applying partial POR strategy [true, false, true, false, false]
Stuttering acceptance computed with spot in 226 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Support contains 6 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 48/48 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 82 transition count 48
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 10 place count 82 transition count 48
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 82 transition count 48
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 82 transition count 48
Deduced a syphon composed of 14 places in 0 ms
Applied a total of 14 rules in 11 ms. Remains 82 /82 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2024-05-23 02:04:17] [INFO ] Redundant transitions in 1 ms returned []
Running 32 sub problems to find dead transitions.
// Phase 1: matrix 48 rows 82 cols
[2024-05-23 02:04:17] [INFO ] Computed 35 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (OVERLAPS) 31/81 variables, 31/32 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-05-23 02:04:17] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 5 ms to minimize.
[2024-05-23 02:04:17] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
[2024-05-23 02:04:17] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
Problem TDEAD1 is UNSAT
[2024-05-23 02:04:17] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2024-05-23 02:04:17] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD20 is UNSAT
[2024-05-23 02:04:17] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
Problem TDEAD25 is UNSAT
[2024-05-23 02:04:17] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
[2024-05-23 02:04:17] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 1 ms to minimize.
Problem TDEAD29 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD26 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 8/42 constraints. Problems are: Problem set: 8 solved, 24 unsolved
[2024-05-23 02:04:17] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-05-23 02:04:17] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 2/44 constraints. Problems are: Problem set: 10 solved, 22 unsolved
[2024-05-23 02:04:17] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-05-23 02:04:18] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-05-23 02:04:18] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
Problem TDEAD8 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 3/47 constraints. Problems are: Problem set: 13 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 0/47 constraints. Problems are: Problem set: 13 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 1/82 variables, 1/48 constraints. Problems are: Problem set: 13 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/82 variables, 0/48 constraints. Problems are: Problem set: 13 solved, 19 unsolved
Problem TDEAD4 is UNSAT
At refinement iteration 10 (OVERLAPS) 48/130 variables, 82/130 constraints. Problems are: Problem set: 14 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/130 variables, 0/130 constraints. Problems are: Problem set: 14 solved, 18 unsolved
At refinement iteration 12 (OVERLAPS) 0/130 variables, 0/130 constraints. Problems are: Problem set: 14 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 130 constraints, problems are : Problem set: 14 solved, 18 unsolved in 899 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 82/82 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 14 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 14 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 45/81 variables, 31/31 constraints. Problems are: Problem set: 14 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 3/34 constraints. Problems are: Problem set: 14 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 13/47 constraints. Problems are: Problem set: 14 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/47 constraints. Problems are: Problem set: 14 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 1/82 variables, 1/48 constraints. Problems are: Problem set: 14 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/48 constraints. Problems are: Problem set: 14 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 48/130 variables, 82/130 constraints. Problems are: Problem set: 14 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 18/148 constraints. Problems are: Problem set: 14 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 0/148 constraints. Problems are: Problem set: 14 solved, 18 unsolved
At refinement iteration 10 (OVERLAPS) 0/130 variables, 0/148 constraints. Problems are: Problem set: 14 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 148 constraints, problems are : Problem set: 14 solved, 18 unsolved in 367 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 82/82 constraints, PredecessorRefiner: 18/32 constraints, Known Traps: 13/13 constraints]
After SMT, in 1274ms problems are : Problem set: 14 solved, 18 unsolved
Search for dead transitions found 14 dead transitions in 1275ms
Found 14 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 14 transitions
Dead transitions reduction (with SMT) removed 14 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 82/82 places, 34/48 transitions.
Graph (complete) has 136 edges and 82 vertex of which 68 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 68 /82 variables (removed 14) and now considering 34/34 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 68/82 places, 34/48 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1306 ms. Remains : 68/82 places, 34/48 transitions.
Support contains 6 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 82 /82 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 82 cols
[2024-05-23 02:04:18] [INFO ] Computed 35 invariants in 2 ms
[2024-05-23 02:04:18] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-23 02:04:18] [INFO ] Invariant cache hit.
[2024-05-23 02:04:18] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
Running 32 sub problems to find dead transitions.
[2024-05-23 02:04:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (OVERLAPS) 31/81 variables, 31/32 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (OVERLAPS) 1/82 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 48/130 variables, 82/117 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 0/130 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 117 constraints, problems are : Problem set: 0 solved, 32 unsolved in 580 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 82/82 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/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (OVERLAPS) 31/81 variables, 31/32 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (OVERLAPS) 1/82 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 48/130 variables, 82/117 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 32/149 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 10 (OVERLAPS) 0/130 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 149 constraints, problems are : Problem set: 0 solved, 32 unsolved in 960 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 82/82 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
After SMT, in 1554ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 1555ms
Finished structural reductions in LTL mode , in 1 iterations and 1692 ms. Remains : 82/82 places, 48/48 transitions.
Treatment of property CircularTrains-PT-048-LTLFireability-04 finished in 9632 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))'
Support contains 2 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 48/48 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 89 transition count 45
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 86 transition count 45
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 6 place count 86 transition count 41
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 14 place count 82 transition count 41
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 22 place count 78 transition count 37
Applied a total of 22 rules in 6 ms. Remains 78 /89 variables (removed 11) and now considering 37/48 (removed 11) transitions.
// Phase 1: matrix 37 rows 78 cols
[2024-05-23 02:04:20] [INFO ] Computed 42 invariants in 2 ms
[2024-05-23 02:04:20] [INFO ] Implicit Places using invariants in 204 ms returned [0, 11, 14, 20, 55, 69, 70, 74, 75]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 205 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 69/89 places, 37/48 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 69 transition count 33
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 65 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 64 transition count 32
Applied a total of 10 rules in 3 ms. Remains 64 /69 variables (removed 5) and now considering 32/37 (removed 5) transitions.
// Phase 1: matrix 32 rows 64 cols
[2024-05-23 02:04:20] [INFO ] Computed 33 invariants in 1 ms
[2024-05-23 02:04:20] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-23 02:04:20] [INFO ] Invariant cache hit.
[2024-05-23 02:04:20] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 64/89 places, 32/48 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 396 ms. Remains : 64/89 places, 32/48 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : CircularTrains-PT-048-LTLFireability-05
Product exploration explored 100000 steps with 7860 reset in 237 ms.
Product exploration explored 100000 steps with 7963 reset in 247 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 (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 159 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
RANDOM walk for 60 steps (0 resets) in 4 ms. (12 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 191 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
[2024-05-23 02:04:21] [INFO ] Invariant cache hit.
[2024-05-23 02:04:21] [INFO ] [Real]Absence check using 31 positive place invariants in 4 ms returned sat
[2024-05-23 02:04:21] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-23 02:04:21] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-23 02:04:21] [INFO ] Computed and/alt/rep : 16/32/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-23 02:04:21] [INFO ] Added : 14 causal constraints over 3 iterations in 32 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 32/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 64 /64 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2024-05-23 02:04:21] [INFO ] Invariant cache hit.
[2024-05-23 02:04:22] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-23 02:04:22] [INFO ] Invariant cache hit.
[2024-05-23 02:04:22] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
[2024-05-23 02:04:22] [INFO ] Redundant transitions in 0 ms returned []
Running 16 sub problems to find dead transitions.
[2024-05-23 02:04:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 31/63 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 1/64 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 32/96 variables, 64/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/96 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 96/96 variables, and 97 constraints, problems are : Problem set: 0 solved, 16 unsolved in 255 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 31/63 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 1/64 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 32/96 variables, 64/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 16/113 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/96 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/96 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 96/96 variables, and 113 constraints, problems are : Problem set: 0 solved, 16 unsolved in 338 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 598ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 598ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 717 ms. Remains : 64/64 places, 32/32 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 (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 165 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
RANDOM walk for 91 steps (0 resets) in 5 ms. (15 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 396 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
[2024-05-23 02:04:23] [INFO ] Invariant cache hit.
[2024-05-23 02:04:23] [INFO ] [Real]Absence check using 31 positive place invariants in 4 ms returned sat
[2024-05-23 02:04:23] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-23 02:04:23] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-23 02:04:23] [INFO ] Computed and/alt/rep : 16/32/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-23 02:04:23] [INFO ] Added : 14 causal constraints over 3 iterations in 23 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 7832 reset in 233 ms.
Product exploration explored 100000 steps with 7881 reset in 250 ms.
Support contains 2 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 64 /64 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2024-05-23 02:04:24] [INFO ] Invariant cache hit.
[2024-05-23 02:04:24] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-23 02:04:24] [INFO ] Invariant cache hit.
[2024-05-23 02:04:24] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
[2024-05-23 02:04:24] [INFO ] Redundant transitions in 0 ms returned []
Running 16 sub problems to find dead transitions.
[2024-05-23 02:04:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 31/63 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 1/64 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 32/96 variables, 64/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/96 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 96/96 variables, and 97 constraints, problems are : Problem set: 0 solved, 16 unsolved in 274 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 31/63 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 1/64 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 32/96 variables, 64/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 16/113 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/96 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/96 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 96/96 variables, and 113 constraints, problems are : Problem set: 0 solved, 16 unsolved in 336 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 626ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 628ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 775 ms. Remains : 64/64 places, 32/32 transitions.
Treatment of property CircularTrains-PT-048-LTLFireability-05 finished in 4371 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U G(p1)))'
Support contains 4 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 89 /89 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 89 cols
[2024-05-23 02:04:24] [INFO ] Computed 42 invariants in 1 ms
[2024-05-23 02:04:24] [INFO ] Implicit Places using invariants in 129 ms returned [1, 12, 15, 21, 61, 79, 80, 85, 86]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 138 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 80/89 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 80 /80 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 140 ms. Remains : 80/89 places, 48/48 transitions.
Stuttering acceptance computed with spot in 215 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) p0)]
Running random walk in product with property : CircularTrains-PT-048-LTLFireability-06
Entered a terminal (fully accepting) state of product in 56 steps with 13 reset in 0 ms.
FORMULA CircularTrains-PT-048-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-048-LTLFireability-06 finished in 379 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1)&&F(G(p2)))))'
Support contains 6 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 48/48 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 89 transition count 46
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 87 transition count 46
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 4 place count 87 transition count 41
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 14 place count 82 transition count 41
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 20 place count 79 transition count 38
Applied a total of 20 rules in 13 ms. Remains 79 /89 variables (removed 10) and now considering 38/48 (removed 10) transitions.
// Phase 1: matrix 38 rows 79 cols
[2024-05-23 02:04:25] [INFO ] Computed 42 invariants in 1 ms
[2024-05-23 02:04:25] [INFO ] Implicit Places using invariants in 116 ms returned [0, 11, 14, 20, 55, 70, 71, 75, 76]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 117 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 70/89 places, 38/48 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 70 transition count 35
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 67 transition count 35
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 67 transition count 32
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 64 transition count 32
Applied a total of 12 rules in 4 ms. Remains 64 /70 variables (removed 6) and now considering 32/38 (removed 6) transitions.
// Phase 1: matrix 32 rows 64 cols
[2024-05-23 02:04:25] [INFO ] Computed 33 invariants in 1 ms
[2024-05-23 02:04:25] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-23 02:04:25] [INFO ] Invariant cache hit.
[2024-05-23 02:04:25] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 64/89 places, 32/48 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 267 ms. Remains : 64/89 places, 32/48 transitions.
Stuttering acceptance computed with spot in 170 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : CircularTrains-PT-048-LTLFireability-07
Product exploration explored 100000 steps with 0 reset in 253 ms.
Stack based approach found an accepted trace after 3265 steps with 0 reset with depth 3266 and stack size 3266 in 10 ms.
FORMULA CircularTrains-PT-048-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property CircularTrains-PT-048-LTLFireability-07 finished in 726 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 48/48 transitions.
Applied a total of 0 rules in 0 ms. Remains 89 /89 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 89 cols
[2024-05-23 02:04:25] [INFO ] Computed 42 invariants in 2 ms
[2024-05-23 02:04:26] [INFO ] Implicit Places using invariants in 103 ms returned [1, 12, 15, 21, 61, 79, 80, 85, 86]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 105 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 80/89 places, 48/48 transitions.
Applied a total of 0 rules in 0 ms. Remains 80 /80 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 105 ms. Remains : 80/89 places, 48/48 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-048-LTLFireability-08
Product exploration explored 100000 steps with 2919 reset in 223 ms.
Product exploration explored 100000 steps with 2978 reset in 244 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 (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 86 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 133 steps (0 resets) in 4 ms. (26 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 112 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 123 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 48 rows 80 cols
[2024-05-23 02:04:27] [INFO ] Computed 33 invariants in 0 ms
[2024-05-23 02:04:27] [INFO ] [Real]Absence check using 31 positive place invariants in 5 ms returned sat
[2024-05-23 02:04:27] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-23 02:04:27] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2024-05-23 02:04:27] [INFO ] Computed and/alt/rep : 32/48/32 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-23 02:04:27] [INFO ] Added : 29 causal constraints over 6 iterations in 66 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 80 /80 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2024-05-23 02:04:27] [INFO ] Invariant cache hit.
[2024-05-23 02:04:27] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-23 02:04:27] [INFO ] Invariant cache hit.
[2024-05-23 02:04:27] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
Running 32 sub problems to find dead transitions.
[2024-05-23 02:04:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 31/79 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/80 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 48/128 variables, 80/113 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (OVERLAPS) 0/128 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 113 constraints, problems are : Problem set: 0 solved, 32 unsolved in 535 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 80/80 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/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 31/79 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/80 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 48/128 variables, 80/113 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 32/145 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 0/128 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 145 constraints, problems are : Problem set: 0 solved, 32 unsolved in 779 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 80/80 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
After SMT, in 1321ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 1321ms
Finished structural reductions in LTL mode , in 1 iterations and 1441 ms. Remains : 80/80 places, 48/48 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 81 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 164 steps (0 resets) in 6 ms. (23 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 96 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 108 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-23 02:04:29] [INFO ] Invariant cache hit.
[2024-05-23 02:04:29] [INFO ] [Real]Absence check using 31 positive place invariants in 4 ms returned sat
[2024-05-23 02:04:29] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-23 02:04:29] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2024-05-23 02:04:29] [INFO ] Computed and/alt/rep : 32/48/32 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-23 02:04:29] [INFO ] Added : 29 causal constraints over 6 iterations in 55 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2995 reset in 217 ms.
Product exploration explored 100000 steps with 2957 reset in 250 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 48/48 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 80 transition count 48
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 14 place count 80 transition count 48
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 80 transition count 48
Deduced a syphon composed of 16 places in 0 ms
Applied a total of 16 rules in 5 ms. Remains 80 /80 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2024-05-23 02:04:30] [INFO ] Redundant transitions in 1 ms returned []
Running 32 sub problems to find dead transitions.
// Phase 1: matrix 48 rows 80 cols
[2024-05-23 02:04:30] [INFO ] Computed 33 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 31/79 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-05-23 02:04:30] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-23 02:04:30] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-05-23 02:04:30] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 1 ms to minimize.
[2024-05-23 02:04:30] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
[2024-05-23 02:04:30] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD1 is UNSAT
[2024-05-23 02:04:30] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-05-23 02:04:30] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-23 02:04:30] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2024-05-23 02:04:30] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-05-23 02:04:30] [INFO ] Deduced a trap composed of 2 places in 13 ms of which 1 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-05-23 02:04:30] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-05-23 02:04:30] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-05-23 02:04:30] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD8 is UNSAT
[2024-05-23 02:04:30] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-05-23 02:04:30] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD18 is UNSAT
[2024-05-23 02:04:30] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
Problem TDEAD23 is UNSAT
[2024-05-23 02:04:30] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD24 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 17/49 constraints. Problems are: Problem set: 16 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/49 constraints. Problems are: Problem set: 16 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 1/80 variables, 1/50 constraints. Problems are: Problem set: 16 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 0/50 constraints. Problems are: Problem set: 16 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 48/128 variables, 80/130 constraints. Problems are: Problem set: 16 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 0/130 constraints. Problems are: Problem set: 16 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/128 variables, 0/130 constraints. Problems are: Problem set: 16 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 130 constraints, problems are : Problem set: 16 solved, 16 unsolved in 804 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 80/80 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 16 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 16 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 47/79 variables, 31/31 constraints. Problems are: Problem set: 16 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 1/32 constraints. Problems are: Problem set: 16 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 17/49 constraints. Problems are: Problem set: 16 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/49 constraints. Problems are: Problem set: 16 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 1/80 variables, 1/50 constraints. Problems are: Problem set: 16 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 0/50 constraints. Problems are: Problem set: 16 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 48/128 variables, 80/130 constraints. Problems are: Problem set: 16 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 16/146 constraints. Problems are: Problem set: 16 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/128 variables, 0/146 constraints. Problems are: Problem set: 16 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 0/128 variables, 0/146 constraints. Problems are: Problem set: 16 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 146 constraints, problems are : Problem set: 16 solved, 16 unsolved in 356 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 80/80 constraints, PredecessorRefiner: 16/32 constraints, Known Traps: 17/17 constraints]
After SMT, in 1167ms problems are : Problem set: 16 solved, 16 unsolved
Search for dead transitions found 16 dead transitions in 1168ms
Found 16 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 16 transitions
Dead transitions reduction (with SMT) removed 16 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 80/80 places, 32/48 transitions.
Graph (complete) has 128 edges and 80 vertex of which 64 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.0 ms
Discarding 16 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 1 ms. Remains 64 /80 variables (removed 16) and now considering 32/32 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 64/80 places, 32/48 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1179 ms. Remains : 64/80 places, 32/48 transitions.
Support contains 2 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 48/48 transitions.
Applied a total of 0 rules in 0 ms. Remains 80 /80 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 80 cols
[2024-05-23 02:04:31] [INFO ] Computed 33 invariants in 2 ms
[2024-05-23 02:04:31] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-23 02:04:31] [INFO ] Invariant cache hit.
[2024-05-23 02:04:31] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
Running 32 sub problems to find dead transitions.
[2024-05-23 02:04:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 31/79 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/80 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 48/128 variables, 80/113 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (OVERLAPS) 0/128 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 113 constraints, problems are : Problem set: 0 solved, 32 unsolved in 514 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 80/80 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/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 31/79 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/80 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 48/128 variables, 80/113 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 32/145 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 0/128 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 145 constraints, problems are : Problem set: 0 solved, 32 unsolved in 800 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 80/80 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
After SMT, in 1340ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 1341ms
Finished structural reductions in LTL mode , in 1 iterations and 1493 ms. Remains : 80/80 places, 48/48 transitions.
Treatment of property CircularTrains-PT-048-LTLFireability-08 finished in 7116 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||G(F(!p1)))))'
Support contains 4 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 48/48 transitions.
Applied a total of 0 rules in 0 ms. Remains 89 /89 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 89 cols
[2024-05-23 02:04:33] [INFO ] Computed 42 invariants in 1 ms
[2024-05-23 02:04:33] [INFO ] Implicit Places using invariants in 139 ms returned [1, 12, 15, 21, 61, 79, 80, 85, 86]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 141 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 80/89 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 80 /80 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 142 ms. Remains : 80/89 places, 48/48 transitions.
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, p1]
Running random walk in product with property : CircularTrains-PT-048-LTLFireability-10
Product exploration explored 100000 steps with 2393 reset in 224 ms.
Product exploration explored 100000 steps with 2391 reset in 245 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 p1), (X (X p1))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 267 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p0) p1), p1, p1]
RANDOM walk for 166 steps (0 resets) in 6 ms. (23 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (NOT p0)), (F (NOT p1)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 3 factoid took 333 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 105 ms :[(AND (NOT p0) p1), p1, p1]
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) p1), p1, p1]
Support contains 4 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 48/48 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 80 transition count 35
Reduce places removed 13 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 14 rules applied. Total rules applied 27 place count 67 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 28 place count 66 transition count 34
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 28 place count 66 transition count 32
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 32 place count 64 transition count 32
Applied a total of 32 rules in 5 ms. Remains 64 /80 variables (removed 16) and now considering 32/48 (removed 16) transitions.
// Phase 1: matrix 32 rows 64 cols
[2024-05-23 02:04:34] [INFO ] Computed 33 invariants in 1 ms
[2024-05-23 02:04:34] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-23 02:04:34] [INFO ] Invariant cache hit.
[2024-05-23 02:04:34] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2024-05-23 02:04:34] [INFO ] Redundant transitions in 0 ms returned []
Running 16 sub problems to find dead transitions.
[2024-05-23 02:04:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 31/63 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 1/64 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 32/96 variables, 64/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/96 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 96/96 variables, and 97 constraints, problems are : Problem set: 0 solved, 16 unsolved in 288 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 31/63 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 1/64 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 32/96 variables, 64/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 16/113 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/96 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/96 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 96/96 variables, and 113 constraints, problems are : Problem set: 0 solved, 16 unsolved in 351 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 671ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 674ms
Starting structural reductions in SI_LTL mode, iteration 1 : 64/80 places, 32/48 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 815 ms. Remains : 64/80 places, 32/48 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 p1)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 308 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 100 ms :[(AND (NOT p0) p1), p1, p1]
RANDOM walk for 102 steps (0 resets) in 4 ms. (20 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1), (X p1)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT p1)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 2 factoid took 378 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 101 ms :[(AND (NOT p0) p1), p1, p1]
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) p1), p1, p1]
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) p1), p1, p1]
Product exploration explored 100000 steps with 3159 reset in 233 ms.
Product exploration explored 100000 steps with 3118 reset in 248 ms.
Support contains 4 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 64 /64 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2024-05-23 02:04:37] [INFO ] Invariant cache hit.
[2024-05-23 02:04:37] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-23 02:04:37] [INFO ] Invariant cache hit.
[2024-05-23 02:04:37] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
[2024-05-23 02:04:37] [INFO ] Redundant transitions in 0 ms returned []
Running 16 sub problems to find dead transitions.
[2024-05-23 02:04:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 31/63 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 1/64 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 32/96 variables, 64/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/96 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 96/96 variables, and 97 constraints, problems are : Problem set: 0 solved, 16 unsolved in 222 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 31/63 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 1/64 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 32/96 variables, 64/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 16/113 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/96 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/96 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 96/96 variables, and 113 constraints, problems are : Problem set: 0 solved, 16 unsolved in 335 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 585ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 585ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 738 ms. Remains : 64/64 places, 32/32 transitions.
Treatment of property CircularTrains-PT-048-LTLFireability-10 finished in 4963 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(!p1))))'
Support contains 4 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 48/48 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 89 transition count 46
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 87 transition count 46
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 4 place count 87 transition count 41
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 14 place count 82 transition count 41
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 22 place count 78 transition count 37
Applied a total of 22 rules in 4 ms. Remains 78 /89 variables (removed 11) and now considering 37/48 (removed 11) transitions.
// Phase 1: matrix 37 rows 78 cols
[2024-05-23 02:04:38] [INFO ] Computed 42 invariants in 0 ms
[2024-05-23 02:04:38] [INFO ] Implicit Places using invariants in 58 ms returned [0, 11, 14, 20, 69, 70, 74, 75]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 68 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 70/89 places, 37/48 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 70 transition count 34
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 67 transition count 34
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 66 transition count 33
Applied a total of 8 rules in 2 ms. Remains 66 /70 variables (removed 4) and now considering 33/37 (removed 4) transitions.
// Phase 1: matrix 33 rows 66 cols
[2024-05-23 02:04:38] [INFO ] Computed 34 invariants in 0 ms
[2024-05-23 02:04:38] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-23 02:04:38] [INFO ] Invariant cache hit.
[2024-05-23 02:04:38] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 66/89 places, 33/48 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 237 ms. Remains : 66/89 places, 33/48 transitions.
Stuttering acceptance computed with spot in 30 ms :[(AND p1 (NOT p0))]
Running random walk in product with property : CircularTrains-PT-048-LTLFireability-11
Product exploration explored 100000 steps with 7903 reset in 247 ms.
Product exploration explored 100000 steps with 7970 reset in 262 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 3 factoid took 382 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) p1)]
RANDOM walk for 82 steps (0 resets) in 6 ms. (11 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT (AND (NOT p0) p1))), (F p0)]
Knowledge based reduction with 3 factoid took 447 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p0) p1)]
[2024-05-23 02:04:39] [INFO ] Invariant cache hit.
[2024-05-23 02:04:39] [INFO ] [Real]Absence check using 31 positive place invariants in 4 ms returned sat
[2024-05-23 02:04:39] [INFO ] [Real]Absence check using 31 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-23 02:04:39] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-23 02:04:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:04:39] [INFO ] [Nat]Absence check using 31 positive place invariants in 5 ms returned sat
[2024-05-23 02:04:39] [INFO ] [Nat]Absence check using 31 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-23 02:04:39] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-23 02:04:39] [INFO ] Computed and/alt/rep : 17/33/17 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-23 02:04:39] [INFO ] Added : 15 causal constraints over 3 iterations in 35 ms. Result :sat
Could not prove EG (AND (NOT p0) p1)
Support contains 4 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 33/33 transitions.
Applied a total of 0 rules in 2 ms. Remains 66 /66 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2024-05-23 02:04:39] [INFO ] Invariant cache hit.
[2024-05-23 02:04:39] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-23 02:04:39] [INFO ] Invariant cache hit.
[2024-05-23 02:04:40] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
[2024-05-23 02:04:40] [INFO ] Redundant transitions in 1 ms returned []
Running 17 sub problems to find dead transitions.
[2024-05-23 02:04:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 31/65 variables, 31/32 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 1/66 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 33/99 variables, 66/100 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/99 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 0/99 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 99/99 variables, and 100 constraints, problems are : Problem set: 0 solved, 17 unsolved in 253 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 66/66 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 31/65 variables, 31/32 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 1/66 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 33/99 variables, 66/100 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/99 variables, 17/117 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/99 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 0/99 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 99/99 variables, and 117 constraints, problems are : Problem set: 0 solved, 17 unsolved in 409 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 66/66 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 701ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 702ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 909 ms. Remains : 66/66 places, 33/33 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) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 336 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p0) p1)]
RANDOM walk for 52 steps (0 resets) in 4 ms. (10 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT (AND (NOT p0) p1))), (F p0)]
Knowledge based reduction with 3 factoid took 498 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p0) p1)]
[2024-05-23 02:04:41] [INFO ] Invariant cache hit.
[2024-05-23 02:04:41] [INFO ] [Real]Absence check using 31 positive place invariants in 4 ms returned sat
[2024-05-23 02:04:41] [INFO ] [Real]Absence check using 31 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-23 02:04:41] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-23 02:04:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:04:41] [INFO ] [Nat]Absence check using 31 positive place invariants in 8 ms returned sat
[2024-05-23 02:04:41] [INFO ] [Nat]Absence check using 31 positive and 3 generalized place invariants in 28 ms returned sat
[2024-05-23 02:04:42] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2024-05-23 02:04:42] [INFO ] Computed and/alt/rep : 17/33/17 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-23 02:04:42] [INFO ] Added : 15 causal constraints over 3 iterations in 43 ms. Result :sat
Could not prove EG (AND (NOT p0) p1)
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) p1)]
Product exploration explored 100000 steps with 7897 reset in 249 ms.
Product exploration explored 100000 steps with 7866 reset in 270 ms.
Support contains 4 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 33/33 transitions.
Applied a total of 0 rules in 1 ms. Remains 66 /66 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2024-05-23 02:04:42] [INFO ] Invariant cache hit.
[2024-05-23 02:04:42] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-23 02:04:42] [INFO ] Invariant cache hit.
[2024-05-23 02:04:42] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
[2024-05-23 02:04:42] [INFO ] Redundant transitions in 1 ms returned []
Running 17 sub problems to find dead transitions.
[2024-05-23 02:04:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 31/65 variables, 31/32 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 1/66 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 33/99 variables, 66/100 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/99 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 0/99 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 99/99 variables, and 100 constraints, problems are : Problem set: 0 solved, 17 unsolved in 302 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 66/66 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 31/65 variables, 31/32 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 1/66 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 33/99 variables, 66/100 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/99 variables, 17/117 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/99 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 0/99 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 99/99 variables, and 117 constraints, problems are : Problem set: 0 solved, 17 unsolved in 351 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 66/66 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 702ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 703ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 883 ms. Remains : 66/66 places, 33/33 transitions.
Treatment of property CircularTrains-PT-048-LTLFireability-11 finished in 5524 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(F((p1||G(p2))))))'
Support contains 6 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 89 /89 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 89 cols
[2024-05-23 02:04:43] [INFO ] Computed 42 invariants in 1 ms
[2024-05-23 02:04:43] [INFO ] Implicit Places using invariants in 54 ms returned [1, 12, 15, 21, 80, 85, 86]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 66 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 82/89 places, 48/48 transitions.
Applied a total of 0 rules in 0 ms. Remains 82 /82 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 68 ms. Remains : 82/89 places, 48/48 transitions.
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : CircularTrains-PT-048-LTLFireability-12
Product exploration explored 100000 steps with 7557 reset in 248 ms.
Product exploration explored 100000 steps with 7625 reset in 267 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) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 464 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter sensitive) to 8 states, 21 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 288 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), false, false, false, false, false, false]
RANDOM walk for 1778 steps (0 resets) in 21 ms. (80 steps per ms) remains 0/11 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) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p1) p0 (NOT p2)))), (F (NOT (OR (NOT p1) p0 p2))), (F (NOT (OR p1 (NOT p0) p2))), (F p2), (F (NOT (OR (NOT p1) (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p1) (NOT p0) p2))), (F p0), (F p1), (F (NOT (OR p1 p0 (NOT p2)))), (F (NOT (OR p1 (NOT p0) (NOT p2))))]
Knowledge based reduction with 3 factoid took 738 ms. Reduced automaton from 8 states, 21 edges and 3 AP (stutter insensitive) to 8 states, 21 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 291 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), false, false, false, false, false, false]
Stuttering acceptance computed with spot in 332 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), false, false, false, false, false, false]
// Phase 1: matrix 48 rows 82 cols
[2024-05-23 02:04:46] [INFO ] Computed 35 invariants in 1 ms
[2024-05-23 02:04:46] [INFO ] [Real]Absence check using 30 positive place invariants in 29 ms returned sat
[2024-05-23 02:04:46] [INFO ] [Real]Absence check using 30 positive and 5 generalized place invariants in 4 ms returned sat
[2024-05-23 02:04:46] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2024-05-23 02:04:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:04:46] [INFO ] [Nat]Absence check using 30 positive place invariants in 5 ms returned sat
[2024-05-23 02:04:46] [INFO ] [Nat]Absence check using 30 positive and 5 generalized place invariants in 2 ms returned sat
[2024-05-23 02:04:46] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2024-05-23 02:04:46] [INFO ] Computed and/alt/rep : 32/48/32 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-23 02:04:46] [INFO ] Added : 29 causal constraints over 6 iterations in 56 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0) (NOT p2))
Support contains 6 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 48/48 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 82 transition count 38
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 72 transition count 38
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 20 place count 72 transition count 36
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 24 place count 70 transition count 36
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 28 place count 68 transition count 34
Applied a total of 28 rules in 3 ms. Remains 68 /82 variables (removed 14) and now considering 34/48 (removed 14) transitions.
// Phase 1: matrix 34 rows 68 cols
[2024-05-23 02:04:46] [INFO ] Computed 35 invariants in 0 ms
[2024-05-23 02:04:46] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-05-23 02:04:46] [INFO ] Invariant cache hit.
[2024-05-23 02:04:46] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
[2024-05-23 02:04:46] [INFO ] Redundant transitions in 0 ms returned []
Running 18 sub problems to find dead transitions.
[2024-05-23 02:04:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (OVERLAPS) 30/66 variables, 30/32 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 2/68 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 34/102 variables, 68/103 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 0/102 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 102/102 variables, and 103 constraints, problems are : Problem set: 0 solved, 18 unsolved in 317 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (OVERLAPS) 30/66 variables, 30/32 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 2/68 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 34/102 variables, 68/103 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 18/121 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (OVERLAPS) 0/102 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 102/102 variables, and 121 constraints, problems are : Problem set: 0 solved, 18 unsolved in 315 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
After SMT, in 674ms problems are : Problem set: 0 solved, 18 unsolved
Search for dead transitions found 0 dead transitions in 675ms
Starting structural reductions in SI_LTL mode, iteration 1 : 68/82 places, 34/48 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 858 ms. Remains : 68/82 places, 34/48 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND p1 p0 p2))), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT p0)), (X (NOT (AND (NOT p1) p0 p2))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND (NOT p1) p0 p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (AND p1 (NOT p0) (NOT p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (AND (NOT p1) (NOT p0) p2)), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p1 (NOT p0) p2))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 10 factoid took 1075 ms. Reduced automaton from 8 states, 21 edges and 3 AP (stutter insensitive) to 8 states, 21 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 310 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), false, false, false, false, false, false]
RANDOM walk for 810 steps (0 resets) in 10 ms. (73 steps per ms) remains 0/11 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND p1 p0 p2))), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT p0)), (X (NOT (AND (NOT p1) p0 p2))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND (NOT p1) p0 p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (AND p1 (NOT p0) (NOT p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (AND (NOT p1) (NOT p0) p2)), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p1 (NOT p0) p2))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p1) p0 (NOT p2)))), (F (NOT (OR (NOT p1) p0 p2))), (F (NOT (OR p1 (NOT p0) p2))), (F p2), (F (NOT (OR (NOT p1) (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p1) (NOT p0) p2))), (F p0), (F p1), (F (NOT (OR p1 p0 (NOT p2)))), (F (NOT (OR p1 (NOT p0) (NOT p2))))]
Knowledge based reduction with 10 factoid took 1450 ms. Reduced automaton from 8 states, 21 edges and 3 AP (stutter insensitive) to 8 states, 21 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 328 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), false, false, false, false, false, false]
Stuttering acceptance computed with spot in 302 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), false, false, false, false, false, false]
[2024-05-23 02:04:51] [INFO ] Invariant cache hit.
[2024-05-23 02:04:51] [INFO ] [Real]Absence check using 30 positive place invariants in 4 ms returned sat
[2024-05-23 02:04:51] [INFO ] [Real]Absence check using 30 positive and 5 generalized place invariants in 2 ms returned sat
[2024-05-23 02:04:51] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-23 02:04:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:04:51] [INFO ] [Nat]Absence check using 30 positive place invariants in 4 ms returned sat
[2024-05-23 02:04:51] [INFO ] [Nat]Absence check using 30 positive and 5 generalized place invariants in 2 ms returned sat
[2024-05-23 02:04:51] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-05-23 02:04:51] [INFO ] Computed and/alt/rep : 18/34/18 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-23 02:04:51] [INFO ] Added : 16 causal constraints over 4 iterations in 25 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 472 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), false, false, false, false, false, false]
Product exploration explored 100000 steps with 10794 reset in 264 ms.
Product exploration explored 100000 steps with 10796 reset in 286 ms.
Support contains 6 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 34/34 transitions.
Applied a total of 0 rules in 1 ms. Remains 68 /68 variables (removed 0) and now considering 34/34 (removed 0) transitions.
[2024-05-23 02:04:52] [INFO ] Invariant cache hit.
[2024-05-23 02:04:52] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-23 02:04:52] [INFO ] Invariant cache hit.
[2024-05-23 02:04:52] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
[2024-05-23 02:04:52] [INFO ] Redundant transitions in 0 ms returned []
Running 18 sub problems to find dead transitions.
[2024-05-23 02:04:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (OVERLAPS) 30/66 variables, 30/32 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 2/68 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 34/102 variables, 68/103 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 0/102 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 102/102 variables, and 103 constraints, problems are : Problem set: 0 solved, 18 unsolved in 274 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (OVERLAPS) 30/66 variables, 30/32 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 2/68 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 34/102 variables, 68/103 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 18/121 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (OVERLAPS) 0/102 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 102/102 variables, and 121 constraints, problems are : Problem set: 0 solved, 18 unsolved in 330 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
After SMT, in 661ms problems are : Problem set: 0 solved, 18 unsolved
Search for dead transitions found 0 dead transitions in 662ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 846 ms. Remains : 68/68 places, 34/34 transitions.
Treatment of property CircularTrains-PT-048-LTLFireability-12 finished in 9720 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))'
Support contains 2 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 48/48 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 89 transition count 45
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 86 transition count 45
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 6 place count 86 transition count 41
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 14 place count 82 transition count 41
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 20 place count 79 transition count 38
Applied a total of 20 rules in 4 ms. Remains 79 /89 variables (removed 10) and now considering 38/48 (removed 10) transitions.
// Phase 1: matrix 38 rows 79 cols
[2024-05-23 02:04:53] [INFO ] Computed 42 invariants in 0 ms
[2024-05-23 02:04:53] [INFO ] Implicit Places using invariants in 82 ms returned [1, 12, 15, 21, 56, 70, 71, 75, 76]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 84 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 70/89 places, 38/48 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 70 transition count 34
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 66 transition count 34
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 8 place count 66 transition count 32
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 12 place count 64 transition count 32
Applied a total of 12 rules in 2 ms. Remains 64 /70 variables (removed 6) and now considering 32/38 (removed 6) transitions.
// Phase 1: matrix 32 rows 64 cols
[2024-05-23 02:04:53] [INFO ] Computed 33 invariants in 0 ms
[2024-05-23 02:04:53] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-23 02:04:53] [INFO ] Invariant cache hit.
[2024-05-23 02:04:53] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 64/89 places, 32/48 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 244 ms. Remains : 64/89 places, 32/48 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : CircularTrains-PT-048-LTLFireability-13
Product exploration explored 100000 steps with 5621 reset in 213 ms.
Product exploration explored 100000 steps with 5688 reset in 248 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 based reduction with 2 factoid took 197 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
RANDOM walk for 50 steps (0 resets) in 4 ms. (10 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 131 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
[2024-05-23 02:04:54] [INFO ] Invariant cache hit.
[2024-05-23 02:04:54] [INFO ] [Real]Absence check using 31 positive place invariants in 4 ms returned sat
[2024-05-23 02:04:54] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-23 02:04:54] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-23 02:04:54] [INFO ] Computed and/alt/rep : 16/32/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-23 02:04:54] [INFO ] Added : 14 causal constraints over 3 iterations in 23 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 32/32 transitions.
Applied a total of 0 rules in 3 ms. Remains 64 /64 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2024-05-23 02:04:54] [INFO ] Invariant cache hit.
[2024-05-23 02:04:54] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-23 02:04:54] [INFO ] Invariant cache hit.
[2024-05-23 02:04:54] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
[2024-05-23 02:04:54] [INFO ] Redundant transitions in 0 ms returned []
Running 16 sub problems to find dead transitions.
[2024-05-23 02:04:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 31/63 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 1/64 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 32/96 variables, 64/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/96 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 96/96 variables, and 97 constraints, problems are : Problem set: 0 solved, 16 unsolved in 218 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 31/63 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 1/64 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 32/96 variables, 64/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 16/113 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/96 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/96 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 96/96 variables, and 113 constraints, problems are : Problem set: 0 solved, 16 unsolved in 320 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 597ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 597ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 766 ms. Remains : 64/64 places, 32/32 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 106 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
RANDOM walk for 66 steps (0 resets) in 5 ms. (11 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 124 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
[2024-05-23 02:04:55] [INFO ] Invariant cache hit.
[2024-05-23 02:04:55] [INFO ] [Real]Absence check using 31 positive place invariants in 3 ms returned sat
[2024-05-23 02:04:55] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-23 02:04:55] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-23 02:04:55] [INFO ] Computed and/alt/rep : 16/32/16 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-23 02:04:55] [INFO ] Added : 14 causal constraints over 3 iterations in 23 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Product exploration explored 100000 steps with 5615 reset in 223 ms.
Product exploration explored 100000 steps with 5675 reset in 239 ms.
Support contains 2 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 64 /64 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2024-05-23 02:04:56] [INFO ] Invariant cache hit.
[2024-05-23 02:04:56] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-23 02:04:56] [INFO ] Invariant cache hit.
[2024-05-23 02:04:56] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
[2024-05-23 02:04:56] [INFO ] Redundant transitions in 0 ms returned []
Running 16 sub problems to find dead transitions.
[2024-05-23 02:04:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 31/63 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 1/64 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 32/96 variables, 64/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/96 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 96/96 variables, and 97 constraints, problems are : Problem set: 0 solved, 16 unsolved in 260 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 31/63 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 1/64 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 32/96 variables, 64/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 16/113 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/96 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/96 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 96/96 variables, and 113 constraints, problems are : Problem set: 0 solved, 16 unsolved in 564 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 851ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 851ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 994 ms. Remains : 64/64 places, 32/32 transitions.
Treatment of property CircularTrains-PT-048-LTLFireability-13 finished in 4040 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0&&X(p1))))'
Support contains 6 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 48/48 transitions.
Applied a total of 0 rules in 0 ms. Remains 89 /89 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 89 cols
[2024-05-23 02:04:57] [INFO ] Computed 42 invariants in 0 ms
[2024-05-23 02:04:57] [INFO ] Implicit Places using invariants in 56 ms returned [1, 12, 15, 21, 61, 79, 85, 86]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 67 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 81/89 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 81 /81 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 68 ms. Remains : 81/89 places, 48/48 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p1), (OR (NOT p1) p0), (OR (NOT p1) p0), true]
Running random walk in product with property : CircularTrains-PT-048-LTLFireability-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CircularTrains-PT-048-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-048-LTLFireability-15 finished in 184 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X((p1&&G(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' '!(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(X(F(p0))))'
Found a Shortening insensitive property : CircularTrains-PT-048-LTLFireability-08
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 89 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 89/89 places, 48/48 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 89 transition count 45
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 86 transition count 45
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 6 place count 86 transition count 41
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 14 place count 82 transition count 41
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 20 place count 79 transition count 38
Applied a total of 20 rules in 4 ms. Remains 79 /89 variables (removed 10) and now considering 38/48 (removed 10) transitions.
// Phase 1: matrix 38 rows 79 cols
[2024-05-23 02:04:58] [INFO ] Computed 42 invariants in 1 ms
[2024-05-23 02:04:58] [INFO ] Implicit Places using invariants in 69 ms returned [0, 11, 14, 20, 56, 70, 71, 75, 76]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 69 ms to find 9 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 70/89 places, 38/48 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 70 transition count 34
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 66 transition count 34
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 8 place count 66 transition count 32
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 12 place count 64 transition count 32
Applied a total of 12 rules in 9 ms. Remains 64 /70 variables (removed 6) and now considering 32/38 (removed 6) transitions.
// Phase 1: matrix 32 rows 64 cols
[2024-05-23 02:04:58] [INFO ] Computed 33 invariants in 0 ms
[2024-05-23 02:04:58] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-23 02:04:58] [INFO ] Invariant cache hit.
[2024-05-23 02:04:58] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 64/89 places, 32/48 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 220 ms. Remains : 64/89 places, 32/48 transitions.
Running random walk in product with property : CircularTrains-PT-048-LTLFireability-08
Product exploration explored 100000 steps with 5592 reset in 224 ms.
Product exploration explored 100000 steps with 5667 reset in 234 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 128 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 194 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 85 steps (0 resets) in 4 ms. (17 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 124 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 89 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-23 02:04:59] [INFO ] Invariant cache hit.
[2024-05-23 02:04:59] [INFO ] [Real]Absence check using 31 positive place invariants in 4 ms returned sat
[2024-05-23 02:04:59] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-23 02:04:59] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-23 02:04:59] [INFO ] Computed and/alt/rep : 16/32/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-23 02:04:59] [INFO ] Added : 14 causal constraints over 3 iterations in 26 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 64 /64 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2024-05-23 02:04:59] [INFO ] Invariant cache hit.
[2024-05-23 02:04:59] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-23 02:04:59] [INFO ] Invariant cache hit.
[2024-05-23 02:04:59] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
Running 16 sub problems to find dead transitions.
[2024-05-23 02:04:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 31/63 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 1/64 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 32/96 variables, 64/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/96 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 96/96 variables, and 97 constraints, problems are : Problem set: 0 solved, 16 unsolved in 246 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 31/63 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 1/64 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 32/96 variables, 64/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 16/113 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/96 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/96 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 96/96 variables, and 113 constraints, problems are : Problem set: 0 solved, 16 unsolved in 382 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 655ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 656ms
Finished structural reductions in LTL mode , in 1 iterations and 899 ms. Remains : 64/64 places, 32/32 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 114 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 96 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 93 steps (0 resets) in 4 ms. (18 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 139 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 94 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-23 02:05:00] [INFO ] Invariant cache hit.
[2024-05-23 02:05:01] [INFO ] [Real]Absence check using 31 positive place invariants in 4 ms returned sat
[2024-05-23 02:05:01] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-23 02:05:01] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-23 02:05:01] [INFO ] Computed and/alt/rep : 16/32/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-23 02:05:01] [INFO ] Added : 14 causal constraints over 3 iterations in 24 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 5613 reset in 234 ms.
Product exploration explored 100000 steps with 5694 reset in 250 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 64 /64 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2024-05-23 02:05:01] [INFO ] Redundant transitions in 0 ms returned []
Running 16 sub problems to find dead transitions.
[2024-05-23 02:05:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 31/63 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 1/64 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 32/96 variables, 64/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/96 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 96/96 variables, and 97 constraints, problems are : Problem set: 0 solved, 16 unsolved in 235 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 31/63 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 1/64 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 32/96 variables, 64/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 16/113 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/96 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/96 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 96/96 variables, and 113 constraints, problems are : Problem set: 0 solved, 16 unsolved in 350 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 626ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 626ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 632 ms. Remains : 64/64 places, 32/32 transitions.
Support contains 2 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 64 /64 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2024-05-23 02:05:02] [INFO ] Invariant cache hit.
[2024-05-23 02:05:02] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-23 02:05:02] [INFO ] Invariant cache hit.
[2024-05-23 02:05:02] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
Running 16 sub problems to find dead transitions.
[2024-05-23 02:05:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 31/63 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 1/64 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 32/96 variables, 64/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/96 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 96/96 variables, and 97 constraints, problems are : Problem set: 0 solved, 16 unsolved in 229 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 31/63 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 1/64 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 32/96 variables, 64/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 16/113 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/96 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/96 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 96/96 variables, and 113 constraints, problems are : Problem set: 0 solved, 16 unsolved in 350 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 584ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 584ms
Finished structural reductions in LTL mode , in 1 iterations and 712 ms. Remains : 64/64 places, 32/32 transitions.
Treatment of property CircularTrains-PT-048-LTLFireability-08 finished in 5330 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||G(F(!p1)))))'
Found a Lengthening insensitive property : CircularTrains-PT-048-LTLFireability-10
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, p1]
Support contains 4 out of 89 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 89/89 places, 48/48 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 89 transition count 45
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 86 transition count 45
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 6 place count 86 transition count 41
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 14 place count 82 transition count 41
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 22 place count 78 transition count 37
Applied a total of 22 rules in 3 ms. Remains 78 /89 variables (removed 11) and now considering 37/48 (removed 11) transitions.
// Phase 1: matrix 37 rows 78 cols
[2024-05-23 02:05:03] [INFO ] Computed 42 invariants in 0 ms
[2024-05-23 02:05:03] [INFO ] Implicit Places using invariants in 107 ms returned [0, 11, 14, 20, 55, 69, 70, 74, 75]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 108 ms to find 9 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 69/89 places, 37/48 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 69 transition count 34
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 66 transition count 34
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 6 place count 66 transition count 32
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 10 place count 64 transition count 32
Applied a total of 10 rules in 1 ms. Remains 64 /69 variables (removed 5) and now considering 32/37 (removed 5) transitions.
// Phase 1: matrix 32 rows 64 cols
[2024-05-23 02:05:03] [INFO ] Computed 33 invariants in 0 ms
[2024-05-23 02:05:03] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-23 02:05:03] [INFO ] Invariant cache hit.
[2024-05-23 02:05:03] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 64/89 places, 32/48 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 257 ms. Remains : 64/89 places, 32/48 transitions.
Running random walk in product with property : CircularTrains-PT-048-LTLFireability-10
Product exploration explored 100000 steps with 3158 reset in 229 ms.
Product exploration explored 100000 steps with 3138 reset in 252 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 p1)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 287 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) p1), p1, p1]
RANDOM walk for 97 steps (0 resets) in 4 ms. (19 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1), (X p1)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT p1)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 2 factoid took 378 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 93 ms :[(AND (NOT p0) p1), p1, p1]
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) p1), p1, p1]
Support contains 4 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 64 /64 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2024-05-23 02:05:05] [INFO ] Invariant cache hit.
[2024-05-23 02:05:05] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-23 02:05:05] [INFO ] Invariant cache hit.
[2024-05-23 02:05:05] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
[2024-05-23 02:05:05] [INFO ] Redundant transitions in 1 ms returned []
Running 16 sub problems to find dead transitions.
[2024-05-23 02:05:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 31/63 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 1/64 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 32/96 variables, 64/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/96 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 96/96 variables, and 97 constraints, problems are : Problem set: 0 solved, 16 unsolved in 237 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 31/63 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 1/64 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 32/96 variables, 64/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 16/113 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/96 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/96 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 96/96 variables, and 113 constraints, problems are : Problem set: 0 solved, 16 unsolved in 354 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 607ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 607ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 761 ms. Remains : 64/64 places, 32/32 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 p1)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 301 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 106 ms :[(AND (NOT p0) p1), p1, p1]
RANDOM walk for 109 steps (0 resets) in 6 ms. (15 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1), (X p1)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT p1)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 2 factoid took 370 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 104 ms :[(AND (NOT p0) p1), p1, p1]
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) p1), p1, p1]
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) p1), p1, p1]
Product exploration explored 100000 steps with 3181 reset in 230 ms.
Product exploration explored 100000 steps with 3144 reset in 252 ms.
Support contains 4 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 64 /64 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2024-05-23 02:05:07] [INFO ] Invariant cache hit.
[2024-05-23 02:05:07] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-23 02:05:07] [INFO ] Invariant cache hit.
[2024-05-23 02:05:07] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
[2024-05-23 02:05:07] [INFO ] Redundant transitions in 1 ms returned []
Running 16 sub problems to find dead transitions.
[2024-05-23 02:05:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 31/63 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 1/64 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 32/96 variables, 64/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/96 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 96/96 variables, and 97 constraints, problems are : Problem set: 0 solved, 16 unsolved in 313 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 31/63 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 1/64 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 32/96 variables, 64/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 16/113 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/96 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/96 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 96/96 variables, and 113 constraints, problems are : Problem set: 0 solved, 16 unsolved in 397 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 743ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 745ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 943 ms. Remains : 64/64 places, 32/32 transitions.
Treatment of property CircularTrains-PT-048-LTLFireability-10 finished in 5309 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(!p1))))'
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(F((p1||G(p2))))))'
Found a Shortening insensitive property : CircularTrains-PT-048-LTLFireability-12
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 6 out of 89 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 89/89 places, 48/48 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 89 transition count 45
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 86 transition count 45
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 6 place count 86 transition count 41
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 14 place count 82 transition count 41
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 20 place count 79 transition count 38
Applied a total of 20 rules in 4 ms. Remains 79 /89 variables (removed 10) and now considering 38/48 (removed 10) transitions.
// Phase 1: matrix 38 rows 79 cols
[2024-05-23 02:05:08] [INFO ] Computed 42 invariants in 1 ms
[2024-05-23 02:05:08] [INFO ] Implicit Places using invariants in 57 ms returned [0, 11, 14, 20, 71, 75, 76]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 72 ms to find 7 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 72/89 places, 38/48 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 72 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 71 transition count 37
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 71 transition count 35
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 69 transition count 35
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 68 transition count 34
Applied a total of 8 rules in 8 ms. Remains 68 /72 variables (removed 4) and now considering 34/38 (removed 4) transitions.
// Phase 1: matrix 34 rows 68 cols
[2024-05-23 02:05:08] [INFO ] Computed 35 invariants in 0 ms
[2024-05-23 02:05:08] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-23 02:05:08] [INFO ] Invariant cache hit.
[2024-05-23 02:05:09] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 68/89 places, 34/48 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 240 ms. Remains : 68/89 places, 34/48 transitions.
Running random walk in product with property : CircularTrains-PT-048-LTLFireability-12
Product exploration explored 100000 steps with 10818 reset in 263 ms.
Product exploration explored 100000 steps with 10676 reset in 287 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))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 671 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter sensitive) to 8 states, 21 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 359 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), false, false, false, false, false, false]
RANDOM walk for 980 steps (0 resets) in 14 ms. (65 steps per ms) remains 0/11 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p1) p0 (NOT p2)))), (F (NOT (OR (NOT p1) p0 p2))), (F (NOT (OR p1 (NOT p0) p2))), (F p2), (F (NOT (OR (NOT p1) (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p1) (NOT p0) p2))), (F p0), (F p1), (F (NOT (OR p1 p0 (NOT p2)))), (F (NOT (OR p1 (NOT p0) (NOT p2))))]
Knowledge based reduction with 2 factoid took 924 ms. Reduced automaton from 8 states, 21 edges and 3 AP (stutter insensitive) to 8 states, 21 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 342 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), false, false, false, false, false, false]
Stuttering acceptance computed with spot in 337 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), false, false, false, false, false, false]
[2024-05-23 02:05:12] [INFO ] Invariant cache hit.
[2024-05-23 02:05:12] [INFO ] [Real]Absence check using 30 positive place invariants in 4 ms returned sat
[2024-05-23 02:05:12] [INFO ] [Real]Absence check using 30 positive and 5 generalized place invariants in 2 ms returned sat
[2024-05-23 02:05:12] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-23 02:05:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:05:12] [INFO ] [Nat]Absence check using 30 positive place invariants in 4 ms returned sat
[2024-05-23 02:05:12] [INFO ] [Nat]Absence check using 30 positive and 5 generalized place invariants in 2 ms returned sat
[2024-05-23 02:05:12] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-23 02:05:12] [INFO ] Computed and/alt/rep : 18/34/18 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-23 02:05:12] [INFO ] Added : 13 causal constraints over 3 iterations in 23 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0) (NOT p2))
Support contains 6 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 34/34 transitions.
Applied a total of 0 rules in 1 ms. Remains 68 /68 variables (removed 0) and now considering 34/34 (removed 0) transitions.
[2024-05-23 02:05:12] [INFO ] Invariant cache hit.
[2024-05-23 02:05:12] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-23 02:05:12] [INFO ] Invariant cache hit.
[2024-05-23 02:05:12] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2024-05-23 02:05:12] [INFO ] Redundant transitions in 0 ms returned []
Running 18 sub problems to find dead transitions.
[2024-05-23 02:05:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (OVERLAPS) 30/66 variables, 30/32 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 2/68 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 34/102 variables, 68/103 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 0/102 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 102/102 variables, and 103 constraints, problems are : Problem set: 0 solved, 18 unsolved in 300 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (OVERLAPS) 30/66 variables, 30/32 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 2/68 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 34/102 variables, 68/103 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 18/121 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (OVERLAPS) 0/102 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 102/102 variables, and 121 constraints, problems are : Problem set: 0 solved, 18 unsolved in 313 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
After SMT, in 618ms problems are : Problem set: 0 solved, 18 unsolved
Search for dead transitions found 0 dead transitions in 618ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 738 ms. Remains : 68/68 places, 34/34 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND p1 p0 p2))), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT p0)), (X (NOT (AND (NOT p1) p0 p2))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND (NOT p1) p0 p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (AND p1 (NOT p0) (NOT p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (AND (NOT p1) (NOT p0) p2)), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p1 (NOT p0) p2))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 10 factoid took 1095 ms. Reduced automaton from 8 states, 21 edges and 3 AP (stutter insensitive) to 8 states, 21 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 468 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), false, false, false, false, false, false]
RANDOM walk for 829 steps (0 resets) in 12 ms. (63 steps per ms) remains 0/11 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND p1 p0 p2))), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT p0)), (X (NOT (AND (NOT p1) p0 p2))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND (NOT p1) p0 p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (AND p1 (NOT p0) (NOT p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (AND (NOT p1) (NOT p0) p2)), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p1 (NOT p0) p2))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p1) p0 (NOT p2)))), (F (NOT (OR (NOT p1) p0 p2))), (F (NOT (OR p1 (NOT p0) p2))), (F p2), (F (NOT (OR (NOT p1) (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p1) (NOT p0) p2))), (F p0), (F p1), (F (NOT (OR p1 p0 (NOT p2)))), (F (NOT (OR p1 (NOT p0) (NOT p2))))]
Knowledge based reduction with 10 factoid took 1467 ms. Reduced automaton from 8 states, 21 edges and 3 AP (stutter insensitive) to 8 states, 21 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 379 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), false, false, false, false, false, false]
Stuttering acceptance computed with spot in 365 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), false, false, false, false, false, false]
[2024-05-23 02:05:17] [INFO ] Invariant cache hit.
[2024-05-23 02:05:17] [INFO ] [Real]Absence check using 30 positive place invariants in 5 ms returned sat
[2024-05-23 02:05:17] [INFO ] [Real]Absence check using 30 positive and 5 generalized place invariants in 2 ms returned sat
[2024-05-23 02:05:17] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-23 02:05:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:05:17] [INFO ] [Nat]Absence check using 30 positive place invariants in 4 ms returned sat
[2024-05-23 02:05:17] [INFO ] [Nat]Absence check using 30 positive and 5 generalized place invariants in 1 ms returned sat
[2024-05-23 02:05:17] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-23 02:05:17] [INFO ] Computed and/alt/rep : 18/34/18 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-23 02:05:17] [INFO ] Added : 13 causal constraints over 3 iterations in 36 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 393 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), false, false, false, false, false, false]
Product exploration explored 100000 steps with 10740 reset in 270 ms.
Product exploration explored 100000 steps with 10775 reset in 289 ms.
Support contains 6 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 34/34 transitions.
Applied a total of 0 rules in 1 ms. Remains 68 /68 variables (removed 0) and now considering 34/34 (removed 0) transitions.
[2024-05-23 02:05:18] [INFO ] Invariant cache hit.
[2024-05-23 02:05:18] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-23 02:05:18] [INFO ] Invariant cache hit.
[2024-05-23 02:05:18] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2024-05-23 02:05:18] [INFO ] Redundant transitions in 1 ms returned []
Running 18 sub problems to find dead transitions.
[2024-05-23 02:05:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (OVERLAPS) 30/66 variables, 30/32 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 2/68 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 34/102 variables, 68/103 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 0/102 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 102/102 variables, and 103 constraints, problems are : Problem set: 0 solved, 18 unsolved in 287 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (OVERLAPS) 30/66 variables, 30/32 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 2/68 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 34/102 variables, 68/103 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 18/121 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (OVERLAPS) 0/102 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 102/102 variables, and 121 constraints, problems are : Problem set: 0 solved, 18 unsolved in 321 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
After SMT, in 613ms problems are : Problem set: 0 solved, 18 unsolved
Search for dead transitions found 0 dead transitions in 613ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 748 ms. Remains : 68/68 places, 34/34 transitions.
Treatment of property CircularTrains-PT-048-LTLFireability-12 finished in 10277 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))'
[2024-05-23 02:05:19] [INFO ] Flatten gal took : 7 ms
[2024-05-23 02:05:19] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-23 02:05:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 89 places, 48 transitions and 178 arcs took 1 ms.
Total runtime 83814 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running CircularTrains-PT-048
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/421/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 89
TRANSITIONS: 48
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.002s, Sys 0.000s]
SAVING FILE /home/mcc/execution/421/model (.net / .def) ...
EXPORT TIME: [User 0.000s, 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: 4170
MODEL NAME: /home/mcc/execution/421/model
89 places, 48 transitions.
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.
Creating all event NSFs..
Building monolithic NSF...
FORMULA CircularTrains-PT-048-LTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CircularTrains-PT-048-LTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CircularTrains-PT-048-LTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CircularTrains-PT-048-LTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CircularTrains-PT-048-LTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CircularTrains-PT-048-LTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CircularTrains-PT-048-LTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CircularTrains-PT-048-LTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CircularTrains-PT-048-LTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716430349906
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
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-048"
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-048, 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-171620504300340"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CircularTrains-PT-048.tgz
mv CircularTrains-PT-048 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 '
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 ;