Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 8.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 22 14:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 17:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 131K Apr 12 17:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 17:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 112K Apr 12 17:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 42K 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-03a-LTLFireability-00
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-01
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-02
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-03
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-04
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-05
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-06
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-07
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-08
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-09
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-10
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-11
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-12
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-13
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-14
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716343958359

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-03a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 02:12:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 02:12:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 02:12:40] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2024-05-22 02:12:40] [INFO ] Transformed 41 places.
[2024-05-22 02:12:40] [INFO ] Transformed 121 transitions.
[2024-05-22 02:12:40] [INFO ] Found NUPN structural information;
[2024-05-22 02:12:40] [INFO ] Parsed PT model containing 41 places and 121 transitions and 745 arcs in 254 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 45 transitions
Reduce redundant transitions removed 45 transitions.
FORMULA AutonomousCar-PT-03a-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-03a-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-03a-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 76/76 transitions.
Applied a total of 0 rules in 15 ms. Remains 41 /41 variables (removed 0) and now considering 76/76 (removed 0) transitions.
[2024-05-22 02:12:40] [INFO ] Flow matrix only has 75 transitions (discarded 1 similar events)
// Phase 1: matrix 75 rows 41 cols
[2024-05-22 02:12:40] [INFO ] Computed 8 invariants in 13 ms
[2024-05-22 02:12:41] [INFO ] Implicit Places using invariants in 290 ms returned []
[2024-05-22 02:12:41] [INFO ] Flow matrix only has 75 transitions (discarded 1 similar events)
[2024-05-22 02:12:41] [INFO ] Invariant cache hit.
[2024-05-22 02:12:41] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-22 02:12:41] [INFO ] Implicit Places using invariants and state equation in 138 ms returned [36, 39]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 477 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 39/41 places, 76/76 transitions.
Applied a total of 0 rules in 3 ms. Remains 39 /39 variables (removed 0) and now considering 76/76 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 522 ms. Remains : 39/41 places, 76/76 transitions.
Support contains 27 out of 39 places after structural reductions.
[2024-05-22 02:12:41] [INFO ] Flatten gal took : 51 ms
[2024-05-22 02:12:41] [INFO ] Flatten gal took : 21 ms
[2024-05-22 02:12:41] [INFO ] Input system was already deterministic with 76 transitions.
Reduction of identical properties reduced properties to check from 24 to 23
RANDOM walk for 12025 steps (679 resets) in 608 ms. (19 steps per ms) remains 0/23 properties
Computed a total of 3 stabilizing places and 2 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&(X(!(p0 U p1))||G(X(!p1)))))'
Support contains 5 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 76/76 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 36 transition count 67
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 36 transition count 67
Applied a total of 6 rules in 12 ms. Remains 36 /39 variables (removed 3) and now considering 67/76 (removed 9) transitions.
// Phase 1: matrix 67 rows 36 cols
[2024-05-22 02:12:42] [INFO ] Computed 5 invariants in 2 ms
[2024-05-22 02:12:42] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-22 02:12:42] [INFO ] Invariant cache hit.
[2024-05-22 02:12:42] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-22 02:12:42] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
Running 66 sub problems to find dead transitions.
[2024-05-22 02:12:42] [INFO ] Invariant cache hit.
[2024-05-22 02:12:42] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 1/36 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (OVERLAPS) 66/102 variables, 36/41 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 32/73 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2024-05-22 02:12:43] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 14 ms to minimize.
[2024-05-22 02:12:43] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 2 ms to minimize.
[2024-05-22 02:12:43] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 3/76 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (OVERLAPS) 1/103 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/103 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 9 (OVERLAPS) 0/103 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 103/103 variables, and 77 constraints, problems are : Problem set: 0 solved, 66 unsolved in 2298 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 36/36 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 1/36 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 66/102 variables, 36/44 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 32/76 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 66/142 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (OVERLAPS) 1/103 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/103 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 10 (OVERLAPS) 0/103 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 103/103 variables, and 143 constraints, problems are : Problem set: 0 solved, 66 unsolved in 2036 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 36/36 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 3/3 constraints]
After SMT, in 4492ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 4510ms
Starting structural reductions in LTL mode, iteration 1 : 36/39 places, 67/76 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4703 ms. Remains : 36/39 places, 67/76 transitions.
Stuttering acceptance computed with spot in 354 ms :[true, (OR (NOT p0) p1), (OR (NOT p0) p1), p1]
Running random walk in product with property : AutonomousCar-PT-03a-LTLFireability-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-03a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03a-LTLFireability-00 finished in 5149 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 U X(p1)))'
Support contains 5 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 76/76 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 36 transition count 67
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 36 transition count 67
Applied a total of 6 rules in 3 ms. Remains 36 /39 variables (removed 3) and now considering 67/76 (removed 9) transitions.
// Phase 1: matrix 67 rows 36 cols
[2024-05-22 02:12:47] [INFO ] Computed 5 invariants in 1 ms
[2024-05-22 02:12:47] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-22 02:12:47] [INFO ] Invariant cache hit.
[2024-05-22 02:12:47] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-22 02:12:47] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
Running 66 sub problems to find dead transitions.
[2024-05-22 02:12:47] [INFO ] Invariant cache hit.
[2024-05-22 02:12:47] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 1/36 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (OVERLAPS) 66/102 variables, 36/41 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 32/73 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2024-05-22 02:12:48] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 2 ms to minimize.
[2024-05-22 02:12:48] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-05-22 02:12:48] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2024-05-22 02:12:48] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 4/77 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (OVERLAPS) 1/103 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/103 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 9 (OVERLAPS) 0/103 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 103/103 variables, and 78 constraints, problems are : Problem set: 0 solved, 66 unsolved in 1948 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 36/36 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 1/36 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 66/102 variables, 36/45 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 32/77 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 66/143 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (OVERLAPS) 1/103 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/103 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 10 (OVERLAPS) 0/103 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 103/103 variables, and 144 constraints, problems are : Problem set: 0 solved, 66 unsolved in 2199 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 36/36 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 4/4 constraints]
After SMT, in 4242ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 4244ms
Starting structural reductions in LTL mode, iteration 1 : 36/39 places, 67/76 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4384 ms. Remains : 36/39 places, 67/76 transitions.
Stuttering acceptance computed with spot in 130 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-03a-LTLFireability-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-03a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03a-LTLFireability-03 finished in 4530 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)||(p1 U p2))))'
Support contains 5 out of 39 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 76/76 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 39 transition count 71
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 34 transition count 71
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 10 place count 34 transition count 70
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 12 place count 33 transition count 70
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 14 place count 31 transition count 62
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 31 transition count 62
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 2 with 4 rules applied. Total rules applied 20 place count 29 transition count 60
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 22 place count 28 transition count 60
Applied a total of 22 rules in 42 ms. Remains 28 /39 variables (removed 11) and now considering 60/76 (removed 16) transitions.
[2024-05-22 02:12:51] [INFO ] Flow matrix only has 59 transitions (discarded 1 similar events)
// Phase 1: matrix 59 rows 28 cols
[2024-05-22 02:12:51] [INFO ] Computed 6 invariants in 1 ms
[2024-05-22 02:12:52] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-22 02:12:52] [INFO ] Flow matrix only has 59 transitions (discarded 1 similar events)
[2024-05-22 02:12:52] [INFO ] Invariant cache hit.
[2024-05-22 02:12:52] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-22 02:12:52] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2024-05-22 02:12:52] [INFO ] Redundant transitions in 1 ms returned []
Running 59 sub problems to find dead transitions.
[2024-05-22 02:12:52] [INFO ] Flow matrix only has 59 transitions (discarded 1 similar events)
[2024-05-22 02:12:52] [INFO ] Invariant cache hit.
[2024-05-22 02:12:52] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 1/28 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-22 02:12:52] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 3 ms to minimize.
[2024-05-22 02:12:52] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (OVERLAPS) 58/86 variables, 28/36 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 34/70 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (OVERLAPS) 1/87 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/87 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (OVERLAPS) 0/87 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 87/87 variables, and 71 constraints, problems are : Problem set: 0 solved, 59 unsolved in 1462 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 28/28 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 1/28 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (OVERLAPS) 58/86 variables, 28/36 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 34/70 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 59/129 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (OVERLAPS) 1/87 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/87 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (OVERLAPS) 0/87 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 87/87 variables, and 130 constraints, problems are : Problem set: 0 solved, 59 unsolved in 1775 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 28/28 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 2/2 constraints]
After SMT, in 3312ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 3314ms
Starting structural reductions in SI_LTL mode, iteration 1 : 28/39 places, 60/76 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3477 ms. Remains : 28/39 places, 60/76 transitions.
Stuttering acceptance computed with spot in 43 ms :[(AND (NOT p0) (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-03a-LTLFireability-04
Product exploration explored 100000 steps with 18 reset in 252 ms.
Product exploration explored 100000 steps with 12 reset in 180 ms.
Computed a total of 6 stabilizing places and 6 stable transitions
Computed a total of 6 stabilizing places and 6 stable transitions
Detected a total of 6/28 stabilizing places and 6/60 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X p0), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X p0)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 168 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p2))]
RANDOM walk for 637 steps (37 resets) in 17 ms. (35 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X p0), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X p0)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p0)), (F p2), (F (NOT (AND p0 (NOT p2)))), (F (NOT (OR p0 p2)))]
Knowledge based reduction with 10 factoid took 403 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p2))]
Support contains 5 out of 28 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 28/28 places, 60/60 transitions.
Applied a total of 0 rules in 9 ms. Remains 28 /28 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2024-05-22 02:12:56] [INFO ] Flow matrix only has 59 transitions (discarded 1 similar events)
[2024-05-22 02:12:56] [INFO ] Invariant cache hit.
[2024-05-22 02:12:56] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-22 02:12:56] [INFO ] Flow matrix only has 59 transitions (discarded 1 similar events)
[2024-05-22 02:12:56] [INFO ] Invariant cache hit.
[2024-05-22 02:12:56] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-22 02:12:56] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
[2024-05-22 02:12:56] [INFO ] Redundant transitions in 1 ms returned []
Running 59 sub problems to find dead transitions.
[2024-05-22 02:12:56] [INFO ] Flow matrix only has 59 transitions (discarded 1 similar events)
[2024-05-22 02:12:56] [INFO ] Invariant cache hit.
[2024-05-22 02:12:56] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 1/28 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-22 02:12:57] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-22 02:12:57] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (OVERLAPS) 58/86 variables, 28/36 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 34/70 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (OVERLAPS) 1/87 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/87 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (OVERLAPS) 0/87 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 87/87 variables, and 71 constraints, problems are : Problem set: 0 solved, 59 unsolved in 1425 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 28/28 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 1/28 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (OVERLAPS) 58/86 variables, 28/36 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 34/70 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 59/129 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (OVERLAPS) 1/87 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/87 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (OVERLAPS) 0/87 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 87/87 variables, and 130 constraints, problems are : Problem set: 0 solved, 59 unsolved in 1741 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 28/28 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 2/2 constraints]
After SMT, in 3235ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 3236ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3363 ms. Remains : 28/28 places, 60/60 transitions.
Computed a total of 6 stabilizing places and 6 stable transitions
Computed a total of 6 stabilizing places and 6 stable transitions
Detected a total of 6/28 stabilizing places and 6/60 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X p0), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X p0)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 156 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p2))]
RANDOM walk for 969 steps (68 resets) in 14 ms. (64 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X p0), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X p0)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p0)), (F p2), (F (NOT (AND p0 (NOT p2)))), (F (NOT (OR p0 p2)))]
Knowledge based reduction with 10 factoid took 335 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 117 ms.
Product exploration explored 100000 steps with 20 reset in 131 ms.
Support contains 5 out of 28 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 28/28 places, 60/60 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 27 transition count 56
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 27 transition count 56
Applied a total of 2 rules in 7 ms. Remains 27 /28 variables (removed 1) and now considering 56/60 (removed 4) transitions.
[2024-05-22 02:13:00] [INFO ] Flow matrix only has 55 transitions (discarded 1 similar events)
// Phase 1: matrix 55 rows 27 cols
[2024-05-22 02:13:00] [INFO ] Computed 6 invariants in 1 ms
[2024-05-22 02:13:00] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-22 02:13:00] [INFO ] Flow matrix only has 55 transitions (discarded 1 similar events)
[2024-05-22 02:13:00] [INFO ] Invariant cache hit.
[2024-05-22 02:13:01] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-22 02:13:01] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
[2024-05-22 02:13:01] [INFO ] Redundant transitions in 1 ms returned []
Running 55 sub problems to find dead transitions.
[2024-05-22 02:13:01] [INFO ] Flow matrix only has 55 transitions (discarded 1 similar events)
[2024-05-22 02:13:01] [INFO ] Invariant cache hit.
[2024-05-22 02:13:01] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (OVERLAPS) 1/27 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-05-22 02:13:01] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-22 02:13:01] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (OVERLAPS) 54/81 variables, 27/35 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 31/66 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (OVERLAPS) 1/82 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/82 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 9 (OVERLAPS) 0/82 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Real declared 82/82 variables, and 67 constraints, problems are : Problem set: 0 solved, 55 unsolved in 1283 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 27/27 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 55 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (OVERLAPS) 1/27 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (OVERLAPS) 54/81 variables, 27/35 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 31/66 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 55/121 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 8 (OVERLAPS) 1/82 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/82 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 10 (OVERLAPS) 0/82 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Int declared 82/82 variables, and 122 constraints, problems are : Problem set: 0 solved, 55 unsolved in 1621 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 27/27 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 2/2 constraints]
After SMT, in 2945ms problems are : Problem set: 0 solved, 55 unsolved
Search for dead transitions found 0 dead transitions in 2946ms
Starting structural reductions in SI_LTL mode, iteration 1 : 27/28 places, 56/60 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3076 ms. Remains : 27/28 places, 56/60 transitions.
Treatment of property AutonomousCar-PT-03a-LTLFireability-04 finished in 12129 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((p0&&X(p1))) U (p2||X(F(p3))||G(!p0))))'
Support contains 8 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 76/76 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 36 transition count 67
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 36 transition count 67
Applied a total of 6 rules in 1 ms. Remains 36 /39 variables (removed 3) and now considering 67/76 (removed 9) transitions.
// Phase 1: matrix 67 rows 36 cols
[2024-05-22 02:13:04] [INFO ] Computed 5 invariants in 2 ms
[2024-05-22 02:13:04] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-22 02:13:04] [INFO ] Invariant cache hit.
[2024-05-22 02:13:04] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-22 02:13:04] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
Running 66 sub problems to find dead transitions.
[2024-05-22 02:13:04] [INFO ] Invariant cache hit.
[2024-05-22 02:13:04] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 1/36 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (OVERLAPS) 66/102 variables, 36/41 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 32/73 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2024-05-22 02:13:04] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-22 02:13:04] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-22 02:13:04] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2024-05-22 02:13:05] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 4/77 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (OVERLAPS) 1/103 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/103 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 9 (OVERLAPS) 0/103 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 103/103 variables, and 78 constraints, problems are : Problem set: 0 solved, 66 unsolved in 2007 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 36/36 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 1/36 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 66/102 variables, 36/45 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 32/77 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 66/143 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (OVERLAPS) 1/103 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/103 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 10 (OVERLAPS) 0/103 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 103/103 variables, and 144 constraints, problems are : Problem set: 0 solved, 66 unsolved in 2182 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 36/36 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 4/4 constraints]
After SMT, in 4229ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 4230ms
Starting structural reductions in LTL mode, iteration 1 : 36/39 places, 67/76 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4346 ms. Remains : 36/39 places, 67/76 transitions.
Stuttering acceptance computed with spot in 218 ms :[(AND p0 (NOT p2) (NOT p3)), (AND p0 (NOT p3) (NOT p1)), (AND p0 (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3)))]
Running random walk in product with property : AutonomousCar-PT-03a-LTLFireability-05
Product exploration explored 100000 steps with 33333 reset in 318 ms.
Product exploration explored 100000 steps with 33333 reset in 271 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Detected a total of 3/36 stabilizing places and 2/67 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p3) (NOT p1)), (X (NOT p2)), (X (NOT p3)), (X (AND (NOT p2) p0 (NOT p3))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p1)))), (X (AND p0 (NOT p3))), (X (AND p0 (NOT p3) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p3)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) p0 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1))))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND p0 (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p3))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 22 factoid took 158 ms. Reduced automaton from 5 states, 13 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-03a-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-03a-LTLFireability-05 finished in 5344 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 4 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 76/76 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 35 transition count 63
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 35 transition count 63
Applied a total of 8 rules in 2 ms. Remains 35 /39 variables (removed 4) and now considering 63/76 (removed 13) transitions.
// Phase 1: matrix 63 rows 35 cols
[2024-05-22 02:13:09] [INFO ] Computed 5 invariants in 3 ms
[2024-05-22 02:13:09] [INFO ] Implicit Places using invariants in 70 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 71 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 34/39 places, 63/76 transitions.
Applied a total of 0 rules in 1 ms. Remains 34 /34 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 74 ms. Remains : 34/39 places, 63/76 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-03a-LTLFireability-06
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-03a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03a-LTLFireability-06 finished in 159 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||X(X(F(p1)))))||p0)))'
Support contains 8 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 76/76 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 36 transition count 67
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 36 transition count 67
Applied a total of 6 rules in 3 ms. Remains 36 /39 variables (removed 3) and now considering 67/76 (removed 9) transitions.
// Phase 1: matrix 67 rows 36 cols
[2024-05-22 02:13:09] [INFO ] Computed 5 invariants in 1 ms
[2024-05-22 02:13:09] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-22 02:13:09] [INFO ] Invariant cache hit.
[2024-05-22 02:13:09] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-22 02:13:09] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
Running 66 sub problems to find dead transitions.
[2024-05-22 02:13:09] [INFO ] Invariant cache hit.
[2024-05-22 02:13:09] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 1/36 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (OVERLAPS) 66/102 variables, 36/41 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 32/73 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2024-05-22 02:13:10] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-22 02:13:10] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-22 02:13:10] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 3/76 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (OVERLAPS) 1/103 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/103 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 9 (OVERLAPS) 0/103 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 103/103 variables, and 77 constraints, problems are : Problem set: 0 solved, 66 unsolved in 1935 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 36/36 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 1/36 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 66/102 variables, 36/44 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 32/76 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 66/142 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (OVERLAPS) 1/103 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/103 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 10 (OVERLAPS) 0/103 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 103/103 variables, and 143 constraints, problems are : Problem set: 0 solved, 66 unsolved in 1851 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 36/36 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 3/3 constraints]
After SMT, in 3829ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 3830ms
Starting structural reductions in LTL mode, iteration 1 : 36/39 places, 67/76 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3949 ms. Remains : 36/39 places, 67/76 transitions.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-03a-LTLFireability-07
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-03a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03a-LTLFireability-07 finished in 4042 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(p0)||G(p1)))'
Support contains 5 out of 39 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 76/76 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 39 transition count 72
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 35 transition count 72
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 8 place count 35 transition count 71
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 10 place count 34 transition count 71
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 13 place count 31 transition count 62
Iterating global reduction 2 with 3 rules applied. Total rules applied 16 place count 31 transition count 62
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 2 with 4 rules applied. Total rules applied 20 place count 29 transition count 60
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 22 place count 28 transition count 60
Applied a total of 22 rules in 17 ms. Remains 28 /39 variables (removed 11) and now considering 60/76 (removed 16) transitions.
// Phase 1: matrix 60 rows 28 cols
[2024-05-22 02:13:13] [INFO ] Computed 5 invariants in 1 ms
[2024-05-22 02:13:13] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-22 02:13:13] [INFO ] Invariant cache hit.
[2024-05-22 02:13:13] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-22 02:13:13] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
[2024-05-22 02:13:13] [INFO ] Redundant transitions in 19 ms returned []
Running 59 sub problems to find dead transitions.
[2024-05-22 02:13:13] [INFO ] Invariant cache hit.
[2024-05-22 02:13:13] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 1/28 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (OVERLAPS) 59/87 variables, 28/33 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 34/67 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-22 02:13:14] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (OVERLAPS) 1/88 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/88 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (OVERLAPS) 0/88 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 88/88 variables, and 69 constraints, problems are : Problem set: 0 solved, 59 unsolved in 1649 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 28/28 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 1/28 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (OVERLAPS) 59/87 variables, 28/34 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 34/68 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 59/127 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/87 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (OVERLAPS) 1/88 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/88 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (OVERLAPS) 0/88 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 88/88 variables, and 128 constraints, problems are : Problem set: 0 solved, 59 unsolved in 1837 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 28/28 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 1/1 constraints]
After SMT, in 3540ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 3541ms
Starting structural reductions in SI_LTL mode, iteration 1 : 28/39 places, 60/76 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3704 ms. Remains : 28/39 places, 60/76 transitions.
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-03a-LTLFireability-08
Product exploration explored 100000 steps with 0 reset in 100 ms.
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-03a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03a-LTLFireability-08 finished in 3956 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((G(F(p0)) U p1))))'
Support contains 6 out of 39 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 76/76 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 39 transition count 71
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 34 transition count 71
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 10 place count 34 transition count 70
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 12 place count 33 transition count 70
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 14 place count 31 transition count 65
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 31 transition count 65
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 18 place count 30 transition count 64
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 20 place count 29 transition count 64
Applied a total of 20 rules in 16 ms. Remains 29 /39 variables (removed 10) and now considering 64/76 (removed 12) transitions.
// Phase 1: matrix 64 rows 29 cols
[2024-05-22 02:13:17] [INFO ] Computed 5 invariants in 1 ms
[2024-05-22 02:13:17] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-22 02:13:17] [INFO ] Invariant cache hit.
[2024-05-22 02:13:17] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-22 02:13:17] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2024-05-22 02:13:17] [INFO ] Redundant transitions in 13 ms returned []
Running 63 sub problems to find dead transitions.
[2024-05-22 02:13:17] [INFO ] Invariant cache hit.
[2024-05-22 02:13:17] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/29 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (OVERLAPS) 63/92 variables, 29/34 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 37/71 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (OVERLAPS) 1/93 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (OVERLAPS) 0/93 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 93/93 variables, and 72 constraints, problems are : Problem set: 0 solved, 63 unsolved in 1418 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 29/29 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 63 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/29 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (OVERLAPS) 63/92 variables, 29/34 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 37/71 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 63/134 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (OVERLAPS) 1/93 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/93 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 9 (OVERLAPS) 0/93 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 93/93 variables, and 135 constraints, problems are : Problem set: 0 solved, 63 unsolved in 2044 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 29/29 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints]
After SMT, in 3511ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 3512ms
Starting structural reductions in SI_LTL mode, iteration 1 : 29/39 places, 64/76 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3660 ms. Remains : 29/39 places, 64/76 transitions.
Stuttering acceptance computed with spot in 155 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-03a-LTLFireability-09
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-03a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03a-LTLFireability-09 finished in 3831 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 7 out of 39 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 76/76 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 39 transition count 72
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 35 transition count 71
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 34 transition count 71
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 10 place count 34 transition count 70
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 12 place count 33 transition count 70
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 14 place count 31 transition count 65
Iterating global reduction 3 with 2 rules applied. Total rules applied 16 place count 31 transition count 65
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 18 place count 30 transition count 64
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 20 place count 29 transition count 64
Applied a total of 20 rules in 12 ms. Remains 29 /39 variables (removed 10) and now considering 64/76 (removed 12) transitions.
// Phase 1: matrix 64 rows 29 cols
[2024-05-22 02:13:21] [INFO ] Computed 5 invariants in 0 ms
[2024-05-22 02:13:21] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-22 02:13:21] [INFO ] Invariant cache hit.
[2024-05-22 02:13:21] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-22 02:13:21] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2024-05-22 02:13:21] [INFO ] Redundant transitions in 15 ms returned []
Running 63 sub problems to find dead transitions.
[2024-05-22 02:13:21] [INFO ] Invariant cache hit.
[2024-05-22 02:13:21] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/29 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (OVERLAPS) 63/92 variables, 29/34 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 37/71 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (OVERLAPS) 1/93 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (OVERLAPS) 0/93 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 93/93 variables, and 72 constraints, problems are : Problem set: 0 solved, 63 unsolved in 1410 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 29/29 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 63 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/29 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (OVERLAPS) 63/92 variables, 29/34 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 37/71 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 63/134 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (OVERLAPS) 1/93 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/93 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 9 (OVERLAPS) 0/93 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 93/93 variables, and 135 constraints, problems are : Problem set: 0 solved, 63 unsolved in 2116 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 29/29 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints]
After SMT, in 3573ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 3573ms
Starting structural reductions in SI_LTL mode, iteration 1 : 29/39 places, 64/76 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3719 ms. Remains : 29/39 places, 64/76 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-03a-LTLFireability-10
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-03a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03a-LTLFireability-10 finished in 3802 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)) U (p0 U p1))))'
Support contains 6 out of 39 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 76/76 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 39 transition count 72
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 35 transition count 72
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 8 place count 35 transition count 71
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 10 place count 34 transition count 71
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 13 place count 31 transition count 62
Iterating global reduction 2 with 3 rules applied. Total rules applied 16 place count 31 transition count 62
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 18 place count 30 transition count 61
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 20 place count 29 transition count 61
Applied a total of 20 rules in 10 ms. Remains 29 /39 variables (removed 10) and now considering 61/76 (removed 15) transitions.
// Phase 1: matrix 61 rows 29 cols
[2024-05-22 02:13:25] [INFO ] Computed 5 invariants in 0 ms
[2024-05-22 02:13:25] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-22 02:13:25] [INFO ] Invariant cache hit.
[2024-05-22 02:13:25] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-22 02:13:25] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
[2024-05-22 02:13:25] [INFO ] Redundant transitions in 13 ms returned []
Running 60 sub problems to find dead transitions.
[2024-05-22 02:13:25] [INFO ] Invariant cache hit.
[2024-05-22 02:13:25] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 1/29 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 60/89 variables, 29/34 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 34/68 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 1/90 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/90 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 90/90 variables, and 69 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1264 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 29/29 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 1/29 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 60/89 variables, 29/34 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 34/68 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 60/128 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 1/90 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/90 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 0/90 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 90/90 variables, and 129 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1900 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 29/29 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 3216ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 3217ms
Starting structural reductions in SI_LTL mode, iteration 1 : 29/39 places, 61/76 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3370 ms. Remains : 29/39 places, 61/76 transitions.
Stuttering acceptance computed with spot in 115 ms :[(NOT p1), p0, (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-03a-LTLFireability-11
Product exploration explored 100000 steps with 6 reset in 135 ms.
Product exploration explored 100000 steps with 4 reset in 131 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 (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 98 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 118 ms :[(NOT p1), p0, (NOT p1)]
RANDOM walk for 6091 steps (494 resets) in 28 ms. (210 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 7 factoid took 180 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[(NOT p1), p0, (NOT p1)]
Stuttering acceptance computed with spot in 112 ms :[(NOT p1), p0, (NOT p1)]
[2024-05-22 02:13:29] [INFO ] Invariant cache hit.
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 7 factoid took 200 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-03a-LTLFireability-11 FALSE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-03a-LTLFireability-11 finished in 4706 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 39 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 76/76 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 37 transition count 71
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 33 transition count 70
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 32 transition count 70
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 11 place count 32 transition count 69
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 13 place count 31 transition count 69
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 17 place count 27 transition count 56
Iterating global reduction 3 with 4 rules applied. Total rules applied 21 place count 27 transition count 56
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 25 place count 25 transition count 54
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 27 place count 24 transition count 54
Applied a total of 27 rules in 15 ms. Remains 24 /39 variables (removed 15) and now considering 54/76 (removed 22) transitions.
// Phase 1: matrix 54 rows 24 cols
[2024-05-22 02:13:29] [INFO ] Computed 4 invariants in 0 ms
[2024-05-22 02:13:29] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-22 02:13:29] [INFO ] Invariant cache hit.
[2024-05-22 02:13:30] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 02:13:30] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2024-05-22 02:13:30] [INFO ] Redundant transitions in 13 ms returned []
Running 53 sub problems to find dead transitions.
[2024-05-22 02:13:30] [INFO ] Invariant cache hit.
[2024-05-22 02:13:30] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (OVERLAPS) 53/77 variables, 24/28 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-22 02:13:30] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (OVERLAPS) 1/78 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (OVERLAPS) 0/78 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 78/78 variables, and 31 constraints, problems are : Problem set: 0 solved, 53 unsolved in 1064 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 24/24 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (OVERLAPS) 53/77 variables, 24/29 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 53/83 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (OVERLAPS) 1/78 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/78 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 9 (OVERLAPS) 0/78 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 78/78 variables, and 84 constraints, problems are : Problem set: 0 solved, 53 unsolved in 1305 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 24/24 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 1/1 constraints]
After SMT, in 2419ms problems are : Problem set: 0 solved, 53 unsolved
Search for dead transitions found 0 dead transitions in 2421ms
Starting structural reductions in SI_LTL mode, iteration 1 : 24/39 places, 54/76 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2554 ms. Remains : 24/39 places, 54/76 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-03a-LTLFireability-12
Stuttering criterion allowed to conclude after 25 steps with 4 reset in 0 ms.
FORMULA AutonomousCar-PT-03a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03a-LTLFireability-12 finished in 2643 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((F(p0)&&X(G(p1)))))'
Support contains 6 out of 39 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 76/76 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 39 transition count 72
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 35 transition count 72
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 8 place count 35 transition count 71
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 10 place count 34 transition count 71
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 13 place count 31 transition count 62
Iterating global reduction 2 with 3 rules applied. Total rules applied 16 place count 31 transition count 62
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 2 with 4 rules applied. Total rules applied 20 place count 29 transition count 60
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 22 place count 28 transition count 60
Applied a total of 22 rules in 11 ms. Remains 28 /39 variables (removed 11) and now considering 60/76 (removed 16) transitions.
// Phase 1: matrix 60 rows 28 cols
[2024-05-22 02:13:32] [INFO ] Computed 5 invariants in 0 ms
[2024-05-22 02:13:32] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-22 02:13:32] [INFO ] Invariant cache hit.
[2024-05-22 02:13:32] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-22 02:13:32] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2024-05-22 02:13:32] [INFO ] Redundant transitions in 14 ms returned []
Running 59 sub problems to find dead transitions.
[2024-05-22 02:13:32] [INFO ] Invariant cache hit.
[2024-05-22 02:13:32] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 1/28 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (OVERLAPS) 59/87 variables, 28/33 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 34/67 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-22 02:13:33] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (OVERLAPS) 1/88 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/88 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (OVERLAPS) 0/88 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 88/88 variables, and 69 constraints, problems are : Problem set: 0 solved, 59 unsolved in 1696 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 28/28 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 1/28 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (OVERLAPS) 59/87 variables, 28/34 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 34/68 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 59/127 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/87 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (OVERLAPS) 1/88 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/88 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (OVERLAPS) 0/88 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 88/88 variables, and 128 constraints, problems are : Problem set: 0 solved, 59 unsolved in 1690 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 28/28 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 1/1 constraints]
After SMT, in 3437ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 3439ms
Starting structural reductions in SI_LTL mode, iteration 1 : 28/39 places, 60/76 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3580 ms. Remains : 28/39 places, 60/76 transitions.
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-03a-LTLFireability-14
Product exploration explored 100000 steps with 6 reset in 79 ms.
Product exploration explored 100000 steps with 27 reset in 81 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 p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 90 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p1), (NOT p0)]
RANDOM walk for 40000 steps (3136 resets) in 120 ms. (330 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (634 resets) in 274 ms. (145 steps per ms) remains 1/1 properties
[2024-05-22 02:13:36] [INFO ] Invariant cache hit.
[2024-05-22 02:13:36] [INFO ] State equation strengthened by 35 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, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/14 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/24 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 57/81 variables, 24/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 34/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/87 variables, 4/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/87 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/88 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/88 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/88 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 88/88 variables, and 68 constraints, problems are : Problem set: 0 solved, 1 unsolved in 69 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 28/28 constraints, ReadFeed: 35/35 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Int declared 14/88 variables, and 3 constraints, problems are : Problem set: 1 solved, 0 unsolved in 24 ms.
Refiners :[Positive P Invariants (semi-flows): 3/5 constraints, State Equation: 0/28 constraints, ReadFeed: 0/35 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 99ms 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 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 8 factoid took 153 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p1)]
Support contains 4 out of 28 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 28/28 places, 60/60 transitions.
Applied a total of 0 rules in 4 ms. Remains 28 /28 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2024-05-22 02:13:37] [INFO ] Invariant cache hit.
[2024-05-22 02:13:37] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-22 02:13:37] [INFO ] Invariant cache hit.
[2024-05-22 02:13:37] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-22 02:13:37] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2024-05-22 02:13:37] [INFO ] Redundant transitions in 13 ms returned []
Running 59 sub problems to find dead transitions.
[2024-05-22 02:13:37] [INFO ] Invariant cache hit.
[2024-05-22 02:13:37] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 1/28 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (OVERLAPS) 59/87 variables, 28/33 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 34/67 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-22 02:13:37] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (OVERLAPS) 1/88 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/88 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (OVERLAPS) 0/88 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 88/88 variables, and 69 constraints, problems are : Problem set: 0 solved, 59 unsolved in 1499 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 28/28 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 1/28 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (OVERLAPS) 59/87 variables, 28/34 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 34/68 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 59/127 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/87 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (OVERLAPS) 1/88 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/88 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (OVERLAPS) 0/88 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 88/88 variables, and 128 constraints, problems are : Problem set: 0 solved, 59 unsolved in 1784 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 28/28 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 1/1 constraints]
After SMT, in 3324ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 3333ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3458 ms. Remains : 28/28 places, 60/60 transitions.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p1)]
RANDOM walk for 1523 steps (118 resets) in 8 ms. (169 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p1)]
Product exploration explored 100000 steps with 0 reset in 69 ms.
Product exploration explored 100000 steps with 6 reset in 73 ms.
Support contains 4 out of 28 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 28/28 places, 60/60 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 27 transition count 56
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 27 transition count 56
Applied a total of 2 rules in 4 ms. Remains 27 /28 variables (removed 1) and now considering 56/60 (removed 4) transitions.
// Phase 1: matrix 56 rows 27 cols
[2024-05-22 02:13:40] [INFO ] Computed 5 invariants in 1 ms
[2024-05-22 02:13:41] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-22 02:13:41] [INFO ] Invariant cache hit.
[2024-05-22 02:13:41] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-22 02:13:41] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2024-05-22 02:13:41] [INFO ] Redundant transitions in 13 ms returned []
Running 55 sub problems to find dead transitions.
[2024-05-22 02:13:41] [INFO ] Invariant cache hit.
[2024-05-22 02:13:41] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (OVERLAPS) 1/27 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (OVERLAPS) 55/82 variables, 27/32 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 31/63 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-05-22 02:13:41] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (OVERLAPS) 1/83 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/83 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 9 (OVERLAPS) 0/83 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Real declared 83/83 variables, and 65 constraints, problems are : Problem set: 0 solved, 55 unsolved in 1405 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 27/27 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 55 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (OVERLAPS) 1/27 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (OVERLAPS) 55/82 variables, 27/33 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 31/64 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 55/119 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 8 (OVERLAPS) 1/83 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/83 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 10 (OVERLAPS) 0/83 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Int declared 83/83 variables, and 120 constraints, problems are : Problem set: 0 solved, 55 unsolved in 1492 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 27/27 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 1/1 constraints]
After SMT, in 2934ms problems are : Problem set: 0 solved, 55 unsolved
Search for dead transitions found 0 dead transitions in 2935ms
Starting structural reductions in SI_LTL mode, iteration 1 : 27/28 places, 56/60 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3063 ms. Remains : 27/28 places, 56/60 transitions.
Treatment of property AutonomousCar-PT-03a-LTLFireability-14 finished in 11521 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(X(p0)) U p1))'
Support contains 6 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 76/76 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 36 transition count 67
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 36 transition count 67
Applied a total of 6 rules in 2 ms. Remains 36 /39 variables (removed 3) and now considering 67/76 (removed 9) transitions.
// Phase 1: matrix 67 rows 36 cols
[2024-05-22 02:13:44] [INFO ] Computed 5 invariants in 1 ms
[2024-05-22 02:13:44] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-22 02:13:44] [INFO ] Invariant cache hit.
[2024-05-22 02:13:44] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-22 02:13:44] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
Running 66 sub problems to find dead transitions.
[2024-05-22 02:13:44] [INFO ] Invariant cache hit.
[2024-05-22 02:13:44] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 1/36 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (OVERLAPS) 66/102 variables, 36/41 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 32/73 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2024-05-22 02:13:44] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2024-05-22 02:13:44] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-22 02:13:44] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-05-22 02:13:45] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 4/77 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (OVERLAPS) 1/103 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/103 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 9 (OVERLAPS) 0/103 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 103/103 variables, and 78 constraints, problems are : Problem set: 0 solved, 66 unsolved in 1970 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 36/36 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 1/36 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 66/102 variables, 36/45 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 32/77 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 66/143 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (OVERLAPS) 1/103 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/103 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 10 (OVERLAPS) 0/103 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 103/103 variables, and 144 constraints, problems are : Problem set: 0 solved, 66 unsolved in 2168 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 36/36 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 4/4 constraints]
After SMT, in 4176ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 4177ms
Starting structural reductions in LTL mode, iteration 1 : 36/39 places, 67/76 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4298 ms. Remains : 36/39 places, 67/76 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), true, (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-03a-LTLFireability-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-03a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03a-LTLFireability-15 finished in 4436 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)||(p1 U p2))))'
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((F(p0)&&X(G(p1)))))'
[2024-05-22 02:13:48] [INFO ] Flatten gal took : 16 ms
[2024-05-22 02:13:48] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2024-05-22 02:13:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 39 places, 76 transitions and 432 arcs took 12 ms.
Total runtime 68864 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running AutonomousCar-PT-03a

IS_COLORED=
IS_NUPN=

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


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


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

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

Process ID: 1322
MODEL NAME: /home/mcc/execution/410/model
39 places, 76 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA AutonomousCar-PT-03a-LTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-03a-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716344030108

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is AutonomousCar-PT-03a, 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 r025-smll-171620166200252"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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