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

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

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717204869100

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CircularTrains-PT-096
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 01:21:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 01:21:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 01:21:10] [INFO ] Load time of PNML (sax parser for PT used): 59 ms
[2024-06-01 01:21:10] [INFO ] Transformed 192 places.
[2024-06-01 01:21:10] [INFO ] Transformed 96 transitions.
[2024-06-01 01:21:10] [INFO ] Parsed PT model containing 192 places and 96 transitions and 384 arcs in 153 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CircularTrains-PT-096-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-096-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 50 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 96/96 transitions.
Applied a total of 0 rules in 18 ms. Remains 192 /192 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 192 cols
[2024-06-01 01:21:10] [INFO ] Computed 97 invariants in 17 ms
[2024-06-01 01:21:10] [INFO ] Implicit Places using invariants in 314 ms returned [1, 4, 8, 10, 14, 20, 27, 29, 39, 49, 109, 115, 116, 123, 125, 144, 155, 162, 174, 177, 182, 183, 186, 189]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 344 ms to find 24 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 168/192 places, 96/96 transitions.
Applied a total of 0 rules in 7 ms. Remains 168 /168 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 383 ms. Remains : 168/192 places, 96/96 transitions.
Support contains 50 out of 168 places after structural reductions.
[2024-06-01 01:21:11] [INFO ] Flatten gal took : 27 ms
[2024-06-01 01:21:11] [INFO ] Flatten gal took : 11 ms
[2024-06-01 01:21:11] [INFO ] Input system was already deterministic with 96 transitions.
Support contains 48 out of 168 places (down from 50) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 27 to 25
RANDOM walk for 406 steps (0 resets) in 48 ms. (8 steps per ms) remains 0/25 properties
FORMULA CircularTrains-PT-096-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||(F((G(p2)&&p1))&&F(p0))))'
Support contains 6 out of 168 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 168/168 places, 96/96 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 168 transition count 80
Reduce places removed 16 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 17 rules applied. Total rules applied 33 place count 152 transition count 79
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 34 place count 151 transition count 79
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 34 place count 151 transition count 73
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 46 place count 145 transition count 73
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 58 place count 139 transition count 67
Applied a total of 58 rules in 44 ms. Remains 139 /168 variables (removed 29) and now considering 67/96 (removed 29) transitions.
// Phase 1: matrix 67 rows 139 cols
[2024-06-01 01:21:11] [INFO ] Computed 73 invariants in 7 ms
[2024-06-01 01:21:11] [INFO ] Implicit Places using invariants in 128 ms returned [2, 23, 120, 122, 124, 130, 135, 136]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 129 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 131/168 places, 67/96 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 131 transition count 65
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 129 transition count 64
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 128 transition count 64
Applied a total of 6 rules in 7 ms. Remains 128 /131 variables (removed 3) and now considering 64/67 (removed 3) transitions.
// Phase 1: matrix 64 rows 128 cols
[2024-06-01 01:21:11] [INFO ] Computed 65 invariants in 1 ms
[2024-06-01 01:21:11] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-06-01 01:21:11] [INFO ] Invariant cache hit.
[2024-06-01 01:21:12] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 128/168 places, 64/96 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 398 ms. Remains : 128/168 places, 64/96 transitions.
Stuttering acceptance computed with spot in 478 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CircularTrains-PT-096-LTLFireability-00
Product exploration explored 100000 steps with 0 reset in 493 ms.
Product exploration explored 100000 steps with 0 reset in 525 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND p1 p2 p0))), (X (NOT p1)), (X (X (NOT (AND p1 p2 (NOT p0)))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) p0))), (X (AND p2 (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (OR (AND (NOT p1) p0) (AND (NOT p2) p0))), (X (NOT (OR (AND (NOT p1) p0) (AND (NOT p2) p0)))), (X (AND p2 p0)), (X (NOT (AND p2 p0))), (X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0)))), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))))), (X p0), (X (NOT p0)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (OR (AND (NOT p1) p0) (AND (NOT p2) p0)))), (X (X (NOT (OR (AND (NOT p1) p0) (AND (NOT p2) p0))))), (X (X (AND p1 p2 p0))), (X (X (NOT (AND p1 p2 p0)))), (X (X (AND p2 p0))), (X (X (NOT (AND p2 p0)))), (X (X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0)))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 6 factoid took 995 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter insensitive) to 5 states, 16 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 211 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), false, false]
RANDOM walk for 1036 steps (0 resets) in 46 ms. (22 steps per ms) remains 0/11 properties
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND p1 p2 p0))), (X (NOT p1)), (X (X (NOT (AND p1 p2 (NOT p0)))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) p0))), (X (AND p2 (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (OR (AND (NOT p1) p0) (AND (NOT p2) p0))), (X (NOT (OR (AND (NOT p1) p0) (AND (NOT p2) p0)))), (X (AND p2 p0)), (X (NOT (AND p2 p0))), (X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0)))), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))))), (X p0), (X (NOT p0)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (OR (AND (NOT p1) p0) (AND (NOT p2) p0)))), (X (X (NOT (OR (AND (NOT p1) p0) (AND (NOT p2) p0))))), (X (X (AND p1 p2 p0))), (X (X (NOT (AND p1 p2 p0)))), (X (X (AND p2 p0))), (X (X (NOT (AND p2 p0)))), (X (X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0)))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p0 p2))), (F (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (F (NOT (AND p0 p2))), (F (NOT (OR p0 (NOT p2)))), (F (NOT p2)), (F (NOT (OR p0 (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2)))), (F (NOT (AND (OR p0 p1) (OR p0 p2)))), (F p1), (F (NOT p0)), (F (NOT (OR (NOT p0) p2)))]
Knowledge based reduction with 6 factoid took 1349 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter insensitive) to 5 states, 16 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 208 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), false, false]
Stuttering acceptance computed with spot in 204 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), false, false]
Support contains 6 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Applied a total of 0 rules in 9 ms. Remains 128 /128 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-06-01 01:21:16] [INFO ] Invariant cache hit.
[2024-06-01 01:21:16] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-01 01:21:16] [INFO ] Invariant cache hit.
[2024-06-01 01:21:16] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
[2024-06-01 01:21:16] [INFO ] Redundant transitions in 1 ms returned []
Running 32 sub problems to find dead transitions.
[2024-06-01 01:21:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 63/127 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/128 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 64/192 variables, 128/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (OVERLAPS) 0/192 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 193 constraints, problems are : Problem set: 0 solved, 32 unsolved in 735 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 63/127 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/128 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 64/192 variables, 128/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 32/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 225 constraints, problems are : Problem set: 0 solved, 32 unsolved in 1600 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
After SMT, in 2360ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 2368ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2568 ms. Remains : 128/128 places, 64/64 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND p0 p1 p2))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1 p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X (AND p0 p2)), (X (NOT (AND p0 p2))), (X p0), (X (NOT p0)), (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (X p2)), (X (X (NOT p2))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X p0)), (X (X (NOT p0))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 6 factoid took 1188 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter insensitive) to 5 states, 16 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 223 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), false, false]
RANDOM walk for 761 steps (0 resets) in 30 ms. (24 steps per ms) remains 0/11 properties
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND p0 p1 p2))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1 p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X (AND p0 p2)), (X (NOT (AND p0 p2))), (X p0), (X (NOT p0)), (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (X p2)), (X (X (NOT p2))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X p0)), (X (X (NOT p0))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p0 p2))), (F (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (F (NOT (AND p0 p2))), (F (NOT (OR p0 (NOT p2)))), (F (NOT p2)), (F (NOT (OR p0 (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2)))), (F (NOT (AND (OR p0 p1) (OR p0 p2)))), (F p1), (F (NOT p0)), (F (NOT (OR (NOT p0) p2)))]
Knowledge based reduction with 6 factoid took 1549 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter insensitive) to 5 states, 16 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 233 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), false, false]
Stuttering acceptance computed with spot in 219 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), false, false]
Stuttering acceptance computed with spot in 190 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), false, false]
Product exploration explored 100000 steps with 0 reset in 392 ms.
Product exploration explored 100000 steps with 0 reset in 512 ms.
Support contains 6 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Applied a total of 0 rules in 4 ms. Remains 128 /128 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-06-01 01:21:23] [INFO ] Invariant cache hit.
[2024-06-01 01:21:23] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-06-01 01:21:23] [INFO ] Invariant cache hit.
[2024-06-01 01:21:23] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
[2024-06-01 01:21:23] [INFO ] Redundant transitions in 0 ms returned []
Running 32 sub problems to find dead transitions.
[2024-06-01 01:21:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 63/127 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/128 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 64/192 variables, 128/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (OVERLAPS) 0/192 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 193 constraints, problems are : Problem set: 0 solved, 32 unsolved in 636 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 63/127 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/128 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 64/192 variables, 128/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 32/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 225 constraints, problems are : Problem set: 0 solved, 32 unsolved in 1644 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
After SMT, in 2287ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 2288ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2470 ms. Remains : 128/128 places, 64/64 transitions.
Treatment of property CircularTrains-PT-096-LTLFireability-00 finished in 14637 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(p1)&&p0))))'
Support contains 4 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 96/96 transitions.
Applied a total of 0 rules in 2 ms. Remains 168 /168 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 168 cols
[2024-06-01 01:21:26] [INFO ] Computed 73 invariants in 11 ms
[2024-06-01 01:21:26] [INFO ] Implicit Places using invariants in 101 ms returned [3, 29, 146, 148, 150, 163, 164]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 107 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 161/168 places, 96/96 transitions.
Applied a total of 0 rules in 4 ms. Remains 161 /161 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 113 ms. Remains : 161/168 places, 96/96 transitions.
Stuttering acceptance computed with spot in 118 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : CircularTrains-PT-096-LTLFireability-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CircularTrains-PT-096-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-096-LTLFireability-01 finished in 245 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&F(G(p0))))))'
Support contains 2 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 96/96 transitions.
Applied a total of 0 rules in 2 ms. Remains 168 /168 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2024-06-01 01:21:26] [INFO ] Invariant cache hit.
[2024-06-01 01:21:26] [INFO ] Implicit Places using invariants in 87 ms returned [3, 29, 146, 148, 150, 158, 163, 164]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 89 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 160/168 places, 96/96 transitions.
Applied a total of 0 rules in 2 ms. Remains 160 /160 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 93 ms. Remains : 160/168 places, 96/96 transitions.
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-096-LTLFireability-02
Entered a terminal (fully accepting) state of product in 43 steps with 0 reset in 1 ms.
FORMULA CircularTrains-PT-096-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-096-LTLFireability-02 finished in 188 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||(F(p2)&&p1))))'
Support contains 6 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 168 /168 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2024-06-01 01:21:26] [INFO ] Invariant cache hit.
[2024-06-01 01:21:26] [INFO ] Implicit Places using invariants in 82 ms returned [3, 29, 146, 158, 163, 164]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 84 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 162/168 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 162 /162 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 87 ms. Remains : 162/168 places, 96/96 transitions.
Stuttering acceptance computed with spot in 147 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CircularTrains-PT-096-LTLFireability-04
Product exploration explored 100000 steps with 1511 reset in 432 ms.
Product exploration explored 100000 steps with 1496 reset in 421 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1 (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Knowledge based reduction with 3 factoid took 382 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
RANDOM walk for 373 steps (0 resets) in 11 ms. (31 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1 (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F p1), (F p0), (F p2), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p1) p2)))]
Knowledge based reduction with 3 factoid took 502 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 176 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
// Phase 1: matrix 96 rows 162 cols
[2024-06-01 01:21:29] [INFO ] Computed 67 invariants in 3 ms
[2024-06-01 01:21:29] [INFO ] [Real]Absence check using 61 positive place invariants in 10 ms returned sat
[2024-06-01 01:21:29] [INFO ] [Real]Absence check using 61 positive and 6 generalized place invariants in 6 ms returned sat
[2024-06-01 01:21:29] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2024-06-01 01:21:29] [INFO ] Computed and/alt/rep : 64/96/64 causal constraints (skipped 0 transitions) in 6 ms.
[2024-06-01 01:21:29] [INFO ] Added : 61 causal constraints over 13 iterations in 246 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
[2024-06-01 01:21:29] [INFO ] Invariant cache hit.
[2024-06-01 01:21:29] [INFO ] [Real]Absence check using 61 positive place invariants in 9 ms returned sat
[2024-06-01 01:21:29] [INFO ] [Real]Absence check using 61 positive and 6 generalized place invariants in 6 ms returned sat
[2024-06-01 01:21:29] [INFO ] [Real]Absence check using state equation in 166 ms returned sat
[2024-06-01 01:21:29] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 01:21:29] [INFO ] [Nat]Absence check using 61 positive place invariants in 11 ms returned sat
[2024-06-01 01:21:29] [INFO ] [Nat]Absence check using 61 positive and 6 generalized place invariants in 5 ms returned sat
[2024-06-01 01:21:30] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2024-06-01 01:21:30] [INFO ] Computed and/alt/rep : 64/96/64 causal constraints (skipped 0 transitions) in 12 ms.
[2024-06-01 01:21:30] [INFO ] Added : 61 causal constraints over 13 iterations in 358 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 6 out of 162 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 96/96 transitions.
Applied a total of 0 rules in 3 ms. Remains 162 /162 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2024-06-01 01:21:30] [INFO ] Invariant cache hit.
[2024-06-01 01:21:30] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-06-01 01:21:30] [INFO ] Invariant cache hit.
[2024-06-01 01:21:30] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
Running 64 sub problems to find dead transitions.
[2024-06-01 01:21:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 61/159 variables, 61/62 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (OVERLAPS) 3/162 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (OVERLAPS) 96/258 variables, 162/229 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (OVERLAPS) 0/258 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 229 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1770 ms.
Refiners :[Positive P Invariants (semi-flows): 61/61 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 61/159 variables, 61/62 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (OVERLAPS) 3/162 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (OVERLAPS) 96/258 variables, 162/229 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 64/293 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 10 (OVERLAPS) 0/258 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 293 constraints, problems are : Problem set: 0 solved, 64 unsolved in 6401 ms.
Refiners :[Positive P Invariants (semi-flows): 61/61 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
After SMT, in 8192ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 8195ms
Finished structural reductions in LTL mode , in 1 iterations and 8399 ms. Remains : 162/162 places, 96/96 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X p2), (X (NOT p2)), (X (NOT p1)), (X p1), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Knowledge based reduction with 2 factoid took 350 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
RANDOM walk for 238 steps (0 resets) in 9 ms. (23 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X p2), (X (NOT p2)), (X (NOT p1)), (X p1), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F p1), (F p0), (F p2), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p1) p2)))]
Knowledge based reduction with 2 factoid took 422 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 162 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
[2024-06-01 01:21:40] [INFO ] Invariant cache hit.
[2024-06-01 01:21:40] [INFO ] [Real]Absence check using 61 positive place invariants in 10 ms returned sat
[2024-06-01 01:21:40] [INFO ] [Real]Absence check using 61 positive and 6 generalized place invariants in 5 ms returned sat
[2024-06-01 01:21:40] [INFO ] [Real]Absence check using state equation in 182 ms returned sat
[2024-06-01 01:21:40] [INFO ] Computed and/alt/rep : 64/96/64 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 01:21:40] [INFO ] Added : 61 causal constraints over 13 iterations in 256 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
[2024-06-01 01:21:40] [INFO ] Invariant cache hit.
[2024-06-01 01:21:40] [INFO ] [Real]Absence check using 61 positive place invariants in 10 ms returned sat
[2024-06-01 01:21:40] [INFO ] [Real]Absence check using 61 positive and 6 generalized place invariants in 6 ms returned sat
[2024-06-01 01:21:40] [INFO ] [Real]Absence check using state equation in 173 ms returned sat
[2024-06-01 01:21:40] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 01:21:41] [INFO ] [Nat]Absence check using 61 positive place invariants in 18 ms returned sat
[2024-06-01 01:21:41] [INFO ] [Nat]Absence check using 61 positive and 6 generalized place invariants in 6 ms returned sat
[2024-06-01 01:21:41] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2024-06-01 01:21:41] [INFO ] Computed and/alt/rep : 64/96/64 causal constraints (skipped 0 transitions) in 6 ms.
[2024-06-01 01:21:41] [INFO ] Added : 61 causal constraints over 13 iterations in 312 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 171 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Product exploration explored 100000 steps with 1542 reset in 387 ms.
Product exploration explored 100000 steps with 1512 reset in 414 ms.
Applying partial POR strategy [false, true, true, false]
Stuttering acceptance computed with spot in 178 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Support contains 6 out of 162 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 162/162 places, 96/96 transitions.
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 162 transition count 96
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 29 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 162 transition count 96
Deduced a syphon composed of 29 places in 0 ms
Applied a total of 29 rules in 27 ms. Remains 162 /162 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2024-06-01 01:21:42] [INFO ] Redundant transitions in 2 ms returned []
Running 64 sub problems to find dead transitions.
// Phase 1: matrix 96 rows 162 cols
[2024-06-01 01:21:42] [INFO ] Computed 67 invariants in 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 61/159 variables, 61/62 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2024-06-01 01:21:43] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 5 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-06-01 01:21:43] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2024-06-01 01:21:43] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
[2024-06-01 01:21:43] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2024-06-01 01:21:43] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
[2024-06-01 01:21:43] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
[2024-06-01 01:21:43] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
[2024-06-01 01:21:43] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
[2024-06-01 01:21:43] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-06-01 01:21:43] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2024-06-01 01:21:43] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
[2024-06-01 01:21:43] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 1 ms to minimize.
[2024-06-01 01:21:43] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-06-01 01:21:43] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
[2024-06-01 01:21:43] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
Problem TDEAD32 is UNSAT
[2024-06-01 01:21:43] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
[2024-06-01 01:21:43] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
Problem TDEAD39 is UNSAT
[2024-06-01 01:21:43] [INFO ] Deduced a trap composed of 2 places in 13 ms of which 1 ms to minimize.
Problem TDEAD40 is UNSAT
[2024-06-01 01:21:43] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
Problem TDEAD43 is UNSAT
[2024-06-01 01:21:43] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD64 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 20/84 constraints. Problems are: Problem set: 20 solved, 44 unsolved
[2024-06-01 01:21:43] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-06-01 01:21:43] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
[2024-06-01 01:21:43] [INFO ] Deduced a trap composed of 2 places in 13 ms of which 1 ms to minimize.
Problem TDEAD7 is UNSAT
[2024-06-01 01:21:43] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
[2024-06-01 01:21:43] [INFO ] Deduced a trap composed of 2 places in 13 ms of which 0 ms to minimize.
Problem TDEAD12 is UNSAT
[2024-06-01 01:21:43] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 1 ms to minimize.
Problem TDEAD13 is UNSAT
[2024-06-01 01:21:44] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD45 is UNSAT
[2024-06-01 01:21:44] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
Problem TDEAD46 is UNSAT
[2024-06-01 01:21:44] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
Problem TDEAD6 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD53 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 9/93 constraints. Problems are: Problem set: 29 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 0/93 constraints. Problems are: Problem set: 29 solved, 35 unsolved
At refinement iteration 7 (OVERLAPS) 3/162 variables, 3/96 constraints. Problems are: Problem set: 29 solved, 35 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 0/96 constraints. Problems are: Problem set: 29 solved, 35 unsolved
At refinement iteration 9 (OVERLAPS) 96/258 variables, 162/258 constraints. Problems are: Problem set: 29 solved, 35 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 0/258 constraints. Problems are: Problem set: 29 solved, 35 unsolved
At refinement iteration 11 (OVERLAPS) 0/258 variables, 0/258 constraints. Problems are: Problem set: 29 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 258 constraints, problems are : Problem set: 29 solved, 35 unsolved in 2056 ms.
Refiners :[Positive P Invariants (semi-flows): 61/61 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 29 solved, 35 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 29 solved, 35 unsolved
At refinement iteration 1 (OVERLAPS) 90/159 variables, 61/61 constraints. Problems are: Problem set: 29 solved, 35 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 3/64 constraints. Problems are: Problem set: 29 solved, 35 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 29/93 constraints. Problems are: Problem set: 29 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/93 constraints. Problems are: Problem set: 29 solved, 35 unsolved
At refinement iteration 5 (OVERLAPS) 3/162 variables, 3/96 constraints. Problems are: Problem set: 29 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/96 constraints. Problems are: Problem set: 29 solved, 35 unsolved
At refinement iteration 7 (OVERLAPS) 96/258 variables, 162/258 constraints. Problems are: Problem set: 29 solved, 35 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 35/293 constraints. Problems are: Problem set: 29 solved, 35 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 0/293 constraints. Problems are: Problem set: 29 solved, 35 unsolved
At refinement iteration 10 (OVERLAPS) 0/258 variables, 0/293 constraints. Problems are: Problem set: 29 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 293 constraints, problems are : Problem set: 29 solved, 35 unsolved in 1644 ms.
Refiners :[Positive P Invariants (semi-flows): 61/61 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 35/64 constraints, Known Traps: 29/29 constraints]
After SMT, in 3712ms problems are : Problem set: 29 solved, 35 unsolved
Search for dead transitions found 29 dead transitions in 3713ms
Found 29 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 29 transitions
Dead transitions reduction (with SMT) removed 29 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 162/162 places, 67/96 transitions.
Graph (complete) has 264 edges and 162 vertex of which 133 are kept as prefixes of interest. Removing 29 places using SCC suffix rule.3 ms
Discarding 29 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 13 ms. Remains 133 /162 variables (removed 29) and now considering 67/67 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 133/162 places, 67/96 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3764 ms. Remains : 133/162 places, 67/96 transitions.
Support contains 6 out of 162 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 96/96 transitions.
Applied a total of 0 rules in 3 ms. Remains 162 /162 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 162 cols
[2024-06-01 01:21:46] [INFO ] Computed 67 invariants in 4 ms
[2024-06-01 01:21:46] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-06-01 01:21:46] [INFO ] Invariant cache hit.
[2024-06-01 01:21:46] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
Running 64 sub problems to find dead transitions.
[2024-06-01 01:21:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 61/159 variables, 61/62 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (OVERLAPS) 3/162 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (OVERLAPS) 96/258 variables, 162/229 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (OVERLAPS) 0/258 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 229 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1731 ms.
Refiners :[Positive P Invariants (semi-flows): 61/61 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 61/159 variables, 61/62 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (OVERLAPS) 3/162 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (OVERLAPS) 96/258 variables, 162/229 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 64/293 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 10 (OVERLAPS) 0/258 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 293 constraints, problems are : Problem set: 0 solved, 64 unsolved in 6511 ms.
Refiners :[Positive P Invariants (semi-flows): 61/61 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
After SMT, in 8249ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 8250ms
Finished structural reductions in LTL mode , in 1 iterations and 8445 ms. Remains : 162/162 places, 96/96 transitions.
Treatment of property CircularTrains-PT-096-LTLFireability-04 finished in 28367 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G((X(p1)||p0))||(X(F(p3))&&p2))))'
Support contains 6 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 96/96 transitions.
Applied a total of 0 rules in 2 ms. Remains 168 /168 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 168 cols
[2024-06-01 01:21:55] [INFO ] Computed 73 invariants in 1 ms
[2024-06-01 01:21:55] [INFO ] Implicit Places using invariants in 88 ms returned [29, 146, 148, 158, 163, 164]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 90 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 162/168 places, 96/96 transitions.
Applied a total of 0 rules in 2 ms. Remains 162 /162 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 94 ms. Remains : 162/168 places, 96/96 transitions.
Stuttering acceptance computed with spot in 155 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p3) (NOT p1)), true, (NOT p3)]
Running random walk in product with property : CircularTrains-PT-096-LTLFireability-05
Entered a terminal (fully accepting) state of product in 41 steps with 12 reset in 1 ms.
FORMULA CircularTrains-PT-096-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-096-LTLFireability-05 finished in 265 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 168 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 168/168 places, 96/96 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 168 transition count 78
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 36 place count 150 transition count 78
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 36 place count 150 transition count 73
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 46 place count 145 transition count 73
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 58 place count 139 transition count 67
Applied a total of 58 rules in 15 ms. Remains 139 /168 variables (removed 29) and now considering 67/96 (removed 29) transitions.
// Phase 1: matrix 67 rows 139 cols
[2024-06-01 01:21:55] [INFO ] Computed 73 invariants in 1 ms
[2024-06-01 01:21:55] [INFO ] Implicit Places using invariants in 82 ms returned [2, 23, 120, 122, 124, 130, 135, 136]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 84 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 131/168 places, 67/96 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 131 transition count 65
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 129 transition count 64
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 128 transition count 64
Applied a total of 6 rules in 5 ms. Remains 128 /131 variables (removed 3) and now considering 64/67 (removed 3) transitions.
// Phase 1: matrix 64 rows 128 cols
[2024-06-01 01:21:55] [INFO ] Computed 65 invariants in 1 ms
[2024-06-01 01:21:55] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-06-01 01:21:55] [INFO ] Invariant cache hit.
[2024-06-01 01:21:55] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 128/168 places, 64/96 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 261 ms. Remains : 128/168 places, 64/96 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-096-LTLFireability-07
Product exploration explored 100000 steps with 1498 reset in 386 ms.
Product exploration explored 100000 steps with 1483 reset in 410 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 184 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 82 steps (0 resets) in 5 ms. (13 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 195 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Applied a total of 0 rules in 6 ms. Remains 128 /128 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-06-01 01:21:57] [INFO ] Invariant cache hit.
[2024-06-01 01:21:57] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-01 01:21:57] [INFO ] Invariant cache hit.
[2024-06-01 01:21:57] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
[2024-06-01 01:21:57] [INFO ] Redundant transitions in 1 ms returned []
Running 32 sub problems to find dead transitions.
[2024-06-01 01:21:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 63/127 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/128 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 64/192 variables, 128/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (OVERLAPS) 0/192 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 193 constraints, problems are : Problem set: 0 solved, 32 unsolved in 622 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 63/127 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/128 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 64/192 variables, 128/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 32/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 225 constraints, problems are : Problem set: 0 solved, 32 unsolved in 1605 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
After SMT, in 2233ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 2234ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2410 ms. Remains : 128/128 places, 64/64 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 155 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 157 steps (0 resets) in 7 ms. (19 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 203 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1482 reset in 378 ms.
Product exploration explored 100000 steps with 1486 reset in 409 ms.
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Applied a total of 0 rules in 10 ms. Remains 128 /128 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-06-01 01:22:00] [INFO ] Invariant cache hit.
[2024-06-01 01:22:00] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-06-01 01:22:00] [INFO ] Invariant cache hit.
[2024-06-01 01:22:01] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
[2024-06-01 01:22:01] [INFO ] Redundant transitions in 1 ms returned []
Running 32 sub problems to find dead transitions.
[2024-06-01 01:22:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 63/127 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/128 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 64/192 variables, 128/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (OVERLAPS) 0/192 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 193 constraints, problems are : Problem set: 0 solved, 32 unsolved in 631 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 63/127 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/128 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 64/192 variables, 128/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 32/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 225 constraints, problems are : Problem set: 0 solved, 32 unsolved in 1593 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
After SMT, in 2230ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 2230ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2407 ms. Remains : 128/128 places, 64/64 transitions.
Treatment of property CircularTrains-PT-096-LTLFireability-07 finished in 8046 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 168 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 168/168 places, 96/96 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 168 transition count 78
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 36 place count 150 transition count 78
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 36 place count 150 transition count 72
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 48 place count 144 transition count 72
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 60 place count 138 transition count 66
Applied a total of 60 rules in 10 ms. Remains 138 /168 variables (removed 30) and now considering 66/96 (removed 30) transitions.
// Phase 1: matrix 66 rows 138 cols
[2024-06-01 01:22:03] [INFO ] Computed 73 invariants in 1 ms
[2024-06-01 01:22:03] [INFO ] Implicit Places using invariants in 80 ms returned [2, 23, 119, 121, 123, 129, 134, 135]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 81 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 130/168 places, 66/96 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 130 transition count 64
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 128 transition count 64
Applied a total of 4 rules in 3 ms. Remains 128 /130 variables (removed 2) and now considering 64/66 (removed 2) transitions.
// Phase 1: matrix 64 rows 128 cols
[2024-06-01 01:22:03] [INFO ] Computed 65 invariants in 1 ms
[2024-06-01 01:22:03] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-06-01 01:22:03] [INFO ] Invariant cache hit.
[2024-06-01 01:22:03] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 128/168 places, 64/96 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 259 ms. Remains : 128/168 places, 64/96 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : CircularTrains-PT-096-LTLFireability-08
Product exploration explored 100000 steps with 0 reset in 331 ms.
Product exploration explored 100000 steps with 0 reset in 404 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 282 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
RANDOM walk for 58 steps (0 resets) in 5 ms. (9 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 1 factoid took 213 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
[2024-06-01 01:22:05] [INFO ] Invariant cache hit.
[2024-06-01 01:22:05] [INFO ] [Real]Absence check using 63 positive place invariants in 9 ms returned sat
[2024-06-01 01:22:05] [INFO ] [Real]Absence check using 63 positive and 2 generalized place invariants in 3 ms returned sat
[2024-06-01 01:22:05] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2024-06-01 01:22:05] [INFO ] Computed and/alt/rep : 32/64/32 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 01:22:05] [INFO ] Added : 30 causal constraints over 6 iterations in 68 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Applied a total of 0 rules in 3 ms. Remains 128 /128 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-06-01 01:22:05] [INFO ] Invariant cache hit.
[2024-06-01 01:22:05] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-01 01:22:05] [INFO ] Invariant cache hit.
[2024-06-01 01:22:05] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
[2024-06-01 01:22:05] [INFO ] Redundant transitions in 1 ms returned []
Running 32 sub problems to find dead transitions.
[2024-06-01 01:22:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 63/127 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/128 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 64/192 variables, 128/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (OVERLAPS) 0/192 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 193 constraints, problems are : Problem set: 0 solved, 32 unsolved in 639 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 63/127 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/128 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 64/192 variables, 128/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 32/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 225 constraints, problems are : Problem set: 0 solved, 32 unsolved in 1581 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
After SMT, in 2224ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 2225ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2403 ms. Remains : 128/128 places, 64/64 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 184 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
RANDOM walk for 111 steps (0 resets) in 6 ms. (15 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 1 factoid took 185 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
[2024-06-01 01:22:08] [INFO ] Invariant cache hit.
[2024-06-01 01:22:08] [INFO ] [Real]Absence check using 63 positive place invariants in 9 ms returned sat
[2024-06-01 01:22:08] [INFO ] [Real]Absence check using 63 positive and 2 generalized place invariants in 3 ms returned sat
[2024-06-01 01:22:08] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2024-06-01 01:22:08] [INFO ] Computed and/alt/rep : 32/64/32 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 01:22:08] [INFO ] Added : 30 causal constraints over 6 iterations in 67 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 0 reset in 339 ms.
Product exploration explored 100000 steps with 0 reset in 440 ms.
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 128 /128 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-06-01 01:22:09] [INFO ] Invariant cache hit.
[2024-06-01 01:22:09] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-06-01 01:22:09] [INFO ] Invariant cache hit.
[2024-06-01 01:22:09] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
[2024-06-01 01:22:09] [INFO ] Redundant transitions in 1 ms returned []
Running 32 sub problems to find dead transitions.
[2024-06-01 01:22:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 63/127 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/128 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 64/192 variables, 128/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (OVERLAPS) 0/192 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 193 constraints, problems are : Problem set: 0 solved, 32 unsolved in 644 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 63/127 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/128 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 64/192 variables, 128/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 32/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 225 constraints, problems are : Problem set: 0 solved, 32 unsolved in 1624 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
After SMT, in 2273ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 2274ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2450 ms. Remains : 128/128 places, 64/64 transitions.
Treatment of property CircularTrains-PT-096-LTLFireability-08 finished in 8320 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(((X(p0)||F(!p1)) U (G((X(p0)||F(!p1)))||(!p2&&(X(p0)||F(!p1)))))))||(!p2&&F(((X(p0)||F(!p1)) U (G((X(p0)||F(!p1)))||(!p2&&(X(p0)||F(!p1))))))))))'
Support contains 4 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 96/96 transitions.
Applied a total of 0 rules in 3 ms. Remains 168 /168 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 168 cols
[2024-06-01 01:22:11] [INFO ] Computed 73 invariants in 0 ms
[2024-06-01 01:22:11] [INFO ] Implicit Places using invariants in 86 ms returned [3, 146, 148, 150, 158, 163, 164]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 87 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 161/168 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 161 /161 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 91 ms. Remains : 161/168 places, 96/96 transitions.
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), false]
Running random walk in product with property : CircularTrains-PT-096-LTLFireability-09
Product exploration explored 100000 steps with 5639 reset in 429 ms.
Product exploration explored 100000 steps with 5671 reset in 465 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (X (NOT (AND p2 p1 (NOT p0)))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p2 p1 p0))), (X (X (NOT (AND p2 p1 p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 561 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), false]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 40000 steps (8 resets) in 242 ms. (164 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 193 ms. (206 steps per ms) remains 1/1 properties
// Phase 1: matrix 96 rows 161 cols
[2024-06-01 01:22:13] [INFO ] Computed 66 invariants in 1 ms
Problem apf2 is UNSAT
After SMT solving in domain Real declared 4/257 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 22 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, Generalized P Invariants (flows): 0/3 constraints, State Equation: 0/161 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 27ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (X (NOT (AND p2 p1 (NOT p0))))), (G (OR (NOT p1) p0 (NOT p2)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p2 p1 p0))), (X (X (NOT (AND p2 p1 p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p1) (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p1) p0))), (F p1), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR (NOT p1) (NOT p0))))]
Knowledge based reduction with 6 factoid took 796 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) p1), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) p1), (AND p1 (NOT p0))]
Support contains 4 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 96/96 transitions.
Applied a total of 0 rules in 4 ms. Remains 161 /161 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2024-06-01 01:22:14] [INFO ] Invariant cache hit.
[2024-06-01 01:22:14] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-06-01 01:22:14] [INFO ] Invariant cache hit.
[2024-06-01 01:22:14] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
Running 64 sub problems to find dead transitions.
[2024-06-01 01:22:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 63/160 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 1/161 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 96/257 variables, 161/227 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/257 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 0/257 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 257/257 variables, and 227 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1582 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 63/160 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 1/161 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 96/257 variables, 161/227 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/257 variables, 64/291 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (OVERLAPS) 0/257 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 257/257 variables, and 291 constraints, problems are : Problem set: 0 solved, 64 unsolved in 4209 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
After SMT, in 5799ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 5800ms
Finished structural reductions in LTL mode , in 1 iterations and 6003 ms. Remains : 161/161 places, 96/96 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X p0)]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 369 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p0) p1), (AND p1 (NOT p0))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 127 steps (0 resets) in 6 ms. (18 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X p0)]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT p2)), (F (NOT p0)), (F (NOT (OR (NOT p1) p0)))]
Knowledge based reduction with 3 factoid took 523 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) p1), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) p1), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) p1), (AND p1 (NOT p0))]
Product exploration explored 100000 steps with 5754 reset in 425 ms.
Product exploration explored 100000 steps with 5704 reset in 448 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) p1), (AND p1 (NOT p0))]
Support contains 4 out of 161 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 161/161 places, 96/96 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 161 transition count 96
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 31 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 161 transition count 96
Deduced a syphon composed of 31 places in 0 ms
Applied a total of 31 rules in 10 ms. Remains 161 /161 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2024-06-01 01:22:23] [INFO ] Redundant transitions in 2 ms returned []
Running 64 sub problems to find dead transitions.
// Phase 1: matrix 96 rows 161 cols
[2024-06-01 01:22:23] [INFO ] Computed 66 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 63/160 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2024-06-01 01:22:23] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 2 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-06-01 01:22:23] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
[2024-06-01 01:22:23] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
[2024-06-01 01:22:23] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
[2024-06-01 01:22:23] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-06-01 01:22:23] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 3 ms to minimize.
[2024-06-01 01:22:23] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
[2024-06-01 01:22:23] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 1 ms to minimize.
[2024-06-01 01:22:23] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
[2024-06-01 01:22:23] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-06-01 01:22:23] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 1 ms to minimize.
[2024-06-01 01:22:23] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
[2024-06-01 01:22:23] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
[2024-06-01 01:22:23] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-06-01 01:22:23] [INFO ] Deduced a trap composed of 2 places in 13 ms of which 0 ms to minimize.
[2024-06-01 01:22:23] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
Problem TDEAD30 is UNSAT
[2024-06-01 01:22:23] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
[2024-06-01 01:22:23] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD37 is UNSAT
[2024-06-01 01:22:23] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD38 is UNSAT
[2024-06-01 01:22:23] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD62 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 20/85 constraints. Problems are: Problem set: 20 solved, 44 unsolved
[2024-06-01 01:22:24] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
[2024-06-01 01:22:24] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
Problem TDEAD48 is UNSAT
Problem TDEAD51 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 2/87 constraints. Problems are: Problem set: 22 solved, 42 unsolved
[2024-06-01 01:22:24] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-06-01 01:22:24] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-06-01 01:22:24] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
[2024-06-01 01:22:24] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 2 ms to minimize.
[2024-06-01 01:22:24] [INFO ] Deduced a trap composed of 2 places in 13 ms of which 1 ms to minimize.
[2024-06-01 01:22:24] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 3 ms to minimize.
[2024-06-01 01:22:24] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 3 ms to minimize.
Problem TDEAD42 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 7/94 constraints. Problems are: Problem set: 29 solved, 35 unsolved
[2024-06-01 01:22:24] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
Problem TDEAD7 is UNSAT
[2024-06-01 01:22:24] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD43 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/96 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/96 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 8 (OVERLAPS) 1/161 variables, 1/97 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 0/97 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 10 (OVERLAPS) 96/257 variables, 161/258 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/257 variables, 0/258 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 12 (OVERLAPS) 0/257 variables, 0/258 constraints. Problems are: Problem set: 31 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 257/257 variables, and 258 constraints, problems are : Problem set: 31 solved, 33 unsolved in 2297 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 31 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 94/160 variables, 63/63 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 2/65 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 31/96 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/96 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 5 (OVERLAPS) 1/161 variables, 1/97 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/97 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 96/257 variables, 161/258 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 33/291 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/257 variables, 0/291 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 10 (OVERLAPS) 0/257 variables, 0/291 constraints. Problems are: Problem set: 31 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 257/257 variables, and 291 constraints, problems are : Problem set: 31 solved, 33 unsolved in 1340 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 33/64 constraints, Known Traps: 31/31 constraints]
After SMT, in 3645ms problems are : Problem set: 31 solved, 33 unsolved
Search for dead transitions found 31 dead transitions in 3646ms
Found 31 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 31 transitions
Dead transitions reduction (with SMT) removed 31 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 161/161 places, 65/96 transitions.
Graph (complete) has 260 edges and 161 vertex of which 130 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.1 ms
Discarding 31 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 130 /161 variables (removed 31) and now considering 65/65 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 130/161 places, 65/96 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3676 ms. Remains : 130/161 places, 65/96 transitions.
Support contains 4 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 96/96 transitions.
Applied a total of 0 rules in 3 ms. Remains 161 /161 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 161 cols
[2024-06-01 01:22:26] [INFO ] Computed 66 invariants in 1 ms
[2024-06-01 01:22:26] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-06-01 01:22:26] [INFO ] Invariant cache hit.
[2024-06-01 01:22:26] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
Running 64 sub problems to find dead transitions.
[2024-06-01 01:22:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 63/160 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 1/161 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 96/257 variables, 161/227 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/257 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 0/257 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 257/257 variables, and 227 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1577 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 63/160 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 1/161 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 96/257 variables, 161/227 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/257 variables, 64/291 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (OVERLAPS) 0/257 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 257/257 variables, and 291 constraints, problems are : Problem set: 0 solved, 64 unsolved in 4037 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
After SMT, in 5621ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 5622ms
Finished structural reductions in LTL mode , in 1 iterations and 5820 ms. Remains : 161/161 places, 96/96 transitions.
Treatment of property CircularTrains-PT-096-LTLFireability-09 finished in 20900 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(((G(p0) U p1)||F(p2)))))))'
Support contains 6 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 96/96 transitions.
Applied a total of 0 rules in 3 ms. Remains 168 /168 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 168 cols
[2024-06-01 01:22:32] [INFO ] Computed 73 invariants in 1 ms
[2024-06-01 01:22:32] [INFO ] Implicit Places using invariants in 106 ms returned [3, 29, 146, 148, 150, 158, 163]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 107 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 161/168 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 161 /161 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 111 ms. Remains : 161/168 places, 96/96 transitions.
Stuttering acceptance computed with spot in 279 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : CircularTrains-PT-096-LTLFireability-10
Product exploration explored 100000 steps with 6546 reset in 373 ms.
Product exploration explored 100000 steps with 6800 reset in 406 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 89 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 7 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 282 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0))]
RANDOM walk for 463 steps (0 resets) in 14 ms. (30 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2)]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p2))), (F p0), (F (NOT (OR p0 p1 p2))), (F p1), (F (NOT p2)), (F (NOT (OR (NOT p0) p1 p2))), (F (NOT (OR p0 p2)))]
Knowledge based reduction with 1 factoid took 266 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 7 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 271 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 281 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0))]
Support contains 6 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 96/96 transitions.
Applied a total of 0 rules in 2 ms. Remains 161 /161 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 161 cols
[2024-06-01 01:22:34] [INFO ] Computed 66 invariants in 0 ms
[2024-06-01 01:22:35] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-06-01 01:22:35] [INFO ] Invariant cache hit.
[2024-06-01 01:22:35] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
Running 64 sub problems to find dead transitions.
[2024-06-01 01:22:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 62/159 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 2/161 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 96/257 variables, 161/227 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/257 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 0/257 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 257/257 variables, and 227 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1504 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 62/159 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 2/161 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 96/257 variables, 161/227 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/257 variables, 64/291 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (OVERLAPS) 0/257 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 257/257 variables, and 291 constraints, problems are : Problem set: 0 solved, 64 unsolved in 5066 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
After SMT, in 6578ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 6581ms
Finished structural reductions in LTL mode , in 1 iterations and 6771 ms. Remains : 161/161 places, 96/96 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 94 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 7 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 388 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0))]
RANDOM walk for 298 steps (0 resets) in 7 ms. (37 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2)]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p2))), (F p0), (F (NOT (OR p0 p1 p2))), (F p1), (F (NOT p2)), (F (NOT (OR (NOT p0) p1 p2))), (F (NOT (OR p0 p2)))]
Knowledge based reduction with 1 factoid took 252 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 7 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 307 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 284 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 307 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 6906 reset in 379 ms.
Product exploration explored 100000 steps with 6764 reset in 407 ms.
Applying partial POR strategy [false, false, false, false, true, true, true]
Stuttering acceptance computed with spot in 335 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0))]
Support contains 6 out of 161 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 161/161 places, 96/96 transitions.
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 161 transition count 96
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 28 place count 161 transition count 96
Deduced a syphon composed of 30 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 30 place count 161 transition count 96
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 31 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 161 transition count 96
Deduced a syphon composed of 31 places in 0 ms
Applied a total of 31 rules in 14 ms. Remains 161 /161 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2024-06-01 01:22:44] [INFO ] Redundant transitions in 2 ms returned []
Running 64 sub problems to find dead transitions.
// Phase 1: matrix 96 rows 161 cols
[2024-06-01 01:22:44] [INFO ] Computed 66 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 62/159 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2024-06-01 01:22:44] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 0 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-06-01 01:22:44] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2024-06-01 01:22:45] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
[2024-06-01 01:22:45] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
[2024-06-01 01:22:45] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
[2024-06-01 01:22:45] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
[2024-06-01 01:22:45] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 1 ms to minimize.
[2024-06-01 01:22:45] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 1 ms to minimize.
[2024-06-01 01:22:45] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 2 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-06-01 01:22:45] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-06-01 01:22:45] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-06-01 01:22:45] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
Problem TDEAD50 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD60 is UNSAT
[2024-06-01 01:22:45] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
[2024-06-01 01:22:45] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 1 ms to minimize.
Problem TDEAD62 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD51 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 14/78 constraints. Problems are: Problem set: 14 solved, 50 unsolved
[2024-06-01 01:22:45] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-06-01 01:22:45] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-06-01 01:22:45] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
[2024-06-01 01:22:45] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-06-01 01:22:45] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
[2024-06-01 01:22:45] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
Problem TDEAD31 is UNSAT
[2024-06-01 01:22:45] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2024-06-01 01:22:45] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD37 is UNSAT
[2024-06-01 01:22:45] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
Problem TDEAD38 is UNSAT
[2024-06-01 01:22:45] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
Problem TDEAD41 is UNSAT
[2024-06-01 01:22:45] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
Problem TDEAD42 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD32 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 11/89 constraints. Problems are: Problem set: 25 solved, 39 unsolved
[2024-06-01 01:22:45] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-06-01 01:22:45] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
Problem TDEAD7 is UNSAT
[2024-06-01 01:22:45] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
Problem TDEAD12 is UNSAT
[2024-06-01 01:22:46] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 1 ms to minimize.
Problem TDEAD13 is UNSAT
[2024-06-01 01:22:46] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD43 is UNSAT
[2024-06-01 01:22:46] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD48 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 6/95 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 0/95 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 2/161 variables, 2/97 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/97 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 9 (OVERLAPS) 96/257 variables, 161/258 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/257 variables, 0/258 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 11 (OVERLAPS) 0/257 variables, 0/258 constraints. Problems are: Problem set: 31 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 257/257 variables, and 258 constraints, problems are : Problem set: 31 solved, 33 unsolved in 2169 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 31 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 93/159 variables, 62/62 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 2/64 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 31/95 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/95 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 5 (OVERLAPS) 2/161 variables, 2/97 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/97 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 96/257 variables, 161/258 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 33/291 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/257 variables, 0/291 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 10 (OVERLAPS) 0/257 variables, 0/291 constraints. Problems are: Problem set: 31 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 257/257 variables, and 291 constraints, problems are : Problem set: 31 solved, 33 unsolved in 1439 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 33/64 constraints, Known Traps: 31/31 constraints]
After SMT, in 3619ms problems are : Problem set: 31 solved, 33 unsolved
Search for dead transitions found 31 dead transitions in 3620ms
Found 31 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 31 transitions
Dead transitions reduction (with SMT) removed 31 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 161/161 places, 65/96 transitions.
Graph (complete) has 260 edges and 161 vertex of which 130 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.1 ms
Discarding 31 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 130 /161 variables (removed 31) and now considering 65/65 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 130/161 places, 65/96 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3652 ms. Remains : 130/161 places, 65/96 transitions.
Support contains 6 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 161 /161 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 161 cols
[2024-06-01 01:22:48] [INFO ] Computed 66 invariants in 1 ms
[2024-06-01 01:22:48] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-06-01 01:22:48] [INFO ] Invariant cache hit.
[2024-06-01 01:22:48] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
Running 64 sub problems to find dead transitions.
[2024-06-01 01:22:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 62/159 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 2/161 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 96/257 variables, 161/227 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/257 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 0/257 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 257/257 variables, and 227 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1536 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 62/159 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 2/161 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 96/257 variables, 161/227 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/257 variables, 64/291 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (OVERLAPS) 0/257 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 257/257 variables, and 291 constraints, problems are : Problem set: 0 solved, 64 unsolved in 5088 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
After SMT, in 6631ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 6632ms
Finished structural reductions in LTL mode , in 1 iterations and 6818 ms. Remains : 161/161 places, 96/96 transitions.
Treatment of property CircularTrains-PT-096-LTLFireability-10 finished in 22559 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 168 /168 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 168 cols
[2024-06-01 01:22:55] [INFO ] Computed 73 invariants in 1 ms
[2024-06-01 01:22:55] [INFO ] Implicit Places using invariants in 85 ms returned [3, 29, 146, 148, 150, 158, 163, 164]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 85 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 160/168 places, 96/96 transitions.
Applied a total of 0 rules in 2 ms. Remains 160 /160 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 88 ms. Remains : 160/168 places, 96/96 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-096-LTLFireability-11
Product exploration explored 100000 steps with 1493 reset in 374 ms.
Product exploration explored 100000 steps with 1512 reset in 404 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 319 steps (0 resets) in 7 ms. (39 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 190 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 96 rows 160 cols
[2024-06-01 01:22:56] [INFO ] Computed 65 invariants in 1 ms
[2024-06-01 01:22:56] [INFO ] [Real]Absence check using 63 positive place invariants in 11 ms returned sat
[2024-06-01 01:22:56] [INFO ] [Real]Absence check using 63 positive and 2 generalized place invariants in 5 ms returned sat
[2024-06-01 01:22:56] [INFO ] [Real]Absence check using state equation in 167 ms returned sat
[2024-06-01 01:22:56] [INFO ] Computed and/alt/rep : 64/96/64 causal constraints (skipped 0 transitions) in 6 ms.
[2024-06-01 01:22:57] [INFO ] Added : 61 causal constraints over 13 iterations in 230 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 160/160 places, 96/96 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 160 transition count 66
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 60 place count 130 transition count 66
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 60 place count 130 transition count 64
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 64 place count 128 transition count 64
Applied a total of 64 rules in 8 ms. Remains 128 /160 variables (removed 32) and now considering 64/96 (removed 32) transitions.
// Phase 1: matrix 64 rows 128 cols
[2024-06-01 01:22:57] [INFO ] Computed 65 invariants in 1 ms
[2024-06-01 01:22:57] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-06-01 01:22:57] [INFO ] Invariant cache hit.
[2024-06-01 01:22:57] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
[2024-06-01 01:22:57] [INFO ] Redundant transitions in 0 ms returned []
Running 32 sub problems to find dead transitions.
[2024-06-01 01:22:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 63/127 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/128 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 64/192 variables, 128/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (OVERLAPS) 0/192 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 193 constraints, problems are : Problem set: 0 solved, 32 unsolved in 649 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 63/127 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/128 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 64/192 variables, 128/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 32/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 225 constraints, problems are : Problem set: 0 solved, 32 unsolved in 1365 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
After SMT, in 2018ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 2018ms
Starting structural reductions in SI_LTL mode, iteration 1 : 128/160 places, 64/96 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2202 ms. Remains : 128/160 places, 64/96 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 124 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 118 steps (0 resets) in 4 ms. (23 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 167 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
[2024-06-01 01:22:59] [INFO ] Invariant cache hit.
[2024-06-01 01:22:59] [INFO ] [Real]Absence check using 63 positive place invariants in 9 ms returned sat
[2024-06-01 01:22:59] [INFO ] [Real]Absence check using 63 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-01 01:22:59] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2024-06-01 01:22:59] [INFO ] Computed and/alt/rep : 32/64/32 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 01:23:00] [INFO ] Added : 30 causal constraints over 6 iterations in 78 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2916 reset in 401 ms.
Product exploration explored 100000 steps with 2852 reset in 440 ms.
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 128 /128 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-06-01 01:23:00] [INFO ] Invariant cache hit.
[2024-06-01 01:23:01] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-06-01 01:23:01] [INFO ] Invariant cache hit.
[2024-06-01 01:23:01] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
[2024-06-01 01:23:01] [INFO ] Redundant transitions in 1 ms returned []
Running 32 sub problems to find dead transitions.
[2024-06-01 01:23:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 63/127 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/128 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 64/192 variables, 128/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (OVERLAPS) 0/192 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 193 constraints, problems are : Problem set: 0 solved, 32 unsolved in 636 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 63/127 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/128 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 64/192 variables, 128/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 32/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 225 constraints, problems are : Problem set: 0 solved, 32 unsolved in 1336 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
After SMT, in 1977ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 1977ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2159 ms. Remains : 128/128 places, 64/64 transitions.
Treatment of property CircularTrains-PT-096-LTLFireability-11 finished in 8024 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&F(G(p1)))))'
Support contains 4 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 96/96 transitions.
Applied a total of 0 rules in 3 ms. Remains 168 /168 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 168 cols
[2024-06-01 01:23:03] [INFO ] Computed 73 invariants in 2 ms
[2024-06-01 01:23:03] [INFO ] Implicit Places using invariants in 86 ms returned [3, 29, 146, 148, 150, 158, 164]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 87 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 161/168 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 161 /161 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 91 ms. Remains : 161/168 places, 96/96 transitions.
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CircularTrains-PT-096-LTLFireability-12
Product exploration explored 100000 steps with 0 reset in 329 ms.
Product exploration explored 100000 steps with 0 reset in 404 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 180 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 313 steps (0 resets) in 7 ms. (39 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 223 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 4 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 161 /161 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 161 cols
[2024-06-01 01:23:05] [INFO ] Computed 66 invariants in 1 ms
[2024-06-01 01:23:05] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-06-01 01:23:05] [INFO ] Invariant cache hit.
[2024-06-01 01:23:05] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
Running 64 sub problems to find dead transitions.
[2024-06-01 01:23:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 63/160 variables, 63/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (OVERLAPS) 1/161 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (OVERLAPS) 96/257 variables, 161/227 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (OVERLAPS) 0/257 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 257/257 variables, and 227 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1646 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 63/160 variables, 63/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (OVERLAPS) 1/161 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (OVERLAPS) 96/257 variables, 161/227 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 64/291 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/257 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 10 (OVERLAPS) 0/257 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 257/257 variables, and 291 constraints, problems are : Problem set: 0 solved, 64 unsolved in 4594 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
After SMT, in 6247ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 6247ms
Finished structural reductions in LTL mode , in 1 iterations and 6437 ms. Remains : 161/161 places, 96/96 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 168 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 226 steps (0 resets) in 6 ms. (32 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 207 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 334 ms.
Product exploration explored 100000 steps with 0 reset in 400 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 4 out of 161 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 161/161 places, 96/96 transitions.
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 161 transition count 96
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 28 place count 161 transition count 96
Deduced a syphon composed of 30 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 30 place count 161 transition count 96
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 31 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 161 transition count 96
Deduced a syphon composed of 31 places in 0 ms
Applied a total of 31 rules in 15 ms. Remains 161 /161 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2024-06-01 01:23:13] [INFO ] Redundant transitions in 1 ms returned []
Running 64 sub problems to find dead transitions.
// Phase 1: matrix 96 rows 161 cols
[2024-06-01 01:23:13] [INFO ] Computed 66 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 63/160 variables, 63/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2024-06-01 01:23:13] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-06-01 01:23:13] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
[2024-06-01 01:23:14] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
[2024-06-01 01:23:14] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
[2024-06-01 01:23:14] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
[2024-06-01 01:23:14] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
[2024-06-01 01:23:14] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
[2024-06-01 01:23:14] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
[2024-06-01 01:23:14] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-06-01 01:23:14] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 0 ms to minimize.
[2024-06-01 01:23:14] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
[2024-06-01 01:23:14] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
[2024-06-01 01:23:14] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-06-01 01:23:14] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 1 ms to minimize.
[2024-06-01 01:23:14] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
Problem TDEAD30 is UNSAT
[2024-06-01 01:23:14] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
[2024-06-01 01:23:14] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 1 ms to minimize.
Problem TDEAD37 is UNSAT
[2024-06-01 01:23:14] [INFO ] Deduced a trap composed of 2 places in 13 ms of which 1 ms to minimize.
Problem TDEAD38 is UNSAT
[2024-06-01 01:23:14] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
Problem TDEAD41 is UNSAT
[2024-06-01 01:23:14] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD62 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 20/85 constraints. Problems are: Problem set: 20 solved, 44 unsolved
[2024-06-01 01:23:14] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-06-01 01:23:14] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-06-01 01:23:14] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
[2024-06-01 01:23:14] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
[2024-06-01 01:23:14] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 1 ms to minimize.
[2024-06-01 01:23:14] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD43 is UNSAT
[2024-06-01 01:23:14] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
Problem TDEAD44 is UNSAT
[2024-06-01 01:23:14] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
Problem TDEAD6 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD51 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 8/93 constraints. Problems are: Problem set: 28 solved, 36 unsolved
[2024-06-01 01:23:14] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-06-01 01:23:14] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD7 is UNSAT
[2024-06-01 01:23:14] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD48 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 3/96 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/96 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 8 (OVERLAPS) 1/161 variables, 1/97 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 0/97 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 10 (OVERLAPS) 96/257 variables, 161/258 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/257 variables, 0/258 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 12 (OVERLAPS) 0/257 variables, 0/258 constraints. Problems are: Problem set: 31 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 257/257 variables, and 258 constraints, problems are : Problem set: 31 solved, 33 unsolved in 2257 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 31 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 94/160 variables, 63/63 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 2/65 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 31/96 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/96 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 5 (OVERLAPS) 1/161 variables, 1/97 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/97 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 96/257 variables, 161/258 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 33/291 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/257 variables, 0/291 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 10 (OVERLAPS) 0/257 variables, 0/291 constraints. Problems are: Problem set: 31 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 257/257 variables, and 291 constraints, problems are : Problem set: 31 solved, 33 unsolved in 1622 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 33/64 constraints, Known Traps: 31/31 constraints]
After SMT, in 3889ms problems are : Problem set: 31 solved, 33 unsolved
Search for dead transitions found 31 dead transitions in 3891ms
Found 31 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 31 transitions
Dead transitions reduction (with SMT) removed 31 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 161/161 places, 65/96 transitions.
Graph (complete) has 260 edges and 161 vertex of which 130 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.1 ms
Discarding 31 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 130 /161 variables (removed 31) and now considering 65/65 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 130/161 places, 65/96 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3920 ms. Remains : 130/161 places, 65/96 transitions.
Support contains 4 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 96/96 transitions.
Applied a total of 0 rules in 2 ms. Remains 161 /161 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 161 cols
[2024-06-01 01:23:17] [INFO ] Computed 66 invariants in 1 ms
[2024-06-01 01:23:17] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-01 01:23:17] [INFO ] Invariant cache hit.
[2024-06-01 01:23:17] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
Running 64 sub problems to find dead transitions.
[2024-06-01 01:23:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 63/160 variables, 63/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (OVERLAPS) 1/161 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (OVERLAPS) 96/257 variables, 161/227 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (OVERLAPS) 0/257 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 257/257 variables, and 227 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1663 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 63/160 variables, 63/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (OVERLAPS) 1/161 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (OVERLAPS) 96/257 variables, 161/227 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 64/291 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/257 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 10 (OVERLAPS) 0/257 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 257/257 variables, and 291 constraints, problems are : Problem set: 0 solved, 64 unsolved in 4600 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
After SMT, in 6270ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 6271ms
Finished structural reductions in LTL mode , in 1 iterations and 6452 ms. Remains : 161/161 places, 96/96 transitions.
Treatment of property CircularTrains-PT-096-LTLFireability-12 finished in 20699 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 168 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 168/168 places, 96/96 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 168 transition count 79
Reduce places removed 17 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 18 rules applied. Total rules applied 35 place count 151 transition count 78
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 36 place count 150 transition count 78
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 36 place count 150 transition count 72
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 48 place count 144 transition count 72
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 60 place count 138 transition count 66
Applied a total of 60 rules in 8 ms. Remains 138 /168 variables (removed 30) and now considering 66/96 (removed 30) transitions.
// Phase 1: matrix 66 rows 138 cols
[2024-06-01 01:23:23] [INFO ] Computed 73 invariants in 0 ms
[2024-06-01 01:23:23] [INFO ] Implicit Places using invariants in 79 ms returned [2, 23, 119, 121, 123, 134, 135]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 80 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 131/168 places, 66/96 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 131 transition count 65
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 130 transition count 65
Applied a total of 2 rules in 2 ms. Remains 130 /131 variables (removed 1) and now considering 65/66 (removed 1) transitions.
// Phase 1: matrix 65 rows 130 cols
[2024-06-01 01:23:23] [INFO ] Computed 66 invariants in 1 ms
[2024-06-01 01:23:24] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-06-01 01:23:24] [INFO ] Invariant cache hit.
[2024-06-01 01:23:24] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 130/168 places, 65/96 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 259 ms. Remains : 130/168 places, 65/96 transitions.
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CircularTrains-PT-096-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 345 ms.
Product exploration explored 100000 steps with 0 reset in 401 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 383 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 101 steps (0 resets) in 5 ms. (16 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F p1)]
Knowledge based reduction with 1 factoid took 332 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 124 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2024-06-01 01:23:26] [INFO ] Invariant cache hit.
[2024-06-01 01:23:26] [INFO ] [Real]Absence check using 63 positive place invariants in 9 ms returned sat
[2024-06-01 01:23:26] [INFO ] [Real]Absence check using 63 positive and 3 generalized place invariants in 4 ms returned sat
[2024-06-01 01:23:26] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2024-06-01 01:23:26] [INFO ] Computed and/alt/rep : 33/65/33 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 01:23:26] [INFO ] Added : 30 causal constraints over 6 iterations in 76 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 4 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 65/65 transitions.
Applied a total of 0 rules in 2 ms. Remains 130 /130 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2024-06-01 01:23:26] [INFO ] Invariant cache hit.
[2024-06-01 01:23:26] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-01 01:23:26] [INFO ] Invariant cache hit.
[2024-06-01 01:23:26] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
[2024-06-01 01:23:26] [INFO ] Redundant transitions in 0 ms returned []
Running 33 sub problems to find dead transitions.
[2024-06-01 01:23:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (OVERLAPS) 63/129 variables, 63/64 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (OVERLAPS) 1/130 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 65/195 variables, 130/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (OVERLAPS) 0/195 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 196 constraints, problems are : Problem set: 0 solved, 33 unsolved in 739 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (OVERLAPS) 63/129 variables, 63/64 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (OVERLAPS) 1/130 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 65/195 variables, 130/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 33/229 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 10 (OVERLAPS) 0/195 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 229 constraints, problems are : Problem set: 0 solved, 33 unsolved in 1438 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints]
After SMT, in 2184ms problems are : Problem set: 0 solved, 33 unsolved
Search for dead transitions found 0 dead transitions in 2184ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2361 ms. Remains : 130/130 places, 65/65 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 288 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 108 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 152 steps (0 resets) in 4 ms. (30 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F p1)]
Knowledge based reduction with 1 factoid took 337 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 116 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2024-06-01 01:23:29] [INFO ] Invariant cache hit.
[2024-06-01 01:23:29] [INFO ] [Real]Absence check using 63 positive place invariants in 9 ms returned sat
[2024-06-01 01:23:29] [INFO ] [Real]Absence check using 63 positive and 3 generalized place invariants in 3 ms returned sat
[2024-06-01 01:23:29] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2024-06-01 01:23:29] [INFO ] Computed and/alt/rep : 33/65/33 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 01:23:29] [INFO ] Added : 30 causal constraints over 6 iterations in 73 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 1 reset in 337 ms.
Product exploration explored 100000 steps with 0 reset in 448 ms.
Support contains 4 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 65/65 transitions.
Applied a total of 0 rules in 1 ms. Remains 130 /130 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2024-06-01 01:23:30] [INFO ] Invariant cache hit.
[2024-06-01 01:23:30] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-06-01 01:23:30] [INFO ] Invariant cache hit.
[2024-06-01 01:23:30] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
[2024-06-01 01:23:30] [INFO ] Redundant transitions in 0 ms returned []
Running 33 sub problems to find dead transitions.
[2024-06-01 01:23:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (OVERLAPS) 63/129 variables, 63/64 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (OVERLAPS) 1/130 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 65/195 variables, 130/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (OVERLAPS) 0/195 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 196 constraints, problems are : Problem set: 0 solved, 33 unsolved in 753 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (OVERLAPS) 63/129 variables, 63/64 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (OVERLAPS) 1/130 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 65/195 variables, 130/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 33/229 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 10 (OVERLAPS) 0/195 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 229 constraints, problems are : Problem set: 0 solved, 33 unsolved in 1396 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints]
After SMT, in 2154ms problems are : Problem set: 0 solved, 33 unsolved
Search for dead transitions found 0 dead transitions in 2155ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2328 ms. Remains : 130/130 places, 65/65 transitions.
Treatment of property CircularTrains-PT-096-LTLFireability-13 finished in 9316 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(G(p1))))'
Support contains 4 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 168 /168 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 168 cols
[2024-06-01 01:23:33] [INFO ] Computed 73 invariants in 1 ms
[2024-06-01 01:23:33] [INFO ] Implicit Places using invariants in 87 ms returned [3, 29, 146, 148, 150, 158, 163, 164]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 88 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 160/168 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 160 /160 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 90 ms. Remains : 160/168 places, 96/96 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CircularTrains-PT-096-LTLFireability-15
Product exploration explored 100000 steps with 1493 reset in 385 ms.
Product exploration explored 100000 steps with 1478 reset in 420 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 105 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 245 steps (0 resets) in 5 ms. (40 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 9 factoid took 123 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 101 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 96 rows 160 cols
[2024-06-01 01:23:34] [INFO ] Computed 65 invariants in 1 ms
[2024-06-01 01:23:34] [INFO ] [Real]Absence check using 63 positive place invariants in 10 ms returned sat
[2024-06-01 01:23:34] [INFO ] [Real]Absence check using 63 positive and 2 generalized place invariants in 4 ms returned sat
[2024-06-01 01:23:34] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2024-06-01 01:23:34] [INFO ] Computed and/alt/rep : 64/96/64 causal constraints (skipped 0 transitions) in 7 ms.
[2024-06-01 01:23:35] [INFO ] Added : 61 causal constraints over 13 iterations in 203 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 160 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 96/96 transitions.
Applied a total of 0 rules in 2 ms. Remains 160 /160 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2024-06-01 01:23:35] [INFO ] Invariant cache hit.
[2024-06-01 01:23:35] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-01 01:23:35] [INFO ] Invariant cache hit.
[2024-06-01 01:23:35] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
Running 64 sub problems to find dead transitions.
[2024-06-01 01:23:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 63/159 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 1/160 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 96/256 variables, 160/225 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 0/256 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 225 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1559 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 63/159 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 1/160 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 96/256 variables, 160/225 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 64/289 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (OVERLAPS) 0/256 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 289 constraints, problems are : Problem set: 0 solved, 64 unsolved in 4174 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
After SMT, in 5738ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 5739ms
Finished structural reductions in LTL mode , in 1 iterations and 5928 ms. Remains : 160/160 places, 96/96 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 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 126 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 246 steps (0 resets) in 5 ms. (41 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 73 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-06-01 01:23:41] [INFO ] Invariant cache hit.
[2024-06-01 01:23:41] [INFO ] [Real]Absence check using 63 positive place invariants in 9 ms returned sat
[2024-06-01 01:23:41] [INFO ] [Real]Absence check using 63 positive and 2 generalized place invariants in 9 ms returned sat
[2024-06-01 01:23:41] [INFO ] [Real]Absence check using state equation in 166 ms returned sat
[2024-06-01 01:23:41] [INFO ] Computed and/alt/rep : 64/96/64 causal constraints (skipped 0 transitions) in 6 ms.
[2024-06-01 01:23:42] [INFO ] Added : 61 causal constraints over 13 iterations in 281 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1503 reset in 372 ms.
Product exploration explored 100000 steps with 1462 reset in 398 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 160/160 places, 96/96 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 160 transition count 96
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 30 place count 160 transition count 96
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 32 place count 160 transition count 96
Deduced a syphon composed of 32 places in 0 ms
Applied a total of 32 rules in 8 ms. Remains 160 /160 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2024-06-01 01:23:43] [INFO ] Redundant transitions in 0 ms returned []
Running 64 sub problems to find dead transitions.
// Phase 1: matrix 96 rows 160 cols
[2024-06-01 01:23:43] [INFO ] Computed 65 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 63/159 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2024-06-01 01:23:43] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 0 ms to minimize.
[2024-06-01 01:23:43] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2024-06-01 01:23:43] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
[2024-06-01 01:23:43] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
[2024-06-01 01:23:43] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
[2024-06-01 01:23:43] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
[2024-06-01 01:23:43] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-06-01 01:23:43] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2024-06-01 01:23:43] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
[2024-06-01 01:23:43] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
[2024-06-01 01:23:43] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
[2024-06-01 01:23:43] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
Problem TDEAD36 is UNSAT
[2024-06-01 01:23:43] [INFO ] Deduced a trap composed of 2 places in 12 ms of which 1 ms to minimize.
Problem TDEAD37 is UNSAT
[2024-06-01 01:23:43] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD40 is UNSAT
[2024-06-01 01:23:43] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
Problem TDEAD41 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD59 is UNSAT
[2024-06-01 01:23:44] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
[2024-06-01 01:23:44] [INFO ] Deduced a trap composed of 2 places in 13 ms of which 0 ms to minimize.
Problem TDEAD61 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD54 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 17/81 constraints. Problems are: Problem set: 17 solved, 47 unsolved
[2024-06-01 01:23:44] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-06-01 01:23:44] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2024-06-01 01:23:44] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
[2024-06-01 01:23:44] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 1 ms to minimize.
[2024-06-01 01:23:44] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem TDEAD30 is UNSAT
[2024-06-01 01:23:44] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD42 is UNSAT
[2024-06-01 01:23:44] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
Problem TDEAD47 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD16 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 7/88 constraints. Problems are: Problem set: 24 solved, 40 unsolved
[2024-06-01 01:23:44] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-06-01 01:23:44] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-06-01 01:23:44] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
[2024-06-01 01:23:44] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-06-01 01:23:44] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
[2024-06-01 01:23:44] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD6 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 6/94 constraints. Problems are: Problem set: 30 solved, 34 unsolved
[2024-06-01 01:23:44] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-06-01 01:23:44] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
Problem TDEAD7 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 2/96 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 0/96 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 8 (OVERLAPS) 1/160 variables, 1/97 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/160 variables, 0/97 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 10 (OVERLAPS) 96/256 variables, 160/257 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/256 variables, 0/257 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 12 (OVERLAPS) 0/256 variables, 0/257 constraints. Problems are: Problem set: 32 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 257 constraints, problems are : Problem set: 32 solved, 32 unsolved in 2357 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 32 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 95/159 variables, 63/63 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 1/64 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 32/96 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/96 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 5 (OVERLAPS) 1/160 variables, 1/97 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 0/97 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 96/256 variables, 160/257 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 32/289 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/256 variables, 0/289 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 10 (OVERLAPS) 0/256 variables, 0/289 constraints. Problems are: Problem set: 32 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 289 constraints, problems are : Problem set: 32 solved, 32 unsolved in 1541 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 32/64 constraints, Known Traps: 32/32 constraints]
After SMT, in 3905ms problems are : Problem set: 32 solved, 32 unsolved
Search for dead transitions found 32 dead transitions in 3906ms
Found 32 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 32 transitions
Dead transitions reduction (with SMT) removed 32 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 160/160 places, 64/96 transitions.
Graph (complete) has 256 edges and 160 vertex of which 128 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.0 ms
Discarding 32 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2 ms. Remains 128 /160 variables (removed 32) and now considering 64/64 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 128/160 places, 64/96 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3921 ms. Remains : 128/160 places, 64/96 transitions.
Support contains 2 out of 160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 96/96 transitions.
Applied a total of 0 rules in 2 ms. Remains 160 /160 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 160 cols
[2024-06-01 01:23:47] [INFO ] Computed 65 invariants in 2 ms
[2024-06-01 01:23:47] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-06-01 01:23:47] [INFO ] Invariant cache hit.
[2024-06-01 01:23:47] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
Running 64 sub problems to find dead transitions.
[2024-06-01 01:23:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 63/159 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 1/160 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 96/256 variables, 160/225 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 0/256 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 225 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1531 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 63/159 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 1/160 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 96/256 variables, 160/225 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 64/289 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (OVERLAPS) 0/256 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 289 constraints, problems are : Problem set: 0 solved, 64 unsolved in 4163 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
After SMT, in 5701ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 5702ms
Finished structural reductions in LTL mode , in 1 iterations and 5890 ms. Remains : 160/160 places, 96/96 transitions.
Treatment of property CircularTrains-PT-096-LTLFireability-15 finished in 19909 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||(F((G(p2)&&p1))&&F(p0))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||(F(p2)&&p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(((X(p0)||F(!p1)) U (G((X(p0)||F(!p1)))||(!p2&&(X(p0)||F(!p1)))))))||(!p2&&F(((X(p0)||F(!p1)) U (G((X(p0)||F(!p1)))||(!p2&&(X(p0)||F(!p1))))))))))'
Found a Shortening insensitive property : CircularTrains-PT-096-LTLFireability-09
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), false]
Support contains 4 out of 168 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 168/168 places, 96/96 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 168 transition count 78
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 36 place count 150 transition count 78
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 36 place count 150 transition count 73
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 46 place count 145 transition count 73
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 58 place count 139 transition count 67
Applied a total of 58 rules in 11 ms. Remains 139 /168 variables (removed 29) and now considering 67/96 (removed 29) transitions.
// Phase 1: matrix 67 rows 139 cols
[2024-06-01 01:23:53] [INFO ] Computed 73 invariants in 2 ms
[2024-06-01 01:23:53] [INFO ] Implicit Places using invariants in 87 ms returned [2, 120, 122, 124, 130, 135, 136]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 88 ms to find 7 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 132/168 places, 67/96 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 132 transition count 66
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 131 transition count 65
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 130 transition count 65
Applied a total of 4 rules in 4 ms. Remains 130 /132 variables (removed 2) and now considering 65/67 (removed 2) transitions.
// Phase 1: matrix 65 rows 130 cols
[2024-06-01 01:23:53] [INFO ] Computed 66 invariants in 1 ms
[2024-06-01 01:23:53] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-06-01 01:23:53] [INFO ] Invariant cache hit.
[2024-06-01 01:23:53] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 130/168 places, 65/96 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 274 ms. Remains : 130/168 places, 65/96 transitions.
Running random walk in product with property : CircularTrains-PT-096-LTLFireability-09
Product exploration explored 100000 steps with 6323 reset in 424 ms.
Product exploration explored 100000 steps with 6348 reset in 470 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (X (NOT (AND p2 p1 (NOT p0)))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p2 p1 p0))), (X (X (NOT (AND p2 p1 p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 533 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), false]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 40000 steps (8 resets) in 214 ms. (186 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 1/1 properties
[2024-06-01 01:23:55] [INFO ] Invariant cache hit.
Problem apf2 is UNSAT
After SMT solving in domain Real declared 4/195 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 14 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, Generalized P Invariants (flows): 0/3 constraints, State Equation: 0/130 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 15ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (X (NOT (AND p2 p1 (NOT p0))))), (G (OR (NOT p1) p0 (NOT p2)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p2 p1 p0))), (X (X (NOT (AND p2 p1 p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p1) (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p1) p0))), (F p1), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR (NOT p1) (NOT p0))))]
Knowledge based reduction with 6 factoid took 757 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) p1), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) p1), (AND p1 (NOT p0))]
Support contains 4 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 65/65 transitions.
Applied a total of 0 rules in 1 ms. Remains 130 /130 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2024-06-01 01:23:56] [INFO ] Invariant cache hit.
[2024-06-01 01:23:56] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-01 01:23:56] [INFO ] Invariant cache hit.
[2024-06-01 01:23:56] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
Running 33 sub problems to find dead transitions.
[2024-06-01 01:23:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 63/129 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (OVERLAPS) 1/130 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (OVERLAPS) 65/195 variables, 130/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (OVERLAPS) 0/195 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 196 constraints, problems are : Problem set: 0 solved, 33 unsolved in 666 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 63/129 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (OVERLAPS) 1/130 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (OVERLAPS) 65/195 variables, 130/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 33/229 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (OVERLAPS) 0/195 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 229 constraints, problems are : Problem set: 0 solved, 33 unsolved in 1651 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints]
After SMT, in 2325ms problems are : Problem set: 0 solved, 33 unsolved
Search for dead transitions found 0 dead transitions in 2325ms
Finished structural reductions in LTL mode , in 1 iterations and 2500 ms. Remains : 130/130 places, 65/65 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X p0)]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 422 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) p1), (AND p1 (NOT p0))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 154 steps (0 resets) in 5 ms. (25 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X p0)]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT p2)), (F (NOT p0)), (F (NOT (OR (NOT p1) p0)))]
Knowledge based reduction with 3 factoid took 492 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) p1), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) p1), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) p1), (AND p1 (NOT p0))]
Product exploration explored 100000 steps with 6332 reset in 427 ms.
Product exploration explored 100000 steps with 6327 reset in 461 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) p1), (AND p1 (NOT p0))]
Support contains 4 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 65/65 transitions.
Applied a total of 0 rules in 4 ms. Remains 130 /130 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2024-06-01 01:24:01] [INFO ] Redundant transitions in 0 ms returned []
Running 33 sub problems to find dead transitions.
[2024-06-01 01:24:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 63/129 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (OVERLAPS) 1/130 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (OVERLAPS) 65/195 variables, 130/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (OVERLAPS) 0/195 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 196 constraints, problems are : Problem set: 0 solved, 33 unsolved in 704 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 63/129 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (OVERLAPS) 1/130 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (OVERLAPS) 65/195 variables, 130/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 33/229 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (OVERLAPS) 0/195 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 229 constraints, problems are : Problem set: 0 solved, 33 unsolved in 1647 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints]
After SMT, in 2356ms problems are : Problem set: 0 solved, 33 unsolved
Search for dead transitions found 0 dead transitions in 2358ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2367 ms. Remains : 130/130 places, 65/65 transitions.
Support contains 4 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 65/65 transitions.
Applied a total of 0 rules in 1 ms. Remains 130 /130 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2024-06-01 01:24:03] [INFO ] Invariant cache hit.
[2024-06-01 01:24:03] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-06-01 01:24:03] [INFO ] Invariant cache hit.
[2024-06-01 01:24:04] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
Running 33 sub problems to find dead transitions.
[2024-06-01 01:24:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 63/129 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (OVERLAPS) 1/130 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (OVERLAPS) 65/195 variables, 130/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (OVERLAPS) 0/195 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 196 constraints, problems are : Problem set: 0 solved, 33 unsolved in 678 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 63/129 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (OVERLAPS) 1/130 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (OVERLAPS) 65/195 variables, 130/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 33/229 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (OVERLAPS) 0/195 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 229 constraints, problems are : Problem set: 0 solved, 33 unsolved in 1599 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints]
After SMT, in 2287ms problems are : Problem set: 0 solved, 33 unsolved
Search for dead transitions found 0 dead transitions in 2288ms
Finished structural reductions in LTL mode , in 1 iterations and 2467 ms. Remains : 130/130 places, 65/65 transitions.
Treatment of property CircularTrains-PT-096-LTLFireability-09 finished in 12869 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(((G(p0) U p1)||F(p2)))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Found a Shortening insensitive property : CircularTrains-PT-096-LTLFireability-11
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 168 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 168/168 places, 96/96 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 168 transition count 79
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 34 place count 151 transition count 79
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 34 place count 151 transition count 72
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 48 place count 144 transition count 72
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 58 place count 139 transition count 67
Applied a total of 58 rules in 11 ms. Remains 139 /168 variables (removed 29) and now considering 67/96 (removed 29) transitions.
// Phase 1: matrix 67 rows 139 cols
[2024-06-01 01:24:06] [INFO ] Computed 73 invariants in 1 ms
[2024-06-01 01:24:06] [INFO ] Implicit Places using invariants in 88 ms returned [2, 23, 120, 122, 124, 130, 135, 136]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 89 ms to find 8 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 131/168 places, 67/96 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 131 transition count 65
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 129 transition count 65
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 129 transition count 64
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 128 transition count 64
Applied a total of 6 rules in 3 ms. Remains 128 /131 variables (removed 3) and now considering 64/67 (removed 3) transitions.
// Phase 1: matrix 64 rows 128 cols
[2024-06-01 01:24:06] [INFO ] Computed 65 invariants in 0 ms
[2024-06-01 01:24:06] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-06-01 01:24:06] [INFO ] Invariant cache hit.
[2024-06-01 01:24:06] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 128/168 places, 64/96 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 262 ms. Remains : 128/168 places, 64/96 transitions.
Running random walk in product with property : CircularTrains-PT-096-LTLFireability-11
Product exploration explored 100000 steps with 2952 reset in 400 ms.
Product exploration explored 100000 steps with 2890 reset in 422 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 130 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 103 steps (0 resets) in 6 ms. (14 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 150 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
[2024-06-01 01:24:08] [INFO ] Invariant cache hit.
[2024-06-01 01:24:08] [INFO ] [Real]Absence check using 63 positive place invariants in 9 ms returned sat
[2024-06-01 01:24:08] [INFO ] [Real]Absence check using 63 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-01 01:24:08] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2024-06-01 01:24:08] [INFO ] Computed and/alt/rep : 32/64/32 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 01:24:08] [INFO ] Added : 30 causal constraints over 6 iterations in 70 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 128 /128 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-06-01 01:24:08] [INFO ] Invariant cache hit.
[2024-06-01 01:24:08] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-06-01 01:24:08] [INFO ] Invariant cache hit.
[2024-06-01 01:24:08] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
[2024-06-01 01:24:08] [INFO ] Redundant transitions in 0 ms returned []
Running 32 sub problems to find dead transitions.
[2024-06-01 01:24:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 63/127 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/128 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 64/192 variables, 128/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (OVERLAPS) 0/192 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 193 constraints, problems are : Problem set: 0 solved, 32 unsolved in 643 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 63/127 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/128 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 64/192 variables, 128/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 32/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 225 constraints, problems are : Problem set: 0 solved, 32 unsolved in 1510 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
After SMT, in 2157ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 2158ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2320 ms. Remains : 128/128 places, 64/64 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 107 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 120 steps (0 resets) in 7 ms. (15 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 235 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
[2024-06-01 01:24:11] [INFO ] Invariant cache hit.
[2024-06-01 01:24:11] [INFO ] [Real]Absence check using 63 positive place invariants in 9 ms returned sat
[2024-06-01 01:24:11] [INFO ] [Real]Absence check using 63 positive and 2 generalized place invariants in 3 ms returned sat
[2024-06-01 01:24:11] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2024-06-01 01:24:11] [INFO ] Computed and/alt/rep : 32/64/32 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 01:24:11] [INFO ] Added : 30 causal constraints over 6 iterations in 69 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2840 reset in 394 ms.
Product exploration explored 100000 steps with 2823 reset in 422 ms.
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 128 /128 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-06-01 01:24:12] [INFO ] Invariant cache hit.
[2024-06-01 01:24:12] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-06-01 01:24:12] [INFO ] Invariant cache hit.
[2024-06-01 01:24:12] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2024-06-01 01:24:12] [INFO ] Redundant transitions in 0 ms returned []
Running 32 sub problems to find dead transitions.
[2024-06-01 01:24:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 63/127 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/128 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 64/192 variables, 128/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (OVERLAPS) 0/192 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 193 constraints, problems are : Problem set: 0 solved, 32 unsolved in 657 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 63/127 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/128 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 64/192 variables, 128/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 32/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 225 constraints, problems are : Problem set: 0 solved, 32 unsolved in 1558 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
After SMT, in 2220ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 2221ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2394 ms. Remains : 128/128 places, 64/64 transitions.
Treatment of property CircularTrains-PT-096-LTLFireability-11 finished in 8465 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&F(G(p1)))))'
Found a Shortening insensitive property : CircularTrains-PT-096-LTLFireability-12
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 4 out of 168 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 168/168 places, 96/96 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 168 transition count 78
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 36 place count 150 transition count 78
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 36 place count 150 transition count 73
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 46 place count 145 transition count 73
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 58 place count 139 transition count 67
Applied a total of 58 rules in 6 ms. Remains 139 /168 variables (removed 29) and now considering 67/96 (removed 29) transitions.
// Phase 1: matrix 67 rows 139 cols
[2024-06-01 01:24:15] [INFO ] Computed 73 invariants in 2 ms
[2024-06-01 01:24:15] [INFO ] Implicit Places using invariants in 85 ms returned [2, 23, 120, 122, 124, 130, 136]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 86 ms to find 7 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 132/168 places, 67/96 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 132 transition count 66
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 131 transition count 66
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 131 transition count 65
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 130 transition count 65
Applied a total of 4 rules in 3 ms. Remains 130 /132 variables (removed 2) and now considering 65/67 (removed 2) transitions.
// Phase 1: matrix 65 rows 130 cols
[2024-06-01 01:24:15] [INFO ] Computed 66 invariants in 1 ms
[2024-06-01 01:24:15] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-06-01 01:24:15] [INFO ] Invariant cache hit.
[2024-06-01 01:24:15] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 130/168 places, 65/96 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 258 ms. Remains : 130/168 places, 65/96 transitions.
Running random walk in product with property : CircularTrains-PT-096-LTLFireability-12
Product exploration explored 100000 steps with 0 reset in 328 ms.
Product exploration explored 100000 steps with 0 reset in 388 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 233 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 155 steps (0 resets) in 6 ms. (22 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 267 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 4 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 65/65 transitions.
Applied a total of 0 rules in 2 ms. Remains 130 /130 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2024-06-01 01:24:17] [INFO ] Invariant cache hit.
[2024-06-01 01:24:17] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-01 01:24:17] [INFO ] Invariant cache hit.
[2024-06-01 01:24:17] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
Running 33 sub problems to find dead transitions.
[2024-06-01 01:24:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (OVERLAPS) 63/129 variables, 63/64 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (OVERLAPS) 1/130 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 65/195 variables, 130/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (OVERLAPS) 0/195 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 196 constraints, problems are : Problem set: 0 solved, 33 unsolved in 738 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (OVERLAPS) 63/129 variables, 63/64 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (OVERLAPS) 1/130 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 65/195 variables, 130/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 33/229 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 10 (OVERLAPS) 0/195 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 229 constraints, problems are : Problem set: 0 solved, 33 unsolved in 1676 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints]
After SMT, in 2424ms problems are : Problem set: 0 solved, 33 unsolved
Search for dead transitions found 0 dead transitions in 2425ms
Finished structural reductions in LTL mode , in 1 iterations and 2595 ms. Remains : 130/130 places, 65/65 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 191 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 177 steps (0 resets) in 7 ms. (22 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 203 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 336 ms.
Product exploration explored 100000 steps with 0 reset in 431 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 4 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 65/65 transitions.
Applied a total of 0 rules in 2 ms. Remains 130 /130 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2024-06-01 01:24:21] [INFO ] Redundant transitions in 0 ms returned []
Running 33 sub problems to find dead transitions.
[2024-06-01 01:24:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (OVERLAPS) 63/129 variables, 63/64 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (OVERLAPS) 1/130 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 65/195 variables, 130/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (OVERLAPS) 0/195 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 196 constraints, problems are : Problem set: 0 solved, 33 unsolved in 732 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (OVERLAPS) 63/129 variables, 63/64 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (OVERLAPS) 1/130 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 65/195 variables, 130/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 33/229 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 10 (OVERLAPS) 0/195 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 229 constraints, problems are : Problem set: 0 solved, 33 unsolved in 1670 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints]
After SMT, in 2410ms problems are : Problem set: 0 solved, 33 unsolved
Search for dead transitions found 0 dead transitions in 2412ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2421 ms. Remains : 130/130 places, 65/65 transitions.
Support contains 4 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 65/65 transitions.
Applied a total of 0 rules in 2 ms. Remains 130 /130 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2024-06-01 01:24:24] [INFO ] Invariant cache hit.
[2024-06-01 01:24:24] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-06-01 01:24:24] [INFO ] Invariant cache hit.
[2024-06-01 01:24:24] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
Running 33 sub problems to find dead transitions.
[2024-06-01 01:24:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (OVERLAPS) 63/129 variables, 63/64 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (OVERLAPS) 1/130 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 65/195 variables, 130/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (OVERLAPS) 0/195 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 196 constraints, problems are : Problem set: 0 solved, 33 unsolved in 716 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (OVERLAPS) 63/129 variables, 63/64 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (OVERLAPS) 1/130 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 65/195 variables, 130/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 33/229 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 10 (OVERLAPS) 0/195 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 229 constraints, problems are : Problem set: 0 solved, 33 unsolved in 1666 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints]
After SMT, in 2388ms problems are : Problem set: 0 solved, 33 unsolved
Search for dead transitions found 0 dead transitions in 2388ms
Finished structural reductions in LTL mode , in 1 iterations and 2565 ms. Remains : 130/130 places, 65/65 transitions.
Treatment of property CircularTrains-PT-096-LTLFireability-12 finished in 11855 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(G(p1))))'
Found a Lengthening insensitive property : CircularTrains-PT-096-LTLFireability-15
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 168 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 168/168 places, 96/96 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 168 transition count 80
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 152 transition count 80
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 32 place count 152 transition count 72
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 48 place count 144 transition count 72
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 60 place count 138 transition count 66
Applied a total of 60 rules in 9 ms. Remains 138 /168 variables (removed 30) and now considering 66/96 (removed 30) transitions.
// Phase 1: matrix 66 rows 138 cols
[2024-06-01 01:24:27] [INFO ] Computed 73 invariants in 1 ms
[2024-06-01 01:24:27] [INFO ] Implicit Places using invariants in 81 ms returned [2, 23, 119, 121, 123, 129, 134, 135]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 82 ms to find 8 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 130/168 places, 66/96 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 130 transition count 65
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 129 transition count 65
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 129 transition count 64
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 128 transition count 64
Applied a total of 4 rules in 4 ms. Remains 128 /130 variables (removed 2) and now considering 64/66 (removed 2) transitions.
// Phase 1: matrix 64 rows 128 cols
[2024-06-01 01:24:27] [INFO ] Computed 65 invariants in 0 ms
[2024-06-01 01:24:27] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-06-01 01:24:27] [INFO ] Invariant cache hit.
[2024-06-01 01:24:27] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 128/168 places, 64/96 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 254 ms. Remains : 128/168 places, 64/96 transitions.
Running random walk in product with property : CircularTrains-PT-096-LTLFireability-15
Product exploration explored 100000 steps with 2907 reset in 384 ms.
Product exploration explored 100000 steps with 2918 reset in 424 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 286 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 197 steps (0 resets) in 6 ms. (28 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1))), (F p0)]
Knowledge based reduction with 5 factoid took 315 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 125 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-06-01 01:24:29] [INFO ] Invariant cache hit.
[2024-06-01 01:24:29] [INFO ] [Real]Absence check using 63 positive place invariants in 9 ms returned sat
[2024-06-01 01:24:29] [INFO ] [Real]Absence check using 63 positive and 2 generalized place invariants in 3 ms returned sat
[2024-06-01 01:24:29] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2024-06-01 01:24:29] [INFO ] Computed and/alt/rep : 32/64/32 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 01:24:29] [INFO ] Added : 30 causal constraints over 6 iterations in 76 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 128 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Applied a total of 0 rules in 0 ms. Remains 128 /128 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-06-01 01:24:29] [INFO ] Invariant cache hit.
[2024-06-01 01:24:29] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-06-01 01:24:29] [INFO ] Invariant cache hit.
[2024-06-01 01:24:29] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
Running 32 sub problems to find dead transitions.
[2024-06-01 01:24:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 63/127 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/128 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 64/192 variables, 128/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (OVERLAPS) 0/192 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 193 constraints, problems are : Problem set: 0 solved, 32 unsolved in 617 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 63/127 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/128 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 64/192 variables, 128/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 32/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 225 constraints, problems are : Problem set: 0 solved, 32 unsolved in 1415 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
After SMT, in 2038ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 2040ms
Finished structural reductions in LTL mode , in 1 iterations and 2211 ms. Remains : 128/128 places, 64/64 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 187 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 128 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 112 steps (0 resets) in 4 ms. (22 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 134 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-06-01 01:24:32] [INFO ] Invariant cache hit.
[2024-06-01 01:24:32] [INFO ] [Real]Absence check using 63 positive place invariants in 9 ms returned sat
[2024-06-01 01:24:32] [INFO ] [Real]Absence check using 63 positive and 2 generalized place invariants in 3 ms returned sat
[2024-06-01 01:24:32] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2024-06-01 01:24:32] [INFO ] Computed and/alt/rep : 32/64/32 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 01:24:32] [INFO ] Added : 30 causal constraints over 6 iterations in 83 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2880 reset in 394 ms.
Product exploration explored 100000 steps with 2924 reset in 427 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 128 /128 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-06-01 01:24:33] [INFO ] Redundant transitions in 0 ms returned []
Running 32 sub problems to find dead transitions.
[2024-06-01 01:24:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 63/127 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/128 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 64/192 variables, 128/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (OVERLAPS) 0/192 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 193 constraints, problems are : Problem set: 0 solved, 32 unsolved in 654 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 63/127 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/128 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 64/192 variables, 128/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 32/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 225 constraints, problems are : Problem set: 0 solved, 32 unsolved in 1479 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
After SMT, in 2140ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 2140ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2149 ms. Remains : 128/128 places, 64/64 transitions.
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 128 /128 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-06-01 01:24:35] [INFO ] Invariant cache hit.
[2024-06-01 01:24:35] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-01 01:24:35] [INFO ] Invariant cache hit.
[2024-06-01 01:24:36] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
Running 32 sub problems to find dead transitions.
[2024-06-01 01:24:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 63/127 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/128 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 64/192 variables, 128/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (OVERLAPS) 0/192 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 193 constraints, problems are : Problem set: 0 solved, 32 unsolved in 655 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 63/127 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/128 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 64/192 variables, 128/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 32/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 225 constraints, problems are : Problem set: 0 solved, 32 unsolved in 1517 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
After SMT, in 2178ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 2179ms
Finished structural reductions in LTL mode , in 1 iterations and 2361 ms. Remains : 128/128 places, 64/64 transitions.
Treatment of property CircularTrains-PT-096-LTLFireability-15 finished in 11304 ms.
[2024-06-01 01:24:38] [INFO ] Flatten gal took : 10 ms
[2024-06-01 01:24:38] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2024-06-01 01:24:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 168 places, 96 transitions and 336 arcs took 6 ms.
Total runtime 208170 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA CircularTrains-PT-096-LTLFireability-00 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : CircularTrains-PT-096-LTLFireability-04
Could not compute solution for formula : CircularTrains-PT-096-LTLFireability-07
FORMULA CircularTrains-PT-096-LTLFireability-08 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : CircularTrains-PT-096-LTLFireability-09
Could not compute solution for formula : CircularTrains-PT-096-LTLFireability-10
Could not compute solution for formula : CircularTrains-PT-096-LTLFireability-11
FORMULA CircularTrains-PT-096-LTLFireability-12 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA CircularTrains-PT-096-LTLFireability-13 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : CircularTrains-PT-096-LTLFireability-15

BK_STOP 1717205218865

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name CircularTrains-PT-096-LTLFireability-00
ltl formula formula --ltl=/tmp/4779/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 168 places, 96 transitions and 336 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4779/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4779/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4779/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4779/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): There are 169 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 169, there are 156 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~827!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 2818
pnml2lts-mc( 0/ 4): unique transitions count: 62067
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 2821
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2821
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2821 states 62263 transitions, fanout: 22.071
pnml2lts-mc( 0/ 4): Total exploration time 0.100 sec (0.100 sec minimum, 0.100 sec on average)
pnml2lts-mc( 0/ 4): States per second: 28210, Transitions per second: 622630
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.7MB, 37.0 B/state, compr.: 5.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 96 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.7MB (~256.0MB paged-in)
ltl formula name CircularTrains-PT-096-LTLFireability-04
ltl formula formula --ltl=/tmp/4779/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 168 places, 96 transitions and 336 arcs
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4779/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4779/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4779/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4779/ltl_1_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 170 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 169, there are 111 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~755 levels ~10000 states ~34076 transitions
pnml2lts-mc( 2/ 4): ~755 levels ~20000 states ~56412 transitions
pnml2lts-mc( 2/ 4): ~755 levels ~40000 states ~104716 transitions
pnml2lts-mc( 2/ 4): ~755 levels ~80000 states ~204156 transitions
pnml2lts-mc( 1/ 4): ~749 levels ~160000 states ~374812 transitions
pnml2lts-mc( 0/ 4): ~755 levels ~320000 states ~858304 transitions
pnml2lts-mc( 0/ 4): ~755 levels ~640000 states ~1784164 transitions
pnml2lts-mc( 1/ 4): ~749 levels ~1280000 states ~3372556 transitions
pnml2lts-mc( 0/ 4): ~755 levels ~2560000 states ~7654972 transitions
pnml2lts-mc( 1/ 4): ~749 levels ~5120000 states ~15127504 transitions
pnml2lts-mc( 3/ 4): ~737 levels ~10240000 states ~31100492 transitions
pnml2lts-mc( 3/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 12171479
pnml2lts-mc( 0/ 4): unique states count: 12174124
pnml2lts-mc( 0/ 4): unique transitions count: 39219841
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 27025143
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 12174546
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2996
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 12174546 states 39221621 transitions, fanout: 3.222
pnml2lts-mc( 0/ 4): Total exploration time 27.310 sec (27.300 sec minimum, 27.305 sec on average)
pnml2lts-mc( 0/ 4): States per second: 445791, Transitions per second: 1436163
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 157.0MB, 13.5 B/state, compr.: 2.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 36.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 96 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 157.0MB (~256.0MB paged-in)
ltl formula name CircularTrains-PT-096-LTLFireability-07
ltl formula formula --ltl=/tmp/4779/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 168 places, 96 transitions and 336 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4779/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4779/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4779/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4779/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 170 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 169, there are 101 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~799 levels ~10000 states ~34776 transitions
pnml2lts-mc( 0/ 4): ~799 levels ~20000 states ~56644 transitions
pnml2lts-mc( 0/ 4): ~799 levels ~40000 states ~100344 transitions
pnml2lts-mc( 3/ 4): ~802 levels ~80000 states ~176732 transitions
pnml2lts-mc( 3/ 4): ~802 levels ~160000 states ~359452 transitions
pnml2lts-mc( 3/ 4): ~802 levels ~320000 states ~749584 transitions
pnml2lts-mc( 1/ 4): ~792 levels ~640000 states ~1506820 transitions
pnml2lts-mc( 1/ 4): ~792 levels ~1280000 states ~3228596 transitions
pnml2lts-mc( 1/ 4): ~792 levels ~2560000 states ~6796060 transitions
pnml2lts-mc( 1/ 4): ~792 levels ~5120000 states ~13876824 transitions
pnml2lts-mc( 2/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 9651475
pnml2lts-mc( 0/ 4): unique states count: 9654299
pnml2lts-mc( 0/ 4): unique transitions count: 28968591
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 19289802
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 9654302
pnml2lts-mc( 0/ 4): - cum. max stack depth: 3195
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 9654302 states 28968690 transitions, fanout: 3.001
pnml2lts-mc( 0/ 4): Total exploration time 20.720 sec (20.710 sec minimum, 20.715 sec on average)
pnml2lts-mc( 0/ 4): States per second: 465941, Transitions per second: 1398103
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 137.8MB, 14.9 B/state, compr.: 2.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 28.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 96 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 137.8MB (~256.0MB paged-in)
ltl formula name CircularTrains-PT-096-LTLFireability-08
ltl formula formula --ltl=/tmp/4779/ltl_3_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 168 places, 96 transitions and 336 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4779/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4779/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4779/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4779/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 169 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 169, there are 102 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~811!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 2968
pnml2lts-mc( 0/ 4): unique transitions count: 25329
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 2972
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2972
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2972 states 25461 transitions, fanout: 8.567
pnml2lts-mc( 0/ 4): Total exploration time 0.100 sec (0.100 sec minimum, 0.100 sec on average)
pnml2lts-mc( 0/ 4): States per second: 29720, Transitions per second: 254610
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.7MB, 36.7 B/state, compr.: 5.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 96 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.7MB (~256.0MB paged-in)
ltl formula name CircularTrains-PT-096-LTLFireability-09
ltl formula formula --ltl=/tmp/4779/ltl_4_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 168 places, 96 transitions and 336 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4779/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4779/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4779/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4779/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 170 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 169, there are 101 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~425 levels ~10000 states ~36212 transitions
pnml2lts-mc( 0/ 4): ~425 levels ~20000 states ~52396 transitions
pnml2lts-mc( 0/ 4): ~425 levels ~40000 states ~86552 transitions
pnml2lts-mc( 0/ 4): ~425 levels ~80000 states ~159512 transitions
pnml2lts-mc( 3/ 4): ~413 levels ~160000 states ~301056 transitions
pnml2lts-mc( 3/ 4): ~413 levels ~320000 states ~620268 transitions
pnml2lts-mc( 3/ 4): ~413 levels ~640000 states ~1304500 transitions
pnml2lts-mc( 3/ 4): ~413 levels ~1280000 states ~2667548 transitions
pnml2lts-mc( 3/ 4): ~413 levels ~2560000 states ~5394200 transitions
pnml2lts-mc( 3/ 4): ~413 levels ~5120000 states ~11341852 transitions
pnml2lts-mc( 3/ 4): ~413 levels ~10240000 states ~23810268 transitions
pnml2lts-mc( 0/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 9943159
pnml2lts-mc( 0/ 4): unique states count: 9945167
pnml2lts-mc( 0/ 4): unique transitions count: 26124470
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 18448498
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 10636985
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2342
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 10636985 states 29741707 transitions, fanout: 2.796
pnml2lts-mc( 0/ 4): Total exploration time 22.850 sec (22.840 sec minimum, 22.847 sec on average)
pnml2lts-mc( 0/ 4): States per second: 465514, Transitions per second: 1301606
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 140.0MB, 14.7 B/state, compr.: 2.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 29.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 96 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 140.0MB (~256.0MB paged-in)
ltl formula name CircularTrains-PT-096-LTLFireability-10
ltl formula formula --ltl=/tmp/4779/ltl_5_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 168 places, 96 transitions and 336 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4779/ltl_5_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4779/ltl_5_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4779/ltl_5_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4779/ltl_5_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4): There are 169 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 169, there are 130 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~802 levels ~10000 states ~46996 transitions
pnml2lts-mc( 2/ 4): ~802 levels ~20000 states ~64060 transitions
pnml2lts-mc( 2/ 4): ~802 levels ~40000 states ~105536 transitions
pnml2lts-mc( 2/ 4): ~802 levels ~80000 states ~188124 transitions
pnml2lts-mc( 2/ 4): ~802 levels ~160000 states ~352280 transitions
pnml2lts-mc( 2/ 4): ~802 levels ~320000 states ~746372 transitions
pnml2lts-mc( 3/ 4): ~797 levels ~640000 states ~1514504 transitions
pnml2lts-mc( 3/ 4): ~797 levels ~1280000 states ~3068520 transitions
pnml2lts-mc( 3/ 4): ~797 levels ~2560000 states ~6688024 transitions
pnml2lts-mc( 3/ 4): ~797 levels ~5120000 states ~13836200 transitions
pnml2lts-mc( 3/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 9135722
pnml2lts-mc( 0/ 4): unique states count: 9138450
pnml2lts-mc( 0/ 4): unique transitions count: 26553907
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 17386492
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 9138804
pnml2lts-mc( 0/ 4): - cum. max stack depth: 3181
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 9138804 states 26555267 transitions, fanout: 2.906
pnml2lts-mc( 0/ 4): Total exploration time 19.490 sec (19.470 sec minimum, 19.480 sec on average)
pnml2lts-mc( 0/ 4): States per second: 468897, Transitions per second: 1362507
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 133.9MB, 15.3 B/state, compr.: 2.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 27.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 96 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 133.9MB (~256.0MB paged-in)
ltl formula name CircularTrains-PT-096-LTLFireability-11
ltl formula formula --ltl=/tmp/4779/ltl_6_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 168 places, 96 transitions and 336 arcs
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4779/ltl_6_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4779/ltl_6_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4779/ltl_6_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4779/ltl_6_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 170 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 169, there are 99 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~755 levels ~10000 states ~37108 transitions
pnml2lts-mc( 0/ 4): ~755 levels ~20000 states ~58688 transitions
pnml2lts-mc( 0/ 4): ~755 levels ~40000 states ~105536 transitions
pnml2lts-mc( 0/ 4): ~755 levels ~80000 states ~204932 transitions
pnml2lts-mc( 3/ 4): ~742 levels ~160000 states ~338920 transitions
pnml2lts-mc( 3/ 4): ~742 levels ~320000 states ~725968 transitions
pnml2lts-mc( 2/ 4): ~755 levels ~640000 states ~1494848 transitions
pnml2lts-mc( 2/ 4): ~755 levels ~1280000 states ~3303528 transitions
pnml2lts-mc( 2/ 4): ~755 levels ~2560000 states ~6885392 transitions
pnml2lts-mc( 2/ 4): ~755 levels ~5120000 states ~13847088 transitions
pnml2lts-mc( 0/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 9019787
pnml2lts-mc( 0/ 4): unique states count: 9022435
pnml2lts-mc( 0/ 4): unique transitions count: 27222165
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 18178702
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 9022438
pnml2lts-mc( 0/ 4): - cum. max stack depth: 3003
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 9022438 states 27222261 transitions, fanout: 3.017
pnml2lts-mc( 0/ 4): Total exploration time 19.280 sec (19.270 sec minimum, 19.273 sec on average)
pnml2lts-mc( 0/ 4): States per second: 467969, Transitions per second: 1411943
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 133.0MB, 15.4 B/state, compr.: 2.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 26.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 96 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 133.0MB (~256.0MB paged-in)
ltl formula name CircularTrains-PT-096-LTLFireability-12
ltl formula formula --ltl=/tmp/4779/ltl_7_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 168 places, 96 transitions and 336 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4779/ltl_7_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4779/ltl_7_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4779/ltl_7_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4779/ltl_7_
pnml2lts-mc( 0/ 4): There are 169 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 169, there are 106 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~844!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 2918
pnml2lts-mc( 0/ 4): unique transitions count: 25549
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 2921
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2921
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2921 states 25649 transitions, fanout: 8.781
pnml2lts-mc( 0/ 4): Total exploration time 0.090 sec (0.090 sec minimum, 0.090 sec on average)
pnml2lts-mc( 0/ 4): States per second: 32456, Transitions per second: 284989
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.8MB, 36.8 B/state, compr.: 5.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 96 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.8MB (~256.0MB paged-in)
ltl formula name CircularTrains-PT-096-LTLFireability-13
ltl formula formula --ltl=/tmp/4779/ltl_8_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 168 places, 96 transitions and 336 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4779/ltl_8_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4779/ltl_8_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4779/ltl_8_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4779/ltl_8_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 169 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 169, there are 109 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~821!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 3200
pnml2lts-mc( 0/ 4): unique transitions count: 25632
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 3203
pnml2lts-mc( 0/ 4): - cum. max stack depth: 3203
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 3203 states 25828 transitions, fanout: 8.064
pnml2lts-mc( 0/ 4): Total exploration time 0.090 sec (0.090 sec minimum, 0.090 sec on average)
pnml2lts-mc( 0/ 4): States per second: 35589, Transitions per second: 286978
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.7MB, 37.1 B/state, compr.: 5.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 96 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.7MB (~256.0MB paged-in)
ltl formula name CircularTrains-PT-096-LTLFireability-15
ltl formula formula --ltl=/tmp/4779/ltl_9_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 168 places, 96 transitions and 336 arcs
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4779/ltl_9_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4779/ltl_9_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4779/ltl_9_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4779/ltl_9_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 170 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 169, there are 106 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~755 levels ~10000 states ~34732 transitions
pnml2lts-mc( 2/ 4): ~755 levels ~20000 states ~56580 transitions
pnml2lts-mc( 2/ 4): ~755 levels ~40000 states ~100392 transitions
pnml2lts-mc( 2/ 4): ~755 levels ~80000 states ~199376 transitions
pnml2lts-mc( 1/ 4): ~750 levels ~160000 states ~375680 transitions
pnml2lts-mc( 1/ 4): ~750 levels ~320000 states ~744040 transitions
pnml2lts-mc( 0/ 4): ~739 levels ~640000 states ~1507940 transitions
pnml2lts-mc( 0/ 4): ~739 levels ~1280000 states ~3008308 transitions
pnml2lts-mc( 1/ 4): ~750 levels ~2560000 states ~6784260 transitions
pnml2lts-mc( 0/ 4): ~739 levels ~5120000 states ~13834264 transitions
pnml2lts-mc( 0/ 4): ~739 levels ~10240000 states ~28283984 transitions
pnml2lts-mc( 1/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 13094243
pnml2lts-mc( 0/ 4): unique states count: 13096909
pnml2lts-mc( 0/ 4): unique transitions count: 42189403
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 29067606
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 13096914
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2999
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 13096914 states 42189607 transitions, fanout: 3.221
pnml2lts-mc( 0/ 4): Total exploration time 27.620 sec (27.610 sec minimum, 27.615 sec on average)
pnml2lts-mc( 0/ 4): States per second: 474182, Transitions per second: 1527502
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 164.1MB, 13.1 B/state, compr.: 1.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 39.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 96 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 164.1MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CircularTrains-PT-096"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is CircularTrains-PT-096, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r476-tall-171620505700348"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CircularTrains-PT-096.tgz
mv CircularTrains-PT-096 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;