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.r026-smll-171620167400316.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 itstools
Input is AutonomousCar-PT-07a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-smll-171620167400316
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 660K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.3K Apr 12 18:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 45K Apr 12 18:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 18:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 101K Apr 12 18:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:29 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 276K 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-07a-LTLFireability-00
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-01
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-02
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-03
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-04
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-05
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-06
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-07
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-08
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-09
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-10
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-11
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-12
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-13
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-14
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716333100939

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-07a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-21 23:11:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 23:11:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:11:43] [INFO ] Load time of PNML (sax parser for PT used): 203 ms
[2024-05-21 23:11:43] [INFO ] Transformed 73 places.
[2024-05-21 23:11:43] [INFO ] Transformed 593 transitions.
[2024-05-21 23:11:43] [INFO ] Found NUPN structural information;
[2024-05-21 23:11:43] [INFO ] Parsed PT model containing 73 places and 593 transitions and 5357 arcs in 381 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 213 transitions
Reduce redundant transitions removed 213 transitions.
FORMULA AutonomousCar-PT-07a-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-07a-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-07a-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-07a-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 73 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 380/380 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 71 transition count 371
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 71 transition count 371
Applied a total of 4 rules in 51 ms. Remains 71 /73 variables (removed 2) and now considering 371/380 (removed 9) transitions.
// Phase 1: matrix 371 rows 71 cols
[2024-05-21 23:11:43] [INFO ] Computed 11 invariants in 43 ms
[2024-05-21 23:11:44] [INFO ] Implicit Places using invariants in 394 ms returned []
[2024-05-21 23:11:44] [INFO ] Invariant cache hit.
[2024-05-21 23:11:44] [INFO ] State equation strengthened by 192 read => feed constraints.
[2024-05-21 23:11:44] [INFO ] Implicit Places using invariants and state equation in 412 ms returned [67, 69]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 862 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 69/73 places, 371/380 transitions.
Applied a total of 0 rules in 8 ms. Remains 69 /69 variables (removed 0) and now considering 371/371 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 949 ms. Remains : 69/73 places, 371/380 transitions.
Support contains 40 out of 69 places after structural reductions.
[2024-05-21 23:11:45] [INFO ] Flatten gal took : 154 ms
[2024-05-21 23:11:45] [INFO ] Flatten gal took : 74 ms
[2024-05-21 23:11:45] [INFO ] Input system was already deterministic with 371 transitions.
Reduction of identical properties reduced properties to check from 29 to 28
RANDOM walk for 40000 steps (2206 resets) in 4520 ms. (8 steps per ms) remains 14/28 properties
BEST_FIRST walk for 40003 steps (109 resets) in 308 ms. (129 steps per ms) remains 13/14 properties
BEST_FIRST walk for 40004 steps (197 resets) in 151 ms. (263 steps per ms) remains 11/13 properties
BEST_FIRST walk for 40004 steps (165 resets) in 174 ms. (228 steps per ms) remains 9/11 properties
BEST_FIRST walk for 40004 steps (161 resets) in 124 ms. (320 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (163 resets) in 94 ms. (421 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (215 resets) in 277 ms. (143 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (215 resets) in 109 ms. (363 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (181 resets) in 118 ms. (336 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (177 resets) in 98 ms. (404 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (210 resets) in 85 ms. (465 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40004 steps (212 resets) in 103 ms. (384 steps per ms) remains 7/7 properties
// Phase 1: matrix 371 rows 69 cols
[2024-05-21 23:11:47] [INFO ] Computed 9 invariants in 6 ms
[2024-05-21 23:11:47] [INFO ] State equation strengthened by 192 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp28 is UNSAT
At refinement iteration 1 (OVERLAPS) 31/61 variables, 9/9 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/9 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 364/425 variables, 61/70 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/425 variables, 191/261 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/425 variables, 0/261 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 13/438 variables, 7/268 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/438 variables, 0/268 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1/439 variables, 1/269 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/439 variables, 0/269 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 1/440 variables, 1/270 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/440 variables, 0/270 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/440 variables, 0/270 constraints. Problems are: Problem set: 3 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 440/440 variables, and 270 constraints, problems are : Problem set: 3 solved, 4 unsolved in 649 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 69/69 constraints, ReadFeed: 192/192 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 19/26 variables, 4/4 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 34/60 variables, 5/9 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/9 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 362/422 variables, 60/69 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/422 variables, 191/260 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/422 variables, 0/260 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 13/435 variables, 5/265 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/435 variables, 4/269 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/435 variables, 0/269 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 4/439 variables, 4/273 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/439 variables, 0/273 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 1/440 variables, 1/274 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/440 variables, 0/274 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/440 variables, 0/274 constraints. Problems are: Problem set: 3 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 440/440 variables, and 274 constraints, problems are : Problem set: 3 solved, 4 unsolved in 1581 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 69/69 constraints, ReadFeed: 192/192 constraints, PredecessorRefiner: 4/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 2453ms problems are : Problem set: 3 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 687 ms.
Support contains 7 out of 69 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 371/371 transitions.
Graph (complete) has 661 edges and 69 vertex of which 68 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 68 transition count 360
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 18 place count 61 transition count 360
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 18 place count 61 transition count 359
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 60 transition count 359
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 26 place count 54 transition count 318
Iterating global reduction 2 with 6 rules applied. Total rules applied 32 place count 54 transition count 318
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 38 place count 51 transition count 315
Free-agglomeration rule applied 7 times.
Iterating global reduction 2 with 7 rules applied. Total rules applied 45 place count 51 transition count 308
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 2 with 42 rules applied. Total rules applied 87 place count 44 transition count 273
Applied a total of 87 rules in 145 ms. Remains 44 /69 variables (removed 25) and now considering 273/371 (removed 98) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 145 ms. Remains : 44/69 places, 273/371 transitions.
RANDOM walk for 40000 steps (145 resets) in 614 ms. (65 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (136 resets) in 108 ms. (367 steps per ms) remains 2/2 properties
BEST_FIRST walk for 34023 steps (93 resets) in 64 ms. (523 steps per ms) remains 0/2 properties
Successfully simplified 3 atomic propositions for a total of 12 simplifications.
FORMULA AutonomousCar-PT-07a-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-07a-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-07a-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3 stabilizing places and 2 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(G(p0))&&F(p1))))'
Support contains 13 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 371/371 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 69 transition count 366
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 64 transition count 365
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 63 transition count 365
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 12 place count 63 transition count 363
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 16 place count 61 transition count 363
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 22 place count 55 transition count 315
Iterating global reduction 3 with 6 rules applied. Total rules applied 28 place count 55 transition count 315
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 3 with 2 rules applied. Total rules applied 30 place count 54 transition count 314
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 32 place count 53 transition count 314
Applied a total of 32 rules in 51 ms. Remains 53 /69 variables (removed 16) and now considering 314/371 (removed 57) transitions.
// Phase 1: matrix 314 rows 53 cols
[2024-05-21 23:11:51] [INFO ] Computed 9 invariants in 4 ms
[2024-05-21 23:11:51] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-05-21 23:11:51] [INFO ] Invariant cache hit.
[2024-05-21 23:11:51] [INFO ] State equation strengthened by 152 read => feed constraints.
[2024-05-21 23:11:51] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
[2024-05-21 23:11:51] [INFO ] Redundant transitions in 46 ms returned []
Running 313 sub problems to find dead transitions.
[2024-05-21 23:11:51] [INFO ] Invariant cache hit.
[2024-05-21 23:11:51] [INFO ] State equation strengthened by 152 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 3 (OVERLAPS) 313/366 variables, 53/62 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/366 variables, 151/213 constraints. Problems are: Problem set: 0 solved, 313 unsolved
[2024-05-21 23:12:02] [INFO ] Deduced a trap composed of 17 places in 214 ms of which 11 ms to minimize.
[2024-05-21 23:12:02] [INFO ] Deduced a trap composed of 12 places in 211 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 2/215 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (OVERLAPS) 1/367 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/367 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 9 (OVERLAPS) 0/367 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 313 unsolved
No progress, stopping.
After SMT solving in domain Real declared 367/367 variables, and 216 constraints, problems are : Problem set: 0 solved, 313 unsolved in 21340 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 152/152 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 313 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (OVERLAPS) 313/366 variables, 53/64 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 151/215 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 313/528 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 8 (OVERLAPS) 1/367 variables, 1/529 constraints. Problems are: Problem set: 0 solved, 313 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 367/367 variables, and 529 constraints, problems are : Problem set: 0 solved, 313 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 152/152 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 2/2 constraints]
After SMT, in 53369ms problems are : Problem set: 0 solved, 313 unsolved
Search for dead transitions found 0 dead transitions in 53379ms
Starting structural reductions in SI_LTL mode, iteration 1 : 53/69 places, 314/371 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 53842 ms. Remains : 53/69 places, 314/371 transitions.
Stuttering acceptance computed with spot in 381 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-07a-LTLFireability-00
Product exploration explored 100000 steps with 37 reset in 475 ms.
Product exploration explored 100000 steps with 118 reset in 307 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 110 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 17162 steps (1105 resets) in 182 ms. (93 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 179 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 13 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 314/314 transitions.
Applied a total of 0 rules in 20 ms. Remains 53 /53 variables (removed 0) and now considering 314/314 (removed 0) transitions.
[2024-05-21 23:12:47] [INFO ] Invariant cache hit.
[2024-05-21 23:12:47] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-21 23:12:47] [INFO ] Invariant cache hit.
[2024-05-21 23:12:47] [INFO ] State equation strengthened by 152 read => feed constraints.
[2024-05-21 23:12:47] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
[2024-05-21 23:12:47] [INFO ] Redundant transitions in 30 ms returned []
Running 313 sub problems to find dead transitions.
[2024-05-21 23:12:47] [INFO ] Invariant cache hit.
[2024-05-21 23:12:47] [INFO ] State equation strengthened by 152 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 3 (OVERLAPS) 313/366 variables, 53/62 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/366 variables, 151/213 constraints. Problems are: Problem set: 0 solved, 313 unsolved
[2024-05-21 23:12:57] [INFO ] Deduced a trap composed of 17 places in 198 ms of which 2 ms to minimize.
[2024-05-21 23:12:58] [INFO ] Deduced a trap composed of 12 places in 263 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 2/215 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (OVERLAPS) 1/367 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/367 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 9 (OVERLAPS) 0/367 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 313 unsolved
No progress, stopping.
After SMT solving in domain Real declared 367/367 variables, and 216 constraints, problems are : Problem set: 0 solved, 313 unsolved in 21112 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 152/152 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 313 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (OVERLAPS) 313/366 variables, 53/64 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 151/215 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 313/528 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 8 (OVERLAPS) 1/367 variables, 1/529 constraints. Problems are: Problem set: 0 solved, 313 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 367/367 variables, and 529 constraints, problems are : Problem set: 0 solved, 313 unsolved in 30112 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 152/152 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 2/2 constraints]
After SMT, in 53133ms problems are : Problem set: 0 solved, 313 unsolved
Search for dead transitions found 0 dead transitions in 53139ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 53513 ms. Remains : 53/53 places, 314/314 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 90 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 14888 steps (960 resets) in 128 ms. (115 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 248 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 103 reset in 119 ms.
Product exploration explored 100000 steps with 6 reset in 348 ms.
Built C files in :
/tmp/ltsmin13580711092356327401
[2024-05-21 23:13:42] [INFO ] Computing symmetric may disable matrix : 314 transitions.
[2024-05-21 23:13:42] [INFO ] Computation of Complete disable matrix. took 41 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:13:42] [INFO ] Computing symmetric may enable matrix : 314 transitions.
[2024-05-21 23:13:42] [INFO ] Computation of Complete enable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:13:42] [INFO ] Computing Do-Not-Accords matrix : 314 transitions.
[2024-05-21 23:13:42] [INFO ] Computation of Completed DNA matrix. took 19 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:13:42] [INFO ] Built C files in 255ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13580711092356327401
Running compilation step : cd /tmp/ltsmin13580711092356327401;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2217 ms.
Running link step : cd /tmp/ltsmin13580711092356327401;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 65 ms.
Running LTSmin : cd /tmp/ltsmin13580711092356327401;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6901606331845881043.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 13 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 314/314 transitions.
Applied a total of 0 rules in 25 ms. Remains 53 /53 variables (removed 0) and now considering 314/314 (removed 0) transitions.
[2024-05-21 23:13:57] [INFO ] Invariant cache hit.
[2024-05-21 23:13:57] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-21 23:13:57] [INFO ] Invariant cache hit.
[2024-05-21 23:13:57] [INFO ] State equation strengthened by 152 read => feed constraints.
[2024-05-21 23:13:57] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
[2024-05-21 23:13:57] [INFO ] Redundant transitions in 19 ms returned []
Running 313 sub problems to find dead transitions.
[2024-05-21 23:13:57] [INFO ] Invariant cache hit.
[2024-05-21 23:13:57] [INFO ] State equation strengthened by 152 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 3 (OVERLAPS) 313/366 variables, 53/62 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/366 variables, 151/213 constraints. Problems are: Problem set: 0 solved, 313 unsolved
[2024-05-21 23:14:07] [INFO ] Deduced a trap composed of 17 places in 184 ms of which 1 ms to minimize.
[2024-05-21 23:14:07] [INFO ] Deduced a trap composed of 12 places in 199 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 2/215 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (OVERLAPS) 1/367 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/367 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 9 (OVERLAPS) 0/367 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 313 unsolved
No progress, stopping.
After SMT solving in domain Real declared 367/367 variables, and 216 constraints, problems are : Problem set: 0 solved, 313 unsolved in 21960 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 152/152 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 313 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (OVERLAPS) 313/366 variables, 53/64 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 151/215 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 313/528 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 313 unsolved
SMT process timed out in 53501ms, After SMT, problems are : Problem set: 0 solved, 313 unsolved
Search for dead transitions found 0 dead transitions in 53506ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 53861 ms. Remains : 53/53 places, 314/314 transitions.
Built C files in :
/tmp/ltsmin8397388498461899288
[2024-05-21 23:14:51] [INFO ] Computing symmetric may disable matrix : 314 transitions.
[2024-05-21 23:14:51] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:14:51] [INFO ] Computing symmetric may enable matrix : 314 transitions.
[2024-05-21 23:14:51] [INFO ] Computation of Complete enable matrix. took 19 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:14:51] [INFO ] Computing Do-Not-Accords matrix : 314 transitions.
[2024-05-21 23:14:51] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:14:51] [INFO ] Built C files in 77ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8397388498461899288
Running compilation step : cd /tmp/ltsmin8397388498461899288;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2022 ms.
Running link step : cd /tmp/ltsmin8397388498461899288;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 60 ms.
Running LTSmin : cd /tmp/ltsmin8397388498461899288;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased447213698852217066.hoa' '--buchi-type=spotba'
LTSmin run took 1255 ms.
FORMULA AutonomousCar-PT-07a-LTLFireability-00 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-07a-LTLFireability-00 finished in 183323 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)||F((G(p2)&&p1)))))'
Support contains 14 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 371/371 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 65 transition count 339
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 65 transition count 339
Applied a total of 8 rules in 7 ms. Remains 65 /69 variables (removed 4) and now considering 339/371 (removed 32) transitions.
// Phase 1: matrix 339 rows 65 cols
[2024-05-21 23:14:54] [INFO ] Computed 9 invariants in 3 ms
[2024-05-21 23:14:54] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-21 23:14:54] [INFO ] Invariant cache hit.
[2024-05-21 23:14:55] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-21 23:14:55] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 429 ms to find 0 implicit places.
Running 338 sub problems to find dead transitions.
[2024-05-21 23:14:55] [INFO ] Invariant cache hit.
[2024-05-21 23:14:55] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 3 (OVERLAPS) 338/403 variables, 65/74 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/403 variables, 163/237 constraints. Problems are: Problem set: 0 solved, 338 unsolved
[2024-05-21 23:15:05] [INFO ] Deduced a trap composed of 20 places in 160 ms of which 2 ms to minimize.
[2024-05-21 23:15:05] [INFO ] Deduced a trap composed of 13 places in 161 ms of which 2 ms to minimize.
[2024-05-21 23:15:05] [INFO ] Deduced a trap composed of 7 places in 173 ms of which 2 ms to minimize.
[2024-05-21 23:15:08] [INFO ] Deduced a trap composed of 18 places in 253 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 4/241 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/403 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 7 (OVERLAPS) 1/404 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/404 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 9 (OVERLAPS) 0/404 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 338 unsolved
No progress, stopping.
After SMT solving in domain Real declared 404/404 variables, and 242 constraints, problems are : Problem set: 0 solved, 338 unsolved in 28544 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 65/65 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 338/338 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 338 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 4 (OVERLAPS) 338/403 variables, 65/78 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 163/241 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/403 variables, 338/579 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/403 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 8 (OVERLAPS) 1/404 variables, 1/580 constraints. Problems are: Problem set: 0 solved, 338 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 404/404 variables, and 580 constraints, problems are : Problem set: 0 solved, 338 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 65/65 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 338/338 constraints, Known Traps: 4/4 constraints]
After SMT, in 60958ms problems are : Problem set: 0 solved, 338 unsolved
Search for dead transitions found 0 dead transitions in 60965ms
Starting structural reductions in LTL mode, iteration 1 : 65/69 places, 339/371 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61404 ms. Remains : 65/69 places, 339/371 transitions.
Stuttering acceptance computed with spot in 295 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : AutonomousCar-PT-07a-LTLFireability-01
Stuttering criterion allowed to conclude after 16 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-07a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07a-LTLFireability-01 finished in 61729 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||X(F(((!p1 U (p2||G(!p1))) U (((F(!p3) U ((!p4&&F(!p3))||G(F(!p3))))&&(!p1 U (p2||G(!p1))))||G((!p1 U (p2||G(!p1)))))))))))'
Support contains 17 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 371/371 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 69 transition count 365
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 63 transition count 365
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 12 place count 63 transition count 363
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 61 transition count 363
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 21 place count 56 transition count 323
Iterating global reduction 2 with 5 rules applied. Total rules applied 26 place count 56 transition count 323
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 55 transition count 322
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 54 transition count 322
Applied a total of 30 rules in 49 ms. Remains 54 /69 variables (removed 15) and now considering 322/371 (removed 49) transitions.
// Phase 1: matrix 322 rows 54 cols
[2024-05-21 23:15:56] [INFO ] Computed 9 invariants in 5 ms
[2024-05-21 23:15:56] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-21 23:15:56] [INFO ] Invariant cache hit.
[2024-05-21 23:15:56] [INFO ] State equation strengthened by 159 read => feed constraints.
[2024-05-21 23:15:56] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
[2024-05-21 23:15:56] [INFO ] Redundant transitions in 19 ms returned []
Running 321 sub problems to find dead transitions.
[2024-05-21 23:15:56] [INFO ] Invariant cache hit.
[2024-05-21 23:15:56] [INFO ] State equation strengthened by 159 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (OVERLAPS) 321/375 variables, 54/63 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/375 variables, 158/221 constraints. Problems are: Problem set: 0 solved, 321 unsolved
[2024-05-21 23:16:08] [INFO ] Deduced a trap composed of 17 places in 355 ms of which 2 ms to minimize.
[2024-05-21 23:16:08] [INFO ] Deduced a trap composed of 12 places in 201 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/375 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (OVERLAPS) 1/376 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/376 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 9 (OVERLAPS) 0/376 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 321 unsolved
No progress, stopping.
After SMT solving in domain Real declared 376/376 variables, and 224 constraints, problems are : Problem set: 0 solved, 321 unsolved in 25648 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 54/54 constraints, ReadFeed: 159/159 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 321 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (OVERLAPS) 321/375 variables, 54/65 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/375 variables, 158/223 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 321/544 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/375 variables, 0/544 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 8 (OVERLAPS) 1/376 variables, 1/545 constraints. Problems are: Problem set: 0 solved, 321 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 Int declared 376/376 variables, and 545 constraints, problems are : Problem set: 0 solved, 321 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 54/54 constraints, ReadFeed: 159/159 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 2/2 constraints]
After SMT, in 57502ms problems are : Problem set: 0 solved, 321 unsolved
Search for dead transitions found 0 dead transitions in 57505ms
Starting structural reductions in SI_LTL mode, iteration 1 : 54/69 places, 322/371 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 57902 ms. Remains : 54/69 places, 322/371 transitions.
Stuttering acceptance computed with spot in 412 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 p3 (NOT p2)), (AND (NOT p0) p1 (NOT p2) p3)]
Running random walk in product with property : AutonomousCar-PT-07a-LTLFireability-02
Product exploration explored 100000 steps with 49 reset in 107 ms.
Product exploration explored 100000 steps with 2 reset in 121 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2 (NOT p4) (NOT p3)), (X p2), (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p4) p3) (AND (NOT p0) p2 (NOT p4) p3)))), (X (NOT p3)), (X (NOT p4)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (OR (AND (NOT p0) (NOT p1) p4) (AND (NOT p0) p2 p4)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) p1 (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) p4)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p4) p3) (AND (NOT p0) p2 (NOT p4) p3))))), (X (X (NOT p3))), (X (X (NOT p4))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) p2 p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) p1 (NOT p2) p3) (AND (NOT p0) (NOT p4) p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) p4) (AND (NOT p0) p2 p4))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 301 ms. Reduced automaton from 5 states, 12 edges and 5 AP (stutter insensitive) to 5 states, 12 edges and 5 AP (stutter insensitive).
Stuttering acceptance computed with spot in 367 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 p3 (NOT p2)), (AND (NOT p0) p1 (NOT p2) p3)]
RANDOM walk for 40000 steps (2528 resets) in 1081 ms. (36 steps per ms) remains 9/13 properties
BEST_FIRST walk for 40004 steps (203 resets) in 1250 ms. (31 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (312 resets) in 211 ms. (188 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (198 resets) in 254 ms. (156 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (126 resets) in 136 ms. (292 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (208 resets) in 173 ms. (229 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (312 resets) in 134 ms. (296 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (256 resets) in 117 ms. (339 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (175 resets) in 210 ms. (189 steps per ms) remains 8/8 properties
[2024-05-21 23:16:57] [INFO ] Invariant cache hit.
[2024-05-21 23:16:57] [INFO ] State equation strengthened by 159 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem apf1 is UNSAT
Problem apf2 is UNSAT
Problem apf4 is UNSAT
Problem apf6 is UNSAT
Problem apf7 is UNSAT
Problem apf8 is UNSAT
Problem apf9 is UNSAT
Problem apf10 is UNSAT
After SMT solving in domain Real declared 49/376 variables, and 9 constraints, problems are : Problem set: 8 solved, 0 unsolved in 114 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 0/54 constraints, ReadFeed: 0/159 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 222ms problems are : Problem set: 8 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 8 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) p2 (NOT p4) (NOT p3)), (X p2), (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p4) p3) (AND (NOT p0) p2 (NOT p4) p3)))), (X (NOT p3)), (X (NOT p4)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (OR (AND (NOT p0) (NOT p1) p4) (AND (NOT p0) p2 p4)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) p1 (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) p4)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p4) p3) (AND (NOT p0) p2 (NOT p4) p3))))), (X (X (NOT p3))), (X (X (NOT p4))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) p2 p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) p1 (NOT p2) p3) (AND (NOT p0) (NOT p4) p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) p4) (AND (NOT p0) p2 p4))))), (X (X p0)), (X (X (NOT p1))), (G (AND (OR p0 p1 (NOT p4)) (OR p0 (NOT p4) (NOT p2)))), (G (AND (OR p0 (NOT p1) (NOT p3) p2) (OR p0 (NOT p3) p4))), (G (OR p0 p1 p2)), (G (AND (OR p0 p1 (NOT p3)) (OR p0 (NOT p3) (NOT p2)))), (G (OR p0 (NOT p1) p2)), (G (OR p0 (NOT p4))), (G (AND (OR p0 p1 (NOT p3) p4) (OR p0 (NOT p3) p4 (NOT p2)))), (G (OR p0 (NOT p1) (NOT p3) p2))]
False Knowledge obtained : [(F p3), (F p1), (F p4), (F (NOT p2)), (F (NOT p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 31 factoid took 21 ms. Reduced automaton from 5 states, 12 edges and 5 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-07a-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-07a-LTLFireability-02 finished in 60803 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&(F(p1)||X(G(p2))))))'
Support contains 6 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 371/371 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 65 transition count 339
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 65 transition count 339
Applied a total of 8 rules in 7 ms. Remains 65 /69 variables (removed 4) and now considering 339/371 (removed 32) transitions.
// Phase 1: matrix 339 rows 65 cols
[2024-05-21 23:16:57] [INFO ] Computed 9 invariants in 7 ms
[2024-05-21 23:16:57] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-05-21 23:16:57] [INFO ] Invariant cache hit.
[2024-05-21 23:16:57] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-21 23:16:57] [INFO ] Implicit Places using invariants and state equation in 336 ms returned []
Implicit Place search using SMT with State Equation took 478 ms to find 0 implicit places.
Running 338 sub problems to find dead transitions.
[2024-05-21 23:16:57] [INFO ] Invariant cache hit.
[2024-05-21 23:16:57] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 3 (OVERLAPS) 338/403 variables, 65/74 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/403 variables, 163/237 constraints. Problems are: Problem set: 0 solved, 338 unsolved
[2024-05-21 23:17:06] [INFO ] Deduced a trap composed of 20 places in 162 ms of which 1 ms to minimize.
[2024-05-21 23:17:06] [INFO ] Deduced a trap composed of 13 places in 154 ms of which 1 ms to minimize.
[2024-05-21 23:17:07] [INFO ] Deduced a trap composed of 7 places in 164 ms of which 2 ms to minimize.
[2024-05-21 23:17:10] [INFO ] Deduced a trap composed of 18 places in 187 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 4/241 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/403 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 7 (OVERLAPS) 1/404 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/404 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 9 (OVERLAPS) 0/404 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 338 unsolved
No progress, stopping.
After SMT solving in domain Real declared 404/404 variables, and 242 constraints, problems are : Problem set: 0 solved, 338 unsolved in 28787 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 65/65 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 338/338 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 338 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 4 (OVERLAPS) 338/403 variables, 65/78 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 163/241 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/403 variables, 338/579 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/403 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 8 (OVERLAPS) 1/404 variables, 1/580 constraints. Problems are: Problem set: 0 solved, 338 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 404/404 variables, and 580 constraints, problems are : Problem set: 0 solved, 338 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 65/65 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 338/338 constraints, Known Traps: 4/4 constraints]
After SMT, in 61132ms problems are : Problem set: 0 solved, 338 unsolved
Search for dead transitions found 0 dead transitions in 61139ms
Starting structural reductions in LTL mode, iteration 1 : 65/69 places, 339/371 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61625 ms. Remains : 65/69 places, 339/371 transitions.
Stuttering acceptance computed with spot in 283 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-07a-LTLFireability-04
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-07a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07a-LTLFireability-04 finished in 61929 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))&&(X(!p1) U (p2 U p3))))'
Support contains 19 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 371/371 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 63 transition count 323
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 63 transition count 323
Applied a total of 12 rules in 6 ms. Remains 63 /69 variables (removed 6) and now considering 323/371 (removed 48) transitions.
// Phase 1: matrix 323 rows 63 cols
[2024-05-21 23:17:59] [INFO ] Computed 9 invariants in 4 ms
[2024-05-21 23:17:59] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-21 23:17:59] [INFO ] Invariant cache hit.
[2024-05-21 23:17:59] [INFO ] State equation strengthened by 150 read => feed constraints.
[2024-05-21 23:17:59] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
Running 322 sub problems to find dead transitions.
[2024-05-21 23:17:59] [INFO ] Invariant cache hit.
[2024-05-21 23:17:59] [INFO ] State equation strengthened by 150 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 3 (OVERLAPS) 322/385 variables, 63/72 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/385 variables, 149/221 constraints. Problems are: Problem set: 0 solved, 322 unsolved
[2024-05-21 23:18:06] [INFO ] Deduced a trap composed of 20 places in 160 ms of which 2 ms to minimize.
[2024-05-21 23:18:06] [INFO ] Deduced a trap composed of 13 places in 160 ms of which 1 ms to minimize.
[2024-05-21 23:18:07] [INFO ] Deduced a trap composed of 7 places in 173 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/385 variables, 3/224 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/385 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 7 (OVERLAPS) 1/386 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/386 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 9 (OVERLAPS) 0/386 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 322 unsolved
No progress, stopping.
After SMT solving in domain Real declared 386/386 variables, and 225 constraints, problems are : Problem set: 0 solved, 322 unsolved in 23961 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 63/63 constraints, ReadFeed: 150/150 constraints, PredecessorRefiner: 322/322 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 322 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 4 (OVERLAPS) 322/385 variables, 63/75 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/385 variables, 149/224 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/385 variables, 322/546 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/385 variables, 0/546 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 8 (OVERLAPS) 1/386 variables, 1/547 constraints. Problems are: Problem set: 0 solved, 322 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 386/386 variables, and 547 constraints, problems are : Problem set: 0 solved, 322 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 63/63 constraints, ReadFeed: 150/150 constraints, PredecessorRefiner: 322/322 constraints, Known Traps: 3/3 constraints]
After SMT, in 55419ms problems are : Problem set: 0 solved, 322 unsolved
Search for dead transitions found 0 dead transitions in 55426ms
Starting structural reductions in LTL mode, iteration 1 : 63/69 places, 323/371 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55740 ms. Remains : 63/69 places, 323/371 transitions.
Stuttering acceptance computed with spot in 424 ms :[(OR (NOT p3) (NOT p0)), p1, (NOT p0), (NOT p0), (NOT p3), (AND p1 (NOT p3)), true, (NOT p3)]
Running random walk in product with property : AutonomousCar-PT-07a-LTLFireability-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-07a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07a-LTLFireability-10 finished in 56203 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 4 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 371/371 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 64 transition count 331
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 64 transition count 331
Applied a total of 10 rules in 11 ms. Remains 64 /69 variables (removed 5) and now considering 331/371 (removed 40) transitions.
// Phase 1: matrix 331 rows 64 cols
[2024-05-21 23:18:55] [INFO ] Computed 9 invariants in 4 ms
[2024-05-21 23:18:55] [INFO ] Implicit Places using invariants in 168 ms returned []
[2024-05-21 23:18:55] [INFO ] Invariant cache hit.
[2024-05-21 23:18:55] [INFO ] State equation strengthened by 157 read => feed constraints.
[2024-05-21 23:18:55] [INFO ] Implicit Places using invariants and state equation in 401 ms returned []
Implicit Place search using SMT with State Equation took 573 ms to find 0 implicit places.
Running 330 sub problems to find dead transitions.
[2024-05-21 23:18:55] [INFO ] Invariant cache hit.
[2024-05-21 23:18:56] [INFO ] State equation strengthened by 157 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 3 (OVERLAPS) 330/394 variables, 64/73 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 156/229 constraints. Problems are: Problem set: 0 solved, 330 unsolved
[2024-05-21 23:19:02] [INFO ] Deduced a trap composed of 20 places in 176 ms of which 12 ms to minimize.
[2024-05-21 23:19:03] [INFO ] Deduced a trap composed of 13 places in 243 ms of which 3 ms to minimize.
[2024-05-21 23:19:03] [INFO ] Deduced a trap composed of 7 places in 195 ms of which 2 ms to minimize.
[2024-05-21 23:19:05] [INFO ] Deduced a trap composed of 18 places in 221 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 4/233 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 7 (OVERLAPS) 1/395 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 9 (OVERLAPS) 0/395 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 330 unsolved
No progress, stopping.
After SMT solving in domain Real declared 395/395 variables, and 234 constraints, problems are : Problem set: 0 solved, 330 unsolved in 23318 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 64/64 constraints, ReadFeed: 157/157 constraints, PredecessorRefiner: 330/330 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 330 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 4 (OVERLAPS) 330/394 variables, 64/77 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 156/233 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 330/563 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/394 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 8 (OVERLAPS) 1/395 variables, 1/564 constraints. Problems are: Problem set: 0 solved, 330 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 395/395 variables, and 564 constraints, problems are : Problem set: 0 solved, 330 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 64/64 constraints, ReadFeed: 157/157 constraints, PredecessorRefiner: 330/330 constraints, Known Traps: 4/4 constraints]
After SMT, in 54853ms problems are : Problem set: 0 solved, 330 unsolved
Search for dead transitions found 0 dead transitions in 54860ms
Starting structural reductions in LTL mode, iteration 1 : 64/69 places, 331/371 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55446 ms. Remains : 64/69 places, 331/371 transitions.
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-07a-LTLFireability-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-07a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07a-LTLFireability-11 finished in 55555 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 8 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 371/371 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 63 transition count 323
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 63 transition count 323
Applied a total of 12 rules in 5 ms. Remains 63 /69 variables (removed 6) and now considering 323/371 (removed 48) transitions.
// Phase 1: matrix 323 rows 63 cols
[2024-05-21 23:19:50] [INFO ] Computed 9 invariants in 2 ms
[2024-05-21 23:19:51] [INFO ] Implicit Places using invariants in 167 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 168 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 62/69 places, 323/371 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 323/323 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 175 ms. Remains : 62/69 places, 323/371 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-07a-LTLFireability-12
Product exploration explored 100000 steps with 50000 reset in 1217 ms.
Product exploration explored 100000 steps with 50000 reset in 1162 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 19 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-07a-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-07a-LTLFireability-12 finished in 2699 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 4 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 371/371 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 63 transition count 323
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 63 transition count 323
Applied a total of 12 rules in 4 ms. Remains 63 /69 variables (removed 6) and now considering 323/371 (removed 48) transitions.
[2024-05-21 23:19:53] [INFO ] Invariant cache hit.
[2024-05-21 23:19:53] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-05-21 23:19:53] [INFO ] Invariant cache hit.
[2024-05-21 23:19:53] [INFO ] State equation strengthened by 150 read => feed constraints.
[2024-05-21 23:19:54] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 407 ms to find 0 implicit places.
Running 322 sub problems to find dead transitions.
[2024-05-21 23:19:54] [INFO ] Invariant cache hit.
[2024-05-21 23:19:54] [INFO ] State equation strengthened by 150 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 3 (OVERLAPS) 322/385 variables, 63/72 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/385 variables, 149/221 constraints. Problems are: Problem set: 0 solved, 322 unsolved
[2024-05-21 23:20:01] [INFO ] Deduced a trap composed of 20 places in 156 ms of which 1 ms to minimize.
[2024-05-21 23:20:02] [INFO ] Deduced a trap composed of 13 places in 147 ms of which 1 ms to minimize.
[2024-05-21 23:20:02] [INFO ] Deduced a trap composed of 7 places in 201 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/385 variables, 3/224 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/385 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 7 (OVERLAPS) 1/386 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/386 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 9 (OVERLAPS) 0/386 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 322 unsolved
No progress, stopping.
After SMT solving in domain Real declared 386/386 variables, and 225 constraints, problems are : Problem set: 0 solved, 322 unsolved in 24105 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 63/63 constraints, ReadFeed: 150/150 constraints, PredecessorRefiner: 322/322 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 322 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 4 (OVERLAPS) 322/385 variables, 63/75 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/385 variables, 149/224 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/385 variables, 322/546 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/385 variables, 0/546 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 8 (OVERLAPS) 1/386 variables, 1/547 constraints. Problems are: Problem set: 0 solved, 322 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 386/386 variables, and 547 constraints, problems are : Problem set: 0 solved, 322 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 63/63 constraints, ReadFeed: 150/150 constraints, PredecessorRefiner: 322/322 constraints, Known Traps: 3/3 constraints]
After SMT, in 55575ms problems are : Problem set: 0 solved, 322 unsolved
Search for dead transitions found 0 dead transitions in 55579ms
Starting structural reductions in LTL mode, iteration 1 : 63/69 places, 323/371 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55991 ms. Remains : 63/69 places, 323/371 transitions.
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-07a-LTLFireability-13
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-07a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07a-LTLFireability-13 finished in 56161 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((((p1 U p2)||(p3 U p2))&&p0)))'
Support contains 14 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 371/371 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 69 transition count 366
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 64 transition count 365
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 63 transition count 365
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 12 place count 63 transition count 363
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 16 place count 61 transition count 363
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 22 place count 55 transition count 315
Iterating global reduction 3 with 6 rules applied. Total rules applied 28 place count 55 transition count 315
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 3 with 2 rules applied. Total rules applied 30 place count 54 transition count 314
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 32 place count 53 transition count 314
Applied a total of 32 rules in 33 ms. Remains 53 /69 variables (removed 16) and now considering 314/371 (removed 57) transitions.
// Phase 1: matrix 314 rows 53 cols
[2024-05-21 23:20:49] [INFO ] Computed 9 invariants in 3 ms
[2024-05-21 23:20:49] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-21 23:20:49] [INFO ] Invariant cache hit.
[2024-05-21 23:20:50] [INFO ] State equation strengthened by 152 read => feed constraints.
[2024-05-21 23:20:50] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 357 ms to find 0 implicit places.
[2024-05-21 23:20:50] [INFO ] Redundant transitions in 20 ms returned []
Running 313 sub problems to find dead transitions.
[2024-05-21 23:20:50] [INFO ] Invariant cache hit.
[2024-05-21 23:20:50] [INFO ] State equation strengthened by 152 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 3 (OVERLAPS) 313/366 variables, 53/62 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/366 variables, 151/213 constraints. Problems are: Problem set: 0 solved, 313 unsolved
[2024-05-21 23:20:58] [INFO ] Deduced a trap composed of 17 places in 182 ms of which 2 ms to minimize.
[2024-05-21 23:20:58] [INFO ] Deduced a trap composed of 12 places in 243 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 2/215 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (OVERLAPS) 1/367 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/367 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 9 (OVERLAPS) 0/367 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 313 unsolved
No progress, stopping.
After SMT solving in domain Real declared 367/367 variables, and 216 constraints, problems are : Problem set: 0 solved, 313 unsolved in 20476 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 152/152 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 313 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (OVERLAPS) 313/366 variables, 53/64 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 151/215 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 313/528 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 8 (OVERLAPS) 1/367 variables, 1/529 constraints. Problems are: Problem set: 0 solved, 313 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 367/367 variables, and 529 constraints, problems are : Problem set: 0 solved, 313 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 152/152 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 2/2 constraints]
After SMT, in 51855ms problems are : Problem set: 0 solved, 313 unsolved
Search for dead transitions found 0 dead transitions in 51859ms
Starting structural reductions in SI_LTL mode, iteration 1 : 53/69 places, 314/371 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 52276 ms. Remains : 53/69 places, 314/371 transitions.
Stuttering acceptance computed with spot in 203 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : AutonomousCar-PT-07a-LTLFireability-14
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-07a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07a-LTLFireability-14 finished in 52504 ms.
All properties solved by simple procedures.
Total runtime 599447 ms.

BK_STOP 1716333702397

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-07a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is AutonomousCar-PT-07a, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r026-smll-171620167400316"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;