About the Execution of GreatSPN+red for CircularTrains-PT-192
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 13790.344 | 1254335.00 | 2847545.00 | 2447.70 | TFFFTF?F?T??TTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r069-tall-171620504300356.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is CircularTrains-PT-192, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-tall-171620504300356
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 692K
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K 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 4.1K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K 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 16K Apr 12 14:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 158K Apr 12 14:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 12 14:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 114K Apr 12 14:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:33 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 147K 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-192-LTLFireability-00
FORMULA_NAME CircularTrains-PT-192-LTLFireability-01
FORMULA_NAME CircularTrains-PT-192-LTLFireability-02
FORMULA_NAME CircularTrains-PT-192-LTLFireability-03
FORMULA_NAME CircularTrains-PT-192-LTLFireability-04
FORMULA_NAME CircularTrains-PT-192-LTLFireability-05
FORMULA_NAME CircularTrains-PT-192-LTLFireability-06
FORMULA_NAME CircularTrains-PT-192-LTLFireability-07
FORMULA_NAME CircularTrains-PT-192-LTLFireability-08
FORMULA_NAME CircularTrains-PT-192-LTLFireability-09
FORMULA_NAME CircularTrains-PT-192-LTLFireability-10
FORMULA_NAME CircularTrains-PT-192-LTLFireability-11
FORMULA_NAME CircularTrains-PT-192-LTLFireability-12
FORMULA_NAME CircularTrains-PT-192-LTLFireability-13
FORMULA_NAME CircularTrains-PT-192-LTLFireability-14
FORMULA_NAME CircularTrains-PT-192-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716430936153
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CircularTrains-PT-192
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 02:22:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-23 02:22:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 02:22:17] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2024-05-23 02:22:17] [INFO ] Transformed 384 places.
[2024-05-23 02:22:17] [INFO ] Transformed 192 transitions.
[2024-05-23 02:22:17] [INFO ] Parsed PT model containing 384 places and 192 transitions and 768 arcs in 170 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 6 formulas.
FORMULA CircularTrains-PT-192-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-192-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-192-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-192-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-192-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-192-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 384 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 384/384 places, 192/192 transitions.
Applied a total of 0 rules in 55 ms. Remains 384 /384 variables (removed 0) and now considering 192/192 (removed 0) transitions.
// Phase 1: matrix 192 rows 384 cols
[2024-05-23 02:22:17] [INFO ] Computed 193 invariants in 42 ms
[2024-05-23 02:22:18] [INFO ] Implicit Places using invariants in 489 ms returned [1, 10, 18, 21, 28, 37, 44, 47, 48, 62, 64, 65, 78, 81, 89, 101, 102, 133, 138, 141, 144, 146, 160, 163, 167, 217, 230, 231, 244, 245, 247, 261, 283, 284, 285, 293, 298, 311, 313, 314, 324, 327, 330, 333, 350, 354, 356, 357, 366, 369, 371, 374, 375, 376, 378, 380, 382]
Discarding 57 places :
Implicit Place search using SMT only with invariants took 521 ms to find 57 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 327/384 places, 192/192 transitions.
Applied a total of 0 rules in 24 ms. Remains 327 /327 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 617 ms. Remains : 327/384 places, 192/192 transitions.
Support contains 38 out of 327 places after structural reductions.
[2024-05-23 02:22:18] [INFO ] Flatten gal took : 41 ms
[2024-05-23 02:22:18] [INFO ] Flatten gal took : 18 ms
[2024-05-23 02:22:18] [INFO ] Input system was already deterministic with 192 transitions.
RANDOM walk for 728 steps (0 resets) in 80 ms. (8 steps per ms) remains 0/16 properties
FORMULA CircularTrains-PT-192-LTLFireability-02 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)))'
Support contains 4 out of 327 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 327/327 places, 192/192 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 327 transition count 143
Reduce places removed 49 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 50 rules applied. Total rules applied 99 place count 278 transition count 142
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 100 place count 277 transition count 142
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 100 place count 277 transition count 135
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 114 place count 270 transition count 135
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 3 with 12 rules applied. Total rules applied 126 place count 264 transition count 129
Applied a total of 126 rules in 61 ms. Remains 264 /327 variables (removed 63) and now considering 129/192 (removed 63) transitions.
// Phase 1: matrix 129 rows 264 cols
[2024-05-23 02:22:19] [INFO ] Computed 136 invariants in 3 ms
[2024-05-23 02:22:19] [INFO ] Implicit Places using invariants in 467 ms returned [5, 55, 76, 139, 230, 242, 251]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 469 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 257/327 places, 129/192 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 257 transition count 128
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 256 transition count 128
Applied a total of 2 rules in 10 ms. Remains 256 /257 variables (removed 1) and now considering 128/129 (removed 1) transitions.
// Phase 1: matrix 128 rows 256 cols
[2024-05-23 02:22:19] [INFO ] Computed 129 invariants in 3 ms
[2024-05-23 02:22:19] [INFO ] Implicit Places using invariants in 230 ms returned []
[2024-05-23 02:22:19] [INFO ] Invariant cache hit.
[2024-05-23 02:22:19] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 444 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 256/327 places, 128/192 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 985 ms. Remains : 256/327 places, 128/192 transitions.
Stuttering acceptance computed with spot in 151 ms :[(NOT p0)]
Running random walk in product with property : CircularTrains-PT-192-LTLFireability-03
Product exploration explored 100000 steps with 0 reset in 786 ms.
Product exploration explored 100000 steps with 0 reset in 824 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 based reduction with 3 factoid took 99 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 41 ms :[(NOT p0)]
RANDOM walk for 329 steps (0 resets) in 18 ms. (17 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 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 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
[2024-05-23 02:22:22] [INFO ] Invariant cache hit.
[2024-05-23 02:22:22] [INFO ] [Real]Absence check using 127 positive place invariants in 24 ms returned sat
[2024-05-23 02:22:22] [INFO ] [Real]Absence check using 127 positive and 2 generalized place invariants in 23 ms returned sat
[2024-05-23 02:22:22] [INFO ] [Real]Absence check using state equation in 260 ms returned sat
[2024-05-23 02:22:22] [INFO ] Computed and/alt/rep : 64/128/64 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-23 02:22:22] [INFO ] Added : 62 causal constraints over 13 iterations in 389 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 4 out of 256 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 256/256 places, 128/128 transitions.
Applied a total of 0 rules in 7 ms. Remains 256 /256 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2024-05-23 02:22:22] [INFO ] Invariant cache hit.
[2024-05-23 02:22:23] [INFO ] Implicit Places using invariants in 151 ms returned []
[2024-05-23 02:22:23] [INFO ] Invariant cache hit.
[2024-05-23 02:22:23] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
[2024-05-23 02:22:23] [INFO ] Redundant transitions in 3 ms returned []
Running 64 sub problems to find dead transitions.
[2024-05-23 02:22:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 127/255 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/255 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 1/256 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 128/384 variables, 256/385 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/384 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 0/384 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 384/384 variables, and 385 constraints, problems are : Problem set: 0 solved, 64 unsolved in 2430 ms.
Refiners :[Positive P Invariants (semi-flows): 127/127 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 256/256 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/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 127/255 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/255 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 1/256 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 128/384 variables, 256/385 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/384 variables, 64/449 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/384 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (OVERLAPS) 0/384 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 384/384 variables, and 449 constraints, problems are : Problem set: 0 solved, 64 unsolved in 9070 ms.
Refiners :[Positive P Invariants (semi-flows): 127/127 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 256/256 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
After SMT, in 11537ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 11543ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 11907 ms. Remains : 256/256 places, 128/128 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 69 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 32 ms :[(NOT p0)]
RANDOM walk for 351 steps (0 resets) in 11 ms. (29 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
[2024-05-23 02:22:35] [INFO ] Invariant cache hit.
[2024-05-23 02:22:35] [INFO ] [Real]Absence check using 127 positive place invariants in 24 ms returned sat
[2024-05-23 02:22:35] [INFO ] [Real]Absence check using 127 positive and 2 generalized place invariants in 11 ms returned sat
[2024-05-23 02:22:35] [INFO ] [Real]Absence check using state equation in 260 ms returned sat
[2024-05-23 02:22:35] [INFO ] Computed and/alt/rep : 64/128/64 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-23 02:22:35] [INFO ] Added : 62 causal constraints over 13 iterations in 362 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 652 ms.
Product exploration explored 100000 steps with 0 reset in 771 ms.
Support contains 4 out of 256 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 256/256 places, 128/128 transitions.
Applied a total of 0 rules in 6 ms. Remains 256 /256 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2024-05-23 02:22:37] [INFO ] Invariant cache hit.
[2024-05-23 02:22:37] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-05-23 02:22:37] [INFO ] Invariant cache hit.
[2024-05-23 02:22:37] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
[2024-05-23 02:22:37] [INFO ] Redundant transitions in 3 ms returned []
Running 64 sub problems to find dead transitions.
[2024-05-23 02:22:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 127/255 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/255 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 1/256 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 128/384 variables, 256/385 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/384 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 0/384 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 384/384 variables, and 385 constraints, problems are : Problem set: 0 solved, 64 unsolved in 2192 ms.
Refiners :[Positive P Invariants (semi-flows): 127/127 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 256/256 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/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 127/255 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/255 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 1/256 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 128/384 variables, 256/385 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/384 variables, 64/449 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/384 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (OVERLAPS) 0/384 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 384/384 variables, and 449 constraints, problems are : Problem set: 0 solved, 64 unsolved in 8557 ms.
Refiners :[Positive P Invariants (semi-flows): 127/127 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 256/256 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
After SMT, in 10767ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 10771ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 11128 ms. Remains : 256/256 places, 128/128 transitions.
Treatment of property CircularTrains-PT-192-LTLFireability-03 finished in 29806 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((F(p0) U p1)))))'
Support contains 4 out of 327 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 192/192 transitions.
Applied a total of 0 rules in 4 ms. Remains 327 /327 variables (removed 0) and now considering 192/192 (removed 0) transitions.
// Phase 1: matrix 192 rows 327 cols
[2024-05-23 02:22:48] [INFO ] Computed 136 invariants in 4 ms
[2024-05-23 02:22:48] [INFO ] Implicit Places using invariants in 170 ms returned [6, 63, 171, 289, 302, 312]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 172 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 321/327 places, 192/192 transitions.
Applied a total of 0 rules in 3 ms. Remains 321 /321 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 180 ms. Remains : 321/327 places, 192/192 transitions.
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CircularTrains-PT-192-LTLFireability-06
Product exploration explored 100000 steps with 714 reset in 833 ms.
Product exploration explored 100000 steps with 764 reset in 824 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 p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 401 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 448 steps (0 resets) in 18 ms. (23 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT p1))), (F p1), (F p0), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 500 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 192 rows 321 cols
[2024-05-23 02:22:52] [INFO ] Computed 130 invariants in 5 ms
[2024-05-23 02:22:52] [INFO ] [Real]Absence check using 127 positive place invariants in 26 ms returned sat
[2024-05-23 02:22:52] [INFO ] [Real]Absence check using 127 positive and 3 generalized place invariants in 10 ms returned sat
[2024-05-23 02:22:52] [INFO ] [Real]Absence check using state equation in 690 ms returned sat
[2024-05-23 02:22:52] [INFO ] Computed and/alt/rep : 128/192/128 causal constraints (skipped 0 transitions) in 18 ms.
[2024-05-23 02:22:54] [INFO ] Added : 125 causal constraints over 25 iterations in 1157 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 4 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 192/192 transitions.
Applied a total of 0 rules in 3 ms. Remains 321 /321 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2024-05-23 02:22:54] [INFO ] Invariant cache hit.
[2024-05-23 02:22:54] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-05-23 02:22:54] [INFO ] Invariant cache hit.
[2024-05-23 02:22:54] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
Running 128 sub problems to find dead transitions.
[2024-05-23 02:22:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/193 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 127/320 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/320 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/320 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 1/321 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/321 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 192/513 variables, 321/451 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/513 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (OVERLAPS) 0/513 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 513/513 variables, and 451 constraints, problems are : Problem set: 0 solved, 128 unsolved in 5718 ms.
Refiners :[Positive P Invariants (semi-flows): 127/127 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 321/321 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 128 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/193 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 127/320 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/320 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/320 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 1/321 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/321 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 192/513 variables, 321/451 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/513 variables, 128/579 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/513 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 128 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 513/513 variables, and 579 constraints, problems are : Problem set: 0 solved, 128 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 127/127 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 321/321 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints]
After SMT, in 35759ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 35761ms
Finished structural reductions in LTL mode , in 1 iterations and 36115 ms. Remains : 321/321 places, 192/192 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 412 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 357 steps (0 resets) in 19 ms. (17 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT p1))), (F p1), (F p0), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 524 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-23 02:23:31] [INFO ] Invariant cache hit.
[2024-05-23 02:23:31] [INFO ] [Real]Absence check using 127 positive place invariants in 27 ms returned sat
[2024-05-23 02:23:31] [INFO ] [Real]Absence check using 127 positive and 3 generalized place invariants in 18 ms returned sat
[2024-05-23 02:23:32] [INFO ] [Real]Absence check using state equation in 443 ms returned sat
[2024-05-23 02:23:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:23:32] [INFO ] [Nat]Absence check using 127 positive place invariants in 26 ms returned sat
[2024-05-23 02:23:32] [INFO ] [Nat]Absence check using 127 positive and 3 generalized place invariants in 5 ms returned sat
[2024-05-23 02:23:32] [INFO ] [Nat]Absence check using state equation in 532 ms returned sat
[2024-05-23 02:23:32] [INFO ] Computed and/alt/rep : 128/192/128 causal constraints (skipped 0 transitions) in 17 ms.
[2024-05-23 02:23:33] [INFO ] Added : 125 causal constraints over 25 iterations in 1082 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 734 reset in 744 ms.
Product exploration explored 100000 steps with 743 reset in 821 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 321 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 321/321 places, 192/192 transitions.
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 321 transition count 192
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 60 place count 321 transition count 192
Deduced a syphon composed of 62 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 62 place count 321 transition count 192
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 63 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 321 transition count 192
Deduced a syphon composed of 63 places in 0 ms
Applied a total of 63 rules in 36 ms. Remains 321 /321 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2024-05-23 02:23:35] [INFO ] Redundant transitions in 6 ms returned []
Running 128 sub problems to find dead transitions.
// Phase 1: matrix 192 rows 321 cols
[2024-05-23 02:23:35] [INFO ] Computed 130 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/193 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 127/320 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/320 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 128 unsolved
[2024-05-23 02:23:36] [INFO ] Deduced a trap composed of 2 places in 55 ms of which 8 ms to minimize.
[2024-05-23 02:23:36] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-23 02:23:37] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 2 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-05-23 02:23:37] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
[2024-05-23 02:23:37] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
[2024-05-23 02:23:37] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 0 ms to minimize.
[2024-05-23 02:23:37] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 1 ms to minimize.
[2024-05-23 02:23:37] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 2 ms to minimize.
[2024-05-23 02:23:37] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-05-23 02:23:37] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 1 ms to minimize.
[2024-05-23 02:23:37] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 1 ms to minimize.
[2024-05-23 02:23:37] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 0 ms to minimize.
[2024-05-23 02:23:37] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
[2024-05-23 02:23:37] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2024-05-23 02:23:37] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-23 02:23:37] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2024-05-23 02:23:37] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-23 02:23:37] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
[2024-05-23 02:23:37] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-23 02:23:37] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD122 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/320 variables, 20/149 constraints. Problems are: Problem set: 20 solved, 108 unsolved
[2024-05-23 02:23:38] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 0 ms to minimize.
[2024-05-23 02:23:38] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-23 02:23:38] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
[2024-05-23 02:23:38] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
[2024-05-23 02:23:38] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD97 is UNSAT
[2024-05-23 02:23:38] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 1 ms to minimize.
Problem TDEAD98 is UNSAT
[2024-05-23 02:23:38] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD101 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD124 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/320 variables, 7/156 constraints. Problems are: Problem set: 27 solved, 101 unsolved
[2024-05-23 02:23:38] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
Problem TDEAD7 is UNSAT
[2024-05-23 02:23:38] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 0 ms to minimize.
[2024-05-23 02:23:38] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-23 02:23:38] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
[2024-05-23 02:23:38] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
[2024-05-23 02:23:38] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
[2024-05-23 02:23:39] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
[2024-05-23 02:23:39] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 4 ms to minimize.
[2024-05-23 02:23:39] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD52 is UNSAT
[2024-05-23 02:23:39] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
Problem TDEAD57 is UNSAT
[2024-05-23 02:23:39] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD62 is UNSAT
[2024-05-23 02:23:39] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
[2024-05-23 02:23:39] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2024-05-23 02:23:39] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
Problem TDEAD65 is UNSAT
[2024-05-23 02:23:39] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
[2024-05-23 02:23:39] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD69 is UNSAT
[2024-05-23 02:23:39] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
[2024-05-23 02:23:39] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD73 is UNSAT
[2024-05-23 02:23:39] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-23 02:23:39] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
Problem TDEAD7 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD75 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/320 variables, 20/176 constraints. Problems are: Problem set: 47 solved, 81 unsolved
[2024-05-23 02:23:39] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Problem TDEAD8 is UNSAT
[2024-05-23 02:23:39] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
[2024-05-23 02:23:39] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Problem TDEAD74 is UNSAT
[2024-05-23 02:23:39] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-23 02:23:39] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
Problem TDEAD83 is UNSAT
[2024-05-23 02:23:40] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-23 02:23:40] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2024-05-23 02:23:40] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
Problem TDEAD22 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 8/184 constraints. Problems are: Problem set: 55 solved, 73 unsolved
[2024-05-23 02:23:40] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-05-23 02:23:40] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 3 ms to minimize.
Problem TDEAD10 is UNSAT
[2024-05-23 02:23:40] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD11 is UNSAT
[2024-05-23 02:23:40] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 0 ms to minimize.
[2024-05-23 02:23:41] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
Problem TDEAD84 is UNSAT
[2024-05-23 02:23:41] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
Problem TDEAD24 is UNSAT
Problem TDEAD87 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/320 variables, 6/190 constraints. Problems are: Problem set: 61 solved, 67 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/320 variables, 0/190 constraints. Problems are: Problem set: 61 solved, 67 unsolved
At refinement iteration 9 (OVERLAPS) 1/321 variables, 1/191 constraints. Problems are: Problem set: 61 solved, 67 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/321 variables, 0/191 constraints. Problems are: Problem set: 61 solved, 67 unsolved
Problem TDEAD12 is UNSAT
Problem TDEAD29 is UNSAT
At refinement iteration 11 (OVERLAPS) 192/513 variables, 321/512 constraints. Problems are: Problem set: 63 solved, 65 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/513 variables, 0/512 constraints. Problems are: Problem set: 63 solved, 65 unsolved
At refinement iteration 13 (OVERLAPS) 0/513 variables, 0/512 constraints. Problems are: Problem set: 63 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 513/513 variables, and 512 constraints, problems are : Problem set: 63 solved, 65 unsolved in 7810 ms.
Refiners :[Positive P Invariants (semi-flows): 127/127 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 321/321 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 61/61 constraints]
Escalating to Integer solving :Problem set: 63 solved, 65 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 63 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 190/320 variables, 127/127 constraints. Problems are: Problem set: 63 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/320 variables, 2/129 constraints. Problems are: Problem set: 63 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/320 variables, 61/190 constraints. Problems are: Problem set: 63 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/320 variables, 0/190 constraints. Problems are: Problem set: 63 solved, 65 unsolved
At refinement iteration 5 (OVERLAPS) 1/321 variables, 1/191 constraints. Problems are: Problem set: 63 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 0/191 constraints. Problems are: Problem set: 63 solved, 65 unsolved
At refinement iteration 7 (OVERLAPS) 192/513 variables, 321/512 constraints. Problems are: Problem set: 63 solved, 65 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/513 variables, 65/577 constraints. Problems are: Problem set: 63 solved, 65 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/513 variables, 0/577 constraints. Problems are: Problem set: 63 solved, 65 unsolved
At refinement iteration 10 (OVERLAPS) 0/513 variables, 0/577 constraints. Problems are: Problem set: 63 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 513/513 variables, and 577 constraints, problems are : Problem set: 63 solved, 65 unsolved in 6050 ms.
Refiners :[Positive P Invariants (semi-flows): 127/127 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 321/321 constraints, PredecessorRefiner: 65/128 constraints, Known Traps: 61/61 constraints]
After SMT, in 13878ms problems are : Problem set: 63 solved, 65 unsolved
Search for dead transitions found 63 dead transitions in 13881ms
Found 63 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 63 transitions
Dead transitions reduction (with SMT) removed 63 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 321/321 places, 129/192 transitions.
Graph (complete) has 516 edges and 321 vertex of which 258 are kept as prefixes of interest. Removing 63 places using SCC suffix rule.4 ms
Discarding 63 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 19 ms. Remains 258 /321 variables (removed 63) and now considering 129/129 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 258/321 places, 129/192 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 13947 ms. Remains : 258/321 places, 129/192 transitions.
Support contains 4 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 192/192 transitions.
Applied a total of 0 rules in 11 ms. Remains 321 /321 variables (removed 0) and now considering 192/192 (removed 0) transitions.
// Phase 1: matrix 192 rows 321 cols
[2024-05-23 02:23:49] [INFO ] Computed 130 invariants in 3 ms
[2024-05-23 02:23:50] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-05-23 02:23:50] [INFO ] Invariant cache hit.
[2024-05-23 02:23:50] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 390 ms to find 0 implicit places.
Running 128 sub problems to find dead transitions.
[2024-05-23 02:23:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/193 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 127/320 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/320 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/320 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 1/321 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/321 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 192/513 variables, 321/451 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/513 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (OVERLAPS) 0/513 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 513/513 variables, and 451 constraints, problems are : Problem set: 0 solved, 128 unsolved in 5769 ms.
Refiners :[Positive P Invariants (semi-flows): 127/127 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 321/321 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 128 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/193 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 127/320 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/320 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/320 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 1/321 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/321 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 192/513 variables, 321/451 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/513 variables, 128/579 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/513 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 128 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 513/513 variables, and 579 constraints, problems are : Problem set: 0 solved, 128 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 127/127 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 321/321 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints]
After SMT, in 35794ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 35795ms
Finished structural reductions in LTL mode , in 1 iterations and 36197 ms. Remains : 321/321 places, 192/192 transitions.
Treatment of property CircularTrains-PT-192-LTLFireability-06 finished in 97440 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(F(p0)))&&X(F(G((X(p0) U p1))))))'
Support contains 4 out of 327 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 192/192 transitions.
Applied a total of 0 rules in 6 ms. Remains 327 /327 variables (removed 0) and now considering 192/192 (removed 0) transitions.
// Phase 1: matrix 192 rows 327 cols
[2024-05-23 02:24:26] [INFO ] Computed 136 invariants in 2 ms
[2024-05-23 02:24:26] [INFO ] Implicit Places using invariants in 174 ms returned [6, 63, 91, 171, 289, 302, 312]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 175 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 320/327 places, 192/192 transitions.
Applied a total of 0 rules in 3 ms. Remains 320 /320 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 185 ms. Remains : 320/327 places, 192/192 transitions.
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : CircularTrains-PT-192-LTLFireability-08
Product exploration explored 100000 steps with 167 reset in 671 ms.
Product exploration explored 100000 steps with 177 reset in 735 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 p1)), (X p1), (X (NOT p0)), (X p0), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 308 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 185 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
RANDOM walk for 380 steps (0 resets) in 14 ms. (25 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (NOT p0)), (X p0), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0)), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 352 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Support contains 4 out of 320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 192/192 transitions.
Applied a total of 0 rules in 7 ms. Remains 320 /320 variables (removed 0) and now considering 192/192 (removed 0) transitions.
// Phase 1: matrix 192 rows 320 cols
[2024-05-23 02:24:29] [INFO ] Computed 129 invariants in 2 ms
[2024-05-23 02:24:29] [INFO ] Implicit Places using invariants in 157 ms returned []
[2024-05-23 02:24:29] [INFO ] Invariant cache hit.
[2024-05-23 02:24:29] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
Running 128 sub problems to find dead transitions.
[2024-05-23 02:24:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 127/319 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/319 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/319 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 1/320 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/320 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 192/512 variables, 320/449 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (OVERLAPS) 0/512 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 512/512 variables, and 449 constraints, problems are : Problem set: 0 solved, 128 unsolved in 5777 ms.
Refiners :[Positive P Invariants (semi-flows): 127/127 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 320/320 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 128 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 127/319 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/319 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/319 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 1/320 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/320 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 192/512 variables, 320/449 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 128/577 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/512 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 9 (OVERLAPS) 0/512 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Int declared 512/512 variables, and 577 constraints, problems are : Problem set: 0 solved, 128 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 127/127 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 320/320 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints]
After SMT, in 35799ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 35801ms
Finished structural reductions in LTL mode , in 1 iterations and 36172 ms. Remains : 320/320 places, 192/192 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 p1)), (X p1), (X (NOT p0)), (X p0), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 321 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
RANDOM walk for 188 steps (0 resets) in 8 ms. (20 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (NOT p0)), (X p0), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0)), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 350 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 182 reset in 685 ms.
Product exploration explored 100000 steps with 135 reset in 775 ms.
Applying partial POR strategy [false, true, false, false]
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Support contains 4 out of 320 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 320/320 places, 192/192 transitions.
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 320 transition count 192
Deduced a syphon composed of 64 places in 0 ms
Applied a total of 64 rules in 13 ms. Remains 320 /320 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2024-05-23 02:25:08] [INFO ] Redundant transitions in 2 ms returned []
Running 128 sub problems to find dead transitions.
// Phase 1: matrix 192 rows 320 cols
[2024-05-23 02:25:08] [INFO ] Computed 129 invariants in 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 127/319 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/319 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 128 unsolved
[2024-05-23 02:25:09] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 1 ms to minimize.
[2024-05-23 02:25:09] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2024-05-23 02:25:09] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 1 ms to minimize.
[2024-05-23 02:25:09] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 1 ms to minimize.
[2024-05-23 02:25:09] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 1 ms to minimize.
[2024-05-23 02:25:09] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 1 ms to minimize.
[2024-05-23 02:25:09] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 1 ms to minimize.
[2024-05-23 02:25:09] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 1 ms to minimize.
[2024-05-23 02:25:09] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 1 ms to minimize.
[2024-05-23 02:25:09] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 1 ms to minimize.
[2024-05-23 02:25:09] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 0 ms to minimize.
[2024-05-23 02:25:09] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-05-23 02:25:09] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-05-23 02:25:09] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-23 02:25:10] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
[2024-05-23 02:25:10] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
[2024-05-23 02:25:10] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-23 02:25:10] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
[2024-05-23 02:25:10] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
[2024-05-23 02:25:10] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD123 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/319 variables, 20/148 constraints. Problems are: Problem set: 19 solved, 109 unsolved
[2024-05-23 02:25:10] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 1 ms to minimize.
[2024-05-23 02:25:10] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-23 02:25:10] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2024-05-23 02:25:10] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 1 ms to minimize.
[2024-05-23 02:25:10] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
Problem TDEAD55 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD52 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/319 variables, 5/153 constraints. Problems are: Problem set: 24 solved, 104 unsolved
[2024-05-23 02:25:11] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
[2024-05-23 02:25:11] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
[2024-05-23 02:25:11] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem TDEAD7 is UNSAT
[2024-05-23 02:25:11] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 0 ms to minimize.
[2024-05-23 02:25:11] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-23 02:25:11] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2024-05-23 02:25:11] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
[2024-05-23 02:25:11] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
[2024-05-23 02:25:11] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
[2024-05-23 02:25:11] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
[2024-05-23 02:25:11] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
Problem TDEAD65 is UNSAT
[2024-05-23 02:25:11] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 0 ms to minimize.
[2024-05-23 02:25:11] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-05-23 02:25:12] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
[2024-05-23 02:25:12] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
[2024-05-23 02:25:12] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
[2024-05-23 02:25:12] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-23 02:25:12] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
[2024-05-23 02:25:12] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 0 ms to minimize.
[2024-05-23 02:25:12] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD7 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD121 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 20/173 constraints. Problems are: Problem set: 44 solved, 84 unsolved
[2024-05-23 02:25:12] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem TDEAD8 is UNSAT
[2024-05-23 02:25:12] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
[2024-05-23 02:25:12] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
Problem TDEAD60 is UNSAT
[2024-05-23 02:25:12] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem TDEAD73 is UNSAT
[2024-05-23 02:25:12] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Problem TDEAD82 is UNSAT
[2024-05-23 02:25:12] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 1 ms to minimize.
[2024-05-23 02:25:12] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-23 02:25:12] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-05-23 02:25:12] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
[2024-05-23 02:25:12] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
[2024-05-23 02:25:12] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
[2024-05-23 02:25:12] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
Problem TDEAD108 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD100 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 12/185 constraints. Problems are: Problem set: 56 solved, 72 unsolved
[2024-05-23 02:25:13] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-05-23 02:25:13] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
Problem TDEAD10 is UNSAT
[2024-05-23 02:25:13] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
Problem TDEAD11 is UNSAT
[2024-05-23 02:25:13] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
[2024-05-23 02:25:13] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
Problem TDEAD83 is UNSAT
[2024-05-23 02:25:13] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD24 is UNSAT
Problem TDEAD86 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 6/191 constraints. Problems are: Problem set: 62 solved, 66 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/319 variables, 0/191 constraints. Problems are: Problem set: 62 solved, 66 unsolved
At refinement iteration 9 (OVERLAPS) 1/320 variables, 1/192 constraints. Problems are: Problem set: 62 solved, 66 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/320 variables, 0/192 constraints. Problems are: Problem set: 62 solved, 66 unsolved
Problem TDEAD12 is UNSAT
Problem TDEAD29 is UNSAT
At refinement iteration 11 (OVERLAPS) 192/512 variables, 320/512 constraints. Problems are: Problem set: 64 solved, 64 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/512 variables, 0/512 constraints. Problems are: Problem set: 64 solved, 64 unsolved
At refinement iteration 13 (OVERLAPS) 0/512 variables, 0/512 constraints. Problems are: Problem set: 64 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 512/512 variables, and 512 constraints, problems are : Problem set: 64 solved, 64 unsolved in 7910 ms.
Refiners :[Positive P Invariants (semi-flows): 127/127 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 320/320 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 63/63 constraints]
Escalating to Integer solving :Problem set: 64 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 64 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 191/319 variables, 127/127 constraints. Problems are: Problem set: 64 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/319 variables, 1/128 constraints. Problems are: Problem set: 64 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/319 variables, 63/191 constraints. Problems are: Problem set: 64 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/319 variables, 0/191 constraints. Problems are: Problem set: 64 solved, 64 unsolved
At refinement iteration 5 (OVERLAPS) 1/320 variables, 1/192 constraints. Problems are: Problem set: 64 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 0/192 constraints. Problems are: Problem set: 64 solved, 64 unsolved
At refinement iteration 7 (OVERLAPS) 192/512 variables, 320/512 constraints. Problems are: Problem set: 64 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/512 variables, 64/576 constraints. Problems are: Problem set: 64 solved, 64 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/512 variables, 0/576 constraints. Problems are: Problem set: 64 solved, 64 unsolved
At refinement iteration 10 (OVERLAPS) 0/512 variables, 0/576 constraints. Problems are: Problem set: 64 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 512/512 variables, and 576 constraints, problems are : Problem set: 64 solved, 64 unsolved in 9722 ms.
Refiners :[Positive P Invariants (semi-flows): 127/127 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 320/320 constraints, PredecessorRefiner: 64/128 constraints, Known Traps: 63/63 constraints]
After SMT, in 17651ms problems are : Problem set: 64 solved, 64 unsolved
Search for dead transitions found 64 dead transitions in 17653ms
Found 64 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 64 transitions
Dead transitions reduction (with SMT) removed 64 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 320/320 places, 128/192 transitions.
Graph (complete) has 512 edges and 320 vertex of which 256 are kept as prefixes of interest. Removing 64 places using SCC suffix rule.1 ms
Discarding 64 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 256 /320 variables (removed 64) and now considering 128/128 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 256/320 places, 128/192 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 17684 ms. Remains : 256/320 places, 128/192 transitions.
Support contains 4 out of 320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 192/192 transitions.
Applied a total of 0 rules in 3 ms. Remains 320 /320 variables (removed 0) and now considering 192/192 (removed 0) transitions.
// Phase 1: matrix 192 rows 320 cols
[2024-05-23 02:25:26] [INFO ] Computed 129 invariants in 3 ms
[2024-05-23 02:25:26] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-05-23 02:25:26] [INFO ] Invariant cache hit.
[2024-05-23 02:25:26] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 388 ms to find 0 implicit places.
Running 128 sub problems to find dead transitions.
[2024-05-23 02:25:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 127/319 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/319 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/319 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 1/320 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/320 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 192/512 variables, 320/449 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (OVERLAPS) 0/512 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 512/512 variables, and 449 constraints, problems are : Problem set: 0 solved, 128 unsolved in 5763 ms.
Refiners :[Positive P Invariants (semi-flows): 127/127 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 320/320 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 128 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 127/319 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/319 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/319 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 1/320 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/320 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 192/512 variables, 320/449 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 128/577 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/512 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 9 (OVERLAPS) 0/512 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Int declared 512/512 variables, and 577 constraints, problems are : Problem set: 0 solved, 128 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 127/127 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 320/320 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints]
After SMT, in 35789ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 35790ms
Finished structural reductions in LTL mode , in 1 iterations and 36182 ms. Remains : 320/320 places, 192/192 transitions.
Treatment of property CircularTrains-PT-192-LTLFireability-08 finished in 96280 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 327 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 192/192 transitions.
Applied a total of 0 rules in 3 ms. Remains 327 /327 variables (removed 0) and now considering 192/192 (removed 0) transitions.
// Phase 1: matrix 192 rows 327 cols
[2024-05-23 02:26:02] [INFO ] Computed 136 invariants in 2 ms
[2024-05-23 02:26:02] [INFO ] Implicit Places using invariants in 165 ms returned [6, 63, 91, 171, 289, 302, 312]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 167 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 320/327 places, 192/192 transitions.
Applied a total of 0 rules in 2 ms. Remains 320 /320 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 173 ms. Remains : 320/327 places, 192/192 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-192-LTLFireability-09
Product exploration explored 100000 steps with 50000 reset in 540 ms.
Product exploration explored 100000 steps with 50000 reset in 613 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 19 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CircularTrains-PT-192-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CircularTrains-PT-192-LTLFireability-09 finished in 1441 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(G(p0))&&F(p1))))'
Support contains 4 out of 327 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 327/327 places, 192/192 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 327 transition count 143
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 98 place count 278 transition count 143
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 98 place count 278 transition count 136
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 112 place count 271 transition count 136
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 124 place count 265 transition count 130
Applied a total of 124 rules in 17 ms. Remains 265 /327 variables (removed 62) and now considering 130/192 (removed 62) transitions.
// Phase 1: matrix 130 rows 265 cols
[2024-05-23 02:26:03] [INFO ] Computed 136 invariants in 1 ms
[2024-05-23 02:26:03] [INFO ] Implicit Places using invariants in 147 ms returned [55, 77, 140, 231, 243, 252]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 147 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 259/327 places, 130/192 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 258 transition count 129
Applied a total of 2 rules in 7 ms. Remains 258 /259 variables (removed 1) and now considering 129/130 (removed 1) transitions.
// Phase 1: matrix 129 rows 258 cols
[2024-05-23 02:26:04] [INFO ] Computed 130 invariants in 1 ms
[2024-05-23 02:26:04] [INFO ] Implicit Places using invariants in 152 ms returned []
[2024-05-23 02:26:04] [INFO ] Invariant cache hit.
[2024-05-23 02:26:04] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 361 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 258/327 places, 129/192 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 534 ms. Remains : 258/327 places, 129/192 transitions.
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CircularTrains-PT-192-LTLFireability-10
Product exploration explored 100000 steps with 3 reset in 616 ms.
Product exploration explored 100000 steps with 5 reset in 751 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 p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 204 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 125 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 343 steps (0 resets) in 12 ms. (26 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0))), (F p1), (F p0)]
Knowledge based reduction with 2 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 127 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2024-05-23 02:26:06] [INFO ] Invariant cache hit.
[2024-05-23 02:26:06] [INFO ] [Real]Absence check using 127 positive place invariants in 23 ms returned sat
[2024-05-23 02:26:06] [INFO ] [Real]Absence check using 127 positive and 3 generalized place invariants in 8 ms returned sat
[2024-05-23 02:26:07] [INFO ] [Real]Absence check using state equation in 262 ms returned sat
[2024-05-23 02:26:07] [INFO ] Computed and/alt/rep : 65/129/65 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-23 02:26:07] [INFO ] Added : 63 causal constraints over 13 iterations in 326 ms. Result :sat
Could not prove EG (NOT p0)
[2024-05-23 02:26:07] [INFO ] Invariant cache hit.
[2024-05-23 02:26:07] [INFO ] [Real]Absence check using 127 positive place invariants in 23 ms returned sat
[2024-05-23 02:26:07] [INFO ] [Real]Absence check using 127 positive and 3 generalized place invariants in 12 ms returned sat
[2024-05-23 02:26:07] [INFO ] [Real]Absence check using state equation in 244 ms returned sat
[2024-05-23 02:26:07] [INFO ] Computed and/alt/rep : 65/129/65 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-23 02:26:08] [INFO ] Added : 62 causal constraints over 13 iterations in 323 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 4 out of 258 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 258/258 places, 129/129 transitions.
Applied a total of 0 rules in 5 ms. Remains 258 /258 variables (removed 0) and now considering 129/129 (removed 0) transitions.
[2024-05-23 02:26:08] [INFO ] Invariant cache hit.
[2024-05-23 02:26:08] [INFO ] Implicit Places using invariants in 141 ms returned []
[2024-05-23 02:26:08] [INFO ] Invariant cache hit.
[2024-05-23 02:26:08] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
[2024-05-23 02:26:08] [INFO ] Redundant transitions in 0 ms returned []
Running 65 sub problems to find dead transitions.
[2024-05-23 02:26:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 127/257 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/257 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/257 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 1/258 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (OVERLAPS) 129/387 variables, 258/388 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (OVERLAPS) 0/387 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 387/387 variables, and 388 constraints, problems are : Problem set: 0 solved, 65 unsolved in 2387 ms.
Refiners :[Positive P Invariants (semi-flows): 127/127 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 258/258 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 127/257 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/257 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/257 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 1/258 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (OVERLAPS) 129/387 variables, 258/388 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 65/453 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 9 (OVERLAPS) 0/387 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 387/387 variables, and 453 constraints, problems are : Problem set: 0 solved, 65 unsolved in 14193 ms.
Refiners :[Positive P Invariants (semi-flows): 127/127 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 258/258 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints]
After SMT, in 16590ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 16591ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 16940 ms. Remains : 258/258 places, 129/129 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 200 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 336 steps (0 resets) in 13 ms. (24 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0))), (F p1), (F p0)]
Knowledge based reduction with 2 factoid took 277 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2024-05-23 02:26:26] [INFO ] Invariant cache hit.
[2024-05-23 02:26:26] [INFO ] [Real]Absence check using 127 positive place invariants in 25 ms returned sat
[2024-05-23 02:26:26] [INFO ] [Real]Absence check using 127 positive and 3 generalized place invariants in 8 ms returned sat
[2024-05-23 02:26:26] [INFO ] [Real]Absence check using state equation in 270 ms returned sat
[2024-05-23 02:26:26] [INFO ] Computed and/alt/rep : 65/129/65 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-23 02:26:26] [INFO ] Added : 63 causal constraints over 13 iterations in 341 ms. Result :sat
Could not prove EG (NOT p0)
[2024-05-23 02:26:26] [INFO ] Invariant cache hit.
[2024-05-23 02:26:26] [INFO ] [Real]Absence check using 127 positive place invariants in 24 ms returned sat
[2024-05-23 02:26:26] [INFO ] [Real]Absence check using 127 positive and 3 generalized place invariants in 8 ms returned sat
[2024-05-23 02:26:27] [INFO ] [Real]Absence check using state equation in 233 ms returned sat
[2024-05-23 02:26:27] [INFO ] Computed and/alt/rep : 65/129/65 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-23 02:26:27] [INFO ] Added : 62 causal constraints over 13 iterations in 303 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 627 ms.
Product exploration explored 100000 steps with 0 reset in 739 ms.
Support contains 4 out of 258 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 258/258 places, 129/129 transitions.
Applied a total of 0 rules in 5 ms. Remains 258 /258 variables (removed 0) and now considering 129/129 (removed 0) transitions.
[2024-05-23 02:26:28] [INFO ] Invariant cache hit.
[2024-05-23 02:26:29] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-05-23 02:26:29] [INFO ] Invariant cache hit.
[2024-05-23 02:26:29] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
[2024-05-23 02:26:29] [INFO ] Redundant transitions in 1 ms returned []
Running 65 sub problems to find dead transitions.
[2024-05-23 02:26:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 127/257 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/257 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/257 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 1/258 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (OVERLAPS) 129/387 variables, 258/388 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (OVERLAPS) 0/387 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 387/387 variables, and 388 constraints, problems are : Problem set: 0 solved, 65 unsolved in 2417 ms.
Refiners :[Positive P Invariants (semi-flows): 127/127 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 258/258 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 127/257 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/257 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/257 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 1/258 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (OVERLAPS) 129/387 variables, 258/388 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 65/453 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 9 (OVERLAPS) 0/387 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 387/387 variables, and 453 constraints, problems are : Problem set: 0 solved, 65 unsolved in 14659 ms.
Refiners :[Positive P Invariants (semi-flows): 127/127 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 258/258 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints]
After SMT, in 17089ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 17090ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 17425 ms. Remains : 258/258 places, 129/129 transitions.
Treatment of property CircularTrains-PT-192-LTLFireability-10 finished in 42609 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 4 out of 327 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 327/327 places, 192/192 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 327 transition count 143
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 98 place count 278 transition count 143
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 98 place count 278 transition count 135
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 114 place count 270 transition count 135
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 126 place count 264 transition count 129
Applied a total of 126 rules in 13 ms. Remains 264 /327 variables (removed 63) and now considering 129/192 (removed 63) transitions.
// Phase 1: matrix 129 rows 264 cols
[2024-05-23 02:26:46] [INFO ] Computed 136 invariants in 1 ms
[2024-05-23 02:26:46] [INFO ] Implicit Places using invariants in 145 ms returned [5, 55, 76, 139, 230, 251]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 146 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 258/327 places, 129/192 transitions.
Applied a total of 0 rules in 5 ms. Remains 258 /258 variables (removed 0) and now considering 129/129 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 164 ms. Remains : 258/327 places, 129/192 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : CircularTrains-PT-192-LTLFireability-11
Product exploration explored 100000 steps with 1460 reset in 828 ms.
Product exploration explored 100000 steps with 1460 reset in 900 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 105 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
RANDOM walk for 268 steps (0 resets) in 10 ms. (24 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 127 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
// Phase 1: matrix 129 rows 258 cols
[2024-05-23 02:26:48] [INFO ] Computed 130 invariants in 2 ms
[2024-05-23 02:26:48] [INFO ] [Real]Absence check using 127 positive place invariants in 25 ms returned sat
[2024-05-23 02:26:48] [INFO ] [Real]Absence check using 127 positive and 3 generalized place invariants in 13 ms returned sat
[2024-05-23 02:26:49] [INFO ] [Real]Absence check using state equation in 207 ms returned sat
[2024-05-23 02:26:49] [INFO ] Computed and/alt/rep : 65/129/65 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-23 02:26:49] [INFO ] Added : 63 causal constraints over 13 iterations in 368 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 4 out of 258 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 258/258 places, 129/129 transitions.
Applied a total of 0 rules in 6 ms. Remains 258 /258 variables (removed 0) and now considering 129/129 (removed 0) transitions.
[2024-05-23 02:26:49] [INFO ] Invariant cache hit.
[2024-05-23 02:26:49] [INFO ] Implicit Places using invariants in 150 ms returned []
[2024-05-23 02:26:49] [INFO ] Invariant cache hit.
[2024-05-23 02:26:49] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
[2024-05-23 02:26:49] [INFO ] Redundant transitions in 0 ms returned []
Running 65 sub problems to find dead transitions.
[2024-05-23 02:26:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 126/256 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 2/258 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (OVERLAPS) 129/387 variables, 258/388 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (OVERLAPS) 0/387 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 387/387 variables, and 388 constraints, problems are : Problem set: 0 solved, 65 unsolved in 2390 ms.
Refiners :[Positive P Invariants (semi-flows): 127/127 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 258/258 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 126/256 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 2/258 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (OVERLAPS) 129/387 variables, 258/388 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 65/453 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 9 (OVERLAPS) 0/387 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 387/387 variables, and 453 constraints, problems are : Problem set: 0 solved, 65 unsolved in 12868 ms.
Refiners :[Positive P Invariants (semi-flows): 127/127 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 258/258 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints]
After SMT, in 15265ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 15266ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 15608 ms. Remains : 258/258 places, 129/129 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 131 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
RANDOM walk for 235 steps (0 resets) in 6 ms. (33 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 129 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
[2024-05-23 02:27:05] [INFO ] Invariant cache hit.
[2024-05-23 02:27:05] [INFO ] [Real]Absence check using 127 positive place invariants in 25 ms returned sat
[2024-05-23 02:27:05] [INFO ] [Real]Absence check using 127 positive and 3 generalized place invariants in 7 ms returned sat
[2024-05-23 02:27:05] [INFO ] [Real]Absence check using state equation in 203 ms returned sat
[2024-05-23 02:27:05] [INFO ] Computed and/alt/rep : 65/129/65 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-23 02:27:06] [INFO ] Added : 63 causal constraints over 13 iterations in 365 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 1451 reset in 793 ms.
Product exploration explored 100000 steps with 1478 reset in 867 ms.
Support contains 4 out of 258 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 258/258 places, 129/129 transitions.
Applied a total of 0 rules in 4 ms. Remains 258 /258 variables (removed 0) and now considering 129/129 (removed 0) transitions.
[2024-05-23 02:27:07] [INFO ] Invariant cache hit.
[2024-05-23 02:27:08] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-05-23 02:27:08] [INFO ] Invariant cache hit.
[2024-05-23 02:27:08] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
[2024-05-23 02:27:08] [INFO ] Redundant transitions in 0 ms returned []
Running 65 sub problems to find dead transitions.
[2024-05-23 02:27:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 126/256 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 2/258 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (OVERLAPS) 129/387 variables, 258/388 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (OVERLAPS) 0/387 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 387/387 variables, and 388 constraints, problems are : Problem set: 0 solved, 65 unsolved in 2308 ms.
Refiners :[Positive P Invariants (semi-flows): 127/127 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 258/258 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 126/256 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 2/258 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (OVERLAPS) 129/387 variables, 258/388 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 65/453 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 9 (OVERLAPS) 0/387 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 387/387 variables, and 453 constraints, problems are : Problem set: 0 solved, 65 unsolved in 12776 ms.
Refiners :[Positive P Invariants (semi-flows): 127/127 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 258/258 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints]
After SMT, in 15092ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 15092ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 15415 ms. Remains : 258/258 places, 129/129 transitions.
Treatment of property CircularTrains-PT-192-LTLFireability-11 finished in 36890 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 327 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 327/327 places, 192/192 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 51 place count 327 transition count 141
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 102 place count 276 transition count 141
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 102 place count 276 transition count 136
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 112 place count 271 transition count 136
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 124 place count 265 transition count 130
Applied a total of 124 rules in 14 ms. Remains 265 /327 variables (removed 62) and now considering 130/192 (removed 62) transitions.
// Phase 1: matrix 130 rows 265 cols
[2024-05-23 02:27:23] [INFO ] Computed 136 invariants in 1 ms
[2024-05-23 02:27:23] [INFO ] Implicit Places using invariants in 178 ms returned [5, 55, 76, 139, 243, 252]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 179 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 259/327 places, 130/192 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 259 transition count 129
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 258 transition count 129
Applied a total of 2 rules in 5 ms. Remains 258 /259 variables (removed 1) and now considering 129/130 (removed 1) transitions.
// Phase 1: matrix 129 rows 258 cols
[2024-05-23 02:27:23] [INFO ] Computed 130 invariants in 1 ms
[2024-05-23 02:27:23] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-05-23 02:27:23] [INFO ] Invariant cache hit.
[2024-05-23 02:27:23] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 258/327 places, 129/192 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 508 ms. Remains : 258/327 places, 129/192 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : CircularTrains-PT-192-LTLFireability-13
Product exploration explored 100000 steps with 2106 reset in 815 ms.
Product exploration explored 100000 steps with 2065 reset in 881 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 164 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
RANDOM walk for 253 steps (0 resets) in 10 ms. (23 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 198 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2024-05-23 02:27:26] [INFO ] Invariant cache hit.
[2024-05-23 02:27:26] [INFO ] [Real]Absence check using 126 positive place invariants in 28 ms returned sat
[2024-05-23 02:27:26] [INFO ] [Real]Absence check using 126 positive and 4 generalized place invariants in 14 ms returned sat
[2024-05-23 02:27:26] [INFO ] [Real]Absence check using state equation in 200 ms returned sat
[2024-05-23 02:27:26] [INFO ] Computed and/alt/rep : 65/129/65 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-23 02:27:26] [INFO ] Added : 62 causal constraints over 13 iterations in 316 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 258 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 258/258 places, 129/129 transitions.
Applied a total of 0 rules in 4 ms. Remains 258 /258 variables (removed 0) and now considering 129/129 (removed 0) transitions.
[2024-05-23 02:27:26] [INFO ] Invariant cache hit.
[2024-05-23 02:27:26] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-05-23 02:27:26] [INFO ] Invariant cache hit.
[2024-05-23 02:27:27] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
[2024-05-23 02:27:27] [INFO ] Redundant transitions in 1 ms returned []
Running 65 sub problems to find dead transitions.
[2024-05-23 02:27:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 126/256 variables, 126/127 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (OVERLAPS) 2/258 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (OVERLAPS) 129/387 variables, 258/388 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 9 (OVERLAPS) 0/387 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 387/387 variables, and 388 constraints, problems are : Problem set: 0 solved, 65 unsolved in 2584 ms.
Refiners :[Positive P Invariants (semi-flows): 126/126 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 258/258 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 126/256 variables, 126/127 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (OVERLAPS) 2/258 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (OVERLAPS) 129/387 variables, 258/388 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 65/453 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/387 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 10 (OVERLAPS) 0/387 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 387/387 variables, and 453 constraints, problems are : Problem set: 0 solved, 65 unsolved in 13696 ms.
Refiners :[Positive P Invariants (semi-flows): 126/126 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 258/258 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints]
After SMT, in 16287ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 16287ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 16613 ms. Remains : 258/258 places, 129/129 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 171 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
RANDOM walk for 323 steps (0 resets) in 10 ms. (29 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 209 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
[2024-05-23 02:27:43] [INFO ] Invariant cache hit.
[2024-05-23 02:27:44] [INFO ] [Real]Absence check using 126 positive place invariants in 24 ms returned sat
[2024-05-23 02:27:44] [INFO ] [Real]Absence check using 126 positive and 4 generalized place invariants in 10 ms returned sat
[2024-05-23 02:27:44] [INFO ] [Real]Absence check using state equation in 201 ms returned sat
[2024-05-23 02:27:44] [INFO ] Computed and/alt/rep : 65/129/65 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-23 02:27:44] [INFO ] Added : 62 causal constraints over 13 iterations in 313 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2136 reset in 817 ms.
Product exploration explored 100000 steps with 2110 reset in 869 ms.
Support contains 2 out of 258 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 258/258 places, 129/129 transitions.
Applied a total of 0 rules in 15 ms. Remains 258 /258 variables (removed 0) and now considering 129/129 (removed 0) transitions.
[2024-05-23 02:27:46] [INFO ] Invariant cache hit.
[2024-05-23 02:27:46] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-05-23 02:27:46] [INFO ] Invariant cache hit.
[2024-05-23 02:27:46] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
[2024-05-23 02:27:46] [INFO ] Redundant transitions in 0 ms returned []
Running 65 sub problems to find dead transitions.
[2024-05-23 02:27:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 126/256 variables, 126/127 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (OVERLAPS) 2/258 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (OVERLAPS) 129/387 variables, 258/388 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 9 (OVERLAPS) 0/387 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 387/387 variables, and 388 constraints, problems are : Problem set: 0 solved, 65 unsolved in 2641 ms.
Refiners :[Positive P Invariants (semi-flows): 126/126 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 258/258 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 126/256 variables, 126/127 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (OVERLAPS) 2/258 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (OVERLAPS) 129/387 variables, 258/388 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 65/453 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/387 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 10 (OVERLAPS) 0/387 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 387/387 variables, and 453 constraints, problems are : Problem set: 0 solved, 65 unsolved in 13782 ms.
Refiners :[Positive P Invariants (semi-flows): 126/126 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 258/258 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints]
After SMT, in 16428ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 16429ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 16781 ms. Remains : 258/258 places, 129/129 transitions.
Treatment of property CircularTrains-PT-192-LTLFireability-13 finished in 39778 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||G(p1))) U X(!p1)))'
Support contains 4 out of 327 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 192/192 transitions.
Applied a total of 0 rules in 3 ms. Remains 327 /327 variables (removed 0) and now considering 192/192 (removed 0) transitions.
// Phase 1: matrix 192 rows 327 cols
[2024-05-23 02:28:03] [INFO ] Computed 136 invariants in 2 ms
[2024-05-23 02:28:03] [INFO ] Implicit Places using invariants in 175 ms returned [6, 63, 91, 171, 289, 302]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 176 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 321/327 places, 192/192 transitions.
Applied a total of 0 rules in 3 ms. Remains 321 /321 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 183 ms. Remains : 321/327 places, 192/192 transitions.
Stuttering acceptance computed with spot in 220 ms :[(OR (NOT p0) p1), (NOT p1), (AND (NOT p1) (NOT p0)), p1, p1, true, p1]
Running random walk in product with property : CircularTrains-PT-192-LTLFireability-14
Entered a terminal (fully accepting) state of product in 374 steps with 118 reset in 4 ms.
FORMULA CircularTrains-PT-192-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-192-LTLFireability-14 finished in 428 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G((G(p1)||X(p2))))))'
Support contains 6 out of 327 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 192/192 transitions.
Applied a total of 0 rules in 3 ms. Remains 327 /327 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2024-05-23 02:28:03] [INFO ] Invariant cache hit.
[2024-05-23 02:28:03] [INFO ] Implicit Places using invariants in 151 ms returned [6, 91, 289, 302, 312]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 152 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 322/327 places, 192/192 transitions.
Applied a total of 0 rules in 3 ms. Remains 322 /322 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 159 ms. Remains : 322/327 places, 192/192 transitions.
Stuttering acceptance computed with spot in 175 ms :[true, (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p1)]
Running random walk in product with property : CircularTrains-PT-192-LTLFireability-15
Entered a terminal (fully accepting) state of product in 96 steps with 0 reset in 2 ms.
FORMULA CircularTrains-PT-192-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-192-LTLFireability-15 finished in 356 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)))'
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((F(p0) U p1)))))'
Found a Lengthening insensitive property : CircularTrains-PT-192-LTLFireability-06
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 327 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 327/327 places, 192/192 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 327 transition count 143
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 98 place count 278 transition count 143
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 98 place count 278 transition count 136
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 112 place count 271 transition count 136
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 124 place count 265 transition count 130
Applied a total of 124 rules in 16 ms. Remains 265 /327 variables (removed 62) and now considering 130/192 (removed 62) transitions.
// Phase 1: matrix 130 rows 265 cols
[2024-05-23 02:28:04] [INFO ] Computed 136 invariants in 2 ms
[2024-05-23 02:28:04] [INFO ] Implicit Places using invariants in 152 ms returned [5, 55, 140, 231, 243, 252]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 165 ms to find 6 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 259/327 places, 130/192 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 259 transition count 129
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 258 transition count 129
Applied a total of 2 rules in 8 ms. Remains 258 /259 variables (removed 1) and now considering 129/130 (removed 1) transitions.
// Phase 1: matrix 129 rows 258 cols
[2024-05-23 02:28:04] [INFO ] Computed 130 invariants in 1 ms
[2024-05-23 02:28:04] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-05-23 02:28:04] [INFO ] Invariant cache hit.
[2024-05-23 02:28:04] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 258/327 places, 129/192 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 508 ms. Remains : 258/327 places, 129/192 transitions.
Running random walk in product with property : CircularTrains-PT-192-LTLFireability-06
Product exploration explored 100000 steps with 1486 reset in 830 ms.
Product exploration explored 100000 steps with 1494 reset in 881 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 p0))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 361 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 388 steps (0 resets) in 10 ms. (35 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT p1))), (F p1), (F p0), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 510 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-23 02:28:07] [INFO ] Invariant cache hit.
[2024-05-23 02:28:07] [INFO ] [Real]Absence check using 127 positive place invariants in 25 ms returned sat
[2024-05-23 02:28:07] [INFO ] [Real]Absence check using 127 positive and 3 generalized place invariants in 6 ms returned sat
[2024-05-23 02:28:08] [INFO ] [Real]Absence check using state equation in 310 ms returned sat
[2024-05-23 02:28:08] [INFO ] Computed and/alt/rep : 65/129/65 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-23 02:28:08] [INFO ] Added : 63 causal constraints over 13 iterations in 378 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 4 out of 258 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 258/258 places, 129/129 transitions.
Applied a total of 0 rules in 3 ms. Remains 258 /258 variables (removed 0) and now considering 129/129 (removed 0) transitions.
[2024-05-23 02:28:08] [INFO ] Invariant cache hit.
[2024-05-23 02:28:08] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-05-23 02:28:08] [INFO ] Invariant cache hit.
[2024-05-23 02:28:08] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
Running 65 sub problems to find dead transitions.
[2024-05-23 02:28:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 127/257 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/257 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/257 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 1/258 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (OVERLAPS) 129/387 variables, 258/388 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (OVERLAPS) 0/387 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 387/387 variables, and 388 constraints, problems are : Problem set: 0 solved, 65 unsolved in 2382 ms.
Refiners :[Positive P Invariants (semi-flows): 127/127 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 258/258 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 127/257 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/257 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/257 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 1/258 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (OVERLAPS) 129/387 variables, 258/388 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 65/453 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 9 (OVERLAPS) 0/387 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 387/387 variables, and 453 constraints, problems are : Problem set: 0 solved, 65 unsolved in 14582 ms.
Refiners :[Positive P Invariants (semi-flows): 127/127 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 258/258 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints]
After SMT, in 16971ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 16972ms
Finished structural reductions in LTL mode , in 1 iterations and 17294 ms. Remains : 258/258 places, 129/129 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 497 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 348 steps (0 resets) in 15 ms. (21 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT p1))), (F p1), (F p0), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 510 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-23 02:28:27] [INFO ] Invariant cache hit.
[2024-05-23 02:28:27] [INFO ] [Real]Absence check using 127 positive place invariants in 24 ms returned sat
[2024-05-23 02:28:27] [INFO ] [Real]Absence check using 127 positive and 3 generalized place invariants in 7 ms returned sat
[2024-05-23 02:28:27] [INFO ] [Real]Absence check using state equation in 297 ms returned sat
[2024-05-23 02:28:27] [INFO ] Computed and/alt/rep : 65/129/65 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-23 02:28:27] [INFO ] Added : 63 causal constraints over 13 iterations in 365 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1457 reset in 805 ms.
Product exploration explored 100000 steps with 1464 reset in 880 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 258 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 258/258 places, 129/129 transitions.
Applied a total of 0 rules in 6 ms. Remains 258 /258 variables (removed 0) and now considering 129/129 (removed 0) transitions.
[2024-05-23 02:28:29] [INFO ] Redundant transitions in 1 ms returned []
Running 65 sub problems to find dead transitions.
[2024-05-23 02:28:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 127/257 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/257 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/257 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 1/258 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (OVERLAPS) 129/387 variables, 258/388 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (OVERLAPS) 0/387 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 387/387 variables, and 388 constraints, problems are : Problem set: 0 solved, 65 unsolved in 2329 ms.
Refiners :[Positive P Invariants (semi-flows): 127/127 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 258/258 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 127/257 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/257 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/257 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 1/258 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (OVERLAPS) 129/387 variables, 258/388 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 65/453 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 9 (OVERLAPS) 0/387 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 387/387 variables, and 453 constraints, problems are : Problem set: 0 solved, 65 unsolved in 14457 ms.
Refiners :[Positive P Invariants (semi-flows): 127/127 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 258/258 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints]
After SMT, in 16793ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 16795ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 16806 ms. Remains : 258/258 places, 129/129 transitions.
Support contains 4 out of 258 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 258/258 places, 129/129 transitions.
Applied a total of 0 rules in 2 ms. Remains 258 /258 variables (removed 0) and now considering 129/129 (removed 0) transitions.
[2024-05-23 02:28:46] [INFO ] Invariant cache hit.
[2024-05-23 02:28:46] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-05-23 02:28:46] [INFO ] Invariant cache hit.
[2024-05-23 02:28:47] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
Running 65 sub problems to find dead transitions.
[2024-05-23 02:28:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 127/257 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/257 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/257 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 1/258 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (OVERLAPS) 129/387 variables, 258/388 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (OVERLAPS) 0/387 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 387/387 variables, and 388 constraints, problems are : Problem set: 0 solved, 65 unsolved in 2342 ms.
Refiners :[Positive P Invariants (semi-flows): 127/127 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 258/258 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 127/257 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/257 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/257 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 1/258 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (OVERLAPS) 129/387 variables, 258/388 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 65/453 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 9 (OVERLAPS) 0/387 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 387/387 variables, and 453 constraints, problems are : Problem set: 0 solved, 65 unsolved in 14178 ms.
Refiners :[Positive P Invariants (semi-flows): 127/127 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 258/258 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints]
After SMT, in 16527ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 16528ms
Finished structural reductions in LTL mode , in 1 iterations and 16849 ms. Remains : 258/258 places, 129/129 transitions.
Treatment of property CircularTrains-PT-192-LTLFireability-06 finished in 59621 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(F(p0)))&&X(F(G((X(p0) U p1))))))'
Found a Lengthening insensitive property : CircularTrains-PT-192-LTLFireability-08
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Support contains 4 out of 327 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 327/327 places, 192/192 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 327 transition count 143
Reduce places removed 49 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 51 rules applied. Total rules applied 100 place count 278 transition count 141
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 102 place count 276 transition count 141
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 102 place count 276 transition count 135
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 114 place count 270 transition count 135
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 126 place count 264 transition count 129
Applied a total of 126 rules in 17 ms. Remains 264 /327 variables (removed 63) and now considering 129/192 (removed 63) transitions.
// Phase 1: matrix 129 rows 264 cols
[2024-05-23 02:29:03] [INFO ] Computed 136 invariants in 2 ms
[2024-05-23 02:29:04] [INFO ] Implicit Places using invariants in 141 ms returned [5, 55, 76, 139, 230, 242, 251]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 141 ms to find 7 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 257/327 places, 129/192 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 257 transition count 128
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 256 transition count 128
Applied a total of 2 rules in 6 ms. Remains 256 /257 variables (removed 1) and now considering 128/129 (removed 1) transitions.
// Phase 1: matrix 128 rows 256 cols
[2024-05-23 02:29:04] [INFO ] Computed 129 invariants in 1 ms
[2024-05-23 02:29:04] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-05-23 02:29:04] [INFO ] Invariant cache hit.
[2024-05-23 02:29:04] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 256/327 places, 128/192 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 473 ms. Remains : 256/327 places, 128/192 transitions.
Running random walk in product with property : CircularTrains-PT-192-LTLFireability-08
Product exploration explored 100000 steps with 338 reset in 701 ms.
Product exploration explored 100000 steps with 349 reset in 769 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 p1)), (X p1), (X (NOT p0)), (X p0), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 277 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
RANDOM walk for 269 steps (0 resets) in 12 ms. (20 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (NOT p0)), (X p0), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0)), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 333 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Support contains 4 out of 256 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 128/128 transitions.
Applied a total of 0 rules in 5 ms. Remains 256 /256 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2024-05-23 02:29:06] [INFO ] Invariant cache hit.
[2024-05-23 02:29:07] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-05-23 02:29:07] [INFO ] Invariant cache hit.
[2024-05-23 02:29:07] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
Running 64 sub problems to find dead transitions.
[2024-05-23 02:29:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 127/255 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/255 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 1/256 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 128/384 variables, 256/385 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/384 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 0/384 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 384/384 variables, and 385 constraints, problems are : Problem set: 0 solved, 64 unsolved in 2269 ms.
Refiners :[Positive P Invariants (semi-flows): 127/127 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 256/256 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/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 127/255 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/255 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 1/256 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 128/384 variables, 256/385 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/384 variables, 64/449 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/384 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (OVERLAPS) 0/384 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 384/384 variables, and 449 constraints, problems are : Problem set: 0 solved, 64 unsolved in 13053 ms.
Refiners :[Positive P Invariants (semi-flows): 127/127 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 256/256 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
After SMT, in 15331ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 15331ms
Finished structural reductions in LTL mode , in 1 iterations and 15675 ms. Remains : 256/256 places, 128/128 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 p1)), (X p1), (X (NOT p0)), (X p0), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 291 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
RANDOM walk for 236 steps (0 resets) in 8 ms. (26 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (NOT p0)), (X p0), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0)), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 347 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 375 reset in 701 ms.
Product exploration explored 100000 steps with 358 reset in 764 ms.
Applying partial POR strategy [false, true, false, false]
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Support contains 4 out of 256 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 256/256 places, 128/128 transitions.
Applied a total of 0 rules in 5 ms. Remains 256 /256 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2024-05-23 02:29:25] [INFO ] Redundant transitions in 0 ms returned []
Running 64 sub problems to find dead transitions.
[2024-05-23 02:29:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 127/255 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/255 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 1/256 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 128/384 variables, 256/385 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/384 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 0/384 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 384/384 variables, and 385 constraints, problems are : Problem set: 0 solved, 64 unsolved in 2220 ms.
Refiners :[Positive P Invariants (semi-flows): 127/127 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 256/256 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/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 127/255 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/255 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 1/256 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 128/384 variables, 256/385 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/384 variables, 64/449 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/384 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (OVERLAPS) 0/384 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 384/384 variables, and 449 constraints, problems are : Problem set: 0 solved, 64 unsolved in 13140 ms.
Refiners :[Positive P Invariants (semi-flows): 127/127 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 256/256 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
After SMT, in 15366ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 15367ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 15377 ms. Remains : 256/256 places, 128/128 transitions.
Support contains 4 out of 256 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 128/128 transitions.
Applied a total of 0 rules in 2 ms. Remains 256 /256 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2024-05-23 02:29:40] [INFO ] Invariant cache hit.
[2024-05-23 02:29:41] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-05-23 02:29:41] [INFO ] Invariant cache hit.
[2024-05-23 02:29:41] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
Running 64 sub problems to find dead transitions.
[2024-05-23 02:29:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 127/255 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/255 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 1/256 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 128/384 variables, 256/385 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/384 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 0/384 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 384/384 variables, and 385 constraints, problems are : Problem set: 0 solved, 64 unsolved in 2220 ms.
Refiners :[Positive P Invariants (semi-flows): 127/127 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 256/256 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/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 127/255 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/255 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 1/256 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 128/384 variables, 256/385 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/384 variables, 64/449 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/384 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (OVERLAPS) 0/384 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 384/384 variables, and 449 constraints, problems are : Problem set: 0 solved, 64 unsolved in 13099 ms.
Refiners :[Positive P Invariants (semi-flows): 127/127 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 256/256 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
After SMT, in 15325ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 15325ms
Finished structural reductions in LTL mode , in 1 iterations and 15634 ms. Remains : 256/256 places, 128/128 transitions.
Treatment of property CircularTrains-PT-192-LTLFireability-08 finished in 52967 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(G(p0))&&F(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(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(p0))'
[2024-05-23 02:29:56] [INFO ] Flatten gal took : 15 ms
[2024-05-23 02:29:56] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-23 02:29:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 327 places, 192 transitions and 654 arcs took 4 ms.
Total runtime 459530 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running CircularTrains-PT-192
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 327
TRANSITIONS: 192
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.005s, Sys 0.000s]
SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.001s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 2871
MODEL NAME: /home/mcc/execution/412/model
327 places, 192 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA CircularTrains-PT-192-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CircularTrains-PT-192-LTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CircularTrains-PT-192-LTLFireability-06 CANNOT_COMPUTE
FORMULA CircularTrains-PT-192-LTLFireability-08 CANNOT_COMPUTE
FORMULA CircularTrains-PT-192-LTLFireability-10 CANNOT_COMPUTE
FORMULA CircularTrains-PT-192-LTLFireability-11 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716432190488
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CircularTrains-PT-192"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is CircularTrains-PT-192, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r069-tall-171620504300356"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CircularTrains-PT-192.tgz
mv CircularTrains-PT-192 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;