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.r025-smll-171620166200259.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is AutonomousCar-PT-03b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r025-smll-171620166200259
=====================================================================

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

Invoking MCC driver with
BK_TOOL=greatspnxred
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 greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 02:19:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-22 02:19:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 02:19:01] [INFO ] Load time of PNML (sax parser for PT used): 125 ms
[2024-05-22 02:19:01] [INFO ] Transformed 190 places.
[2024-05-22 02:19:01] [INFO ] Transformed 273 transitions.
[2024-05-22 02:19:01] [INFO ] Found NUPN structural information;
[2024-05-22 02:19:01] [INFO ] Parsed PT model containing 190 places and 273 transitions and 1051 arcs in 304 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 20 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 77 ms. Remains 161 /190 variables (removed 29) and now considering 208/273 (removed 65) transitions.
// Phase 1: matrix 208 rows 161 cols
[2024-05-22 02:19:01] [INFO ] Computed 8 invariants in 39 ms
[2024-05-22 02:19:02] [INFO ] Implicit Places using invariants in 502 ms returned []
[2024-05-22 02:19:02] [INFO ] Invariant cache hit.
[2024-05-22 02:19:02] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 833 ms to find 0 implicit places.
Running 207 sub problems to find dead transitions.
[2024-05-22 02:19:02] [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-05-22 02:19:05] [INFO ] Deduced a trap composed of 31 places in 150 ms of which 26 ms to minimize.
[2024-05-22 02:19:05] [INFO ] Deduced a trap composed of 16 places in 132 ms of which 3 ms to minimize.
[2024-05-22 02:19:05] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 2 ms to minimize.
[2024-05-22 02:19:05] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-22 02:19:05] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 2 ms to minimize.
[2024-05-22 02:19:05] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 2 ms to minimize.
[2024-05-22 02:19:05] [INFO ] Deduced a trap composed of 21 places in 93 ms of which 2 ms to minimize.
[2024-05-22 02:19:06] [INFO ] Deduced a trap composed of 22 places in 95 ms of which 3 ms to minimize.
[2024-05-22 02:19:06] [INFO ] Deduced a trap composed of 35 places in 89 ms of which 2 ms to minimize.
[2024-05-22 02:19:06] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 3 ms to minimize.
[2024-05-22 02:19:06] [INFO ] Deduced a trap composed of 37 places in 84 ms of which 2 ms to minimize.
[2024-05-22 02:19:06] [INFO ] Deduced a trap composed of 41 places in 88 ms of which 2 ms to minimize.
[2024-05-22 02:19:06] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 2 ms to minimize.
[2024-05-22 02:19:06] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 2 ms to minimize.
[2024-05-22 02:19:06] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 2 ms to minimize.
[2024-05-22 02:19:06] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 2 ms to minimize.
[2024-05-22 02:19:06] [INFO ] Deduced a trap composed of 33 places in 81 ms of which 2 ms to minimize.
[2024-05-22 02:19:07] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 2 ms to minimize.
[2024-05-22 02:19:07] [INFO ] Deduced a trap composed of 39 places in 87 ms of which 2 ms to minimize.
[2024-05-22 02:19:07] [INFO ] Deduced a trap composed of 47 places in 85 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2024-05-22 02:19:07] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 1 ms to minimize.
[2024-05-22 02:19:07] [INFO ] Deduced a trap composed of 41 places in 84 ms of which 3 ms to minimize.
[2024-05-22 02:19:07] [INFO ] Deduced a trap composed of 47 places in 87 ms of which 2 ms to minimize.
[2024-05-22 02:19:07] [INFO ] Deduced a trap composed of 37 places in 84 ms of which 2 ms to minimize.
[2024-05-22 02:19:08] [INFO ] Deduced a trap composed of 40 places in 68 ms of which 1 ms to minimize.
[2024-05-22 02:19:08] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 2 ms to minimize.
[2024-05-22 02:19:08] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 2 ms to minimize.
[2024-05-22 02:19:08] [INFO ] Deduced a trap composed of 41 places in 52 ms of which 1 ms to minimize.
[2024-05-22 02:19:08] [INFO ] Deduced a trap composed of 44 places in 64 ms of which 2 ms to minimize.
[2024-05-22 02:19:08] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 2 ms to minimize.
[2024-05-22 02:19:08] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 11/39 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2024-05-22 02:19:10] [INFO ] Deduced a trap composed of 33 places in 69 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2024-05-22 02:19:11] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 2 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-05-22 02:19:14] [INFO ] Deduced a trap composed of 31 places in 63 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-05-22 02:19:16] [INFO ] Deduced a trap composed of 40 places in 72 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/369 variables, 1/204 constraints. Problems are: Problem set: 2 solved, 205 unsolved
[2024-05-22 02:19:19] [INFO ] Deduced a trap composed of 41 places in 47 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 22118 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-05-22 02:19:26] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 1/45 constraints. Problems are: Problem set: 2 solved, 205 unsolved
[2024-05-22 02:19:27] [INFO ] Deduced a trap composed of 36 places in 65 ms of which 1 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 12842 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 35187ms problems are : Problem set: 2 solved, 205 unsolved
Search for dead transitions found 2 dead transitions in 35217ms
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 14 ms. Remains 160 /161 variables (removed 1) and now considering 206/206 (removed 0) transitions.
// Phase 1: matrix 206 rows 160 cols
[2024-05-22 02:19:37] [INFO ] Computed 8 invariants in 4 ms
[2024-05-22 02:19:38] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-22 02:19:38] [INFO ] Invariant cache hit.
[2024-05-22 02:19:38] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 258 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 36436 ms. Remains : 160/190 places, 206/273 transitions.
Support contains 18 out of 160 places after structural reductions.
[2024-05-22 02:19:38] [INFO ] Flatten gal took : 67 ms
[2024-05-22 02:19:38] [INFO ] Flatten gal took : 26 ms
[2024-05-22 02:19:38] [INFO ] Input system was already deterministic with 206 transitions.
RANDOM walk for 40000 steps (51 resets) in 1041 ms. (38 steps per ms) remains 0/10 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 4 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 67 ms. Remains 31 /160 variables (removed 129) and now considering 71/206 (removed 135) transitions.
// Phase 1: matrix 71 rows 31 cols
[2024-05-22 02:19:39] [INFO ] Computed 6 invariants in 1 ms
[2024-05-22 02:19:39] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-22 02:19:39] [INFO ] Invariant cache hit.
[2024-05-22 02:19:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 02:19:39] [INFO ] Implicit Places using invariants and state equation in 78 ms returned [25, 30]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 125 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 7 ms. Remains 28 /29 variables (removed 1) and now considering 70/71 (removed 1) transitions.
// Phase 1: matrix 70 rows 28 cols
[2024-05-22 02:19:39] [INFO ] Computed 4 invariants in 1 ms
[2024-05-22 02:19:39] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-22 02:19:39] [INFO ] Invariant cache hit.
[2024-05-22 02:19:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 02:19:39] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 116 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 315 ms. Remains : 28/160 places, 70/206 transitions.
Stuttering acceptance computed with spot in 306 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 6 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 703 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 21 ms. Remains 155 /160 variables (removed 5) and now considering 201/206 (removed 5) transitions.
// Phase 1: matrix 201 rows 155 cols
[2024-05-22 02:19:39] [INFO ] Computed 8 invariants in 4 ms
[2024-05-22 02:19:40] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-22 02:19:40] [INFO ] Invariant cache hit.
[2024-05-22 02:19:40] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2024-05-22 02:19:40] [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-05-22 02:19:41] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 2 ms to minimize.
[2024-05-22 02:19:41] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 2 ms to minimize.
[2024-05-22 02:19:42] [INFO ] Deduced a trap composed of 42 places in 80 ms of which 2 ms to minimize.
[2024-05-22 02:19:42] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-22 02:19:42] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 2 ms to minimize.
[2024-05-22 02:19:42] [INFO ] Deduced a trap composed of 33 places in 79 ms of which 2 ms to minimize.
[2024-05-22 02:19:42] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2024-05-22 02:19:42] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 2 ms to minimize.
[2024-05-22 02:19:42] [INFO ] Deduced a trap composed of 35 places in 75 ms of which 2 ms to minimize.
[2024-05-22 02:19:42] [INFO ] Deduced a trap composed of 36 places in 75 ms of which 2 ms to minimize.
[2024-05-22 02:19:42] [INFO ] Deduced a trap composed of 47 places in 73 ms of which 2 ms to minimize.
[2024-05-22 02:19:42] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 2 ms to minimize.
[2024-05-22 02:19:42] [INFO ] Deduced a trap composed of 43 places in 73 ms of which 3 ms to minimize.
[2024-05-22 02:19:43] [INFO ] Deduced a trap composed of 33 places in 72 ms of which 2 ms to minimize.
[2024-05-22 02:19:43] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 2 ms to minimize.
[2024-05-22 02:19:43] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 1 ms to minimize.
[2024-05-22 02:19:43] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 2 ms to minimize.
[2024-05-22 02:19:43] [INFO ] Deduced a trap composed of 41 places in 68 ms of which 1 ms to minimize.
[2024-05-22 02:19:43] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 2 ms to minimize.
[2024-05-22 02:19:43] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-22 02:19:43] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 1 ms to minimize.
[2024-05-22 02:19:44] [INFO ] Deduced a trap composed of 36 places in 75 ms of which 2 ms to minimize.
[2024-05-22 02:19:44] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 2 ms to minimize.
[2024-05-22 02:19:44] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 1 ms to minimize.
[2024-05-22 02:19:44] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 2 ms to minimize.
[2024-05-22 02:19:44] [INFO ] Deduced a trap composed of 43 places in 62 ms of which 3 ms to minimize.
[2024-05-22 02:19:44] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 2 ms to minimize.
[2024-05-22 02:19:44] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 1 ms to minimize.
[2024-05-22 02:19:44] [INFO ] Deduced a trap composed of 51 places in 55 ms of which 2 ms to minimize.
[2024-05-22 02:19:44] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 2 ms to minimize.
[2024-05-22 02:19:44] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 2 ms to minimize.
[2024-05-22 02:19:44] [INFO ] Deduced a trap composed of 51 places in 50 ms of which 2 ms to minimize.
[2024-05-22 02:19:45] [INFO ] Deduced a trap composed of 41 places in 46 ms of which 1 ms to minimize.
[2024-05-22 02:19:45] [INFO ] Deduced a trap composed of 5 places in 72 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-05-22 02:19:46] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 2 ms to minimize.
[2024-05-22 02:19:46] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 2 ms to minimize.
[2024-05-22 02:19:46] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 2 ms to minimize.
[2024-05-22 02:19:46] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 2 ms to minimize.
[2024-05-22 02:19:46] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 2 ms to minimize.
[2024-05-22 02:19:47] [INFO ] Deduced a trap composed of 51 places in 70 ms of which 1 ms to minimize.
[2024-05-22 02:19:47] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 2 ms to minimize.
[2024-05-22 02:19:47] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 8/50 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-22 02:19:48] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 1 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 14071 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-05-22 02:19:57] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 1 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 13226 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 27387ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 27392ms
Starting structural reductions in LTL mode, iteration 1 : 155/160 places, 201/206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27699 ms. Remains : 155/160 places, 201/206 transitions.
Stuttering acceptance computed with spot in 156 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 292 ms.
Product exploration explored 100000 steps with 25000 reset in 206 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 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 280 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 156 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 100 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 143 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 143 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 3 ms. Remains 155 /155 variables (removed 0) and now considering 201/201 (removed 0) transitions.
[2024-05-22 02:20:09] [INFO ] Invariant cache hit.
[2024-05-22 02:20:09] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-22 02:20:09] [INFO ] Invariant cache hit.
[2024-05-22 02:20:09] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2024-05-22 02:20:09] [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-05-22 02:20:11] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 2 ms to minimize.
[2024-05-22 02:20:11] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 2 ms to minimize.
[2024-05-22 02:20:11] [INFO ] Deduced a trap composed of 42 places in 81 ms of which 2 ms to minimize.
[2024-05-22 02:20:11] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-22 02:20:11] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 2 ms to minimize.
[2024-05-22 02:20:11] [INFO ] Deduced a trap composed of 33 places in 84 ms of which 2 ms to minimize.
[2024-05-22 02:20:11] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-05-22 02:20:11] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 2 ms to minimize.
[2024-05-22 02:20:11] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 2 ms to minimize.
[2024-05-22 02:20:11] [INFO ] Deduced a trap composed of 36 places in 76 ms of which 1 ms to minimize.
[2024-05-22 02:20:11] [INFO ] Deduced a trap composed of 47 places in 71 ms of which 2 ms to minimize.
[2024-05-22 02:20:12] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 2 ms to minimize.
[2024-05-22 02:20:12] [INFO ] Deduced a trap composed of 43 places in 71 ms of which 1 ms to minimize.
[2024-05-22 02:20:12] [INFO ] Deduced a trap composed of 33 places in 72 ms of which 2 ms to minimize.
[2024-05-22 02:20:12] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 2 ms to minimize.
[2024-05-22 02:20:12] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 2 ms to minimize.
[2024-05-22 02:20:12] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 1 ms to minimize.
[2024-05-22 02:20:12] [INFO ] Deduced a trap composed of 41 places in 70 ms of which 2 ms to minimize.
[2024-05-22 02:20:12] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 2 ms to minimize.
[2024-05-22 02:20:12] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-22 02:20:13] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
[2024-05-22 02:20:13] [INFO ] Deduced a trap composed of 36 places in 76 ms of which 2 ms to minimize.
[2024-05-22 02:20:13] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 2 ms to minimize.
[2024-05-22 02:20:13] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 2 ms to minimize.
[2024-05-22 02:20:13] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 2 ms to minimize.
[2024-05-22 02:20:13] [INFO ] Deduced a trap composed of 43 places in 65 ms of which 2 ms to minimize.
[2024-05-22 02:20:13] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 2 ms to minimize.
[2024-05-22 02:20:13] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 2 ms to minimize.
[2024-05-22 02:20:13] [INFO ] Deduced a trap composed of 51 places in 56 ms of which 2 ms to minimize.
[2024-05-22 02:20:13] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 1 ms to minimize.
[2024-05-22 02:20:14] [INFO ] Deduced a trap composed of 41 places in 57 ms of which 1 ms to minimize.
[2024-05-22 02:20:14] [INFO ] Deduced a trap composed of 51 places in 52 ms of which 1 ms to minimize.
[2024-05-22 02:20:14] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 1 ms to minimize.
[2024-05-22 02:20:14] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 14/42 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-22 02:20:15] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 2 ms to minimize.
[2024-05-22 02:20:15] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 1 ms to minimize.
[2024-05-22 02:20:15] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 2 ms to minimize.
[2024-05-22 02:20:16] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 2 ms to minimize.
[2024-05-22 02:20:16] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 2 ms to minimize.
[2024-05-22 02:20:16] [INFO ] Deduced a trap composed of 51 places in 68 ms of which 2 ms to minimize.
[2024-05-22 02:20:16] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 2 ms to minimize.
[2024-05-22 02:20:16] [INFO ] Deduced a trap composed of 32 places in 65 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-05-22 02:20:17] [INFO ] Deduced a trap composed of 40 places in 59 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 14140 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-05-22 02:20:26] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 1 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 13169 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 27407ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 27411ms
Finished structural reductions in LTL mode , in 1 iterations and 27693 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 83 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 156 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 138 steps (0 resets) in 4 ms. (27 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 102 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 143 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 117 ms.
Product exploration explored 100000 steps with 25000 reset in 163 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 199 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 0 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 0 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 0 ms
Applied a total of 311 rules in 69 ms. Remains 63 /155 variables (removed 92) and now considering 111/201 (removed 90) transitions.
[2024-05-22 02:20:38] [INFO ] Redundant transitions in 4 ms returned []
Running 110 sub problems to find dead transitions.
// Phase 1: matrix 111 rows 63 cols
[2024-05-22 02:20:38] [INFO ] Computed 7 invariants in 2 ms
[2024-05-22 02:20:38] [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-05-22 02:20:39] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 2 ms to minimize.
[2024-05-22 02:20:39] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2024-05-22 02:20:39] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
[2024-05-22 02:20:40] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 2 ms to minimize.
[2024-05-22 02:20:40] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 2 ms to minimize.
[2024-05-22 02:20:40] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 2 ms to minimize.
[2024-05-22 02:20:40] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 1 ms to minimize.
[2024-05-22 02:20:40] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
Problem TDEAD11 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD15 is UNSAT
[2024-05-22 02:20:40] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 1 ms to minimize.
Problem TDEAD16 is UNSAT
[2024-05-22 02:20:40] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 2 ms to minimize.
Problem TDEAD18 is UNSAT
[2024-05-22 02:20:40] [INFO ] Deduced a trap composed of 6 places in 49 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-05-22 02:20:40] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 1 ms to minimize.
Problem TDEAD32 is UNSAT
[2024-05-22 02:20:40] [INFO ] Deduced a trap composed of 2 places in 56 ms of which 1 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-05-22 02:20:41] [INFO ] Deduced a trap composed of 9 places in 39 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 4028 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 2969 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 7128ms problems are : Problem set: 42 solved, 68 unsolved
Search for dead transitions found 42 dead transitions in 7131ms
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.2 ms
Discarding 32 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 12 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 7228 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-05-22 02:20:45] [INFO ] Computed 8 invariants in 2 ms
[2024-05-22 02:20:45] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-22 02:20:45] [INFO ] Invariant cache hit.
[2024-05-22 02:20:45] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2024-05-22 02:20: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-05-22 02:20:47] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 2 ms to minimize.
[2024-05-22 02:20:47] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 1 ms to minimize.
[2024-05-22 02:20:47] [INFO ] Deduced a trap composed of 42 places in 79 ms of which 2 ms to minimize.
[2024-05-22 02:20:47] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-22 02:20:47] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 2 ms to minimize.
[2024-05-22 02:20:48] [INFO ] Deduced a trap composed of 33 places in 76 ms of which 2 ms to minimize.
[2024-05-22 02:20:48] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2024-05-22 02:20:48] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 2 ms to minimize.
[2024-05-22 02:20:48] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 2 ms to minimize.
[2024-05-22 02:20:48] [INFO ] Deduced a trap composed of 36 places in 76 ms of which 2 ms to minimize.
[2024-05-22 02:20:48] [INFO ] Deduced a trap composed of 47 places in 72 ms of which 2 ms to minimize.
[2024-05-22 02:20:48] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 2 ms to minimize.
[2024-05-22 02:20:48] [INFO ] Deduced a trap composed of 43 places in 76 ms of which 2 ms to minimize.
[2024-05-22 02:20:48] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 1 ms to minimize.
[2024-05-22 02:20:48] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 2 ms to minimize.
[2024-05-22 02:20:48] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 2 ms to minimize.
[2024-05-22 02:20:49] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 2 ms to minimize.
[2024-05-22 02:20:49] [INFO ] Deduced a trap composed of 41 places in 69 ms of which 2 ms to minimize.
[2024-05-22 02:20:49] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 1 ms to minimize.
[2024-05-22 02:20:49] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-22 02:20:49] [INFO ] Deduced a trap composed of 39 places in 35 ms of which 1 ms to minimize.
[2024-05-22 02:20:49] [INFO ] Deduced a trap composed of 36 places in 80 ms of which 1 ms to minimize.
[2024-05-22 02:20:49] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 2 ms to minimize.
[2024-05-22 02:20:49] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 1 ms to minimize.
[2024-05-22 02:20:50] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 2 ms to minimize.
[2024-05-22 02:20:50] [INFO ] Deduced a trap composed of 43 places in 74 ms of which 2 ms to minimize.
[2024-05-22 02:20:50] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 2 ms to minimize.
[2024-05-22 02:20:50] [INFO ] Deduced a trap composed of 40 places in 87 ms of which 2 ms to minimize.
[2024-05-22 02:20:50] [INFO ] Deduced a trap composed of 51 places in 56 ms of which 1 ms to minimize.
[2024-05-22 02:20:50] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 2 ms to minimize.
[2024-05-22 02:20:50] [INFO ] Deduced a trap composed of 41 places in 57 ms of which 2 ms to minimize.
[2024-05-22 02:20:50] [INFO ] Deduced a trap composed of 51 places in 50 ms of which 2 ms to minimize.
[2024-05-22 02:20:50] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 1 ms to minimize.
[2024-05-22 02:20:51] [INFO ] Deduced a trap composed of 5 places in 71 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-05-22 02:20:52] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 2 ms to minimize.
[2024-05-22 02:20:52] [INFO ] Deduced a trap composed of 20 places in 108 ms of which 3 ms to minimize.
[2024-05-22 02:20:52] [INFO ] Deduced a trap composed of 33 places in 106 ms of which 2 ms to minimize.
[2024-05-22 02:20:52] [INFO ] Deduced a trap composed of 14 places in 126 ms of which 2 ms to minimize.
[2024-05-22 02:20:53] [INFO ] Deduced a trap composed of 41 places in 87 ms of which 2 ms to minimize.
[2024-05-22 02:20:53] [INFO ] Deduced a trap composed of 51 places in 117 ms of which 2 ms to minimize.
[2024-05-22 02:20:53] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 2 ms to minimize.
[2024-05-22 02:20:53] [INFO ] Deduced a trap composed of 32 places in 60 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-05-22 02:20:54] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 1 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 15132 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-05-22 02:21:04] [INFO ] Deduced a trap composed of 40 places in 56 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 13174 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 28368ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 28371ms
Finished structural reductions in LTL mode , in 1 iterations and 28622 ms. Remains : 155/155 places, 201/201 transitions.
Treatment of property AutonomousCar-PT-03b-LTLCardinality-01 finished in 94453 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 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 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 32 ms. Remains 29 /160 variables (removed 131) and now considering 67/206 (removed 139) transitions.
// Phase 1: matrix 67 rows 29 cols
[2024-05-22 02:21:14] [INFO ] Computed 6 invariants in 1 ms
[2024-05-22 02:21:14] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-22 02:21:14] [INFO ] Invariant cache hit.
[2024-05-22 02:21:14] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 02:21:14] [INFO ] Implicit Places using invariants and state equation in 72 ms returned [23, 28]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 118 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 5 ms. Remains 25 /27 variables (removed 2) and now considering 65/67 (removed 2) transitions.
// Phase 1: matrix 65 rows 25 cols
[2024-05-22 02:21:14] [INFO ] Computed 4 invariants in 0 ms
[2024-05-22 02:21:14] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-22 02:21:14] [INFO ] Invariant cache hit.
[2024-05-22 02:21:14] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 02:21:14] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 103 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 258 ms. Remains : 25/160 places, 65/206 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-03b-LTLCardinality-04
Stuttering criterion allowed to conclude after 15 steps with 1 reset in 0 ms.
FORMULA AutonomousCar-PT-03b-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03b-LTLCardinality-04 finished in 351 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 30 ms. Remains 29 /160 variables (removed 131) and now considering 67/206 (removed 139) transitions.
// Phase 1: matrix 67 rows 29 cols
[2024-05-22 02:21:14] [INFO ] Computed 6 invariants in 1 ms
[2024-05-22 02:21:14] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-22 02:21:14] [INFO ] Invariant cache hit.
[2024-05-22 02:21:14] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-22 02:21:14] [INFO ] Implicit Places using invariants and state equation in 87 ms returned [23, 27]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 154 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 5 ms. Remains 25 /27 variables (removed 2) and now considering 65/67 (removed 2) transitions.
// Phase 1: matrix 65 rows 25 cols
[2024-05-22 02:21:14] [INFO ] Computed 4 invariants in 0 ms
[2024-05-22 02:21:14] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-22 02:21:14] [INFO ] Invariant cache hit.
[2024-05-22 02:21:15] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-22 02:21:15] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 124 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 314 ms. Remains : 25/160 places, 65/206 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-03b-LTLCardinality-07
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-03b-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03b-LTLCardinality-07 finished in 365 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 11 ms. Remains 153 /160 variables (removed 7) and now considering 199/206 (removed 7) transitions.
// Phase 1: matrix 199 rows 153 cols
[2024-05-22 02:21:15] [INFO ] Computed 8 invariants in 1 ms
[2024-05-22 02:21:15] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-22 02:21:15] [INFO ] Invariant cache hit.
[2024-05-22 02:21:15] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
Running 198 sub problems to find dead transitions.
[2024-05-22 02:21:15] [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-05-22 02:21:17] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 2 ms to minimize.
[2024-05-22 02:21:17] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 2 ms to minimize.
[2024-05-22 02:21:17] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 2 ms to minimize.
[2024-05-22 02:21:17] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 2 ms to minimize.
[2024-05-22 02:21:17] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 2 ms to minimize.
[2024-05-22 02:21:17] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 2 ms to minimize.
[2024-05-22 02:21:17] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 2 ms to minimize.
[2024-05-22 02:21:17] [INFO ] Deduced a trap composed of 33 places in 79 ms of which 2 ms to minimize.
[2024-05-22 02:21:17] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 2 ms to minimize.
[2024-05-22 02:21:18] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 2 ms to minimize.
[2024-05-22 02:21:18] [INFO ] Deduced a trap composed of 33 places in 79 ms of which 2 ms to minimize.
[2024-05-22 02:21:18] [INFO ] Deduced a trap composed of 44 places in 84 ms of which 2 ms to minimize.
[2024-05-22 02:21:18] [INFO ] Deduced a trap composed of 36 places in 81 ms of which 2 ms to minimize.
[2024-05-22 02:21:18] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 2 ms to minimize.
[2024-05-22 02:21:18] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 1 ms to minimize.
[2024-05-22 02:21:18] [INFO ] Deduced a trap composed of 33 places in 74 ms of which 2 ms to minimize.
[2024-05-22 02:21:18] [INFO ] Deduced a trap composed of 41 places in 57 ms of which 1 ms to minimize.
[2024-05-22 02:21:19] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 1 ms to minimize.
[2024-05-22 02:21:19] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 3 ms to minimize.
[2024-05-22 02:21:19] [INFO ] Deduced a trap composed of 5 places in 82 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-05-22 02:21:19] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 2 ms to minimize.
[2024-05-22 02:21:19] [INFO ] Deduced a trap composed of 42 places in 74 ms of which 2 ms to minimize.
[2024-05-22 02:21:19] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 2 ms to minimize.
[2024-05-22 02:21:19] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2024-05-22 02:21:19] [INFO ] Deduced a trap composed of 36 places in 71 ms of which 2 ms to minimize.
[2024-05-22 02:21:19] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 1 ms to minimize.
[2024-05-22 02:21:19] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 1 ms to minimize.
[2024-05-22 02:21:20] [INFO ] Deduced a trap composed of 41 places in 62 ms of which 1 ms to minimize.
[2024-05-22 02:21:20] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 1 ms to minimize.
[2024-05-22 02:21:20] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 1 ms to minimize.
[2024-05-22 02:21:20] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 1 ms to minimize.
[2024-05-22 02:21:20] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 12/40 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-22 02:21:21] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 1 ms to minimize.
[2024-05-22 02:21:21] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 2 ms to minimize.
[2024-05-22 02:21:22] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 1 ms to minimize.
[2024-05-22 02:21:22] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
[2024-05-22 02:21:22] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 2 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-05-22 02:21:25] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 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 14921 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-05-22 02:21:31] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-22 02:21:33] [INFO ] Deduced a trap composed of 32 places in 58 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-05-22 02:21:35] [INFO ] Deduced a trap composed of 31 places in 65 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 16542 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 31519ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 31522ms
Starting structural reductions in LTL mode, iteration 1 : 153/160 places, 199/206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31803 ms. Remains : 153/160 places, 199/206 transitions.
Stuttering acceptance computed with spot in 101 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 31921 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 12 ms. Remains 154 /160 variables (removed 6) and now considering 200/206 (removed 6) transitions.
// Phase 1: matrix 200 rows 154 cols
[2024-05-22 02:21:47] [INFO ] Computed 8 invariants in 2 ms
[2024-05-22 02:21:47] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-22 02:21:47] [INFO ] Invariant cache hit.
[2024-05-22 02:21:47] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
Running 199 sub problems to find dead transitions.
[2024-05-22 02:21:47] [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-05-22 02:21:49] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 2 ms to minimize.
[2024-05-22 02:21:49] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 2 ms to minimize.
[2024-05-22 02:21:49] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
[2024-05-22 02:21:49] [INFO ] Deduced a trap composed of 33 places in 76 ms of which 2 ms to minimize.
[2024-05-22 02:21:49] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 2 ms to minimize.
[2024-05-22 02:21:49] [INFO ] Deduced a trap composed of 41 places in 75 ms of which 2 ms to minimize.
[2024-05-22 02:21:49] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 2 ms to minimize.
[2024-05-22 02:21:49] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 2 ms to minimize.
[2024-05-22 02:21:49] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 2 ms to minimize.
[2024-05-22 02:21:49] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 2 ms to minimize.
[2024-05-22 02:21:49] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 2 ms to minimize.
[2024-05-22 02:21:50] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 2 ms to minimize.
[2024-05-22 02:21:50] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 2 ms to minimize.
[2024-05-22 02:21:50] [INFO ] Deduced a trap composed of 35 places in 65 ms of which 2 ms to minimize.
[2024-05-22 02:21:50] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 2 ms to minimize.
[2024-05-22 02:21:50] [INFO ] Deduced a trap composed of 44 places in 66 ms of which 1 ms to minimize.
[2024-05-22 02:21:50] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2024-05-22 02:21:50] [INFO ] Deduced a trap composed of 37 places in 74 ms of which 1 ms to minimize.
[2024-05-22 02:21:50] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 4 ms to minimize.
[2024-05-22 02:21:51] [INFO ] Deduced a trap composed of 5 places in 76 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-05-22 02:21:51] [INFO ] Deduced a trap composed of 33 places in 79 ms of which 2 ms to minimize.
[2024-05-22 02:21:51] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
[2024-05-22 02:21:51] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
[2024-05-22 02:21:51] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 4 ms to minimize.
[2024-05-22 02:21:52] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 5/33 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-05-22 02:21:53] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-05-22 02:21:53] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 1 ms to minimize.
[2024-05-22 02:21:53] [INFO ] Deduced a trap composed of 41 places in 43 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-05-22 02:21:54] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 1 ms to minimize.
[2024-05-22 02:21:54] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
[2024-05-22 02:21:54] [INFO ] Deduced a trap composed of 44 places in 63 ms of which 5 ms to minimize.
[2024-05-22 02:21:54] [INFO ] Deduced a trap composed of 33 places in 60 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-05-22 02:21:55] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 2 ms to minimize.
[2024-05-22 02:21:55] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-05-22 02:21:57] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-05-22 02:21:57] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 2 ms to minimize.
[2024-05-22 02:21:57] [INFO ] Deduced a trap composed of 40 places in 77 ms of which 2 ms to minimize.
[2024-05-22 02:21:57] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 1 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-05-22 02:22:00] [INFO ] Deduced a trap composed of 41 places in 60 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 18526 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-05-22 02:22:07] [INFO ] Deduced a trap composed of 39 places in 57 ms of which 2 ms to minimize.
[2024-05-22 02:22:07] [INFO ] Deduced a trap composed of 41 places in 45 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 10882 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 29459ms problems are : Problem set: 0 solved, 199 unsolved
Search for dead transitions found 0 dead transitions in 29461ms
Starting structural reductions in LTL mode, iteration 1 : 154/160 places, 200/206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29735 ms. Remains : 154/160 places, 200/206 transitions.
Stuttering acceptance computed with spot in 120 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 0 reset in 149 ms.
Product exploration explored 100000 steps with 4 reset in 180 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 77 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 119 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (48 resets) in 134 ms. (296 steps per ms) remains 1/1 properties
BEST_FIRST walk for 35668 steps (30 resets) in 94 ms. (375 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 98 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 119 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 118 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-05-22 02:22:17] [INFO ] Invariant cache hit.
[2024-05-22 02:22:17] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-22 02:22:17] [INFO ] Invariant cache hit.
[2024-05-22 02:22:18] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
Running 199 sub problems to find dead transitions.
[2024-05-22 02:22:18] [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-05-22 02:22:19] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 2 ms to minimize.
[2024-05-22 02:22:19] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 2 ms to minimize.
[2024-05-22 02:22:20] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 2 ms to minimize.
[2024-05-22 02:22:20] [INFO ] Deduced a trap composed of 33 places in 78 ms of which 2 ms to minimize.
[2024-05-22 02:22:20] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 2 ms to minimize.
[2024-05-22 02:22:20] [INFO ] Deduced a trap composed of 41 places in 73 ms of which 2 ms to minimize.
[2024-05-22 02:22:20] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 2 ms to minimize.
[2024-05-22 02:22:20] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 2 ms to minimize.
[2024-05-22 02:22:20] [INFO ] Deduced a trap composed of 33 places in 74 ms of which 2 ms to minimize.
[2024-05-22 02:22:20] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 2 ms to minimize.
[2024-05-22 02:22:20] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 2 ms to minimize.
[2024-05-22 02:22:20] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 1 ms to minimize.
[2024-05-22 02:22:21] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 1 ms to minimize.
[2024-05-22 02:22:21] [INFO ] Deduced a trap composed of 35 places in 65 ms of which 2 ms to minimize.
[2024-05-22 02:22:21] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 2 ms to minimize.
[2024-05-22 02:22:21] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 2 ms to minimize.
[2024-05-22 02:22:21] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-22 02:22:21] [INFO ] Deduced a trap composed of 37 places in 71 ms of which 1 ms to minimize.
[2024-05-22 02:22:21] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 2 ms to minimize.
[2024-05-22 02:22:21] [INFO ] Deduced a trap composed of 5 places in 74 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-05-22 02:22:22] [INFO ] Deduced a trap composed of 33 places in 69 ms of which 2 ms to minimize.
[2024-05-22 02:22:22] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2024-05-22 02:22:22] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 2 ms to minimize.
[2024-05-22 02:22:22] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 2 ms to minimize.
[2024-05-22 02:22:22] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 5/33 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-05-22 02:22:24] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-05-22 02:22:24] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 1 ms to minimize.
[2024-05-22 02:22:24] [INFO ] Deduced a trap composed of 41 places in 46 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-05-22 02:22:25] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 2 ms to minimize.
[2024-05-22 02:22:25] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2024-05-22 02:22:25] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 2 ms to minimize.
[2024-05-22 02:22:25] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-05-22 02:22:26] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 1 ms to minimize.
[2024-05-22 02:22:26] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-05-22 02:22:28] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
[2024-05-22 02:22:28] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 2 ms to minimize.
[2024-05-22 02:22:28] [INFO ] Deduced a trap composed of 40 places in 70 ms of which 2 ms to minimize.
[2024-05-22 02:22:28] [INFO ] Deduced a trap composed of 32 places in 78 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-05-22 02:22:31] [INFO ] Deduced a trap composed of 41 places in 54 ms of which 1 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 18601 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-05-22 02:22:38] [INFO ] Deduced a trap composed of 39 places in 58 ms of which 1 ms to minimize.
[2024-05-22 02:22:38] [INFO ] Deduced a trap composed of 41 places in 42 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 11111 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 29768ms problems are : Problem set: 0 solved, 199 unsolved
Search for dead transitions found 0 dead transitions in 29770ms
Finished structural reductions in LTL mode , in 1 iterations and 30037 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 163 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 117 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 30128 steps (21 resets) in 69 ms. (430 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 106 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 121 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3 reset in 84 ms.
Entered a terminal (fully accepting) state of product in 184 steps with 1 reset in 3 ms.
FORMULA AutonomousCar-PT-03b-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03b-LTLCardinality-15 finished in 61783 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 136 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 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 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 47 ms. Remains 29 /160 variables (removed 131) and now considering 68/206 (removed 138) transitions.
// Phase 1: matrix 68 rows 29 cols
[2024-05-22 02:22:49] [INFO ] Computed 6 invariants in 0 ms
[2024-05-22 02:22:49] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-22 02:22:49] [INFO ] Invariant cache hit.
[2024-05-22 02:22:49] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-22 02:22:49] [INFO ] Implicit Places using invariants and state equation in 78 ms returned [23, 28]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 135 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 14 ms. Remains 25 /27 variables (removed 2) and now considering 66/68 (removed 2) transitions.
// Phase 1: matrix 66 rows 25 cols
[2024-05-22 02:22:49] [INFO ] Computed 4 invariants in 1 ms
[2024-05-22 02:22:49] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-22 02:22:49] [INFO ] Invariant cache hit.
[2024-05-22 02:22:49] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-22 02:22:49] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 118 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 316 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 283 ms.
Product exploration explored 100000 steps with 25000 reset in 358 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 104 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 143 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 95 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 134 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
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 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-05-22 02:22:50] [INFO ] Invariant cache hit.
[2024-05-22 02:22:50] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-22 02:22:50] [INFO ] Invariant cache hit.
[2024-05-22 02:22:50] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-22 02:22:50] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
Running 65 sub problems to find dead transitions.
[2024-05-22 02:22:50] [INFO ] Invariant cache hit.
[2024-05-22 02:22:50] [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-05-22 02:22:51] [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-05-22 02:22:51] [INFO ] Deduced a trap composed of 7 places in 31 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 1551 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-05-22 02:22:52] [INFO ] Deduced a trap composed of 5 places in 23 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-05-22 02:22:53] [INFO ] Deduced a trap composed of 5 places in 26 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 2458 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 4066ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 4068ms
Finished structural reductions in LTL mode , in 1 iterations and 4174 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 72 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 131 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 88 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 127 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 131 ms.
Product exploration explored 100000 steps with 25000 reset in 154 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 132 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 3 ms. Remains 25 /25 variables (removed 0) and now considering 66/66 (removed 0) transitions.
[2024-05-22 02:22:56] [INFO ] Redundant transitions in 15 ms returned []
Running 65 sub problems to find dead transitions.
[2024-05-22 02:22:56] [INFO ] Invariant cache hit.
[2024-05-22 02:22:56] [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-05-22 02:22:56] [INFO ] Deduced a trap composed of 5 places in 38 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-05-22 02:22:56] [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 1609 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-05-22 02:22:58] [INFO ] Deduced a trap composed of 5 places in 26 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-05-22 02:22:58] [INFO ] Deduced a trap composed of 5 places in 29 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 2578 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 4246ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 4248ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 4272 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-05-22 02:23:00] [INFO ] Invariant cache hit.
[2024-05-22 02:23:00] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-22 02:23:00] [INFO ] Invariant cache hit.
[2024-05-22 02:23:00] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-22 02:23:00] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
Running 65 sub problems to find dead transitions.
[2024-05-22 02:23:00] [INFO ] Invariant cache hit.
[2024-05-22 02:23:00] [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-05-22 02:23:00] [INFO ] Deduced a trap composed of 5 places in 25 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-05-22 02:23:01] [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 1776 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-05-22 02:23:02] [INFO ] Deduced a trap composed of 5 places in 23 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-05-22 02:23:03] [INFO ] Deduced a trap composed of 5 places in 27 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 2734 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 4567ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 4568ms
Finished structural reductions in LTL mode , in 1 iterations and 4683 ms. Remains : 25/25 places, 66/66 transitions.
Treatment of property AutonomousCar-PT-03b-LTLCardinality-01 finished in 16267 ms.
[2024-05-22 02:23:05] [INFO ] Flatten gal took : 17 ms
[2024-05-22 02:23:05] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-22 02:23:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 160 places, 206 transitions and 699 arcs took 8 ms.
Total runtime 243871 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running AutonomousCar-PT-03b

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/414/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 160
TRANSITIONS: 206
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.003s, Sys 0.002s]


SAVING FILE /home/mcc/execution/414/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 2278
MODEL NAME: /home/mcc/execution/414/model
160 places, 206 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA AutonomousCar-PT-03b-LTLCardinality-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716344586205

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is 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 r025-smll-171620166200259"
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 ;