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-171620505700340.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-048, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r476-tall-171620505700340
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 640K
-rw-r--r-- 1 mcc users 8.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K Apr 12 14:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 229K Apr 12 14:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Apr 12 14:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 12 14:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 37K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717204595128

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-048
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 01:16:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 01:16:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 01:16:36] [INFO ] Load time of PNML (sax parser for PT used): 47 ms
[2024-06-01 01:16:36] [INFO ] Transformed 96 places.
[2024-06-01 01:16:36] [INFO ] Transformed 48 transitions.
[2024-06-01 01:16:36] [INFO ] Parsed PT model containing 96 places and 48 transitions and 192 arcs in 139 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CircularTrains-PT-048-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-048-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 50 out of 96 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 48/48 transitions.
Applied a total of 0 rules in 11 ms. Remains 96 /96 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 96 cols
[2024-06-01 01:16:36] [INFO ] Computed 49 invariants in 10 ms
[2024-06-01 01:16:36] [INFO ] Implicit Places using invariants in 213 ms returned [3, 56, 64, 81, 89, 90, 94]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 244 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 89/96 places, 48/48 transitions.
Applied a total of 0 rules in 4 ms. Remains 89 /89 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 275 ms. Remains : 89/96 places, 48/48 transitions.
Support contains 50 out of 89 places after structural reductions.
[2024-06-01 01:16:37] [INFO ] Flatten gal took : 23 ms
[2024-06-01 01:16:37] [INFO ] Flatten gal took : 9 ms
[2024-06-01 01:16:37] [INFO ] Input system was already deterministic with 48 transitions.
Support contains 48 out of 89 places (down from 50) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 1008 ms. (39 steps per ms) remains 1/24 properties
BEST_FIRST walk for 40004 steps (8 resets) in 227 ms. (175 steps per ms) remains 1/1 properties
// Phase 1: matrix 48 rows 89 cols
[2024-06-01 01:16:37] [INFO ] Computed 42 invariants in 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp17 is UNSAT
After SMT solving in domain Real declared 7/137 variables, and 2 constraints, problems are : Problem set: 1 solved, 0 unsolved in 46 ms.
Refiners :[Positive P Invariants (semi-flows): 2/28 constraints, Generalized P Invariants (flows): 0/14 constraints, State Equation: 0/89 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 76ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
FORMULA CircularTrains-PT-048-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 6 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 48/48 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 89 transition count 46
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 87 transition count 46
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 4 place count 87 transition count 42
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 12 place count 83 transition count 42
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 18 place count 80 transition count 39
Applied a total of 18 rules in 27 ms. Remains 80 /89 variables (removed 9) and now considering 39/48 (removed 9) transitions.
// Phase 1: matrix 39 rows 80 cols
[2024-06-01 01:16:38] [INFO ] Computed 42 invariants in 2 ms
[2024-06-01 01:16:38] [INFO ] Implicit Places using invariants in 87 ms returned [12, 15, 21, 57, 71, 72, 76, 77]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 89 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 72/89 places, 39/48 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 72 transition count 35
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 68 transition count 35
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 67 transition count 34
Applied a total of 10 rules in 10 ms. Remains 67 /72 variables (removed 5) and now considering 34/39 (removed 5) transitions.
// Phase 1: matrix 34 rows 67 cols
[2024-06-01 01:16:38] [INFO ] Computed 34 invariants in 0 ms
[2024-06-01 01:16:38] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-06-01 01:16:38] [INFO ] Invariant cache hit.
[2024-06-01 01:16:38] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 67/89 places, 34/48 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 279 ms. Remains : 67/89 places, 34/48 transitions.
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CircularTrains-PT-048-LTLFireability-01
Product exploration explored 100000 steps with 2754 reset in 385 ms.
Product exploration explored 100000 steps with 2728 reset in 319 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X p1), (X (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 1 factoid took 418 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 75 steps (0 resets) in 4 ms. (15 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 (NOT p0))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X p1), (X (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT (AND (NOT p0) p1))), (F p0)]
Knowledge based reduction with 1 factoid took 552 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 6 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 34/34 transitions.
Applied a total of 0 rules in 7 ms. Remains 67 /67 variables (removed 0) and now considering 34/34 (removed 0) transitions.
[2024-06-01 01:16:40] [INFO ] Invariant cache hit.
[2024-06-01 01:16:40] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-06-01 01:16:40] [INFO ] Invariant cache hit.
[2024-06-01 01:16:40] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
[2024-06-01 01:16:40] [INFO ] Redundant transitions in 0 ms returned []
Running 18 sub problems to find dead transitions.
[2024-06-01 01:16:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 31/66 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 1/67 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 34/101 variables, 67/101 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 0/101 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 101/101 variables, and 101 constraints, problems are : Problem set: 0 solved, 18 unsolved in 387 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 67/67 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 31/66 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 1/67 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 34/101 variables, 67/101 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 18/119 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/101 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 0/101 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 101/101 variables, and 119 constraints, problems are : Problem set: 0 solved, 18 unsolved in 444 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 67/67 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
After SMT, in 840ms problems are : Problem set: 0 solved, 18 unsolved
Search for dead transitions found 0 dead transitions in 841ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 988 ms. Remains : 67/67 places, 34/34 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 449 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 51 steps (0 resets) in 4 ms. (10 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT (AND (NOT p0) p1))), (F p0)]
Knowledge based reduction with 1 factoid took 557 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 2706 reset in 244 ms.
Product exploration explored 100000 steps with 2669 reset in 267 ms.
Support contains 6 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 34/34 transitions.
Applied a total of 0 rules in 3 ms. Remains 67 /67 variables (removed 0) and now considering 34/34 (removed 0) transitions.
[2024-06-01 01:16:43] [INFO ] Invariant cache hit.
[2024-06-01 01:16:43] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-01 01:16:43] [INFO ] Invariant cache hit.
[2024-06-01 01:16:43] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2024-06-01 01:16:43] [INFO ] Redundant transitions in 0 ms returned []
Running 18 sub problems to find dead transitions.
[2024-06-01 01:16:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 31/66 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 1/67 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 34/101 variables, 67/101 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 0/101 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 101/101 variables, and 101 constraints, problems are : Problem set: 0 solved, 18 unsolved in 251 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 67/67 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 31/66 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 1/67 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 34/101 variables, 67/101 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 18/119 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/101 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 0/101 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 101/101 variables, and 119 constraints, problems are : Problem set: 0 solved, 18 unsolved in 403 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 67/67 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
After SMT, in 667ms problems are : Problem set: 0 solved, 18 unsolved
Search for dead transitions found 0 dead transitions in 667ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 795 ms. Remains : 67/67 places, 34/34 transitions.
Treatment of property CircularTrains-PT-048-LTLFireability-01 finished in 6080 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Support contains 4 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 48/48 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 89 transition count 46
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 87 transition count 46
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 4 place count 87 transition count 41
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 14 place count 82 transition count 41
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 20 place count 79 transition count 38
Applied a total of 20 rules in 10 ms. Remains 79 /89 variables (removed 10) and now considering 38/48 (removed 10) transitions.
// Phase 1: matrix 38 rows 79 cols
[2024-06-01 01:16:44] [INFO ] Computed 42 invariants in 1 ms
[2024-06-01 01:16:44] [INFO ] Implicit Places using invariants in 222 ms returned [0, 11, 14, 20, 56, 70, 71, 75, 76]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 224 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 70/89 places, 38/48 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 70 transition count 35
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 67 transition count 35
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 67 transition count 32
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 64 transition count 32
Applied a total of 12 rules in 3 ms. Remains 64 /70 variables (removed 6) and now considering 32/38 (removed 6) transitions.
// Phase 1: matrix 32 rows 64 cols
[2024-06-01 01:16:44] [INFO ] Computed 33 invariants in 0 ms
[2024-06-01 01:16:44] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-06-01 01:16:44] [INFO ] Invariant cache hit.
[2024-06-01 01:16:44] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 64/89 places, 32/48 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 349 ms. Remains : 64/89 places, 32/48 transitions.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CircularTrains-PT-048-LTLFireability-02
Product exploration explored 100000 steps with 5594 reset in 237 ms.
Product exploration explored 100000 steps with 5466 reset in 246 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 306 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 131 steps (0 resets) in 5 ms. (21 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 5 factoid took 370 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-06-01 01:16:45] [INFO ] Invariant cache hit.
[2024-06-01 01:16:45] [INFO ] [Real]Absence check using 31 positive place invariants in 12 ms returned sat
[2024-06-01 01:16:45] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-01 01:16:45] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-06-01 01:16:45] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 01:16:46] [INFO ] [Nat]Absence check using 31 positive place invariants in 5 ms returned sat
[2024-06-01 01:16:46] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-01 01:16:46] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-06-01 01:16:46] [INFO ] Computed and/alt/rep : 16/32/16 causal constraints (skipped 0 transitions) in 6 ms.
[2024-06-01 01:16:46] [INFO ] Added : 14 causal constraints over 3 iterations in 48 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 4 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 32/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 64 /64 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2024-06-01 01:16:46] [INFO ] Invariant cache hit.
[2024-06-01 01:16:46] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-06-01 01:16:46] [INFO ] Invariant cache hit.
[2024-06-01 01:16:46] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
[2024-06-01 01:16:46] [INFO ] Redundant transitions in 0 ms returned []
Running 16 sub problems to find dead transitions.
[2024-06-01 01:16:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 31/63 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 1/64 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 32/96 variables, 64/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/96 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 96/96 variables, and 97 constraints, problems are : Problem set: 0 solved, 16 unsolved in 267 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 31/63 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 1/64 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 32/96 variables, 64/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 16/113 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/96 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/96 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 96/96 variables, and 113 constraints, problems are : Problem set: 0 solved, 16 unsolved in 426 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 702ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 702ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 819 ms. Remains : 64/64 places, 32/32 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 272 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 91 steps (0 resets) in 8 ms. (10 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 5 factoid took 384 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-06-01 01:16:47] [INFO ] Invariant cache hit.
[2024-06-01 01:16:47] [INFO ] [Real]Absence check using 31 positive place invariants in 4 ms returned sat
[2024-06-01 01:16:47] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-01 01:16:47] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-06-01 01:16:47] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 01:16:47] [INFO ] [Nat]Absence check using 31 positive place invariants in 4 ms returned sat
[2024-06-01 01:16:47] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-01 01:16:48] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2024-06-01 01:16:48] [INFO ] Computed and/alt/rep : 16/32/16 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 01:16:48] [INFO ] Added : 14 causal constraints over 3 iterations in 27 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 5517 reset in 230 ms.
Product exploration explored 100000 steps with 5451 reset in 243 ms.
Support contains 4 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 32/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 64 /64 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2024-06-01 01:16:48] [INFO ] Invariant cache hit.
[2024-06-01 01:16:48] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-01 01:16:48] [INFO ] Invariant cache hit.
[2024-06-01 01:16:48] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2024-06-01 01:16:48] [INFO ] Redundant transitions in 0 ms returned []
Running 16 sub problems to find dead transitions.
[2024-06-01 01:16:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 31/63 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 1/64 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 32/96 variables, 64/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/96 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 96/96 variables, and 97 constraints, problems are : Problem set: 0 solved, 16 unsolved in 222 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 31/63 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 1/64 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 32/96 variables, 64/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 16/113 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/96 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/96 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 96/96 variables, and 113 constraints, problems are : Problem set: 0 solved, 16 unsolved in 314 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 541ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 542ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 661 ms. Remains : 64/64 places, 32/32 transitions.
Treatment of property CircularTrains-PT-048-LTLFireability-02 finished in 5324 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(!p0)&&X(p1)) U X(X((p2 U p3)))))'
Support contains 8 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 48/48 transitions.
Applied a total of 0 rules in 2 ms. Remains 89 /89 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 89 cols
[2024-06-01 01:16:49] [INFO ] Computed 42 invariants in 1 ms
[2024-06-01 01:16:49] [INFO ] Implicit Places using invariants in 55 ms returned [1, 15, 21, 61, 79, 80, 85]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 55 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 82/89 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 82 /82 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 59 ms. Remains : 82/89 places, 48/48 transitions.
Stuttering acceptance computed with spot in 304 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3), true, (AND p0 (NOT p3)), (NOT p3), p0]
Running random walk in product with property : CircularTrains-PT-048-LTLFireability-03
Entered a terminal (fully accepting) state of product in 21 steps with 0 reset in 0 ms.
FORMULA CircularTrains-PT-048-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-048-LTLFireability-03 finished in 384 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X((p1&&G(p2))))))'
Support contains 6 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 89 /89 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2024-06-01 01:16:49] [INFO ] Invariant cache hit.
[2024-06-01 01:16:49] [INFO ] Implicit Places using invariants in 86 ms returned [1, 12, 15, 61, 79, 80, 86]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 87 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 82/89 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 82 /82 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 89 ms. Remains : 82/89 places, 48/48 transitions.
Stuttering acceptance computed with spot in 193 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CircularTrains-PT-048-LTLFireability-04
Product exploration explored 100000 steps with 2933 reset in 222 ms.
Product exploration explored 100000 steps with 2945 reset in 245 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2))))]
Knowledge based reduction with 3 factoid took 293 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 163 steps (0 resets) in 5 ms. (27 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (F (NOT (AND (NOT p0) p2))), (F (NOT (OR p0 p2))), (F (NOT p1)), (F p0), (F (NOT p2)), (F (NOT (AND p1 p2))), (F (NOT (AND p1 p2)))]
Knowledge based reduction with 3 factoid took 455 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 172 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Support contains 6 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 82 /82 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 82 cols
[2024-06-01 01:16:51] [INFO ] Computed 35 invariants in 2 ms
[2024-06-01 01:16:51] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-06-01 01:16:51] [INFO ] Invariant cache hit.
[2024-06-01 01:16:51] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
Running 32 sub problems to find dead transitions.
[2024-06-01 01:16:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (OVERLAPS) 31/81 variables, 31/32 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (OVERLAPS) 1/82 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 48/130 variables, 82/117 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 0/130 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 117 constraints, problems are : Problem set: 0 solved, 32 unsolved in 522 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 82/82 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (OVERLAPS) 31/81 variables, 31/32 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (OVERLAPS) 1/82 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 48/130 variables, 82/117 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 32/149 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 10 (OVERLAPS) 0/130 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 149 constraints, problems are : Problem set: 0 solved, 32 unsolved in 855 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 82/82 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
After SMT, in 1390ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 1391ms
Finished structural reductions in LTL mode , in 1 iterations and 1524 ms. Remains : 82/82 places, 48/48 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2)]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (OR (NOT p1) (NOT p2)))), (X (X (NOT (OR (NOT p1) (NOT p2))))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 232 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 111 steps (0 resets) in 12 ms. (8 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) p1 p2)]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (OR (NOT p1) (NOT p2)))), (X (X (NOT (OR (NOT p1) (NOT p2))))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND (NOT p0) p2))), (F (NOT (OR p0 p2))), (F (NOT p1)), (F p0), (F (NOT p2)), (F (NOT (AND p1 p2))), (F (NOT (AND p1 p2)))]
Knowledge based reduction with 1 factoid took 420 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 181 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 186 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Product exploration explored 100000 steps with 2935 reset in 219 ms.
Product exploration explored 100000 steps with 2942 reset in 238 ms.
Applying partial POR strategy [true, false, true, false, false]
Stuttering acceptance computed with spot in 200 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Support contains 6 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 48/48 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 82 transition count 48
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 10 place count 82 transition count 48
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 82 transition count 48
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 82 transition count 48
Deduced a syphon composed of 14 places in 0 ms
Applied a total of 14 rules in 8 ms. Remains 82 /82 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2024-06-01 01:16:55] [INFO ] Redundant transitions in 1 ms returned []
Running 32 sub problems to find dead transitions.
// Phase 1: matrix 48 rows 82 cols
[2024-06-01 01:16:55] [INFO ] Computed 35 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (OVERLAPS) 31/81 variables, 31/32 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-06-01 01:16:55] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 7 ms to minimize.
[2024-06-01 01:16:55] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
[2024-06-01 01:16:55] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
Problem TDEAD1 is UNSAT
[2024-06-01 01:16:55] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 2 ms to minimize.
[2024-06-01 01:16:55] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 1 ms to minimize.
Problem TDEAD20 is UNSAT
[2024-06-01 01:16:55] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 4 ms to minimize.
Problem TDEAD25 is UNSAT
[2024-06-01 01:16:56] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 1 ms to minimize.
[2024-06-01 01:16:56] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
Problem TDEAD29 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD26 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 8/42 constraints. Problems are: Problem set: 8 solved, 24 unsolved
[2024-06-01 01:16:56] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-06-01 01:16:56] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD5 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 2/44 constraints. Problems are: Problem set: 10 solved, 22 unsolved
[2024-06-01 01:16:56] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-06-01 01:16:56] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-06-01 01:16:56] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD8 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 3/47 constraints. Problems are: Problem set: 13 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 0/47 constraints. Problems are: Problem set: 13 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 1/82 variables, 1/48 constraints. Problems are: Problem set: 13 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/82 variables, 0/48 constraints. Problems are: Problem set: 13 solved, 19 unsolved
Problem TDEAD4 is UNSAT
At refinement iteration 10 (OVERLAPS) 48/130 variables, 82/130 constraints. Problems are: Problem set: 14 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/130 variables, 0/130 constraints. Problems are: Problem set: 14 solved, 18 unsolved
At refinement iteration 12 (OVERLAPS) 0/130 variables, 0/130 constraints. Problems are: Problem set: 14 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 130 constraints, problems are : Problem set: 14 solved, 18 unsolved in 872 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 82/82 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 14 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 14 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 45/81 variables, 31/31 constraints. Problems are: Problem set: 14 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 3/34 constraints. Problems are: Problem set: 14 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 13/47 constraints. Problems are: Problem set: 14 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/47 constraints. Problems are: Problem set: 14 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 1/82 variables, 1/48 constraints. Problems are: Problem set: 14 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/48 constraints. Problems are: Problem set: 14 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 48/130 variables, 82/130 constraints. Problems are: Problem set: 14 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 18/148 constraints. Problems are: Problem set: 14 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 0/148 constraints. Problems are: Problem set: 14 solved, 18 unsolved
At refinement iteration 10 (OVERLAPS) 0/130 variables, 0/148 constraints. Problems are: Problem set: 14 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 148 constraints, problems are : Problem set: 14 solved, 18 unsolved in 388 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 82/82 constraints, PredecessorRefiner: 18/32 constraints, Known Traps: 13/13 constraints]
After SMT, in 1278ms problems are : Problem set: 14 solved, 18 unsolved
Search for dead transitions found 14 dead transitions in 1278ms
Found 14 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 14 transitions
Dead transitions reduction (with SMT) removed 14 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 82/82 places, 34/48 transitions.
Graph (complete) has 136 edges and 82 vertex of which 68 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 68 /82 variables (removed 14) and now considering 34/34 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 68/82 places, 34/48 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1295 ms. Remains : 68/82 places, 34/48 transitions.
Support contains 6 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 48/48 transitions.
Applied a total of 0 rules in 0 ms. Remains 82 /82 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 82 cols
[2024-06-01 01:16:56] [INFO ] Computed 35 invariants in 0 ms
[2024-06-01 01:16:56] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-06-01 01:16:56] [INFO ] Invariant cache hit.
[2024-06-01 01:16:57] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
Running 32 sub problems to find dead transitions.
[2024-06-01 01:16:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (OVERLAPS) 31/81 variables, 31/32 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (OVERLAPS) 1/82 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 48/130 variables, 82/117 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 0/130 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 117 constraints, problems are : Problem set: 0 solved, 32 unsolved in 568 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 82/82 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (OVERLAPS) 31/81 variables, 31/32 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (OVERLAPS) 1/82 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 48/130 variables, 82/117 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 32/149 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 10 (OVERLAPS) 0/130 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 149 constraints, problems are : Problem set: 0 solved, 32 unsolved in 913 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 82/82 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
After SMT, in 1486ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 1487ms
Finished structural reductions in LTL mode , in 1 iterations and 1607 ms. Remains : 82/82 places, 48/48 transitions.
Treatment of property CircularTrains-PT-048-LTLFireability-04 finished in 8784 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 48/48 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 89 transition count 45
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 86 transition count 45
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 6 place count 86 transition count 41
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 14 place count 82 transition count 41
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 22 place count 78 transition count 37
Applied a total of 22 rules in 4 ms. Remains 78 /89 variables (removed 11) and now considering 37/48 (removed 11) transitions.
// Phase 1: matrix 37 rows 78 cols
[2024-06-01 01:16:58] [INFO ] Computed 42 invariants in 0 ms
[2024-06-01 01:16:58] [INFO ] Implicit Places using invariants in 92 ms returned [0, 11, 14, 20, 55, 69, 70, 74, 75]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 111 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 69/89 places, 37/48 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 69 transition count 33
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 65 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 64 transition count 32
Applied a total of 10 rules in 2 ms. Remains 64 /69 variables (removed 5) and now considering 32/37 (removed 5) transitions.
// Phase 1: matrix 32 rows 64 cols
[2024-06-01 01:16:58] [INFO ] Computed 33 invariants in 0 ms
[2024-06-01 01:16:58] [INFO ] Implicit Places using invariants in 188 ms returned []
[2024-06-01 01:16:58] [INFO ] Invariant cache hit.
[2024-06-01 01:16:58] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 64/89 places, 32/48 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 367 ms. Remains : 64/89 places, 32/48 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : CircularTrains-PT-048-LTLFireability-05
Product exploration explored 100000 steps with 7939 reset in 215 ms.
Product exploration explored 100000 steps with 7979 reset in 253 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 150 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
RANDOM walk for 54 steps (0 resets) in 4 ms. (10 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 161 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
[2024-06-01 01:16:59] [INFO ] Invariant cache hit.
[2024-06-01 01:16:59] [INFO ] [Real]Absence check using 31 positive place invariants in 16 ms returned sat
[2024-06-01 01:16:59] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-01 01:16:59] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-06-01 01:16:59] [INFO ] Computed and/alt/rep : 16/32/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 01:16:59] [INFO ] Added : 14 causal constraints over 3 iterations in 22 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 32/32 transitions.
Applied a total of 0 rules in 3 ms. Remains 64 /64 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2024-06-01 01:16:59] [INFO ] Invariant cache hit.
[2024-06-01 01:16:59] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-01 01:16:59] [INFO ] Invariant cache hit.
[2024-06-01 01:17:00] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
[2024-06-01 01:17:00] [INFO ] Redundant transitions in 0 ms returned []
Running 16 sub problems to find dead transitions.
[2024-06-01 01:17:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 31/63 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 1/64 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 32/96 variables, 64/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/96 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 96/96 variables, and 97 constraints, problems are : Problem set: 0 solved, 16 unsolved in 253 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 31/63 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 1/64 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 32/96 variables, 64/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 16/113 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/96 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/96 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 96/96 variables, and 113 constraints, problems are : Problem set: 0 solved, 16 unsolved in 326 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 582ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 583ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 697 ms. Remains : 64/64 places, 32/32 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 159 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
RANDOM walk for 65 steps (0 resets) in 4 ms. (13 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 142 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
[2024-06-01 01:17:01] [INFO ] Invariant cache hit.
[2024-06-01 01:17:01] [INFO ] [Real]Absence check using 31 positive place invariants in 4 ms returned sat
[2024-06-01 01:17:01] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-01 01:17:01] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-06-01 01:17:01] [INFO ] Computed and/alt/rep : 16/32/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 01:17:01] [INFO ] Added : 14 causal constraints over 3 iterations in 22 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Product exploration explored 100000 steps with 7907 reset in 214 ms.
Product exploration explored 100000 steps with 7877 reset in 231 ms.
Support contains 2 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 32/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 64 /64 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2024-06-01 01:17:01] [INFO ] Invariant cache hit.
[2024-06-01 01:17:01] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-01 01:17:01] [INFO ] Invariant cache hit.
[2024-06-01 01:17:01] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2024-06-01 01:17:01] [INFO ] Redundant transitions in 0 ms returned []
Running 16 sub problems to find dead transitions.
[2024-06-01 01:17:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 31/63 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 1/64 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 32/96 variables, 64/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/96 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 96/96 variables, and 97 constraints, problems are : Problem set: 0 solved, 16 unsolved in 218 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 31/63 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 1/64 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 32/96 variables, 64/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 16/113 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/96 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/96 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 96/96 variables, and 113 constraints, problems are : Problem set: 0 solved, 16 unsolved in 321 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 544ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 545ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 673 ms. Remains : 64/64 places, 32/32 transitions.
Treatment of property CircularTrains-PT-048-LTLFireability-05 finished in 3781 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U G(p1)))'
Support contains 4 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 89 /89 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 89 cols
[2024-06-01 01:17:02] [INFO ] Computed 42 invariants in 1 ms
[2024-06-01 01:17:02] [INFO ] Implicit Places using invariants in 55 ms returned [1, 12, 15, 21, 61, 79, 80, 85, 86]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 68 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 80/89 places, 48/48 transitions.
Applied a total of 0 rules in 0 ms. Remains 80 /80 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 70 ms. Remains : 80/89 places, 48/48 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) p0)]
Running random walk in product with property : CircularTrains-PT-048-LTLFireability-06
Entered a terminal (fully accepting) state of product in 68 steps with 15 reset in 1 ms.
FORMULA CircularTrains-PT-048-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-048-LTLFireability-06 finished in 235 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1)&&F(G(p2)))))'
Support contains 6 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 48/48 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 89 transition count 46
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 87 transition count 46
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 4 place count 87 transition count 41
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 14 place count 82 transition count 41
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 20 place count 79 transition count 38
Applied a total of 20 rules in 9 ms. Remains 79 /89 variables (removed 10) and now considering 38/48 (removed 10) transitions.
// Phase 1: matrix 38 rows 79 cols
[2024-06-01 01:17:02] [INFO ] Computed 42 invariants in 1 ms
[2024-06-01 01:17:02] [INFO ] Implicit Places using invariants in 63 ms returned [0, 11, 14, 20, 55, 70, 71, 75, 76]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 64 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 70/89 places, 38/48 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 70 transition count 35
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 67 transition count 35
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 67 transition count 32
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 64 transition count 32
Applied a total of 12 rules in 3 ms. Remains 64 /70 variables (removed 6) and now considering 32/38 (removed 6) transitions.
// Phase 1: matrix 32 rows 64 cols
[2024-06-01 01:17:02] [INFO ] Computed 33 invariants in 1 ms
[2024-06-01 01:17:02] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-06-01 01:17:02] [INFO ] Invariant cache hit.
[2024-06-01 01:17:02] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 64/89 places, 32/48 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 193 ms. Remains : 64/89 places, 32/48 transitions.
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : CircularTrains-PT-048-LTLFireability-07
Product exploration explored 100000 steps with 2 reset in 204 ms.
Stack based approach found an accepted trace after 33437 steps with 0 reset with depth 33438 and stack size 8754 in 125 ms.
FORMULA CircularTrains-PT-048-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property CircularTrains-PT-048-LTLFireability-07 finished in 681 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 89 /89 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 89 cols
[2024-06-01 01:17:03] [INFO ] Computed 42 invariants in 1 ms
[2024-06-01 01:17:03] [INFO ] Implicit Places using invariants in 56 ms returned [1, 12, 15, 21, 61, 79, 80, 85, 86]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 58 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 80/89 places, 48/48 transitions.
Applied a total of 0 rules in 0 ms. Remains 80 /80 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62 ms. Remains : 80/89 places, 48/48 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-048-LTLFireability-08
Product exploration explored 100000 steps with 2965 reset in 210 ms.
Product exploration explored 100000 steps with 2949 reset in 220 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 69 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 122 steps (0 resets) in 4 ms. (24 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 97 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 48 rows 80 cols
[2024-06-01 01:17:04] [INFO ] Computed 33 invariants in 2 ms
[2024-06-01 01:17:04] [INFO ] [Real]Absence check using 31 positive place invariants in 5 ms returned sat
[2024-06-01 01:17:04] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-01 01:17:04] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2024-06-01 01:17:04] [INFO ] Computed and/alt/rep : 32/48/32 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 01:17:04] [INFO ] Added : 29 causal constraints over 6 iterations in 55 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 48/48 transitions.
Applied a total of 0 rules in 0 ms. Remains 80 /80 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2024-06-01 01:17:04] [INFO ] Invariant cache hit.
[2024-06-01 01:17:04] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-06-01 01:17:04] [INFO ] Invariant cache hit.
[2024-06-01 01:17:04] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
Running 32 sub problems to find dead transitions.
[2024-06-01 01:17:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 31/79 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/80 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 48/128 variables, 80/113 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (OVERLAPS) 0/128 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 113 constraints, problems are : Problem set: 0 solved, 32 unsolved in 470 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 80/80 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 31/79 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/80 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 48/128 variables, 80/113 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 32/145 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 0/128 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 145 constraints, problems are : Problem set: 0 solved, 32 unsolved in 803 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 80/80 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
After SMT, in 1285ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 1286ms
Finished structural reductions in LTL mode , in 1 iterations and 1399 ms. Remains : 80/80 places, 48/48 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 85 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 114 steps (0 resets) in 4 ms. (22 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 104 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-06-01 01:17:06] [INFO ] Invariant cache hit.
[2024-06-01 01:17:06] [INFO ] [Real]Absence check using 31 positive place invariants in 5 ms returned sat
[2024-06-01 01:17:06] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-01 01:17:06] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2024-06-01 01:17:06] [INFO ] Computed and/alt/rep : 32/48/32 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 01:17:06] [INFO ] Added : 29 causal constraints over 6 iterations in 63 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2930 reset in 204 ms.
Product exploration explored 100000 steps with 2959 reset in 229 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 48/48 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 80 transition count 48
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 14 place count 80 transition count 48
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 80 transition count 48
Deduced a syphon composed of 16 places in 0 ms
Applied a total of 16 rules in 8 ms. Remains 80 /80 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2024-06-01 01:17:07] [INFO ] Redundant transitions in 1 ms returned []
Running 32 sub problems to find dead transitions.
// Phase 1: matrix 48 rows 80 cols
[2024-06-01 01:17:07] [INFO ] Computed 33 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 31/79 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-06-01 01:17:07] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-06-01 01:17:07] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-06-01 01:17:07] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
[2024-06-01 01:17:07] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
[2024-06-01 01:17:07] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
Problem TDEAD1 is UNSAT
[2024-06-01 01:17:07] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-06-01 01:17:07] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-06-01 01:17:07] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
[2024-06-01 01:17:07] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-06-01 01:17:07] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-06-01 01:17:07] [INFO ] Deduced a trap composed of 2 places in 13 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-06-01 01:17:07] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-06-01 01:17:07] [INFO ] Deduced a trap composed of 2 places in 13 ms of which 1 ms to minimize.
Problem TDEAD8 is UNSAT
[2024-06-01 01:17:07] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-06-01 01:17:08] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
Problem TDEAD18 is UNSAT
[2024-06-01 01:17:08] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem TDEAD23 is UNSAT
[2024-06-01 01:17:08] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD24 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 17/49 constraints. Problems are: Problem set: 16 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/49 constraints. Problems are: Problem set: 16 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 1/80 variables, 1/50 constraints. Problems are: Problem set: 16 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 0/50 constraints. Problems are: Problem set: 16 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 48/128 variables, 80/130 constraints. Problems are: Problem set: 16 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 0/130 constraints. Problems are: Problem set: 16 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/128 variables, 0/130 constraints. Problems are: Problem set: 16 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 130 constraints, problems are : Problem set: 16 solved, 16 unsolved in 730 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 80/80 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 16 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 16 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 47/79 variables, 31/31 constraints. Problems are: Problem set: 16 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 1/32 constraints. Problems are: Problem set: 16 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 17/49 constraints. Problems are: Problem set: 16 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/49 constraints. Problems are: Problem set: 16 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 1/80 variables, 1/50 constraints. Problems are: Problem set: 16 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 0/50 constraints. Problems are: Problem set: 16 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 48/128 variables, 80/130 constraints. Problems are: Problem set: 16 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 16/146 constraints. Problems are: Problem set: 16 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/128 variables, 0/146 constraints. Problems are: Problem set: 16 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 0/128 variables, 0/146 constraints. Problems are: Problem set: 16 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 146 constraints, problems are : Problem set: 16 solved, 16 unsolved in 332 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 80/80 constraints, PredecessorRefiner: 16/32 constraints, Known Traps: 17/17 constraints]
After SMT, in 1073ms problems are : Problem set: 16 solved, 16 unsolved
Search for dead transitions found 16 dead transitions in 1074ms
Found 16 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 16 transitions
Dead transitions reduction (with SMT) removed 16 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 80/80 places, 32/48 transitions.
Graph (complete) has 128 edges and 80 vertex of which 64 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 64 /80 variables (removed 16) and now considering 32/32 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 64/80 places, 32/48 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1096 ms. Remains : 64/80 places, 32/48 transitions.
Support contains 2 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 48/48 transitions.
Applied a total of 0 rules in 2 ms. Remains 80 /80 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 80 cols
[2024-06-01 01:17:08] [INFO ] Computed 33 invariants in 1 ms
[2024-06-01 01:17:08] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-06-01 01:17:08] [INFO ] Invariant cache hit.
[2024-06-01 01:17:08] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
Running 32 sub problems to find dead transitions.
[2024-06-01 01:17:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 31/79 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/80 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 48/128 variables, 80/113 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (OVERLAPS) 0/128 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 113 constraints, problems are : Problem set: 0 solved, 32 unsolved in 472 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 80/80 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 31/79 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/80 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 48/128 variables, 80/113 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 32/145 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 0/128 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 145 constraints, problems are : Problem set: 0 solved, 32 unsolved in 769 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 80/80 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
After SMT, in 1245ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 1247ms
Finished structural reductions in LTL mode , in 1 iterations and 1357 ms. Remains : 80/80 places, 48/48 transitions.
Treatment of property CircularTrains-PT-048-LTLFireability-08 finished in 6817 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||G(F(!p1)))))'
Support contains 4 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 89 /89 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 89 cols
[2024-06-01 01:17:10] [INFO ] Computed 42 invariants in 1 ms
[2024-06-01 01:17:10] [INFO ] Implicit Places using invariants in 60 ms returned [1, 12, 15, 21, 61, 79, 80, 85, 86]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 61 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 80/89 places, 48/48 transitions.
Applied a total of 0 rules in 0 ms. Remains 80 /80 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63 ms. Remains : 80/89 places, 48/48 transitions.
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, p1]
Running random walk in product with property : CircularTrains-PT-048-LTLFireability-10
Product exploration explored 100000 steps with 2398 reset in 210 ms.
Product exploration explored 100000 steps with 2398 reset in 227 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 273 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) p1), p1, p1]
RANDOM walk for 210 steps (0 resets) in 6 ms. (30 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (NOT p0)), (F (NOT p1)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 3 factoid took 341 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) p1), p1, p1]
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p0) p1), p1, p1]
Support contains 4 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 48/48 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 80 transition count 35
Reduce places removed 13 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 14 rules applied. Total rules applied 27 place count 67 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 28 place count 66 transition count 34
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 28 place count 66 transition count 32
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 32 place count 64 transition count 32
Applied a total of 32 rules in 9 ms. Remains 64 /80 variables (removed 16) and now considering 32/48 (removed 16) transitions.
// Phase 1: matrix 32 rows 64 cols
[2024-06-01 01:17:11] [INFO ] Computed 33 invariants in 4 ms
[2024-06-01 01:17:11] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-01 01:17:11] [INFO ] Invariant cache hit.
[2024-06-01 01:17:11] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2024-06-01 01:17:11] [INFO ] Redundant transitions in 1 ms returned []
Running 16 sub problems to find dead transitions.
[2024-06-01 01:17:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 31/63 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 1/64 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 32/96 variables, 64/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/96 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 96/96 variables, and 97 constraints, problems are : Problem set: 0 solved, 16 unsolved in 221 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 31/63 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 1/64 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 32/96 variables, 64/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 16/113 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/96 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/96 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 96/96 variables, and 113 constraints, problems are : Problem set: 0 solved, 16 unsolved in 337 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 568ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 570ms
Starting structural reductions in SI_LTL mode, iteration 1 : 64/80 places, 32/48 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 699 ms. Remains : 64/80 places, 32/48 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 298 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 97 ms :[(AND (NOT p0) p1), p1, p1]
RANDOM walk for 107 steps (0 resets) in 7 ms. (13 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1), (X p1)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT p1)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 2 factoid took 368 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 102 ms :[(AND (NOT p0) p1), p1, p1]
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) p1), p1, p1]
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) p1), p1, p1]
Product exploration explored 100000 steps with 3112 reset in 207 ms.
Product exploration explored 100000 steps with 3183 reset in 229 ms.
Support contains 4 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 64 /64 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2024-06-01 01:17:13] [INFO ] Invariant cache hit.
[2024-06-01 01:17:13] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-06-01 01:17:13] [INFO ] Invariant cache hit.
[2024-06-01 01:17:13] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2024-06-01 01:17:14] [INFO ] Redundant transitions in 1 ms returned []
Running 16 sub problems to find dead transitions.
[2024-06-01 01:17:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 31/63 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 1/64 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 32/96 variables, 64/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/96 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 96/96 variables, and 97 constraints, problems are : Problem set: 0 solved, 16 unsolved in 233 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 31/63 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 1/64 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 32/96 variables, 64/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 16/113 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/96 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/96 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 96/96 variables, and 113 constraints, problems are : Problem set: 0 solved, 16 unsolved in 351 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 588ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 589ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 697 ms. Remains : 64/64 places, 32/32 transitions.
Treatment of property CircularTrains-PT-048-LTLFireability-10 finished in 4582 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(!p1))))'
Support contains 4 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 48/48 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 89 transition count 46
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 87 transition count 46
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 4 place count 87 transition count 41
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 14 place count 82 transition count 41
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 22 place count 78 transition count 37
Applied a total of 22 rules in 4 ms. Remains 78 /89 variables (removed 11) and now considering 37/48 (removed 11) transitions.
// Phase 1: matrix 37 rows 78 cols
[2024-06-01 01:17:14] [INFO ] Computed 42 invariants in 1 ms
[2024-06-01 01:17:14] [INFO ] Implicit Places using invariants in 54 ms returned [0, 11, 14, 20, 69, 70, 74, 75]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 55 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 70/89 places, 37/48 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 70 transition count 34
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 67 transition count 34
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 66 transition count 33
Applied a total of 8 rules in 2 ms. Remains 66 /70 variables (removed 4) and now considering 33/37 (removed 4) transitions.
// Phase 1: matrix 33 rows 66 cols
[2024-06-01 01:17:14] [INFO ] Computed 34 invariants in 1 ms
[2024-06-01 01:17:14] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-06-01 01:17:14] [INFO ] Invariant cache hit.
[2024-06-01 01:17:14] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 66/89 places, 33/48 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 192 ms. Remains : 66/89 places, 33/48 transitions.
Stuttering acceptance computed with spot in 29 ms :[(AND p1 (NOT p0))]
Running random walk in product with property : CircularTrains-PT-048-LTLFireability-11
Product exploration explored 100000 steps with 7973 reset in 237 ms.
Product exploration explored 100000 steps with 7927 reset in 249 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 3 factoid took 349 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p0) p1)]
RANDOM walk for 110 steps (0 resets) in 5 ms. (18 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT (AND (NOT p0) p1))), (F p0)]
Knowledge based reduction with 3 factoid took 454 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) p1)]
[2024-06-01 01:17:16] [INFO ] Invariant cache hit.
[2024-06-01 01:17:16] [INFO ] [Real]Absence check using 31 positive place invariants in 5 ms returned sat
[2024-06-01 01:17:16] [INFO ] [Real]Absence check using 31 positive and 3 generalized place invariants in 2 ms returned sat
[2024-06-01 01:17:16] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-06-01 01:17:16] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 01:17:16] [INFO ] [Nat]Absence check using 31 positive place invariants in 4 ms returned sat
[2024-06-01 01:17:16] [INFO ] [Nat]Absence check using 31 positive and 3 generalized place invariants in 4 ms returned sat
[2024-06-01 01:17:16] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-06-01 01:17:16] [INFO ] Computed and/alt/rep : 17/33/17 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 01:17:16] [INFO ] Added : 15 causal constraints over 3 iterations in 20 ms. Result :sat
Could not prove EG (AND (NOT p0) p1)
Support contains 4 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 33/33 transitions.
Applied a total of 0 rules in 2 ms. Remains 66 /66 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2024-06-01 01:17:16] [INFO ] Invariant cache hit.
[2024-06-01 01:17:16] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-06-01 01:17:16] [INFO ] Invariant cache hit.
[2024-06-01 01:17:16] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2024-06-01 01:17:16] [INFO ] Redundant transitions in 0 ms returned []
Running 17 sub problems to find dead transitions.
[2024-06-01 01:17:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 31/65 variables, 31/32 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 1/66 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 33/99 variables, 66/100 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/99 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 0/99 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 99/99 variables, and 100 constraints, problems are : Problem set: 0 solved, 17 unsolved in 264 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 66/66 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 31/65 variables, 31/32 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 1/66 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 33/99 variables, 66/100 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/99 variables, 17/117 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/99 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 0/99 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 99/99 variables, and 117 constraints, problems are : Problem set: 0 solved, 17 unsolved in 356 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 66/66 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 625ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 626ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 730 ms. Remains : 66/66 places, 33/33 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 355 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p0) p1)]
RANDOM walk for 90 steps (0 resets) in 7 ms. (11 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT (AND (NOT p0) p1))), (F p0)]
Knowledge based reduction with 3 factoid took 425 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 27 ms :[(AND (NOT p0) p1)]
[2024-06-01 01:17:18] [INFO ] Invariant cache hit.
[2024-06-01 01:17:18] [INFO ] [Real]Absence check using 31 positive place invariants in 4 ms returned sat
[2024-06-01 01:17:18] [INFO ] [Real]Absence check using 31 positive and 3 generalized place invariants in 2 ms returned sat
[2024-06-01 01:17:18] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-06-01 01:17:18] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 01:17:18] [INFO ] [Nat]Absence check using 31 positive place invariants in 4 ms returned sat
[2024-06-01 01:17:18] [INFO ] [Nat]Absence check using 31 positive and 3 generalized place invariants in 2 ms returned sat
[2024-06-01 01:17:18] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-06-01 01:17:18] [INFO ] Computed and/alt/rep : 17/33/17 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 01:17:18] [INFO ] Added : 15 causal constraints over 3 iterations in 29 ms. Result :sat
Could not prove EG (AND (NOT p0) p1)
Stuttering acceptance computed with spot in 30 ms :[(AND (NOT p0) p1)]
Product exploration explored 100000 steps with 7977 reset in 230 ms.
Product exploration explored 100000 steps with 7966 reset in 248 ms.
Support contains 4 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 33/33 transitions.
Applied a total of 0 rules in 1 ms. Remains 66 /66 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2024-06-01 01:17:18] [INFO ] Invariant cache hit.
[2024-06-01 01:17:18] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-06-01 01:17:18] [INFO ] Invariant cache hit.
[2024-06-01 01:17:18] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2024-06-01 01:17:18] [INFO ] Redundant transitions in 0 ms returned []
Running 17 sub problems to find dead transitions.
[2024-06-01 01:17:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 31/65 variables, 31/32 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 1/66 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 33/99 variables, 66/100 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/99 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 0/99 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 99/99 variables, and 100 constraints, problems are : Problem set: 0 solved, 17 unsolved in 259 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 66/66 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 31/65 variables, 31/32 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 1/66 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 33/99 variables, 66/100 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/99 variables, 17/117 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/99 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 0/99 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 99/99 variables, and 117 constraints, problems are : Problem set: 0 solved, 17 unsolved in 335 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 66/66 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 601ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 601ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 724 ms. Remains : 66/66 places, 33/33 transitions.
Treatment of property CircularTrains-PT-048-LTLFireability-11 finished in 4863 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(F((p1||G(p2))))))'
Support contains 6 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 89 /89 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 89 cols
[2024-06-01 01:17:19] [INFO ] Computed 42 invariants in 1 ms
[2024-06-01 01:17:19] [INFO ] Implicit Places using invariants in 55 ms returned [1, 12, 15, 21, 80, 85, 86]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 56 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 82/89 places, 48/48 transitions.
Applied a total of 0 rules in 0 ms. Remains 82 /82 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 57 ms. Remains : 82/89 places, 48/48 transitions.
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : CircularTrains-PT-048-LTLFireability-12
Product exploration explored 100000 steps with 7592 reset in 253 ms.
Product exploration explored 100000 steps with 7534 reset in 269 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 509 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter sensitive) to 8 states, 21 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 308 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), false, false, false, false, false, false]
RANDOM walk for 1859 steps (0 resets) in 23 ms. (77 steps per ms) remains 0/11 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p1) p0 (NOT p2)))), (F (NOT (OR (NOT p1) p0 p2))), (F (NOT (OR p1 (NOT p0) p2))), (F p2), (F (NOT (OR (NOT p1) (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p1) (NOT p0) p2))), (F p0), (F p1), (F (NOT (OR p1 p0 (NOT p2)))), (F (NOT (OR p1 (NOT p0) (NOT p2))))]
Knowledge based reduction with 3 factoid took 783 ms. Reduced automaton from 8 states, 21 edges and 3 AP (stutter insensitive) to 8 states, 21 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 334 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), false, false, false, false, false, false]
Stuttering acceptance computed with spot in 336 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), false, false, false, false, false, false]
// Phase 1: matrix 48 rows 82 cols
[2024-06-01 01:17:22] [INFO ] Computed 35 invariants in 1 ms
[2024-06-01 01:17:22] [INFO ] [Real]Absence check using 30 positive place invariants in 5 ms returned sat
[2024-06-01 01:17:22] [INFO ] [Real]Absence check using 30 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-01 01:17:22] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2024-06-01 01:17:22] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 01:17:22] [INFO ] [Nat]Absence check using 30 positive place invariants in 4 ms returned sat
[2024-06-01 01:17:22] [INFO ] [Nat]Absence check using 30 positive and 5 generalized place invariants in 2 ms returned sat
[2024-06-01 01:17:22] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2024-06-01 01:17:22] [INFO ] Computed and/alt/rep : 32/48/32 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 01:17:22] [INFO ] Added : 29 causal constraints over 6 iterations in 55 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0) (NOT p2))
Support contains 6 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 48/48 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 82 transition count 38
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 72 transition count 38
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 20 place count 72 transition count 36
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 70 transition count 36
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 28 place count 68 transition count 34
Applied a total of 28 rules in 8 ms. Remains 68 /82 variables (removed 14) and now considering 34/48 (removed 14) transitions.
// Phase 1: matrix 34 rows 68 cols
[2024-06-01 01:17:22] [INFO ] Computed 35 invariants in 1 ms
[2024-06-01 01:17:22] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-06-01 01:17:22] [INFO ] Invariant cache hit.
[2024-06-01 01:17:22] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2024-06-01 01:17:22] [INFO ] Redundant transitions in 0 ms returned []
Running 18 sub problems to find dead transitions.
[2024-06-01 01:17:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (OVERLAPS) 30/66 variables, 30/32 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 2/68 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 34/102 variables, 68/103 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 0/102 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 102/102 variables, and 103 constraints, problems are : Problem set: 0 solved, 18 unsolved in 298 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (OVERLAPS) 30/66 variables, 30/32 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 2/68 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 34/102 variables, 68/103 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 18/121 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (OVERLAPS) 0/102 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 102/102 variables, and 121 constraints, problems are : Problem set: 0 solved, 18 unsolved in 337 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
After SMT, in 643ms problems are : Problem set: 0 solved, 18 unsolved
Search for dead transitions found 0 dead transitions in 647ms
Starting structural reductions in SI_LTL mode, iteration 1 : 68/82 places, 34/48 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 760 ms. Remains : 68/82 places, 34/48 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND p1 p0 p2))), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT p0)), (X (NOT (AND (NOT p1) p0 p2))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND (NOT p1) p0 p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (AND p1 (NOT p0) (NOT p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (AND (NOT p1) (NOT p0) p2)), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p1 (NOT p0) p2))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 10 factoid took 1111 ms. Reduced automaton from 8 states, 21 edges and 3 AP (stutter insensitive) to 8 states, 21 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 307 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), false, false, false, false, false, false]
RANDOM walk for 931 steps (0 resets) in 10 ms. (84 steps per ms) remains 0/11 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND p1 p0 p2))), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT p0)), (X (NOT (AND (NOT p1) p0 p2))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND (NOT p1) p0 p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (AND p1 (NOT p0) (NOT p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (AND (NOT p1) (NOT p0) p2)), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p1 (NOT p0) p2))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p1) p0 (NOT p2)))), (F (NOT (OR (NOT p1) p0 p2))), (F (NOT (OR p1 (NOT p0) p2))), (F p2), (F (NOT (OR (NOT p1) (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p1) (NOT p0) p2))), (F p0), (F p1), (F (NOT (OR p1 p0 (NOT p2)))), (F (NOT (OR p1 (NOT p0) (NOT p2))))]
Knowledge based reduction with 10 factoid took 1359 ms. Reduced automaton from 8 states, 21 edges and 3 AP (stutter insensitive) to 8 states, 21 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 297 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), false, false, false, false, false, false]
Stuttering acceptance computed with spot in 297 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), false, false, false, false, false, false]
[2024-06-01 01:17:26] [INFO ] Invariant cache hit.
[2024-06-01 01:17:26] [INFO ] [Real]Absence check using 30 positive place invariants in 4 ms returned sat
[2024-06-01 01:17:26] [INFO ] [Real]Absence check using 30 positive and 5 generalized place invariants in 2 ms returned sat
[2024-06-01 01:17:27] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-06-01 01:17:27] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 01:17:27] [INFO ] [Nat]Absence check using 30 positive place invariants in 4 ms returned sat
[2024-06-01 01:17:27] [INFO ] [Nat]Absence check using 30 positive and 5 generalized place invariants in 2 ms returned sat
[2024-06-01 01:17:27] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-06-01 01:17:27] [INFO ] Computed and/alt/rep : 18/34/18 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 01:17:27] [INFO ] Added : 16 causal constraints over 4 iterations in 30 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 263 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), false, false, false, false, false, false]
Product exploration explored 100000 steps with 10712 reset in 245 ms.
Product exploration explored 100000 steps with 10744 reset in 269 ms.
Support contains 6 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 34/34 transitions.
Applied a total of 0 rules in 1 ms. Remains 68 /68 variables (removed 0) and now considering 34/34 (removed 0) transitions.
[2024-06-01 01:17:27] [INFO ] Invariant cache hit.
[2024-06-01 01:17:27] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-06-01 01:17:27] [INFO ] Invariant cache hit.
[2024-06-01 01:17:27] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2024-06-01 01:17:28] [INFO ] Redundant transitions in 0 ms returned []
Running 18 sub problems to find dead transitions.
[2024-06-01 01:17:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (OVERLAPS) 30/66 variables, 30/32 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 2/68 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 34/102 variables, 68/103 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 0/102 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 102/102 variables, and 103 constraints, problems are : Problem set: 0 solved, 18 unsolved in 266 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (OVERLAPS) 30/66 variables, 30/32 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 2/68 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 34/102 variables, 68/103 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 18/121 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (OVERLAPS) 0/102 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 102/102 variables, and 121 constraints, problems are : Problem set: 0 solved, 18 unsolved in 320 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
After SMT, in 599ms problems are : Problem set: 0 solved, 18 unsolved
Search for dead transitions found 0 dead transitions in 601ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 709 ms. Remains : 68/68 places, 34/34 transitions.
Treatment of property CircularTrains-PT-048-LTLFireability-12 finished in 9141 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 48/48 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 89 transition count 45
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 86 transition count 45
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 6 place count 86 transition count 41
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 14 place count 82 transition count 41
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 20 place count 79 transition count 38
Applied a total of 20 rules in 3 ms. Remains 79 /89 variables (removed 10) and now considering 38/48 (removed 10) transitions.
// Phase 1: matrix 38 rows 79 cols
[2024-06-01 01:17:28] [INFO ] Computed 42 invariants in 0 ms
[2024-06-01 01:17:28] [INFO ] Implicit Places using invariants in 55 ms returned [1, 12, 15, 21, 56, 70, 71, 75, 76]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 68 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 70/89 places, 38/48 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 70 transition count 34
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 66 transition count 34
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 8 place count 66 transition count 32
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 64 transition count 32
Applied a total of 12 rules in 2 ms. Remains 64 /70 variables (removed 6) and now considering 32/38 (removed 6) transitions.
// Phase 1: matrix 32 rows 64 cols
[2024-06-01 01:17:28] [INFO ] Computed 33 invariants in 1 ms
[2024-06-01 01:17:28] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-06-01 01:17:28] [INFO ] Invariant cache hit.
[2024-06-01 01:17:28] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 64/89 places, 32/48 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 177 ms. Remains : 64/89 places, 32/48 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : CircularTrains-PT-048-LTLFireability-13
Product exploration explored 100000 steps with 5576 reset in 209 ms.
Product exploration explored 100000 steps with 5584 reset in 221 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 124 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
RANDOM walk for 77 steps (0 resets) in 4 ms. (15 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 196 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 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
[2024-06-01 01:17:29] [INFO ] Invariant cache hit.
[2024-06-01 01:17:29] [INFO ] [Real]Absence check using 31 positive place invariants in 4 ms returned sat
[2024-06-01 01:17:29] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-01 01:17:29] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-06-01 01:17:29] [INFO ] Computed and/alt/rep : 16/32/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 01:17:29] [INFO ] Added : 14 causal constraints over 3 iterations in 27 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 32/32 transitions.
Applied a total of 0 rules in 6 ms. Remains 64 /64 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2024-06-01 01:17:29] [INFO ] Invariant cache hit.
[2024-06-01 01:17:29] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-06-01 01:17:29] [INFO ] Invariant cache hit.
[2024-06-01 01:17:29] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
[2024-06-01 01:17:29] [INFO ] Redundant transitions in 0 ms returned []
Running 16 sub problems to find dead transitions.
[2024-06-01 01:17:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 31/63 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 1/64 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 32/96 variables, 64/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/96 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 96/96 variables, and 97 constraints, problems are : Problem set: 0 solved, 16 unsolved in 203 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 31/63 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 1/64 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 32/96 variables, 64/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 16/113 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/96 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/96 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 96/96 variables, and 113 constraints, problems are : Problem set: 0 solved, 16 unsolved in 296 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 502ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 502ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 635 ms. Remains : 64/64 places, 32/32 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 115 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
RANDOM walk for 98 steps (0 resets) in 5 ms. (16 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 147 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
[2024-06-01 01:17:30] [INFO ] Invariant cache hit.
[2024-06-01 01:17:30] [INFO ] [Real]Absence check using 31 positive place invariants in 4 ms returned sat
[2024-06-01 01:17:30] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-01 01:17:30] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-06-01 01:17:30] [INFO ] Computed and/alt/rep : 16/32/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 01:17:30] [INFO ] Added : 14 causal constraints over 3 iterations in 22 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration explored 100000 steps with 5619 reset in 210 ms.
Product exploration explored 100000 steps with 5565 reset in 220 ms.
Support contains 2 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 32/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 64 /64 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2024-06-01 01:17:31] [INFO ] Invariant cache hit.
[2024-06-01 01:17:31] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-06-01 01:17:31] [INFO ] Invariant cache hit.
[2024-06-01 01:17:31] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
[2024-06-01 01:17:31] [INFO ] Redundant transitions in 0 ms returned []
Running 16 sub problems to find dead transitions.
[2024-06-01 01:17:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 31/63 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 1/64 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 32/96 variables, 64/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/96 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 96/96 variables, and 97 constraints, problems are : Problem set: 0 solved, 16 unsolved in 217 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 31/63 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 1/64 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 32/96 variables, 64/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 16/113 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/96 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/96 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 96/96 variables, and 113 constraints, problems are : Problem set: 0 solved, 16 unsolved in 298 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 531ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 532ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 634 ms. Remains : 64/64 places, 32/32 transitions.
Treatment of property CircularTrains-PT-048-LTLFireability-13 finished in 3391 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0&&X(p1))))'
Support contains 6 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 89 /89 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 89 cols
[2024-06-01 01:17:32] [INFO ] Computed 42 invariants in 1 ms
[2024-06-01 01:17:32] [INFO ] Implicit Places using invariants in 55 ms returned [1, 12, 15, 21, 61, 79, 85, 86]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 65 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 81/89 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 81 /81 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 67 ms. Remains : 81/89 places, 48/48 transitions.
Stuttering acceptance computed with spot in 114 ms :[(NOT p1), (OR (NOT p1) p0), (OR (NOT p1) p0), true]
Running random walk in product with property : CircularTrains-PT-048-LTLFireability-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CircularTrains-PT-048-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-048-LTLFireability-15 finished in 190 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X((p1&&G(p2))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Found a Shortening insensitive property : CircularTrains-PT-048-LTLFireability-08
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 89 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 89/89 places, 48/48 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 89 transition count 45
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 86 transition count 45
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 6 place count 86 transition count 41
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 14 place count 82 transition count 41
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 20 place count 79 transition count 38
Applied a total of 20 rules in 5 ms. Remains 79 /89 variables (removed 10) and now considering 38/48 (removed 10) transitions.
// Phase 1: matrix 38 rows 79 cols
[2024-06-01 01:17:32] [INFO ] Computed 42 invariants in 6 ms
[2024-06-01 01:17:32] [INFO ] Implicit Places using invariants in 58 ms returned [0, 11, 14, 20, 56, 70, 71, 75, 76]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 71 ms to find 9 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 70/89 places, 38/48 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 70 transition count 34
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 66 transition count 34
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 8 place count 66 transition count 32
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 64 transition count 32
Applied a total of 12 rules in 1 ms. Remains 64 /70 variables (removed 6) and now considering 32/38 (removed 6) transitions.
// Phase 1: matrix 32 rows 64 cols
[2024-06-01 01:17:32] [INFO ] Computed 33 invariants in 0 ms
[2024-06-01 01:17:32] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-06-01 01:17:32] [INFO ] Invariant cache hit.
[2024-06-01 01:17:32] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 64/89 places, 32/48 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 170 ms. Remains : 64/89 places, 32/48 transitions.
Running random walk in product with property : CircularTrains-PT-048-LTLFireability-08
Product exploration explored 100000 steps with 5616 reset in 209 ms.
Product exploration explored 100000 steps with 5590 reset in 220 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 135 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 64 steps (0 resets) in 5 ms. (10 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 146 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-06-01 01:17:34] [INFO ] Invariant cache hit.
[2024-06-01 01:17:34] [INFO ] [Real]Absence check using 31 positive place invariants in 4 ms returned sat
[2024-06-01 01:17:34] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-01 01:17:34] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-06-01 01:17:34] [INFO ] Computed and/alt/rep : 16/32/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 01:17:34] [INFO ] Added : 14 causal constraints over 3 iterations in 32 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 64 /64 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2024-06-01 01:17:34] [INFO ] Invariant cache hit.
[2024-06-01 01:17:34] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-06-01 01:17:34] [INFO ] Invariant cache hit.
[2024-06-01 01:17:34] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
Running 16 sub problems to find dead transitions.
[2024-06-01 01:17:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 31/63 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 1/64 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 32/96 variables, 64/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/96 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 96/96 variables, and 97 constraints, problems are : Problem set: 0 solved, 16 unsolved in 200 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 31/63 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 1/64 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 32/96 variables, 64/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 16/113 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/96 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/96 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 96/96 variables, and 113 constraints, problems are : Problem set: 0 solved, 16 unsolved in 326 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 530ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 530ms
Finished structural reductions in LTL mode , in 1 iterations and 663 ms. Remains : 64/64 places, 32/32 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 202 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 64 steps (0 resets) in 4 ms. (12 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 113 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-06-01 01:17:35] [INFO ] Invariant cache hit.
[2024-06-01 01:17:35] [INFO ] [Real]Absence check using 31 positive place invariants in 3 ms returned sat
[2024-06-01 01:17:35] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-01 01:17:35] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-06-01 01:17:35] [INFO ] Computed and/alt/rep : 16/32/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 01:17:35] [INFO ] Added : 14 causal constraints over 3 iterations in 27 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5598 reset in 205 ms.
Product exploration explored 100000 steps with 5657 reset in 226 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 64 /64 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2024-06-01 01:17:36] [INFO ] Redundant transitions in 1 ms returned []
Running 16 sub problems to find dead transitions.
[2024-06-01 01:17:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 31/63 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 1/64 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 32/96 variables, 64/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/96 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 96/96 variables, and 97 constraints, problems are : Problem set: 0 solved, 16 unsolved in 217 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 31/63 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 1/64 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 32/96 variables, 64/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 16/113 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/96 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/96 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 96/96 variables, and 113 constraints, problems are : Problem set: 0 solved, 16 unsolved in 331 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 555ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 556ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 563 ms. Remains : 64/64 places, 32/32 transitions.
Support contains 2 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 64 /64 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2024-06-01 01:17:36] [INFO ] Invariant cache hit.
[2024-06-01 01:17:36] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-06-01 01:17:36] [INFO ] Invariant cache hit.
[2024-06-01 01:17:36] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
Running 16 sub problems to find dead transitions.
[2024-06-01 01:17:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 31/63 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 1/64 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 32/96 variables, 64/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/96 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 96/96 variables, and 97 constraints, problems are : Problem set: 0 solved, 16 unsolved in 207 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 31/63 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 1/64 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 32/96 variables, 64/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 16/113 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/96 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/96 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 96/96 variables, and 113 constraints, problems are : Problem set: 0 solved, 16 unsolved in 345 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 557ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 559ms
Finished structural reductions in LTL mode , in 1 iterations and 664 ms. Remains : 64/64 places, 32/32 transitions.
Treatment of property CircularTrains-PT-048-LTLFireability-08 finished in 4921 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||G(F(!p1)))))'
Found a Lengthening insensitive property : CircularTrains-PT-048-LTLFireability-10
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, p1]
Support contains 4 out of 89 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 89/89 places, 48/48 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 89 transition count 45
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 86 transition count 45
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 6 place count 86 transition count 41
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 14 place count 82 transition count 41
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 22 place count 78 transition count 37
Applied a total of 22 rules in 9 ms. Remains 78 /89 variables (removed 11) and now considering 37/48 (removed 11) transitions.
// Phase 1: matrix 37 rows 78 cols
[2024-06-01 01:17:37] [INFO ] Computed 42 invariants in 1 ms
[2024-06-01 01:17:37] [INFO ] Implicit Places using invariants in 55 ms returned [0, 11, 14, 20, 55, 69, 70, 74, 75]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 66 ms to find 9 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 69/89 places, 37/48 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 69 transition count 34
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 66 transition count 34
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 6 place count 66 transition count 32
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 64 transition count 32
Applied a total of 10 rules in 2 ms. Remains 64 /69 variables (removed 5) and now considering 32/37 (removed 5) transitions.
// Phase 1: matrix 32 rows 64 cols
[2024-06-01 01:17:37] [INFO ] Computed 33 invariants in 0 ms
[2024-06-01 01:17:37] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-06-01 01:17:37] [INFO ] Invariant cache hit.
[2024-06-01 01:17:37] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 64/89 places, 32/48 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 172 ms. Remains : 64/89 places, 32/48 transitions.
Running random walk in product with property : CircularTrains-PT-048-LTLFireability-10
Product exploration explored 100000 steps with 3199 reset in 210 ms.
Product exploration explored 100000 steps with 3192 reset in 228 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 316 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) p1), p1, p1]
RANDOM walk for 93 steps (0 resets) in 6 ms. (13 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1), (X p1)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT p1)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 2 factoid took 339 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 110 ms :[(AND (NOT p0) p1), p1, p1]
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) p1), p1, p1]
Support contains 4 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 64 /64 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2024-06-01 01:17:39] [INFO ] Invariant cache hit.
[2024-06-01 01:17:39] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-01 01:17:39] [INFO ] Invariant cache hit.
[2024-06-01 01:17:39] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2024-06-01 01:17:39] [INFO ] Redundant transitions in 0 ms returned []
Running 16 sub problems to find dead transitions.
[2024-06-01 01:17:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 31/63 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 1/64 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 32/96 variables, 64/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/96 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 96/96 variables, and 97 constraints, problems are : Problem set: 0 solved, 16 unsolved in 205 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 31/63 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 1/64 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 32/96 variables, 64/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 16/113 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/96 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/96 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 96/96 variables, and 113 constraints, problems are : Problem set: 0 solved, 16 unsolved in 360 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 570ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 570ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 682 ms. Remains : 64/64 places, 32/32 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 426 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 94 ms :[(AND (NOT p0) p1), p1, p1]
RANDOM walk for 101 steps (0 resets) in 7 ms. (12 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1), (X p1)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT p1)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 2 factoid took 399 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) p1), p1, p1]
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) p1), p1, p1]
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) p1), p1, p1]
Product exploration explored 100000 steps with 3157 reset in 207 ms.
Product exploration explored 100000 steps with 3152 reset in 226 ms.
Support contains 4 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 32/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 64 /64 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2024-06-01 01:17:41] [INFO ] Invariant cache hit.
[2024-06-01 01:17:41] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-06-01 01:17:41] [INFO ] Invariant cache hit.
[2024-06-01 01:17:41] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2024-06-01 01:17:41] [INFO ] Redundant transitions in 0 ms returned []
Running 16 sub problems to find dead transitions.
[2024-06-01 01:17:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 31/63 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 1/64 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 32/96 variables, 64/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/96 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 96/96 variables, and 97 constraints, problems are : Problem set: 0 solved, 16 unsolved in 209 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 31/63 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 1/64 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 32/96 variables, 64/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 16/113 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/96 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/96 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 96/96 variables, and 113 constraints, problems are : Problem set: 0 solved, 16 unsolved in 379 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 592ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 593ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 706 ms. Remains : 64/64 places, 32/32 transitions.
Treatment of property CircularTrains-PT-048-LTLFireability-10 finished in 4956 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(!p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(F((p1||G(p2))))))'
Found a Shortening insensitive property : CircularTrains-PT-048-LTLFireability-12
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 6 out of 89 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 89/89 places, 48/48 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 89 transition count 45
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 86 transition count 45
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 6 place count 86 transition count 41
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 14 place count 82 transition count 41
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 20 place count 79 transition count 38
Applied a total of 20 rules in 5 ms. Remains 79 /89 variables (removed 10) and now considering 38/48 (removed 10) transitions.
// Phase 1: matrix 38 rows 79 cols
[2024-06-01 01:17:42] [INFO ] Computed 42 invariants in 0 ms
[2024-06-01 01:17:42] [INFO ] Implicit Places using invariants in 58 ms returned [0, 11, 14, 20, 71, 75, 76]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 59 ms to find 7 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 72/89 places, 38/48 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 72 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 71 transition count 37
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 71 transition count 35
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 69 transition count 35
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 68 transition count 34
Applied a total of 8 rules in 3 ms. Remains 68 /72 variables (removed 4) and now considering 34/38 (removed 4) transitions.
// Phase 1: matrix 34 rows 68 cols
[2024-06-01 01:17:42] [INFO ] Computed 35 invariants in 0 ms
[2024-06-01 01:17:42] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-06-01 01:17:42] [INFO ] Invariant cache hit.
[2024-06-01 01:17:42] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 68/89 places, 34/48 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 177 ms. Remains : 68/89 places, 34/48 transitions.
Running random walk in product with property : CircularTrains-PT-048-LTLFireability-12
Product exploration explored 100000 steps with 10702 reset in 252 ms.
Product exploration explored 100000 steps with 10799 reset in 261 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 530 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter sensitive) to 8 states, 21 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 317 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), false, false, false, false, false, false]
RANDOM walk for 818 steps (0 resets) in 20 ms. (38 steps per ms) remains 0/11 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p1) p0 (NOT p2)))), (F (NOT (OR (NOT p1) p0 p2))), (F (NOT (OR p1 (NOT p0) p2))), (F p2), (F (NOT (OR (NOT p1) (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p1) (NOT p0) p2))), (F p0), (F p1), (F (NOT (OR p1 p0 (NOT p2)))), (F (NOT (OR p1 (NOT p0) (NOT p2))))]
Knowledge based reduction with 2 factoid took 888 ms. Reduced automaton from 8 states, 21 edges and 3 AP (stutter insensitive) to 8 states, 21 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 309 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), false, false, false, false, false, false]
Stuttering acceptance computed with spot in 292 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), false, false, false, false, false, false]
[2024-06-01 01:17:45] [INFO ] Invariant cache hit.
[2024-06-01 01:17:45] [INFO ] [Real]Absence check using 30 positive place invariants in 4 ms returned sat
[2024-06-01 01:17:45] [INFO ] [Real]Absence check using 30 positive and 5 generalized place invariants in 2 ms returned sat
[2024-06-01 01:17:45] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-06-01 01:17:45] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 01:17:45] [INFO ] [Nat]Absence check using 30 positive place invariants in 4 ms returned sat
[2024-06-01 01:17:45] [INFO ] [Nat]Absence check using 30 positive and 5 generalized place invariants in 2 ms returned sat
[2024-06-01 01:17:45] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-06-01 01:17:45] [INFO ] Computed and/alt/rep : 18/34/18 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 01:17:45] [INFO ] Added : 13 causal constraints over 3 iterations in 23 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0) (NOT p2))
Support contains 6 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 34/34 transitions.
Applied a total of 0 rules in 1 ms. Remains 68 /68 variables (removed 0) and now considering 34/34 (removed 0) transitions.
[2024-06-01 01:17:45] [INFO ] Invariant cache hit.
[2024-06-01 01:17:46] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-06-01 01:17:46] [INFO ] Invariant cache hit.
[2024-06-01 01:17:46] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2024-06-01 01:17:46] [INFO ] Redundant transitions in 0 ms returned []
Running 18 sub problems to find dead transitions.
[2024-06-01 01:17:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (OVERLAPS) 30/66 variables, 30/32 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 2/68 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 34/102 variables, 68/103 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 0/102 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 102/102 variables, and 103 constraints, problems are : Problem set: 0 solved, 18 unsolved in 288 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (OVERLAPS) 30/66 variables, 30/32 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 2/68 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 34/102 variables, 68/103 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 18/121 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (OVERLAPS) 0/102 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 102/102 variables, and 121 constraints, problems are : Problem set: 0 solved, 18 unsolved in 308 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
After SMT, in 600ms problems are : Problem set: 0 solved, 18 unsolved
Search for dead transitions found 0 dead transitions in 601ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 709 ms. Remains : 68/68 places, 34/34 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND p1 p0 p2))), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT p0)), (X (NOT (AND (NOT p1) p0 p2))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND (NOT p1) p0 p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (AND p1 (NOT p0) (NOT p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (AND (NOT p1) (NOT p0) p2)), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p1 (NOT p0) p2))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 10 factoid took 933 ms. Reduced automaton from 8 states, 21 edges and 3 AP (stutter insensitive) to 8 states, 21 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 288 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), false, false, false, false, false, false]
RANDOM walk for 607 steps (0 resets) in 10 ms. (55 steps per ms) remains 0/11 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND p1 p0 p2))), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT p0)), (X (NOT (AND (NOT p1) p0 p2))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND (NOT p1) p0 p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (AND p1 (NOT p0) (NOT p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (AND (NOT p1) (NOT p0) p2)), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p1 (NOT p0) p2))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p1) p0 (NOT p2)))), (F (NOT (OR (NOT p1) p0 p2))), (F (NOT (OR p1 (NOT p0) p2))), (F p2), (F (NOT (OR (NOT p1) (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p1) (NOT p0) p2))), (F p0), (F p1), (F (NOT (OR p1 p0 (NOT p2)))), (F (NOT (OR p1 (NOT p0) (NOT p2))))]
Knowledge based reduction with 10 factoid took 1332 ms. Reduced automaton from 8 states, 21 edges and 3 AP (stutter insensitive) to 8 states, 21 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 303 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), false, false, false, false, false, false]
Stuttering acceptance computed with spot in 314 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), false, false, false, false, false, false]
[2024-06-01 01:17:49] [INFO ] Invariant cache hit.
[2024-06-01 01:17:49] [INFO ] [Real]Absence check using 30 positive place invariants in 4 ms returned sat
[2024-06-01 01:17:49] [INFO ] [Real]Absence check using 30 positive and 5 generalized place invariants in 2 ms returned sat
[2024-06-01 01:17:49] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-06-01 01:17:49] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 01:17:49] [INFO ] [Nat]Absence check using 30 positive place invariants in 4 ms returned sat
[2024-06-01 01:17:50] [INFO ] [Nat]Absence check using 30 positive and 5 generalized place invariants in 2 ms returned sat
[2024-06-01 01:17:50] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-06-01 01:17:50] [INFO ] Computed and/alt/rep : 18/34/18 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 01:17:50] [INFO ] Added : 13 causal constraints over 3 iterations in 25 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 392 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), false, false, false, false, false, false]
Product exploration explored 100000 steps with 10809 reset in 253 ms.
Product exploration explored 100000 steps with 10575 reset in 276 ms.
Support contains 6 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 34/34 transitions.
Applied a total of 0 rules in 1 ms. Remains 68 /68 variables (removed 0) and now considering 34/34 (removed 0) transitions.
[2024-06-01 01:17:50] [INFO ] Invariant cache hit.
[2024-06-01 01:17:51] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-01 01:17:51] [INFO ] Invariant cache hit.
[2024-06-01 01:17:51] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[2024-06-01 01:17:51] [INFO ] Redundant transitions in 1 ms returned []
Running 18 sub problems to find dead transitions.
[2024-06-01 01:17:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (OVERLAPS) 30/66 variables, 30/32 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 2/68 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 34/102 variables, 68/103 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 0/102 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 102/102 variables, and 103 constraints, problems are : Problem set: 0 solved, 18 unsolved in 282 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (OVERLAPS) 30/66 variables, 30/32 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 2/68 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 34/102 variables, 68/103 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 18/121 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (OVERLAPS) 0/102 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 102/102 variables, and 121 constraints, problems are : Problem set: 0 solved, 18 unsolved in 293 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
After SMT, in 580ms problems are : Problem set: 0 solved, 18 unsolved
Search for dead transitions found 0 dead transitions in 581ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 704 ms. Remains : 68/68 places, 34/34 transitions.
Treatment of property CircularTrains-PT-048-LTLFireability-12 finished in 9125 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
[2024-06-01 01:17:51] [INFO ] Flatten gal took : 11 ms
[2024-06-01 01:17:51] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-06-01 01:17:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 89 places, 48 transitions and 178 arcs took 1 ms.
Total runtime 75536 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : CircularTrains-PT-048-LTLFireability-01
Could not compute solution for formula : CircularTrains-PT-048-LTLFireability-02
Could not compute solution for formula : CircularTrains-PT-048-LTLFireability-04
Could not compute solution for formula : CircularTrains-PT-048-LTLFireability-05
Could not compute solution for formula : CircularTrains-PT-048-LTLFireability-08
Could not compute solution for formula : CircularTrains-PT-048-LTLFireability-10
Could not compute solution for formula : CircularTrains-PT-048-LTLFireability-11
Could not compute solution for formula : CircularTrains-PT-048-LTLFireability-12
Could not compute solution for formula : CircularTrains-PT-048-LTLFireability-13

BK_STOP 1717204858246

--------------------
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-048-LTLFireability-01
ltl formula formula --ltl=/tmp/4130/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 89 places, 48 transitions and 178 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4130/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4130/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4130/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4130/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 90 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 90, there are 81 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): ~230 levels ~10000 states ~26144 transitions
pnml2lts-mc( 0/ 4): ~230 levels ~20000 states ~49740 transitions
pnml2lts-mc( 0/ 4): ~230 levels ~40000 states ~99480 transitions
pnml2lts-mc( 3/ 4): ~223 levels ~80000 states ~318952 transitions
pnml2lts-mc( 3/ 4): ~223 levels ~160000 states ~638940 transitions
pnml2lts-mc( 3/ 4): ~223 levels ~320000 states ~1371932 transitions
pnml2lts-mc( 0/ 4): ~230 levels ~640000 states ~3548444 transitions
pnml2lts-mc( 0/ 4): ~230 levels ~1280000 states ~7508484 transitions
pnml2lts-mc( 1/ 4): ~313 levels ~2560000 states ~14633516 transitions
pnml2lts-mc( 0/ 4): ~230 levels ~5120000 states ~31914628 transitions
pnml2lts-mc( 1/ 4): ~382 levels ~10240000 states ~70620812 transitions
pnml2lts-mc( 0/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 11507379
pnml2lts-mc( 0/ 4): unique states count: 11508188
pnml2lts-mc( 0/ 4): unique transitions count: 77235102
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 65722200
pnml2lts-mc( 0/ 4): - claim found count: 60
pnml2lts-mc( 0/ 4): - claim success count: 11508619
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1072
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 11508619 states 77239405 transitions, fanout: 6.711
pnml2lts-mc( 0/ 4): Total exploration time 31.060 sec (31.050 sec minimum, 31.052 sec on average)
pnml2lts-mc( 0/ 4): States per second: 370529, Transitions per second: 2486781
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 151.8MB, 13.8 B/state, compr.: 3.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 34.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 48 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 151.8MB (~256.0MB paged-in)
ltl formula name CircularTrains-PT-048-LTLFireability-02
ltl formula formula --ltl=/tmp/4130/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
pnml2lts-mc( 0/ 4): Petri net has 89 places, 48 transitions and 178 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4130/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4130/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4130/ltl_1_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4130/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 90 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 90, there are 65 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): ~187 levels ~10000 states ~25344 transitions
pnml2lts-mc( 2/ 4): ~187 levels ~20000 states ~73492 transitions
pnml2lts-mc( 2/ 4): ~187 levels ~40000 states ~162468 transitions
pnml2lts-mc( 2/ 4): ~187 levels ~80000 states ~352340 transitions
pnml2lts-mc( 2/ 4): ~187 levels ~160000 states ~665712 transitions
pnml2lts-mc( 2/ 4): ~187 levels ~320000 states ~1277772 transitions
pnml2lts-mc( 2/ 4): ~187 levels ~640000 states ~3109272 transitions
pnml2lts-mc( 1/ 4): ~181 levels ~1280000 states ~6101260 transitions
pnml2lts-mc( 1/ 4): ~181 levels ~2560000 states ~12748000 transitions
pnml2lts-mc( 1/ 4): ~181 levels ~5120000 states ~26527960 transitions
pnml2lts-mc( 2/ 4): ~187 levels ~10240000 states ~56100812 transitions
pnml2lts-mc( 2/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 9599034
pnml2lts-mc( 0/ 4): unique states count: 9599426
pnml2lts-mc( 0/ 4): unique transitions count: 52074548
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 42470986
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 9599494
pnml2lts-mc( 0/ 4): - cum. max stack depth: 735
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 9599494 states 52075319 transitions, fanout: 5.425
pnml2lts-mc( 0/ 4): Total exploration time 24.100 sec (24.070 sec minimum, 24.077 sec on average)
pnml2lts-mc( 0/ 4): States per second: 398319, Transitions per second: 2160802
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 137.3MB, 15.0 B/state, compr.: 4.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 28.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 48 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 137.3MB (~256.0MB paged-in)
ltl formula name CircularTrains-PT-048-LTLFireability-04
ltl formula formula --ltl=/tmp/4130/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 89 places, 48 transitions and 178 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4130/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4130/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4130/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4130/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 91 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 90, there are 71 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): ~187 levels ~10000 states ~22856 transitions
pnml2lts-mc( 1/ 4): ~187 levels ~20000 states ~46152 transitions
pnml2lts-mc( 3/ 4): ~183 levels ~40000 states ~92224 transitions
pnml2lts-mc( 3/ 4): ~183 levels ~80000 states ~199520 transitions
pnml2lts-mc( 3/ 4): ~183 levels ~160000 states ~412084 transitions
pnml2lts-mc( 3/ 4): ~183 levels ~320000 states ~836520 transitions
pnml2lts-mc( 1/ 4): ~187 levels ~640000 states ~1907028 transitions
pnml2lts-mc( 1/ 4): ~187 levels ~1280000 states ~3985652 transitions
pnml2lts-mc( 1/ 4): ~187 levels ~2560000 states ~8140360 transitions
pnml2lts-mc( 2/ 4): ~185 levels ~5120000 states ~23677552 transitions
pnml2lts-mc( 2/ 4): ~185 levels ~10240000 states ~50330464 transitions
pnml2lts-mc( 2/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 9989550
pnml2lts-mc( 0/ 4): unique states count: 9990018
pnml2lts-mc( 0/ 4): unique transitions count: 38077192
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 28084153
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 9990511
pnml2lts-mc( 0/ 4): - cum. max stack depth: 742
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 9990511 states 38079046 transitions, fanout: 3.812
pnml2lts-mc( 0/ 4): Total exploration time 21.210 sec (21.200 sec minimum, 21.205 sec on average)
pnml2lts-mc( 0/ 4): States per second: 471028, Transitions per second: 1795335
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 140.2MB, 14.7 B/state, compr.: 4.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 29.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 48 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 140.2MB (~256.0MB paged-in)
ltl formula name CircularTrains-PT-048-LTLFireability-05
ltl formula formula --ltl=/tmp/4130/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
pnml2lts-mc( 0/ 4): Petri net has 89 places, 48 transitions and 178 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4130/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4130/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4130/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 1 states
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4130/ltl_3_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 91 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 90, there are 49 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): ~186 levels ~10000 states ~20128 transitions
pnml2lts-mc( 3/ 4): ~186 levels ~20000 states ~43056 transitions
pnml2lts-mc( 3/ 4): ~186 levels ~40000 states ~86788 transitions
pnml2lts-mc( 3/ 4): ~186 levels ~80000 states ~188176 transitions
pnml2lts-mc( 3/ 4): ~186 levels ~160000 states ~400524 transitions
pnml2lts-mc( 3/ 4): ~186 levels ~320000 states ~819792 transitions
pnml2lts-mc( 3/ 4): ~186 levels ~640000 states ~1780444 transitions
pnml2lts-mc( 3/ 4): ~186 levels ~1280000 states ~3650076 transitions
pnml2lts-mc( 3/ 4): ~186 levels ~2560000 states ~7919628 transitions
pnml2lts-mc( 3/ 4): ~186 levels ~5120000 states ~16436860 transitions
pnml2lts-mc( 0/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 7345983
pnml2lts-mc( 0/ 4): unique states count: 7346400
pnml2lts-mc( 0/ 4): unique transitions count: 24391135
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 17043191
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 7346728
pnml2lts-mc( 0/ 4): - cum. max stack depth: 718
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 7346728 states 24392752 transitions, fanout: 3.320
pnml2lts-mc( 0/ 4): Total exploration time 14.760 sec (14.710 sec minimum, 14.743 sec on average)
pnml2lts-mc( 0/ 4): States per second: 497746, Transitions per second: 1652626
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 120.1MB, 17.1 B/state, compr.: 4.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 21.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 48 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 120.1MB (~256.0MB paged-in)
ltl formula name CircularTrains-PT-048-LTLFireability-08
ltl formula formula --ltl=/tmp/4130/ltl_4_
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): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 89 places, 48 transitions and 178 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4130/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4130/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4130/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4130/ltl_4_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 91 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 90, there are 52 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): ~187 levels ~10000 states ~22388 transitions
pnml2lts-mc( 1/ 4): ~187 levels ~20000 states ~45616 transitions
pnml2lts-mc( 1/ 4): ~187 levels ~40000 states ~91636 transitions
pnml2lts-mc( 2/ 4): ~181 levels ~80000 states ~192112 transitions
pnml2lts-mc( 2/ 4): ~181 levels ~160000 states ~393192 transitions
pnml2lts-mc( 2/ 4): ~181 levels ~320000 states ~801880 transitions
pnml2lts-mc( 2/ 4): ~181 levels ~640000 states ~1726432 transitions
pnml2lts-mc( 2/ 4): ~181 levels ~1280000 states ~3701388 transitions
pnml2lts-mc( 2/ 4): ~181 levels ~2560000 states ~7808572 transitions
pnml2lts-mc( 2/ 4): ~181 levels ~5120000 states ~16089364 transitions
pnml2lts-mc( 2/ 4): ~181 levels ~10240000 states ~34001848 transitions
pnml2lts-mc( 3/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 9602932
pnml2lts-mc( 0/ 4): unique states count: 9603361
pnml2lts-mc( 0/ 4): unique transitions count: 33832852
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 24226649
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 9603391
pnml2lts-mc( 0/ 4): - cum. max stack depth: 730
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 9603391 states 33833070 transitions, fanout: 3.523
pnml2lts-mc( 0/ 4): Total exploration time 19.260 sec (19.260 sec minimum, 19.260 sec on average)
pnml2lts-mc( 0/ 4): States per second: 498618, Transitions per second: 1756650
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 137.3MB, 15.0 B/state, compr.: 4.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 28.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 48 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 137.3MB (~256.0MB paged-in)
ltl formula name CircularTrains-PT-048-LTLFireability-10
ltl formula formula --ltl=/tmp/4130/ltl_5_
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): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 89 places, 48 transitions and 178 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4130/ltl_5_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4130/ltl_5_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4130/ltl_5_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4130/ltl_5_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 91 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 90, there are 61 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): ~373 levels ~10000 states ~30776 transitions
pnml2lts-mc( 2/ 4): ~373 levels ~20000 states ~57224 transitions
pnml2lts-mc( 3/ 4): ~505 levels ~40000 states ~121628 transitions
pnml2lts-mc( 2/ 4): ~736 levels ~80000 states ~246948 transitions
pnml2lts-mc( 3/ 4): ~1080 levels ~160000 states ~532044 transitions
pnml2lts-mc( 2/ 4): ~1604 levels ~320000 states ~1130800 transitions
pnml2lts-mc( 3/ 4): ~2463 levels ~640000 states ~2380968 transitions
pnml2lts-mc( 1/ 4): ~418 levels ~1280000 states ~3551628 transitions
pnml2lts-mc( 1/ 4): ~418 levels ~2560000 states ~7534208 transitions
pnml2lts-mc( 1/ 4): ~418 levels ~5120000 states ~15820140 transitions
pnml2lts-mc( 2/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 7244520
pnml2lts-mc( 0/ 4): unique states count: 7281183
pnml2lts-mc( 0/ 4): unique transitions count: 27262336
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 19781119
pnml2lts-mc( 0/ 4): - claim found count: 45610
pnml2lts-mc( 0/ 4): - claim success count: 7281191
pnml2lts-mc( 0/ 4): - cum. max stack depth: 36841
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 7281191 states 27262403 transitions, fanout: 3.744
pnml2lts-mc( 0/ 4): Total exploration time 15.480 sec (15.470 sec minimum, 15.473 sec on average)
pnml2lts-mc( 0/ 4): States per second: 470361, Transitions per second: 1761137
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 120.2MB, 17.1 B/state, compr.: 4.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 21.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 48 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 120.2MB (~256.0MB paged-in)
ltl formula name CircularTrains-PT-048-LTLFireability-11
ltl formula formula --ltl=/tmp/4130/ltl_6_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 89 places, 48 transitions and 178 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4130/ltl_6_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4130/ltl_6_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4130/ltl_6_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4130/ltl_6_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 90 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 90, there are 60 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): ~186 levels ~10000 states ~25052 transitions
pnml2lts-mc( 1/ 4): ~186 levels ~20000 states ~51848 transitions
pnml2lts-mc( 1/ 4): ~186 levels ~40000 states ~109504 transitions
pnml2lts-mc( 1/ 4): ~186 levels ~80000 states ~231704 transitions
pnml2lts-mc( 1/ 4): ~186 levels ~160000 states ~470624 transitions
pnml2lts-mc( 2/ 4): ~182 levels ~320000 states ~1205936 transitions
pnml2lts-mc( 2/ 4): ~182 levels ~640000 states ~2441852 transitions
pnml2lts-mc( 2/ 4): ~182 levels ~1280000 states ~5295072 transitions
pnml2lts-mc( 0/ 4): ~179 levels ~2560000 states ~12774588 transitions
pnml2lts-mc( 0/ 4): ~179 levels ~5120000 states ~26651580 transitions
pnml2lts-mc( 0/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 7473226
pnml2lts-mc( 0/ 4): unique states count: 7473637
pnml2lts-mc( 0/ 4): unique transitions count: 38694490
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 31239814
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 7483841
pnml2lts-mc( 0/ 4): - cum. max stack depth: 728
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 7483841 states 38739292 transitions, fanout: 5.176
pnml2lts-mc( 0/ 4): Total exploration time 18.440 sec (18.440 sec minimum, 18.440 sec on average)
pnml2lts-mc( 0/ 4): States per second: 405848, Transitions per second: 2100829
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 121.0MB, 17.0 B/state, compr.: 4.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 22.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 48 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 121.0MB (~256.0MB paged-in)
ltl formula name CircularTrains-PT-048-LTLFireability-12
ltl formula formula --ltl=/tmp/4130/ltl_7_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 89 places, 48 transitions and 178 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
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4130/ltl_7_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4130/ltl_7_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4130/ltl_7_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4130/ltl_7_
pnml2lts-mc( 0/ 4): There are 90 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 90, there are 74 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): ~145 levels ~10000 states ~25872 transitions
pnml2lts-mc( 1/ 4): ~145 levels ~20000 states ~52704 transitions
pnml2lts-mc( 1/ 4): ~145 levels ~40000 states ~110184 transitions
pnml2lts-mc( 1/ 4): ~145 levels ~80000 states ~225912 transitions
pnml2lts-mc( 1/ 4): ~145 levels ~160000 states ~464900 transitions
pnml2lts-mc( 1/ 4): ~145 levels ~320000 states ~977588 transitions
pnml2lts-mc( 1/ 4): ~145 levels ~640000 states ~2008656 transitions
pnml2lts-mc( 1/ 4): ~145 levels ~1280000 states ~4167836 transitions
pnml2lts-mc( 1/ 4): ~145 levels ~2560000 states ~8515556 transitions
pnml2lts-mc( 1/ 4): ~145 levels ~5120000 states ~17788832 transitions
pnml2lts-mc( 1/ 4): ~145 levels ~10240000 states ~37403468 transitions
pnml2lts-mc( 1/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 10775021
pnml2lts-mc( 0/ 4): unique states count: 10775292
pnml2lts-mc( 0/ 4): unique transitions count: 40318802
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 29540691
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 10775333
pnml2lts-mc( 0/ 4): - cum. max stack depth: 522
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 10775333 states 40319167 transitions, fanout: 3.742
pnml2lts-mc( 0/ 4): Total exploration time 23.230 sec (23.190 sec minimum, 23.208 sec on average)
pnml2lts-mc( 0/ 4): States per second: 463854, Transitions per second: 1735651
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 146.2MB, 14.2 B/state, compr.: 3.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 32.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 48 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 146.2MB (~256.0MB paged-in)
ltl formula name CircularTrains-PT-048-LTLFireability-13
ltl formula formula --ltl=/tmp/4130/ltl_8_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 89 places, 48 transitions and 178 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.010 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4130/ltl_8_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4130/ltl_8_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4130/ltl_8_
pnml2lts-mc( 0/ 4): buchi has 1 states
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4130/ltl_8_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 91 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 90, there are 50 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): ~187 levels ~10000 states ~23452 transitions
pnml2lts-mc( 1/ 4): ~187 levels ~20000 states ~46168 transitions
pnml2lts-mc( 1/ 4): ~187 levels ~40000 states ~96688 transitions
pnml2lts-mc( 1/ 4): ~187 levels ~80000 states ~203580 transitions
pnml2lts-mc( 1/ 4): ~187 levels ~160000 states ~422160 transitions
pnml2lts-mc( 1/ 4): ~187 levels ~320000 states ~879892 transitions
pnml2lts-mc( 1/ 4): ~187 levels ~640000 states ~1826236 transitions
pnml2lts-mc( 1/ 4): ~187 levels ~1280000 states ~3812228 transitions
pnml2lts-mc( 1/ 4): ~187 levels ~2560000 states ~7898160 transitions
pnml2lts-mc( 1/ 4): ~187 levels ~5120000 states ~16402776 transitions
pnml2lts-mc( 2/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 7664808
pnml2lts-mc( 0/ 4): unique states count: 7665268
pnml2lts-mc( 0/ 4): unique transitions count: 27214620
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 19545922
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 7665283
pnml2lts-mc( 0/ 4): - cum. max stack depth: 740
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 7665283 states 27214796 transitions, fanout: 3.550
pnml2lts-mc( 0/ 4): Total exploration time 15.530 sec (15.500 sec minimum, 15.515 sec on average)
pnml2lts-mc( 0/ 4): States per second: 493579, Transitions per second: 1752402
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 122.5MB, 16.8 B/state, compr.: 4.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 22.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 48 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 122.5MB (~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-048"
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-048, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r476-tall-171620505700340"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' 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 ;