Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r468-smll-171620167400291.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is AutonomousCar-PT-05b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r468-smll-171620167400291
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 22 14:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 18:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Apr 12 18:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 18:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K Apr 12 18:09 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 159K 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-05b-LTLCardinality-00
FORMULA_NAME AutonomousCar-PT-05b-LTLCardinality-01
FORMULA_NAME AutonomousCar-PT-05b-LTLCardinality-02
FORMULA_NAME AutonomousCar-PT-05b-LTLCardinality-03
FORMULA_NAME AutonomousCar-PT-05b-LTLCardinality-04
FORMULA_NAME AutonomousCar-PT-05b-LTLCardinality-05
FORMULA_NAME AutonomousCar-PT-05b-LTLCardinality-06
FORMULA_NAME AutonomousCar-PT-05b-LTLCardinality-07
FORMULA_NAME AutonomousCar-PT-05b-LTLCardinality-08
FORMULA_NAME AutonomousCar-PT-05b-LTLCardinality-09
FORMULA_NAME AutonomousCar-PT-05b-LTLCardinality-10
FORMULA_NAME AutonomousCar-PT-05b-LTLCardinality-11
FORMULA_NAME AutonomousCar-PT-05b-LTLCardinality-12
FORMULA_NAME AutonomousCar-PT-05b-LTLCardinality-13
FORMULA_NAME AutonomousCar-PT-05b-LTLCardinality-14
FORMULA_NAME AutonomousCar-PT-05b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717212144036

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-05b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 03:22:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 03:22:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 03:22:27] [INFO ] Load time of PNML (sax parser for PT used): 300 ms
[2024-06-01 03:22:27] [INFO ] Transformed 255 places.
[2024-06-01 03:22:27] [INFO ] Transformed 490 transitions.
[2024-06-01 03:22:27] [INFO ] Found NUPN structural information;
[2024-06-01 03:22:27] [INFO ] Parsed PT model containing 255 places and 490 transitions and 2527 arcs in 678 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 25 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA AutonomousCar-PT-05b-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-05b-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-05b-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-05b-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-05b-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-05b-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-05b-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 255 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 490/490 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 222 transition count 457
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 222 transition count 457
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 0 with 100 rules applied. Total rules applied 166 place count 222 transition count 357
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 172 place count 216 transition count 351
Iterating global reduction 1 with 6 rules applied. Total rules applied 178 place count 216 transition count 351
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 179 place count 215 transition count 350
Iterating global reduction 1 with 1 rules applied. Total rules applied 180 place count 215 transition count 350
Applied a total of 180 rules in 188 ms. Remains 215 /255 variables (removed 40) and now considering 350/490 (removed 140) transitions.
// Phase 1: matrix 350 rows 215 cols
[2024-06-01 03:22:27] [INFO ] Computed 10 invariants in 29 ms
[2024-06-01 03:22:28] [INFO ] Implicit Places using invariants in 588 ms returned []
[2024-06-01 03:22:28] [INFO ] Invariant cache hit.
[2024-06-01 03:22:28] [INFO ] Implicit Places using invariants and state equation in 525 ms returned []
Implicit Place search using SMT with State Equation took 1309 ms to find 0 implicit places.
Running 349 sub problems to find dead transitions.
[2024-06-01 03:22:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/214 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 1 (OVERLAPS) 1/215 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 349 unsolved
[2024-06-01 03:22:36] [INFO ] Deduced a trap composed of 19 places in 312 ms of which 48 ms to minimize.
[2024-06-01 03:22:36] [INFO ] Deduced a trap composed of 24 places in 293 ms of which 6 ms to minimize.
[2024-06-01 03:22:36] [INFO ] Deduced a trap composed of 40 places in 236 ms of which 4 ms to minimize.
[2024-06-01 03:22:37] [INFO ] Deduced a trap composed of 14 places in 228 ms of which 5 ms to minimize.
[2024-06-01 03:22:37] [INFO ] Deduced a trap composed of 50 places in 207 ms of which 3 ms to minimize.
[2024-06-01 03:22:37] [INFO ] Deduced a trap composed of 32 places in 183 ms of which 3 ms to minimize.
[2024-06-01 03:22:37] [INFO ] Deduced a trap composed of 21 places in 161 ms of which 2 ms to minimize.
[2024-06-01 03:22:38] [INFO ] Deduced a trap composed of 39 places in 201 ms of which 5 ms to minimize.
[2024-06-01 03:22:38] [INFO ] Deduced a trap composed of 24 places in 188 ms of which 3 ms to minimize.
[2024-06-01 03:22:38] [INFO ] Deduced a trap composed of 35 places in 175 ms of which 4 ms to minimize.
[2024-06-01 03:22:38] [INFO ] Deduced a trap composed of 62 places in 174 ms of which 3 ms to minimize.
[2024-06-01 03:22:39] [INFO ] Deduced a trap composed of 45 places in 193 ms of which 2 ms to minimize.
[2024-06-01 03:22:39] [INFO ] Deduced a trap composed of 44 places in 149 ms of which 3 ms to minimize.
[2024-06-01 03:22:39] [INFO ] Deduced a trap composed of 43 places in 201 ms of which 3 ms to minimize.
[2024-06-01 03:22:39] [INFO ] Deduced a trap composed of 33 places in 155 ms of which 3 ms to minimize.
[2024-06-01 03:22:39] [INFO ] Deduced a trap composed of 32 places in 149 ms of which 2 ms to minimize.
[2024-06-01 03:22:39] [INFO ] Deduced a trap composed of 36 places in 137 ms of which 3 ms to minimize.
[2024-06-01 03:22:40] [INFO ] Deduced a trap composed of 39 places in 168 ms of which 3 ms to minimize.
[2024-06-01 03:22:40] [INFO ] Deduced a trap composed of 37 places in 183 ms of which 4 ms to minimize.
[2024-06-01 03:22:40] [INFO ] Deduced a trap composed of 34 places in 159 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 349 unsolved
[2024-06-01 03:22:41] [INFO ] Deduced a trap composed of 46 places in 200 ms of which 3 ms to minimize.
[2024-06-01 03:22:41] [INFO ] Deduced a trap composed of 37 places in 190 ms of which 4 ms to minimize.
[2024-06-01 03:22:41] [INFO ] Deduced a trap composed of 26 places in 199 ms of which 3 ms to minimize.
[2024-06-01 03:22:42] [INFO ] Deduced a trap composed of 33 places in 209 ms of which 5 ms to minimize.
[2024-06-01 03:22:42] [INFO ] Deduced a trap composed of 32 places in 174 ms of which 3 ms to minimize.
[2024-06-01 03:22:42] [INFO ] Deduced a trap composed of 25 places in 190 ms of which 4 ms to minimize.
[2024-06-01 03:22:43] [INFO ] Deduced a trap composed of 32 places in 198 ms of which 3 ms to minimize.
[2024-06-01 03:22:43] [INFO ] Deduced a trap composed of 40 places in 145 ms of which 3 ms to minimize.
[2024-06-01 03:22:43] [INFO ] Deduced a trap composed of 43 places in 133 ms of which 3 ms to minimize.
[2024-06-01 03:22:43] [INFO ] Deduced a trap composed of 43 places in 116 ms of which 3 ms to minimize.
[2024-06-01 03:22:44] [INFO ] Deduced a trap composed of 41 places in 142 ms of which 3 ms to minimize.
[2024-06-01 03:22:44] [INFO ] Deduced a trap composed of 44 places in 130 ms of which 3 ms to minimize.
[2024-06-01 03:22:44] [INFO ] Deduced a trap composed of 33 places in 217 ms of which 4 ms to minimize.
[2024-06-01 03:22:44] [INFO ] Deduced a trap composed of 42 places in 157 ms of which 4 ms to minimize.
[2024-06-01 03:22:45] [INFO ] Deduced a trap composed of 32 places in 141 ms of which 3 ms to minimize.
[2024-06-01 03:22:45] [INFO ] Deduced a trap composed of 43 places in 120 ms of which 3 ms to minimize.
[2024-06-01 03:22:45] [INFO ] Deduced a trap composed of 40 places in 107 ms of which 2 ms to minimize.
[2024-06-01 03:22:45] [INFO ] Deduced a trap composed of 31 places in 133 ms of which 3 ms to minimize.
[2024-06-01 03:22:45] [INFO ] Deduced a trap composed of 42 places in 103 ms of which 2 ms to minimize.
[2024-06-01 03:22:46] [INFO ] Deduced a trap composed of 15 places in 157 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/215 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 349 unsolved
[2024-06-01 03:22:49] [INFO ] Deduced a trap composed of 34 places in 213 ms of which 3 ms to minimize.
[2024-06-01 03:22:49] [INFO ] Deduced a trap composed of 32 places in 136 ms of which 2 ms to minimize.
[2024-06-01 03:22:50] [INFO ] Deduced a trap composed of 40 places in 146 ms of which 2 ms to minimize.
[2024-06-01 03:22:50] [INFO ] Deduced a trap composed of 42 places in 138 ms of which 2 ms to minimize.
[2024-06-01 03:22:50] [INFO ] Deduced a trap composed of 41 places in 101 ms of which 2 ms to minimize.
[2024-06-01 03:22:51] [INFO ] Deduced a trap composed of 41 places in 115 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 6/56 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/215 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 349 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD309 is UNSAT
At refinement iteration 6 (OVERLAPS) 350/565 variables, 215/271 constraints. Problems are: Problem set: 2 solved, 347 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 565/565 variables, and 271 constraints, problems are : Problem set: 2 solved, 347 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 215/215 constraints, PredecessorRefiner: 349/349 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 2 solved, 347 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 347 unsolved
At refinement iteration 1 (OVERLAPS) 2/215 variables, 10/10 constraints. Problems are: Problem set: 2 solved, 347 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 46/56 constraints. Problems are: Problem set: 2 solved, 347 unsolved
[2024-06-01 03:23:03] [INFO ] Deduced a trap composed of 40 places in 97 ms of which 3 ms to minimize.
[2024-06-01 03:23:05] [INFO ] Deduced a trap composed of 5 places in 230 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/215 variables, 2/58 constraints. Problems are: Problem set: 2 solved, 347 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 0/58 constraints. Problems are: Problem set: 2 solved, 347 unsolved
At refinement iteration 5 (OVERLAPS) 350/565 variables, 215/273 constraints. Problems are: Problem set: 2 solved, 347 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 347/620 constraints. Problems are: Problem set: 2 solved, 347 unsolved
[2024-06-01 03:23:15] [INFO ] Deduced a trap composed of 32 places in 103 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 1/621 constraints. Problems are: Problem set: 2 solved, 347 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 565/565 variables, and 621 constraints, problems are : Problem set: 2 solved, 347 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 215/215 constraints, PredecessorRefiner: 347/349 constraints, Known Traps: 49/49 constraints]
After SMT, in 61165ms problems are : Problem set: 2 solved, 347 unsolved
Search for dead transitions found 2 dead transitions in 61209ms
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 : 215/255 places, 348/490 transitions.
Deduced a syphon composed of 1 places in 3 ms
Applied a total of 0 rules in 11 ms. Remains 215 /215 variables (removed 0) and now considering 348/348 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62775 ms. Remains : 215/255 places, 348/490 transitions.
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Support contains 29 out of 214 places after structural reductions.
FORMULA AutonomousCar-PT-05b-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 03:23:30] [INFO ] Flatten gal took : 133 ms
[2024-06-01 03:23:30] [INFO ] Flatten gal took : 64 ms
[2024-06-01 03:23:30] [INFO ] Input system was already deterministic with 348 transitions.
Reduction of identical properties reduced properties to check from 18 to 17
RANDOM walk for 40000 steps (90 resets) in 1257 ms. (31 steps per ms) remains 1/17 properties
BEST_FIRST walk for 40002 steps (50 resets) in 476 ms. (83 steps per ms) remains 1/1 properties
// Phase 1: matrix 348 rows 214 cols
[2024-06-01 03:23:31] [INFO ] Computed 10 invariants in 7 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 67/71 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 143/214 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 348/562 variables, 214/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/562 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/562 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 562/562 variables, and 224 constraints, problems are : Problem set: 0 solved, 1 unsolved in 213 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 214/214 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp17 is UNSAT
After SMT solving in domain Int declared 71/562 variables, and 3 constraints, problems are : Problem set: 1 solved, 0 unsolved in 31 ms.
Refiners :[Positive P Invariants (semi-flows): 3/10 constraints, State Equation: 0/214 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 261ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA AutonomousCar-PT-05b-LTLCardinality-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA AutonomousCar-PT-05b-LTLCardinality-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 6 simplifications.
FORMULA AutonomousCar-PT-05b-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 38 stabilizing places and 38 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 U (p1||G(!p0))))))'
Support contains 3 out of 214 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 214/214 places, 348/348 transitions.
Graph (trivial) has 197 edges and 214 vertex of which 4 / 214 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 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 81 place count 211 transition count 265
Reduce places removed 80 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 1 with 109 rules applied. Total rules applied 190 place count 131 transition count 236
Reduce places removed 17 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 18 rules applied. Total rules applied 208 place count 114 transition count 235
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 211 place count 113 transition count 233
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 212 place count 112 transition count 233
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 212 place count 112 transition count 226
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 226 place count 105 transition count 226
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 231 place count 100 transition count 221
Iterating global reduction 5 with 5 rules applied. Total rules applied 236 place count 100 transition count 221
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 238 place count 98 transition count 215
Iterating global reduction 5 with 2 rules applied. Total rules applied 240 place count 98 transition count 215
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 242 place count 98 transition count 213
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 243 place count 97 transition count 213
Performed 41 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 7 with 82 rules applied. Total rules applied 325 place count 56 transition count 171
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 326 place count 56 transition count 170
Discarding 8 places :
Symmetric choice reduction at 8 with 8 rule applications. Total rules 334 place count 48 transition count 126
Iterating global reduction 8 with 8 rules applied. Total rules applied 342 place count 48 transition count 126
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 345 place count 48 transition count 123
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 9 with 2 rules applied. Total rules applied 347 place count 47 transition count 122
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 349 place count 45 transition count 120
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 350 place count 44 transition count 120
Applied a total of 350 rules in 143 ms. Remains 44 /214 variables (removed 170) and now considering 120/348 (removed 228) transitions.
// Phase 1: matrix 120 rows 44 cols
[2024-06-01 03:23:32] [INFO ] Computed 8 invariants in 2 ms
[2024-06-01 03:23:32] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-06-01 03:23:32] [INFO ] Invariant cache hit.
[2024-06-01 03:23:32] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 03:23:32] [INFO ] Implicit Places using invariants and state equation in 154 ms returned [40, 43]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 253 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/214 places, 120/348 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 40 transition count 118
Applied a total of 4 rules in 13 ms. Remains 40 /42 variables (removed 2) and now considering 118/120 (removed 2) transitions.
// Phase 1: matrix 118 rows 40 cols
[2024-06-01 03:23:32] [INFO ] Computed 6 invariants in 2 ms
[2024-06-01 03:23:32] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-06-01 03:23:32] [INFO ] Invariant cache hit.
[2024-06-01 03:23:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 03:23:32] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 40/214 places, 118/348 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 575 ms. Remains : 40/214 places, 118/348 transitions.
Stuttering acceptance computed with spot in 237 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : AutonomousCar-PT-05b-LTLCardinality-02
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 2 ms.
FORMULA AutonomousCar-PT-05b-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05b-LTLCardinality-02 finished in 901 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((p1||G(p2))))&&p0))))'
Support contains 5 out of 214 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 348/348 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 207 transition count 341
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 207 transition count 341
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 206 transition count 340
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 206 transition count 340
Applied a total of 16 rules in 24 ms. Remains 206 /214 variables (removed 8) and now considering 340/348 (removed 8) transitions.
// Phase 1: matrix 340 rows 206 cols
[2024-06-01 03:23:32] [INFO ] Computed 10 invariants in 2 ms
[2024-06-01 03:23:33] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-06-01 03:23:33] [INFO ] Invariant cache hit.
[2024-06-01 03:23:33] [INFO ] Implicit Places using invariants and state equation in 330 ms returned []
Implicit Place search using SMT with State Equation took 471 ms to find 0 implicit places.
Running 339 sub problems to find dead transitions.
[2024-06-01 03:23:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 339 unsolved
[2024-06-01 03:23:39] [INFO ] Deduced a trap composed of 51 places in 288 ms of which 5 ms to minimize.
[2024-06-01 03:23:39] [INFO ] Deduced a trap composed of 31 places in 262 ms of which 4 ms to minimize.
[2024-06-01 03:23:39] [INFO ] Deduced a trap composed of 17 places in 225 ms of which 5 ms to minimize.
[2024-06-01 03:23:39] [INFO ] Deduced a trap composed of 24 places in 219 ms of which 3 ms to minimize.
[2024-06-01 03:23:40] [INFO ] Deduced a trap composed of 38 places in 245 ms of which 4 ms to minimize.
[2024-06-01 03:23:40] [INFO ] Deduced a trap composed of 14 places in 198 ms of which 3 ms to minimize.
[2024-06-01 03:23:40] [INFO ] Deduced a trap composed of 23 places in 196 ms of which 3 ms to minimize.
[2024-06-01 03:23:40] [INFO ] Deduced a trap composed of 33 places in 178 ms of which 5 ms to minimize.
[2024-06-01 03:23:41] [INFO ] Deduced a trap composed of 32 places in 125 ms of which 4 ms to minimize.
[2024-06-01 03:23:41] [INFO ] Deduced a trap composed of 36 places in 124 ms of which 2 ms to minimize.
[2024-06-01 03:23:41] [INFO ] Deduced a trap composed of 29 places in 121 ms of which 2 ms to minimize.
[2024-06-01 03:23:41] [INFO ] Deduced a trap composed of 32 places in 107 ms of which 2 ms to minimize.
[2024-06-01 03:23:41] [INFO ] Deduced a trap composed of 36 places in 130 ms of which 2 ms to minimize.
[2024-06-01 03:23:41] [INFO ] Deduced a trap composed of 31 places in 115 ms of which 3 ms to minimize.
[2024-06-01 03:23:42] [INFO ] Deduced a trap composed of 43 places in 132 ms of which 3 ms to minimize.
[2024-06-01 03:23:42] [INFO ] Deduced a trap composed of 39 places in 158 ms of which 3 ms to minimize.
[2024-06-01 03:23:42] [INFO ] Deduced a trap composed of 21 places in 146 ms of which 3 ms to minimize.
[2024-06-01 03:23:42] [INFO ] Deduced a trap composed of 39 places in 155 ms of which 3 ms to minimize.
[2024-06-01 03:23:42] [INFO ] Deduced a trap composed of 32 places in 185 ms of which 4 ms to minimize.
[2024-06-01 03:23:42] [INFO ] Deduced a trap composed of 37 places in 202 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 339 unsolved
[2024-06-01 03:23:43] [INFO ] Deduced a trap composed of 20 places in 94 ms of which 3 ms to minimize.
[2024-06-01 03:23:43] [INFO ] Deduced a trap composed of 35 places in 137 ms of which 2 ms to minimize.
[2024-06-01 03:23:43] [INFO ] Deduced a trap composed of 18 places in 169 ms of which 3 ms to minimize.
[2024-06-01 03:23:44] [INFO ] Deduced a trap composed of 25 places in 183 ms of which 3 ms to minimize.
[2024-06-01 03:23:44] [INFO ] Deduced a trap composed of 33 places in 204 ms of which 3 ms to minimize.
[2024-06-01 03:23:44] [INFO ] Deduced a trap composed of 42 places in 210 ms of which 3 ms to minimize.
[2024-06-01 03:23:45] [INFO ] Deduced a trap composed of 42 places in 154 ms of which 3 ms to minimize.
[2024-06-01 03:23:45] [INFO ] Deduced a trap composed of 40 places in 141 ms of which 3 ms to minimize.
[2024-06-01 03:23:45] [INFO ] Deduced a trap composed of 56 places in 204 ms of which 3 ms to minimize.
[2024-06-01 03:23:46] [INFO ] Deduced a trap composed of 41 places in 142 ms of which 3 ms to minimize.
[2024-06-01 03:23:46] [INFO ] Deduced a trap composed of 42 places in 132 ms of which 3 ms to minimize.
[2024-06-01 03:23:46] [INFO ] Deduced a trap composed of 41 places in 124 ms of which 3 ms to minimize.
[2024-06-01 03:23:46] [INFO ] Deduced a trap composed of 20 places in 150 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 13/43 constraints. Problems are: Problem set: 0 solved, 339 unsolved
[2024-06-01 03:23:51] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 2 ms to minimize.
[2024-06-01 03:23:52] [INFO ] Deduced a trap composed of 56 places in 207 ms of which 3 ms to minimize.
[2024-06-01 03:23:52] [INFO ] Deduced a trap composed of 32 places in 219 ms of which 4 ms to minimize.
[2024-06-01 03:23:52] [INFO ] Deduced a trap composed of 36 places in 208 ms of which 3 ms to minimize.
[2024-06-01 03:23:52] [INFO ] Deduced a trap composed of 40 places in 138 ms of which 2 ms to minimize.
[2024-06-01 03:23:52] [INFO ] Deduced a trap composed of 39 places in 125 ms of which 2 ms to minimize.
[2024-06-01 03:23:53] [INFO ] Deduced a trap composed of 39 places in 203 ms of which 3 ms to minimize.
[2024-06-01 03:23:53] [INFO ] Deduced a trap composed of 38 places in 216 ms of which 3 ms to minimize.
[2024-06-01 03:23:53] [INFO ] Deduced a trap composed of 14 places in 212 ms of which 2 ms to minimize.
[2024-06-01 03:23:54] [INFO ] Deduced a trap composed of 53 places in 185 ms of which 3 ms to minimize.
[2024-06-01 03:23:54] [INFO ] Deduced a trap composed of 31 places in 202 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 11/54 constraints. Problems are: Problem set: 0 solved, 339 unsolved
[2024-06-01 03:23:57] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 2 ms to minimize.
[2024-06-01 03:23:57] [INFO ] Deduced a trap composed of 42 places in 107 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 339 unsolved
[2024-06-01 03:24:00] [INFO ] Deduced a trap composed of 41 places in 127 ms of which 2 ms to minimize.
[2024-06-01 03:24:00] [INFO ] Deduced a trap composed of 42 places in 109 ms of which 3 ms to minimize.
[2024-06-01 03:24:00] [INFO ] Deduced a trap composed of 42 places in 96 ms of which 2 ms to minimize.
[2024-06-01 03:24:01] [INFO ] Deduced a trap composed of 39 places in 92 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 339 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 206/546 variables, and 60 constraints, problems are : Problem set: 0 solved, 339 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/206 constraints, PredecessorRefiner: 339/339 constraints, Known Traps: 50/50 constraints]
Escalating to Integer solving :Problem set: 0 solved, 339 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 50/60 constraints. Problems are: Problem set: 0 solved, 339 unsolved
[2024-06-01 03:24:07] [INFO ] Deduced a trap composed of 49 places in 247 ms of which 4 ms to minimize.
[2024-06-01 03:24:07] [INFO ] Deduced a trap composed of 37 places in 201 ms of which 3 ms to minimize.
[2024-06-01 03:24:08] [INFO ] Deduced a trap composed of 36 places in 201 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 339 unsolved
[2024-06-01 03:24:11] [INFO ] Deduced a trap composed of 23 places in 201 ms of which 4 ms to minimize.
[2024-06-01 03:24:12] [INFO ] Deduced a trap composed of 31 places in 129 ms of which 2 ms to minimize.
[2024-06-01 03:24:12] [INFO ] Deduced a trap composed of 31 places in 158 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 339 unsolved
[2024-06-01 03:24:16] [INFO ] Deduced a trap composed of 38 places in 125 ms of which 3 ms to minimize.
[2024-06-01 03:24:16] [INFO ] Deduced a trap composed of 51 places in 107 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 339 unsolved
[2024-06-01 03:24:19] [INFO ] Deduced a trap composed of 51 places in 125 ms of which 3 ms to minimize.
[2024-06-01 03:24:19] [INFO ] Deduced a trap composed of 51 places in 103 ms of which 2 ms to minimize.
[2024-06-01 03:24:19] [INFO ] Deduced a trap composed of 51 places in 111 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 3/71 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 8 (OVERLAPS) 340/546 variables, 206/277 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 339/616 constraints. Problems are: Problem set: 0 solved, 339 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 546/546 variables, and 616 constraints, problems are : Problem set: 0 solved, 339 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 339/339 constraints, Known Traps: 61/61 constraints]
After SMT, in 60662ms problems are : Problem set: 0 solved, 339 unsolved
Search for dead transitions found 0 dead transitions in 60669ms
Starting structural reductions in LTL mode, iteration 1 : 206/214 places, 340/348 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61166 ms. Remains : 206/214 places, 340/348 transitions.
Stuttering acceptance computed with spot in 340 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (AND (NOT p1) (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-05b-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 10 steps with 2 reset in 0 ms.
FORMULA AutonomousCar-PT-05b-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05b-LTLCardinality-03 finished in 61531 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 214 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 348/348 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 208 transition count 342
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 208 transition count 342
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 207 transition count 341
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 207 transition count 341
Applied a total of 14 rules in 20 ms. Remains 207 /214 variables (removed 7) and now considering 341/348 (removed 7) transitions.
// Phase 1: matrix 341 rows 207 cols
[2024-06-01 03:24:34] [INFO ] Computed 10 invariants in 5 ms
[2024-06-01 03:24:34] [INFO ] Implicit Places using invariants in 165 ms returned []
[2024-06-01 03:24:34] [INFO ] Invariant cache hit.
[2024-06-01 03:24:34] [INFO ] Implicit Places using invariants and state equation in 393 ms returned []
Implicit Place search using SMT with State Equation took 562 ms to find 0 implicit places.
Running 340 sub problems to find dead transitions.
[2024-06-01 03:24:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 1 (OVERLAPS) 1/207 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 340 unsolved
[2024-06-01 03:24:40] [INFO ] Deduced a trap composed of 20 places in 237 ms of which 4 ms to minimize.
[2024-06-01 03:24:40] [INFO ] Deduced a trap composed of 17 places in 273 ms of which 6 ms to minimize.
[2024-06-01 03:24:41] [INFO ] Deduced a trap composed of 37 places in 197 ms of which 3 ms to minimize.
[2024-06-01 03:24:41] [INFO ] Deduced a trap composed of 24 places in 208 ms of which 3 ms to minimize.
[2024-06-01 03:24:41] [INFO ] Deduced a trap composed of 35 places in 127 ms of which 2 ms to minimize.
[2024-06-01 03:24:41] [INFO ] Deduced a trap composed of 38 places in 125 ms of which 2 ms to minimize.
[2024-06-01 03:24:42] [INFO ] Deduced a trap composed of 14 places in 165 ms of which 3 ms to minimize.
[2024-06-01 03:24:42] [INFO ] Deduced a trap composed of 30 places in 155 ms of which 2 ms to minimize.
[2024-06-01 03:24:42] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 3 ms to minimize.
[2024-06-01 03:24:42] [INFO ] Deduced a trap composed of 34 places in 156 ms of which 3 ms to minimize.
[2024-06-01 03:24:42] [INFO ] Deduced a trap composed of 19 places in 207 ms of which 3 ms to minimize.
[2024-06-01 03:24:43] [INFO ] Deduced a trap composed of 32 places in 151 ms of which 3 ms to minimize.
[2024-06-01 03:24:43] [INFO ] Deduced a trap composed of 53 places in 161 ms of which 4 ms to minimize.
[2024-06-01 03:24:43] [INFO ] Deduced a trap composed of 25 places in 195 ms of which 3 ms to minimize.
[2024-06-01 03:24:43] [INFO ] Deduced a trap composed of 31 places in 196 ms of which 4 ms to minimize.
[2024-06-01 03:24:43] [INFO ] Deduced a trap composed of 31 places in 186 ms of which 3 ms to minimize.
[2024-06-01 03:24:43] [INFO ] Deduced a trap composed of 31 places in 185 ms of which 3 ms to minimize.
[2024-06-01 03:24:44] [INFO ] Deduced a trap composed of 21 places in 198 ms of which 4 ms to minimize.
[2024-06-01 03:24:44] [INFO ] Deduced a trap composed of 40 places in 143 ms of which 3 ms to minimize.
[2024-06-01 03:24:45] [INFO ] Deduced a trap composed of 31 places in 188 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 340 unsolved
[2024-06-01 03:24:45] [INFO ] Deduced a trap composed of 35 places in 229 ms of which 3 ms to minimize.
[2024-06-01 03:24:45] [INFO ] Deduced a trap composed of 34 places in 195 ms of which 3 ms to minimize.
[2024-06-01 03:24:46] [INFO ] Deduced a trap composed of 35 places in 223 ms of which 3 ms to minimize.
[2024-06-01 03:24:46] [INFO ] Deduced a trap composed of 38 places in 225 ms of which 4 ms to minimize.
[2024-06-01 03:24:46] [INFO ] Deduced a trap composed of 38 places in 208 ms of which 4 ms to minimize.
[2024-06-01 03:24:46] [INFO ] Deduced a trap composed of 37 places in 224 ms of which 4 ms to minimize.
[2024-06-01 03:24:47] [INFO ] Deduced a trap composed of 31 places in 244 ms of which 4 ms to minimize.
[2024-06-01 03:24:47] [INFO ] Deduced a trap composed of 39 places in 183 ms of which 3 ms to minimize.
[2024-06-01 03:24:47] [INFO ] Deduced a trap composed of 42 places in 129 ms of which 2 ms to minimize.
[2024-06-01 03:24:47] [INFO ] Deduced a trap composed of 41 places in 117 ms of which 3 ms to minimize.
[2024-06-01 03:24:48] [INFO ] Deduced a trap composed of 39 places in 103 ms of which 2 ms to minimize.
[2024-06-01 03:24:48] [INFO ] Deduced a trap composed of 42 places in 85 ms of which 2 ms to minimize.
[2024-06-01 03:24:48] [INFO ] Deduced a trap composed of 42 places in 102 ms of which 3 ms to minimize.
[2024-06-01 03:24:48] [INFO ] Deduced a trap composed of 42 places in 109 ms of which 3 ms to minimize.
[2024-06-01 03:24:48] [INFO ] Deduced a trap composed of 40 places in 104 ms of which 2 ms to minimize.
[2024-06-01 03:24:49] [INFO ] Deduced a trap composed of 41 places in 121 ms of which 2 ms to minimize.
[2024-06-01 03:24:49] [INFO ] Deduced a trap composed of 42 places in 105 ms of which 2 ms to minimize.
[2024-06-01 03:24:49] [INFO ] Deduced a trap composed of 40 places in 103 ms of which 2 ms to minimize.
[2024-06-01 03:24:49] [INFO ] Deduced a trap composed of 42 places in 101 ms of which 3 ms to minimize.
[2024-06-01 03:24:50] [INFO ] Deduced a trap composed of 21 places in 216 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/207 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 340 unsolved
[2024-06-01 03:24:53] [INFO ] Deduced a trap composed of 52 places in 194 ms of which 3 ms to minimize.
[2024-06-01 03:24:53] [INFO ] Deduced a trap composed of 42 places in 172 ms of which 3 ms to minimize.
[2024-06-01 03:24:53] [INFO ] Deduced a trap composed of 42 places in 156 ms of which 3 ms to minimize.
[2024-06-01 03:24:54] [INFO ] Deduced a trap composed of 31 places in 134 ms of which 3 ms to minimize.
[2024-06-01 03:24:54] [INFO ] Deduced a trap composed of 41 places in 135 ms of which 3 ms to minimize.
[2024-06-01 03:24:54] [INFO ] Deduced a trap composed of 40 places in 121 ms of which 3 ms to minimize.
[2024-06-01 03:24:54] [INFO ] Deduced a trap composed of 39 places in 120 ms of which 3 ms to minimize.
[2024-06-01 03:24:55] [INFO ] Deduced a trap composed of 39 places in 128 ms of which 2 ms to minimize.
[2024-06-01 03:24:56] [INFO ] Deduced a trap composed of 30 places in 239 ms of which 3 ms to minimize.
[2024-06-01 03:24:56] [INFO ] Deduced a trap composed of 5 places in 159 ms of which 2 ms to minimize.
[2024-06-01 03:24:56] [INFO ] Deduced a trap composed of 14 places in 154 ms of which 3 ms to minimize.
[2024-06-01 03:24:56] [INFO ] Deduced a trap composed of 43 places in 217 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 12/62 constraints. Problems are: Problem set: 0 solved, 340 unsolved
[2024-06-01 03:24:58] [INFO ] Deduced a trap composed of 39 places in 178 ms of which 3 ms to minimize.
[2024-06-01 03:24:59] [INFO ] Deduced a trap composed of 33 places in 203 ms of which 3 ms to minimize.
[2024-06-01 03:24:59] [INFO ] Deduced a trap composed of 34 places in 220 ms of which 3 ms to minimize.
[2024-06-01 03:24:59] [INFO ] Deduced a trap composed of 36 places in 188 ms of which 3 ms to minimize.
[2024-06-01 03:24:59] [INFO ] Deduced a trap composed of 36 places in 179 ms of which 3 ms to minimize.
[2024-06-01 03:25:00] [INFO ] Deduced a trap composed of 44 places in 265 ms of which 4 ms to minimize.
[2024-06-01 03:25:00] [INFO ] Deduced a trap composed of 39 places in 228 ms of which 4 ms to minimize.
[2024-06-01 03:25:00] [INFO ] Deduced a trap composed of 26 places in 214 ms of which 3 ms to minimize.
[2024-06-01 03:25:00] [INFO ] Deduced a trap composed of 33 places in 206 ms of which 3 ms to minimize.
[2024-06-01 03:25:01] [INFO ] Deduced a trap composed of 32 places in 197 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 10/72 constraints. Problems are: Problem set: 0 solved, 340 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 207/548 variables, and 72 constraints, problems are : Problem set: 0 solved, 340 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/207 constraints, PredecessorRefiner: 340/340 constraints, Known Traps: 62/62 constraints]
Escalating to Integer solving :Problem set: 0 solved, 340 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 1 (OVERLAPS) 1/207 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 62/72 constraints. Problems are: Problem set: 0 solved, 340 unsolved
[2024-06-01 03:25:10] [INFO ] Deduced a trap composed of 41 places in 118 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/207 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 5 (OVERLAPS) 341/548 variables, 207/280 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 340/620 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/548 variables, 0/620 constraints. Problems are: Problem set: 0 solved, 340 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 548/548 variables, and 620 constraints, problems are : Problem set: 0 solved, 340 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 207/207 constraints, PredecessorRefiner: 340/340 constraints, Known Traps: 63/63 constraints]
After SMT, in 60421ms problems are : Problem set: 0 solved, 340 unsolved
Search for dead transitions found 0 dead transitions in 60425ms
Starting structural reductions in LTL mode, iteration 1 : 207/214 places, 341/348 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61009 ms. Remains : 207/214 places, 341/348 transitions.
Stuttering acceptance computed with spot in 229 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-05b-LTLCardinality-06
Product exploration explored 100000 steps with 2835 reset in 441 ms.
Product exploration explored 100000 steps with 2818 reset in 276 ms.
Computed a total of 36 stabilizing places and 36 stable transitions
Computed a total of 36 stabilizing places and 36 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 98 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 162 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 137 steps (0 resets) in 6 ms. (19 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 1 factoid took 103 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 161 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 173 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2024-06-01 03:25:37] [INFO ] Invariant cache hit.
[2024-06-01 03:25:37] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2024-06-01 03:25:37] [INFO ] [Real]Absence check using state equation in 213 ms returned sat
[2024-06-01 03:25:37] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 03:25:37] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2024-06-01 03:25:38] [INFO ] [Nat]Absence check using state equation in 236 ms returned sat
[2024-06-01 03:25:38] [INFO ] Deduced a trap composed of 41 places in 110 ms of which 2 ms to minimize.
[2024-06-01 03:25:38] [INFO ] Deduced a trap composed of 39 places in 99 ms of which 2 ms to minimize.
[2024-06-01 03:25:38] [INFO ] Deduced a trap composed of 42 places in 115 ms of which 2 ms to minimize.
[2024-06-01 03:25:38] [INFO ] Deduced a trap composed of 42 places in 87 ms of which 1 ms to minimize.
[2024-06-01 03:25:38] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 519 ms
[2024-06-01 03:25:38] [INFO ] Computed and/alt/rep : 183/310/183 causal constraints (skipped 157 transitions) in 67 ms.
[2024-06-01 03:25:39] [INFO ] Added : 136 causal constraints over 28 iterations in 985 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 207 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 207/207 places, 341/341 transitions.
Applied a total of 0 rules in 5 ms. Remains 207 /207 variables (removed 0) and now considering 341/341 (removed 0) transitions.
[2024-06-01 03:25:39] [INFO ] Invariant cache hit.
[2024-06-01 03:25:39] [INFO ] Implicit Places using invariants in 162 ms returned []
[2024-06-01 03:25:39] [INFO ] Invariant cache hit.
[2024-06-01 03:25:40] [INFO ] Implicit Places using invariants and state equation in 385 ms returned []
Implicit Place search using SMT with State Equation took 556 ms to find 0 implicit places.
Running 340 sub problems to find dead transitions.
[2024-06-01 03:25:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 1 (OVERLAPS) 1/207 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 340 unsolved
[2024-06-01 03:25:45] [INFO ] Deduced a trap composed of 20 places in 225 ms of which 4 ms to minimize.
[2024-06-01 03:25:45] [INFO ] Deduced a trap composed of 17 places in 255 ms of which 4 ms to minimize.
[2024-06-01 03:25:45] [INFO ] Deduced a trap composed of 37 places in 208 ms of which 4 ms to minimize.
[2024-06-01 03:25:45] [INFO ] Deduced a trap composed of 24 places in 209 ms of which 3 ms to minimize.
[2024-06-01 03:25:46] [INFO ] Deduced a trap composed of 35 places in 186 ms of which 3 ms to minimize.
[2024-06-01 03:25:46] [INFO ] Deduced a trap composed of 38 places in 239 ms of which 4 ms to minimize.
[2024-06-01 03:25:46] [INFO ] Deduced a trap composed of 14 places in 223 ms of which 4 ms to minimize.
[2024-06-01 03:25:47] [INFO ] Deduced a trap composed of 30 places in 197 ms of which 3 ms to minimize.
[2024-06-01 03:25:47] [INFO ] Deduced a trap composed of 23 places in 154 ms of which 3 ms to minimize.
[2024-06-01 03:25:47] [INFO ] Deduced a trap composed of 34 places in 167 ms of which 3 ms to minimize.
[2024-06-01 03:25:47] [INFO ] Deduced a trap composed of 19 places in 189 ms of which 3 ms to minimize.
[2024-06-01 03:25:47] [INFO ] Deduced a trap composed of 32 places in 209 ms of which 3 ms to minimize.
[2024-06-01 03:25:48] [INFO ] Deduced a trap composed of 53 places in 196 ms of which 4 ms to minimize.
[2024-06-01 03:25:48] [INFO ] Deduced a trap composed of 25 places in 172 ms of which 2 ms to minimize.
[2024-06-01 03:25:48] [INFO ] Deduced a trap composed of 31 places in 171 ms of which 2 ms to minimize.
[2024-06-01 03:25:48] [INFO ] Deduced a trap composed of 31 places in 148 ms of which 2 ms to minimize.
[2024-06-01 03:25:48] [INFO ] Deduced a trap composed of 31 places in 145 ms of which 2 ms to minimize.
[2024-06-01 03:25:49] [INFO ] Deduced a trap composed of 21 places in 203 ms of which 4 ms to minimize.
[2024-06-01 03:25:49] [INFO ] Deduced a trap composed of 40 places in 148 ms of which 3 ms to minimize.
[2024-06-01 03:25:49] [INFO ] Deduced a trap composed of 31 places in 201 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 340 unsolved
[2024-06-01 03:25:50] [INFO ] Deduced a trap composed of 35 places in 185 ms of which 3 ms to minimize.
[2024-06-01 03:25:50] [INFO ] Deduced a trap composed of 34 places in 182 ms of which 3 ms to minimize.
[2024-06-01 03:25:50] [INFO ] Deduced a trap composed of 35 places in 156 ms of which 3 ms to minimize.
[2024-06-01 03:25:51] [INFO ] Deduced a trap composed of 38 places in 142 ms of which 3 ms to minimize.
[2024-06-01 03:25:51] [INFO ] Deduced a trap composed of 38 places in 119 ms of which 2 ms to minimize.
[2024-06-01 03:25:51] [INFO ] Deduced a trap composed of 37 places in 148 ms of which 3 ms to minimize.
[2024-06-01 03:25:51] [INFO ] Deduced a trap composed of 31 places in 240 ms of which 4 ms to minimize.
[2024-06-01 03:25:52] [INFO ] Deduced a trap composed of 39 places in 186 ms of which 3 ms to minimize.
[2024-06-01 03:25:52] [INFO ] Deduced a trap composed of 42 places in 125 ms of which 3 ms to minimize.
[2024-06-01 03:25:52] [INFO ] Deduced a trap composed of 41 places in 113 ms of which 3 ms to minimize.
[2024-06-01 03:25:52] [INFO ] Deduced a trap composed of 39 places in 113 ms of which 2 ms to minimize.
[2024-06-01 03:25:52] [INFO ] Deduced a trap composed of 42 places in 94 ms of which 2 ms to minimize.
[2024-06-01 03:25:53] [INFO ] Deduced a trap composed of 42 places in 104 ms of which 2 ms to minimize.
[2024-06-01 03:25:53] [INFO ] Deduced a trap composed of 42 places in 108 ms of which 2 ms to minimize.
[2024-06-01 03:25:53] [INFO ] Deduced a trap composed of 40 places in 104 ms of which 2 ms to minimize.
[2024-06-01 03:25:53] [INFO ] Deduced a trap composed of 41 places in 127 ms of which 3 ms to minimize.
[2024-06-01 03:25:53] [INFO ] Deduced a trap composed of 42 places in 107 ms of which 2 ms to minimize.
[2024-06-01 03:25:54] [INFO ] Deduced a trap composed of 40 places in 103 ms of which 2 ms to minimize.
[2024-06-01 03:25:54] [INFO ] Deduced a trap composed of 42 places in 103 ms of which 2 ms to minimize.
[2024-06-01 03:25:54] [INFO ] Deduced a trap composed of 21 places in 233 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/207 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 340 unsolved
[2024-06-01 03:25:57] [INFO ] Deduced a trap composed of 52 places in 204 ms of which 3 ms to minimize.
[2024-06-01 03:25:58] [INFO ] Deduced a trap composed of 42 places in 149 ms of which 3 ms to minimize.
[2024-06-01 03:25:58] [INFO ] Deduced a trap composed of 42 places in 156 ms of which 3 ms to minimize.
[2024-06-01 03:25:58] [INFO ] Deduced a trap composed of 31 places in 142 ms of which 3 ms to minimize.
[2024-06-01 03:25:58] [INFO ] Deduced a trap composed of 41 places in 132 ms of which 3 ms to minimize.
[2024-06-01 03:25:58] [INFO ] Deduced a trap composed of 40 places in 131 ms of which 3 ms to minimize.
[2024-06-01 03:25:59] [INFO ] Deduced a trap composed of 39 places in 109 ms of which 2 ms to minimize.
[2024-06-01 03:25:59] [INFO ] Deduced a trap composed of 39 places in 126 ms of which 3 ms to minimize.
[2024-06-01 03:26:00] [INFO ] Deduced a trap composed of 30 places in 216 ms of which 4 ms to minimize.
[2024-06-01 03:26:00] [INFO ] Deduced a trap composed of 5 places in 155 ms of which 2 ms to minimize.
[2024-06-01 03:26:00] [INFO ] Deduced a trap composed of 14 places in 160 ms of which 3 ms to minimize.
[2024-06-01 03:26:01] [INFO ] Deduced a trap composed of 43 places in 231 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 12/62 constraints. Problems are: Problem set: 0 solved, 340 unsolved
[2024-06-01 03:26:02] [INFO ] Deduced a trap composed of 39 places in 149 ms of which 3 ms to minimize.
[2024-06-01 03:26:03] [INFO ] Deduced a trap composed of 33 places in 212 ms of which 3 ms to minimize.
[2024-06-01 03:26:03] [INFO ] Deduced a trap composed of 34 places in 201 ms of which 7 ms to minimize.
[2024-06-01 03:26:03] [INFO ] Deduced a trap composed of 36 places in 199 ms of which 3 ms to minimize.
[2024-06-01 03:26:03] [INFO ] Deduced a trap composed of 36 places in 171 ms of which 4 ms to minimize.
[2024-06-01 03:26:04] [INFO ] Deduced a trap composed of 44 places in 233 ms of which 3 ms to minimize.
[2024-06-01 03:26:04] [INFO ] Deduced a trap composed of 39 places in 206 ms of which 3 ms to minimize.
[2024-06-01 03:26:04] [INFO ] Deduced a trap composed of 26 places in 211 ms of which 3 ms to minimize.
[2024-06-01 03:26:05] [INFO ] Deduced a trap composed of 33 places in 211 ms of which 3 ms to minimize.
[2024-06-01 03:26:05] [INFO ] Deduced a trap composed of 32 places in 209 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 10/72 constraints. Problems are: Problem set: 0 solved, 340 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 1.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 1.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 207/548 variables, and 72 constraints, problems are : Problem set: 0 solved, 340 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/207 constraints, PredecessorRefiner: 340/340 constraints, Known Traps: 62/62 constraints]
Escalating to Integer solving :Problem set: 0 solved, 340 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 1 (OVERLAPS) 1/207 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 62/72 constraints. Problems are: Problem set: 0 solved, 340 unsolved
[2024-06-01 03:26:15] [INFO ] Deduced a trap composed of 41 places in 100 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/207 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 5 (OVERLAPS) 341/548 variables, 207/280 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 340/620 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/548 variables, 0/620 constraints. Problems are: Problem set: 0 solved, 340 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 548/548 variables, and 620 constraints, problems are : Problem set: 0 solved, 340 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 207/207 constraints, PredecessorRefiner: 340/340 constraints, Known Traps: 63/63 constraints]
After SMT, in 60511ms problems are : Problem set: 0 solved, 340 unsolved
Search for dead transitions found 0 dead transitions in 60519ms
Finished structural reductions in LTL mode , in 1 iterations and 61082 ms. Remains : 207/207 places, 341/341 transitions.
Computed a total of 36 stabilizing places and 36 stable transitions
Computed a total of 36 stabilizing places and 36 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 103 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 200 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 135 steps (0 resets) in 6 ms. (19 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 1 factoid took 136 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 193 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 193 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2024-06-01 03:26:41] [INFO ] Invariant cache hit.
[2024-06-01 03:26:41] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2024-06-01 03:26:42] [INFO ] [Real]Absence check using state equation in 257 ms returned sat
[2024-06-01 03:26:42] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 03:26:42] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2024-06-01 03:26:42] [INFO ] [Nat]Absence check using state equation in 250 ms returned sat
[2024-06-01 03:26:42] [INFO ] Deduced a trap composed of 41 places in 100 ms of which 2 ms to minimize.
[2024-06-01 03:26:43] [INFO ] Deduced a trap composed of 39 places in 100 ms of which 2 ms to minimize.
[2024-06-01 03:26:43] [INFO ] Deduced a trap composed of 42 places in 96 ms of which 2 ms to minimize.
[2024-06-01 03:26:43] [INFO ] Deduced a trap composed of 42 places in 88 ms of which 2 ms to minimize.
[2024-06-01 03:26:43] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 489 ms
[2024-06-01 03:26:43] [INFO ] Computed and/alt/rep : 183/310/183 causal constraints (skipped 157 transitions) in 66 ms.
[2024-06-01 03:26:44] [INFO ] Added : 136 causal constraints over 28 iterations in 1088 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 198 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2829 reset in 177 ms.
Product exploration explored 100000 steps with 2829 reset in 449 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 190 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 207 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 207/207 places, 341/341 transitions.
Graph (trivial) has 192 edges and 207 vertex of which 4 / 207 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 74 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 74 rules applied. Total rules applied 75 place count 205 transition count 339
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 87 place count 205 transition count 327
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 87 place count 205 transition count 327
Deduced a syphon composed of 90 places in 0 ms
Iterating global reduction 2 with 16 rules applied. Total rules applied 103 place count 205 transition count 327
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 165 place count 143 transition count 265
Deduced a syphon composed of 29 places in 0 ms
Iterating global reduction 2 with 62 rules applied. Total rules applied 227 place count 143 transition count 265
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 83 places in 0 ms
Iterating global reduction 2 with 54 rules applied. Total rules applied 281 place count 143 transition count 271
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 283 place count 143 transition count 269
Discarding 48 places :
Symmetric choice reduction at 3 with 48 rule applications. Total rules 331 place count 95 transition count 176
Deduced a syphon composed of 46 places in 0 ms
Iterating global reduction 3 with 48 rules applied. Total rules applied 379 place count 95 transition count 176
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 389 place count 95 transition count 166
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 394 place count 90 transition count 161
Deduced a syphon composed of 41 places in 0 ms
Iterating global reduction 4 with 5 rules applied. Total rules applied 399 place count 90 transition count 161
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 42 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 400 place count 90 transition count 161
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 402 place count 88 transition count 159
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 404 place count 88 transition count 159
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 43 places in 0 ms
Iterating global reduction 4 with 3 rules applied. Total rules applied 407 place count 88 transition count 169
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 408 place count 87 transition count 167
Deduced a syphon composed of 42 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 409 place count 87 transition count 167
Deduced a syphon composed of 42 places in 0 ms
Applied a total of 409 rules in 114 ms. Remains 87 /207 variables (removed 120) and now considering 167/341 (removed 174) transitions.
[2024-06-01 03:26:45] [INFO ] Redundant transitions in 9 ms returned []
Running 166 sub problems to find dead transitions.
// Phase 1: matrix 167 rows 87 cols
[2024-06-01 03:26:45] [INFO ] Computed 9 invariants in 2 ms
[2024-06-01 03:26:45] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 1/87 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-06-01 03:26:47] [INFO ] Deduced a trap composed of 3 places in 104 ms of which 2 ms to minimize.
[2024-06-01 03:26:47] [INFO ] Deduced a trap composed of 4 places in 145 ms of which 2 ms to minimize.
[2024-06-01 03:26:47] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-06-01 03:26:48] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 2 ms to minimize.
[2024-06-01 03:26:48] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 4 ms to minimize.
[2024-06-01 03:26:48] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 1 ms to minimize.
[2024-06-01 03:26:48] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 2 ms to minimize.
[2024-06-01 03:26:48] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
[2024-06-01 03:26:48] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 1 ms to minimize.
[2024-06-01 03:26:48] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2024-06-01 03:26:48] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 3 ms to minimize.
Problem TDEAD14 is UNSAT
[2024-06-01 03:26:48] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 7 ms to minimize.
Problem TDEAD21 is UNSAT
[2024-06-01 03:26:48] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 2 ms to minimize.
Problem TDEAD54 is UNSAT
[2024-06-01 03:26:48] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 1 ms to minimize.
Problem TDEAD55 is UNSAT
[2024-06-01 03:26:49] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 2 ms to minimize.
Problem TDEAD56 is UNSAT
[2024-06-01 03:26:49] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 1 ms to minimize.
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
[2024-06-01 03:26:49] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 1 ms to minimize.
[2024-06-01 03:26:49] [INFO ] Deduced a trap composed of 2 places in 111 ms of which 1 ms to minimize.
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 18/27 constraints. Problems are: Problem set: 37 solved, 129 unsolved
[2024-06-01 03:26:50] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 1/28 constraints. Problems are: Problem set: 37 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/28 constraints. Problems are: Problem set: 37 solved, 129 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
At refinement iteration 5 (OVERLAPS) 166/253 variables, 87/115 constraints. Problems are: Problem set: 52 solved, 114 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 58/173 constraints. Problems are: Problem set: 52 solved, 114 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/253 variables, 0/173 constraints. Problems are: Problem set: 52 solved, 114 unsolved
At refinement iteration 8 (OVERLAPS) 1/254 variables, 1/174 constraints. Problems are: Problem set: 52 solved, 114 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/254 variables, 0/174 constraints. Problems are: Problem set: 52 solved, 114 unsolved
At refinement iteration 10 (OVERLAPS) 0/254 variables, 0/174 constraints. Problems are: Problem set: 52 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Real declared 254/254 variables, and 174 constraints, problems are : Problem set: 52 solved, 114 unsolved in 9478 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 87/87 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 52 solved, 114 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 52 solved, 114 unsolved
At refinement iteration 1 (OVERLAPS) 43/87 variables, 9/9 constraints. Problems are: Problem set: 52 solved, 114 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 19/28 constraints. Problems are: Problem set: 52 solved, 114 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/28 constraints. Problems are: Problem set: 52 solved, 114 unsolved
At refinement iteration 4 (OVERLAPS) 166/253 variables, 87/115 constraints. Problems are: Problem set: 52 solved, 114 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 58/173 constraints. Problems are: Problem set: 52 solved, 114 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 114/287 constraints. Problems are: Problem set: 52 solved, 114 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/253 variables, 0/287 constraints. Problems are: Problem set: 52 solved, 114 unsolved
At refinement iteration 8 (OVERLAPS) 1/254 variables, 1/288 constraints. Problems are: Problem set: 52 solved, 114 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/254 variables, 0/288 constraints. Problems are: Problem set: 52 solved, 114 unsolved
At refinement iteration 10 (OVERLAPS) 0/254 variables, 0/288 constraints. Problems are: Problem set: 52 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Int declared 254/254 variables, and 288 constraints, problems are : Problem set: 52 solved, 114 unsolved in 8392 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 87/87 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 114/166 constraints, Known Traps: 19/19 constraints]
After SMT, in 18213ms problems are : Problem set: 52 solved, 114 unsolved
Search for dead transitions found 52 dead transitions in 18217ms
Found 52 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 52 transitions
Dead transitions reduction (with SMT) removed 52 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 87/207 places, 115/341 transitions.
Graph (complete) has 354 edges and 87 vertex of which 45 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.4 ms
Discarding 42 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 20 ms. Remains 45 /87 variables (removed 42) and now considering 115/115 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 45/207 places, 115/341 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 18373 ms. Remains : 45/207 places, 115/341 transitions.
Support contains 2 out of 207 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 207/207 places, 341/341 transitions.
Applied a total of 0 rules in 4 ms. Remains 207 /207 variables (removed 0) and now considering 341/341 (removed 0) transitions.
// Phase 1: matrix 341 rows 207 cols
[2024-06-01 03:27:04] [INFO ] Computed 10 invariants in 3 ms
[2024-06-01 03:27:04] [INFO ] Implicit Places using invariants in 200 ms returned []
[2024-06-01 03:27:04] [INFO ] Invariant cache hit.
[2024-06-01 03:27:04] [INFO ] Implicit Places using invariants and state equation in 504 ms returned []
Implicit Place search using SMT with State Equation took 716 ms to find 0 implicit places.
Running 340 sub problems to find dead transitions.
[2024-06-01 03:27:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 1 (OVERLAPS) 1/207 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 340 unsolved
[2024-06-01 03:27:10] [INFO ] Deduced a trap composed of 20 places in 228 ms of which 4 ms to minimize.
[2024-06-01 03:27:11] [INFO ] Deduced a trap composed of 17 places in 250 ms of which 4 ms to minimize.
[2024-06-01 03:27:11] [INFO ] Deduced a trap composed of 37 places in 218 ms of which 4 ms to minimize.
[2024-06-01 03:27:11] [INFO ] Deduced a trap composed of 24 places in 172 ms of which 3 ms to minimize.
[2024-06-01 03:27:11] [INFO ] Deduced a trap composed of 35 places in 229 ms of which 4 ms to minimize.
[2024-06-01 03:27:12] [INFO ] Deduced a trap composed of 38 places in 210 ms of which 3 ms to minimize.
[2024-06-01 03:27:12] [INFO ] Deduced a trap composed of 14 places in 231 ms of which 3 ms to minimize.
[2024-06-01 03:27:12] [INFO ] Deduced a trap composed of 30 places in 191 ms of which 3 ms to minimize.
[2024-06-01 03:27:12] [INFO ] Deduced a trap composed of 23 places in 180 ms of which 3 ms to minimize.
[2024-06-01 03:27:12] [INFO ] Deduced a trap composed of 34 places in 180 ms of which 3 ms to minimize.
[2024-06-01 03:27:13] [INFO ] Deduced a trap composed of 19 places in 146 ms of which 3 ms to minimize.
[2024-06-01 03:27:13] [INFO ] Deduced a trap composed of 32 places in 195 ms of which 3 ms to minimize.
[2024-06-01 03:27:13] [INFO ] Deduced a trap composed of 53 places in 182 ms of which 3 ms to minimize.
[2024-06-01 03:27:13] [INFO ] Deduced a trap composed of 25 places in 124 ms of which 2 ms to minimize.
[2024-06-01 03:27:13] [INFO ] Deduced a trap composed of 31 places in 118 ms of which 2 ms to minimize.
[2024-06-01 03:27:13] [INFO ] Deduced a trap composed of 31 places in 114 ms of which 2 ms to minimize.
[2024-06-01 03:27:14] [INFO ] Deduced a trap composed of 31 places in 129 ms of which 2 ms to minimize.
[2024-06-01 03:27:14] [INFO ] Deduced a trap composed of 21 places in 167 ms of which 3 ms to minimize.
[2024-06-01 03:27:15] [INFO ] Deduced a trap composed of 40 places in 167 ms of which 2 ms to minimize.
[2024-06-01 03:27:15] [INFO ] Deduced a trap composed of 31 places in 200 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 340 unsolved
[2024-06-01 03:27:15] [INFO ] Deduced a trap composed of 35 places in 179 ms of which 3 ms to minimize.
[2024-06-01 03:27:15] [INFO ] Deduced a trap composed of 34 places in 201 ms of which 3 ms to minimize.
[2024-06-01 03:27:16] [INFO ] Deduced a trap composed of 35 places in 201 ms of which 4 ms to minimize.
[2024-06-01 03:27:16] [INFO ] Deduced a trap composed of 38 places in 233 ms of which 4 ms to minimize.
[2024-06-01 03:27:16] [INFO ] Deduced a trap composed of 38 places in 209 ms of which 3 ms to minimize.
[2024-06-01 03:27:16] [INFO ] Deduced a trap composed of 37 places in 200 ms of which 3 ms to minimize.
[2024-06-01 03:27:17] [INFO ] Deduced a trap composed of 31 places in 250 ms of which 4 ms to minimize.
[2024-06-01 03:27:17] [INFO ] Deduced a trap composed of 39 places in 178 ms of which 3 ms to minimize.
[2024-06-01 03:27:17] [INFO ] Deduced a trap composed of 42 places in 125 ms of which 2 ms to minimize.
[2024-06-01 03:27:17] [INFO ] Deduced a trap composed of 41 places in 108 ms of which 3 ms to minimize.
[2024-06-01 03:27:18] [INFO ] Deduced a trap composed of 39 places in 119 ms of which 2 ms to minimize.
[2024-06-01 03:27:18] [INFO ] Deduced a trap composed of 42 places in 83 ms of which 1 ms to minimize.
[2024-06-01 03:27:18] [INFO ] Deduced a trap composed of 42 places in 111 ms of which 2 ms to minimize.
[2024-06-01 03:27:18] [INFO ] Deduced a trap composed of 42 places in 104 ms of which 2 ms to minimize.
[2024-06-01 03:27:19] [INFO ] Deduced a trap composed of 40 places in 101 ms of which 2 ms to minimize.
[2024-06-01 03:27:19] [INFO ] Deduced a trap composed of 41 places in 118 ms of which 2 ms to minimize.
[2024-06-01 03:27:19] [INFO ] Deduced a trap composed of 42 places in 117 ms of which 3 ms to minimize.
[2024-06-01 03:27:19] [INFO ] Deduced a trap composed of 40 places in 77 ms of which 2 ms to minimize.
[2024-06-01 03:27:19] [INFO ] Deduced a trap composed of 42 places in 73 ms of which 2 ms to minimize.
[2024-06-01 03:27:20] [INFO ] Deduced a trap composed of 21 places in 217 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/207 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 340 unsolved
[2024-06-01 03:27:23] [INFO ] Deduced a trap composed of 52 places in 198 ms of which 3 ms to minimize.
[2024-06-01 03:27:23] [INFO ] Deduced a trap composed of 42 places in 171 ms of which 3 ms to minimize.
[2024-06-01 03:27:24] [INFO ] Deduced a trap composed of 42 places in 158 ms of which 3 ms to minimize.
[2024-06-01 03:27:24] [INFO ] Deduced a trap composed of 31 places in 144 ms of which 3 ms to minimize.
[2024-06-01 03:27:24] [INFO ] Deduced a trap composed of 41 places in 142 ms of which 3 ms to minimize.
[2024-06-01 03:27:24] [INFO ] Deduced a trap composed of 40 places in 135 ms of which 2 ms to minimize.
[2024-06-01 03:27:24] [INFO ] Deduced a trap composed of 39 places in 72 ms of which 1 ms to minimize.
[2024-06-01 03:27:25] [INFO ] Deduced a trap composed of 39 places in 106 ms of which 2 ms to minimize.
[2024-06-01 03:27:25] [INFO ] Deduced a trap composed of 30 places in 127 ms of which 3 ms to minimize.
[2024-06-01 03:27:25] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 2 ms to minimize.
[2024-06-01 03:27:26] [INFO ] Deduced a trap composed of 14 places in 146 ms of which 1 ms to minimize.
[2024-06-01 03:27:26] [INFO ] Deduced a trap composed of 43 places in 153 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 12/62 constraints. Problems are: Problem set: 0 solved, 340 unsolved
[2024-06-01 03:27:28] [INFO ] Deduced a trap composed of 39 places in 148 ms of which 3 ms to minimize.
[2024-06-01 03:27:28] [INFO ] Deduced a trap composed of 33 places in 220 ms of which 3 ms to minimize.
[2024-06-01 03:27:28] [INFO ] Deduced a trap composed of 34 places in 229 ms of which 4 ms to minimize.
[2024-06-01 03:27:28] [INFO ] Deduced a trap composed of 36 places in 189 ms of which 3 ms to minimize.
[2024-06-01 03:27:29] [INFO ] Deduced a trap composed of 36 places in 185 ms of which 3 ms to minimize.
[2024-06-01 03:27:29] [INFO ] Deduced a trap composed of 44 places in 229 ms of which 3 ms to minimize.
[2024-06-01 03:27:29] [INFO ] Deduced a trap composed of 39 places in 217 ms of which 3 ms to minimize.
[2024-06-01 03:27:30] [INFO ] Deduced a trap composed of 26 places in 205 ms of which 3 ms to minimize.
[2024-06-01 03:27:30] [INFO ] Deduced a trap composed of 33 places in 220 ms of which 3 ms to minimize.
[2024-06-01 03:27:30] [INFO ] Deduced a trap composed of 32 places in 223 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 10/72 constraints. Problems are: Problem set: 0 solved, 340 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 207/548 variables, and 72 constraints, problems are : Problem set: 0 solved, 340 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/207 constraints, PredecessorRefiner: 340/340 constraints, Known Traps: 62/62 constraints]
Escalating to Integer solving :Problem set: 0 solved, 340 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 1 (OVERLAPS) 1/207 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 62/72 constraints. Problems are: Problem set: 0 solved, 340 unsolved
[2024-06-01 03:27:40] [INFO ] Deduced a trap composed of 41 places in 109 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/207 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 5 (OVERLAPS) 341/548 variables, 207/280 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 340/620 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/548 variables, 0/620 constraints. Problems are: Problem set: 0 solved, 340 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 548/548 variables, and 620 constraints, problems are : Problem set: 0 solved, 340 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 207/207 constraints, PredecessorRefiner: 340/340 constraints, Known Traps: 63/63 constraints]
After SMT, in 60481ms problems are : Problem set: 0 solved, 340 unsolved
Search for dead transitions found 0 dead transitions in 60488ms
Finished structural reductions in LTL mode , in 1 iterations and 61210 ms. Remains : 207/207 places, 341/341 transitions.
Treatment of property AutonomousCar-PT-05b-LTLCardinality-06 finished in 211052 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(G((p1||X(X(p2)))))||p0))))'
Support contains 5 out of 214 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 348/348 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 209 transition count 343
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 209 transition count 343
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 208 transition count 342
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 208 transition count 342
Applied a total of 12 rules in 14 ms. Remains 208 /214 variables (removed 6) and now considering 342/348 (removed 6) transitions.
// Phase 1: matrix 342 rows 208 cols
[2024-06-01 03:28:05] [INFO ] Computed 10 invariants in 2 ms
[2024-06-01 03:28:05] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-06-01 03:28:05] [INFO ] Invariant cache hit.
[2024-06-01 03:28:05] [INFO ] Implicit Places using invariants and state equation in 341 ms returned []
Implicit Place search using SMT with State Equation took 492 ms to find 0 implicit places.
Running 341 sub problems to find dead transitions.
[2024-06-01 03:28:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 1 (OVERLAPS) 1/208 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 341 unsolved
[2024-06-01 03:28:11] [INFO ] Deduced a trap composed of 17 places in 205 ms of which 4 ms to minimize.
[2024-06-01 03:28:11] [INFO ] Deduced a trap composed of 14 places in 262 ms of which 4 ms to minimize.
[2024-06-01 03:28:12] [INFO ] Deduced a trap composed of 54 places in 228 ms of which 3 ms to minimize.
[2024-06-01 03:28:12] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 2 ms to minimize.
[2024-06-01 03:28:12] [INFO ] Deduced a trap composed of 42 places in 227 ms of which 3 ms to minimize.
[2024-06-01 03:28:12] [INFO ] Deduced a trap composed of 49 places in 218 ms of which 3 ms to minimize.
[2024-06-01 03:28:13] [INFO ] Deduced a trap composed of 37 places in 185 ms of which 5 ms to minimize.
[2024-06-01 03:28:13] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 1 ms to minimize.
[2024-06-01 03:28:13] [INFO ] Deduced a trap composed of 20 places in 228 ms of which 3 ms to minimize.
[2024-06-01 03:28:13] [INFO ] Deduced a trap composed of 39 places in 253 ms of which 4 ms to minimize.
[2024-06-01 03:28:14] [INFO ] Deduced a trap composed of 33 places in 236 ms of which 3 ms to minimize.
[2024-06-01 03:28:14] [INFO ] Deduced a trap composed of 23 places in 219 ms of which 3 ms to minimize.
[2024-06-01 03:28:14] [INFO ] Deduced a trap composed of 34 places in 219 ms of which 4 ms to minimize.
[2024-06-01 03:28:14] [INFO ] Deduced a trap composed of 33 places in 218 ms of which 3 ms to minimize.
[2024-06-01 03:28:14] [INFO ] Deduced a trap composed of 45 places in 202 ms of which 3 ms to minimize.
[2024-06-01 03:28:15] [INFO ] Deduced a trap composed of 35 places in 236 ms of which 3 ms to minimize.
[2024-06-01 03:28:15] [INFO ] Deduced a trap composed of 36 places in 227 ms of which 3 ms to minimize.
[2024-06-01 03:28:15] [INFO ] Deduced a trap composed of 25 places in 222 ms of which 3 ms to minimize.
[2024-06-01 03:28:16] [INFO ] Deduced a trap composed of 31 places in 207 ms of which 3 ms to minimize.
[2024-06-01 03:28:16] [INFO ] Deduced a trap composed of 31 places in 213 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 341 unsolved
[2024-06-01 03:28:16] [INFO ] Deduced a trap composed of 39 places in 74 ms of which 2 ms to minimize.
[2024-06-01 03:28:17] [INFO ] Deduced a trap composed of 44 places in 220 ms of which 3 ms to minimize.
[2024-06-01 03:28:17] [INFO ] Deduced a trap composed of 51 places in 227 ms of which 4 ms to minimize.
[2024-06-01 03:28:17] [INFO ] Deduced a trap composed of 31 places in 213 ms of which 3 ms to minimize.
[2024-06-01 03:28:18] [INFO ] Deduced a trap composed of 41 places in 176 ms of which 2 ms to minimize.
[2024-06-01 03:28:18] [INFO ] Deduced a trap composed of 42 places in 183 ms of which 3 ms to minimize.
[2024-06-01 03:28:18] [INFO ] Deduced a trap composed of 41 places in 176 ms of which 3 ms to minimize.
[2024-06-01 03:28:18] [INFO ] Deduced a trap composed of 32 places in 210 ms of which 4 ms to minimize.
[2024-06-01 03:28:18] [INFO ] Deduced a trap composed of 37 places in 205 ms of which 4 ms to minimize.
[2024-06-01 03:28:19] [INFO ] Deduced a trap composed of 26 places in 225 ms of which 3 ms to minimize.
[2024-06-01 03:28:19] [INFO ] Deduced a trap composed of 42 places in 141 ms of which 3 ms to minimize.
[2024-06-01 03:28:19] [INFO ] Deduced a trap composed of 41 places in 123 ms of which 2 ms to minimize.
[2024-06-01 03:28:19] [INFO ] Deduced a trap composed of 40 places in 105 ms of which 3 ms to minimize.
[2024-06-01 03:28:19] [INFO ] Deduced a trap composed of 56 places in 173 ms of which 3 ms to minimize.
[2024-06-01 03:28:20] [INFO ] Deduced a trap composed of 53 places in 162 ms of which 4 ms to minimize.
[2024-06-01 03:28:20] [INFO ] Deduced a trap composed of 33 places in 157 ms of which 3 ms to minimize.
[2024-06-01 03:28:20] [INFO ] Deduced a trap composed of 32 places in 149 ms of which 3 ms to minimize.
[2024-06-01 03:28:20] [INFO ] Deduced a trap composed of 52 places in 152 ms of which 3 ms to minimize.
[2024-06-01 03:28:20] [INFO ] Deduced a trap composed of 32 places in 153 ms of which 2 ms to minimize.
[2024-06-01 03:28:21] [INFO ] Deduced a trap composed of 33 places in 170 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 341 unsolved
[2024-06-01 03:28:23] [INFO ] Deduced a trap composed of 36 places in 189 ms of which 3 ms to minimize.
[2024-06-01 03:28:24] [INFO ] Deduced a trap composed of 40 places in 173 ms of which 3 ms to minimize.
[2024-06-01 03:28:24] [INFO ] Deduced a trap composed of 39 places in 162 ms of which 3 ms to minimize.
[2024-06-01 03:28:24] [INFO ] Deduced a trap composed of 45 places in 194 ms of which 4 ms to minimize.
[2024-06-01 03:28:25] [INFO ] Deduced a trap composed of 41 places in 166 ms of which 3 ms to minimize.
[2024-06-01 03:28:25] [INFO ] Deduced a trap composed of 40 places in 149 ms of which 3 ms to minimize.
[2024-06-01 03:28:26] [INFO ] Deduced a trap composed of 32 places in 185 ms of which 3 ms to minimize.
[2024-06-01 03:28:26] [INFO ] Deduced a trap composed of 42 places in 135 ms of which 3 ms to minimize.
[2024-06-01 03:28:26] [INFO ] Deduced a trap composed of 31 places in 124 ms of which 2 ms to minimize.
[2024-06-01 03:28:26] [INFO ] Deduced a trap composed of 39 places in 132 ms of which 3 ms to minimize.
[2024-06-01 03:28:26] [INFO ] Deduced a trap composed of 24 places in 206 ms of which 3 ms to minimize.
[2024-06-01 03:28:27] [INFO ] Deduced a trap composed of 5 places in 190 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 12/62 constraints. Problems are: Problem set: 0 solved, 341 unsolved
[2024-06-01 03:28:29] [INFO ] Deduced a trap composed of 33 places in 220 ms of which 3 ms to minimize.
[2024-06-01 03:28:29] [INFO ] Deduced a trap composed of 42 places in 123 ms of which 3 ms to minimize.
[2024-06-01 03:28:30] [INFO ] Deduced a trap composed of 41 places in 109 ms of which 2 ms to minimize.
[2024-06-01 03:28:30] [INFO ] Deduced a trap composed of 32 places in 202 ms of which 3 ms to minimize.
[2024-06-01 03:28:30] [INFO ] Deduced a trap composed of 43 places in 128 ms of which 2 ms to minimize.
[2024-06-01 03:28:30] [INFO ] Deduced a trap composed of 43 places in 105 ms of which 2 ms to minimize.
[2024-06-01 03:28:31] [INFO ] Deduced a trap composed of 42 places in 109 ms of which 2 ms to minimize.
[2024-06-01 03:28:31] [INFO ] Deduced a trap composed of 43 places in 114 ms of which 2 ms to minimize.
[2024-06-01 03:28:31] [INFO ] Deduced a trap composed of 40 places in 103 ms of which 2 ms to minimize.
[2024-06-01 03:28:31] [INFO ] Deduced a trap composed of 14 places in 126 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 10/72 constraints. Problems are: Problem set: 0 solved, 341 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 208/550 variables, and 72 constraints, problems are : Problem set: 0 solved, 341 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/208 constraints, PredecessorRefiner: 341/341 constraints, Known Traps: 62/62 constraints]
Escalating to Integer solving :Problem set: 0 solved, 341 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 1 (OVERLAPS) 1/208 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 62/72 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 4 (OVERLAPS) 342/550 variables, 208/280 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/550 variables, 341/621 constraints. Problems are: Problem set: 0 solved, 341 unsolved
[2024-06-01 03:28:46] [INFO ] Deduced a trap composed of 55 places in 104 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/550 variables, 1/622 constraints. Problems are: Problem set: 0 solved, 341 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 550/550 variables, and 622 constraints, problems are : Problem set: 0 solved, 341 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 208/208 constraints, PredecessorRefiner: 341/341 constraints, Known Traps: 63/63 constraints]
After SMT, in 60412ms problems are : Problem set: 0 solved, 341 unsolved
Search for dead transitions found 0 dead transitions in 60416ms
Starting structural reductions in LTL mode, iteration 1 : 208/214 places, 342/348 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60925 ms. Remains : 208/214 places, 342/348 transitions.
Stuttering acceptance computed with spot in 302 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), true]
Running random walk in product with property : AutonomousCar-PT-05b-LTLCardinality-07
Product exploration explored 100000 steps with 33 reset in 259 ms.
Product exploration explored 100000 steps with 15 reset in 290 ms.
Computed a total of 35 stabilizing places and 35 stable transitions
Computed a total of 35 stabilizing places and 35 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p0), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 132 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 281 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), true]
RANDOM walk for 21510 steps (25 resets) in 120 ms. (177 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p0), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (NOT p2))]
Knowledge based reduction with 4 factoid took 239 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 345 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), true]
Stuttering acceptance computed with spot in 280 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), true]
Support contains 5 out of 208 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 208/208 places, 342/342 transitions.
Applied a total of 0 rules in 6 ms. Remains 208 /208 variables (removed 0) and now considering 342/342 (removed 0) transitions.
[2024-06-01 03:29:08] [INFO ] Invariant cache hit.
[2024-06-01 03:29:08] [INFO ] Implicit Places using invariants in 235 ms returned []
[2024-06-01 03:29:08] [INFO ] Invariant cache hit.
[2024-06-01 03:29:09] [INFO ] Implicit Places using invariants and state equation in 370 ms returned []
Implicit Place search using SMT with State Equation took 608 ms to find 0 implicit places.
Running 341 sub problems to find dead transitions.
[2024-06-01 03:29:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 1 (OVERLAPS) 1/208 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 341 unsolved
[2024-06-01 03:29:15] [INFO ] Deduced a trap composed of 17 places in 280 ms of which 4 ms to minimize.
[2024-06-01 03:29:15] [INFO ] Deduced a trap composed of 14 places in 265 ms of which 4 ms to minimize.
[2024-06-01 03:29:15] [INFO ] Deduced a trap composed of 54 places in 219 ms of which 4 ms to minimize.
[2024-06-01 03:29:15] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 2 ms to minimize.
[2024-06-01 03:29:16] [INFO ] Deduced a trap composed of 42 places in 223 ms of which 4 ms to minimize.
[2024-06-01 03:29:16] [INFO ] Deduced a trap composed of 49 places in 222 ms of which 3 ms to minimize.
[2024-06-01 03:29:16] [INFO ] Deduced a trap composed of 37 places in 199 ms of which 3 ms to minimize.
[2024-06-01 03:29:16] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 1 ms to minimize.
[2024-06-01 03:29:17] [INFO ] Deduced a trap composed of 20 places in 219 ms of which 3 ms to minimize.
[2024-06-01 03:29:17] [INFO ] Deduced a trap composed of 39 places in 246 ms of which 3 ms to minimize.
[2024-06-01 03:29:17] [INFO ] Deduced a trap composed of 33 places in 229 ms of which 3 ms to minimize.
[2024-06-01 03:29:17] [INFO ] Deduced a trap composed of 23 places in 200 ms of which 3 ms to minimize.
[2024-06-01 03:29:17] [INFO ] Deduced a trap composed of 34 places in 201 ms of which 3 ms to minimize.
[2024-06-01 03:29:18] [INFO ] Deduced a trap composed of 33 places in 187 ms of which 3 ms to minimize.
[2024-06-01 03:29:18] [INFO ] Deduced a trap composed of 45 places in 209 ms of which 3 ms to minimize.
[2024-06-01 03:29:18] [INFO ] Deduced a trap composed of 35 places in 189 ms of which 4 ms to minimize.
[2024-06-01 03:29:18] [INFO ] Deduced a trap composed of 36 places in 221 ms of which 3 ms to minimize.
[2024-06-01 03:29:19] [INFO ] Deduced a trap composed of 25 places in 226 ms of which 3 ms to minimize.
[2024-06-01 03:29:19] [INFO ] Deduced a trap composed of 31 places in 219 ms of which 2 ms to minimize.
[2024-06-01 03:29:19] [INFO ] Deduced a trap composed of 31 places in 178 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 341 unsolved
[2024-06-01 03:29:19] [INFO ] Deduced a trap composed of 39 places in 77 ms of which 2 ms to minimize.
[2024-06-01 03:29:20] [INFO ] Deduced a trap composed of 44 places in 219 ms of which 3 ms to minimize.
[2024-06-01 03:29:20] [INFO ] Deduced a trap composed of 51 places in 161 ms of which 2 ms to minimize.
[2024-06-01 03:29:20] [INFO ] Deduced a trap composed of 31 places in 143 ms of which 2 ms to minimize.
[2024-06-01 03:29:20] [INFO ] Deduced a trap composed of 41 places in 112 ms of which 2 ms to minimize.
[2024-06-01 03:29:21] [INFO ] Deduced a trap composed of 42 places in 140 ms of which 3 ms to minimize.
[2024-06-01 03:29:21] [INFO ] Deduced a trap composed of 41 places in 145 ms of which 3 ms to minimize.
[2024-06-01 03:29:21] [INFO ] Deduced a trap composed of 32 places in 182 ms of which 3 ms to minimize.
[2024-06-01 03:29:21] [INFO ] Deduced a trap composed of 37 places in 232 ms of which 3 ms to minimize.
[2024-06-01 03:29:21] [INFO ] Deduced a trap composed of 26 places in 221 ms of which 4 ms to minimize.
[2024-06-01 03:29:22] [INFO ] Deduced a trap composed of 42 places in 145 ms of which 3 ms to minimize.
[2024-06-01 03:29:22] [INFO ] Deduced a trap composed of 41 places in 147 ms of which 2 ms to minimize.
[2024-06-01 03:29:22] [INFO ] Deduced a trap composed of 40 places in 127 ms of which 2 ms to minimize.
[2024-06-01 03:29:22] [INFO ] Deduced a trap composed of 56 places in 198 ms of which 3 ms to minimize.
[2024-06-01 03:29:23] [INFO ] Deduced a trap composed of 53 places in 202 ms of which 3 ms to minimize.
[2024-06-01 03:29:23] [INFO ] Deduced a trap composed of 33 places in 197 ms of which 4 ms to minimize.
[2024-06-01 03:29:23] [INFO ] Deduced a trap composed of 32 places in 181 ms of which 3 ms to minimize.
[2024-06-01 03:29:23] [INFO ] Deduced a trap composed of 52 places in 186 ms of which 3 ms to minimize.
[2024-06-01 03:29:24] [INFO ] Deduced a trap composed of 32 places in 177 ms of which 3 ms to minimize.
[2024-06-01 03:29:24] [INFO ] Deduced a trap composed of 33 places in 202 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 341 unsolved
[2024-06-01 03:29:27] [INFO ] Deduced a trap composed of 36 places in 169 ms of which 3 ms to minimize.
[2024-06-01 03:29:28] [INFO ] Deduced a trap composed of 40 places in 172 ms of which 2 ms to minimize.
[2024-06-01 03:29:28] [INFO ] Deduced a trap composed of 39 places in 165 ms of which 3 ms to minimize.
[2024-06-01 03:29:28] [INFO ] Deduced a trap composed of 45 places in 195 ms of which 4 ms to minimize.
[2024-06-01 03:29:29] [INFO ] Deduced a trap composed of 41 places in 163 ms of which 3 ms to minimize.
[2024-06-01 03:29:29] [INFO ] Deduced a trap composed of 40 places in 139 ms of which 3 ms to minimize.
[2024-06-01 03:29:29] [INFO ] Deduced a trap composed of 32 places in 179 ms of which 3 ms to minimize.
[2024-06-01 03:29:30] [INFO ] Deduced a trap composed of 42 places in 144 ms of which 2 ms to minimize.
[2024-06-01 03:29:30] [INFO ] Deduced a trap composed of 31 places in 127 ms of which 3 ms to minimize.
[2024-06-01 03:29:30] [INFO ] Deduced a trap composed of 39 places in 129 ms of which 3 ms to minimize.
[2024-06-01 03:29:30] [INFO ] Deduced a trap composed of 24 places in 165 ms of which 3 ms to minimize.
[2024-06-01 03:29:30] [INFO ] Deduced a trap composed of 5 places in 202 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 12/62 constraints. Problems are: Problem set: 0 solved, 341 unsolved
[2024-06-01 03:29:33] [INFO ] Deduced a trap composed of 33 places in 214 ms of which 3 ms to minimize.
[2024-06-01 03:29:33] [INFO ] Deduced a trap composed of 42 places in 138 ms of which 3 ms to minimize.
[2024-06-01 03:29:33] [INFO ] Deduced a trap composed of 41 places in 107 ms of which 2 ms to minimize.
[2024-06-01 03:29:34] [INFO ] Deduced a trap composed of 32 places in 168 ms of which 3 ms to minimize.
[2024-06-01 03:29:34] [INFO ] Deduced a trap composed of 43 places in 129 ms of which 2 ms to minimize.
[2024-06-01 03:29:34] [INFO ] Deduced a trap composed of 43 places in 109 ms of which 2 ms to minimize.
[2024-06-01 03:29:34] [INFO ] Deduced a trap composed of 42 places in 105 ms of which 2 ms to minimize.
[2024-06-01 03:29:35] [INFO ] Deduced a trap composed of 43 places in 106 ms of which 2 ms to minimize.
[2024-06-01 03:29:35] [INFO ] Deduced a trap composed of 40 places in 101 ms of which 2 ms to minimize.
[2024-06-01 03:29:35] [INFO ] Deduced a trap composed of 14 places in 154 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 10/72 constraints. Problems are: Problem set: 0 solved, 341 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 208/550 variables, and 72 constraints, problems are : Problem set: 0 solved, 341 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/208 constraints, PredecessorRefiner: 341/341 constraints, Known Traps: 62/62 constraints]
Escalating to Integer solving :Problem set: 0 solved, 341 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 1 (OVERLAPS) 1/208 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 62/72 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 4 (OVERLAPS) 342/550 variables, 208/280 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/550 variables, 341/621 constraints. Problems are: Problem set: 0 solved, 341 unsolved
[2024-06-01 03:29:50] [INFO ] Deduced a trap composed of 55 places in 156 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/550 variables, 1/622 constraints. Problems are: Problem set: 0 solved, 341 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 550/550 variables, and 622 constraints, problems are : Problem set: 0 solved, 341 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 208/208 constraints, PredecessorRefiner: 341/341 constraints, Known Traps: 63/63 constraints]
After SMT, in 60543ms problems are : Problem set: 0 solved, 341 unsolved
Search for dead transitions found 0 dead transitions in 60549ms
Finished structural reductions in LTL mode , in 1 iterations and 61165 ms. Remains : 208/208 places, 342/342 transitions.
Computed a total of 35 stabilizing places and 35 stable transitions
Computed a total of 35 stabilizing places and 35 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p0), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 136 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 286 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), true]
RANDOM walk for 13669 steps (44 resets) in 328 ms. (41 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p0), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (NOT p2))]
Knowledge based reduction with 4 factoid took 245 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 279 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), true]
Stuttering acceptance computed with spot in 276 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), true]
Stuttering acceptance computed with spot in 350 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), true]
Product exploration explored 100000 steps with 5 reset in 136 ms.
Product exploration explored 100000 steps with 46 reset in 532 ms.
Applying partial POR strategy [false, false, false, false, true, true]
Stuttering acceptance computed with spot in 229 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), true]
Support contains 5 out of 208 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 208/208 places, 342/342 transitions.
Graph (trivial) has 189 edges and 208 vertex of which 4 / 208 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 73 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 73 rules applied. Total rules applied 74 place count 206 transition count 340
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 85 place count 206 transition count 329
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 85 place count 206 transition count 329
Deduced a syphon composed of 86 places in 0 ms
Iterating global reduction 2 with 13 rules applied. Total rules applied 98 place count 206 transition count 329
Discarding 56 places :
Symmetric choice reduction at 2 with 56 rule applications. Total rules 154 place count 150 transition count 273
Deduced a syphon composed of 31 places in 0 ms
Iterating global reduction 2 with 56 rules applied. Total rules applied 210 place count 150 transition count 273
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 86 places in 0 ms
Iterating global reduction 2 with 55 rules applied. Total rules applied 265 place count 150 transition count 279
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 267 place count 150 transition count 277
Discarding 48 places :
Symmetric choice reduction at 3 with 48 rule applications. Total rules 315 place count 102 transition count 189
Deduced a syphon composed of 48 places in 0 ms
Iterating global reduction 3 with 48 rules applied. Total rules applied 363 place count 102 transition count 189
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 369 place count 102 transition count 183
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 372 place count 99 transition count 180
Deduced a syphon composed of 45 places in 0 ms
Iterating global reduction 4 with 3 rules applied. Total rules applied 375 place count 99 transition count 180
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 46 places in 1 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 376 place count 99 transition count 180
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 378 place count 97 transition count 178
Deduced a syphon composed of 44 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 380 place count 97 transition count 178
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 47 places in 0 ms
Iterating global reduction 4 with 3 rules applied. Total rules applied 383 place count 97 transition count 187
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 385 place count 97 transition count 185
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 387 place count 95 transition count 181
Deduced a syphon composed of 45 places in 0 ms
Iterating global reduction 5 with 2 rules applied. Total rules applied 389 place count 95 transition count 181
Deduced a syphon composed of 45 places in 0 ms
Applied a total of 389 rules in 71 ms. Remains 95 /208 variables (removed 113) and now considering 181/342 (removed 161) transitions.
[2024-06-01 03:30:12] [INFO ] Redundant transitions in 10 ms returned []
Running 180 sub problems to find dead transitions.
// Phase 1: matrix 181 rows 95 cols
[2024-06-01 03:30:12] [INFO ] Computed 9 invariants in 1 ms
[2024-06-01 03:30:12] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-06-01 03:30:14] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-06-01 03:30:14] [INFO ] Deduced a trap composed of 3 places in 86 ms of which 1 ms to minimize.
[2024-06-01 03:30:15] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2024-06-01 03:30:15] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 1 ms to minimize.
[2024-06-01 03:30:15] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 2 ms to minimize.
[2024-06-01 03:30:15] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 2 ms to minimize.
Problem TDEAD12 is UNSAT
Problem TDEAD15 is UNSAT
[2024-06-01 03:30:15] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 1 ms to minimize.
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
[2024-06-01 03:30:15] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
Problem TDEAD24 is UNSAT
[2024-06-01 03:30:15] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 1 ms to minimize.
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
[2024-06-01 03:30:15] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 1 ms to minimize.
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
[2024-06-01 03:30:15] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 2 ms to minimize.
Problem TDEAD62 is UNSAT
[2024-06-01 03:30:15] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 1 ms to minimize.
Problem TDEAD64 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD83 is UNSAT
[2024-06-01 03:30:15] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 2 ms to minimize.
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 13/22 constraints. Problems are: Problem set: 42 solved, 138 unsolved
[2024-06-01 03:30:16] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 1/23 constraints. Problems are: Problem set: 42 solved, 138 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/23 constraints. Problems are: Problem set: 42 solved, 138 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
At refinement iteration 5 (OVERLAPS) 180/275 variables, 95/118 constraints. Problems are: Problem set: 54 solved, 126 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 2/120 constraints. Problems are: Problem set: 54 solved, 126 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/275 variables, 0/120 constraints. Problems are: Problem set: 54 solved, 126 unsolved
At refinement iteration 8 (OVERLAPS) 1/276 variables, 1/121 constraints. Problems are: Problem set: 54 solved, 126 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/276 variables, 0/121 constraints. Problems are: Problem set: 54 solved, 126 unsolved
At refinement iteration 10 (OVERLAPS) 0/276 variables, 0/121 constraints. Problems are: Problem set: 54 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Real declared 276/276 variables, and 121 constraints, problems are : Problem set: 54 solved, 126 unsolved in 8954 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 95/95 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 54 solved, 126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 54 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 46/95 variables, 9/9 constraints. Problems are: Problem set: 54 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 14/23 constraints. Problems are: Problem set: 54 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/23 constraints. Problems are: Problem set: 54 solved, 126 unsolved
At refinement iteration 4 (OVERLAPS) 180/275 variables, 95/118 constraints. Problems are: Problem set: 54 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 2/120 constraints. Problems are: Problem set: 54 solved, 126 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 126/246 constraints. Problems are: Problem set: 54 solved, 126 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/275 variables, 0/246 constraints. Problems are: Problem set: 54 solved, 126 unsolved
At refinement iteration 8 (OVERLAPS) 1/276 variables, 1/247 constraints. Problems are: Problem set: 54 solved, 126 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/276 variables, 0/247 constraints. Problems are: Problem set: 54 solved, 126 unsolved
At refinement iteration 10 (OVERLAPS) 0/276 variables, 0/247 constraints. Problems are: Problem set: 54 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Int declared 276/276 variables, and 247 constraints, problems are : Problem set: 54 solved, 126 unsolved in 10822 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 95/95 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 126/180 constraints, Known Traps: 14/14 constraints]
After SMT, in 20074ms problems are : Problem set: 54 solved, 126 unsolved
Search for dead transitions found 54 dead transitions in 20077ms
Found 54 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 54 transitions
Dead transitions reduction (with SMT) removed 54 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 95/208 places, 127/342 transitions.
Graph (complete) has 373 edges and 95 vertex of which 50 are kept as prefixes of interest. Removing 45 places using SCC suffix rule.0 ms
Discarding 45 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 50 /95 variables (removed 45) and now considering 127/127 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 50/208 places, 127/342 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 20174 ms. Remains : 50/208 places, 127/342 transitions.
Support contains 5 out of 208 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 208/208 places, 342/342 transitions.
Applied a total of 0 rules in 3 ms. Remains 208 /208 variables (removed 0) and now considering 342/342 (removed 0) transitions.
// Phase 1: matrix 342 rows 208 cols
[2024-06-01 03:30:33] [INFO ] Computed 10 invariants in 9 ms
[2024-06-01 03:30:33] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-06-01 03:30:33] [INFO ] Invariant cache hit.
[2024-06-01 03:30:33] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 377 ms to find 0 implicit places.
Running 341 sub problems to find dead transitions.
[2024-06-01 03:30:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 1 (OVERLAPS) 1/208 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 341 unsolved
[2024-06-01 03:30:37] [INFO ] Deduced a trap composed of 17 places in 134 ms of which 2 ms to minimize.
[2024-06-01 03:30:37] [INFO ] Deduced a trap composed of 14 places in 148 ms of which 3 ms to minimize.
[2024-06-01 03:30:37] [INFO ] Deduced a trap composed of 54 places in 135 ms of which 3 ms to minimize.
[2024-06-01 03:30:37] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-06-01 03:30:37] [INFO ] Deduced a trap composed of 42 places in 158 ms of which 2 ms to minimize.
[2024-06-01 03:30:37] [INFO ] Deduced a trap composed of 49 places in 132 ms of which 2 ms to minimize.
[2024-06-01 03:30:38] [INFO ] Deduced a trap composed of 37 places in 126 ms of which 2 ms to minimize.
[2024-06-01 03:30:38] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 1 ms to minimize.
[2024-06-01 03:30:38] [INFO ] Deduced a trap composed of 20 places in 140 ms of which 3 ms to minimize.
[2024-06-01 03:30:38] [INFO ] Deduced a trap composed of 39 places in 141 ms of which 2 ms to minimize.
[2024-06-01 03:30:38] [INFO ] Deduced a trap composed of 33 places in 136 ms of which 2 ms to minimize.
[2024-06-01 03:30:38] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 2 ms to minimize.
[2024-06-01 03:30:38] [INFO ] Deduced a trap composed of 34 places in 123 ms of which 3 ms to minimize.
[2024-06-01 03:30:39] [INFO ] Deduced a trap composed of 33 places in 117 ms of which 2 ms to minimize.
[2024-06-01 03:30:39] [INFO ] Deduced a trap composed of 45 places in 130 ms of which 2 ms to minimize.
[2024-06-01 03:30:39] [INFO ] Deduced a trap composed of 35 places in 130 ms of which 2 ms to minimize.
[2024-06-01 03:30:39] [INFO ] Deduced a trap composed of 36 places in 162 ms of which 2 ms to minimize.
[2024-06-01 03:30:39] [INFO ] Deduced a trap composed of 25 places in 144 ms of which 3 ms to minimize.
[2024-06-01 03:30:39] [INFO ] Deduced a trap composed of 31 places in 156 ms of which 2 ms to minimize.
[2024-06-01 03:30:40] [INFO ] Deduced a trap composed of 31 places in 133 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 341 unsolved
[2024-06-01 03:30:40] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 1 ms to minimize.
[2024-06-01 03:30:40] [INFO ] Deduced a trap composed of 44 places in 156 ms of which 2 ms to minimize.
[2024-06-01 03:30:40] [INFO ] Deduced a trap composed of 51 places in 163 ms of which 2 ms to minimize.
[2024-06-01 03:30:41] [INFO ] Deduced a trap composed of 31 places in 122 ms of which 2 ms to minimize.
[2024-06-01 03:30:41] [INFO ] Deduced a trap composed of 41 places in 108 ms of which 2 ms to minimize.
[2024-06-01 03:30:41] [INFO ] Deduced a trap composed of 42 places in 112 ms of which 2 ms to minimize.
[2024-06-01 03:30:41] [INFO ] Deduced a trap composed of 41 places in 114 ms of which 1 ms to minimize.
[2024-06-01 03:30:41] [INFO ] Deduced a trap composed of 32 places in 123 ms of which 3 ms to minimize.
[2024-06-01 03:30:41] [INFO ] Deduced a trap composed of 37 places in 119 ms of which 2 ms to minimize.
[2024-06-01 03:30:41] [INFO ] Deduced a trap composed of 26 places in 130 ms of which 2 ms to minimize.
[2024-06-01 03:30:42] [INFO ] Deduced a trap composed of 42 places in 102 ms of which 2 ms to minimize.
[2024-06-01 03:30:42] [INFO ] Deduced a trap composed of 41 places in 94 ms of which 1 ms to minimize.
[2024-06-01 03:30:42] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 2 ms to minimize.
[2024-06-01 03:30:42] [INFO ] Deduced a trap composed of 56 places in 119 ms of which 2 ms to minimize.
[2024-06-01 03:30:42] [INFO ] Deduced a trap composed of 53 places in 123 ms of which 3 ms to minimize.
[2024-06-01 03:30:42] [INFO ] Deduced a trap composed of 33 places in 135 ms of which 2 ms to minimize.
[2024-06-01 03:30:42] [INFO ] Deduced a trap composed of 32 places in 106 ms of which 3 ms to minimize.
[2024-06-01 03:30:43] [INFO ] Deduced a trap composed of 52 places in 122 ms of which 2 ms to minimize.
[2024-06-01 03:30:43] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 2 ms to minimize.
[2024-06-01 03:30:43] [INFO ] Deduced a trap composed of 33 places in 127 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 341 unsolved
[2024-06-01 03:30:45] [INFO ] Deduced a trap composed of 36 places in 125 ms of which 2 ms to minimize.
[2024-06-01 03:30:45] [INFO ] Deduced a trap composed of 40 places in 110 ms of which 2 ms to minimize.
[2024-06-01 03:30:46] [INFO ] Deduced a trap composed of 39 places in 102 ms of which 2 ms to minimize.
[2024-06-01 03:30:46] [INFO ] Deduced a trap composed of 45 places in 123 ms of which 2 ms to minimize.
[2024-06-01 03:30:46] [INFO ] Deduced a trap composed of 41 places in 96 ms of which 2 ms to minimize.
[2024-06-01 03:30:46] [INFO ] Deduced a trap composed of 40 places in 88 ms of which 2 ms to minimize.
[2024-06-01 03:30:46] [INFO ] Deduced a trap composed of 32 places in 110 ms of which 2 ms to minimize.
[2024-06-01 03:30:47] [INFO ] Deduced a trap composed of 42 places in 85 ms of which 1 ms to minimize.
[2024-06-01 03:30:47] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 1 ms to minimize.
[2024-06-01 03:30:47] [INFO ] Deduced a trap composed of 39 places in 72 ms of which 1 ms to minimize.
[2024-06-01 03:30:47] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 2 ms to minimize.
[2024-06-01 03:30:47] [INFO ] Deduced a trap composed of 5 places in 121 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 12/62 constraints. Problems are: Problem set: 0 solved, 341 unsolved
[2024-06-01 03:30:49] [INFO ] Deduced a trap composed of 33 places in 131 ms of which 2 ms to minimize.
[2024-06-01 03:30:49] [INFO ] Deduced a trap composed of 42 places in 72 ms of which 1 ms to minimize.
[2024-06-01 03:30:49] [INFO ] Deduced a trap composed of 41 places in 69 ms of which 2 ms to minimize.
[2024-06-01 03:30:49] [INFO ] Deduced a trap composed of 32 places in 111 ms of which 2 ms to minimize.
[2024-06-01 03:30:49] [INFO ] Deduced a trap composed of 43 places in 70 ms of which 1 ms to minimize.
[2024-06-01 03:30:50] [INFO ] Deduced a trap composed of 43 places in 69 ms of which 1 ms to minimize.
[2024-06-01 03:30:50] [INFO ] Deduced a trap composed of 42 places in 79 ms of which 1 ms to minimize.
[2024-06-01 03:30:50] [INFO ] Deduced a trap composed of 43 places in 65 ms of which 2 ms to minimize.
[2024-06-01 03:30:50] [INFO ] Deduced a trap composed of 40 places in 68 ms of which 1 ms to minimize.
[2024-06-01 03:30:50] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 10/72 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 7 (OVERLAPS) 342/550 variables, 208/280 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/550 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 9 (OVERLAPS) 0/550 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 341 unsolved
No progress, stopping.
After SMT solving in domain Real declared 550/550 variables, and 280 constraints, problems are : Problem set: 0 solved, 341 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 208/208 constraints, PredecessorRefiner: 341/341 constraints, Known Traps: 62/62 constraints]
Escalating to Integer solving :Problem set: 0 solved, 341 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 1 (OVERLAPS) 1/208 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 62/72 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 4 (OVERLAPS) 342/550 variables, 208/280 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/550 variables, 341/621 constraints. Problems are: Problem set: 0 solved, 341 unsolved
[2024-06-01 03:31:11] [INFO ] Deduced a trap composed of 55 places in 113 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/550 variables, 1/622 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/550 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 341 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 550/550 variables, and 622 constraints, problems are : Problem set: 0 solved, 341 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 208/208 constraints, PredecessorRefiner: 341/341 constraints, Known Traps: 63/63 constraints]
After SMT, in 60380ms problems are : Problem set: 0 solved, 341 unsolved
Search for dead transitions found 0 dead transitions in 60384ms
Finished structural reductions in LTL mode , in 1 iterations and 60765 ms. Remains : 208/208 places, 342/342 transitions.
Treatment of property AutonomousCar-PT-05b-LTLCardinality-07 finished in 208367 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((p0||(X(p1)&&G(p2))))))'
Support contains 6 out of 214 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 348/348 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 208 transition count 342
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 208 transition count 342
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 207 transition count 341
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 207 transition count 341
Applied a total of 14 rules in 6 ms. Remains 207 /214 variables (removed 7) and now considering 341/348 (removed 7) transitions.
// Phase 1: matrix 341 rows 207 cols
[2024-06-01 03:31:33] [INFO ] Computed 10 invariants in 2 ms
[2024-06-01 03:31:33] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-06-01 03:31:33] [INFO ] Invariant cache hit.
[2024-06-01 03:31:34] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 381 ms to find 0 implicit places.
Running 340 sub problems to find dead transitions.
[2024-06-01 03:31:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 1 (OVERLAPS) 1/207 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 340 unsolved
[2024-06-01 03:31:38] [INFO ] Deduced a trap composed of 51 places in 151 ms of which 3 ms to minimize.
[2024-06-01 03:31:38] [INFO ] Deduced a trap composed of 18 places in 156 ms of which 2 ms to minimize.
[2024-06-01 03:31:38] [INFO ] Deduced a trap composed of 14 places in 165 ms of which 2 ms to minimize.
[2024-06-01 03:31:38] [INFO ] Deduced a trap composed of 32 places in 139 ms of which 2 ms to minimize.
[2024-06-01 03:31:38] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 2 ms to minimize.
[2024-06-01 03:31:38] [INFO ] Deduced a trap composed of 24 places in 138 ms of which 2 ms to minimize.
[2024-06-01 03:31:39] [INFO ] Deduced a trap composed of 38 places in 160 ms of which 3 ms to minimize.
[2024-06-01 03:31:39] [INFO ] Deduced a trap composed of 33 places in 170 ms of which 2 ms to minimize.
[2024-06-01 03:31:39] [INFO ] Deduced a trap composed of 30 places in 156 ms of which 2 ms to minimize.
[2024-06-01 03:31:39] [INFO ] Deduced a trap composed of 40 places in 152 ms of which 2 ms to minimize.
[2024-06-01 03:31:39] [INFO ] Deduced a trap composed of 35 places in 155 ms of which 2 ms to minimize.
[2024-06-01 03:31:39] [INFO ] Deduced a trap composed of 58 places in 147 ms of which 2 ms to minimize.
[2024-06-01 03:31:40] [INFO ] Deduced a trap composed of 45 places in 144 ms of which 2 ms to minimize.
[2024-06-01 03:31:40] [INFO ] Deduced a trap composed of 33 places in 160 ms of which 2 ms to minimize.
[2024-06-01 03:31:40] [INFO ] Deduced a trap composed of 32 places in 154 ms of which 2 ms to minimize.
[2024-06-01 03:31:40] [INFO ] Deduced a trap composed of 26 places in 139 ms of which 2 ms to minimize.
[2024-06-01 03:31:40] [INFO ] Deduced a trap composed of 27 places in 180 ms of which 3 ms to minimize.
[2024-06-01 03:31:41] [INFO ] Deduced a trap composed of 41 places in 90 ms of which 1 ms to minimize.
[2024-06-01 03:31:41] [INFO ] Deduced a trap composed of 42 places in 95 ms of which 1 ms to minimize.
[2024-06-01 03:31:41] [INFO ] Deduced a trap composed of 33 places in 164 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 340 unsolved
[2024-06-01 03:31:41] [INFO ] Deduced a trap composed of 33 places in 123 ms of which 2 ms to minimize.
[2024-06-01 03:31:41] [INFO ] Deduced a trap composed of 39 places in 133 ms of which 2 ms to minimize.
[2024-06-01 03:31:42] [INFO ] Deduced a trap composed of 36 places in 134 ms of which 2 ms to minimize.
[2024-06-01 03:31:42] [INFO ] Deduced a trap composed of 35 places in 123 ms of which 2 ms to minimize.
[2024-06-01 03:31:42] [INFO ] Deduced a trap composed of 37 places in 139 ms of which 2 ms to minimize.
[2024-06-01 03:31:42] [INFO ] Deduced a trap composed of 21 places in 126 ms of which 1 ms to minimize.
[2024-06-01 03:31:42] [INFO ] Deduced a trap composed of 37 places in 133 ms of which 1 ms to minimize.
[2024-06-01 03:31:42] [INFO ] Deduced a trap composed of 34 places in 113 ms of which 2 ms to minimize.
[2024-06-01 03:31:43] [INFO ] Deduced a trap composed of 39 places in 100 ms of which 1 ms to minimize.
[2024-06-01 03:31:43] [INFO ] Deduced a trap composed of 41 places in 103 ms of which 1 ms to minimize.
[2024-06-01 03:31:43] [INFO ] Deduced a trap composed of 39 places in 76 ms of which 2 ms to minimize.
[2024-06-01 03:31:43] [INFO ] Deduced a trap composed of 42 places in 84 ms of which 1 ms to minimize.
[2024-06-01 03:31:43] [INFO ] Deduced a trap composed of 42 places in 70 ms of which 1 ms to minimize.
[2024-06-01 03:31:43] [INFO ] Deduced a trap composed of 40 places in 99 ms of which 1 ms to minimize.
[2024-06-01 03:31:43] [INFO ] Deduced a trap composed of 39 places in 112 ms of which 2 ms to minimize.
[2024-06-01 03:31:43] [INFO ] Deduced a trap composed of 42 places in 98 ms of which 2 ms to minimize.
[2024-06-01 03:31:44] [INFO ] Deduced a trap composed of 42 places in 87 ms of which 1 ms to minimize.
[2024-06-01 03:31:44] [INFO ] Deduced a trap composed of 41 places in 85 ms of which 2 ms to minimize.
[2024-06-01 03:31:44] [INFO ] Deduced a trap composed of 39 places in 96 ms of which 2 ms to minimize.
[2024-06-01 03:31:44] [INFO ] Deduced a trap composed of 42 places in 88 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/207 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 340 unsolved
[2024-06-01 03:31:46] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 1 ms to minimize.
[2024-06-01 03:31:46] [INFO ] Deduced a trap composed of 43 places in 137 ms of which 2 ms to minimize.
[2024-06-01 03:31:46] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 2 ms to minimize.
[2024-06-01 03:31:47] [INFO ] Deduced a trap composed of 40 places in 82 ms of which 2 ms to minimize.
[2024-06-01 03:31:47] [INFO ] Deduced a trap composed of 41 places in 99 ms of which 2 ms to minimize.
[2024-06-01 03:31:47] [INFO ] Deduced a trap composed of 42 places in 93 ms of which 1 ms to minimize.
[2024-06-01 03:31:48] [INFO ] Deduced a trap composed of 14 places in 138 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 7/57 constraints. Problems are: Problem set: 0 solved, 340 unsolved
[2024-06-01 03:31:49] [INFO ] Deduced a trap composed of 38 places in 123 ms of which 2 ms to minimize.
[2024-06-01 03:31:50] [INFO ] Deduced a trap composed of 32 places in 111 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 340 unsolved
[2024-06-01 03:31:51] [INFO ] Deduced a trap composed of 36 places in 95 ms of which 2 ms to minimize.
[2024-06-01 03:31:52] [INFO ] Deduced a trap composed of 5 places in 128 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 340 unsolved
[2024-06-01 03:31:55] [INFO ] Deduced a trap composed of 32 places in 105 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 340 unsolved
[2024-06-01 03:31:58] [INFO ] Deduced a trap composed of 31 places in 119 ms of which 2 ms to minimize.
[2024-06-01 03:31:58] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 2 ms to minimize.
[2024-06-01 03:31:58] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 1 ms to minimize.
[2024-06-01 03:31:58] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 4/66 constraints. Problems are: Problem set: 0 solved, 340 unsolved
[2024-06-01 03:32:00] [INFO ] Deduced a trap composed of 40 places in 92 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/207 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 340 unsolved
[2024-06-01 03:32:04] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 207/548 variables, and 68 constraints, problems are : Problem set: 0 solved, 340 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/207 constraints, PredecessorRefiner: 340/340 constraints, Known Traps: 58/58 constraints]
Escalating to Integer solving :Problem set: 0 solved, 340 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 1 (OVERLAPS) 1/207 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 58/68 constraints. Problems are: Problem set: 0 solved, 340 unsolved
[2024-06-01 03:32:06] [INFO ] Deduced a trap composed of 37 places in 145 ms of which 2 ms to minimize.
[2024-06-01 03:32:06] [INFO ] Deduced a trap composed of 51 places in 114 ms of which 2 ms to minimize.
[2024-06-01 03:32:07] [INFO ] Deduced a trap composed of 38 places in 115 ms of which 1 ms to minimize.
[2024-06-01 03:32:07] [INFO ] Deduced a trap composed of 38 places in 130 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/207 variables, 4/72 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 5 (OVERLAPS) 341/548 variables, 207/279 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 340/619 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/548 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 8 (OVERLAPS) 0/548 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 340 unsolved
No progress, stopping.
After SMT solving in domain Int declared 548/548 variables, and 619 constraints, problems are : Problem set: 0 solved, 340 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 207/207 constraints, PredecessorRefiner: 340/340 constraints, Known Traps: 62/62 constraints]
After SMT, in 60354ms problems are : Problem set: 0 solved, 340 unsolved
Search for dead transitions found 0 dead transitions in 60359ms
Starting structural reductions in LTL mode, iteration 1 : 207/214 places, 341/348 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60747 ms. Remains : 207/214 places, 341/348 transitions.
Stuttering acceptance computed with spot in 235 ms :[true, (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : AutonomousCar-PT-05b-LTLCardinality-13
Product exploration explored 100000 steps with 38 reset in 253 ms.
Entered a terminal (fully accepting) state of product in 1466 steps with 14 reset in 7 ms.
FORMULA AutonomousCar-PT-05b-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05b-LTLCardinality-13 finished in 61285 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-05b-LTLCardinality-06
Stuttering acceptance computed with spot in 218 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 214 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 214/214 places, 348/348 transitions.
Graph (trivial) has 199 edges and 214 vertex of which 4 / 214 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 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 79 place count 211 transition count 267
Reduce places removed 78 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 1 with 107 rules applied. Total rules applied 186 place count 133 transition count 238
Reduce places removed 17 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 18 rules applied. Total rules applied 204 place count 116 transition count 237
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 205 place count 115 transition count 237
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 205 place count 115 transition count 229
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 221 place count 107 transition count 229
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 226 place count 102 transition count 224
Iterating global reduction 4 with 5 rules applied. Total rules applied 231 place count 102 transition count 224
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 233 place count 100 transition count 218
Iterating global reduction 4 with 2 rules applied. Total rules applied 235 place count 100 transition count 218
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 237 place count 100 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 238 place count 99 transition count 216
Performed 43 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 6 with 86 rules applied. Total rules applied 324 place count 56 transition count 172
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 325 place count 56 transition count 171
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 334 place count 47 transition count 121
Iterating global reduction 7 with 9 rules applied. Total rules applied 343 place count 47 transition count 121
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 347 place count 47 transition count 117
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 349 place count 46 transition count 116
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 351 place count 44 transition count 114
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 352 place count 43 transition count 114
Applied a total of 352 rules in 33 ms. Remains 43 /214 variables (removed 171) and now considering 114/348 (removed 234) transitions.
// Phase 1: matrix 114 rows 43 cols
[2024-06-01 03:32:35] [INFO ] Computed 8 invariants in 1 ms
[2024-06-01 03:32:35] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-06-01 03:32:35] [INFO ] Invariant cache hit.
[2024-06-01 03:32:35] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 03:32:35] [INFO ] Implicit Places using invariants and state equation in 115 ms returned [39, 42]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 182 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 41/214 places, 114/348 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 40 transition count 113
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 4 place count 39 transition count 114
Applied a total of 4 rules in 6 ms. Remains 39 /41 variables (removed 2) and now considering 114/114 (removed 0) transitions.
// Phase 1: matrix 114 rows 39 cols
[2024-06-01 03:32:35] [INFO ] Computed 6 invariants in 1 ms
[2024-06-01 03:32:35] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-06-01 03:32:35] [INFO ] Invariant cache hit.
[2024-06-01 03:32:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 03:32:35] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 39/214 places, 114/348 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 379 ms. Remains : 39/214 places, 114/348 transitions.
Running random walk in product with property : AutonomousCar-PT-05b-LTLCardinality-06
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 1 ms.
Treatment of property AutonomousCar-PT-05b-LTLCardinality-06 finished in 786 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(G((p1||X(X(p2)))))||p0))))'
[2024-06-01 03:32:36] [INFO ] Flatten gal took : 46 ms
[2024-06-01 03:32:36] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2024-06-01 03:32:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 214 places, 348 transitions and 1641 arcs took 26 ms.
Total runtime 609748 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA AutonomousCar-PT-05b-LTLCardinality-06 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-05b-LTLCardinality-07 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717212762032

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name AutonomousCar-PT-05b-LTLCardinality-06
ltl formula formula --ltl=/tmp/3001/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 214 places, 348 transitions and 1641 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.090 real 0.010 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3001/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3001/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3001/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3001/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 216 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 215, there are 355 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~47 levels ~10000 states ~25300 transitions
pnml2lts-mc( 1/ 4): ~47 levels ~20000 states ~55212 transitions
pnml2lts-mc( 1/ 4): ~47 levels ~40000 states ~115264 transitions
pnml2lts-mc( 1/ 4): ~47 levels ~80000 states ~231512 transitions
pnml2lts-mc( 1/ 4): ~47 levels ~160000 states ~488524 transitions
pnml2lts-mc( 1/ 4): ~47 levels ~320000 states ~1056444 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 338556
pnml2lts-mc( 0/ 4): unique states count: 338556
pnml2lts-mc( 0/ 4): unique transitions count: 1191145
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 862225
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 343540
pnml2lts-mc( 0/ 4): - cum. max stack depth: 189
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 343540 states 1218859 transitions, fanout: 3.548
pnml2lts-mc( 0/ 4): Total exploration time 3.930 sec (3.910 sec minimum, 3.920 sec on average)
pnml2lts-mc( 0/ 4): States per second: 87415, Transitions per second: 310142
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 2.6MB, 8.2 B/state, compr.: 1.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 1.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 351 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 2.6MB (~256.0MB paged-in)
ltl formula name AutonomousCar-PT-05b-LTLCardinality-07
ltl formula formula --ltl=/tmp/3001/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 214 places, 348 transitions and 1641 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.010 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3001/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3001/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3001/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3001/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 216 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 215, there are 394 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~87 levels ~10000 states ~41792 transitions
pnml2lts-mc( 0/ 4): ~110 levels ~20000 states ~79792 transitions
pnml2lts-mc( 2/ 4): ~85 levels ~40000 states ~155828 transitions
pnml2lts-mc( 2/ 4): ~85 levels ~80000 states ~342136 transitions
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~79!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 84261
pnml2lts-mc( 0/ 4): unique states count: 86294
pnml2lts-mc( 0/ 4): unique transitions count: 405373
pnml2lts-mc( 0/ 4): - self-loop count: 35
pnml2lts-mc( 0/ 4): - claim dead count: 315508
pnml2lts-mc( 0/ 4): - claim found count: 1852
pnml2lts-mc( 0/ 4): - claim success count: 86308
pnml2lts-mc( 0/ 4): - cum. max stack depth: 507
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 86308 states 405421 transitions, fanout: 4.697
pnml2lts-mc( 0/ 4): Total exploration time 1.110 sec (1.100 sec minimum, 1.102 sec on average)
pnml2lts-mc( 0/ 4): States per second: 77755, Transitions per second: 365244
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.8MB, 9.6 B/state, compr.: 1.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 351 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.8MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AutonomousCar-PT-05b"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is AutonomousCar-PT-05b, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r468-smll-171620167400291"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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