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-171620167500332.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-08a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-smll-171620167500332
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 864K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K 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 26K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 18:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Apr 12 18:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 12 18:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 12 18:03 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 448K 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-08a-LTLFireability-00
FORMULA_NAME AutonomousCar-PT-08a-LTLFireability-01
FORMULA_NAME AutonomousCar-PT-08a-LTLFireability-02
FORMULA_NAME AutonomousCar-PT-08a-LTLFireability-03
FORMULA_NAME AutonomousCar-PT-08a-LTLFireability-04
FORMULA_NAME AutonomousCar-PT-08a-LTLFireability-05
FORMULA_NAME AutonomousCar-PT-08a-LTLFireability-06
FORMULA_NAME AutonomousCar-PT-08a-LTLFireability-07
FORMULA_NAME AutonomousCar-PT-08a-LTLFireability-08
FORMULA_NAME AutonomousCar-PT-08a-LTLFireability-09
FORMULA_NAME AutonomousCar-PT-08a-LTLFireability-10
FORMULA_NAME AutonomousCar-PT-08a-LTLFireability-11
FORMULA_NAME AutonomousCar-PT-08a-LTLFireability-12
FORMULA_NAME AutonomousCar-PT-08a-LTLFireability-13
FORMULA_NAME AutonomousCar-PT-08a-LTLFireability-14
FORMULA_NAME AutonomousCar-PT-08a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716339625933

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-08a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-22 01:00:28] [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-22 01:00:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 01:00:28] [INFO ] Load time of PNML (sax parser for PT used): 379 ms
[2024-05-22 01:00:28] [INFO ] Transformed 81 places.
[2024-05-22 01:00:29] [INFO ] Transformed 849 transitions.
[2024-05-22 01:00:29] [INFO ] Found NUPN structural information;
[2024-05-22 01:00:29] [INFO ] Parsed PT model containing 81 places and 849 transitions and 8894 arcs in 616 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 275 transitions
Reduce redundant transitions removed 275 transitions.
FORMULA AutonomousCar-PT-08a-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08a-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 574/574 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 79 transition count 564
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 79 transition count 564
Applied a total of 4 rules in 192 ms. Remains 79 /81 variables (removed 2) and now considering 564/574 (removed 10) transitions.
// Phase 1: matrix 564 rows 79 cols
[2024-05-22 01:00:29] [INFO ] Computed 12 invariants in 30 ms
[2024-05-22 01:00:30] [INFO ] Implicit Places using invariants in 483 ms returned []
[2024-05-22 01:00:30] [INFO ] Invariant cache hit.
[2024-05-22 01:00:30] [INFO ] State equation strengthened by 251 read => feed constraints.
[2024-05-22 01:00:30] [INFO ] Implicit Places using invariants and state equation in 458 ms returned [75, 77]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1004 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 77/81 places, 564/574 transitions.
Applied a total of 0 rules in 6 ms. Remains 77 /77 variables (removed 0) and now considering 564/564 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1242 ms. Remains : 77/81 places, 564/574 transitions.
Support contains 43 out of 77 places after structural reductions.
[2024-05-22 01:00:31] [INFO ] Flatten gal took : 224 ms
[2024-05-22 01:00:31] [INFO ] Flatten gal took : 124 ms
[2024-05-22 01:00:31] [INFO ] Input system was already deterministic with 564 transitions.
Reduction of identical properties reduced properties to check from 31 to 30
RANDOM walk for 40000 steps (2020 resets) in 3965 ms. (10 steps per ms) remains 13/30 properties
BEST_FIRST walk for 40004 steps (129 resets) in 186 ms. (213 steps per ms) remains 11/13 properties
BEST_FIRST walk for 40002 steps (131 resets) in 105 ms. (377 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (141 resets) in 119 ms. (333 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (179 resets) in 119 ms. (333 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40004 steps (182 resets) in 131 ms. (303 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40003 steps (153 resets) in 117 ms. (339 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (143 resets) in 93 ms. (425 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (152 resets) in 128 ms. (310 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (129 resets) in 100 ms. (396 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (208 resets) in 107 ms. (370 steps per ms) remains 8/9 properties
// Phase 1: matrix 564 rows 77 cols
[2024-05-22 01:00:33] [INFO ] Computed 10 invariants in 14 ms
[2024-05-22 01:00:33] [INFO ] State equation strengthened by 251 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, 8 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp23 is UNSAT
At refinement iteration 1 (OVERLAPS) 39/69 variables, 10/10 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/10 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 557/626 variables, 69/79 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/626 variables, 250/329 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/626 variables, 0/329 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 13/639 variables, 7/336 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/639 variables, 0/336 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1/640 variables, 1/337 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/640 variables, 0/337 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/641 variables, 1/338 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/641 variables, 0/338 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/641 variables, 0/338 constraints. Problems are: Problem set: 5 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 641/641 variables, and 338 constraints, problems are : Problem set: 5 solved, 3 unsolved in 677 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 77/77 constraints, ReadFeed: 251/251 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 25/33 variables, 5/5 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/5 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 35/68 variables, 5/10 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/10 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 555/623 variables, 68/78 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/623 variables, 250/328 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/623 variables, 0/328 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 13/636 variables, 5/333 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/636 variables, 3/336 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/636 variables, 0/336 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 4/640 variables, 4/340 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/640 variables, 0/340 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 1/641 variables, 1/341 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/641 variables, 0/341 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/641 variables, 0/341 constraints. Problems are: Problem set: 5 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 641/641 variables, and 341 constraints, problems are : Problem set: 5 solved, 3 unsolved in 1918 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 77/77 constraints, ReadFeed: 251/251 constraints, PredecessorRefiner: 3/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 2926ms problems are : Problem set: 5 solved, 3 unsolved
Parikh walk visited 0 properties in 2372 ms.
Support contains 8 out of 77 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 564/564 transitions.
Graph (complete) has 832 edges and 77 vertex of which 76 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.12 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 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 76 transition count 551
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 10 rules applied. Total rules applied 23 place count 67 transition count 550
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 24 place count 66 transition count 550
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 24 place count 66 transition count 549
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 26 place count 65 transition count 549
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 32 place count 59 transition count 503
Iterating global reduction 3 with 6 rules applied. Total rules applied 38 place count 59 transition count 503
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 44 place count 56 transition count 500
Free-agglomeration rule applied 7 times.
Iterating global reduction 3 with 7 rules applied. Total rules applied 51 place count 56 transition count 493
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 114 place count 49 transition count 437
Applied a total of 114 rules in 225 ms. Remains 49 /77 variables (removed 28) and now considering 437/564 (removed 127) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 226 ms. Remains : 49/77 places, 437/564 transitions.
RANDOM walk for 40000 steps (36 resets) in 720 ms. (55 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (150 resets) in 81 ms. (487 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (151 resets) in 91 ms. (434 steps per ms) remains 1/1 properties
// Phase 1: matrix 437 rows 49 cols
[2024-05-22 01:00:39] [INFO ] Computed 12 invariants in 7 ms
[2024-05-22 01:00:39] [INFO ] State equation strengthened by 153 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/18 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 31/49 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 437/486 variables, 49/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/486 variables, 153/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/486 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/486 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 486/486 variables, and 214 constraints, problems are : Problem set: 0 solved, 1 unsolved in 298 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 49/49 constraints, ReadFeed: 153/153 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/18 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 31/49 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 437/486 variables, 49/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/486 variables, 153/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/486 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/486 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/486 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 486/486 variables, and 215 constraints, problems are : Problem set: 0 solved, 1 unsolved in 358 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 49/49 constraints, ReadFeed: 153/153 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 705ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 92 ms.
Support contains 4 out of 49 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 437/437 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 48 transition count 428
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 48 transition count 428
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 48 transition count 427
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 12 place count 47 transition count 419
Applied a total of 12 rules in 72 ms. Remains 47 /49 variables (removed 2) and now considering 419/437 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 47/49 places, 419/437 transitions.
RANDOM walk for 40000 steps (23 resets) in 739 ms. (54 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (213 resets) in 84 ms. (470 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 628314 steps, run visited all 1 properties in 1224 ms. (steps per millisecond=513 )
Probabilistic random walk after 628314 steps, saw 81351 distinct states, run finished after 1230 ms. (steps per millisecond=510 ) properties seen :1
Successfully simplified 6 atomic propositions for a total of 14 simplifications.
FORMULA AutonomousCar-PT-08a-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08a-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3 stabilizing places and 2 stable transitions
FORMULA AutonomousCar-PT-08a-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)||X(G(p1))))))'
Support contains 6 out of 77 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 77/77 places, 564/564 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 72 transition count 519
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 72 transition count 519
Applied a total of 10 rules in 9 ms. Remains 72 /77 variables (removed 5) and now considering 519/564 (removed 45) transitions.
// Phase 1: matrix 519 rows 72 cols
[2024-05-22 01:00:42] [INFO ] Computed 10 invariants in 5 ms
[2024-05-22 01:00:42] [INFO ] Implicit Places using invariants in 275 ms returned []
[2024-05-22 01:00:42] [INFO ] Invariant cache hit.
[2024-05-22 01:00:42] [INFO ] State equation strengthened by 211 read => feed constraints.
[2024-05-22 01:00:42] [INFO ] Implicit Places using invariants and state equation in 525 ms returned []
Implicit Place search using SMT with State Equation took 811 ms to find 0 implicit places.
Running 518 sub problems to find dead transitions.
[2024-05-22 01:00:42] [INFO ] Invariant cache hit.
[2024-05-22 01:00:42] [INFO ] State equation strengthened by 211 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 1 (OVERLAPS) 1/72 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 3 (OVERLAPS) 518/590 variables, 72/82 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/590 variables, 210/292 constraints. Problems are: Problem set: 0 solved, 518 unsolved
[2024-05-22 01:01:01] [INFO ] Deduced a trap composed of 22 places in 493 ms of which 24 ms to minimize.
[2024-05-22 01:01:02] [INFO ] Deduced a trap composed of 14 places in 475 ms of which 3 ms to minimize.
[2024-05-22 01:01:02] [INFO ] Deduced a trap composed of 7 places in 366 ms of which 2 ms to minimize.
[2024-05-22 01:01:08] [INFO ] Deduced a trap composed of 20 places in 343 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/590 variables, 4/296 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/590 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 518 unsolved
SMT process timed out in 36133ms, After SMT, problems are : Problem set: 0 solved, 518 unsolved
Search for dead transitions found 0 dead transitions in 36161ms
Starting structural reductions in LTL mode, iteration 1 : 72/77 places, 519/564 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36989 ms. Remains : 72/77 places, 519/564 transitions.
Stuttering acceptance computed with spot in 609 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-08a-LTLFireability-00
Entered a terminal (fully accepting) state of product in 3932 steps with 205 reset in 125 ms.
FORMULA AutonomousCar-PT-08a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08a-LTLFireability-00 finished in 37810 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0)||F(!p1)) U X(X(p2))))'
Support contains 6 out of 77 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 77/77 places, 564/564 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 72 transition count 519
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 72 transition count 519
Applied a total of 10 rules in 11 ms. Remains 72 /77 variables (removed 5) and now considering 519/564 (removed 45) transitions.
// Phase 1: matrix 519 rows 72 cols
[2024-05-22 01:01:19] [INFO ] Computed 10 invariants in 8 ms
[2024-05-22 01:01:20] [INFO ] Implicit Places using invariants in 446 ms returned []
[2024-05-22 01:01:20] [INFO ] Invariant cache hit.
[2024-05-22 01:01:20] [INFO ] State equation strengthened by 211 read => feed constraints.
[2024-05-22 01:01:20] [INFO ] Implicit Places using invariants and state equation in 550 ms returned []
Implicit Place search using SMT with State Equation took 1007 ms to find 0 implicit places.
Running 518 sub problems to find dead transitions.
[2024-05-22 01:01:20] [INFO ] Invariant cache hit.
[2024-05-22 01:01:20] [INFO ] State equation strengthened by 211 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 1 (OVERLAPS) 1/72 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 3 (OVERLAPS) 518/590 variables, 72/82 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/590 variables, 210/292 constraints. Problems are: Problem set: 0 solved, 518 unsolved
[2024-05-22 01:01:40] [INFO ] Deduced a trap composed of 22 places in 457 ms of which 2 ms to minimize.
[2024-05-22 01:01:40] [INFO ] Deduced a trap composed of 14 places in 301 ms of which 1 ms to minimize.
[2024-05-22 01:01:41] [INFO ] Deduced a trap composed of 7 places in 366 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/590 variables, 3/295 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/590 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 518 unsolved
SMT process timed out in 35466ms, After SMT, problems are : Problem set: 0 solved, 518 unsolved
Search for dead transitions found 0 dead transitions in 35474ms
Starting structural reductions in LTL mode, iteration 1 : 72/77 places, 519/564 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36495 ms. Remains : 72/77 places, 519/564 transitions.
Stuttering acceptance computed with spot in 598 ms :[(NOT p2), (NOT p2), (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0)), (NOT p2), (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2)), (AND p1 (NOT p0) (NOT p2)), p1, (AND p1 (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-08a-LTLFireability-01
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-08a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08a-LTLFireability-01 finished in 37141 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||F(p1)))'
Support contains 13 out of 77 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 77/77 places, 564/564 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 70 transition count 501
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 70 transition count 501
Applied a total of 14 rules in 10 ms. Remains 70 /77 variables (removed 7) and now considering 501/564 (removed 63) transitions.
// Phase 1: matrix 501 rows 70 cols
[2024-05-22 01:01:56] [INFO ] Computed 10 invariants in 6 ms
[2024-05-22 01:01:57] [INFO ] Implicit Places using invariants in 183 ms returned []
[2024-05-22 01:01:57] [INFO ] Invariant cache hit.
[2024-05-22 01:01:57] [INFO ] State equation strengthened by 195 read => feed constraints.
[2024-05-22 01:01:57] [INFO ] Implicit Places using invariants and state equation in 471 ms returned []
Implicit Place search using SMT with State Equation took 659 ms to find 0 implicit places.
Running 500 sub problems to find dead transitions.
[2024-05-22 01:01:57] [INFO ] Invariant cache hit.
[2024-05-22 01:01:57] [INFO ] State equation strengthened by 195 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 3 (OVERLAPS) 500/570 variables, 70/80 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/570 variables, 194/274 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-22 01:02:15] [INFO ] Deduced a trap composed of 22 places in 368 ms of which 3 ms to minimize.
[2024-05-22 01:02:15] [INFO ] Deduced a trap composed of 14 places in 431 ms of which 2 ms to minimize.
[2024-05-22 01:02:16] [INFO ] Deduced a trap composed of 7 places in 376 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/570 variables, 3/277 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/570 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 7 (OVERLAPS) 1/571 variables, 1/278 constraints. Problems are: Problem set: 0 solved, 500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 571/571 variables, and 278 constraints, problems are : Problem set: 0 solved, 500 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 70/70 constraints, ReadFeed: 195/195 constraints, PredecessorRefiner: 500/500 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 500 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 4 (OVERLAPS) 500/570 variables, 70/83 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/570 variables, 194/277 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/570 variables, 500/777 constraints. Problems are: Problem set: 0 solved, 500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/571 variables, and 777 constraints, problems are : Problem set: 0 solved, 500 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 70/70 constraints, ReadFeed: 194/195 constraints, PredecessorRefiner: 500/500 constraints, Known Traps: 3/3 constraints]
After SMT, in 65462ms problems are : Problem set: 0 solved, 500 unsolved
Search for dead transitions found 0 dead transitions in 65474ms
Starting structural reductions in LTL mode, iteration 1 : 70/77 places, 501/564 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66151 ms. Remains : 70/77 places, 501/564 transitions.
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-08a-LTLFireability-02
Stuttering criterion allowed to conclude after 18 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-08a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08a-LTLFireability-02 finished in 66339 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' '!(p0)'
Support contains 4 out of 77 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 564/564 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 77 transition count 555
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 10 rules applied. Total rules applied 19 place count 68 transition count 554
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 67 transition count 554
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 20 place count 67 transition count 553
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 22 place count 66 transition count 553
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 29 place count 59 transition count 490
Iterating global reduction 3 with 7 rules applied. Total rules applied 36 place count 59 transition count 490
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 40 place count 57 transition count 488
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 42 place count 56 transition count 488
Applied a total of 42 rules in 143 ms. Remains 56 /77 variables (removed 21) and now considering 488/564 (removed 76) transitions.
// Phase 1: matrix 488 rows 56 cols
[2024-05-22 01:03:03] [INFO ] Computed 10 invariants in 7 ms
[2024-05-22 01:03:03] [INFO ] Implicit Places using invariants in 275 ms returned []
[2024-05-22 01:03:03] [INFO ] Invariant cache hit.
[2024-05-22 01:03:03] [INFO ] State equation strengthened by 197 read => feed constraints.
[2024-05-22 01:03:04] [INFO ] Implicit Places using invariants and state equation in 579 ms returned []
Implicit Place search using SMT with State Equation took 859 ms to find 0 implicit places.
[2024-05-22 01:03:04] [INFO ] Redundant transitions in 56 ms returned []
Running 487 sub problems to find dead transitions.
[2024-05-22 01:03:04] [INFO ] Invariant cache hit.
[2024-05-22 01:03:04] [INFO ] State equation strengthened by 197 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 3 (OVERLAPS) 487/543 variables, 56/66 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/543 variables, 196/262 constraints. Problems are: Problem set: 0 solved, 487 unsolved
[2024-05-22 01:03:22] [INFO ] Deduced a trap composed of 19 places in 258 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/543 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/543 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 7 (OVERLAPS) 1/544 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 487 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 544/544 variables, and 264 constraints, problems are : Problem set: 0 solved, 487 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 56/56 constraints, ReadFeed: 197/197 constraints, PredecessorRefiner: 487/487 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 487 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 4 (OVERLAPS) 487/543 variables, 56/67 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/543 variables, 196/263 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/543 variables, 487/750 constraints. Problems are: Problem set: 0 solved, 487 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 543/544 variables, and 750 constraints, problems are : Problem set: 0 solved, 487 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 56/56 constraints, ReadFeed: 196/197 constraints, PredecessorRefiner: 487/487 constraints, Known Traps: 1/1 constraints]
After SMT, in 65788ms problems are : Problem set: 0 solved, 487 unsolved
Search for dead transitions found 0 dead transitions in 65801ms
Starting structural reductions in SI_LTL mode, iteration 1 : 56/77 places, 488/564 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 66870 ms. Remains : 56/77 places, 488/564 transitions.
Initial state reduction rules removed 1 formulas.
Stuttering acceptance computed with spot in 51 ms :[true, (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-08a-LTLFireability-03
Entered a terminal (fully accepting) state of product in 0 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-08a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08a-LTLFireability-03 finished in 66941 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(G(p0))&&F(p1))))'
Support contains 11 out of 77 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 564/564 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 77 transition count 556
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 69 transition count 556
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 16 place count 69 transition count 554
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 67 transition count 554
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 27 place count 60 transition count 491
Iterating global reduction 2 with 7 rules applied. Total rules applied 34 place count 60 transition count 491
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 36 place count 59 transition count 490
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 38 place count 58 transition count 490
Applied a total of 38 rules in 73 ms. Remains 58 /77 variables (removed 19) and now considering 490/564 (removed 74) transitions.
// Phase 1: matrix 490 rows 58 cols
[2024-05-22 01:04:10] [INFO ] Computed 10 invariants in 5 ms
[2024-05-22 01:04:10] [INFO ] Implicit Places using invariants in 222 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 232 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 57/77 places, 490/564 transitions.
Applied a total of 0 rules in 35 ms. Remains 57 /57 variables (removed 0) and now considering 490/490 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 342 ms. Remains : 57/77 places, 490/564 transitions.
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-08a-LTLFireability-05
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-08a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08a-LTLFireability-05 finished in 488 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((X(p1)&&p0)))'
Support contains 6 out of 77 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 77/77 places, 564/564 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 71 transition count 510
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 71 transition count 510
Applied a total of 12 rules in 9 ms. Remains 71 /77 variables (removed 6) and now considering 510/564 (removed 54) transitions.
// Phase 1: matrix 510 rows 71 cols
[2024-05-22 01:04:10] [INFO ] Computed 10 invariants in 5 ms
[2024-05-22 01:04:10] [INFO ] Implicit Places using invariants in 197 ms returned []
[2024-05-22 01:04:10] [INFO ] Invariant cache hit.
[2024-05-22 01:04:11] [INFO ] State equation strengthened by 203 read => feed constraints.
[2024-05-22 01:04:11] [INFO ] Implicit Places using invariants and state equation in 450 ms returned []
Implicit Place search using SMT with State Equation took 656 ms to find 0 implicit places.
Running 509 sub problems to find dead transitions.
[2024-05-22 01:04:11] [INFO ] Invariant cache hit.
[2024-05-22 01:04:11] [INFO ] State equation strengthened by 203 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (OVERLAPS) 1/71 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 3 (OVERLAPS) 509/580 variables, 71/81 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/580 variables, 202/283 constraints. Problems are: Problem set: 0 solved, 509 unsolved
[2024-05-22 01:04:28] [INFO ] Deduced a trap composed of 22 places in 302 ms of which 2 ms to minimize.
[2024-05-22 01:04:28] [INFO ] Deduced a trap composed of 14 places in 422 ms of which 2 ms to minimize.
[2024-05-22 01:04:29] [INFO ] Deduced a trap composed of 7 places in 431 ms of which 2 ms to minimize.
[2024-05-22 01:04:35] [INFO ] Deduced a trap composed of 20 places in 402 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/580 variables, 4/287 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/580 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 509 unsolved
SMT process timed out in 35418ms, After SMT, problems are : Problem set: 0 solved, 509 unsolved
Search for dead transitions found 0 dead transitions in 35431ms
Starting structural reductions in LTL mode, iteration 1 : 71/77 places, 510/564 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36101 ms. Remains : 71/77 places, 510/564 transitions.
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-08a-LTLFireability-09
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-08a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08a-LTLFireability-09 finished in 36277 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||G(p1)||G(F(p2))))))'
Support contains 8 out of 77 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 77/77 places, 564/564 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 71 transition count 510
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 71 transition count 510
Applied a total of 12 rules in 9 ms. Remains 71 /77 variables (removed 6) and now considering 510/564 (removed 54) transitions.
// Phase 1: matrix 510 rows 71 cols
[2024-05-22 01:04:46] [INFO ] Computed 10 invariants in 12 ms
[2024-05-22 01:04:47] [INFO ] Implicit Places using invariants in 448 ms returned []
[2024-05-22 01:04:47] [INFO ] Invariant cache hit.
[2024-05-22 01:04:47] [INFO ] State equation strengthened by 203 read => feed constraints.
[2024-05-22 01:04:47] [INFO ] Implicit Places using invariants and state equation in 420 ms returned []
Implicit Place search using SMT with State Equation took 890 ms to find 0 implicit places.
Running 509 sub problems to find dead transitions.
[2024-05-22 01:04:47] [INFO ] Invariant cache hit.
[2024-05-22 01:04:47] [INFO ] State equation strengthened by 203 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (OVERLAPS) 1/71 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 3 (OVERLAPS) 509/580 variables, 71/81 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/580 variables, 202/283 constraints. Problems are: Problem set: 0 solved, 509 unsolved
[2024-05-22 01:05:04] [INFO ] Deduced a trap composed of 22 places in 441 ms of which 2 ms to minimize.
[2024-05-22 01:05:04] [INFO ] Deduced a trap composed of 14 places in 384 ms of which 5 ms to minimize.
[2024-05-22 01:05:05] [INFO ] Deduced a trap composed of 7 places in 377 ms of which 4 ms to minimize.
[2024-05-22 01:05:10] [INFO ] Deduced a trap composed of 20 places in 332 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/580 variables, 4/287 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/580 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 509 unsolved
SMT process timed out in 35283ms, After SMT, problems are : Problem set: 0 solved, 509 unsolved
Search for dead transitions found 0 dead transitions in 35289ms
Starting structural reductions in LTL mode, iteration 1 : 71/77 places, 510/564 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36191 ms. Remains : 71/77 places, 510/564 transitions.
Stuttering acceptance computed with spot in 291 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-08a-LTLFireability-10
Stuttering criterion allowed to conclude after 16 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-08a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08a-LTLFireability-10 finished in 36515 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Support contains 13 out of 77 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 564/564 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 7 rules applied. Total rules applied 7 place count 77 transition count 557
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 70 transition count 557
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 14 place count 70 transition count 555
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 68 transition count 555
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 25 place count 61 transition count 492
Iterating global reduction 2 with 7 rules applied. Total rules applied 32 place count 61 transition count 492
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 34 place count 60 transition count 492
Applied a total of 34 rules in 57 ms. Remains 60 /77 variables (removed 17) and now considering 492/564 (removed 72) transitions.
// Phase 1: matrix 492 rows 60 cols
[2024-05-22 01:05:23] [INFO ] Computed 10 invariants in 4 ms
[2024-05-22 01:05:23] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-05-22 01:05:23] [INFO ] Invariant cache hit.
[2024-05-22 01:05:23] [INFO ] State equation strengthened by 197 read => feed constraints.
[2024-05-22 01:05:24] [INFO ] Implicit Places using invariants and state equation in 445 ms returned []
Implicit Place search using SMT with State Equation took 598 ms to find 0 implicit places.
[2024-05-22 01:05:24] [INFO ] Redundant transitions in 42 ms returned []
Running 491 sub problems to find dead transitions.
[2024-05-22 01:05:24] [INFO ] Invariant cache hit.
[2024-05-22 01:05:24] [INFO ] State equation strengthened by 197 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 3 (OVERLAPS) 491/551 variables, 60/70 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/551 variables, 196/266 constraints. Problems are: Problem set: 0 solved, 491 unsolved
[2024-05-22 01:05:45] [INFO ] Deduced a trap composed of 21 places in 430 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 7 (OVERLAPS) 1/552 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 491 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 552/552 variables, and 268 constraints, problems are : Problem set: 0 solved, 491 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 60/60 constraints, ReadFeed: 197/197 constraints, PredecessorRefiner: 491/491 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 491 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 4 (OVERLAPS) 491/551 variables, 60/71 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 196/267 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 491/758 constraints. Problems are: Problem set: 0 solved, 491 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 551/552 variables, and 758 constraints, problems are : Problem set: 0 solved, 491 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 60/60 constraints, ReadFeed: 196/197 constraints, PredecessorRefiner: 491/491 constraints, Known Traps: 1/1 constraints]
After SMT, in 64669ms problems are : Problem set: 0 solved, 491 unsolved
Search for dead transitions found 0 dead transitions in 64680ms
Starting structural reductions in SI_LTL mode, iteration 1 : 60/77 places, 492/564 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 65387 ms. Remains : 60/77 places, 492/564 transitions.
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-08a-LTLFireability-11
Product exploration explored 100000 steps with 400 reset in 250 ms.
Product exploration explored 100000 steps with 37 reset in 138 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 (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 142 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (2437 resets) in 656 ms. (60 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (143 resets) in 209 ms. (190 steps per ms) remains 1/1 properties
[2024-05-22 01:06:29] [INFO ] Invariant cache hit.
[2024-05-22 01:06:29] [INFO ] State equation strengthened by 197 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 42/55 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 489/544 variables, 55/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/544 variables, 196/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/544 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 7/551 variables, 5/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/551 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/552 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/552 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/552 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 552/552 variables, and 267 constraints, problems are : Problem set: 0 solved, 1 unsolved in 227 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 60/60 constraints, ReadFeed: 197/197 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Int declared 55/552 variables, and 10 constraints, problems are : Problem set: 1 solved, 0 unsolved in 34 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/60 constraints, ReadFeed: 0/197 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 288ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR (NOT p0) p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 14 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-08a-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-08a-LTLFireability-11 finished in 66747 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(!(!X(G(p0)) U G(((p1 U p0)&&G(p1)))))))'
Support contains 13 out of 77 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 564/564 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 77 transition count 556
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 69 transition count 556
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 16 place count 69 transition count 554
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 67 transition count 554
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 26 place count 61 transition count 500
Iterating global reduction 2 with 6 rules applied. Total rules applied 32 place count 61 transition count 500
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 34 place count 60 transition count 499
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 36 place count 59 transition count 499
Applied a total of 36 rules in 66 ms. Remains 59 /77 variables (removed 18) and now considering 499/564 (removed 65) transitions.
// Phase 1: matrix 499 rows 59 cols
[2024-05-22 01:06:30] [INFO ] Computed 10 invariants in 2 ms
[2024-05-22 01:06:30] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-22 01:06:30] [INFO ] Invariant cache hit.
[2024-05-22 01:06:30] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-05-22 01:06:30] [INFO ] Implicit Places using invariants and state equation in 361 ms returned []
Implicit Place search using SMT with State Equation took 499 ms to find 0 implicit places.
[2024-05-22 01:06:30] [INFO ] Redundant transitions in 25 ms returned []
Running 498 sub problems to find dead transitions.
[2024-05-22 01:06:30] [INFO ] Invariant cache hit.
[2024-05-22 01:06:30] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 3 (OVERLAPS) 498/557 variables, 59/69 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/557 variables, 204/273 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-05-22 01:06:52] [INFO ] Deduced a trap composed of 19 places in 392 ms of which 1 ms to minimize.
[2024-05-22 01:06:52] [INFO ] Deduced a trap composed of 13 places in 361 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/557 variables, 2/275 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/557 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 7 (OVERLAPS) 1/558 variables, 1/276 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 558/558 variables, and 276 constraints, problems are : Problem set: 0 solved, 498 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 59/59 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 498 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 4 (OVERLAPS) 498/557 variables, 59/71 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/557 variables, 204/275 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/557 variables, 498/773 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 557/558 variables, and 773 constraints, problems are : Problem set: 0 solved, 498 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 59/59 constraints, ReadFeed: 204/205 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 2/2 constraints]
After SMT, in 63964ms problems are : Problem set: 0 solved, 498 unsolved
Search for dead transitions found 0 dead transitions in 63975ms
Starting structural reductions in SI_LTL mode, iteration 1 : 59/77 places, 499/564 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64573 ms. Remains : 59/77 places, 499/564 transitions.
Stuttering acceptance computed with spot in 101 ms :[(AND p1 p0), (AND p1 p0)]
Running random walk in product with property : AutonomousCar-PT-08a-LTLFireability-13
Product exploration explored 100000 steps with 51 reset in 73 ms.
Product exploration explored 100000 steps with 283 reset in 328 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 (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 161 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND p0 p1), (AND p0 p1)]
RANDOM walk for 40000 steps (2539 resets) in 521 ms. (76 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (149 resets) in 356 ms. (112 steps per ms) remains 1/2 properties
[2024-05-22 01:07:35] [INFO ] Invariant cache hit.
[2024-05-22 01:07:35] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 54/558 variables, and 10 constraints, problems are : Problem set: 1 solved, 0 unsolved in 30 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/59 constraints, ReadFeed: 0/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 55ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (OR p0 (NOT p1))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 14 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-08a-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-08a-LTLFireability-13 finished in 65747 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((G(p1)||p0))))'
Support contains 6 out of 77 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 564/564 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 77 transition count 554
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 67 transition count 554
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 20 place count 67 transition count 553
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 22 place count 66 transition count 553
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 27 place count 61 transition count 508
Iterating global reduction 2 with 5 rules applied. Total rules applied 32 place count 61 transition count 508
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
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 36 place count 59 transition count 506
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 38 place count 58 transition count 506
Applied a total of 38 rules in 67 ms. Remains 58 /77 variables (removed 19) and now considering 506/564 (removed 58) transitions.
// Phase 1: matrix 506 rows 58 cols
[2024-05-22 01:07:36] [INFO ] Computed 10 invariants in 3 ms
[2024-05-22 01:07:36] [INFO ] Implicit Places using invariants in 193 ms returned []
[2024-05-22 01:07:36] [INFO ] Invariant cache hit.
[2024-05-22 01:07:36] [INFO ] State equation strengthened by 213 read => feed constraints.
[2024-05-22 01:07:36] [INFO ] Implicit Places using invariants and state equation in 437 ms returned []
Implicit Place search using SMT with State Equation took 637 ms to find 0 implicit places.
[2024-05-22 01:07:36] [INFO ] Redundant transitions in 20 ms returned []
Running 505 sub problems to find dead transitions.
[2024-05-22 01:07:36] [INFO ] Invariant cache hit.
[2024-05-22 01:07:36] [INFO ] State equation strengthened by 213 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 3 (OVERLAPS) 505/563 variables, 58/68 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/563 variables, 212/280 constraints. Problems are: Problem set: 0 solved, 505 unsolved
[2024-05-22 01:07:56] [INFO ] Deduced a trap composed of 19 places in 386 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/563 variables, 1/281 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 7 (OVERLAPS) 1/564 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 505 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 564/564 variables, and 282 constraints, problems are : Problem set: 0 solved, 505 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 58/58 constraints, ReadFeed: 213/213 constraints, PredecessorRefiner: 505/505 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 505 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 4 (OVERLAPS) 505/563 variables, 58/69 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/563 variables, 212/281 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 505/786 constraints. Problems are: Problem set: 0 solved, 505 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 563/564 variables, and 786 constraints, problems are : Problem set: 0 solved, 505 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 58/58 constraints, ReadFeed: 212/213 constraints, PredecessorRefiner: 505/505 constraints, Known Traps: 1/1 constraints]
After SMT, in 64690ms problems are : Problem set: 0 solved, 505 unsolved
Search for dead transitions found 0 dead transitions in 64698ms
Starting structural reductions in SI_LTL mode, iteration 1 : 58/77 places, 506/564 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 65430 ms. Remains : 58/77 places, 506/564 transitions.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-08a-LTLFireability-14
Product exploration explored 100000 steps with 1337 reset in 224 ms.
Product exploration explored 100000 steps with 184 reset in 100 ms.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 154 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (2696 resets) in 1025 ms. (38 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (155 resets) in 96 ms. (412 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (156 resets) in 670 ms. (59 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (148 resets) in 139 ms. (285 steps per ms) remains 3/3 properties
[2024-05-22 01:08:42] [INFO ] Invariant cache hit.
[2024-05-22 01:08:42] [INFO ] State equation strengthened by 213 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 18/24 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 30/54 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 503/557 variables, 54/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/557 variables, 212/276 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/557 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 6/563 variables, 4/280 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/563 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/564 variables, 1/281 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/564 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/564 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 564/564 variables, and 281 constraints, problems are : Problem set: 0 solved, 3 unsolved in 393 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 58/58 constraints, ReadFeed: 213/213 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf0 is UNSAT
At refinement iteration 1 (OVERLAPS) 18/24 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 30/54 variables, 6/10 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 503/557 variables, 54/64 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/557 variables, 212/276 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/557 variables, 0/276 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 6/563 variables, 4/280 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/563 variables, 2/282 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/563 variables, 0/282 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/564 variables, 1/283 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/564 variables, 0/283 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/564 variables, 0/283 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 564/564 variables, and 283 constraints, problems are : Problem set: 1 solved, 2 unsolved in 1196 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 58/58 constraints, ReadFeed: 213/213 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1659ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 522 ms.
Support contains 6 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 506/506 transitions.
Graph (complete) has 772 edges and 58 vertex of which 57 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 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 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 57 transition count 503
Free-agglomeration rule applied 9 times.
Iterating global reduction 1 with 9 rules applied. Total rules applied 12 place count 57 transition count 494
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 1 with 73 rules applied. Total rules applied 85 place count 48 transition count 430
Applied a total of 85 rules in 48 ms. Remains 48 /58 variables (removed 10) and now considering 430/506 (removed 76) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 48/58 places, 430/506 transitions.
RANDOM walk for 34126 steps (206 resets) in 1078 ms. (31 steps per ms) remains 0/2 properties
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 21 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-08a-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-08a-LTLFireability-14 finished in 69503 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)&&X((F(p1) U p2)))))'
Support contains 11 out of 77 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 77/77 places, 564/564 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 71 transition count 510
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 71 transition count 510
Applied a total of 12 rules in 6 ms. Remains 71 /77 variables (removed 6) and now considering 510/564 (removed 54) transitions.
// Phase 1: matrix 510 rows 71 cols
[2024-05-22 01:08:45] [INFO ] Computed 10 invariants in 6 ms
[2024-05-22 01:08:45] [INFO ] Implicit Places using invariants in 426 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 430 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 70/77 places, 510/564 transitions.
Applied a total of 0 rules in 2 ms. Remains 70 /70 variables (removed 0) and now considering 510/510 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 439 ms. Remains : 70/77 places, 510/564 transitions.
Stuttering acceptance computed with spot in 264 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, (NOT p0), (NOT p2), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-08a-LTLFireability-15
Entered a terminal (fully accepting) state of product in 48 steps with 1 reset in 1 ms.
FORMULA AutonomousCar-PT-08a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08a-LTLFireability-15 finished in 731 ms.
All properties solved by simple procedures.
Total runtime 497827 ms.

BK_STOP 1716340126321

--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ 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-08a"
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-08a, 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-171620167500332"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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