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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 424K
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K 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 6.3K Apr 12 18:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 56K Apr 12 18:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Apr 12 18:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 31K 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 75K 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-03b-LTLCardinality-00
FORMULA_NAME AutonomousCar-PT-03b-LTLCardinality-01
FORMULA_NAME AutonomousCar-PT-03b-LTLCardinality-02
FORMULA_NAME AutonomousCar-PT-03b-LTLCardinality-03
FORMULA_NAME AutonomousCar-PT-03b-LTLCardinality-04
FORMULA_NAME AutonomousCar-PT-03b-LTLCardinality-05
FORMULA_NAME AutonomousCar-PT-03b-LTLCardinality-06
FORMULA_NAME AutonomousCar-PT-03b-LTLCardinality-07
FORMULA_NAME AutonomousCar-PT-03b-LTLCardinality-08
FORMULA_NAME AutonomousCar-PT-03b-LTLCardinality-09
FORMULA_NAME AutonomousCar-PT-03b-LTLCardinality-10
FORMULA_NAME AutonomousCar-PT-03b-LTLCardinality-11
FORMULA_NAME AutonomousCar-PT-03b-LTLCardinality-12
FORMULA_NAME AutonomousCar-PT-03b-LTLCardinality-13
FORMULA_NAME AutonomousCar-PT-03b-LTLCardinality-14
FORMULA_NAME AutonomousCar-PT-03b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717210517966

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-03b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 02:55:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 02:55:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 02:55:21] [INFO ] Load time of PNML (sax parser for PT used): 198 ms
[2024-06-01 02:55:21] [INFO ] Transformed 190 places.
[2024-06-01 02:55:21] [INFO ] Transformed 273 transitions.
[2024-06-01 02:55:21] [INFO ] Found NUPN structural information;
[2024-06-01 02:55:21] [INFO ] Parsed PT model containing 190 places and 273 transitions and 1051 arcs in 447 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 28 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA AutonomousCar-PT-03b-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-03b-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-03b-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-03b-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-03b-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-03b-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-03b-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-03b-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-03b-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 18 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 273/273 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 164 transition count 247
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 164 transition count 247
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 88 place count 164 transition count 211
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 91 place count 161 transition count 208
Iterating global reduction 1 with 3 rules applied. Total rules applied 94 place count 161 transition count 208
Applied a total of 94 rules in 117 ms. Remains 161 /190 variables (removed 29) and now considering 208/273 (removed 65) transitions.
// Phase 1: matrix 208 rows 161 cols
[2024-06-01 02:55:21] [INFO ] Computed 8 invariants in 37 ms
[2024-06-01 02:55:22] [INFO ] Implicit Places using invariants in 469 ms returned []
[2024-06-01 02:55:22] [INFO ] Invariant cache hit.
[2024-06-01 02:55:22] [INFO ] Implicit Places using invariants and state equation in 413 ms returned []
Implicit Place search using SMT with State Equation took 960 ms to find 0 implicit places.
Running 207 sub problems to find dead transitions.
[2024-06-01 02:55:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (OVERLAPS) 1/161 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2024-06-01 02:55:26] [INFO ] Deduced a trap composed of 31 places in 210 ms of which 39 ms to minimize.
[2024-06-01 02:55:26] [INFO ] Deduced a trap composed of 16 places in 171 ms of which 4 ms to minimize.
[2024-06-01 02:55:26] [INFO ] Deduced a trap composed of 17 places in 148 ms of which 4 ms to minimize.
[2024-06-01 02:55:26] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 2 ms to minimize.
[2024-06-01 02:55:26] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 2 ms to minimize.
[2024-06-01 02:55:27] [INFO ] Deduced a trap composed of 14 places in 123 ms of which 3 ms to minimize.
[2024-06-01 02:55:27] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 3 ms to minimize.
[2024-06-01 02:55:27] [INFO ] Deduced a trap composed of 22 places in 120 ms of which 3 ms to minimize.
[2024-06-01 02:55:27] [INFO ] Deduced a trap composed of 35 places in 111 ms of which 2 ms to minimize.
[2024-06-01 02:55:27] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 2 ms to minimize.
[2024-06-01 02:55:27] [INFO ] Deduced a trap composed of 37 places in 79 ms of which 2 ms to minimize.
[2024-06-01 02:55:27] [INFO ] Deduced a trap composed of 41 places in 83 ms of which 2 ms to minimize.
[2024-06-01 02:55:27] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 1 ms to minimize.
[2024-06-01 02:55:28] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 2 ms to minimize.
[2024-06-01 02:55:28] [INFO ] Deduced a trap composed of 26 places in 99 ms of which 3 ms to minimize.
[2024-06-01 02:55:28] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 2 ms to minimize.
[2024-06-01 02:55:28] [INFO ] Deduced a trap composed of 33 places in 105 ms of which 3 ms to minimize.
[2024-06-01 02:55:28] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 3 ms to minimize.
[2024-06-01 02:55:28] [INFO ] Deduced a trap composed of 39 places in 118 ms of which 3 ms to minimize.
[2024-06-01 02:55:29] [INFO ] Deduced a trap composed of 47 places in 117 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2024-06-01 02:55:29] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 1 ms to minimize.
[2024-06-01 02:55:29] [INFO ] Deduced a trap composed of 41 places in 211 ms of which 3 ms to minimize.
[2024-06-01 02:55:29] [INFO ] Deduced a trap composed of 47 places in 150 ms of which 2 ms to minimize.
[2024-06-01 02:55:30] [INFO ] Deduced a trap composed of 37 places in 79 ms of which 2 ms to minimize.
[2024-06-01 02:55:30] [INFO ] Deduced a trap composed of 40 places in 68 ms of which 2 ms to minimize.
[2024-06-01 02:55:30] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 2 ms to minimize.
[2024-06-01 02:55:30] [INFO ] Deduced a trap composed of 40 places in 74 ms of which 2 ms to minimize.
[2024-06-01 02:55:30] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 2 ms to minimize.
[2024-06-01 02:55:30] [INFO ] Deduced a trap composed of 44 places in 74 ms of which 2 ms to minimize.
[2024-06-01 02:55:30] [INFO ] Deduced a trap composed of 33 places in 81 ms of which 2 ms to minimize.
[2024-06-01 02:55:31] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 11/39 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2024-06-01 02:55:33] [INFO ] Deduced a trap composed of 33 places in 102 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2024-06-01 02:55:35] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 207 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD192 is UNSAT
At refinement iteration 7 (OVERLAPS) 208/369 variables, 161/202 constraints. Problems are: Problem set: 2 solved, 205 unsolved
[2024-06-01 02:55:38] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 1/203 constraints. Problems are: Problem set: 2 solved, 205 unsolved
[2024-06-01 02:55:40] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/369 variables, 1/204 constraints. Problems are: Problem set: 2 solved, 205 unsolved
[2024-06-01 02:55:44] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/369 variables, 1/205 constraints. Problems are: Problem set: 2 solved, 205 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/369 variables, 0/205 constraints. Problems are: Problem set: 2 solved, 205 unsolved
At refinement iteration 12 (OVERLAPS) 0/369 variables, 0/205 constraints. Problems are: Problem set: 2 solved, 205 unsolved
No progress, stopping.
After SMT solving in domain Real declared 369/369 variables, and 205 constraints, problems are : Problem set: 2 solved, 205 unsolved in 29361 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 207/207 constraints, Known Traps: 36/36 constraints]
Escalating to Integer solving :Problem set: 2 solved, 205 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 205 unsolved
At refinement iteration 1 (OVERLAPS) 2/161 variables, 8/8 constraints. Problems are: Problem set: 2 solved, 205 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 36/44 constraints. Problems are: Problem set: 2 solved, 205 unsolved
[2024-06-01 02:55:55] [INFO ] Deduced a trap composed of 5 places in 136 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 1/45 constraints. Problems are: Problem set: 2 solved, 205 unsolved
[2024-06-01 02:55:55] [INFO ] Deduced a trap composed of 36 places in 99 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 1/46 constraints. Problems are: Problem set: 2 solved, 205 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 0/46 constraints. Problems are: Problem set: 2 solved, 205 unsolved
At refinement iteration 6 (OVERLAPS) 208/369 variables, 161/207 constraints. Problems are: Problem set: 2 solved, 205 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/369 variables, 205/412 constraints. Problems are: Problem set: 2 solved, 205 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 0/412 constraints. Problems are: Problem set: 2 solved, 205 unsolved
At refinement iteration 9 (OVERLAPS) 0/369 variables, 0/412 constraints. Problems are: Problem set: 2 solved, 205 unsolved
No progress, stopping.
After SMT solving in domain Int declared 369/369 variables, and 412 constraints, problems are : Problem set: 2 solved, 205 unsolved in 16857 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 205/207 constraints, Known Traps: 38/38 constraints]
After SMT, in 46536ms problems are : Problem set: 2 solved, 205 unsolved
Search for dead transitions found 2 dead transitions in 46576ms
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 : 161/190 places, 206/273 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 160 transition count 206
Applied a total of 1 rules in 13 ms. Remains 160 /161 variables (removed 1) and now considering 206/206 (removed 0) transitions.
// Phase 1: matrix 206 rows 160 cols
[2024-06-01 02:56:09] [INFO ] Computed 8 invariants in 5 ms
[2024-06-01 02:56:09] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-06-01 02:56:09] [INFO ] Invariant cache hit.
[2024-06-01 02:56:09] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 160/190 places, 206/273 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 47988 ms. Remains : 160/190 places, 206/273 transitions.
Support contains 18 out of 160 places after structural reductions.
[2024-06-01 02:56:10] [INFO ] Flatten gal took : 111 ms
[2024-06-01 02:56:10] [INFO ] Flatten gal took : 42 ms
[2024-06-01 02:56:10] [INFO ] Input system was already deterministic with 206 transitions.
RANDOM walk for 40000 steps (24 resets) in 1658 ms. (24 steps per ms) remains 2/10 properties
BEST_FIRST walk for 40000 steps (52 resets) in 432 ms. (92 steps per ms) remains 1/2 properties
BEST_FIRST walk for 31386 steps (18 resets) in 204 ms. (153 steps per ms) remains 0/1 properties
FORMULA AutonomousCar-PT-03b-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 35 stabilizing places and 35 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 160/160 places, 206/206 transitions.
Graph (trivial) has 143 edges and 160 vertex of which 4 / 160 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 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 62 place count 157 transition count 142
Reduce places removed 61 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 82 rules applied. Total rules applied 144 place count 96 transition count 121
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 13 rules applied. Total rules applied 157 place count 84 transition count 120
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 158 place count 83 transition count 120
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 158 place count 83 transition count 113
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 172 place count 76 transition count 113
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 175 place count 73 transition count 110
Iterating global reduction 4 with 3 rules applied. Total rules applied 178 place count 73 transition count 110
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 236 place count 44 transition count 81
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 243 place count 37 transition count 59
Iterating global reduction 4 with 7 rules applied. Total rules applied 250 place count 37 transition count 59
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 253 place count 37 transition count 56
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 255 place count 36 transition count 55
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 259 place count 34 transition count 73
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 261 place count 32 transition count 71
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 262 place count 31 transition count 71
Applied a total of 262 rules in 95 ms. Remains 31 /160 variables (removed 129) and now considering 71/206 (removed 135) transitions.
// Phase 1: matrix 71 rows 31 cols
[2024-06-01 02:56:11] [INFO ] Computed 6 invariants in 4 ms
[2024-06-01 02:56:11] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-01 02:56:11] [INFO ] Invariant cache hit.
[2024-06-01 02:56:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 02:56:11] [INFO ] Implicit Places using invariants and state equation in 105 ms returned [25, 30]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 191 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 29/160 places, 71/206 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 28 transition count 70
Applied a total of 2 rules in 9 ms. Remains 28 /29 variables (removed 1) and now considering 70/71 (removed 1) transitions.
// Phase 1: matrix 70 rows 28 cols
[2024-06-01 02:56:11] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 02:56:11] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-06-01 02:56:11] [INFO ] Invariant cache hit.
[2024-06-01 02:56:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 02:56:11] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 28/160 places, 70/206 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 448 ms. Remains : 28/160 places, 70/206 transitions.
Stuttering acceptance computed with spot in 417 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-03b-LTLCardinality-00
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 2 ms.
FORMULA AutonomousCar-PT-03b-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03b-LTLCardinality-00 finished in 982 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 2 out of 160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 206/206 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 157 transition count 203
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 157 transition count 203
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 156 transition count 202
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 156 transition count 202
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 155 transition count 201
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 155 transition count 201
Applied a total of 10 rules in 25 ms. Remains 155 /160 variables (removed 5) and now considering 201/206 (removed 5) transitions.
// Phase 1: matrix 201 rows 155 cols
[2024-06-01 02:56:12] [INFO ] Computed 8 invariants in 11 ms
[2024-06-01 02:56:12] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-06-01 02:56:12] [INFO ] Invariant cache hit.
[2024-06-01 02:56:12] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 386 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2024-06-01 02:56:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-06-01 02:56:15] [INFO ] Deduced a trap composed of 31 places in 146 ms of which 2 ms to minimize.
[2024-06-01 02:56:15] [INFO ] Deduced a trap composed of 18 places in 129 ms of which 5 ms to minimize.
[2024-06-01 02:56:15] [INFO ] Deduced a trap composed of 42 places in 129 ms of which 2 ms to minimize.
[2024-06-01 02:56:15] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 2 ms to minimize.
[2024-06-01 02:56:15] [INFO ] Deduced a trap composed of 25 places in 119 ms of which 2 ms to minimize.
[2024-06-01 02:56:16] [INFO ] Deduced a trap composed of 33 places in 128 ms of which 2 ms to minimize.
[2024-06-01 02:56:16] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 1 ms to minimize.
[2024-06-01 02:56:16] [INFO ] Deduced a trap composed of 21 places in 118 ms of which 3 ms to minimize.
[2024-06-01 02:56:16] [INFO ] Deduced a trap composed of 35 places in 120 ms of which 3 ms to minimize.
[2024-06-01 02:56:16] [INFO ] Deduced a trap composed of 36 places in 127 ms of which 3 ms to minimize.
[2024-06-01 02:56:16] [INFO ] Deduced a trap composed of 47 places in 143 ms of which 3 ms to minimize.
[2024-06-01 02:56:16] [INFO ] Deduced a trap composed of 31 places in 115 ms of which 3 ms to minimize.
[2024-06-01 02:56:17] [INFO ] Deduced a trap composed of 43 places in 110 ms of which 3 ms to minimize.
[2024-06-01 02:56:17] [INFO ] Deduced a trap composed of 33 places in 112 ms of which 3 ms to minimize.
[2024-06-01 02:56:17] [INFO ] Deduced a trap composed of 24 places in 107 ms of which 3 ms to minimize.
[2024-06-01 02:56:17] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 2 ms to minimize.
[2024-06-01 02:56:17] [INFO ] Deduced a trap composed of 32 places in 109 ms of which 2 ms to minimize.
[2024-06-01 02:56:17] [INFO ] Deduced a trap composed of 41 places in 94 ms of which 2 ms to minimize.
[2024-06-01 02:56:17] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 6 ms to minimize.
[2024-06-01 02:56:18] [INFO ] Deduced a trap composed of 31 places in 131 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-06-01 02:56:18] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 1 ms to minimize.
[2024-06-01 02:56:18] [INFO ] Deduced a trap composed of 36 places in 129 ms of which 3 ms to minimize.
[2024-06-01 02:56:18] [INFO ] Deduced a trap composed of 31 places in 119 ms of which 2 ms to minimize.
[2024-06-01 02:56:18] [INFO ] Deduced a trap composed of 24 places in 124 ms of which 2 ms to minimize.
[2024-06-01 02:56:19] [INFO ] Deduced a trap composed of 14 places in 118 ms of which 3 ms to minimize.
[2024-06-01 02:56:19] [INFO ] Deduced a trap composed of 43 places in 71 ms of which 2 ms to minimize.
[2024-06-01 02:56:19] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 2 ms to minimize.
[2024-06-01 02:56:19] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 2 ms to minimize.
[2024-06-01 02:56:19] [INFO ] Deduced a trap composed of 51 places in 64 ms of which 1 ms to minimize.
[2024-06-01 02:56:19] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 2 ms to minimize.
[2024-06-01 02:56:19] [INFO ] Deduced a trap composed of 41 places in 92 ms of which 3 ms to minimize.
[2024-06-01 02:56:19] [INFO ] Deduced a trap composed of 51 places in 80 ms of which 2 ms to minimize.
[2024-06-01 02:56:20] [INFO ] Deduced a trap composed of 41 places in 58 ms of which 1 ms to minimize.
[2024-06-01 02:56:20] [INFO ] Deduced a trap composed of 5 places in 98 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 14/42 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-06-01 02:56:22] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 2 ms to minimize.
[2024-06-01 02:56:22] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 2 ms to minimize.
[2024-06-01 02:56:22] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 2 ms to minimize.
[2024-06-01 02:56:22] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
[2024-06-01 02:56:22] [INFO ] Deduced a trap composed of 41 places in 63 ms of which 2 ms to minimize.
[2024-06-01 02:56:23] [INFO ] Deduced a trap composed of 51 places in 111 ms of which 2 ms to minimize.
[2024-06-01 02:56:23] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 3 ms to minimize.
[2024-06-01 02:56:23] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 8/50 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-06-01 02:56:24] [INFO ] Deduced a trap composed of 40 places in 91 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 201/356 variables, 155/206 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/356 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 9 (OVERLAPS) 0/356 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 356/356 variables, and 206 constraints, problems are : Problem set: 0 solved, 200 unsolved in 21385 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 43/43 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 43/51 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 201/356 variables, 155/206 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/356 variables, 200/406 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-06-01 02:56:38] [INFO ] Deduced a trap composed of 40 places in 86 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/356 variables, 1/407 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/356 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 8 (OVERLAPS) 0/356 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 356/356 variables, and 407 constraints, problems are : Problem set: 0 solved, 200 unsolved in 18640 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 44/44 constraints]
After SMT, in 40153ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 40159ms
Starting structural reductions in LTL mode, iteration 1 : 155/160 places, 201/206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40572 ms. Remains : 155/160 places, 201/206 transitions.
Stuttering acceptance computed with spot in 165 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-03b-LTLCardinality-01
Product exploration explored 100000 steps with 25000 reset in 472 ms.
Product exploration explored 100000 steps with 25000 reset in 300 ms.
Computed a total of 34 stabilizing places and 34 stable transitions
Computed a total of 34 stabilizing places and 34 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 112 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 181 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 157 steps (0 resets) in 5 ms. (26 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 101 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 p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 194 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 201/201 transitions.
Applied a total of 0 rules in 4 ms. Remains 155 /155 variables (removed 0) and now considering 201/201 (removed 0) transitions.
[2024-06-01 02:56:54] [INFO ] Invariant cache hit.
[2024-06-01 02:56:54] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-06-01 02:56:54] [INFO ] Invariant cache hit.
[2024-06-01 02:56:54] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 386 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2024-06-01 02:56:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-06-01 02:56:57] [INFO ] Deduced a trap composed of 31 places in 136 ms of which 3 ms to minimize.
[2024-06-01 02:56:57] [INFO ] Deduced a trap composed of 18 places in 124 ms of which 3 ms to minimize.
[2024-06-01 02:56:57] [INFO ] Deduced a trap composed of 42 places in 133 ms of which 3 ms to minimize.
[2024-06-01 02:56:57] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 2 ms to minimize.
[2024-06-01 02:56:57] [INFO ] Deduced a trap composed of 25 places in 108 ms of which 2 ms to minimize.
[2024-06-01 02:56:58] [INFO ] Deduced a trap composed of 33 places in 117 ms of which 2 ms to minimize.
[2024-06-01 02:56:58] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 2 ms to minimize.
[2024-06-01 02:56:58] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 2 ms to minimize.
[2024-06-01 02:56:58] [INFO ] Deduced a trap composed of 35 places in 120 ms of which 3 ms to minimize.
[2024-06-01 02:56:58] [INFO ] Deduced a trap composed of 36 places in 126 ms of which 3 ms to minimize.
[2024-06-01 02:56:58] [INFO ] Deduced a trap composed of 47 places in 118 ms of which 2 ms to minimize.
[2024-06-01 02:56:58] [INFO ] Deduced a trap composed of 31 places in 115 ms of which 2 ms to minimize.
[2024-06-01 02:56:58] [INFO ] Deduced a trap composed of 43 places in 114 ms of which 2 ms to minimize.
[2024-06-01 02:56:59] [INFO ] Deduced a trap composed of 33 places in 105 ms of which 3 ms to minimize.
[2024-06-01 02:56:59] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 2 ms to minimize.
[2024-06-01 02:56:59] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 2 ms to minimize.
[2024-06-01 02:56:59] [INFO ] Deduced a trap composed of 32 places in 112 ms of which 2 ms to minimize.
[2024-06-01 02:56:59] [INFO ] Deduced a trap composed of 41 places in 110 ms of which 2 ms to minimize.
[2024-06-01 02:56:59] [INFO ] Deduced a trap composed of 31 places in 123 ms of which 3 ms to minimize.
[2024-06-01 02:57:00] [INFO ] Deduced a trap composed of 31 places in 132 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-06-01 02:57:00] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 1 ms to minimize.
[2024-06-01 02:57:00] [INFO ] Deduced a trap composed of 36 places in 106 ms of which 3 ms to minimize.
[2024-06-01 02:57:00] [INFO ] Deduced a trap composed of 31 places in 111 ms of which 2 ms to minimize.
[2024-06-01 02:57:00] [INFO ] Deduced a trap composed of 24 places in 121 ms of which 3 ms to minimize.
[2024-06-01 02:57:01] [INFO ] Deduced a trap composed of 14 places in 127 ms of which 3 ms to minimize.
[2024-06-01 02:57:01] [INFO ] Deduced a trap composed of 43 places in 111 ms of which 3 ms to minimize.
[2024-06-01 02:57:01] [INFO ] Deduced a trap composed of 32 places in 103 ms of which 2 ms to minimize.
[2024-06-01 02:57:01] [INFO ] Deduced a trap composed of 40 places in 100 ms of which 3 ms to minimize.
[2024-06-01 02:57:01] [INFO ] Deduced a trap composed of 51 places in 96 ms of which 2 ms to minimize.
[2024-06-01 02:57:01] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 3 ms to minimize.
[2024-06-01 02:57:01] [INFO ] Deduced a trap composed of 41 places in 92 ms of which 2 ms to minimize.
[2024-06-01 02:57:02] [INFO ] Deduced a trap composed of 51 places in 72 ms of which 1 ms to minimize.
[2024-06-01 02:57:02] [INFO ] Deduced a trap composed of 41 places in 61 ms of which 2 ms to minimize.
[2024-06-01 02:57:02] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 14/42 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-06-01 02:57:04] [INFO ] Deduced a trap composed of 10 places in 98 ms of which 2 ms to minimize.
[2024-06-01 02:57:04] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 3 ms to minimize.
[2024-06-01 02:57:04] [INFO ] Deduced a trap composed of 33 places in 102 ms of which 3 ms to minimize.
[2024-06-01 02:57:04] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 2 ms to minimize.
[2024-06-01 02:57:04] [INFO ] Deduced a trap composed of 41 places in 58 ms of which 2 ms to minimize.
[2024-06-01 02:57:05] [INFO ] Deduced a trap composed of 51 places in 85 ms of which 2 ms to minimize.
[2024-06-01 02:57:05] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 3 ms to minimize.
[2024-06-01 02:57:05] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 8/50 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-06-01 02:57:06] [INFO ] Deduced a trap composed of 40 places in 87 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 201/356 variables, 155/206 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/356 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 9 (OVERLAPS) 0/356 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 356/356 variables, and 206 constraints, problems are : Problem set: 0 solved, 200 unsolved in 21236 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 43/43 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 43/51 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 201/356 variables, 155/206 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/356 variables, 200/406 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-06-01 02:57:20] [INFO ] Deduced a trap composed of 40 places in 80 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/356 variables, 1/407 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/356 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 8 (OVERLAPS) 0/356 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 356/356 variables, and 407 constraints, problems are : Problem set: 0 solved, 200 unsolved in 18306 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 44/44 constraints]
After SMT, in 39682ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 39687ms
Finished structural reductions in LTL mode , in 1 iterations and 40081 ms. Remains : 155/155 places, 201/201 transitions.
Computed a total of 34 stabilizing places and 34 stable transitions
Computed a total of 34 stabilizing places and 34 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 85 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 191 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 149 steps (0 resets) in 4 ms. (29 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 130 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 190 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 196 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 200 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 126 ms.
Product exploration explored 100000 steps with 25000 reset in 145 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 155 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 155/155 places, 201/201 transitions.
Graph (trivial) has 142 edges and 155 vertex of which 4 / 155 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 58 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 58 rules applied. Total rules applied 59 place count 153 transition count 199
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 68 place count 153 transition count 190
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 68 place count 153 transition count 190
Deduced a syphon composed of 72 places in 0 ms
Iterating global reduction 2 with 14 rules applied. Total rules applied 82 place count 153 transition count 190
Discarding 51 places :
Symmetric choice reduction at 2 with 51 rule applications. Total rules 133 place count 102 transition count 139
Deduced a syphon composed of 22 places in 1 ms
Iterating global reduction 2 with 51 rules applied. Total rules applied 184 place count 102 transition count 139
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 59 places in 0 ms
Iterating global reduction 2 with 37 rules applied. Total rules applied 221 place count 102 transition count 142
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 222 place count 102 transition count 141
Discarding 34 places :
Symmetric choice reduction at 3 with 34 rule applications. Total rules 256 place count 68 transition count 92
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 3 with 34 rules applied. Total rules applied 290 place count 68 transition count 92
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 296 place count 68 transition count 86
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 299 place count 65 transition count 83
Deduced a syphon composed of 29 places in 1 ms
Iterating global reduction 4 with 3 rules applied. Total rules applied 302 place count 65 transition count 83
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 30 places in 1 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 303 place count 65 transition count 83
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 305 place count 63 transition count 81
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 307 place count 63 transition count 81
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 4 with 4 rules applied. Total rules applied 311 place count 63 transition count 111
Deduced a syphon composed of 32 places in 1 ms
Applied a total of 311 rules in 68 ms. Remains 63 /155 variables (removed 92) and now considering 111/201 (removed 90) transitions.
[2024-06-01 02:57:36] [INFO ] Redundant transitions in 3 ms returned []
Running 110 sub problems to find dead transitions.
// Phase 1: matrix 111 rows 63 cols
[2024-06-01 02:57:36] [INFO ] Computed 7 invariants in 1 ms
[2024-06-01 02:57:36] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-06-01 02:57:37] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-06-01 02:57:37] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-06-01 02:57:37] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2024-06-01 02:57:37] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
[2024-06-01 02:57:37] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 2 ms to minimize.
[2024-06-01 02:57:37] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 1 ms to minimize.
[2024-06-01 02:57:37] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2024-06-01 02:57:37] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 0 ms to minimize.
Problem TDEAD11 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD15 is UNSAT
[2024-06-01 02:57:37] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
Problem TDEAD16 is UNSAT
[2024-06-01 02:57:37] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
Problem TDEAD18 is UNSAT
[2024-06-01 02:57:37] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
[2024-06-01 02:57:37] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
Problem TDEAD32 is UNSAT
[2024-06-01 02:57:37] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 2 ms to minimize.
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 13/20 constraints. Problems are: Problem set: 33 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/20 constraints. Problems are: Problem set: 33 solved, 77 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD47 is UNSAT
At refinement iteration 4 (OVERLAPS) 110/173 variables, 63/83 constraints. Problems are: Problem set: 42 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 38/121 constraints. Problems are: Problem set: 42 solved, 68 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 0/121 constraints. Problems are: Problem set: 42 solved, 68 unsolved
At refinement iteration 7 (OVERLAPS) 1/174 variables, 1/122 constraints. Problems are: Problem set: 42 solved, 68 unsolved
[2024-06-01 02:57:39] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 1/123 constraints. Problems are: Problem set: 42 solved, 68 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/174 variables, 0/123 constraints. Problems are: Problem set: 42 solved, 68 unsolved
At refinement iteration 10 (OVERLAPS) 0/174 variables, 0/123 constraints. Problems are: Problem set: 42 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Real declared 174/174 variables, and 123 constraints, problems are : Problem set: 42 solved, 68 unsolved in 4095 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 63/63 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 42 solved, 68 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 42 solved, 68 unsolved
At refinement iteration 1 (OVERLAPS) 33/63 variables, 7/7 constraints. Problems are: Problem set: 42 solved, 68 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 14/21 constraints. Problems are: Problem set: 42 solved, 68 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/21 constraints. Problems are: Problem set: 42 solved, 68 unsolved
At refinement iteration 4 (OVERLAPS) 110/173 variables, 63/84 constraints. Problems are: Problem set: 42 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 38/122 constraints. Problems are: Problem set: 42 solved, 68 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 68/190 constraints. Problems are: Problem set: 42 solved, 68 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/173 variables, 0/190 constraints. Problems are: Problem set: 42 solved, 68 unsolved
At refinement iteration 8 (OVERLAPS) 1/174 variables, 1/191 constraints. Problems are: Problem set: 42 solved, 68 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/174 variables, 0/191 constraints. Problems are: Problem set: 42 solved, 68 unsolved
At refinement iteration 10 (OVERLAPS) 0/174 variables, 0/191 constraints. Problems are: Problem set: 42 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Int declared 174/174 variables, and 191 constraints, problems are : Problem set: 42 solved, 68 unsolved in 4447 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 63/63 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 68/110 constraints, Known Traps: 14/14 constraints]
After SMT, in 8654ms problems are : Problem set: 42 solved, 68 unsolved
Search for dead transitions found 42 dead transitions in 8656ms
Found 42 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 42 transitions
Dead transitions reduction (with SMT) removed 42 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 63/155 places, 69/201 transitions.
Graph (complete) has 189 edges and 63 vertex of which 31 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.3 ms
Discarding 32 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 18 ms. Remains 31 /63 variables (removed 32) and now considering 69/69 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 31/155 places, 69/201 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 8754 ms. Remains : 31/155 places, 69/201 transitions.
Support contains 2 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 201/201 transitions.
Applied a total of 0 rules in 2 ms. Remains 155 /155 variables (removed 0) and now considering 201/201 (removed 0) transitions.
// Phase 1: matrix 201 rows 155 cols
[2024-06-01 02:57:45] [INFO ] Computed 8 invariants in 4 ms
[2024-06-01 02:57:45] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-06-01 02:57:45] [INFO ] Invariant cache hit.
[2024-06-01 02:57:45] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2024-06-01 02:57:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-06-01 02:57:48] [INFO ] Deduced a trap composed of 31 places in 173 ms of which 4 ms to minimize.
[2024-06-01 02:57:48] [INFO ] Deduced a trap composed of 18 places in 140 ms of which 3 ms to minimize.
[2024-06-01 02:57:48] [INFO ] Deduced a trap composed of 42 places in 123 ms of which 4 ms to minimize.
[2024-06-01 02:57:48] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-06-01 02:57:48] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 3 ms to minimize.
[2024-06-01 02:57:48] [INFO ] Deduced a trap composed of 33 places in 119 ms of which 3 ms to minimize.
[2024-06-01 02:57:48] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 2 ms to minimize.
[2024-06-01 02:57:49] [INFO ] Deduced a trap composed of 21 places in 131 ms of which 3 ms to minimize.
[2024-06-01 02:57:49] [INFO ] Deduced a trap composed of 35 places in 123 ms of which 3 ms to minimize.
[2024-06-01 02:57:49] [INFO ] Deduced a trap composed of 36 places in 120 ms of which 2 ms to minimize.
[2024-06-01 02:57:49] [INFO ] Deduced a trap composed of 47 places in 109 ms of which 3 ms to minimize.
[2024-06-01 02:57:49] [INFO ] Deduced a trap composed of 31 places in 115 ms of which 3 ms to minimize.
[2024-06-01 02:57:49] [INFO ] Deduced a trap composed of 43 places in 107 ms of which 2 ms to minimize.
[2024-06-01 02:57:49] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 3 ms to minimize.
[2024-06-01 02:57:49] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 3 ms to minimize.
[2024-06-01 02:57:50] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 2 ms to minimize.
[2024-06-01 02:57:50] [INFO ] Deduced a trap composed of 32 places in 102 ms of which 2 ms to minimize.
[2024-06-01 02:57:50] [INFO ] Deduced a trap composed of 41 places in 103 ms of which 3 ms to minimize.
[2024-06-01 02:57:50] [INFO ] Deduced a trap composed of 31 places in 120 ms of which 3 ms to minimize.
[2024-06-01 02:57:50] [INFO ] Deduced a trap composed of 31 places in 115 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-06-01 02:57:51] [INFO ] Deduced a trap composed of 39 places in 57 ms of which 2 ms to minimize.
[2024-06-01 02:57:51] [INFO ] Deduced a trap composed of 36 places in 123 ms of which 3 ms to minimize.
[2024-06-01 02:57:51] [INFO ] Deduced a trap composed of 31 places in 113 ms of which 3 ms to minimize.
[2024-06-01 02:57:51] [INFO ] Deduced a trap composed of 24 places in 125 ms of which 3 ms to minimize.
[2024-06-01 02:57:51] [INFO ] Deduced a trap composed of 14 places in 129 ms of which 2 ms to minimize.
[2024-06-01 02:57:52] [INFO ] Deduced a trap composed of 43 places in 108 ms of which 2 ms to minimize.
[2024-06-01 02:57:52] [INFO ] Deduced a trap composed of 32 places in 101 ms of which 3 ms to minimize.
[2024-06-01 02:57:52] [INFO ] Deduced a trap composed of 40 places in 97 ms of which 2 ms to minimize.
[2024-06-01 02:57:52] [INFO ] Deduced a trap composed of 51 places in 92 ms of which 2 ms to minimize.
[2024-06-01 02:57:52] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 3 ms to minimize.
[2024-06-01 02:57:52] [INFO ] Deduced a trap composed of 41 places in 85 ms of which 2 ms to minimize.
[2024-06-01 02:57:52] [INFO ] Deduced a trap composed of 51 places in 87 ms of which 2 ms to minimize.
[2024-06-01 02:57:53] [INFO ] Deduced a trap composed of 41 places in 159 ms of which 2 ms to minimize.
[2024-06-01 02:57:53] [INFO ] Deduced a trap composed of 5 places in 130 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 14/42 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-06-01 02:57:55] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 2 ms to minimize.
[2024-06-01 02:57:55] [INFO ] Deduced a trap composed of 20 places in 124 ms of which 3 ms to minimize.
[2024-06-01 02:57:55] [INFO ] Deduced a trap composed of 33 places in 106 ms of which 3 ms to minimize.
[2024-06-01 02:57:55] [INFO ] Deduced a trap composed of 14 places in 132 ms of which 2 ms to minimize.
[2024-06-01 02:57:56] [INFO ] Deduced a trap composed of 41 places in 63 ms of which 1 ms to minimize.
[2024-06-01 02:57:56] [INFO ] Deduced a trap composed of 51 places in 99 ms of which 3 ms to minimize.
[2024-06-01 02:57:56] [INFO ] Deduced a trap composed of 32 places in 93 ms of which 2 ms to minimize.
[2024-06-01 02:57:56] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 8/50 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-06-01 02:57:58] [INFO ] Deduced a trap composed of 40 places in 93 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 201/356 variables, 155/206 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/356 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 9 (OVERLAPS) 0/356 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 356/356 variables, and 206 constraints, problems are : Problem set: 0 solved, 200 unsolved in 22245 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 43/43 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 43/51 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 201/356 variables, 155/206 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/356 variables, 200/406 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-06-01 02:58:12] [INFO ] Deduced a trap composed of 40 places in 79 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/356 variables, 1/407 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/356 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 8 (OVERLAPS) 0/356 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 356/356 variables, and 407 constraints, problems are : Problem set: 0 solved, 200 unsolved in 17639 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 44/44 constraints]
After SMT, in 39981ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 39985ms
Finished structural reductions in LTL mode , in 1 iterations and 40339 ms. Remains : 155/155 places, 201/201 transitions.
Treatment of property AutonomousCar-PT-03b-LTLCardinality-01 finished in 133402 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 160/160 places, 206/206 transitions.
Graph (trivial) has 147 edges and 160 vertex of which 4 / 160 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 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 63 place count 157 transition count 141
Reduce places removed 62 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 1 with 86 rules applied. Total rules applied 149 place count 95 transition count 117
Reduce places removed 14 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 15 rules applied. Total rules applied 164 place count 81 transition count 116
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 165 place count 80 transition count 116
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 165 place count 80 transition count 109
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 179 place count 73 transition count 109
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 182 place count 70 transition count 106
Iterating global reduction 4 with 3 rules applied. Total rules applied 185 place count 70 transition count 106
Performed 28 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 241 place count 42 transition count 77
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 248 place count 35 transition count 55
Iterating global reduction 4 with 7 rules applied. Total rules applied 255 place count 35 transition count 55
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 258 place count 35 transition count 52
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 260 place count 34 transition count 51
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 264 place count 32 transition count 69
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 266 place count 30 transition count 67
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 267 place count 29 transition count 67
Applied a total of 267 rules in 37 ms. Remains 29 /160 variables (removed 131) and now considering 67/206 (removed 139) transitions.
// Phase 1: matrix 67 rows 29 cols
[2024-06-01 02:58:25] [INFO ] Computed 6 invariants in 1 ms
[2024-06-01 02:58:25] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-06-01 02:58:25] [INFO ] Invariant cache hit.
[2024-06-01 02:58:25] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 02:58:25] [INFO ] Implicit Places using invariants and state equation in 93 ms returned [23, 28]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 149 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 27/160 places, 67/206 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 25 transition count 65
Applied a total of 4 rules in 4 ms. Remains 25 /27 variables (removed 2) and now considering 65/67 (removed 2) transitions.
// Phase 1: matrix 65 rows 25 cols
[2024-06-01 02:58:25] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 02:58:25] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-06-01 02:58:25] [INFO ] Invariant cache hit.
[2024-06-01 02:58:25] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 02:58:25] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 25/160 places, 65/206 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 320 ms. Remains : 25/160 places, 65/206 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-03b-LTLCardinality-04
Stuttering criterion allowed to conclude after 42 steps with 6 reset in 0 ms.
FORMULA AutonomousCar-PT-03b-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03b-LTLCardinality-04 finished in 440 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 160/160 places, 206/206 transitions.
Graph (trivial) has 147 edges and 160 vertex of which 4 / 160 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 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 63 place count 157 transition count 141
Reduce places removed 62 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 1 with 86 rules applied. Total rules applied 149 place count 95 transition count 117
Reduce places removed 14 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 16 rules applied. Total rules applied 165 place count 81 transition count 115
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 167 place count 79 transition count 115
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 167 place count 79 transition count 109
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 179 place count 73 transition count 109
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 182 place count 70 transition count 106
Iterating global reduction 4 with 3 rules applied. Total rules applied 185 place count 70 transition count 106
Performed 28 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 241 place count 42 transition count 77
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 248 place count 35 transition count 55
Iterating global reduction 4 with 7 rules applied. Total rules applied 255 place count 35 transition count 55
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 258 place count 35 transition count 52
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 260 place count 34 transition count 51
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 264 place count 32 transition count 69
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 266 place count 30 transition count 67
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 267 place count 29 transition count 67
Applied a total of 267 rules in 28 ms. Remains 29 /160 variables (removed 131) and now considering 67/206 (removed 139) transitions.
// Phase 1: matrix 67 rows 29 cols
[2024-06-01 02:58:26] [INFO ] Computed 6 invariants in 3 ms
[2024-06-01 02:58:26] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-01 02:58:26] [INFO ] Invariant cache hit.
[2024-06-01 02:58:26] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-06-01 02:58:26] [INFO ] Implicit Places using invariants and state equation in 102 ms returned [23, 27]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 159 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 27/160 places, 67/206 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 25 transition count 65
Applied a total of 4 rules in 4 ms. Remains 25 /27 variables (removed 2) and now considering 65/67 (removed 2) transitions.
// Phase 1: matrix 65 rows 25 cols
[2024-06-01 02:58:26] [INFO ] Computed 4 invariants in 2 ms
[2024-06-01 02:58:26] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-06-01 02:58:26] [INFO ] Invariant cache hit.
[2024-06-01 02:58:26] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-06-01 02:58:26] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 25/160 places, 65/206 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 325 ms. Remains : 25/160 places, 65/206 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-03b-LTLCardinality-07
Stuttering criterion allowed to conclude after 56 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-03b-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03b-LTLCardinality-07 finished in 390 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 1 out of 160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 206/206 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 156 transition count 202
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 156 transition count 202
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 154 transition count 200
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 154 transition count 200
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 153 transition count 199
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 153 transition count 199
Applied a total of 14 rules in 6 ms. Remains 153 /160 variables (removed 7) and now considering 199/206 (removed 7) transitions.
// Phase 1: matrix 199 rows 153 cols
[2024-06-01 02:58:26] [INFO ] Computed 8 invariants in 2 ms
[2024-06-01 02:58:26] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-06-01 02:58:26] [INFO ] Invariant cache hit.
[2024-06-01 02:58:26] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
Running 198 sub problems to find dead transitions.
[2024-06-01 02:58:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-01 02:58:29] [INFO ] Deduced a trap composed of 26 places in 126 ms of which 3 ms to minimize.
[2024-06-01 02:58:29] [INFO ] Deduced a trap composed of 32 places in 153 ms of which 3 ms to minimize.
[2024-06-01 02:58:29] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 3 ms to minimize.
[2024-06-01 02:58:29] [INFO ] Deduced a trap composed of 14 places in 125 ms of which 3 ms to minimize.
[2024-06-01 02:58:29] [INFO ] Deduced a trap composed of 18 places in 120 ms of which 3 ms to minimize.
[2024-06-01 02:58:29] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 2 ms to minimize.
[2024-06-01 02:58:30] [INFO ] Deduced a trap composed of 31 places in 129 ms of which 3 ms to minimize.
[2024-06-01 02:58:30] [INFO ] Deduced a trap composed of 33 places in 104 ms of which 2 ms to minimize.
[2024-06-01 02:58:30] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 2 ms to minimize.
[2024-06-01 02:58:30] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 2 ms to minimize.
[2024-06-01 02:58:30] [INFO ] Deduced a trap composed of 33 places in 131 ms of which 2 ms to minimize.
[2024-06-01 02:58:30] [INFO ] Deduced a trap composed of 44 places in 128 ms of which 2 ms to minimize.
[2024-06-01 02:58:31] [INFO ] Deduced a trap composed of 36 places in 119 ms of which 2 ms to minimize.
[2024-06-01 02:58:31] [INFO ] Deduced a trap composed of 31 places in 97 ms of which 3 ms to minimize.
[2024-06-01 02:58:31] [INFO ] Deduced a trap composed of 40 places in 98 ms of which 3 ms to minimize.
[2024-06-01 02:58:31] [INFO ] Deduced a trap composed of 33 places in 102 ms of which 3 ms to minimize.
[2024-06-01 02:58:31] [INFO ] Deduced a trap composed of 41 places in 99 ms of which 3 ms to minimize.
[2024-06-01 02:58:32] [INFO ] Deduced a trap composed of 20 places in 136 ms of which 2 ms to minimize.
[2024-06-01 02:58:32] [INFO ] Deduced a trap composed of 10 places in 127 ms of which 2 ms to minimize.
[2024-06-01 02:58:32] [INFO ] Deduced a trap composed of 5 places in 134 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-01 02:58:32] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 3 ms to minimize.
[2024-06-01 02:58:32] [INFO ] Deduced a trap composed of 42 places in 89 ms of which 2 ms to minimize.
[2024-06-01 02:58:32] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 3 ms to minimize.
[2024-06-01 02:58:33] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 2 ms to minimize.
[2024-06-01 02:58:33] [INFO ] Deduced a trap composed of 36 places in 88 ms of which 3 ms to minimize.
[2024-06-01 02:58:33] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 2 ms to minimize.
[2024-06-01 02:58:33] [INFO ] Deduced a trap composed of 41 places in 62 ms of which 2 ms to minimize.
[2024-06-01 02:58:33] [INFO ] Deduced a trap composed of 41 places in 82 ms of which 3 ms to minimize.
[2024-06-01 02:58:33] [INFO ] Deduced a trap composed of 32 places in 97 ms of which 3 ms to minimize.
[2024-06-01 02:58:33] [INFO ] Deduced a trap composed of 41 places in 78 ms of which 2 ms to minimize.
[2024-06-01 02:58:34] [INFO ] Deduced a trap composed of 44 places in 105 ms of which 3 ms to minimize.
[2024-06-01 02:58:34] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 12/40 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-01 02:58:36] [INFO ] Deduced a trap composed of 39 places in 89 ms of which 2 ms to minimize.
[2024-06-01 02:58:36] [INFO ] Deduced a trap composed of 32 places in 105 ms of which 2 ms to minimize.
[2024-06-01 02:58:36] [INFO ] Deduced a trap composed of 41 places in 66 ms of which 2 ms to minimize.
[2024-06-01 02:58:37] [INFO ] Deduced a trap composed of 40 places in 65 ms of which 2 ms to minimize.
[2024-06-01 02:58:37] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 5/45 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (OVERLAPS) 199/352 variables, 153/198 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-01 02:58:41] [INFO ] Deduced a trap composed of 21 places in 102 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 9 (OVERLAPS) 0/352 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 352/352 variables, and 199 constraints, problems are : Problem set: 0 solved, 198 unsolved in 22460 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 38/38 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 38/46 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-01 02:58:50] [INFO ] Deduced a trap composed of 25 places in 94 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-01 02:58:53] [INFO ] Deduced a trap composed of 32 places in 101 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (OVERLAPS) 199/352 variables, 153/201 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 198/399 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-01 02:58:56] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 1/400 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/352 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 10 (OVERLAPS) 0/352 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Int declared 352/352 variables, and 400 constraints, problems are : Problem set: 0 solved, 198 unsolved in 21249 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 41/41 constraints]
After SMT, in 43804ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 43809ms
Starting structural reductions in LTL mode, iteration 1 : 153/160 places, 199/206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44121 ms. Remains : 153/160 places, 199/206 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : AutonomousCar-PT-03b-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-03b-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03b-LTLCardinality-08 finished in 44227 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 3 out of 160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 206/206 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 157 transition count 203
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 157 transition count 203
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 155 transition count 201
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 155 transition count 201
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 154 transition count 200
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 154 transition count 200
Applied a total of 12 rules in 6 ms. Remains 154 /160 variables (removed 6) and now considering 200/206 (removed 6) transitions.
// Phase 1: matrix 200 rows 154 cols
[2024-06-01 02:59:10] [INFO ] Computed 8 invariants in 2 ms
[2024-06-01 02:59:10] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-06-01 02:59:10] [INFO ] Invariant cache hit.
[2024-06-01 02:59:10] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
Running 199 sub problems to find dead transitions.
[2024-06-01 02:59:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-06-01 02:59:13] [INFO ] Deduced a trap composed of 26 places in 138 ms of which 3 ms to minimize.
[2024-06-01 02:59:13] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 2 ms to minimize.
[2024-06-01 02:59:13] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 2 ms to minimize.
[2024-06-01 02:59:13] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 1 ms to minimize.
[2024-06-01 02:59:13] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 2 ms to minimize.
[2024-06-01 02:59:13] [INFO ] Deduced a trap composed of 41 places in 64 ms of which 2 ms to minimize.
[2024-06-01 02:59:14] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 3 ms to minimize.
[2024-06-01 02:59:14] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 2 ms to minimize.
[2024-06-01 02:59:14] [INFO ] Deduced a trap composed of 33 places in 106 ms of which 3 ms to minimize.
[2024-06-01 02:59:14] [INFO ] Deduced a trap composed of 21 places in 135 ms of which 3 ms to minimize.
[2024-06-01 02:59:14] [INFO ] Deduced a trap composed of 25 places in 121 ms of which 2 ms to minimize.
[2024-06-01 02:59:14] [INFO ] Deduced a trap composed of 14 places in 122 ms of which 3 ms to minimize.
[2024-06-01 02:59:15] [INFO ] Deduced a trap composed of 33 places in 90 ms of which 3 ms to minimize.
[2024-06-01 02:59:15] [INFO ] Deduced a trap composed of 35 places in 105 ms of which 2 ms to minimize.
[2024-06-01 02:59:15] [INFO ] Deduced a trap composed of 31 places in 103 ms of which 3 ms to minimize.
[2024-06-01 02:59:15] [INFO ] Deduced a trap composed of 44 places in 104 ms of which 3 ms to minimize.
[2024-06-01 02:59:16] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 2 ms to minimize.
[2024-06-01 02:59:16] [INFO ] Deduced a trap composed of 37 places in 120 ms of which 2 ms to minimize.
[2024-06-01 02:59:16] [INFO ] Deduced a trap composed of 22 places in 107 ms of which 2 ms to minimize.
[2024-06-01 02:59:16] [INFO ] Deduced a trap composed of 5 places in 113 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-06-01 02:59:16] [INFO ] Deduced a trap composed of 33 places in 113 ms of which 2 ms to minimize.
[2024-06-01 02:59:16] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 2 ms to minimize.
[2024-06-01 02:59:17] [INFO ] Deduced a trap composed of 40 places in 72 ms of which 2 ms to minimize.
[2024-06-01 02:59:17] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 4 ms to minimize.
[2024-06-01 02:59:17] [INFO ] Deduced a trap composed of 31 places in 119 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 5/33 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-06-01 02:59:19] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 2 ms to minimize.
[2024-06-01 02:59:20] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 2 ms to minimize.
[2024-06-01 02:59:20] [INFO ] Deduced a trap composed of 41 places in 70 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-06-01 02:59:21] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 2 ms to minimize.
[2024-06-01 02:59:21] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 10 ms to minimize.
[2024-06-01 02:59:22] [INFO ] Deduced a trap composed of 44 places in 91 ms of which 4 ms to minimize.
[2024-06-01 02:59:22] [INFO ] Deduced a trap composed of 33 places in 91 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-06-01 02:59:23] [INFO ] Deduced a trap composed of 31 places in 102 ms of which 2 ms to minimize.
[2024-06-01 02:59:23] [INFO ] Deduced a trap composed of 31 places in 115 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-06-01 02:59:25] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 2 ms to minimize.
[2024-06-01 02:59:26] [INFO ] Deduced a trap composed of 39 places in 92 ms of which 2 ms to minimize.
[2024-06-01 02:59:26] [INFO ] Deduced a trap composed of 40 places in 117 ms of which 2 ms to minimize.
[2024-06-01 02:59:26] [INFO ] Deduced a trap composed of 32 places in 116 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 9 (OVERLAPS) 200/354 variables, 154/200 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-06-01 02:59:31] [INFO ] Deduced a trap composed of 41 places in 78 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/354 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/354 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 12 (OVERLAPS) 0/354 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 199 unsolved
No progress, stopping.
After SMT solving in domain Real declared 354/354 variables, and 201 constraints, problems are : Problem set: 0 solved, 199 unsolved in 27965 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 39/39 constraints]
Escalating to Integer solving :Problem set: 0 solved, 199 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 39/47 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-06-01 02:59:40] [INFO ] Deduced a trap composed of 39 places in 92 ms of which 3 ms to minimize.
[2024-06-01 02:59:41] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (OVERLAPS) 200/354 variables, 154/203 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 199/402 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 8 (OVERLAPS) 0/354 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 199 unsolved
No progress, stopping.
After SMT solving in domain Int declared 354/354 variables, and 402 constraints, problems are : Problem set: 0 solved, 199 unsolved in 13026 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 41/41 constraints]
After SMT, in 41077ms problems are : Problem set: 0 solved, 199 unsolved
Search for dead transitions found 0 dead transitions in 41081ms
Starting structural reductions in LTL mode, iteration 1 : 154/160 places, 200/206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41449 ms. Remains : 154/160 places, 200/206 transitions.
Stuttering acceptance computed with spot in 141 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-03b-LTLCardinality-15
Product exploration explored 100000 steps with 5 reset in 124 ms.
Product exploration explored 100000 steps with 1 reset in 285 ms.
Computed a total of 33 stabilizing places and 33 stable transitions
Computed a total of 33 stabilizing places and 33 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 107 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 30643 steps (33 resets) in 71 ms. (425 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 138 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 160 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 200/200 transitions.
Applied a total of 0 rules in 2 ms. Remains 154 /154 variables (removed 0) and now considering 200/200 (removed 0) transitions.
[2024-06-01 02:59:53] [INFO ] Invariant cache hit.
[2024-06-01 02:59:53] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-06-01 02:59:53] [INFO ] Invariant cache hit.
[2024-06-01 02:59:53] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
Running 199 sub problems to find dead transitions.
[2024-06-01 02:59:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-06-01 02:59:56] [INFO ] Deduced a trap composed of 26 places in 120 ms of which 4 ms to minimize.
[2024-06-01 02:59:56] [INFO ] Deduced a trap composed of 17 places in 152 ms of which 3 ms to minimize.
[2024-06-01 02:59:56] [INFO ] Deduced a trap composed of 17 places in 135 ms of which 2 ms to minimize.
[2024-06-01 02:59:56] [INFO ] Deduced a trap composed of 33 places in 126 ms of which 3 ms to minimize.
[2024-06-01 02:59:57] [INFO ] Deduced a trap composed of 30 places in 123 ms of which 2 ms to minimize.
[2024-06-01 02:59:57] [INFO ] Deduced a trap composed of 41 places in 116 ms of which 3 ms to minimize.
[2024-06-01 02:59:57] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 2 ms to minimize.
[2024-06-01 02:59:57] [INFO ] Deduced a trap composed of 32 places in 118 ms of which 3 ms to minimize.
[2024-06-01 02:59:57] [INFO ] Deduced a trap composed of 33 places in 110 ms of which 2 ms to minimize.
[2024-06-01 02:59:57] [INFO ] Deduced a trap composed of 21 places in 111 ms of which 3 ms to minimize.
[2024-06-01 02:59:57] [INFO ] Deduced a trap composed of 25 places in 139 ms of which 2 ms to minimize.
[2024-06-01 02:59:58] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 2 ms to minimize.
[2024-06-01 02:59:58] [INFO ] Deduced a trap composed of 33 places in 104 ms of which 2 ms to minimize.
[2024-06-01 02:59:58] [INFO ] Deduced a trap composed of 35 places in 118 ms of which 2 ms to minimize.
[2024-06-01 02:59:58] [INFO ] Deduced a trap composed of 31 places in 104 ms of which 3 ms to minimize.
[2024-06-01 02:59:59] [INFO ] Deduced a trap composed of 44 places in 113 ms of which 2 ms to minimize.
[2024-06-01 02:59:59] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 2 ms to minimize.
[2024-06-01 02:59:59] [INFO ] Deduced a trap composed of 37 places in 109 ms of which 2 ms to minimize.
[2024-06-01 02:59:59] [INFO ] Deduced a trap composed of 22 places in 111 ms of which 2 ms to minimize.
[2024-06-01 02:59:59] [INFO ] Deduced a trap composed of 5 places in 131 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-06-01 03:00:00] [INFO ] Deduced a trap composed of 33 places in 127 ms of which 2 ms to minimize.
[2024-06-01 03:00:00] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 2 ms to minimize.
[2024-06-01 03:00:00] [INFO ] Deduced a trap composed of 40 places in 77 ms of which 2 ms to minimize.
[2024-06-01 03:00:00] [INFO ] Deduced a trap composed of 40 places in 82 ms of which 2 ms to minimize.
[2024-06-01 03:00:01] [INFO ] Deduced a trap composed of 31 places in 129 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 5/33 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-06-01 03:00:02] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 3 ms to minimize.
[2024-06-01 03:00:03] [INFO ] Deduced a trap composed of 41 places in 82 ms of which 2 ms to minimize.
[2024-06-01 03:00:03] [INFO ] Deduced a trap composed of 41 places in 70 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-06-01 03:00:05] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 3 ms to minimize.
[2024-06-01 03:00:05] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 2 ms to minimize.
[2024-06-01 03:00:05] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 2 ms to minimize.
[2024-06-01 03:00:05] [INFO ] Deduced a trap composed of 33 places in 107 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-06-01 03:00:06] [INFO ] Deduced a trap composed of 31 places in 127 ms of which 3 ms to minimize.
[2024-06-01 03:00:07] [INFO ] Deduced a trap composed of 31 places in 146 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-06-01 03:00:09] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 2 ms to minimize.
[2024-06-01 03:00:09] [INFO ] Deduced a trap composed of 39 places in 88 ms of which 3 ms to minimize.
[2024-06-01 03:00:09] [INFO ] Deduced a trap composed of 40 places in 125 ms of which 2 ms to minimize.
[2024-06-01 03:00:10] [INFO ] Deduced a trap composed of 32 places in 117 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 9 (OVERLAPS) 200/354 variables, 154/200 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-06-01 03:00:15] [INFO ] Deduced a trap composed of 41 places in 85 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/354 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/354 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 12 (OVERLAPS) 0/354 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 199 unsolved
No progress, stopping.
After SMT solving in domain Real declared 354/354 variables, and 201 constraints, problems are : Problem set: 0 solved, 199 unsolved in 28462 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 39/39 constraints]
Escalating to Integer solving :Problem set: 0 solved, 199 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 39/47 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-06-01 03:00:24] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 1 ms to minimize.
[2024-06-01 03:00:24] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (OVERLAPS) 200/354 variables, 154/203 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 199/402 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 8 (OVERLAPS) 0/354 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 199 unsolved
No progress, stopping.
After SMT solving in domain Int declared 354/354 variables, and 402 constraints, problems are : Problem set: 0 solved, 199 unsolved in 13841 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 41/41 constraints]
After SMT, in 42392ms problems are : Problem set: 0 solved, 199 unsolved
Search for dead transitions found 0 dead transitions in 42395ms
Finished structural reductions in LTL mode , in 1 iterations and 42766 ms. Remains : 154/154 places, 200/200 transitions.
Computed a total of 33 stabilizing places and 33 stable transitions
Computed a total of 33 stabilizing places and 33 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 73 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (38 resets) in 57 ms. (689 steps per ms) remains 1/1 properties
BEST_FIRST walk for 31930 steps (19 resets) in 37 ms. (840 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 90 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 160 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 160 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 11 reset in 135 ms.
Product exploration explored 100000 steps with 5 reset in 163 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 178 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 154 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 154/154 places, 200/200 transitions.
Graph (trivial) has 139 edges and 154 vertex of which 4 / 154 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 59 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 59 rules applied. Total rules applied 60 place count 152 transition count 198
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 69 place count 152 transition count 189
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 69 place count 152 transition count 189
Deduced a syphon composed of 72 places in 1 ms
Iterating global reduction 2 with 13 rules applied. Total rules applied 82 place count 152 transition count 189
Discarding 51 places :
Symmetric choice reduction at 2 with 51 rule applications. Total rules 133 place count 101 transition count 138
Deduced a syphon composed of 22 places in 0 ms
Iterating global reduction 2 with 51 rules applied. Total rules applied 184 place count 101 transition count 138
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 58 places in 0 ms
Iterating global reduction 2 with 36 rules applied. Total rules applied 220 place count 101 transition count 141
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 254 place count 67 transition count 92
Deduced a syphon composed of 31 places in 0 ms
Iterating global reduction 2 with 34 rules applied. Total rules applied 288 place count 67 transition count 92
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 294 place count 67 transition count 86
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 297 place count 64 transition count 83
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 3 with 3 rules applied. Total rules applied 300 place count 64 transition count 83
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 304 place count 64 transition count 113
Deduced a syphon composed of 32 places in 0 ms
Applied a total of 304 rules in 39 ms. Remains 64 /154 variables (removed 90) and now considering 113/200 (removed 87) transitions.
[2024-06-01 03:00:37] [INFO ] Redundant transitions in 4 ms returned []
Running 112 sub problems to find dead transitions.
// Phase 1: matrix 113 rows 64 cols
[2024-06-01 03:00:37] [INFO ] Computed 7 invariants in 1 ms
[2024-06-01 03:00:37] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-06-01 03:00:38] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
[2024-06-01 03:00:38] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 2 ms to minimize.
[2024-06-01 03:00:39] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2024-06-01 03:00:39] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 2 ms to minimize.
[2024-06-01 03:00:39] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
[2024-06-01 03:00:39] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 2 ms to minimize.
Problem TDEAD11 is UNSAT
[2024-06-01 03:00:39] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 2 ms to minimize.
Problem TDEAD13 is UNSAT
[2024-06-01 03:00:39] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-06-01 03:00:39] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 1 ms to minimize.
Problem TDEAD18 is UNSAT
Problem TDEAD21 is UNSAT
[2024-06-01 03:00:39] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
[2024-06-01 03:00:39] [INFO ] Deduced a trap composed of 2 places in 64 ms of which 1 ms to minimize.
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 11/18 constraints. Problems are: Problem set: 32 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/18 constraints. Problems are: Problem set: 32 solved, 80 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
At refinement iteration 4 (OVERLAPS) 112/176 variables, 64/82 constraints. Problems are: Problem set: 42 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 38/120 constraints. Problems are: Problem set: 42 solved, 70 unsolved
[2024-06-01 03:00:40] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/176 variables, 1/121 constraints. Problems are: Problem set: 42 solved, 70 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/176 variables, 0/121 constraints. Problems are: Problem set: 42 solved, 70 unsolved
At refinement iteration 8 (OVERLAPS) 1/177 variables, 1/122 constraints. Problems are: Problem set: 42 solved, 70 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/177 variables, 0/122 constraints. Problems are: Problem set: 42 solved, 70 unsolved
At refinement iteration 10 (OVERLAPS) 0/177 variables, 0/122 constraints. Problems are: Problem set: 42 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 177/177 variables, and 122 constraints, problems are : Problem set: 42 solved, 70 unsolved in 4273 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 64/64 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 42 solved, 70 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 42 solved, 70 unsolved
At refinement iteration 1 (OVERLAPS) 33/64 variables, 7/7 constraints. Problems are: Problem set: 42 solved, 70 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 12/19 constraints. Problems are: Problem set: 42 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/19 constraints. Problems are: Problem set: 42 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 112/176 variables, 64/83 constraints. Problems are: Problem set: 42 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 38/121 constraints. Problems are: Problem set: 42 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/176 variables, 70/191 constraints. Problems are: Problem set: 42 solved, 70 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/176 variables, 0/191 constraints. Problems are: Problem set: 42 solved, 70 unsolved
At refinement iteration 8 (OVERLAPS) 1/177 variables, 1/192 constraints. Problems are: Problem set: 42 solved, 70 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/177 variables, 0/192 constraints. Problems are: Problem set: 42 solved, 70 unsolved
At refinement iteration 10 (OVERLAPS) 0/177 variables, 0/192 constraints. Problems are: Problem set: 42 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 177/177 variables, and 192 constraints, problems are : Problem set: 42 solved, 70 unsolved in 4013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 64/64 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 70/112 constraints, Known Traps: 12/12 constraints]
After SMT, in 8448ms problems are : Problem set: 42 solved, 70 unsolved
Search for dead transitions found 42 dead transitions in 8451ms
Found 42 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 42 transitions
Dead transitions reduction (with SMT) removed 42 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 64/154 places, 71/200 transitions.
Graph (complete) has 191 edges and 64 vertex of which 32 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.0 ms
Discarding 32 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 32 /64 variables (removed 32) and now considering 71/71 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 32/154 places, 71/200 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 8540 ms. Remains : 32/154 places, 71/200 transitions.
Support contains 3 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 200/200 transitions.
Applied a total of 0 rules in 1 ms. Remains 154 /154 variables (removed 0) and now considering 200/200 (removed 0) transitions.
// Phase 1: matrix 200 rows 154 cols
[2024-06-01 03:00:46] [INFO ] Computed 8 invariants in 2 ms
[2024-06-01 03:00:46] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-06-01 03:00:46] [INFO ] Invariant cache hit.
[2024-06-01 03:00:46] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
Running 199 sub problems to find dead transitions.
[2024-06-01 03:00:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-06-01 03:00:48] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 2 ms to minimize.
[2024-06-01 03:00:48] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 2 ms to minimize.
[2024-06-01 03:00:48] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 2 ms to minimize.
[2024-06-01 03:00:48] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 1 ms to minimize.
[2024-06-01 03:00:48] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 2 ms to minimize.
[2024-06-01 03:00:48] [INFO ] Deduced a trap composed of 41 places in 72 ms of which 1 ms to minimize.
[2024-06-01 03:00:48] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 2 ms to minimize.
[2024-06-01 03:00:49] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 2 ms to minimize.
[2024-06-01 03:00:49] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 2 ms to minimize.
[2024-06-01 03:00:49] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 2 ms to minimize.
[2024-06-01 03:00:49] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 2 ms to minimize.
[2024-06-01 03:00:49] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 2 ms to minimize.
[2024-06-01 03:00:49] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 1 ms to minimize.
[2024-06-01 03:00:49] [INFO ] Deduced a trap composed of 35 places in 125 ms of which 2 ms to minimize.
[2024-06-01 03:00:50] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 2 ms to minimize.
[2024-06-01 03:00:50] [INFO ] Deduced a trap composed of 44 places in 102 ms of which 2 ms to minimize.
[2024-06-01 03:00:50] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 2 ms to minimize.
[2024-06-01 03:00:50] [INFO ] Deduced a trap composed of 37 places in 122 ms of which 3 ms to minimize.
[2024-06-01 03:00:50] [INFO ] Deduced a trap composed of 22 places in 125 ms of which 2 ms to minimize.
[2024-06-01 03:00:50] [INFO ] Deduced a trap composed of 5 places in 126 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-06-01 03:00:51] [INFO ] Deduced a trap composed of 33 places in 108 ms of which 2 ms to minimize.
[2024-06-01 03:00:51] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 2 ms to minimize.
[2024-06-01 03:00:51] [INFO ] Deduced a trap composed of 40 places in 68 ms of which 2 ms to minimize.
[2024-06-01 03:00:52] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 2 ms to minimize.
[2024-06-01 03:00:52] [INFO ] Deduced a trap composed of 31 places in 126 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 5/33 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-06-01 03:00:53] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 2 ms to minimize.
[2024-06-01 03:00:54] [INFO ] Deduced a trap composed of 41 places in 53 ms of which 2 ms to minimize.
[2024-06-01 03:00:54] [INFO ] Deduced a trap composed of 41 places in 54 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-06-01 03:00:55] [INFO ] Deduced a trap composed of 31 places in 112 ms of which 2 ms to minimize.
[2024-06-01 03:00:56] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 2 ms to minimize.
[2024-06-01 03:00:56] [INFO ] Deduced a trap composed of 44 places in 96 ms of which 2 ms to minimize.
[2024-06-01 03:00:56] [INFO ] Deduced a trap composed of 33 places in 91 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-06-01 03:00:57] [INFO ] Deduced a trap composed of 31 places in 122 ms of which 3 ms to minimize.
[2024-06-01 03:00:57] [INFO ] Deduced a trap composed of 31 places in 119 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-06-01 03:00:59] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 2 ms to minimize.
[2024-06-01 03:01:00] [INFO ] Deduced a trap composed of 39 places in 88 ms of which 2 ms to minimize.
[2024-06-01 03:01:00] [INFO ] Deduced a trap composed of 40 places in 132 ms of which 2 ms to minimize.
[2024-06-01 03:01:00] [INFO ] Deduced a trap composed of 32 places in 124 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 9 (OVERLAPS) 200/354 variables, 154/200 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-06-01 03:01:05] [INFO ] Deduced a trap composed of 41 places in 81 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/354 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/354 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 12 (OVERLAPS) 0/354 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 199 unsolved
No progress, stopping.
After SMT solving in domain Real declared 354/354 variables, and 201 constraints, problems are : Problem set: 0 solved, 199 unsolved in 24946 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 39/39 constraints]
Escalating to Integer solving :Problem set: 0 solved, 199 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 39/47 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-06-01 03:01:12] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 2 ms to minimize.
[2024-06-01 03:01:12] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (OVERLAPS) 200/354 variables, 154/203 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 199/402 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 8 (OVERLAPS) 0/354 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 199 unsolved
No progress, stopping.
After SMT solving in domain Int declared 354/354 variables, and 402 constraints, problems are : Problem set: 0 solved, 199 unsolved in 14870 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 41/41 constraints]
After SMT, in 39871ms problems are : Problem set: 0 solved, 199 unsolved
Search for dead transitions found 0 dead transitions in 39875ms
Finished structural reductions in LTL mode , in 1 iterations and 40118 ms. Remains : 154/154 places, 200/200 transitions.
Treatment of property AutonomousCar-PT-03b-LTLCardinality-15 finished in 135744 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Found a Shortening insensitive property : AutonomousCar-PT-03b-LTLCardinality-01
Stuttering acceptance computed with spot in 162 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 160 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 160/160 places, 206/206 transitions.
Graph (trivial) has 147 edges and 160 vertex of which 4 / 160 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 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 64 place count 157 transition count 140
Reduce places removed 63 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 1 with 87 rules applied. Total rules applied 151 place count 94 transition count 116
Reduce places removed 14 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 15 rules applied. Total rules applied 166 place count 80 transition count 115
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 167 place count 79 transition count 115
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 167 place count 79 transition count 108
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 181 place count 72 transition count 108
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 183 place count 70 transition count 106
Iterating global reduction 4 with 2 rules applied. Total rules applied 185 place count 70 transition count 106
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 241 place count 42 transition count 78
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 248 place count 35 transition count 56
Iterating global reduction 4 with 7 rules applied. Total rules applied 255 place count 35 transition count 56
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 258 place count 35 transition count 53
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 260 place count 34 transition count 52
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 264 place count 32 transition count 70
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 265 place count 32 transition count 70
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 267 place count 30 transition count 68
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 268 place count 29 transition count 68
Applied a total of 268 rules in 38 ms. Remains 29 /160 variables (removed 131) and now considering 68/206 (removed 138) transitions.
// Phase 1: matrix 68 rows 29 cols
[2024-06-01 03:01:26] [INFO ] Computed 6 invariants in 1 ms
[2024-06-01 03:01:26] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-06-01 03:01:26] [INFO ] Invariant cache hit.
[2024-06-01 03:01:26] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-06-01 03:01:26] [INFO ] Implicit Places using invariants and state equation in 174 ms returned [23, 28]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 251 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 27/160 places, 68/206 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 25 transition count 66
Applied a total of 4 rules in 5 ms. Remains 25 /27 variables (removed 2) and now considering 66/68 (removed 2) transitions.
// Phase 1: matrix 66 rows 25 cols
[2024-06-01 03:01:27] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 03:01:27] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-06-01 03:01:27] [INFO ] Invariant cache hit.
[2024-06-01 03:01:27] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-06-01 03:01:27] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 25/160 places, 66/206 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 521 ms. Remains : 25/160 places, 66/206 transitions.
Running random walk in product with property : AutonomousCar-PT-03b-LTLCardinality-01
Product exploration explored 100000 steps with 25000 reset in 206 ms.
Product exploration explored 100000 steps with 25000 reset in 275 ms.
Computed a total of 2 stabilizing places and 4 stable transitions
Computed a total of 2 stabilizing places and 4 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 71 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 165 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 101 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 167 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 179 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 66/66 transitions.
Applied a total of 0 rules in 0 ms. Remains 25 /25 variables (removed 0) and now considering 66/66 (removed 0) transitions.
[2024-06-01 03:01:28] [INFO ] Invariant cache hit.
[2024-06-01 03:01:28] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-01 03:01:28] [INFO ] Invariant cache hit.
[2024-06-01 03:01:28] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-06-01 03:01:28] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
Running 65 sub problems to find dead transitions.
[2024-06-01 03:01:28] [INFO ] Invariant cache hit.
[2024-06-01 03:01:28] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 1/25 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 65 unsolved
[2024-06-01 03:01:28] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (OVERLAPS) 65/90 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 8/38 constraints. Problems are: Problem set: 0 solved, 65 unsolved
[2024-06-01 03:01:29] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/90 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 9 (OVERLAPS) 1/91 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/91 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 11 (OVERLAPS) 0/91 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 91/91 variables, and 40 constraints, problems are : Problem set: 0 solved, 65 unsolved in 1892 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 25/25 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (OVERLAPS) 1/25 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (OVERLAPS) 65/90 variables, 25/31 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 8/39 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 65/104 constraints. Problems are: Problem set: 0 solved, 65 unsolved
[2024-06-01 03:01:31] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/90 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 65 unsolved
[2024-06-01 03:01:31] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/90 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/90 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 11 (OVERLAPS) 1/91 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/91 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 13 (OVERLAPS) 0/91 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 91/91 variables, and 107 constraints, problems are : Problem set: 0 solved, 65 unsolved in 3353 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 25/25 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 4/4 constraints]
After SMT, in 5324ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 5326ms
Finished structural reductions in LTL mode , in 1 iterations and 5474 ms. Remains : 25/25 places, 66/66 transitions.
Computed a total of 2 stabilizing places and 4 stable transitions
Computed a total of 2 stabilizing places and 4 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 99 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 186 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 124 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 186 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 182 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 190 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 476 ms.
Product exploration explored 100000 steps with 25000 reset in 448 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 66/66 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 66/66 (removed 0) transitions.
[2024-06-01 03:01:36] [INFO ] Redundant transitions in 16 ms returned []
Running 65 sub problems to find dead transitions.
[2024-06-01 03:01:36] [INFO ] Invariant cache hit.
[2024-06-01 03:01:36] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 1/25 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 65 unsolved
[2024-06-01 03:01:36] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (OVERLAPS) 65/90 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 8/38 constraints. Problems are: Problem set: 0 solved, 65 unsolved
[2024-06-01 03:01:36] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/90 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 9 (OVERLAPS) 1/91 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/91 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 11 (OVERLAPS) 0/91 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 91/91 variables, and 40 constraints, problems are : Problem set: 0 solved, 65 unsolved in 1912 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 25/25 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (OVERLAPS) 1/25 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (OVERLAPS) 65/90 variables, 25/31 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 8/39 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 65/104 constraints. Problems are: Problem set: 0 solved, 65 unsolved
[2024-06-01 03:01:38] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/90 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 65 unsolved
[2024-06-01 03:01:39] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/90 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/90 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 11 (OVERLAPS) 1/91 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/91 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 13 (OVERLAPS) 0/91 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 91/91 variables, and 107 constraints, problems are : Problem set: 0 solved, 65 unsolved in 3480 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 25/25 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 4/4 constraints]
After SMT, in 5471ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 5472ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 5496 ms. Remains : 25/25 places, 66/66 transitions.
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 66/66 transitions.
Applied a total of 0 rules in 0 ms. Remains 25 /25 variables (removed 0) and now considering 66/66 (removed 0) transitions.
[2024-06-01 03:01:41] [INFO ] Invariant cache hit.
[2024-06-01 03:01:41] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-01 03:01:41] [INFO ] Invariant cache hit.
[2024-06-01 03:01:41] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-06-01 03:01:41] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
Running 65 sub problems to find dead transitions.
[2024-06-01 03:01:41] [INFO ] Invariant cache hit.
[2024-06-01 03:01:41] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 1/25 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 65 unsolved
[2024-06-01 03:01:42] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (OVERLAPS) 65/90 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 8/38 constraints. Problems are: Problem set: 0 solved, 65 unsolved
[2024-06-01 03:01:43] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/90 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 9 (OVERLAPS) 1/91 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/91 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 11 (OVERLAPS) 0/91 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 91/91 variables, and 40 constraints, problems are : Problem set: 0 solved, 65 unsolved in 1986 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 25/25 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (OVERLAPS) 1/25 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (OVERLAPS) 65/90 variables, 25/31 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 8/39 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 65/104 constraints. Problems are: Problem set: 0 solved, 65 unsolved
[2024-06-01 03:01:44] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/90 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 65 unsolved
[2024-06-01 03:01:44] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/90 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/90 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 11 (OVERLAPS) 1/91 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/91 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 13 (OVERLAPS) 0/91 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 91/91 variables, and 107 constraints, problems are : Problem set: 0 solved, 65 unsolved in 3298 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 25/25 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 4/4 constraints]
After SMT, in 5381ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 5382ms
Finished structural reductions in LTL mode , in 1 iterations and 5527 ms. Remains : 25/25 places, 66/66 transitions.
Treatment of property AutonomousCar-PT-03b-LTLCardinality-01 finished in 20791 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Found a Lengthening insensitive property : AutonomousCar-PT-03b-LTLCardinality-15
Stuttering acceptance computed with spot in 138 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 160 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 160/160 places, 206/206 transitions.
Graph (trivial) has 145 edges and 160 vertex of which 4 / 160 are part of one of the 2 SCC in 0 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 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 65 place count 157 transition count 139
Reduce places removed 64 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 1 with 86 rules applied. Total rules applied 151 place count 93 transition count 117
Reduce places removed 13 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 14 rules applied. Total rules applied 165 place count 80 transition count 116
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 166 place count 79 transition count 116
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 166 place count 79 transition count 109
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 180 place count 72 transition count 109
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 182 place count 70 transition count 107
Iterating global reduction 4 with 2 rules applied. Total rules applied 184 place count 70 transition count 107
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 54 rules applied. Total rules applied 238 place count 43 transition count 80
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 245 place count 36 transition count 58
Iterating global reduction 4 with 7 rules applied. Total rules applied 252 place count 36 transition count 58
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 255 place count 36 transition count 55
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 257 place count 35 transition count 54
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 261 place count 33 transition count 72
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 262 place count 33 transition count 72
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 264 place count 31 transition count 70
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 265 place count 30 transition count 70
Applied a total of 265 rules in 26 ms. Remains 30 /160 variables (removed 130) and now considering 70/206 (removed 136) transitions.
// Phase 1: matrix 70 rows 30 cols
[2024-06-01 03:01:47] [INFO ] Computed 6 invariants in 1 ms
[2024-06-01 03:01:47] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-06-01 03:01:47] [INFO ] Invariant cache hit.
[2024-06-01 03:01:47] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 03:01:47] [INFO ] Implicit Places using invariants and state equation in 100 ms returned [24, 29]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 165 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 28/160 places, 70/206 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 26 transition count 68
Applied a total of 4 rules in 2 ms. Remains 26 /28 variables (removed 2) and now considering 68/70 (removed 2) transitions.
// Phase 1: matrix 68 rows 26 cols
[2024-06-01 03:01:47] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 03:01:47] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-01 03:01:47] [INFO ] Invariant cache hit.
[2024-06-01 03:01:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 03:01:47] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 26/160 places, 68/206 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 339 ms. Remains : 26/160 places, 68/206 transitions.
Running random walk in product with property : AutonomousCar-PT-03b-LTLCardinality-15
Product exploration explored 100000 steps with 4 reset in 94 ms.
Product exploration explored 100000 steps with 1 reset in 90 ms.
Computed a total of 0 stabilizing places and 2 stable transitions
Computed a total of 0 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 187 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 2481 steps (187 resets) in 39 ms. (62 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 86 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 68/68 transitions.
Applied a total of 0 rules in 0 ms. Remains 26 /26 variables (removed 0) and now considering 68/68 (removed 0) transitions.
[2024-06-01 03:01:48] [INFO ] Invariant cache hit.
[2024-06-01 03:01:48] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-06-01 03:01:48] [INFO ] Invariant cache hit.
[2024-06-01 03:01:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 03:01:48] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
Running 67 sub problems to find dead transitions.
[2024-06-01 03:01:48] [INFO ] Invariant cache hit.
[2024-06-01 03:01:48] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (OVERLAPS) 1/26 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 4 (OVERLAPS) 67/93 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 67 unsolved
[2024-06-01 03:01:49] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (OVERLAPS) 1/94 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/94 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 9 (OVERLAPS) 0/94 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Real declared 94/94 variables, and 32 constraints, problems are : Problem set: 0 solved, 67 unsolved in 1932 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 26/26 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 67 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (OVERLAPS) 1/26 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 5 (OVERLAPS) 67/93 variables, 26/31 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 67/98 constraints. Problems are: Problem set: 0 solved, 67 unsolved
[2024-06-01 03:01:51] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 0 ms to minimize.
[2024-06-01 03:01:51] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 1 ms to minimize.
[2024-06-01 03:01:51] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 3/101 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/93 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 9 (OVERLAPS) 1/94 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/94 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 11 (OVERLAPS) 0/94 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Int declared 94/94 variables, and 102 constraints, problems are : Problem set: 0 solved, 67 unsolved in 3607 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 26/26 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 4/4 constraints]
After SMT, in 5613ms problems are : Problem set: 0 solved, 67 unsolved
Search for dead transitions found 0 dead transitions in 5614ms
Finished structural reductions in LTL mode , in 1 iterations and 5739 ms. Remains : 26/26 places, 68/68 transitions.
Computed a total of 0 stabilizing places and 2 stable transitions
Computed a total of 0 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 110 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 1630 steps (113 resets) in 9 ms. (163 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 134 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 164 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 162 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Entered a terminal (fully accepting) state of product in 23 steps with 0 reset in 0 ms.
Treatment of property AutonomousCar-PT-03b-LTLCardinality-15 finished in 8135 ms.
FORMULA AutonomousCar-PT-03b-LTLCardinality-15 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2024-06-01 03:01:55] [INFO ] Flatten gal took : 27 ms
[2024-06-01 03:01:55] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 4 ms.
[2024-06-01 03:01:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 160 places, 206 transitions and 699 arcs took 10 ms.
Total runtime 394557 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA AutonomousCar-PT-03b-LTLCardinality-01 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-03b-LTLCardinality-15 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717210915925

--------------------
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-03b-LTLCardinality-01
ltl formula formula --ltl=/tmp/2627/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 160 places, 206 transitions and 699 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.100 real 0.020 user 0.020 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2627/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2627/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2627/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2627/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 162 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 161, there are 213 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: 20
pnml2lts-mc( 0/ 4): - cum. max stack depth: 15
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 20 states 30 transitions, fanout: 1.500
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, 67.0 B/state, compr.: 10.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 206 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)
ltl formula name AutonomousCar-PT-03b-LTLCardinality-15
ltl formula formula --ltl=/tmp/2627/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
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 160 places, 206 transitions and 699 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.010 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2627/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2627/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2627/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2627/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 162 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 161, there are 217 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~113!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 657
pnml2lts-mc( 0/ 4): unique states count: 950
pnml2lts-mc( 0/ 4): unique transitions count: 2889
pnml2lts-mc( 0/ 4): - self-loop count: 7
pnml2lts-mc( 0/ 4): - claim dead count: 1273
pnml2lts-mc( 0/ 4): - claim found count: 19
pnml2lts-mc( 0/ 4): - claim success count: 965
pnml2lts-mc( 0/ 4): - cum. max stack depth: 311
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 965 states 2933 transitions, fanout: 3.039
pnml2lts-mc( 0/ 4): Total exploration time 0.030 sec (0.030 sec minimum, 0.030 sec on average)
pnml2lts-mc( 0/ 4): States per second: 32167, Transitions per second: 97767
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, 15.1 B/state, compr.: 2.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 206 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-03b"
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-03b, 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-171620167300259"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-03b.tgz
mv AutonomousCar-PT-03b 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 ;