MCC'2024- Execution of r476-tall-171620505700356

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

--------------------
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 1717205093073

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CircularTrains-PT-192
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 01:24:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 01:24:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 01:24:54] [INFO ] Load time of PNML (sax parser for PT used): 80 ms
[2024-06-01 01:24:54] [INFO ] Transformed 384 places.
[2024-06-01 01:24:54] [INFO ] Transformed 192 transitions.
[2024-06-01 01:24:54] [INFO ] Parsed PT model containing 384 places and 192 transitions and 768 arcs in 187 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 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 56 ms. Remains 384 /384 variables (removed 0) and now considering 192/192 (removed 0) transitions.
// Phase 1: matrix 192 rows 384 cols
[2024-06-01 01:24:54] [INFO ] Computed 193 invariants in 35 ms
[2024-06-01 01:24:55] [INFO ] Implicit Places using invariants in 504 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 538 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 17 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 639 ms. Remains : 327/384 places, 192/192 transitions.
Support contains 38 out of 327 places after structural reductions.
[2024-06-01 01:24:55] [INFO ] Flatten gal took : 43 ms
[2024-06-01 01:24:55] [INFO ] Flatten gal took : 18 ms
[2024-06-01 01:24:55] [INFO ] Input system was already deterministic with 192 transitions.
RANDOM walk for 898 steps (0 resets) in 75 ms. (11 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 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 55 ms. Remains 264 /327 variables (removed 63) and now considering 129/192 (removed 63) transitions.
// Phase 1: matrix 129 rows 264 cols
[2024-06-01 01:24:55] [INFO ] Computed 136 invariants in 3 ms
[2024-06-01 01:24:56] [INFO ] Implicit Places using invariants in 187 ms returned [5, 55, 76, 139, 230, 242, 251]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 189 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 15 ms. Remains 256 /257 variables (removed 1) and now considering 128/129 (removed 1) transitions.
// Phase 1: matrix 128 rows 256 cols
[2024-06-01 01:24:56] [INFO ] Computed 129 invariants in 3 ms
[2024-06-01 01:24:56] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-06-01 01:24:56] [INFO ] Invariant cache hit.
[2024-06-01 01:24:56] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 391 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 650 ms. Remains : 256/327 places, 128/192 transitions.
Stuttering acceptance computed with spot in 256 ms :[(NOT p0)]
Running random walk in product with property : CircularTrains-PT-192-LTLFireability-03
Product exploration explored 100000 steps with 0 reset in 740 ms.
Product exploration explored 100000 steps with 0 reset in 904 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 74 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
RANDOM walk for 447 steps (0 resets) in 17 ms. (24 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 114 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 42 ms :[(NOT p0)]
[2024-06-01 01:24:58] [INFO ] Invariant cache hit.
[2024-06-01 01:24:58] [INFO ] [Real]Absence check using 127 positive place invariants in 33 ms returned sat
[2024-06-01 01:24:58] [INFO ] [Real]Absence check using 127 positive and 2 generalized place invariants in 13 ms returned sat
[2024-06-01 01:24:59] [INFO ] [Real]Absence check using state equation in 273 ms returned sat
[2024-06-01 01:24:59] [INFO ] Computed and/alt/rep : 64/128/64 causal constraints (skipped 0 transitions) in 8 ms.
[2024-06-01 01:24:59] [INFO ] Added : 62 causal constraints over 13 iterations in 439 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-06-01 01:24:59] [INFO ] Invariant cache hit.
[2024-06-01 01:24:59] [INFO ] Implicit Places using invariants in 160 ms returned []
[2024-06-01 01:24:59] [INFO ] Invariant cache hit.
[2024-06-01 01:25:00] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
[2024-06-01 01:25:00] [INFO ] Redundant transitions in 3 ms returned []
Running 64 sub problems to find dead transitions.
[2024-06-01 01:25:00] [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 2541 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 9082 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 11656ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 11663ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 12056 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 97 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
RANDOM walk for 692 steps (0 resets) in 15 ms. (43 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 78 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 35 ms :[(NOT p0)]
[2024-06-01 01:25:12] [INFO ] Invariant cache hit.
[2024-06-01 01:25:12] [INFO ] [Real]Absence check using 127 positive place invariants in 25 ms returned sat
[2024-06-01 01:25:12] [INFO ] [Real]Absence check using 127 positive and 2 generalized place invariants in 12 ms returned sat
[2024-06-01 01:25:12] [INFO ] [Real]Absence check using state equation in 257 ms returned sat
[2024-06-01 01:25:12] [INFO ] Computed and/alt/rep : 64/128/64 causal constraints (skipped 0 transitions) in 7 ms.
[2024-06-01 01:25:12] [INFO ] Added : 62 causal constraints over 13 iterations in 355 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 656 ms.
Product exploration explored 100000 steps with 0 reset in 814 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 7 ms. Remains 256 /256 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2024-06-01 01:25:14] [INFO ] Invariant cache hit.
[2024-06-01 01:25:14] [INFO ] Implicit Places using invariants in 163 ms returned []
[2024-06-01 01:25:14] [INFO ] Invariant cache hit.
[2024-06-01 01:25:14] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 361 ms to find 0 implicit places.
[2024-06-01 01:25:14] [INFO ] Redundant transitions in 3 ms returned []
Running 64 sub problems to find dead transitions.
[2024-06-01 01:25:14] [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 2305 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 9158 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 11479ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 11482ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 11857 ms. Remains : 256/256 places, 128/128 transitions.
Treatment of property CircularTrains-PT-192-LTLFireability-03 finished in 30477 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 5 ms. Remains 327 /327 variables (removed 0) and now considering 192/192 (removed 0) transitions.
// Phase 1: matrix 192 rows 327 cols
[2024-06-01 01:25:26] [INFO ] Computed 136 invariants in 7 ms
[2024-06-01 01:25:26] [INFO ] Implicit Places using invariants in 175 ms returned [6, 63, 171, 289, 302, 312]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 178 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 187 ms. Remains : 321/327 places, 192/192 transitions.
Stuttering acceptance computed with spot in 99 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 735 reset in 809 ms.
Product exploration explored 100000 steps with 756 reset in 847 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 355 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 114 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 526 steps (0 resets) in 14 ms. (35 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 486 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 114 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 192 rows 321 cols
[2024-06-01 01:25:29] [INFO ] Computed 130 invariants in 2 ms
[2024-06-01 01:25:29] [INFO ] [Real]Absence check using 127 positive place invariants in 27 ms returned sat
[2024-06-01 01:25:29] [INFO ] [Real]Absence check using 127 positive and 3 generalized place invariants in 10 ms returned sat
[2024-06-01 01:25:30] [INFO ] [Real]Absence check using state equation in 701 ms returned sat
[2024-06-01 01:25:30] [INFO ] Computed and/alt/rep : 128/192/128 causal constraints (skipped 0 transitions) in 12 ms.
[2024-06-01 01:25:31] [INFO ] Added : 125 causal constraints over 25 iterations in 1154 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 7 ms. Remains 321 /321 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2024-06-01 01:25:31] [INFO ] Invariant cache hit.
[2024-06-01 01:25:31] [INFO ] Implicit Places using invariants in 150 ms returned []
[2024-06-01 01:25:31] [INFO ] Invariant cache hit.
[2024-06-01 01:25:31] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 385 ms to find 0 implicit places.
Running 128 sub problems to find dead transitions.
[2024-06-01 01:25:31] [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 5861 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 30023 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 35896ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 35899ms
Finished structural reductions in LTL mode , in 1 iterations and 36292 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 332 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 98 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 386 steps (0 resets) in 9 ms. (38 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 589 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 116 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-06-01 01:26:09] [INFO ] Invariant cache hit.
[2024-06-01 01:26:09] [INFO ] [Real]Absence check using 127 positive place invariants in 28 ms returned sat
[2024-06-01 01:26:09] [INFO ] [Real]Absence check using 127 positive and 3 generalized place invariants in 14 ms returned sat
[2024-06-01 01:26:09] [INFO ] [Real]Absence check using state equation in 457 ms returned sat
[2024-06-01 01:26:09] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 01:26:09] [INFO ] [Nat]Absence check using 127 positive place invariants in 27 ms returned sat
[2024-06-01 01:26:09] [INFO ] [Nat]Absence check using 127 positive and 3 generalized place invariants in 5 ms returned sat
[2024-06-01 01:26:10] [INFO ] [Nat]Absence check using state equation in 585 ms returned sat
[2024-06-01 01:26:10] [INFO ] Computed and/alt/rep : 128/192/128 causal constraints (skipped 0 transitions) in 10 ms.
[2024-06-01 01:26:11] [INFO ] Added : 125 causal constraints over 25 iterations in 1113 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 739 reset in 763 ms.
Product exploration explored 100000 steps with 741 reset in 820 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 115 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 42 ms. Remains 321 /321 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2024-06-01 01:26:13] [INFO ] Redundant transitions in 6 ms returned []
Running 128 sub problems to find dead transitions.
// Phase 1: matrix 192 rows 321 cols
[2024-06-01 01:26:13] [INFO ] Computed 130 invariants in 3 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-06-01 01:26:14] [INFO ] Deduced a trap composed of 2 places in 62 ms of which 8 ms to minimize.
[2024-06-01 01:26:14] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 2 ms to minimize.
[2024-06-01 01:26:14] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-06-01 01:26:14] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 1 ms to minimize.
[2024-06-01 01:26:14] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 1 ms to minimize.
[2024-06-01 01:26:14] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 1 ms to minimize.
[2024-06-01 01:26:14] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
[2024-06-01 01:26:15] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 1 ms to minimize.
[2024-06-01 01:26:15] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-06-01 01:26:15] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 1 ms to minimize.
[2024-06-01 01:26:15] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 0 ms to minimize.
[2024-06-01 01:26:15] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
[2024-06-01 01:26:15] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 0 ms to minimize.
[2024-06-01 01:26:15] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2024-06-01 01:26:15] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-06-01 01:26:15] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 3 ms to minimize.
[2024-06-01 01:26:15] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-06-01 01:26:15] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
[2024-06-01 01:26:15] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-06-01 01:26:15] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 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-06-01 01:26:15] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2024-06-01 01:26:15] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-06-01 01:26:16] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
[2024-06-01 01:26:16] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
[2024-06-01 01:26:16] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD97 is UNSAT
[2024-06-01 01:26:16] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
Problem TDEAD98 is UNSAT
[2024-06-01 01:26:16] [INFO ] Deduced a trap composed of 2 places in 14 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-06-01 01:26:16] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
Problem TDEAD7 is UNSAT
[2024-06-01 01:26:16] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
[2024-06-01 01:26:16] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-06-01 01:26:16] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
[2024-06-01 01:26:16] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
[2024-06-01 01:26:16] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
[2024-06-01 01:26:16] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
[2024-06-01 01:26:16] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 4 ms to minimize.
[2024-06-01 01:26:16] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 1 ms to minimize.
Problem TDEAD52 is UNSAT
[2024-06-01 01:26:16] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD57 is UNSAT
[2024-06-01 01:26:16] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
Problem TDEAD62 is UNSAT
[2024-06-01 01:26:16] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
[2024-06-01 01:26:16] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
[2024-06-01 01:26:16] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
Problem TDEAD65 is UNSAT
[2024-06-01 01:26:16] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
[2024-06-01 01:26:16] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
Problem TDEAD69 is UNSAT
[2024-06-01 01:26:16] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
[2024-06-01 01:26:17] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD73 is UNSAT
[2024-06-01 01:26:17] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-06-01 01:26:17] [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-06-01 01:26:17] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
Problem TDEAD8 is UNSAT
[2024-06-01 01:26:17] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 11 ms to minimize.
[2024-06-01 01:26:17] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 2 ms to minimize.
Problem TDEAD74 is UNSAT
[2024-06-01 01:26:17] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-06-01 01:26:17] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
Problem TDEAD83 is UNSAT
[2024-06-01 01:26:17] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-06-01 01:26:17] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
[2024-06-01 01:26:17] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 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-06-01 01:26:18] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-06-01 01:26:18] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 1 ms to minimize.
Problem TDEAD10 is UNSAT
[2024-06-01 01:26:18] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD11 is UNSAT
[2024-06-01 01:26:18] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
[2024-06-01 01:26:18] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
Problem TDEAD84 is UNSAT
[2024-06-01 01:26:18] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 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 7518 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 6214 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 13750ms problems are : Problem set: 63 solved, 65 unsolved
Search for dead transitions found 63 dead transitions in 13753ms
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.5 ms
Discarding 63 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 18 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 13826 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 10 ms. Remains 321 /321 variables (removed 0) and now considering 192/192 (removed 0) transitions.
// Phase 1: matrix 192 rows 321 cols
[2024-06-01 01:26:27] [INFO ] Computed 130 invariants in 4 ms
[2024-06-01 01:26:27] [INFO ] Implicit Places using invariants in 168 ms returned []
[2024-06-01 01:26:27] [INFO ] Invariant cache hit.
[2024-06-01 01:26:27] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 384 ms to find 0 implicit places.
Running 128 sub problems to find dead transitions.
[2024-06-01 01:26:27] [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 5844 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 30014 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 35870ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 35872ms
Finished structural reductions in LTL mode , in 1 iterations and 36274 ms. Remains : 321/321 places, 192/192 transitions.
Treatment of property CircularTrains-PT-192-LTLFireability-06 finished in 97509 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 7 ms. Remains 327 /327 variables (removed 0) and now considering 192/192 (removed 0) transitions.
// Phase 1: matrix 192 rows 327 cols
[2024-06-01 01:27:03] [INFO ] Computed 136 invariants in 1 ms
[2024-06-01 01:27:03] [INFO ] Implicit Places using invariants in 157 ms returned [6, 63, 91, 171, 289, 302, 312]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 158 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 4 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 169 ms. Remains : 320/327 places, 192/192 transitions.
Stuttering acceptance computed with spot in 153 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 179 reset in 665 ms.
Product exploration explored 100000 steps with 167 reset in 726 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 247 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 137 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
RANDOM walk for 299 steps (0 resets) in 11 ms. (24 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 313 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 149 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 163 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 3 ms. Remains 320 /320 variables (removed 0) and now considering 192/192 (removed 0) transitions.
// Phase 1: matrix 192 rows 320 cols
[2024-06-01 01:27:06] [INFO ] Computed 129 invariants in 2 ms
[2024-06-01 01:27:06] [INFO ] Implicit Places using invariants in 158 ms returned []
[2024-06-01 01:27:06] [INFO ] Invariant cache hit.
[2024-06-01 01:27:06] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 398 ms to find 0 implicit places.
Running 128 sub problems to find dead transitions.
[2024-06-01 01:27:06] [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 5702 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 30008 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 35722ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 35723ms
Finished structural reductions in LTL mode , in 1 iterations and 36125 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 254 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 136 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
RANDOM walk for 307 steps (0 resets) in 10 ms. (27 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 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 149 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 189 reset in 655 ms.
Product exploration explored 100000 steps with 145 reset in 704 ms.
Applying partial POR strategy [false, true, false, false]
Stuttering acceptance computed with spot in 137 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-06-01 01:27:45] [INFO ] Redundant transitions in 1 ms returned []
Running 128 sub problems to find dead transitions.
// Phase 1: matrix 192 rows 320 cols
[2024-06-01 01:27:45] [INFO ] Computed 129 invariants in 1 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-06-01 01:27:46] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 1 ms to minimize.
[2024-06-01 01:27:46] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-06-01 01:27:46] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 1 ms to minimize.
[2024-06-01 01:27:46] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 1 ms to minimize.
[2024-06-01 01:27:46] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 1 ms to minimize.
[2024-06-01 01:27:46] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 1 ms to minimize.
[2024-06-01 01:27:46] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 1 ms to minimize.
[2024-06-01 01:27:46] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 1 ms to minimize.
[2024-06-01 01:27:46] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 0 ms to minimize.
[2024-06-01 01:27:46] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
[2024-06-01 01:27:46] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
[2024-06-01 01:27:46] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-06-01 01:27:46] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-06-01 01:27:46] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 01:27:46] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
[2024-06-01 01:27:46] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
[2024-06-01 01:27:46] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-06-01 01:27:47] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
[2024-06-01 01:27:47] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
[2024-06-01 01:27:47] [INFO ] Deduced a trap composed of 2 places in 16 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-06-01 01:27:47] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2024-06-01 01:27:47] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-06-01 01:27:47] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
[2024-06-01 01:27:47] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2024-06-01 01:27:47] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 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-06-01 01:27:48] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
[2024-06-01 01:27:48] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
[2024-06-01 01:27:48] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
Problem TDEAD7 is UNSAT
[2024-06-01 01:27:48] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 1 ms to minimize.
[2024-06-01 01:27:48] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-06-01 01:27:48] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
[2024-06-01 01:27:48] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
[2024-06-01 01:27:48] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
[2024-06-01 01:27:48] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
[2024-06-01 01:27:48] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 1 ms to minimize.
[2024-06-01 01:27:48] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
Problem TDEAD65 is UNSAT
[2024-06-01 01:27:48] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 0 ms to minimize.
[2024-06-01 01:27:48] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-06-01 01:27:48] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
[2024-06-01 01:27:48] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
[2024-06-01 01:27:48] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
[2024-06-01 01:27:48] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-06-01 01:27:48] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
[2024-06-01 01:27:48] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
[2024-06-01 01:27:48] [INFO ] Deduced a trap composed of 2 places in 13 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-06-01 01:27:49] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
Problem TDEAD8 is UNSAT
[2024-06-01 01:27:49] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2024-06-01 01:27:49] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD60 is UNSAT
[2024-06-01 01:27:49] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
Problem TDEAD73 is UNSAT
[2024-06-01 01:27:49] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
Problem TDEAD82 is UNSAT
[2024-06-01 01:27:49] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2024-06-01 01:27:49] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-06-01 01:27:49] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-06-01 01:27:49] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
[2024-06-01 01:27:49] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
[2024-06-01 01:27:49] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
[2024-06-01 01:27:49] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 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-06-01 01:27:50] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-06-01 01:27:50] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
Problem TDEAD10 is UNSAT
[2024-06-01 01:27:50] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
Problem TDEAD11 is UNSAT
[2024-06-01 01:27:50] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
[2024-06-01 01:27:50] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
Problem TDEAD83 is UNSAT
[2024-06-01 01:27:50] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 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 7599 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 9518 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 17131ms problems are : Problem set: 64 solved, 64 unsolved
Search for dead transitions found 64 dead transitions in 17133ms
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.3 ms
Discarding 64 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 15 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 17174 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-06-01 01:28:02] [INFO ] Computed 129 invariants in 2 ms
[2024-06-01 01:28:02] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-06-01 01:28:02] [INFO ] Invariant cache hit.
[2024-06-01 01:28:03] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
Running 128 sub problems to find dead transitions.
[2024-06-01 01:28:03] [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 5707 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 30018 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 35736ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 35737ms
Finished structural reductions in LTL mode , in 1 iterations and 36094 ms. Remains : 320/320 places, 192/192 transitions.
Treatment of property CircularTrains-PT-192-LTLFireability-08 finished in 94992 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-06-01 01:28:38] [INFO ] Computed 136 invariants in 2 ms
[2024-06-01 01:28:38] [INFO ] Implicit Places using invariants in 160 ms returned [6, 63, 91, 171, 289, 302, 312]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 161 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 168 ms. Remains : 320/327 places, 192/192 transitions.
Stuttering acceptance computed with spot in 63 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 558 ms.
Product exploration explored 100000 steps with 50000 reset in 621 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 18 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 1450 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 19 ms. Remains 265 /327 variables (removed 62) and now considering 130/192 (removed 62) transitions.
// Phase 1: matrix 130 rows 265 cols
[2024-06-01 01:28:40] [INFO ] Computed 136 invariants in 3 ms
[2024-06-01 01:28:40] [INFO ] Implicit Places using invariants in 148 ms returned [55, 77, 140, 231, 243, 252]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 149 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 8 ms. Remains 258 /259 variables (removed 1) and now considering 129/130 (removed 1) transitions.
// Phase 1: matrix 129 rows 258 cols
[2024-06-01 01:28:40] [INFO ] Computed 130 invariants in 1 ms
[2024-06-01 01:28:40] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-06-01 01:28:40] [INFO ] Invariant cache hit.
[2024-06-01 01:28:40] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 340 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 516 ms. Remains : 258/327 places, 129/192 transitions.
Stuttering acceptance computed with spot in 117 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 631 ms.
Product exploration explored 100000 steps with 1 reset in 776 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 179 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 307 steps (0 resets) in 10 ms. (27 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 291 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 107 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2024-06-01 01:28:43] [INFO ] Invariant cache hit.
[2024-06-01 01:28:43] [INFO ] [Real]Absence check using 127 positive place invariants in 24 ms returned sat
[2024-06-01 01:28:43] [INFO ] [Real]Absence check using 127 positive and 3 generalized place invariants in 8 ms returned sat
[2024-06-01 01:28:43] [INFO ] [Real]Absence check using state equation in 258 ms returned sat
[2024-06-01 01:28:43] [INFO ] Computed and/alt/rep : 65/129/65 causal constraints (skipped 0 transitions) in 7 ms.
[2024-06-01 01:28:43] [INFO ] Added : 63 causal constraints over 13 iterations in 327 ms. Result :sat
Could not prove EG (NOT p0)
[2024-06-01 01:28:43] [INFO ] Invariant cache hit.
[2024-06-01 01:28:43] [INFO ] [Real]Absence check using 127 positive place invariants in 23 ms returned sat
[2024-06-01 01:28:43] [INFO ] [Real]Absence check using 127 positive and 3 generalized place invariants in 7 ms returned sat
[2024-06-01 01:28:44] [INFO ] [Real]Absence check using state equation in 250 ms returned sat
[2024-06-01 01:28:44] [INFO ] Computed and/alt/rep : 65/129/65 causal constraints (skipped 0 transitions) in 6 ms.
[2024-06-01 01:28:44] [INFO ] Added : 62 causal constraints over 13 iterations in 308 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 11 ms. Remains 258 /258 variables (removed 0) and now considering 129/129 (removed 0) transitions.
[2024-06-01 01:28:44] [INFO ] Invariant cache hit.
[2024-06-01 01:28:44] [INFO ] Implicit Places using invariants in 143 ms returned []
[2024-06-01 01:28:44] [INFO ] Invariant cache hit.
[2024-06-01 01:28:44] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
[2024-06-01 01:28:44] [INFO ] Redundant transitions in 1 ms returned []
Running 65 sub problems to find dead transitions.
[2024-06-01 01:28:44] [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 2336 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 14180 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 16538ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 16539ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 16871 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 188 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 95 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 449 steps (0 resets) in 11 ms. (37 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 253 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 201 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2024-06-01 01:29:02] [INFO ] Invariant cache hit.
[2024-06-01 01:29:02] [INFO ] [Real]Absence check using 127 positive place invariants in 25 ms returned sat
[2024-06-01 01:29:02] [INFO ] [Real]Absence check using 127 positive and 3 generalized place invariants in 9 ms returned sat
[2024-06-01 01:29:02] [INFO ] [Real]Absence check using state equation in 282 ms returned sat
[2024-06-01 01:29:02] [INFO ] Computed and/alt/rep : 65/129/65 causal constraints (skipped 0 transitions) in 7 ms.
[2024-06-01 01:29:03] [INFO ] Added : 63 causal constraints over 13 iterations in 340 ms. Result :sat
Could not prove EG (NOT p0)
[2024-06-01 01:29:03] [INFO ] Invariant cache hit.
[2024-06-01 01:29:03] [INFO ] [Real]Absence check using 127 positive place invariants in 23 ms returned sat
[2024-06-01 01:29:03] [INFO ] [Real]Absence check using 127 positive and 3 generalized place invariants in 8 ms returned sat
[2024-06-01 01:29:03] [INFO ] [Real]Absence check using state equation in 248 ms returned sat
[2024-06-01 01:29:03] [INFO ] Computed and/alt/rep : 65/129/65 causal constraints (skipped 0 transitions) in 6 ms.
[2024-06-01 01:29:03] [INFO ] Added : 62 causal constraints over 13 iterations in 314 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 634 ms.
Product exploration explored 100000 steps with 1 reset in 741 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-06-01 01:29:05] [INFO ] Invariant cache hit.
[2024-06-01 01:29:05] [INFO ] Implicit Places using invariants in 158 ms returned []
[2024-06-01 01:29:05] [INFO ] Invariant cache hit.
[2024-06-01 01:29:05] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
[2024-06-01 01:29:05] [INFO ] Redundant transitions in 1 ms returned []
Running 65 sub problems to find dead transitions.
[2024-06-01 01:29:05] [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 2284 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 14261 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 16552ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 16552ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 16908 ms. Remains : 258/258 places, 129/129 transitions.
Treatment of property CircularTrains-PT-192-LTLFireability-10 finished in 41959 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 12 ms. Remains 264 /327 variables (removed 63) and now considering 129/192 (removed 63) transitions.
// Phase 1: matrix 129 rows 264 cols
[2024-06-01 01:29:22] [INFO ] Computed 136 invariants in 2 ms
[2024-06-01 01:29:22] [INFO ] Implicit Places using invariants in 148 ms returned [5, 55, 76, 139, 230, 251]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 149 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 4 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 165 ms. Remains : 258/327 places, 129/192 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : CircularTrains-PT-192-LTLFireability-11
Product exploration explored 100000 steps with 1485 reset in 804 ms.
Product exploration explored 100000 steps with 1438 reset in 877 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 113 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 36 ms :[(NOT p0)]
RANDOM walk for 390 steps (0 resets) in 9 ms. (39 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 121 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 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
// Phase 1: matrix 129 rows 258 cols
[2024-06-01 01:29:24] [INFO ] Computed 130 invariants in 1 ms
[2024-06-01 01:29:24] [INFO ] [Real]Absence check using 127 positive place invariants in 24 ms returned sat
[2024-06-01 01:29:24] [INFO ] [Real]Absence check using 127 positive and 3 generalized place invariants in 8 ms returned sat
[2024-06-01 01:29:24] [INFO ] [Real]Absence check using state equation in 203 ms returned sat
[2024-06-01 01:29:24] [INFO ] Computed and/alt/rep : 65/129/65 causal constraints (skipped 0 transitions) in 6 ms.
[2024-06-01 01:29:25] [INFO ] Added : 63 causal constraints over 13 iterations in 357 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 5 ms. Remains 258 /258 variables (removed 0) and now considering 129/129 (removed 0) transitions.
[2024-06-01 01:29:25] [INFO ] Invariant cache hit.
[2024-06-01 01:29:25] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-06-01 01:29:25] [INFO ] Invariant cache hit.
[2024-06-01 01:29:25] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
[2024-06-01 01:29:25] [INFO ] Redundant transitions in 0 ms returned []
Running 65 sub problems to find dead transitions.
[2024-06-01 01:29:25] [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 2300 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 12598 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 14904ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 14904ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 15232 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 121 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 181 steps (0 resets) in 6 ms. (25 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 128 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 40 ms :[(NOT p0)]
[2024-06-01 01:29:40] [INFO ] Invariant cache hit.
[2024-06-01 01:29:40] [INFO ] [Real]Absence check using 127 positive place invariants in 24 ms returned sat
[2024-06-01 01:29:40] [INFO ] [Real]Absence check using 127 positive and 3 generalized place invariants in 7 ms returned sat
[2024-06-01 01:29:41] [INFO ] [Real]Absence check using state equation in 211 ms returned sat
[2024-06-01 01:29:41] [INFO ] Computed and/alt/rep : 65/129/65 causal constraints (skipped 0 transitions) in 7 ms.
[2024-06-01 01:29:41] [INFO ] Added : 63 causal constraints over 13 iterations in 354 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1483 reset in 808 ms.
Product exploration explored 100000 steps with 1489 reset in 878 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-06-01 01:29:43] [INFO ] Invariant cache hit.
[2024-06-01 01:29:43] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-06-01 01:29:43] [INFO ] Invariant cache hit.
[2024-06-01 01:29:43] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
[2024-06-01 01:29:43] [INFO ] Redundant transitions in 0 ms returned []
Running 65 sub problems to find dead transitions.
[2024-06-01 01:29:43] [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 2298 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 12520 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 14824ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 14825ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 15147 ms. Remains : 258/258 places, 129/129 transitions.
Treatment of property CircularTrains-PT-192-LTLFireability-11 finished in 36148 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 11 ms. Remains 265 /327 variables (removed 62) and now considering 130/192 (removed 62) transitions.
// Phase 1: matrix 130 rows 265 cols
[2024-06-01 01:29:58] [INFO ] Computed 136 invariants in 1 ms
[2024-06-01 01:29:58] [INFO ] Implicit Places using invariants in 144 ms returned [5, 55, 76, 139, 243, 252]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 145 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-06-01 01:29:58] [INFO ] Computed 130 invariants in 1 ms
[2024-06-01 01:29:58] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-06-01 01:29:58] [INFO ] Invariant cache hit.
[2024-06-01 01:29:58] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 329 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 491 ms. Remains : 258/327 places, 129/192 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : CircularTrains-PT-192-LTLFireability-13
Product exploration explored 100000 steps with 2125 reset in 786 ms.
Product exploration explored 100000 steps with 2090 reset in 852 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 178 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 39 ms :[(NOT p0)]
RANDOM walk for 227 steps (0 resets) in 7 ms. (28 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 162 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 33 ms :[(NOT p0)]
[2024-06-01 01:30:00] [INFO ] Invariant cache hit.
[2024-06-01 01:30:01] [INFO ] [Real]Absence check using 126 positive place invariants in 25 ms returned sat
[2024-06-01 01:30:01] [INFO ] [Real]Absence check using 126 positive and 4 generalized place invariants in 9 ms returned sat
[2024-06-01 01:30:01] [INFO ] [Real]Absence check using state equation in 191 ms returned sat
[2024-06-01 01:30:01] [INFO ] Computed and/alt/rep : 65/129/65 causal constraints (skipped 0 transitions) in 6 ms.
[2024-06-01 01:30:01] [INFO ] Added : 62 causal constraints over 13 iterations in 294 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 5 ms. Remains 258 /258 variables (removed 0) and now considering 129/129 (removed 0) transitions.
[2024-06-01 01:30:01] [INFO ] Invariant cache hit.
[2024-06-01 01:30:01] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-06-01 01:30:01] [INFO ] Invariant cache hit.
[2024-06-01 01:30:01] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
[2024-06-01 01:30:01] [INFO ] Redundant transitions in 0 ms returned []
Running 65 sub problems to find dead transitions.
[2024-06-01 01:30:01] [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 2555 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 13690 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 16252ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 16253ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 16565 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 141 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 26 ms :[(NOT p0)]
RANDOM walk for 163 steps (0 resets) in 6 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 163 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 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
[2024-06-01 01:30:18] [INFO ] Invariant cache hit.
[2024-06-01 01:30:18] [INFO ] [Real]Absence check using 126 positive place invariants in 24 ms returned sat
[2024-06-01 01:30:18] [INFO ] [Real]Absence check using 126 positive and 4 generalized place invariants in 16 ms returned sat
[2024-06-01 01:30:18] [INFO ] [Real]Absence check using state equation in 198 ms returned sat
[2024-06-01 01:30:18] [INFO ] Computed and/alt/rep : 65/129/65 causal constraints (skipped 0 transitions) in 7 ms.
[2024-06-01 01:30:19] [INFO ] Added : 62 causal constraints over 13 iterations in 307 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2133 reset in 799 ms.
Product exploration explored 100000 steps with 2152 reset in 861 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 4 ms. Remains 258 /258 variables (removed 0) and now considering 129/129 (removed 0) transitions.
[2024-06-01 01:30:20] [INFO ] Invariant cache hit.
[2024-06-01 01:30:21] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-06-01 01:30:21] [INFO ] Invariant cache hit.
[2024-06-01 01:30:21] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
[2024-06-01 01:30:21] [INFO ] Redundant transitions in 1 ms returned []
Running 65 sub problems to find dead transitions.
[2024-06-01 01:30:21] [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 2546 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 13502 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 16055ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 16056ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 16382 ms. Remains : 258/258 places, 129/129 transitions.
Treatment of property CircularTrains-PT-192-LTLFireability-13 finished in 39026 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-06-01 01:30:37] [INFO ] Computed 136 invariants in 2 ms
[2024-06-01 01:30:37] [INFO ] Implicit Places using invariants in 149 ms returned [6, 63, 91, 171, 289, 302]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 150 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 156 ms. Remains : 321/327 places, 192/192 transitions.
Stuttering acceptance computed with spot in 233 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 101 steps with 12 reset in 2 ms.
FORMULA CircularTrains-PT-192-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-192-LTLFireability-14 finished in 412 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-06-01 01:30:37] [INFO ] Invariant cache hit.
[2024-06-01 01:30:37] [INFO ] Implicit Places using invariants in 165 ms returned [6, 91, 289, 302, 312]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 175 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 181 ms. Remains : 322/327 places, 192/192 transitions.
Stuttering acceptance computed with spot in 185 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 135 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 385 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 100 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 20 ms. Remains 265 /327 variables (removed 62) and now considering 130/192 (removed 62) transitions.
// Phase 1: matrix 130 rows 265 cols
[2024-06-01 01:30:38] [INFO ] Computed 136 invariants in 2 ms
[2024-06-01 01:30:38] [INFO ] Implicit Places using invariants in 137 ms returned [5, 55, 140, 231, 243, 252]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 138 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 10 ms. Remains 258 /259 variables (removed 1) and now considering 129/130 (removed 1) transitions.
// Phase 1: matrix 129 rows 258 cols
[2024-06-01 01:30:38] [INFO ] Computed 130 invariants in 1 ms
[2024-06-01 01:30:38] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-06-01 01:30:38] [INFO ] Invariant cache hit.
[2024-06-01 01:30:38] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 308 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 476 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 1468 reset in 824 ms.
Product exploration explored 100000 steps with 1434 reset in 863 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 380 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 96 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 553 steps (0 resets) in 14 ms. (36 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 460 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 149 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-06-01 01:30:41] [INFO ] Invariant cache hit.
[2024-06-01 01:30:41] [INFO ] [Real]Absence check using 127 positive place invariants in 22 ms returned sat
[2024-06-01 01:30:41] [INFO ] [Real]Absence check using 127 positive and 3 generalized place invariants in 6 ms returned sat
[2024-06-01 01:30:42] [INFO ] [Real]Absence check using state equation in 292 ms returned sat
[2024-06-01 01:30:42] [INFO ] Computed and/alt/rep : 65/129/65 causal constraints (skipped 0 transitions) in 6 ms.
[2024-06-01 01:30:42] [INFO ] Added : 63 causal constraints over 13 iterations in 338 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-06-01 01:30:42] [INFO ] Invariant cache hit.
[2024-06-01 01:30:42] [INFO ] Implicit Places using invariants in 141 ms returned []
[2024-06-01 01:30:42] [INFO ] Invariant cache hit.
[2024-06-01 01:30:42] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
Running 65 sub problems to find dead transitions.
[2024-06-01 01:30:42] [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 2316 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 14321 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 16644ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 16644ms
Finished structural reductions in LTL mode , in 1 iterations and 16972 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 399 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 109 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 457 steps (0 resets) in 15 ms. (28 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 486 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 104 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-06-01 01:31:00] [INFO ] Invariant cache hit.
[2024-06-01 01:31:00] [INFO ] [Real]Absence check using 127 positive place invariants in 23 ms returned sat
[2024-06-01 01:31:00] [INFO ] [Real]Absence check using 127 positive and 3 generalized place invariants in 6 ms returned sat
[2024-06-01 01:31:01] [INFO ] [Real]Absence check using state equation in 303 ms returned sat
[2024-06-01 01:31:01] [INFO ] Computed and/alt/rep : 65/129/65 causal constraints (skipped 0 transitions) in 6 ms.
[2024-06-01 01:31:01] [INFO ] Added : 63 causal constraints over 13 iterations in 360 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1447 reset in 790 ms.
Product exploration explored 100000 steps with 1439 reset in 846 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 108 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 9 ms. Remains 258 /258 variables (removed 0) and now considering 129/129 (removed 0) transitions.
[2024-06-01 01:31:03] [INFO ] Redundant transitions in 0 ms returned []
Running 65 sub problems to find dead transitions.
[2024-06-01 01:31:03] [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 2301 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 14273 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 16583ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 16584ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 16599 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-06-01 01:31:20] [INFO ] Invariant cache hit.
[2024-06-01 01:31:20] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-06-01 01:31:20] [INFO ] Invariant cache hit.
[2024-06-01 01:31:20] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
Running 65 sub problems to find dead transitions.
[2024-06-01 01:31:20] [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 2245 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 14132 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 16385ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 16385ms
Finished structural reductions in LTL mode , in 1 iterations and 16730 ms. Remains : 258/258 places, 129/129 transitions.
Treatment of property CircularTrains-PT-192-LTLFireability-06 finished in 58656 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 163 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 19 ms. Remains 264 /327 variables (removed 63) and now considering 129/192 (removed 63) transitions.
// Phase 1: matrix 129 rows 264 cols
[2024-06-01 01:31:37] [INFO ] Computed 136 invariants in 1 ms
[2024-06-01 01:31:37] [INFO ] Implicit Places using invariants in 153 ms returned [5, 55, 76, 139, 230, 242, 251]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 163 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-06-01 01:31:37] [INFO ] Computed 129 invariants in 1 ms
[2024-06-01 01:31:37] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-06-01 01:31:37] [INFO ] Invariant cache hit.
[2024-06-01 01:31:37] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 328 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 518 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 301 reset in 678 ms.
Product exploration explored 100000 steps with 331 reset in 753 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 281 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 153 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
RANDOM walk for 177 steps (0 resets) in 7 ms. (22 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(X (NOT 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 263 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 145 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 239 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 3 ms. Remains 256 /256 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2024-06-01 01:31:40] [INFO ] Invariant cache hit.
[2024-06-01 01:31:40] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-06-01 01:31:40] [INFO ] Invariant cache hit.
[2024-06-01 01:31:40] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
Running 64 sub problems to find dead transitions.
[2024-06-01 01:31:40] [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 2289 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 13244 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 15541ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 15541ms
Finished structural reductions in LTL mode , in 1 iterations and 15860 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 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 151 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
RANDOM walk for 243 steps (0 resets) in 7 ms. (30 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 269 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 140 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 345 reset in 673 ms.
Product exploration explored 100000 steps with 327 reset in 742 ms.
Applying partial POR strategy [false, true, false, false]
Stuttering acceptance computed with spot in 165 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 7 ms. Remains 256 /256 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2024-06-01 01:31:59] [INFO ] Redundant transitions in 0 ms returned []
Running 64 sub problems to find dead transitions.
[2024-06-01 01:31:59] [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 2206 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 13496 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 15712ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 15713ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 15727 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-06-01 01:32:14] [INFO ] Invariant cache hit.
[2024-06-01 01:32:14] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-06-01 01:32:14] [INFO ] Invariant cache hit.
[2024-06-01 01:32:15] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
Running 64 sub problems to find dead transitions.
[2024-06-01 01:32:15] [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 2227 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 13290 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 15527ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 15528ms
Finished structural reductions in LTL mode , in 1 iterations and 15846 ms. Remains : 256/256 places, 128/128 transitions.
Treatment of property CircularTrains-PT-192-LTLFireability-08 finished in 53640 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-06-01 01:32:30] [INFO ] Flatten gal took : 16 ms
[2024-06-01 01:32:30] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-06-01 01:32:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 327 places, 192 transitions and 654 arcs took 5 ms.
Total runtime 456606 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA CircularTrains-PT-192-LTLFireability-03 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : CircularTrains-PT-192-LTLFireability-06
FORMULA CircularTrains-PT-192-LTLFireability-08 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : CircularTrains-PT-192-LTLFireability-10
Could not compute solution for formula : CircularTrains-PT-192-LTLFireability-11
Could not compute solution for formula : CircularTrains-PT-192-LTLFireability-13

BK_STOP 1717205749573

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name CircularTrains-PT-192-LTLFireability-03
ltl formula formula --ltl=/tmp/2888/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 327 places, 192 transitions and 654 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.010 user 0.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2888/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2888/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2888/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2888/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 328 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 328, there are 202 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~2500 levels ~10000 states ~123496 transitions
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~3224!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 7343
pnml2lts-mc( 0/ 4): unique transitions count: 126950
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 7347
pnml2lts-mc( 0/ 4): - cum. max stack depth: 7347
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 7347 states 127722 transitions, fanout: 17.384
pnml2lts-mc( 0/ 4): Total exploration time 0.370 sec (0.370 sec minimum, 0.370 sec on average)
pnml2lts-mc( 0/ 4): States per second: 19857, Transitions per second: 345195
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 3.0MB, 38.9 B/state, compr.: 3.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/3.0%
pnml2lts-mc( 0/ 4): Stored 192 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 3.0MB (~256.0MB paged-in)
ltl formula name CircularTrains-PT-192-LTLFireability-06
ltl formula formula --ltl=/tmp/2888/ltl_1_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 327 places, 192 transitions and 654 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2888/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2888/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2888/ltl_1_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.010 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2888/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 329 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 328, there are 202 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~1951 levels ~10000 states ~94220 transitions
pnml2lts-mc( 0/ 4): ~3043 levels ~20000 states ~114468 transitions
pnml2lts-mc( 0/ 4): ~3043 levels ~40000 states ~144820 transitions
pnml2lts-mc( 0/ 4): ~3043 levels ~80000 states ~231000 transitions
pnml2lts-mc( 0/ 4): ~3043 levels ~160000 states ~402756 transitions
pnml2lts-mc( 0/ 4): ~3043 levels ~320000 states ~745096 transitions
pnml2lts-mc( 0/ 4): ~3043 levels ~640000 states ~1469536 transitions
pnml2lts-mc( 0/ 4): ~3043 levels ~1280000 states ~3178596 transitions
pnml2lts-mc( 2/ 4): ~3039 levels ~2560000 states ~6886856 transitions
pnml2lts-mc( 1/ 4): ~3010 levels ~5120000 states ~13674056 transitions
pnml2lts-mc( 2/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 7757019
pnml2lts-mc( 0/ 4): unique states count: 7768738
pnml2lts-mc( 0/ 4): unique transitions count: 20656338
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 13913946
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 8103582
pnml2lts-mc( 0/ 4): - cum. max stack depth: 12128
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 8103582 states 22317489 transitions, fanout: 2.754
pnml2lts-mc( 0/ 4): Total exploration time 42.340 sec (42.340 sec minimum, 42.340 sec on average)
pnml2lts-mc( 0/ 4): States per second: 191393, Transitions per second: 527102
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 123.9MB, 16.6 B/state, compr.: 1.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 23.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 192 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 123.9MB (~256.0MB paged-in)
ltl formula name CircularTrains-PT-192-LTLFireability-08
ltl formula formula --ltl=/tmp/2888/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 327 places, 192 transitions and 654 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.000 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2888/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2888/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2888/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2888/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 328 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 328, there are 206 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~2339 levels ~10000 states ~101976 transitions
pnml2lts-mc( 3/ 4): ~3138 levels ~20000 states ~121700 transitions
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~3191!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 4913
pnml2lts-mc( 0/ 4): unique states count: 17100
pnml2lts-mc( 0/ 4): unique transitions count: 203398
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 2242
pnml2lts-mc( 0/ 4): - claim found count: 2
pnml2lts-mc( 0/ 4): - claim success count: 17103
pnml2lts-mc( 0/ 4): - cum. max stack depth: 12303
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 17103 states 203594 transitions, fanout: 11.904
pnml2lts-mc( 0/ 4): Total exploration time 0.500 sec (0.500 sec minimum, 0.500 sec on average)
pnml2lts-mc( 0/ 4): States per second: 34206, Transitions per second: 407188
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 5.0MB, 29.8 B/state, compr.: 2.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/5.0%
pnml2lts-mc( 0/ 4): Stored 192 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 5.0MB (~256.0MB paged-in)
ltl formula name CircularTrains-PT-192-LTLFireability-10
ltl formula formula --ltl=/tmp/2888/ltl_3_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 327 places, 192 transitions and 654 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.000 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2888/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2888/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2888/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2888/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 328 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 328, there are 205 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~1427 levels ~10000 states ~74460 transitions
pnml2lts-mc( 0/ 4): ~2891 levels ~20000 states ~99240 transitions
pnml2lts-mc( 0/ 4): ~3022 levels ~40000 states ~133968 transitions
pnml2lts-mc( 0/ 4): ~3022 levels ~80000 states ~227440 transitions
pnml2lts-mc( 3/ 4): ~3042 levels ~160000 states ~440324 transitions
pnml2lts-mc( 1/ 4): ~3017 levels ~320000 states ~786320 transitions
pnml2lts-mc( 1/ 4): ~3017 levels ~640000 states ~1473748 transitions
pnml2lts-mc( 1/ 4): ~3017 levels ~1280000 states ~3192920 transitions
pnml2lts-mc( 1/ 4): ~3017 levels ~2560000 states ~6634436 transitions
pnml2lts-mc( 1/ 4): ~3017 levels ~5120000 states ~13498728 transitions
pnml2lts-mc( 1/ 4): ~3017 levels ~10240000 states ~27015824 transitions
pnml2lts-mc( 3/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 10004150
pnml2lts-mc( 0/ 4): unique states count: 10015896
pnml2lts-mc( 0/ 4): unique transitions count: 28601228
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 20671756
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 11089762
pnml2lts-mc( 0/ 4): - cum. max stack depth: 12101
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 11089762 states 32602505 transitions, fanout: 2.940
pnml2lts-mc( 0/ 4): Total exploration time 59.260 sec (59.240 sec minimum, 59.250 sec on average)
pnml2lts-mc( 0/ 4): States per second: 187137, Transitions per second: 550160
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 141.0MB, 14.6 B/state, compr.: 1.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 30.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 192 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 141.0MB (~256.0MB paged-in)
ltl formula name CircularTrains-PT-192-LTLFireability-11
ltl formula formula --ltl=/tmp/2888/ltl_4_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 327 places, 192 transitions and 654 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.000 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2888/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2888/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 1 states
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2888/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2888/ltl_4_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 329 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 328, there are 198 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~1629 levels ~10000 states ~137472 transitions
pnml2lts-mc( 0/ 4): ~3043 levels ~20000 states ~102856 transitions
pnml2lts-mc( 0/ 4): ~3043 levels ~40000 states ~139200 transitions
pnml2lts-mc( 0/ 4): ~3043 levels ~80000 states ~220056 transitions
pnml2lts-mc( 1/ 4): ~3039 levels ~160000 states ~425104 transitions
pnml2lts-mc( 1/ 4): ~3039 levels ~320000 states ~740552 transitions
pnml2lts-mc( 0/ 4): ~3043 levels ~640000 states ~1603944 transitions
pnml2lts-mc( 0/ 4): ~3043 levels ~1280000 states ~3271472 transitions
pnml2lts-mc( 0/ 4): ~3043 levels ~2560000 states ~7014612 transitions
pnml2lts-mc( 0/ 4): ~3043 levels ~5120000 states ~14829376 transitions
pnml2lts-mc( 2/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 7680317
pnml2lts-mc( 0/ 4): unique states count: 7692040
pnml2lts-mc( 0/ 4): unique transitions count: 20762849
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 14650877
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 8227917
pnml2lts-mc( 0/ 4): - cum. max stack depth: 12142
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 8227917 states 23416650 transitions, fanout: 2.846
pnml2lts-mc( 0/ 4): Total exploration time 45.280 sec (45.260 sec minimum, 45.265 sec on average)
pnml2lts-mc( 0/ 4): States per second: 181712, Transitions per second: 517152
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 123.3MB, 16.6 B/state, compr.: 1.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 23.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 192 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 123.3MB (~256.0MB paged-in)
ltl formula name CircularTrains-PT-192-LTLFireability-13
ltl formula formula --ltl=/tmp/2888/ltl_5_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 327 places, 192 transitions and 654 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.010 user 0.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2888/ltl_5_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2888/ltl_5_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2888/ltl_5_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2888/ltl_5_
pnml2lts-mc( 0/ 4): buchi has 1 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 329 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 328, there are 194 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~1450 levels ~10000 states ~83100 transitions
pnml2lts-mc( 2/ 4): ~2866 levels ~20000 states ~107788 transitions
pnml2lts-mc( 2/ 4): ~3042 levels ~40000 states ~144868 transitions
pnml2lts-mc( 2/ 4): ~3042 levels ~80000 states ~233088 transitions
pnml2lts-mc( 2/ 4): ~3042 levels ~160000 states ~406924 transitions
pnml2lts-mc( 2/ 4): ~3042 levels ~320000 states ~773684 transitions
pnml2lts-mc( 2/ 4): ~3042 levels ~640000 states ~1567168 transitions
pnml2lts-mc( 2/ 4): ~3042 levels ~1280000 states ~3213464 transitions
pnml2lts-mc( 2/ 4): ~3042 levels ~2560000 states ~6453148 transitions
pnml2lts-mc( 1/ 4): ~3036 levels ~5120000 states ~14999632 transitions
pnml2lts-mc( 1/ 4): ~3036 levels ~10240000 states ~31587380 transitions
pnml2lts-mc( 0/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 8940730
pnml2lts-mc( 0/ 4): unique states count: 8952235
pnml2lts-mc( 0/ 4): unique transitions count: 25308354
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 17320215
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 9344399
pnml2lts-mc( 0/ 4): - cum. max stack depth: 12095
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 9344399 states 27075255 transitions, fanout: 2.897
pnml2lts-mc( 0/ 4): Total exploration time 48.360 sec (48.350 sec minimum, 48.355 sec on average)
pnml2lts-mc( 0/ 4): States per second: 193226, Transitions per second: 559869
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 133.0MB, 15.4 B/state, compr.: 1.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 26.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 192 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 133.0MB (~256.0MB paged-in)

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="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is CircularTrains-PT-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 r476-tall-171620505700356"
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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;