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.r468-smll-171620167300243.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 AutonomousCar-PT-02b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r468-smll-171620167300243
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 448K
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 18:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Apr 12 18:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Apr 12 18:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 12 18:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:28 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 49K 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 AutonomousCar-PT-02b-LTLCardinality-00
FORMULA_NAME AutonomousCar-PT-02b-LTLCardinality-01
FORMULA_NAME AutonomousCar-PT-02b-LTLCardinality-02
FORMULA_NAME AutonomousCar-PT-02b-LTLCardinality-03
FORMULA_NAME AutonomousCar-PT-02b-LTLCardinality-04
FORMULA_NAME AutonomousCar-PT-02b-LTLCardinality-05
FORMULA_NAME AutonomousCar-PT-02b-LTLCardinality-06
FORMULA_NAME AutonomousCar-PT-02b-LTLCardinality-07
FORMULA_NAME AutonomousCar-PT-02b-LTLCardinality-08
FORMULA_NAME AutonomousCar-PT-02b-LTLCardinality-09
FORMULA_NAME AutonomousCar-PT-02b-LTLCardinality-10
FORMULA_NAME AutonomousCar-PT-02b-LTLCardinality-11
FORMULA_NAME AutonomousCar-PT-02b-LTLCardinality-12
FORMULA_NAME AutonomousCar-PT-02b-LTLCardinality-13
FORMULA_NAME AutonomousCar-PT-02b-LTLCardinality-14
FORMULA_NAME AutonomousCar-PT-02b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717210027191

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-02b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 02:47:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 02:47:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 02:47:10] [INFO ] Load time of PNML (sax parser for PT used): 261 ms
[2024-06-01 02:47:10] [INFO ] Transformed 155 places.
[2024-06-01 02:47:10] [INFO ] Transformed 194 transitions.
[2024-06-01 02:47:10] [INFO ] Found NUPN structural information;
[2024-06-01 02:47:10] [INFO ] Parsed PT model containing 155 places and 194 transitions and 620 arcs in 507 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 27 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA AutonomousCar-PT-02b-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-02b-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-02b-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-02b-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-02b-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-02b-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-02b-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-02b-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-02b-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-02b-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-02b-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 15 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 194/194 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 135 transition count 174
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 135 transition count 174
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 56 place count 135 transition count 158
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 58 place count 133 transition count 156
Iterating global reduction 1 with 2 rules applied. Total rules applied 60 place count 133 transition count 156
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 61 place count 132 transition count 155
Iterating global reduction 1 with 1 rules applied. Total rules applied 62 place count 132 transition count 155
Applied a total of 62 rules in 120 ms. Remains 132 /155 variables (removed 23) and now considering 155/194 (removed 39) transitions.
// Phase 1: matrix 155 rows 132 cols
[2024-06-01 02:47:10] [INFO ] Computed 7 invariants in 35 ms
[2024-06-01 02:47:11] [INFO ] Implicit Places using invariants in 427 ms returned []
[2024-06-01 02:47:11] [INFO ] Invariant cache hit.
[2024-06-01 02:47:11] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 791 ms to find 0 implicit places.
Running 154 sub problems to find dead transitions.
[2024-06-01 02:47:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 154 unsolved
[2024-06-01 02:47:14] [INFO ] Deduced a trap composed of 34 places in 191 ms of which 39 ms to minimize.
[2024-06-01 02:47:14] [INFO ] Deduced a trap composed of 18 places in 175 ms of which 3 ms to minimize.
[2024-06-01 02:47:14] [INFO ] Deduced a trap composed of 17 places in 134 ms of which 3 ms to minimize.
[2024-06-01 02:47:14] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 2 ms to minimize.
[2024-06-01 02:47:14] [INFO ] Deduced a trap composed of 14 places in 117 ms of which 3 ms to minimize.
[2024-06-01 02:47:14] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-06-01 02:47:15] [INFO ] Deduced a trap composed of 31 places in 102 ms of which 2 ms to minimize.
[2024-06-01 02:47:15] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 3 ms to minimize.
[2024-06-01 02:47:15] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 2 ms to minimize.
[2024-06-01 02:47:15] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 2 ms to minimize.
[2024-06-01 02:47:15] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 3 ms to minimize.
[2024-06-01 02:47:15] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 3 ms to minimize.
[2024-06-01 02:47:15] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 2 ms to minimize.
[2024-06-01 02:47:15] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 2 ms to minimize.
[2024-06-01 02:47:15] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 2 ms to minimize.
[2024-06-01 02:47:15] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 2 ms to minimize.
[2024-06-01 02:47:16] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 2 ms to minimize.
[2024-06-01 02:47:16] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 2 ms to minimize.
[2024-06-01 02:47:16] [INFO ] Deduced a trap composed of 29 places in 81 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 154 unsolved
[2024-06-01 02:47:17] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 2 ms to minimize.
[2024-06-01 02:47:17] [INFO ] Deduced a trap composed of 34 places in 75 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 154 unsolved
[2024-06-01 02:47:18] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 2 ms to minimize.
[2024-06-01 02:47:18] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 2 ms to minimize.
[2024-06-01 02:47:18] [INFO ] Deduced a trap composed of 53 places in 57 ms of which 2 ms to minimize.
[2024-06-01 02:47:19] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 154 unsolved
[2024-06-01 02:47:19] [INFO ] Deduced a trap composed of 39 places in 89 ms of which 2 ms to minimize.
[2024-06-01 02:47:19] [INFO ] Deduced a trap composed of 40 places in 96 ms of which 3 ms to minimize.
[2024-06-01 02:47:20] [INFO ] Deduced a trap composed of 39 places in 65 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 154 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD145 is UNSAT
At refinement iteration 7 (OVERLAPS) 155/287 variables, 132/167 constraints. Problems are: Problem set: 2 solved, 152 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/287 variables, 0/167 constraints. Problems are: Problem set: 2 solved, 152 unsolved
At refinement iteration 9 (OVERLAPS) 0/287 variables, 0/167 constraints. Problems are: Problem set: 2 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 287/287 variables, and 167 constraints, problems are : Problem set: 2 solved, 152 unsolved in 13485 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 154/154 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 2 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 152 unsolved
At refinement iteration 1 (OVERLAPS) 2/132 variables, 7/7 constraints. Problems are: Problem set: 2 solved, 152 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 28/35 constraints. Problems are: Problem set: 2 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/35 constraints. Problems are: Problem set: 2 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 155/287 variables, 132/167 constraints. Problems are: Problem set: 2 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/287 variables, 152/319 constraints. Problems are: Problem set: 2 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 0/319 constraints. Problems are: Problem set: 2 solved, 152 unsolved
At refinement iteration 7 (OVERLAPS) 0/287 variables, 0/319 constraints. Problems are: Problem set: 2 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Int declared 287/287 variables, and 319 constraints, problems are : Problem set: 2 solved, 152 unsolved in 8372 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 152/154 constraints, Known Traps: 28/28 constraints]
After SMT, in 22062ms problems are : Problem set: 2 solved, 152 unsolved
Search for dead transitions found 2 dead transitions in 22100ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in LTL mode, iteration 1 : 132/155 places, 153/194 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 131 transition count 153
Applied a total of 1 rules in 22 ms. Remains 131 /132 variables (removed 1) and now considering 153/153 (removed 0) transitions.
// Phase 1: matrix 153 rows 131 cols
[2024-06-01 02:47:33] [INFO ] Computed 7 invariants in 5 ms
[2024-06-01 02:47:33] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-06-01 02:47:33] [INFO ] Invariant cache hit.
[2024-06-01 02:47:33] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 131/155 places, 153/194 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 23385 ms. Remains : 131/155 places, 153/194 transitions.
Support contains 15 out of 131 places after structural reductions.
[2024-06-01 02:47:34] [INFO ] Flatten gal took : 57 ms
[2024-06-01 02:47:34] [INFO ] Flatten gal took : 20 ms
[2024-06-01 02:47:34] [INFO ] Input system was already deterministic with 153 transitions.
Reduction of identical properties reduced properties to check from 10 to 9
RANDOM walk for 10632 steps (8 resets) in 218 ms. (48 steps per ms) remains 0/9 properties
Computed a total of 32 stabilizing places and 32 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U !p1))))'
Support contains 4 out of 131 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 131/131 places, 153/153 transitions.
Graph (trivial) has 118 edges and 131 vertex of which 4 / 131 are part of one of the 2 SCC in 5 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 128 transition count 99
Reduce places removed 51 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 67 rules applied. Total rules applied 119 place count 77 transition count 83
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 10 rules applied. Total rules applied 129 place count 68 transition count 82
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 130 place count 67 transition count 82
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 130 place count 67 transition count 76
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 142 place count 61 transition count 76
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 146 place count 57 transition count 72
Iterating global reduction 4 with 4 rules applied. Total rules applied 150 place count 57 transition count 72
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 150 place count 57 transition count 71
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 152 place count 56 transition count 71
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 153 place count 55 transition count 69
Iterating global reduction 4 with 1 rules applied. Total rules applied 154 place count 55 transition count 69
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 4 with 2 rules applied. Total rules applied 156 place count 55 transition count 67
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 157 place count 54 transition count 67
Performed 20 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 6 with 40 rules applied. Total rules applied 197 place count 34 transition count 46
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 200 place count 31 transition count 39
Iterating global reduction 6 with 3 rules applied. Total rules applied 203 place count 31 transition count 39
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 6 with 2 rules applied. Total rules applied 205 place count 30 transition count 38
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 209 place count 28 transition count 50
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 211 place count 26 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 212 place count 25 transition count 48
Applied a total of 212 rules in 110 ms. Remains 25 /131 variables (removed 106) and now considering 48/153 (removed 105) transitions.
// Phase 1: matrix 48 rows 25 cols
[2024-06-01 02:47:34] [INFO ] Computed 5 invariants in 3 ms
[2024-06-01 02:47:34] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-06-01 02:47:34] [INFO ] Invariant cache hit.
[2024-06-01 02:47:34] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 02:47:34] [INFO ] Implicit Places using invariants and state equation in 59 ms returned [21, 24]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 116 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/131 places, 48/153 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 46
Applied a total of 4 rules in 4 ms. Remains 21 /23 variables (removed 2) and now considering 46/48 (removed 2) transitions.
// Phase 1: matrix 46 rows 21 cols
[2024-06-01 02:47:34] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 02:47:34] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-06-01 02:47:34] [INFO ] Invariant cache hit.
[2024-06-01 02:47:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 02:47:35] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 21/131 places, 46/153 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 320 ms. Remains : 21/131 places, 46/153 transitions.
Stuttering acceptance computed with spot in 434 ms :[p1, p1]
Running random walk in product with property : AutonomousCar-PT-02b-LTLCardinality-02
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 3 ms.
FORMULA AutonomousCar-PT-02b-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-02b-LTLCardinality-02 finished in 871 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(p2)&&p1)))))'
Support contains 4 out of 131 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 131/131 places, 153/153 transitions.
Graph (trivial) has 115 edges and 131 vertex of which 4 / 131 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 128 transition count 102
Reduce places removed 48 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 1 with 65 rules applied. Total rules applied 114 place count 80 transition count 85
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 11 rules applied. Total rules applied 125 place count 70 transition count 84
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 126 place count 69 transition count 84
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 126 place count 69 transition count 77
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 140 place count 62 transition count 77
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 143 place count 59 transition count 74
Iterating global reduction 4 with 3 rules applied. Total rules applied 146 place count 59 transition count 74
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 146 place count 59 transition count 73
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 148 place count 58 transition count 73
Performed 20 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 188 place count 38 transition count 52
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 192 place count 34 transition count 43
Iterating global reduction 4 with 4 rules applied. Total rules applied 196 place count 34 transition count 43
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 197 place count 34 transition count 42
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 5 with 2 rules applied. Total rules applied 199 place count 33 transition count 41
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 203 place count 31 transition count 50
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 205 place count 29 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 206 place count 28 transition count 48
Applied a total of 206 rules in 46 ms. Remains 28 /131 variables (removed 103) and now considering 48/153 (removed 105) transitions.
// Phase 1: matrix 48 rows 28 cols
[2024-06-01 02:47:35] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 02:47:35] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-06-01 02:47:35] [INFO ] Invariant cache hit.
[2024-06-01 02:47:35] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-06-01 02:47:35] [INFO ] Implicit Places using invariants and state equation in 104 ms returned [24, 27]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 169 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 26/131 places, 48/153 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 26 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 25 transition count 47
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 4 place count 24 transition count 46
Applied a total of 4 rules in 7 ms. Remains 24 /26 variables (removed 2) and now considering 46/48 (removed 2) transitions.
// Phase 1: matrix 46 rows 24 cols
[2024-06-01 02:47:35] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 02:47:35] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-06-01 02:47:35] [INFO ] Invariant cache hit.
[2024-06-01 02:47:35] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 02:47:35] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 24/131 places, 46/153 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 345 ms. Remains : 24/131 places, 46/153 transitions.
Stuttering acceptance computed with spot in 181 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-02b-LTLCardinality-04
Stuttering criterion allowed to conclude after 18 steps with 5 reset in 1 ms.
FORMULA AutonomousCar-PT-02b-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-02b-LTLCardinality-04 finished in 552 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(X(X(F(p1))))))'
Support contains 4 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 153/153 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 127 transition count 149
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 127 transition count 149
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 126 transition count 148
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 126 transition count 148
Applied a total of 10 rules in 13 ms. Remains 126 /131 variables (removed 5) and now considering 148/153 (removed 5) transitions.
// Phase 1: matrix 148 rows 126 cols
[2024-06-01 02:47:36] [INFO ] Computed 7 invariants in 4 ms
[2024-06-01 02:47:36] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-06-01 02:47:36] [INFO ] Invariant cache hit.
[2024-06-01 02:47:36] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
Running 147 sub problems to find dead transitions.
[2024-06-01 02:47:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 147 unsolved
[2024-06-01 02:47:37] [INFO ] Deduced a trap composed of 14 places in 178 ms of which 3 ms to minimize.
[2024-06-01 02:47:38] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 2 ms to minimize.
[2024-06-01 02:47:38] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 2 ms to minimize.
[2024-06-01 02:47:38] [INFO ] Deduced a trap composed of 32 places in 101 ms of which 3 ms to minimize.
[2024-06-01 02:47:38] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 2 ms to minimize.
[2024-06-01 02:47:38] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 3 ms to minimize.
[2024-06-01 02:47:38] [INFO ] Deduced a trap composed of 40 places in 104 ms of which 3 ms to minimize.
[2024-06-01 02:47:38] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 3 ms to minimize.
[2024-06-01 02:47:38] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 2 ms to minimize.
[2024-06-01 02:47:39] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 2 ms to minimize.
[2024-06-01 02:47:39] [INFO ] Deduced a trap composed of 38 places in 99 ms of which 4 ms to minimize.
[2024-06-01 02:47:39] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 1 ms to minimize.
[2024-06-01 02:47:39] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 1 ms to minimize.
[2024-06-01 02:47:39] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 2 ms to minimize.
[2024-06-01 02:47:39] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 2 ms to minimize.
[2024-06-01 02:47:39] [INFO ] Deduced a trap composed of 27 places in 94 ms of which 3 ms to minimize.
[2024-06-01 02:47:39] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 2 ms to minimize.
[2024-06-01 02:47:39] [INFO ] Deduced a trap composed of 38 places in 61 ms of which 2 ms to minimize.
[2024-06-01 02:47:39] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 3 ms to minimize.
[2024-06-01 02:47:40] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 147 unsolved
[2024-06-01 02:47:40] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 1 ms to minimize.
[2024-06-01 02:47:40] [INFO ] Deduced a trap composed of 29 places in 86 ms of which 2 ms to minimize.
[2024-06-01 02:47:40] [INFO ] Deduced a trap composed of 42 places in 93 ms of which 3 ms to minimize.
[2024-06-01 02:47:41] [INFO ] Deduced a trap composed of 42 places in 69 ms of which 2 ms to minimize.
[2024-06-01 02:47:41] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 2 ms to minimize.
[2024-06-01 02:47:41] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 6/33 constraints. Problems are: Problem set: 0 solved, 147 unsolved
[2024-06-01 02:47:42] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 147 unsolved
[2024-06-01 02:47:43] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 2 ms to minimize.
[2024-06-01 02:47:44] [INFO ] Deduced a trap composed of 32 places in 98 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 147 unsolved
[2024-06-01 02:47:44] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 2 ms to minimize.
[2024-06-01 02:47:45] [INFO ] Deduced a trap composed of 30 places in 96 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 8 (OVERLAPS) 148/274 variables, 126/164 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/274 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 10 (OVERLAPS) 0/274 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Real declared 274/274 variables, and 164 constraints, problems are : Problem set: 0 solved, 147 unsolved in 14040 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 147 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 31/38 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (OVERLAPS) 148/274 variables, 126/164 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 147/311 constraints. Problems are: Problem set: 0 solved, 147 unsolved
[2024-06-01 02:47:53] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 1/312 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 8 (OVERLAPS) 0/274 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Int declared 274/274 variables, and 312 constraints, problems are : Problem set: 0 solved, 147 unsolved in 10522 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 32/32 constraints]
After SMT, in 24624ms problems are : Problem set: 0 solved, 147 unsolved
Search for dead transitions found 0 dead transitions in 24629ms
Starting structural reductions in LTL mode, iteration 1 : 126/131 places, 148/153 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24937 ms. Remains : 126/131 places, 148/153 transitions.
Stuttering acceptance computed with spot in 311 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-02b-LTLCardinality-05
Product exploration explored 100000 steps with 25000 reset in 520 ms.
Product exploration explored 100000 steps with 25000 reset in 194 ms.
Computed a total of 29 stabilizing places and 29 stable transitions
Computed a total of 29 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 4152 steps (10 resets) in 30 ms. (133 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 141 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 164 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 126 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 148/148 transitions.
Applied a total of 0 rules in 3 ms. Remains 126 /126 variables (removed 0) and now considering 148/148 (removed 0) transitions.
[2024-06-01 02:48:02] [INFO ] Invariant cache hit.
[2024-06-01 02:48:02] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-01 02:48:02] [INFO ] Invariant cache hit.
[2024-06-01 02:48:03] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
Running 147 sub problems to find dead transitions.
[2024-06-01 02:48:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 147 unsolved
[2024-06-01 02:48:04] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 2 ms to minimize.
[2024-06-01 02:48:04] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 2 ms to minimize.
[2024-06-01 02:48:04] [INFO ] Deduced a trap composed of 17 places in 100 ms of which 3 ms to minimize.
[2024-06-01 02:48:04] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 2 ms to minimize.
[2024-06-01 02:48:04] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 1 ms to minimize.
[2024-06-01 02:48:04] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 2 ms to minimize.
[2024-06-01 02:48:05] [INFO ] Deduced a trap composed of 40 places in 94 ms of which 2 ms to minimize.
[2024-06-01 02:48:05] [INFO ] Deduced a trap composed of 17 places in 112 ms of which 3 ms to minimize.
[2024-06-01 02:48:05] [INFO ] Deduced a trap composed of 22 places in 94 ms of which 2 ms to minimize.
[2024-06-01 02:48:05] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 3 ms to minimize.
[2024-06-01 02:48:05] [INFO ] Deduced a trap composed of 38 places in 92 ms of which 3 ms to minimize.
[2024-06-01 02:48:05] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 2 ms to minimize.
[2024-06-01 02:48:05] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 2 ms to minimize.
[2024-06-01 02:48:05] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 2 ms to minimize.
[2024-06-01 02:48:06] [INFO ] Deduced a trap composed of 21 places in 100 ms of which 2 ms to minimize.
[2024-06-01 02:48:06] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 2 ms to minimize.
[2024-06-01 02:48:06] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 1 ms to minimize.
[2024-06-01 02:48:06] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 2 ms to minimize.
[2024-06-01 02:48:06] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 3 ms to minimize.
[2024-06-01 02:48:06] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 147 unsolved
[2024-06-01 02:48:06] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 1 ms to minimize.
[2024-06-01 02:48:07] [INFO ] Deduced a trap composed of 29 places in 81 ms of which 2 ms to minimize.
[2024-06-01 02:48:07] [INFO ] Deduced a trap composed of 42 places in 85 ms of which 3 ms to minimize.
[2024-06-01 02:48:07] [INFO ] Deduced a trap composed of 42 places in 92 ms of which 2 ms to minimize.
[2024-06-01 02:48:07] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 2 ms to minimize.
[2024-06-01 02:48:08] [INFO ] Deduced a trap composed of 5 places in 98 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 6/33 constraints. Problems are: Problem set: 0 solved, 147 unsolved
[2024-06-01 02:48:09] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 147 unsolved
[2024-06-01 02:48:10] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 3 ms to minimize.
[2024-06-01 02:48:10] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 147 unsolved
[2024-06-01 02:48:11] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 2 ms to minimize.
[2024-06-01 02:48:11] [INFO ] Deduced a trap composed of 30 places in 92 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 8 (OVERLAPS) 148/274 variables, 126/164 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/274 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 10 (OVERLAPS) 0/274 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Real declared 274/274 variables, and 164 constraints, problems are : Problem set: 0 solved, 147 unsolved in 14025 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 147 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 31/38 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (OVERLAPS) 148/274 variables, 126/164 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 147/311 constraints. Problems are: Problem set: 0 solved, 147 unsolved
[2024-06-01 02:48:19] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 1/312 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 8 (OVERLAPS) 0/274 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Int declared 274/274 variables, and 312 constraints, problems are : Problem set: 0 solved, 147 unsolved in 10827 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 32/32 constraints]
After SMT, in 24905ms problems are : Problem set: 0 solved, 147 unsolved
Search for dead transitions found 0 dead transitions in 24911ms
Finished structural reductions in LTL mode , in 1 iterations and 25186 ms. Remains : 126/126 places, 148/148 transitions.
Computed a total of 29 stabilizing places and 29 stable transitions
Computed a total of 29 stabilizing places and 29 stable transitions
Knowledge obtained : [p1]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 73 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 20871 steps (18 resets) in 46 ms. (444 steps per ms) remains 0/1 properties
Knowledge obtained : [p1]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 1 factoid took 89 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 191 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 192 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 25000 reset in 121 ms.
Product exploration explored 100000 steps with 25000 reset in 140 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 142 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 126 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 126/126 places, 148/148 transitions.
Graph (trivial) has 113 edges and 126 vertex of which 4 / 126 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 124 transition count 146
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 54 place count 124 transition count 139
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 54 place count 124 transition count 139
Deduced a syphon composed of 57 places in 0 ms
Iterating global reduction 2 with 11 rules applied. Total rules applied 65 place count 124 transition count 139
Discarding 39 places :
Symmetric choice reduction at 2 with 39 rule applications. Total rules 104 place count 85 transition count 100
Deduced a syphon composed of 21 places in 0 ms
Iterating global reduction 2 with 39 rules applied. Total rules applied 143 place count 85 transition count 100
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 50 places in 0 ms
Iterating global reduction 2 with 29 rules applied. Total rules applied 172 place count 85 transition count 103
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 174 place count 85 transition count 101
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 200 place count 59 transition count 69
Deduced a syphon composed of 29 places in 0 ms
Iterating global reduction 3 with 26 rules applied. Total rules applied 226 place count 59 transition count 69
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 230 place count 59 transition count 65
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 232 place count 57 transition count 63
Deduced a syphon composed of 27 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 234 place count 57 transition count 63
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 235 place count 57 transition count 63
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 237 place count 55 transition count 61
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 239 place count 55 transition count 61
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 30 places in 0 ms
Iterating global reduction 4 with 4 rules applied. Total rules applied 243 place count 55 transition count 79
Deduced a syphon composed of 30 places in 0 ms
Applied a total of 243 rules in 45 ms. Remains 55 /126 variables (removed 71) and now considering 79/148 (removed 69) transitions.
[2024-06-01 02:48:29] [INFO ] Redundant transitions in 1 ms returned []
Running 78 sub problems to find dead transitions.
// Phase 1: matrix 79 rows 55 cols
[2024-06-01 02:48:29] [INFO ] Computed 6 invariants in 1 ms
[2024-06-01 02:48:29] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-06-01 02:48:30] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-06-01 02:48:30] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 2 ms to minimize.
[2024-06-01 02:48:30] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2024-06-01 02:48:30] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 2 ms to minimize.
[2024-06-01 02:48:30] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 1 ms to minimize.
[2024-06-01 02:48:30] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 1 ms to minimize.
Problem TDEAD10 is UNSAT
[2024-06-01 02:48:30] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 1 ms to minimize.
Problem TDEAD12 is UNSAT
[2024-06-01 02:48:30] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
Problem TDEAD14 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
[2024-06-01 02:48:30] [INFO ] Deduced a trap composed of 2 places in 55 ms of which 2 ms to minimize.
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 9/15 constraints. Problems are: Problem set: 28 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/15 constraints. Problems are: Problem set: 28 solved, 50 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
At refinement iteration 4 (OVERLAPS) 78/133 variables, 55/70 constraints. Problems are: Problem set: 41 solved, 37 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 21/91 constraints. Problems are: Problem set: 41 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 0/91 constraints. Problems are: Problem set: 41 solved, 37 unsolved
At refinement iteration 7 (OVERLAPS) 1/134 variables, 1/92 constraints. Problems are: Problem set: 41 solved, 37 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/134 variables, 0/92 constraints. Problems are: Problem set: 41 solved, 37 unsolved
At refinement iteration 9 (OVERLAPS) 0/134 variables, 0/92 constraints. Problems are: Problem set: 41 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 92 constraints, problems are : Problem set: 41 solved, 37 unsolved in 2320 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 55/55 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 41 solved, 37 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 41 solved, 37 unsolved
At refinement iteration 1 (OVERLAPS) 31/55 variables, 6/6 constraints. Problems are: Problem set: 41 solved, 37 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 9/15 constraints. Problems are: Problem set: 41 solved, 37 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/15 constraints. Problems are: Problem set: 41 solved, 37 unsolved
At refinement iteration 4 (OVERLAPS) 78/133 variables, 55/70 constraints. Problems are: Problem set: 41 solved, 37 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 21/91 constraints. Problems are: Problem set: 41 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 37/128 constraints. Problems are: Problem set: 41 solved, 37 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 0/128 constraints. Problems are: Problem set: 41 solved, 37 unsolved
At refinement iteration 8 (OVERLAPS) 1/134 variables, 1/129 constraints. Problems are: Problem set: 41 solved, 37 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/134 variables, 0/129 constraints. Problems are: Problem set: 41 solved, 37 unsolved
At refinement iteration 10 (OVERLAPS) 0/134 variables, 0/129 constraints. Problems are: Problem set: 41 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 129 constraints, problems are : Problem set: 41 solved, 37 unsolved in 1282 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 55/55 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 37/78 constraints, Known Traps: 9/9 constraints]
After SMT, in 3661ms problems are : Problem set: 41 solved, 37 unsolved
Search for dead transitions found 41 dead transitions in 3663ms
Found 41 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 41 transitions
Dead transitions reduction (with SMT) removed 41 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 55/126 places, 38/148 transitions.
Graph (complete) has 123 edges and 55 vertex of which 25 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.2 ms
Discarding 30 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 11 ms. Remains 25 /55 variables (removed 30) and now considering 38/38 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 25/126 places, 38/148 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3727 ms. Remains : 25/126 places, 38/148 transitions.
Support contains 2 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 148/148 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 124 transition count 146
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 124 transition count 146
Applied a total of 4 rules in 2 ms. Remains 124 /126 variables (removed 2) and now considering 146/148 (removed 2) transitions.
// Phase 1: matrix 146 rows 124 cols
[2024-06-01 02:48:33] [INFO ] Computed 7 invariants in 1 ms
[2024-06-01 02:48:33] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-01 02:48:33] [INFO ] Invariant cache hit.
[2024-06-01 02:48:33] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
Running 145 sub problems to find dead transitions.
[2024-06-01 02:48:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-06-01 02:48:34] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 3 ms to minimize.
[2024-06-01 02:48:35] [INFO ] Deduced a trap composed of 19 places in 106 ms of which 3 ms to minimize.
[2024-06-01 02:48:35] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 2 ms to minimize.
[2024-06-01 02:48:35] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 3 ms to minimize.
[2024-06-01 02:48:35] [INFO ] Deduced a trap composed of 44 places in 103 ms of which 2 ms to minimize.
[2024-06-01 02:48:35] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 2 ms to minimize.
[2024-06-01 02:48:35] [INFO ] Deduced a trap composed of 29 places in 99 ms of which 3 ms to minimize.
[2024-06-01 02:48:35] [INFO ] Deduced a trap composed of 36 places in 81 ms of which 2 ms to minimize.
[2024-06-01 02:48:35] [INFO ] Deduced a trap composed of 20 places in 101 ms of which 2 ms to minimize.
[2024-06-01 02:48:36] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 2 ms to minimize.
[2024-06-01 02:48:36] [INFO ] Deduced a trap composed of 44 places in 79 ms of which 2 ms to minimize.
[2024-06-01 02:48:36] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 2 ms to minimize.
[2024-06-01 02:48:36] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 3 ms to minimize.
[2024-06-01 02:48:36] [INFO ] Deduced a trap composed of 30 places in 87 ms of which 2 ms to minimize.
[2024-06-01 02:48:36] [INFO ] Deduced a trap composed of 39 places in 83 ms of which 2 ms to minimize.
[2024-06-01 02:48:36] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 2 ms to minimize.
[2024-06-01 02:48:37] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
[2024-06-01 02:48:37] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-06-01 02:48:38] [INFO ] Deduced a trap composed of 29 places in 95 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-06-01 02:48:39] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (OVERLAPS) 146/270 variables, 124/151 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-06-01 02:48:42] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 9 (OVERLAPS) 0/270 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Real declared 270/270 variables, and 152 constraints, problems are : Problem set: 0 solved, 145 unsolved in 12938 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 145 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 21/28 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (OVERLAPS) 146/270 variables, 124/152 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 145/297 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-06-01 02:48:48] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 2 ms to minimize.
[2024-06-01 02:48:49] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 2/299 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-06-01 02:48:51] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 9 (OVERLAPS) 0/270 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Int declared 270/270 variables, and 300 constraints, problems are : Problem set: 0 solved, 145 unsolved in 11503 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 24/24 constraints]
After SMT, in 24468ms problems are : Problem set: 0 solved, 145 unsolved
Search for dead transitions found 0 dead transitions in 24470ms
Starting structural reductions in LTL mode, iteration 1 : 124/126 places, 146/148 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24646 ms. Remains : 124/126 places, 146/148 transitions.
Treatment of property AutonomousCar-PT-02b-LTLCardinality-05 finished in 82020 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)))'
Support contains 2 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 153/153 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 126 transition count 148
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 126 transition count 148
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 124 transition count 146
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 124 transition count 146
Applied a total of 14 rules in 3 ms. Remains 124 /131 variables (removed 7) and now considering 146/153 (removed 7) transitions.
[2024-06-01 02:48:58] [INFO ] Invariant cache hit.
[2024-06-01 02:48:58] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-06-01 02:48:58] [INFO ] Invariant cache hit.
[2024-06-01 02:48:58] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
Running 145 sub problems to find dead transitions.
[2024-06-01 02:48:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-06-01 02:48:59] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 3 ms to minimize.
[2024-06-01 02:48:59] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 2 ms to minimize.
[2024-06-01 02:49:00] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 2 ms to minimize.
[2024-06-01 02:49:00] [INFO ] Deduced a trap composed of 27 places in 94 ms of which 3 ms to minimize.
[2024-06-01 02:49:00] [INFO ] Deduced a trap composed of 44 places in 90 ms of which 3 ms to minimize.
[2024-06-01 02:49:00] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 2 ms to minimize.
[2024-06-01 02:49:00] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 2 ms to minimize.
[2024-06-01 02:49:00] [INFO ] Deduced a trap composed of 36 places in 85 ms of which 2 ms to minimize.
[2024-06-01 02:49:00] [INFO ] Deduced a trap composed of 20 places in 103 ms of which 3 ms to minimize.
[2024-06-01 02:49:00] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 2 ms to minimize.
[2024-06-01 02:49:01] [INFO ] Deduced a trap composed of 44 places in 84 ms of which 2 ms to minimize.
[2024-06-01 02:49:01] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 2 ms to minimize.
[2024-06-01 02:49:01] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 3 ms to minimize.
[2024-06-01 02:49:01] [INFO ] Deduced a trap composed of 30 places in 101 ms of which 2 ms to minimize.
[2024-06-01 02:49:01] [INFO ] Deduced a trap composed of 39 places in 86 ms of which 2 ms to minimize.
[2024-06-01 02:49:01] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 2 ms to minimize.
[2024-06-01 02:49:01] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 2 ms to minimize.
[2024-06-01 02:49:02] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-06-01 02:49:02] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-06-01 02:49:04] [INFO ] Deduced a trap composed of 32 places in 87 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (OVERLAPS) 146/270 variables, 124/151 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-06-01 02:49:07] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 9 (OVERLAPS) 0/270 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Real declared 270/270 variables, and 152 constraints, problems are : Problem set: 0 solved, 145 unsolved in 12908 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 145 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 21/28 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (OVERLAPS) 146/270 variables, 124/152 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 145/297 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-06-01 02:49:13] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
[2024-06-01 02:49:14] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 2/299 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-06-01 02:49:17] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 9 (OVERLAPS) 0/270 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Int declared 270/270 variables, and 300 constraints, problems are : Problem set: 0 solved, 145 unsolved in 12143 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 24/24 constraints]
After SMT, in 25088ms problems are : Problem set: 0 solved, 145 unsolved
Search for dead transitions found 0 dead transitions in 25091ms
Starting structural reductions in LTL mode, iteration 1 : 124/131 places, 146/153 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25280 ms. Remains : 124/131 places, 146/153 transitions.
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-02b-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 58 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-02b-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-02b-LTLCardinality-07 finished in 25378 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)))'
Support contains 2 out of 131 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 131/131 places, 153/153 transitions.
Graph (trivial) has 120 edges and 131 vertex of which 4 / 131 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 128 transition count 98
Reduce places removed 52 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 68 rules applied. Total rules applied 121 place count 76 transition count 82
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 130 place count 67 transition count 82
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 130 place count 67 transition count 74
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 146 place count 59 transition count 74
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 151 place count 54 transition count 69
Iterating global reduction 3 with 5 rules applied. Total rules applied 156 place count 54 transition count 69
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 156 place count 54 transition count 68
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 158 place count 53 transition count 68
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 159 place count 52 transition count 66
Iterating global reduction 3 with 1 rules applied. Total rules applied 160 place count 52 transition count 66
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 3 with 2 rules applied. Total rules applied 162 place count 52 transition count 64
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 163 place count 51 transition count 64
Performed 19 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 5 with 38 rules applied. Total rules applied 201 place count 32 transition count 44
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 205 place count 28 transition count 35
Iterating global reduction 5 with 4 rules applied. Total rules applied 209 place count 28 transition count 35
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 210 place count 28 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 6 with 2 rules applied. Total rules applied 212 place count 27 transition count 33
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 216 place count 25 transition count 42
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 217 place count 24 transition count 41
Applied a total of 217 rules in 19 ms. Remains 24 /131 variables (removed 107) and now considering 41/153 (removed 112) transitions.
// Phase 1: matrix 41 rows 24 cols
[2024-06-01 02:49:23] [INFO ] Computed 6 invariants in 1 ms
[2024-06-01 02:49:23] [INFO ] Implicit Places using invariants in 40 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 41 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/131 places, 41/153 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 22 transition count 40
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 22 transition count 40
Applied a total of 2 rules in 3 ms. Remains 22 /23 variables (removed 1) and now considering 40/41 (removed 1) transitions.
// Phase 1: matrix 40 rows 22 cols
[2024-06-01 02:49:23] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 02:49:23] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-06-01 02:49:23] [INFO ] Invariant cache hit.
[2024-06-01 02:49:23] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 02:49:23] [INFO ] Implicit Places using invariants and state equation in 49 ms returned [18, 21]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 83 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 20/131 places, 40/153 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 18 transition count 38
Applied a total of 4 rules in 3 ms. Remains 18 /20 variables (removed 2) and now considering 38/40 (removed 2) transitions.
// Phase 1: matrix 38 rows 18 cols
[2024-06-01 02:49:23] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 02:49:23] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-06-01 02:49:23] [INFO ] Invariant cache hit.
[2024-06-01 02:49:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 02:49:23] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 18/131 places, 38/153 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 221 ms. Remains : 18/131 places, 38/153 transitions.
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-02b-LTLCardinality-10
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-02b-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-02b-LTLCardinality-10 finished in 338 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(X(X(F(p1))))))'
Found a Shortening insensitive property : AutonomousCar-PT-02b-LTLCardinality-05
Stuttering acceptance computed with spot in 341 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 131 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 131/131 places, 153/153 transitions.
Graph (trivial) has 115 edges and 131 vertex of which 4 / 131 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 128 transition count 102
Reduce places removed 48 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 64 rules applied. Total rules applied 113 place count 80 transition count 86
Reduce places removed 9 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 12 rules applied. Total rules applied 125 place count 71 transition count 83
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 5 rules applied. Total rules applied 130 place count 68 transition count 81
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 131 place count 67 transition count 81
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 131 place count 67 transition count 75
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 143 place count 61 transition count 75
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 146 place count 58 transition count 72
Iterating global reduction 5 with 3 rules applied. Total rules applied 149 place count 58 transition count 72
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 150 place count 57 transition count 70
Iterating global reduction 5 with 1 rules applied. Total rules applied 151 place count 57 transition count 70
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 5 with 2 rules applied. Total rules applied 153 place count 57 transition count 68
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 154 place count 56 transition count 68
Performed 20 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 7 with 40 rules applied. Total rules applied 194 place count 36 transition count 47
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 198 place count 32 transition count 38
Iterating global reduction 7 with 4 rules applied. Total rules applied 202 place count 32 transition count 38
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 203 place count 32 transition count 37
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 8 with 2 rules applied. Total rules applied 205 place count 31 transition count 36
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 209 place count 29 transition count 42
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 211 place count 27 transition count 40
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 212 place count 26 transition count 40
Applied a total of 212 rules in 22 ms. Remains 26 /131 variables (removed 105) and now considering 40/153 (removed 113) transitions.
// Phase 1: matrix 40 rows 26 cols
[2024-06-01 02:49:24] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 02:49:24] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-06-01 02:49:24] [INFO ] Invariant cache hit.
[2024-06-01 02:49:24] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 02:49:24] [INFO ] Implicit Places using invariants and state equation in 81 ms returned [22, 25]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 146 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 24/131 places, 40/153 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 23 transition count 39
Applied a total of 2 rules in 2 ms. Remains 23 /24 variables (removed 1) and now considering 39/40 (removed 1) transitions.
// Phase 1: matrix 39 rows 23 cols
[2024-06-01 02:49:24] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 02:49:24] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-06-01 02:49:24] [INFO ] Invariant cache hit.
[2024-06-01 02:49:24] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 02:49:24] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 23/131 places, 39/153 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 283 ms. Remains : 23/131 places, 39/153 transitions.
Running random walk in product with property : AutonomousCar-PT-02b-LTLCardinality-05
Product exploration explored 100000 steps with 25000 reset in 177 ms.
Product exploration explored 100000 steps with 25000 reset in 336 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 114 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 279 steps (35 resets) in 7 ms. (34 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 141 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 191 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 23 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 39/39 transitions.
Applied a total of 0 rules in 0 ms. Remains 23 /23 variables (removed 0) and now considering 39/39 (removed 0) transitions.
[2024-06-01 02:49:25] [INFO ] Invariant cache hit.
[2024-06-01 02:49:25] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-06-01 02:49:25] [INFO ] Invariant cache hit.
[2024-06-01 02:49:26] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 02:49:26] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
Running 38 sub problems to find dead transitions.
[2024-06-01 02:49:26] [INFO ] Invariant cache hit.
[2024-06-01 02:49:26] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (OVERLAPS) 1/23 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-06-01 02:49:26] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (OVERLAPS) 38/61 variables, 23/27 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-06-01 02:49:26] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2024-06-01 02:49:26] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/61 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/61 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (OVERLAPS) 1/62 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/62 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 11 (OVERLAPS) 0/62 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 62/62 variables, and 34 constraints, problems are : Problem set: 0 solved, 38 unsolved in 1293 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 23/23 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 1/23 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (OVERLAPS) 38/61 variables, 23/29 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/61 variables, 38/71 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/61 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (OVERLAPS) 1/62 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/62 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 11 (OVERLAPS) 0/62 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 62/62 variables, and 72 constraints, problems are : Problem set: 0 solved, 38 unsolved in 898 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 23/23 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 3/3 constraints]
After SMT, in 2232ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 2233ms
Finished structural reductions in LTL mode , in 1 iterations and 2361 ms. Remains : 23/23 places, 39/39 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p1]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 74 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 306 steps (35 resets) in 7 ms. (38 steps per ms) remains 0/1 properties
Knowledge obtained : [p1]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 1 factoid took 87 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 151 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 187 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 25000 reset in 241 ms.
Product exploration explored 100000 steps with 25000 reset in 191 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 175 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 39/39 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 39
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 23 transition count 41
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 3 rules in 3 ms. Remains 23 /23 variables (removed 0) and now considering 41/39 (removed -2) transitions.
[2024-06-01 02:49:29] [INFO ] Redundant transitions in 0 ms returned []
Running 40 sub problems to find dead transitions.
// Phase 1: matrix 41 rows 23 cols
[2024-06-01 02:49:29] [INFO ] Computed 3 invariants in 0 ms
[2024-06-01 02:49:29] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 1/23 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 02:49:30] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-06-01 02:49:30] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
Problem TDEAD7 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 2/5 constraints. Problems are: Problem set: 1 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 39 unsolved
Problem TDEAD2 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
At refinement iteration 5 (OVERLAPS) 40/63 variables, 23/28 constraints. Problems are: Problem set: 5 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 4/32 constraints. Problems are: Problem set: 5 solved, 35 unsolved
[2024-06-01 02:49:30] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/63 variables, 1/33 constraints. Problems are: Problem set: 5 solved, 35 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/63 variables, 0/33 constraints. Problems are: Problem set: 5 solved, 35 unsolved
At refinement iteration 9 (OVERLAPS) 1/64 variables, 1/34 constraints. Problems are: Problem set: 5 solved, 35 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/64 variables, 0/34 constraints. Problems are: Problem set: 5 solved, 35 unsolved
At refinement iteration 11 (OVERLAPS) 0/64 variables, 0/34 constraints. Problems are: Problem set: 5 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Real declared 64/64 variables, and 34 constraints, problems are : Problem set: 5 solved, 35 unsolved in 1017 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 23/23 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 5 solved, 35 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 2/2 constraints. Problems are: Problem set: 5 solved, 35 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 2/4 constraints. Problems are: Problem set: 5 solved, 35 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 5 solved, 35 unsolved
At refinement iteration 3 (OVERLAPS) 2/21 variables, 1/5 constraints. Problems are: Problem set: 5 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 1/6 constraints. Problems are: Problem set: 5 solved, 35 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/21 variables, 0/6 constraints. Problems are: Problem set: 5 solved, 35 unsolved
At refinement iteration 6 (OVERLAPS) 40/61 variables, 21/27 constraints. Problems are: Problem set: 5 solved, 35 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/61 variables, 4/31 constraints. Problems are: Problem set: 5 solved, 35 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/61 variables, 35/66 constraints. Problems are: Problem set: 5 solved, 35 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/61 variables, 0/66 constraints. Problems are: Problem set: 5 solved, 35 unsolved
At refinement iteration 10 (OVERLAPS) 2/63 variables, 2/68 constraints. Problems are: Problem set: 5 solved, 35 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/63 variables, 0/68 constraints. Problems are: Problem set: 5 solved, 35 unsolved
At refinement iteration 12 (OVERLAPS) 1/64 variables, 1/69 constraints. Problems are: Problem set: 5 solved, 35 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/64 variables, 0/69 constraints. Problems are: Problem set: 5 solved, 35 unsolved
At refinement iteration 14 (OVERLAPS) 0/64 variables, 0/69 constraints. Problems are: Problem set: 5 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Int declared 64/64 variables, and 69 constraints, problems are : Problem set: 5 solved, 35 unsolved in 1221 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 23/23 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 35/40 constraints, Known Traps: 3/3 constraints]
After SMT, in 2256ms problems are : Problem set: 5 solved, 35 unsolved
Search for dead transitions found 5 dead transitions in 2257ms
Found 5 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 5 transitions
Dead transitions reduction (with SMT) removed 5 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 23/23 places, 36/39 transitions.
Graph (complete) has 83 edges and 23 vertex of which 20 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 20 /23 variables (removed 3) and now considering 36/36 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 20/23 places, 36/39 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2269 ms. Remains : 20/23 places, 36/39 transitions.
Support contains 2 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 39/39 transitions.
Applied a total of 0 rules in 0 ms. Remains 23 /23 variables (removed 0) and now considering 39/39 (removed 0) transitions.
// Phase 1: matrix 39 rows 23 cols
[2024-06-01 02:49:32] [INFO ] Computed 3 invariants in 0 ms
[2024-06-01 02:49:32] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-06-01 02:49:32] [INFO ] Invariant cache hit.
[2024-06-01 02:49:32] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 02:49:32] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
Running 38 sub problems to find dead transitions.
[2024-06-01 02:49:32] [INFO ] Invariant cache hit.
[2024-06-01 02:49:32] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (OVERLAPS) 1/23 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-06-01 02:49:32] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (OVERLAPS) 38/61 variables, 23/27 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-06-01 02:49:32] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-06-01 02:49:32] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/61 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/61 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (OVERLAPS) 1/62 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/62 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 11 (OVERLAPS) 0/62 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 62/62 variables, and 34 constraints, problems are : Problem set: 0 solved, 38 unsolved in 1038 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 23/23 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 1/23 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (OVERLAPS) 38/61 variables, 23/29 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/61 variables, 38/71 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/61 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (OVERLAPS) 1/62 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/62 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 11 (OVERLAPS) 0/62 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 62/62 variables, and 72 constraints, problems are : Problem set: 0 solved, 38 unsolved in 935 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 23/23 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 3/3 constraints]
After SMT, in 1993ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 1994ms
Finished structural reductions in LTL mode , in 1 iterations and 2090 ms. Remains : 23/23 places, 39/39 transitions.
Treatment of property AutonomousCar-PT-02b-LTLCardinality-05 finished in 10502 ms.
[2024-06-01 02:49:34] [INFO ] Flatten gal took : 21 ms
[2024-06-01 02:49:34] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 5 ms.
[2024-06-01 02:49:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 131 places, 153 transitions and 440 arcs took 11 ms.
Total runtime 144698 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA AutonomousCar-PT-02b-LTLCardinality-05 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717210174686

--------------------
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 LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name AutonomousCar-PT-02b-LTLCardinality-05
ltl formula formula --ltl=/tmp/1626/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 131 places, 153 transitions and 440 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.050 real 0.010 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1626/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1626/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1626/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1626/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 133 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 132, there are 194 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 8
pnml2lts-mc( 0/ 4): unique states count: 8
pnml2lts-mc( 0/ 4): unique transitions count: 8
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 3
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 18
pnml2lts-mc( 0/ 4): - cum. max stack depth: 15
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 18 states 30 transitions, fanout: 1.667
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 70.0 B/state, compr.: 13.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 153 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AutonomousCar-PT-02b"
export BK_EXAMINATION="LTLCardinality"
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 AutonomousCar-PT-02b, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r468-smll-171620167300243"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-02b.tgz
mv AutonomousCar-PT-02b execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;