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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 17:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.5K Apr 12 18:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 47K Apr 12 18:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 12 18:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Apr 12 18:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 781K 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-09a-LTLFireability-00
FORMULA_NAME AutonomousCar-PT-09a-LTLFireability-01
FORMULA_NAME AutonomousCar-PT-09a-LTLFireability-02
FORMULA_NAME AutonomousCar-PT-09a-LTLFireability-03
FORMULA_NAME AutonomousCar-PT-09a-LTLFireability-04
FORMULA_NAME AutonomousCar-PT-09a-LTLFireability-05
FORMULA_NAME AutonomousCar-PT-09a-LTLFireability-06
FORMULA_NAME AutonomousCar-PT-09a-LTLFireability-07
FORMULA_NAME AutonomousCar-PT-09a-LTLFireability-08
FORMULA_NAME AutonomousCar-PT-09a-LTLFireability-09
FORMULA_NAME AutonomousCar-PT-09a-LTLFireability-10
FORMULA_NAME AutonomousCar-PT-09a-LTLFireability-11
FORMULA_NAME AutonomousCar-PT-09a-LTLFireability-12
FORMULA_NAME AutonomousCar-PT-09a-LTLFireability-13
FORMULA_NAME AutonomousCar-PT-09a-LTLFireability-14
FORMULA_NAME AutonomousCar-PT-09a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716356281306

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-09a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 05:38:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 05:38:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 05:38:04] [INFO ] Load time of PNML (sax parser for PT used): 497 ms
[2024-05-22 05:38:04] [INFO ] Transformed 89 places.
[2024-05-22 05:38:04] [INFO ] Transformed 1249 transitions.
[2024-05-22 05:38:04] [INFO ] Found NUPN structural information;
[2024-05-22 05:38:04] [INFO ] Parsed PT model containing 89 places and 1249 transitions and 15631 arcs in 883 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 159 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 345 transitions
Reduce redundant transitions removed 345 transitions.
FORMULA AutonomousCar-PT-09a-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09a-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09a-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09a-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09a-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 904/904 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 84 transition count 863
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 84 transition count 863
Applied a total of 10 rules in 73 ms. Remains 84 /89 variables (removed 5) and now considering 863/904 (removed 41) transitions.
// Phase 1: matrix 863 rows 84 cols
[2024-05-22 05:38:05] [INFO ] Computed 13 invariants in 66 ms
[2024-05-22 05:38:05] [INFO ] Implicit Places using invariants in 581 ms returned []
[2024-05-22 05:38:05] [INFO ] Invariant cache hit.
[2024-05-22 05:38:06] [INFO ] State equation strengthened by 291 read => feed constraints.
[2024-05-22 05:38:06] [INFO ] Implicit Places using invariants and state equation in 772 ms returned [80, 82]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1418 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 82/89 places, 863/904 transitions.
Applied a total of 0 rules in 9 ms. Remains 82 /82 variables (removed 0) and now considering 863/863 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1536 ms. Remains : 82/89 places, 863/904 transitions.
Support contains 39 out of 82 places after structural reductions.
[2024-05-22 05:38:07] [INFO ] Flatten gal took : 423 ms
[2024-05-22 05:38:07] [INFO ] Flatten gal took : 169 ms
[2024-05-22 05:38:08] [INFO ] Input system was already deterministic with 863 transitions.
Reduction of identical properties reduced properties to check from 19 to 18
RANDOM walk for 40000 steps (1942 resets) in 4185 ms. (9 steps per ms) remains 7/18 properties
BEST_FIRST walk for 40004 steps (115 resets) in 374 ms. (106 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (110 resets) in 192 ms. (207 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40003 steps (24 resets) in 218 ms. (182 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40002 steps (121 resets) in 319 ms. (125 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (53 resets) in 186 ms. (213 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (151 resets) in 147 ms. (270 steps per ms) remains 3/4 properties
// Phase 1: matrix 863 rows 82 cols
[2024-05-22 05:38:09] [INFO ] Computed 11 invariants in 23 ms
[2024-05-22 05:38:09] [INFO ] State equation strengthened by 291 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 25/35 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 38/73 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 854/927 variables, 73/84 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/927 variables, 290/374 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/927 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 13/940 variables, 5/379 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/940 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 4/944 variables, 4/383 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/944 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 1/945 variables, 1/384 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/945 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/945 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 945/945 variables, and 384 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1107 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 82/82 constraints, ReadFeed: 291/291 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 25/35 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 38/73 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 854/927 variables, 73/84 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/927 variables, 290/374 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/927 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 13/940 variables, 5/379 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/940 variables, 3/382 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/940 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 4/944 variables, 4/386 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/944 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 1/945 variables, 1/387 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/945 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/945 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 945/945 variables, and 387 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3055 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 82/82 constraints, ReadFeed: 291/291 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 4381ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 22925 ms.
Support contains 10 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 863/863 transitions.
Graph (complete) has 990 edges and 82 vertex of which 81 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.34 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 81 transition count 850
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 10 rules applied. Total rules applied 23 place count 72 transition count 849
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 24 place count 71 transition count 849
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 24 place count 71 transition count 848
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 26 place count 70 transition count 848
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 30 place count 66 transition count 817
Iterating global reduction 3 with 4 rules applied. Total rules applied 34 place count 66 transition count 817
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 40 place count 63 transition count 814
Free-agglomeration rule applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 48 place count 63 transition count 806
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 71 rules applied. Total rules applied 119 place count 55 transition count 743
Applied a total of 119 rules in 453 ms. Remains 55 /82 variables (removed 27) and now considering 743/863 (removed 120) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 454 ms. Remains : 55/82 places, 743/863 transitions.
RANDOM walk for 40000 steps (58 resets) in 1260 ms. (31 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (122 resets) in 125 ms. (317 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (116 resets) in 84 ms. (470 steps per ms) remains 2/3 properties
// Phase 1: matrix 743 rows 55 cols
[2024-05-22 05:38:38] [INFO ] Computed 13 invariants in 7 ms
[2024-05-22 05:38:38] [INFO ] State equation strengthened by 199 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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 19/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 30/55 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 743/798 variables, 55/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/798 variables, 199/267 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/798 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/798 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 798/798 variables, and 267 constraints, problems are : Problem set: 0 solved, 2 unsolved in 371 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 55/55 constraints, ReadFeed: 199/199 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 19/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 30/55 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 743/798 variables, 55/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/798 variables, 199/267 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/798 variables, 2/269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/798 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/798 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 798/798 variables, and 269 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1099 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 55/55 constraints, ReadFeed: 199/199 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1580ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1325 ms.
Support contains 6 out of 55 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 743/743 transitions.
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 55 transition count 741
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 22 place count 53 transition count 723
Applied a total of 22 rules in 110 ms. Remains 53 /55 variables (removed 2) and now considering 723/743 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 53/55 places, 723/743 transitions.
RANDOM walk for 40000 steps (9 resets) in 1101 ms. (36 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (172 resets) in 106 ms. (373 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (171 resets) in 96 ms. (412 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1047748 steps, run timeout after 3001 ms. (steps per millisecond=349 ) properties seen :1 out of 2
Probabilistic random walk after 1047748 steps, saw 126863 distinct states, run finished after 3008 ms. (steps per millisecond=348 ) properties seen :1
// Phase 1: matrix 723 rows 53 cols
[2024-05-22 05:38:44] [INFO ] Computed 13 invariants in 11 ms
[2024-05-22 05:38:44] [INFO ] State equation strengthened by 181 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/19 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 34/53 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 723/776 variables, 53/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/776 variables, 181/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/776 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/776 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 776/776 variables, and 247 constraints, problems are : Problem set: 0 solved, 1 unsolved in 477 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 53/53 constraints, ReadFeed: 181/181 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/19 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 34/53 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 723/776 variables, 53/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/776 variables, 181/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/776 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/776 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/776 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 776/776 variables, and 248 constraints, problems are : Problem set: 0 solved, 1 unsolved in 710 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 53/53 constraints, ReadFeed: 181/181 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1252ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 264 ms.
Support contains 4 out of 53 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 53/53 places, 723/723 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 52 transition count 713
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 52 transition count 713
Applied a total of 2 rules in 83 ms. Remains 52 /53 variables (removed 1) and now considering 713/723 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 52/53 places, 713/723 transitions.
RANDOM walk for 40000 steps (10 resets) in 1046 ms. (38 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (178 resets) in 95 ms. (416 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1095261 steps, run timeout after 3001 ms. (steps per millisecond=364 ) properties seen :0 out of 1
Probabilistic random walk after 1095261 steps, saw 131808 distinct states, run finished after 3001 ms. (steps per millisecond=364 ) properties seen :0
// Phase 1: matrix 713 rows 52 cols
[2024-05-22 05:38:49] [INFO ] Computed 13 invariants in 10 ms
[2024-05-22 05:38:49] [INFO ] State equation strengthened by 172 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/19 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 33/52 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 713/765 variables, 52/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/765 variables, 172/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/765 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/765 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 765/765 variables, and 237 constraints, problems are : Problem set: 0 solved, 1 unsolved in 463 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 52/52 constraints, ReadFeed: 172/172 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/19 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 33/52 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 713/765 variables, 52/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/765 variables, 172/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/765 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/765 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/765 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 765/765 variables, and 238 constraints, problems are : Problem set: 0 solved, 1 unsolved in 961 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 52/52 constraints, ReadFeed: 172/172 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1469ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 165 ms.
Support contains 4 out of 52 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 713/713 transitions.
Applied a total of 0 rules in 40 ms. Remains 52 /52 variables (removed 0) and now considering 713/713 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 52/52 places, 713/713 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 713/713 transitions.
Applied a total of 0 rules in 41 ms. Remains 52 /52 variables (removed 0) and now considering 713/713 (removed 0) transitions.
[2024-05-22 05:38:51] [INFO ] Invariant cache hit.
[2024-05-22 05:38:51] [INFO ] Implicit Places using invariants in 463 ms returned [51]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 466 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 51/52 places, 713/713 transitions.
Applied a total of 0 rules in 41 ms. Remains 51 /51 variables (removed 0) and now considering 713/713 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 549 ms. Remains : 51/52 places, 713/713 transitions.
RANDOM walk for 40000 steps (12 resets) in 853 ms. (46 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (175 resets) in 109 ms. (363 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1079406 steps, run timeout after 3001 ms. (steps per millisecond=359 ) properties seen :0 out of 1
Probabilistic random walk after 1079406 steps, saw 129748 distinct states, run finished after 3001 ms. (steps per millisecond=359 ) properties seen :0
// Phase 1: matrix 713 rows 51 cols
[2024-05-22 05:38:55] [INFO ] Computed 12 invariants in 7 ms
[2024-05-22 05:38:55] [INFO ] State equation strengthened by 172 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/19 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 32/51 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 713/764 variables, 51/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/764 variables, 172/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/764 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/764 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 764/764 variables, and 235 constraints, problems are : Problem set: 0 solved, 1 unsolved in 312 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 51/51 constraints, ReadFeed: 172/172 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/19 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 32/51 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 713/764 variables, 51/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/764 variables, 172/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/764 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/764 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/764 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 764/764 variables, and 236 constraints, problems are : Problem set: 0 solved, 1 unsolved in 709 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 51/51 constraints, ReadFeed: 172/172 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1058ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 287 ms.
Support contains 4 out of 51 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 51/51 places, 713/713 transitions.
Applied a total of 0 rules in 63 ms. Remains 51 /51 variables (removed 0) and now considering 713/713 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 51/51 places, 713/713 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 51/51 places, 713/713 transitions.
Applied a total of 0 rules in 60 ms. Remains 51 /51 variables (removed 0) and now considering 713/713 (removed 0) transitions.
[2024-05-22 05:38:56] [INFO ] Invariant cache hit.
[2024-05-22 05:38:56] [INFO ] Implicit Places using invariants in 367 ms returned []
[2024-05-22 05:38:56] [INFO ] Invariant cache hit.
[2024-05-22 05:38:57] [INFO ] State equation strengthened by 172 read => feed constraints.
[2024-05-22 05:38:57] [INFO ] Implicit Places using invariants and state equation in 719 ms returned []
Implicit Place search using SMT with State Equation took 1089 ms to find 0 implicit places.
[2024-05-22 05:38:57] [INFO ] Redundant transitions in 72 ms returned []
Running 712 sub problems to find dead transitions.
[2024-05-22 05:38:57] [INFO ] Invariant cache hit.
[2024-05-22 05:38:57] [INFO ] State equation strengthened by 172 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 712 unsolved
[2024-05-22 05:39:20] [INFO ] Deduced a trap composed of 21 places in 668 ms of which 11 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 4 (OVERLAPS) 713/764 variables, 51/64 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/764 variables, 172/236 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/764 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 712 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 764/764 variables, and 236 constraints, problems are : Problem set: 0 solved, 712 unsolved in 30066 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 51/51 constraints, ReadFeed: 172/172 constraints, PredecessorRefiner: 712/712 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 712 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 4 (OVERLAPS) 713/764 variables, 51/64 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/764 variables, 172/236 constraints. Problems are: Problem set: 0 solved, 712 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 764/764 variables, and 948 constraints, problems are : Problem set: 0 solved, 712 unsolved in 32450 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 51/51 constraints, ReadFeed: 172/172 constraints, PredecessorRefiner: 712/712 constraints, Known Traps: 1/1 constraints]
After SMT, in 77356ms problems are : Problem set: 0 solved, 712 unsolved
Search for dead transitions found 0 dead transitions in 77381ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78624 ms. Remains : 51/51 places, 713/713 transitions.
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' '!(F(G(p0)))'
Support contains 10 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 863/863 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 82 transition count 854
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 73 transition count 854
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 18 place count 73 transition count 852
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 71 transition count 852
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 27 place count 66 transition count 802
Iterating global reduction 2 with 5 rules applied. Total rules applied 32 place count 66 transition count 802
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 34 place count 65 transition count 801
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 36 place count 64 transition count 801
Applied a total of 36 rules in 491 ms. Remains 64 /82 variables (removed 18) and now considering 801/863 (removed 62) transitions.
// Phase 1: matrix 801 rows 64 cols
[2024-05-22 05:40:16] [INFO ] Computed 11 invariants in 31 ms
[2024-05-22 05:40:16] [INFO ] Implicit Places using invariants in 592 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 600 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/82 places, 801/863 transitions.
Applied a total of 0 rules in 150 ms. Remains 63 /63 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1242 ms. Remains : 63/82 places, 801/863 transitions.
Stuttering acceptance computed with spot in 314 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-09a-LTLFireability-00
Product exploration explored 100000 steps with 206 reset in 456 ms.
Product exploration explored 100000 steps with 36 reset in 171 ms.
Computed a total of 2 stabilizing places and 3 stable transitions
Computed a total of 2 stabilizing places and 3 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 175 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 46 ms :[(NOT p0)]
RANDOM walk for 40000 steps (2376 resets) in 862 ms. (46 steps per ms) remains 1/1 properties
BEST_FIRST walk for 15618 steps (64 resets) in 134 ms. (115 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 135 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 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Support contains 10 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 801/801 transitions.
Applied a total of 0 rules in 88 ms. Remains 63 /63 variables (removed 0) and now considering 801/801 (removed 0) transitions.
// Phase 1: matrix 801 rows 63 cols
[2024-05-22 05:40:18] [INFO ] Computed 10 invariants in 7 ms
[2024-05-22 05:40:18] [INFO ] Implicit Places using invariants in 301 ms returned []
[2024-05-22 05:40:18] [INFO ] Invariant cache hit.
[2024-05-22 05:40:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 05:40:19] [INFO ] Implicit Places using invariants and state equation in 622 ms returned []
Implicit Place search using SMT with State Equation took 925 ms to find 0 implicit places.
[2024-05-22 05:40:19] [INFO ] Redundant transitions in 33 ms returned []
Running 800 sub problems to find dead transitions.
[2024-05-22 05:40:19] [INFO ] Invariant cache hit.
[2024-05-22 05:40:19] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 3 (OVERLAPS) 800/863 variables, 63/73 constraints. Problems are: Problem set: 0 solved, 800 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 863/864 variables, and 73 constraints, problems are : Problem set: 0 solved, 800 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 63/63 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 800/800 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 800 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 3 (OVERLAPS) 800/863 variables, 63/73 constraints. Problems are: Problem set: 0 solved, 800 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 863/864 variables, and 873 constraints, problems are : Problem set: 0 solved, 800 unsolved in 32234 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 63/63 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 800/800 constraints, Known Traps: 0/0 constraints]
After SMT, in 77735ms problems are : Problem set: 0 solved, 800 unsolved
Search for dead transitions found 0 dead transitions in 77750ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 78806 ms. Remains : 63/63 places, 801/801 transitions.
Computed a total of 2 stabilizing places and 3 stable transitions
Computed a total of 2 stabilizing places and 3 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 118 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 53 ms :[(NOT p0)]
RANDOM walk for 40000 steps (2404 resets) in 973 ms. (41 steps per ms) remains 1/1 properties
BEST_FIRST walk for 13201 steps (53 resets) in 47 ms. (275 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 125 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 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Product exploration explored 100000 steps with 101 reset in 133 ms.
Product exploration explored 100000 steps with 122 reset in 519 ms.
Support contains 10 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 801/801 transitions.
Applied a total of 0 rules in 77 ms. Remains 63 /63 variables (removed 0) and now considering 801/801 (removed 0) transitions.
[2024-05-22 05:41:38] [INFO ] Invariant cache hit.
[2024-05-22 05:41:39] [INFO ] Implicit Places using invariants in 195 ms returned []
[2024-05-22 05:41:39] [INFO ] Invariant cache hit.
[2024-05-22 05:41:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 05:41:39] [INFO ] Implicit Places using invariants and state equation in 505 ms returned []
Implicit Place search using SMT with State Equation took 706 ms to find 0 implicit places.
[2024-05-22 05:41:39] [INFO ] Redundant transitions in 43 ms returned []
Running 800 sub problems to find dead transitions.
[2024-05-22 05:41:39] [INFO ] Invariant cache hit.
[2024-05-22 05:41:39] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 3 (OVERLAPS) 800/863 variables, 63/73 constraints. Problems are: Problem set: 0 solved, 800 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 863/864 variables, and 73 constraints, problems are : Problem set: 0 solved, 800 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 63/63 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 800/800 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 800 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 3 (OVERLAPS) 800/863 variables, 63/73 constraints. Problems are: Problem set: 0 solved, 800 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 863/864 variables, and 873 constraints, problems are : Problem set: 0 solved, 800 unsolved in 32416 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 63/63 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 800/800 constraints, Known Traps: 0/0 constraints]
After SMT, in 76838ms problems are : Problem set: 0 solved, 800 unsolved
Search for dead transitions found 0 dead transitions in 76855ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 77694 ms. Remains : 63/63 places, 801/801 transitions.
Treatment of property AutonomousCar-PT-09a-LTLFireability-00 finished in 161385 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X((G(p1)||X(G(p2))))||p0))))'
Support contains 6 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 863/863 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 78 transition count 823
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 78 transition count 823
Applied a total of 8 rules in 8 ms. Remains 78 /82 variables (removed 4) and now considering 823/863 (removed 40) transitions.
// Phase 1: matrix 823 rows 78 cols
[2024-05-22 05:42:56] [INFO ] Computed 11 invariants in 5 ms
[2024-05-22 05:42:57] [INFO ] Implicit Places using invariants in 307 ms returned []
[2024-05-22 05:42:57] [INFO ] Invariant cache hit.
[2024-05-22 05:42:57] [INFO ] State equation strengthened by 255 read => feed constraints.
[2024-05-22 05:42:57] [INFO ] Implicit Places using invariants and state equation in 751 ms returned []
Implicit Place search using SMT with State Equation took 1065 ms to find 0 implicit places.
Running 822 sub problems to find dead transitions.
[2024-05-22 05:42:57] [INFO ] Invariant cache hit.
[2024-05-22 05:42:57] [INFO ] State equation strengthened by 255 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (OVERLAPS) 1/78 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 3 (OVERLAPS) 822/900 variables, 78/89 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/900 variables, 254/343 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-22 05:43:36] [INFO ] Deduced a trap composed of 15 places in 609 ms of which 5 ms to minimize.
[2024-05-22 05:43:36] [INFO ] Deduced a trap composed of 22 places in 903 ms of which 2 ms to minimize.
[2024-05-22 05:43:37] [INFO ] Deduced a trap composed of 7 places in 755 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 900/901 variables, and 346 constraints, problems are : Problem set: 0 solved, 822 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 78/78 constraints, ReadFeed: 254/255 constraints, PredecessorRefiner: 822/822 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 822 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (OVERLAPS) 1/78 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 4 (OVERLAPS) 822/900 variables, 78/92 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/900 variables, 254/346 constraints. Problems are: Problem set: 0 solved, 822 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 900/901 variables, and 1168 constraints, problems are : Problem set: 0 solved, 822 unsolved in 32736 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 78/78 constraints, ReadFeed: 254/255 constraints, PredecessorRefiner: 822/822 constraints, Known Traps: 3/3 constraints]
After SMT, in 78157ms problems are : Problem set: 0 solved, 822 unsolved
Search for dead transitions found 0 dead transitions in 78173ms
Starting structural reductions in LTL mode, iteration 1 : 78/82 places, 823/863 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 79253 ms. Remains : 78/82 places, 823/863 transitions.
Stuttering acceptance computed with spot in 226 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-09a-LTLFireability-02
Product exploration explored 100000 steps with 1238 reset in 599 ms.
Product exploration explored 100000 steps with 1548 reset in 453 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 148 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 7 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 328 ms :[true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 40000 steps (1943 resets) in 1381 ms. (28 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (147 resets) in 265 ms. (150 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (114 resets) in 616 ms. (64 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (109 resets) in 242 ms. (164 steps per ms) remains 3/3 properties
[2024-05-22 05:44:18] [INFO ] Invariant cache hit.
[2024-05-22 05:44:18] [INFO ] State equation strengthened by 255 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 15/21 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 48/69 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 814/883 variables, 69/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/883 variables, 254/334 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/883 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 13/896 variables, 5/339 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/896 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 4/900 variables, 4/343 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/900 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 1/901 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/901 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/901 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 901/901 variables, and 344 constraints, problems are : Problem set: 0 solved, 3 unsolved in 721 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 78/78 constraints, ReadFeed: 255/255 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf0 is UNSAT
At refinement iteration 1 (OVERLAPS) 15/21 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 48/69 variables, 8/11 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 814/883 variables, 69/80 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/883 variables, 254/334 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/883 variables, 0/334 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 13/896 variables, 5/339 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/896 variables, 2/341 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/896 variables, 0/341 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 4/900 variables, 4/345 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/900 variables, 0/345 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1/901 variables, 1/346 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/901 variables, 0/346 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/901 variables, 0/346 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 901/901 variables, and 346 constraints, problems are : Problem set: 1 solved, 2 unsolved in 1804 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 78/78 constraints, ReadFeed: 255/255 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 2630ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 10061 ms.
Support contains 6 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 823/823 transitions.
Graph (complete) has 946 edges and 78 vertex of which 77 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 77 transition count 808
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 26 place count 66 transition count 808
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 26 place count 66 transition count 807
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 28 place count 65 transition count 807
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 64 transition count 806
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 64 transition count 806
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 36 place count 61 transition count 803
Free-agglomeration rule applied 9 times.
Iterating global reduction 2 with 9 rules applied. Total rules applied 45 place count 61 transition count 794
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 135 place count 52 transition count 713
Applied a total of 135 rules in 233 ms. Remains 52 /78 variables (removed 26) and now considering 713/823 (removed 110) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 234 ms. Remains : 52/78 places, 713/823 transitions.
RANDOM walk for 40000 steps (10 resets) in 1920 ms. (20 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (172 resets) in 140 ms. (283 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (175 resets) in 134 ms. (296 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 497312 steps, run timeout after 3001 ms. (steps per millisecond=165 ) properties seen :0 out of 2
Probabilistic random walk after 497312 steps, saw 62023 distinct states, run finished after 3006 ms. (steps per millisecond=165 ) properties seen :0
// Phase 1: matrix 713 rows 52 cols
[2024-05-22 05:44:35] [INFO ] Computed 13 invariants in 7 ms
[2024-05-22 05:44:35] [INFO ] State equation strengthened by 172 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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 13/19 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 33/52 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 713/765 variables, 52/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/765 variables, 172/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/765 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/765 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 765/765 variables, and 237 constraints, problems are : Problem set: 0 solved, 2 unsolved in 412 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 52/52 constraints, ReadFeed: 172/172 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 13/19 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 33/52 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 713/765 variables, 52/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/765 variables, 172/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/765 variables, 2/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/765 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/765 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 765/765 variables, and 239 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1188 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 52/52 constraints, ReadFeed: 172/172 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1681ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 352 ms.
Support contains 6 out of 52 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 713/713 transitions.
Applied a total of 0 rules in 36 ms. Remains 52 /52 variables (removed 0) and now considering 713/713 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 52/52 places, 713/713 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 713/713 transitions.
Applied a total of 0 rules in 36 ms. Remains 52 /52 variables (removed 0) and now considering 713/713 (removed 0) transitions.
[2024-05-22 05:44:37] [INFO ] Invariant cache hit.
[2024-05-22 05:44:37] [INFO ] Implicit Places using invariants in 321 ms returned [51]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 325 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 51/52 places, 713/713 transitions.
Applied a total of 0 rules in 61 ms. Remains 51 /51 variables (removed 0) and now considering 713/713 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 428 ms. Remains : 51/52 places, 713/713 transitions.
RANDOM walk for 40000 steps (10 resets) in 2162 ms. (18 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (173 resets) in 220 ms. (181 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (173 resets) in 194 ms. (205 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 466972 steps, run timeout after 3001 ms. (steps per millisecond=155 ) properties seen :0 out of 2
Probabilistic random walk after 466972 steps, saw 58452 distinct states, run finished after 3004 ms. (steps per millisecond=155 ) properties seen :0
// Phase 1: matrix 713 rows 51 cols
[2024-05-22 05:44:41] [INFO ] Computed 12 invariants in 5 ms
[2024-05-22 05:44:41] [INFO ] State equation strengthened by 172 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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 13/19 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 32/51 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 713/764 variables, 51/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/764 variables, 172/235 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/764 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/764 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 764/764 variables, and 235 constraints, problems are : Problem set: 0 solved, 2 unsolved in 298 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 51/51 constraints, ReadFeed: 172/172 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 13/19 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 32/51 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 713/764 variables, 51/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/764 variables, 172/235 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/764 variables, 2/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/764 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/764 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 764/764 variables, and 237 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1202 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 51/51 constraints, ReadFeed: 172/172 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1544ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 479 ms.
Support contains 6 out of 51 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 51/51 places, 713/713 transitions.
Applied a total of 0 rules in 68 ms. Remains 51 /51 variables (removed 0) and now considering 713/713 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 51/51 places, 713/713 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 51/51 places, 713/713 transitions.
Applied a total of 0 rules in 68 ms. Remains 51 /51 variables (removed 0) and now considering 713/713 (removed 0) transitions.
[2024-05-22 05:44:44] [INFO ] Invariant cache hit.
[2024-05-22 05:44:44] [INFO ] Implicit Places using invariants in 476 ms returned []
[2024-05-22 05:44:44] [INFO ] Invariant cache hit.
[2024-05-22 05:44:44] [INFO ] State equation strengthened by 172 read => feed constraints.
[2024-05-22 05:44:45] [INFO ] Implicit Places using invariants and state equation in 1006 ms returned []
Implicit Place search using SMT with State Equation took 1486 ms to find 0 implicit places.
[2024-05-22 05:44:45] [INFO ] Redundant transitions in 48 ms returned []
Running 712 sub problems to find dead transitions.
[2024-05-22 05:44:45] [INFO ] Invariant cache hit.
[2024-05-22 05:44:45] [INFO ] State equation strengthened by 172 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 712 unsolved
[2024-05-22 05:45:08] [INFO ] Deduced a trap composed of 21 places in 463 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 4 (OVERLAPS) 713/764 variables, 51/64 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/764 variables, 172/236 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/764 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 712 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 764/764 variables, and 236 constraints, problems are : Problem set: 0 solved, 712 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 51/51 constraints, ReadFeed: 172/172 constraints, PredecessorRefiner: 712/712 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 712 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 4 (OVERLAPS) 713/764 variables, 51/64 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/764 variables, 172/236 constraints. Problems are: Problem set: 0 solved, 712 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 764/764 variables, and 948 constraints, problems are : Problem set: 0 solved, 712 unsolved in 31377 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 51/51 constraints, ReadFeed: 172/172 constraints, PredecessorRefiner: 712/712 constraints, Known Traps: 1/1 constraints]
After SMT, in 76056ms problems are : Problem set: 0 solved, 712 unsolved
Search for dead transitions found 0 dead transitions in 76070ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77683 ms. Remains : 51/51 places, 713/713 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 p2), (X p0), (X (X p0)), (X (X p1)), (G (OR p2 p1))]
False Knowledge obtained : [(F (NOT (AND p2 p1))), (F (NOT (OR p2 (NOT p1)))), (F (NOT p2))]
Knowledge based reduction with 5 factoid took 185 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 331 ms :[true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 336 ms :[true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Support contains 6 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 823/823 transitions.
Applied a total of 0 rules in 5 ms. Remains 78 /78 variables (removed 0) and now considering 823/823 (removed 0) transitions.
// Phase 1: matrix 823 rows 78 cols
[2024-05-22 05:46:02] [INFO ] Computed 11 invariants in 7 ms
[2024-05-22 05:46:03] [INFO ] Implicit Places using invariants in 501 ms returned []
[2024-05-22 05:46:03] [INFO ] Invariant cache hit.
[2024-05-22 05:46:03] [INFO ] State equation strengthened by 255 read => feed constraints.
[2024-05-22 05:46:04] [INFO ] Implicit Places using invariants and state equation in 1011 ms returned []
Implicit Place search using SMT with State Equation took 1514 ms to find 0 implicit places.
Running 822 sub problems to find dead transitions.
[2024-05-22 05:46:04] [INFO ] Invariant cache hit.
[2024-05-22 05:46:04] [INFO ] State equation strengthened by 255 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (OVERLAPS) 1/78 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 3 (OVERLAPS) 822/900 variables, 78/89 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/900 variables, 254/343 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-22 05:46:48] [INFO ] Deduced a trap composed of 15 places in 835 ms of which 3 ms to minimize.
[2024-05-22 05:46:49] [INFO ] Deduced a trap composed of 22 places in 882 ms of which 2 ms to minimize.
SMT process timed out in 45000ms, After SMT, problems are : Problem set: 0 solved, 822 unsolved
Search for dead transitions found 0 dead transitions in 45017ms
Finished structural reductions in LTL mode , in 1 iterations and 46540 ms. Remains : 78/78 places, 823/823 transitions.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 135 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 321 ms :[true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (1964 resets) in 1070 ms. (37 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40003 steps (114 resets) in 107 ms. (370 steps per ms) remains 1/1 properties
[2024-05-22 05:46:49] [INFO ] Invariant cache hit.
[2024-05-22 05:46:49] [INFO ] State equation strengthened by 255 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 17/21 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 48/69 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 814/883 variables, 69/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/883 variables, 254/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/883 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 13/896 variables, 5/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/896 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/900 variables, 4/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/900 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/901 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/901 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/901 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 901/901 variables, and 344 constraints, problems are : Problem set: 0 solved, 1 unsolved in 575 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 78/78 constraints, ReadFeed: 255/255 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 17/21 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 48/69 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 814/883 variables, 69/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/883 variables, 254/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/883 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 13/896 variables, 5/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/896 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/896 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/900 variables, 4/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/900 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/901 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/901 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/901 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 901/901 variables, and 345 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1206 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 78/78 constraints, ReadFeed: 255/255 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1823ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 3632 ms.
Support contains 4 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 823/823 transitions.
Graph (complete) has 946 edges and 78 vertex of which 77 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 77 transition count 808
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 26 place count 66 transition count 808
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 26 place count 66 transition count 807
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 28 place count 65 transition count 807
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 64 transition count 806
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 64 transition count 806
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 36 place count 61 transition count 803
Free-agglomeration rule applied 9 times.
Iterating global reduction 2 with 9 rules applied. Total rules applied 45 place count 61 transition count 794
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 135 place count 52 transition count 713
Applied a total of 135 rules in 122 ms. Remains 52 /78 variables (removed 26) and now considering 713/823 (removed 110) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 123 ms. Remains : 52/78 places, 713/823 transitions.
RANDOM walk for 40000 steps (9 resets) in 601 ms. (66 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (176 resets) in 77 ms. (512 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 847557 steps, run timeout after 3001 ms. (steps per millisecond=282 ) properties seen :0 out of 1
Probabilistic random walk after 847557 steps, saw 102794 distinct states, run finished after 3001 ms. (steps per millisecond=282 ) properties seen :0
// Phase 1: matrix 713 rows 52 cols
[2024-05-22 05:46:58] [INFO ] Computed 13 invariants in 5 ms
[2024-05-22 05:46:58] [INFO ] State equation strengthened by 172 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/19 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 33/52 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 713/765 variables, 52/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/765 variables, 172/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/765 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/765 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 765/765 variables, and 237 constraints, problems are : Problem set: 0 solved, 1 unsolved in 396 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 52/52 constraints, ReadFeed: 172/172 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/19 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 33/52 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 713/765 variables, 52/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/765 variables, 172/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/765 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/765 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/765 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 765/765 variables, and 238 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1030 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 52/52 constraints, ReadFeed: 172/172 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1454ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 178 ms.
Support contains 4 out of 52 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 713/713 transitions.
Applied a total of 0 rules in 36 ms. Remains 52 /52 variables (removed 0) and now considering 713/713 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 52/52 places, 713/713 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 713/713 transitions.
Applied a total of 0 rules in 35 ms. Remains 52 /52 variables (removed 0) and now considering 713/713 (removed 0) transitions.
[2024-05-22 05:47:00] [INFO ] Invariant cache hit.
[2024-05-22 05:47:00] [INFO ] Implicit Places using invariants in 448 ms returned [51]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 450 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 51/52 places, 713/713 transitions.
Applied a total of 0 rules in 41 ms. Remains 51 /51 variables (removed 0) and now considering 713/713 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 527 ms. Remains : 51/52 places, 713/713 transitions.
RANDOM walk for 40000 steps (13 resets) in 746 ms. (53 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (173 resets) in 112 ms. (354 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 883052 steps, run timeout after 3001 ms. (steps per millisecond=294 ) properties seen :0 out of 1
Probabilistic random walk after 883052 steps, saw 107443 distinct states, run finished after 3001 ms. (steps per millisecond=294 ) properties seen :0
// Phase 1: matrix 713 rows 51 cols
[2024-05-22 05:47:04] [INFO ] Computed 12 invariants in 5 ms
[2024-05-22 05:47:04] [INFO ] State equation strengthened by 172 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/19 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 32/51 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 713/764 variables, 51/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/764 variables, 172/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/764 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/764 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 764/764 variables, and 235 constraints, problems are : Problem set: 0 solved, 1 unsolved in 325 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 51/51 constraints, ReadFeed: 172/172 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/19 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 32/51 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 713/764 variables, 51/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/764 variables, 172/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/764 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/764 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/764 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 764/764 variables, and 236 constraints, problems are : Problem set: 0 solved, 1 unsolved in 761 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 51/51 constraints, ReadFeed: 172/172 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1124ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 299 ms.
Support contains 4 out of 51 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 51/51 places, 713/713 transitions.
Applied a total of 0 rules in 57 ms. Remains 51 /51 variables (removed 0) and now considering 713/713 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 51/51 places, 713/713 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 51/51 places, 713/713 transitions.
Applied a total of 0 rules in 57 ms. Remains 51 /51 variables (removed 0) and now considering 713/713 (removed 0) transitions.
[2024-05-22 05:47:05] [INFO ] Invariant cache hit.
[2024-05-22 05:47:06] [INFO ] Implicit Places using invariants in 407 ms returned []
[2024-05-22 05:47:06] [INFO ] Invariant cache hit.
[2024-05-22 05:47:06] [INFO ] State equation strengthened by 172 read => feed constraints.
[2024-05-22 05:47:07] [INFO ] Implicit Places using invariants and state equation in 976 ms returned []
Implicit Place search using SMT with State Equation took 1390 ms to find 0 implicit places.
[2024-05-22 05:47:07] [INFO ] Redundant transitions in 21 ms returned []
Running 712 sub problems to find dead transitions.
[2024-05-22 05:47:07] [INFO ] Invariant cache hit.
[2024-05-22 05:47:07] [INFO ] State equation strengthened by 172 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 712 unsolved
[2024-05-22 05:47:29] [INFO ] Deduced a trap composed of 21 places in 497 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 4 (OVERLAPS) 713/764 variables, 51/64 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/764 variables, 172/236 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/764 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 712 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 764/764 variables, and 236 constraints, problems are : Problem set: 0 solved, 712 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 51/51 constraints, ReadFeed: 172/172 constraints, PredecessorRefiner: 712/712 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 712 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 4 (OVERLAPS) 713/764 variables, 51/64 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/764 variables, 172/236 constraints. Problems are: Problem set: 0 solved, 712 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 764/764 variables, and 948 constraints, problems are : Problem set: 0 solved, 712 unsolved in 32438 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 51/51 constraints, ReadFeed: 172/172 constraints, PredecessorRefiner: 712/712 constraints, Known Traps: 1/1 constraints]
After SMT, in 77906ms problems are : Problem set: 0 solved, 712 unsolved
Search for dead transitions found 0 dead transitions in 77921ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79402 ms. Remains : 51/51 places, 713/713 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 43 ms. Remains 51 /51 variables (removed 0) and now considering 713/713 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-22 05:48:25] [INFO ] Invariant cache hit.
[2024-05-22 05:48:25] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 05:48:25] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2024-05-22 05:48:25] [INFO ] After 303ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 05:48:25] [INFO ] After 445ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 05:48:25] [INFO ] After 597ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 722 ms.
Knowledge obtained : [(AND p2 p1 p0), (X p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT (AND p2 p1)))]
Knowledge based reduction with 4 factoid took 232 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 438 ms :[true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 386 ms :[true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 253 ms :[true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 331 reset in 170 ms.
Product exploration explored 100000 steps with 36 reset in 115 ms.
Applying partial POR strategy [true, true, true, false, false, false, false]
Stuttering acceptance computed with spot in 237 ms :[true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Support contains 6 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 823/823 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 78 transition count 823
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 11 place count 78 transition count 825
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 78 transition count 825
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 14 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 78 transition count 825
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 77 transition count 824
Deduced a syphon composed of 13 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 77 transition count 824
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 14 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 77 transition count 827
Deduced a syphon composed of 14 places in 0 ms
Applied a total of 17 rules in 173 ms. Remains 77 /78 variables (removed 1) and now considering 827/823 (removed -4) transitions.
[2024-05-22 05:48:28] [INFO ] Redundant transitions in 47 ms returned []
Running 826 sub problems to find dead transitions.
// Phase 1: matrix 827 rows 77 cols
[2024-05-22 05:48:28] [INFO ] Computed 11 invariants in 5 ms
[2024-05-22 05:48:28] [INFO ] State equation strengthened by 259 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 826 unsolved
At refinement iteration 1 (OVERLAPS) 1/77 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 826 unsolved
[2024-05-22 05:48:53] [INFO ] Deduced a trap composed of 6 places in 661 ms of which 2 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-05-22 05:48:54] [INFO ] Deduced a trap composed of 6 places in 665 ms of which 2 ms to minimize.
Problem TDEAD8 is UNSAT
[2024-05-22 05:48:55] [INFO ] Deduced a trap composed of 6 places in 662 ms of which 2 ms to minimize.
Problem TDEAD11 is UNSAT
[2024-05-22 05:48:55] [INFO ] Deduced a trap composed of 6 places in 654 ms of which 1 ms to minimize.
Problem TDEAD14 is UNSAT
[2024-05-22 05:48:56] [INFO ] Deduced a trap composed of 6 places in 653 ms of which 2 ms to minimize.
Problem TDEAD17 is UNSAT
[2024-05-22 05:48:57] [INFO ] Deduced a trap composed of 6 places in 624 ms of which 3 ms to minimize.
Problem TDEAD20 is UNSAT
[2024-05-22 05:48:57] [INFO ] Deduced a trap composed of 6 places in 613 ms of which 2 ms to minimize.
Problem TDEAD23 is UNSAT
[2024-05-22 05:48:58] [INFO ] Deduced a trap composed of 7 places in 618 ms of which 2 ms to minimize.
Problem TDEAD27 is UNSAT
[2024-05-22 05:48:59] [INFO ] Deduced a trap composed of 6 places in 586 ms of which 2 ms to minimize.
Problem TDEAD30 is UNSAT
[2024-05-22 05:48:59] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 1 ms to minimize.
Problem TDEAD31 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 10/21 constraints. Problems are: Problem set: 10 solved, 816 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/21 constraints. Problems are: Problem set: 10 solved, 816 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD822 is UNSAT
At refinement iteration 4 (OVERLAPS) 826/903 variables, 77/98 constraints. Problems are: Problem set: 18 solved, 808 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/903 variables, 258/356 constraints. Problems are: Problem set: 18 solved, 808 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 903/904 variables, and 356 constraints, problems are : Problem set: 18 solved, 808 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 77/77 constraints, ReadFeed: 258/259 constraints, PredecessorRefiner: 826/826 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 18 solved, 808 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 18 solved, 808 unsolved
At refinement iteration 1 (OVERLAPS) 11/73 variables, 11/11 constraints. Problems are: Problem set: 18 solved, 808 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 10/21 constraints. Problems are: Problem set: 18 solved, 808 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/21 constraints. Problems are: Problem set: 18 solved, 808 unsolved
At refinement iteration 4 (OVERLAPS) 825/898 variables, 73/94 constraints. Problems are: Problem set: 18 solved, 808 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/898 variables, 258/352 constraints. Problems are: Problem set: 18 solved, 808 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 898/904 variables, and 1160 constraints, problems are : Problem set: 18 solved, 808 unsolved in 33496 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 73/77 constraints, ReadFeed: 258/259 constraints, PredecessorRefiner: 808/826 constraints, Known Traps: 10/10 constraints]
After SMT, in 81832ms problems are : Problem set: 18 solved, 808 unsolved
Search for dead transitions found 18 dead transitions in 81848ms
Found 18 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 18 transitions
Dead transitions reduction (with SMT) removed 18 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 77/78 places, 809/823 transitions.
Graph (complete) has 979 edges and 77 vertex of which 63 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.4 ms
Discarding 14 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 79 ms. Remains 63 /77 variables (removed 14) and now considering 809/809 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 63/78 places, 809/823 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 82159 ms. Remains : 63/78 places, 809/823 transitions.
Support contains 6 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 823/823 transitions.
Applied a total of 0 rules in 5 ms. Remains 78 /78 variables (removed 0) and now considering 823/823 (removed 0) transitions.
// Phase 1: matrix 823 rows 78 cols
[2024-05-22 05:49:50] [INFO ] Computed 11 invariants in 5 ms
[2024-05-22 05:49:50] [INFO ] Implicit Places using invariants in 331 ms returned []
[2024-05-22 05:49:50] [INFO ] Invariant cache hit.
[2024-05-22 05:49:50] [INFO ] State equation strengthened by 255 read => feed constraints.
[2024-05-22 05:49:51] [INFO ] Implicit Places using invariants and state equation in 814 ms returned []
Implicit Place search using SMT with State Equation took 1155 ms to find 0 implicit places.
Running 822 sub problems to find dead transitions.
[2024-05-22 05:49:51] [INFO ] Invariant cache hit.
[2024-05-22 05:49:51] [INFO ] State equation strengthened by 255 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (OVERLAPS) 1/78 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 3 (OVERLAPS) 822/900 variables, 78/89 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/900 variables, 254/343 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-22 05:50:34] [INFO ] Deduced a trap composed of 15 places in 758 ms of which 9 ms to minimize.
[2024-05-22 05:50:35] [INFO ] Deduced a trap composed of 22 places in 744 ms of which 1 ms to minimize.
[2024-05-22 05:50:36] [INFO ] Deduced a trap composed of 7 places in 816 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 900/901 variables, and 346 constraints, problems are : Problem set: 0 solved, 822 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 78/78 constraints, ReadFeed: 254/255 constraints, PredecessorRefiner: 822/822 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 822 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (OVERLAPS) 1/78 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 4 (OVERLAPS) 822/900 variables, 78/92 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/900 variables, 254/346 constraints. Problems are: Problem set: 0 solved, 822 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 900/901 variables, and 1168 constraints, problems are : Problem set: 0 solved, 822 unsolved in 33660 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 78/78 constraints, ReadFeed: 254/255 constraints, PredecessorRefiner: 822/822 constraints, Known Traps: 3/3 constraints]
After SMT, in 79599ms problems are : Problem set: 0 solved, 822 unsolved
Search for dead transitions found 0 dead transitions in 79618ms
Finished structural reductions in LTL mode , in 1 iterations and 80784 ms. Remains : 78/78 places, 823/823 transitions.
Treatment of property AutonomousCar-PT-09a-LTLFireability-02 finished in 494389 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 14 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 863/863 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 82 transition count 855
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 17 place count 74 transition count 854
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 73 transition count 854
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 18 place count 73 transition count 852
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 22 place count 71 transition count 852
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 27 place count 66 transition count 802
Iterating global reduction 3 with 5 rules applied. Total rules applied 32 place count 66 transition count 802
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 34 place count 65 transition count 801
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 36 place count 64 transition count 801
Applied a total of 36 rules in 98 ms. Remains 64 /82 variables (removed 18) and now considering 801/863 (removed 62) transitions.
// Phase 1: matrix 801 rows 64 cols
[2024-05-22 05:51:11] [INFO ] Computed 11 invariants in 5 ms
[2024-05-22 05:51:11] [INFO ] Implicit Places using invariants in 241 ms returned []
[2024-05-22 05:51:11] [INFO ] Invariant cache hit.
[2024-05-22 05:51:11] [INFO ] State equation strengthened by 248 read => feed constraints.
[2024-05-22 05:51:12] [INFO ] Implicit Places using invariants and state equation in 779 ms returned []
Implicit Place search using SMT with State Equation took 1024 ms to find 0 implicit places.
[2024-05-22 05:51:12] [INFO ] Redundant transitions in 43 ms returned []
Running 800 sub problems to find dead transitions.
[2024-05-22 05:51:12] [INFO ] Invariant cache hit.
[2024-05-22 05:51:12] [INFO ] State equation strengthened by 248 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 3 (OVERLAPS) 800/864 variables, 64/75 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/864 variables, 247/322 constraints. Problems are: Problem set: 0 solved, 800 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 864/865 variables, and 322 constraints, problems are : Problem set: 0 solved, 800 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 64/64 constraints, ReadFeed: 247/248 constraints, PredecessorRefiner: 800/800 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 800 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 3 (OVERLAPS) 800/864 variables, 64/75 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/864 variables, 247/322 constraints. Problems are: Problem set: 0 solved, 800 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 864/865 variables, and 1122 constraints, problems are : Problem set: 0 solved, 800 unsolved in 31872 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 64/64 constraints, ReadFeed: 247/248 constraints, PredecessorRefiner: 800/800 constraints, Known Traps: 0/0 constraints]
After SMT, in 77207ms problems are : Problem set: 0 solved, 800 unsolved
Search for dead transitions found 0 dead transitions in 77222ms
Starting structural reductions in SI_LTL mode, iteration 1 : 64/82 places, 801/863 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 78399 ms. Remains : 64/82 places, 801/863 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-09a-LTLFireability-03
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-09a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-09a-LTLFireability-03 finished in 78464 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 10 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 863/863 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 82 transition count 854
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 73 transition count 854
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 18 place count 73 transition count 852
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 22 place count 71 transition count 852
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 27 place count 66 transition count 802
Iterating global reduction 2 with 5 rules applied. Total rules applied 32 place count 66 transition count 802
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 34 place count 65 transition count 801
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 36 place count 64 transition count 801
Applied a total of 36 rules in 95 ms. Remains 64 /82 variables (removed 18) and now considering 801/863 (removed 62) transitions.
// Phase 1: matrix 801 rows 64 cols
[2024-05-22 05:52:29] [INFO ] Computed 11 invariants in 9 ms
[2024-05-22 05:52:30] [INFO ] Implicit Places using invariants in 361 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 364 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/82 places, 801/863 transitions.
Applied a total of 0 rules in 53 ms. Remains 63 /63 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 513 ms. Remains : 63/82 places, 801/863 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-09a-LTLFireability-06
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-09a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-09a-LTLFireability-06 finished in 623 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((F(p0)||X(p1)))))'
Support contains 15 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 863/863 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 82 transition count 856
Reduce places removed 7 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 9 rules applied. Total rules applied 16 place count 75 transition count 854
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 18 place count 73 transition count 854
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 18 place count 73 transition count 852
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 22 place count 71 transition count 852
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 27 place count 66 transition count 802
Iterating global reduction 3 with 5 rules applied. Total rules applied 32 place count 66 transition count 802
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 34 place count 65 transition count 802
Applied a total of 34 rules in 105 ms. Remains 65 /82 variables (removed 17) and now considering 802/863 (removed 61) transitions.
// Phase 1: matrix 802 rows 65 cols
[2024-05-22 05:52:30] [INFO ] Computed 11 invariants in 7 ms
[2024-05-22 05:52:30] [INFO ] Implicit Places using invariants in 209 ms returned []
[2024-05-22 05:52:30] [INFO ] Invariant cache hit.
[2024-05-22 05:52:30] [INFO ] State equation strengthened by 248 read => feed constraints.
[2024-05-22 05:52:31] [INFO ] Implicit Places using invariants and state equation in 719 ms returned []
Implicit Place search using SMT with State Equation took 931 ms to find 0 implicit places.
[2024-05-22 05:52:31] [INFO ] Redundant transitions in 30 ms returned []
Running 801 sub problems to find dead transitions.
[2024-05-22 05:52:31] [INFO ] Invariant cache hit.
[2024-05-22 05:52:31] [INFO ] State equation strengthened by 248 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 801 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 801 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 801 unsolved
At refinement iteration 3 (OVERLAPS) 801/866 variables, 65/76 constraints. Problems are: Problem set: 0 solved, 801 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/866 variables, 247/323 constraints. Problems are: Problem set: 0 solved, 801 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 866/867 variables, and 323 constraints, problems are : Problem set: 0 solved, 801 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 65/65 constraints, ReadFeed: 247/248 constraints, PredecessorRefiner: 801/801 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 801 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 801 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 801 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 801 unsolved
At refinement iteration 3 (OVERLAPS) 801/866 variables, 65/76 constraints. Problems are: Problem set: 0 solved, 801 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/866 variables, 247/323 constraints. Problems are: Problem set: 0 solved, 801 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 866/867 variables, and 1124 constraints, problems are : Problem set: 0 solved, 801 unsolved in 33395 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 65/65 constraints, ReadFeed: 247/248 constraints, PredecessorRefiner: 801/801 constraints, Known Traps: 0/0 constraints]
After SMT, in 79348ms problems are : Problem set: 0 solved, 801 unsolved
Search for dead transitions found 0 dead transitions in 79358ms
Starting structural reductions in SI_LTL mode, iteration 1 : 65/82 places, 802/863 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 80434 ms. Remains : 65/82 places, 802/863 transitions.
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-09a-LTLFireability-08
Product exploration explored 100000 steps with 3810 reset in 1046 ms.
Product exploration explored 100000 steps with 7757 reset in 1641 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 116 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 97 steps (5 resets) in 8 ms. (10 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 9 factoid took 252 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 15 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 802/802 transitions.
Applied a total of 0 rules in 86 ms. Remains 65 /65 variables (removed 0) and now considering 802/802 (removed 0) transitions.
[2024-05-22 05:53:54] [INFO ] Invariant cache hit.
[2024-05-22 05:53:54] [INFO ] Implicit Places using invariants in 228 ms returned []
[2024-05-22 05:53:54] [INFO ] Invariant cache hit.
[2024-05-22 05:53:54] [INFO ] State equation strengthened by 248 read => feed constraints.
[2024-05-22 05:53:55] [INFO ] Implicit Places using invariants and state equation in 775 ms returned []
Implicit Place search using SMT with State Equation took 1011 ms to find 0 implicit places.
[2024-05-22 05:53:55] [INFO ] Redundant transitions in 43 ms returned []
Running 801 sub problems to find dead transitions.
[2024-05-22 05:53:55] [INFO ] Invariant cache hit.
[2024-05-22 05:53:55] [INFO ] State equation strengthened by 248 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 801 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 801 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 801 unsolved
At refinement iteration 3 (OVERLAPS) 801/866 variables, 65/76 constraints. Problems are: Problem set: 0 solved, 801 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/866 variables, 247/323 constraints. Problems are: Problem set: 0 solved, 801 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 866/867 variables, and 323 constraints, problems are : Problem set: 0 solved, 801 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 65/65 constraints, ReadFeed: 247/248 constraints, PredecessorRefiner: 801/801 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 801 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 801 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 801 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 801 unsolved
At refinement iteration 3 (OVERLAPS) 801/866 variables, 65/76 constraints. Problems are: Problem set: 0 solved, 801 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/866 variables, 247/323 constraints. Problems are: Problem set: 0 solved, 801 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 866/867 variables, and 1124 constraints, problems are : Problem set: 0 solved, 801 unsolved in 33255 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 65/65 constraints, ReadFeed: 247/248 constraints, PredecessorRefiner: 801/801 constraints, Known Traps: 0/0 constraints]
After SMT, in 81783ms problems are : Problem set: 0 solved, 801 unsolved
Search for dead transitions found 0 dead transitions in 81798ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 82950 ms. Remains : 65/65 places, 802/802 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 108 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 379 steps (23 resets) in 11 ms. (31 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 9 factoid took 323 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 115 reset in 188 ms.
Product exploration explored 100000 steps with 344 reset in 296 ms.
Support contains 15 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 802/802 transitions.
Applied a total of 0 rules in 84 ms. Remains 65 /65 variables (removed 0) and now considering 802/802 (removed 0) transitions.
[2024-05-22 05:55:18] [INFO ] Invariant cache hit.
[2024-05-22 05:55:18] [INFO ] Implicit Places using invariants in 274 ms returned []
[2024-05-22 05:55:18] [INFO ] Invariant cache hit.
[2024-05-22 05:55:19] [INFO ] State equation strengthened by 248 read => feed constraints.
[2024-05-22 05:55:19] [INFO ] Implicit Places using invariants and state equation in 767 ms returned []
Implicit Place search using SMT with State Equation took 1043 ms to find 0 implicit places.
[2024-05-22 05:55:19] [INFO ] Redundant transitions in 38 ms returned []
Running 801 sub problems to find dead transitions.
[2024-05-22 05:55:19] [INFO ] Invariant cache hit.
[2024-05-22 05:55:19] [INFO ] State equation strengthened by 248 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 801 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 801 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 801 unsolved
At refinement iteration 3 (OVERLAPS) 801/866 variables, 65/76 constraints. Problems are: Problem set: 0 solved, 801 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/866 variables, 247/323 constraints. Problems are: Problem set: 0 solved, 801 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 866/867 variables, and 323 constraints, problems are : Problem set: 0 solved, 801 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 65/65 constraints, ReadFeed: 247/248 constraints, PredecessorRefiner: 801/801 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 801 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 801 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 801 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 801 unsolved
At refinement iteration 3 (OVERLAPS) 801/866 variables, 65/76 constraints. Problems are: Problem set: 0 solved, 801 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/866 variables, 247/323 constraints. Problems are: Problem set: 0 solved, 801 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 866/867 variables, and 1124 constraints, problems are : Problem set: 0 solved, 801 unsolved in 32009 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 65/65 constraints, ReadFeed: 247/248 constraints, PredecessorRefiner: 801/801 constraints, Known Traps: 0/0 constraints]
After SMT, in 79508ms problems are : Problem set: 0 solved, 801 unsolved
Search for dead transitions found 0 dead transitions in 79522ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 80701 ms. Remains : 65/65 places, 802/802 transitions.
Treatment of property AutonomousCar-PT-09a-LTLFireability-08 finished in 248992 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&&X(p1)))))'
Support contains 6 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 863/863 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 79 transition count 833
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 79 transition count 833
Applied a total of 6 rules in 8 ms. Remains 79 /82 variables (removed 3) and now considering 833/863 (removed 30) transitions.
// Phase 1: matrix 833 rows 79 cols
[2024-05-22 05:56:39] [INFO ] Computed 11 invariants in 4 ms
[2024-05-22 05:56:39] [INFO ] Implicit Places using invariants in 470 ms returned []
[2024-05-22 05:56:39] [INFO ] Invariant cache hit.
[2024-05-22 05:56:40] [INFO ] State equation strengthened by 264 read => feed constraints.
[2024-05-22 05:56:40] [INFO ] Implicit Places using invariants and state equation in 1029 ms returned []
Implicit Place search using SMT with State Equation took 1501 ms to find 0 implicit places.
Running 832 sub problems to find dead transitions.
[2024-05-22 05:56:40] [INFO ] Invariant cache hit.
[2024-05-22 05:56:40] [INFO ] State equation strengthened by 264 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 832 unsolved
At refinement iteration 1 (OVERLAPS) 1/79 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 832 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 832 unsolved
At refinement iteration 3 (OVERLAPS) 832/911 variables, 79/90 constraints. Problems are: Problem set: 0 solved, 832 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/911 variables, 263/353 constraints. Problems are: Problem set: 0 solved, 832 unsolved
[2024-05-22 05:57:26] [INFO ] Deduced a trap composed of 15 places in 663 ms of which 2 ms to minimize.
[2024-05-22 05:57:27] [INFO ] Deduced a trap composed of 22 places in 804 ms of which 2 ms to minimize.
[2024-05-22 05:57:28] [INFO ] Deduced a trap composed of 7 places in 795 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 911/912 variables, and 356 constraints, problems are : Problem set: 0 solved, 832 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 79/79 constraints, ReadFeed: 263/264 constraints, PredecessorRefiner: 832/832 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 832 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 832 unsolved
At refinement iteration 1 (OVERLAPS) 1/79 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 832 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 832 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 832 unsolved
At refinement iteration 4 (OVERLAPS) 832/911 variables, 79/93 constraints. Problems are: Problem set: 0 solved, 832 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/911 variables, 263/356 constraints. Problems are: Problem set: 0 solved, 832 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 911/912 variables, and 1188 constraints, problems are : Problem set: 0 solved, 832 unsolved in 33303 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 79/79 constraints, ReadFeed: 263/264 constraints, PredecessorRefiner: 832/832 constraints, Known Traps: 3/3 constraints]
After SMT, in 81034ms problems are : Problem set: 0 solved, 832 unsolved
Search for dead transitions found 0 dead transitions in 81050ms
Starting structural reductions in LTL mode, iteration 1 : 79/82 places, 833/863 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 82569 ms. Remains : 79/82 places, 833/863 transitions.
Stuttering acceptance computed with spot in 170 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-09a-LTLFireability-09
Product exploration explored 100000 steps with 33333 reset in 4803 ms.
Product exploration explored 100000 steps with 33333 reset in 4401 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 93 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-09a-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-09a-LTLFireability-09 finished in 92074 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0 U (p1||X(p2))))&&F(p0)))'
Support contains 15 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 863/863 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 78 transition count 823
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 78 transition count 823
Applied a total of 8 rules in 7 ms. Remains 78 /82 variables (removed 4) and now considering 823/863 (removed 40) transitions.
// Phase 1: matrix 823 rows 78 cols
[2024-05-22 05:58:11] [INFO ] Computed 11 invariants in 4 ms
[2024-05-22 05:58:11] [INFO ] Implicit Places using invariants in 279 ms returned []
[2024-05-22 05:58:11] [INFO ] Invariant cache hit.
[2024-05-22 05:58:11] [INFO ] State equation strengthened by 255 read => feed constraints.
[2024-05-22 05:58:12] [INFO ] Implicit Places using invariants and state equation in 593 ms returned []
Implicit Place search using SMT with State Equation took 901 ms to find 0 implicit places.
Running 822 sub problems to find dead transitions.
[2024-05-22 05:58:12] [INFO ] Invariant cache hit.
[2024-05-22 05:58:12] [INFO ] State equation strengthened by 255 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (OVERLAPS) 1/78 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 3 (OVERLAPS) 822/900 variables, 78/89 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/900 variables, 254/343 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-22 05:58:58] [INFO ] Deduced a trap composed of 15 places in 714 ms of which 2 ms to minimize.
[2024-05-22 05:58:59] [INFO ] Deduced a trap composed of 22 places in 857 ms of which 2 ms to minimize.
SMT process timed out in 46954ms, After SMT, problems are : Problem set: 0 solved, 822 unsolved
Search for dead transitions found 0 dead transitions in 46965ms
Starting structural reductions in LTL mode, iteration 1 : 78/82 places, 823/863 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47879 ms. Remains : 78/82 places, 823/863 transitions.
Stuttering acceptance computed with spot in 374 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p2), (AND (NOT p1) (NOT p2)), true]
Running random walk in product with property : AutonomousCar-PT-09a-LTLFireability-10
Stuttering criterion allowed to conclude after 24 steps with 2 reset in 1 ms.
FORMULA AutonomousCar-PT-09a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-09a-LTLFireability-10 finished in 48275 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 10 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 863/863 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 77 transition count 813
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 77 transition count 813
Applied a total of 10 rules in 11 ms. Remains 77 /82 variables (removed 5) and now considering 813/863 (removed 50) transitions.
// Phase 1: matrix 813 rows 77 cols
[2024-05-22 05:58:59] [INFO ] Computed 11 invariants in 7 ms
[2024-05-22 05:59:00] [INFO ] Implicit Places using invariants in 550 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 555 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 76/82 places, 813/863 transitions.
Applied a total of 0 rules in 5 ms. Remains 76 /76 variables (removed 0) and now considering 813/813 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 572 ms. Remains : 76/82 places, 813/863 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-09a-LTLFireability-11
Stuttering criterion allowed to conclude after 16 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-09a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-09a-LTLFireability-11 finished in 689 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 863/863 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 80 transition count 851
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 23 place count 69 transition count 851
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 23 place count 69 transition count 850
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 25 place count 68 transition count 850
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 29 place count 64 transition count 810
Iterating global reduction 2 with 4 rules applied. Total rules applied 33 place count 64 transition count 810
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 37 place count 62 transition count 808
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 39 place count 61 transition count 808
Applied a total of 39 rules in 115 ms. Remains 61 /82 variables (removed 21) and now considering 808/863 (removed 55) transitions.
// Phase 1: matrix 808 rows 61 cols
[2024-05-22 05:59:00] [INFO ] Computed 10 invariants in 3 ms
[2024-05-22 05:59:00] [INFO ] Implicit Places using invariants in 318 ms returned []
[2024-05-22 05:59:00] [INFO ] Invariant cache hit.
[2024-05-22 05:59:01] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 05:59:01] [INFO ] Implicit Places using invariants and state equation in 862 ms returned []
Implicit Place search using SMT with State Equation took 1182 ms to find 0 implicit places.
[2024-05-22 05:59:01] [INFO ] Redundant transitions in 43 ms returned []
Running 807 sub problems to find dead transitions.
[2024-05-22 05:59:01] [INFO ] Invariant cache hit.
[2024-05-22 05:59:01] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 807 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 807 unsolved
At refinement iteration 2 (OVERLAPS) 807/868 variables, 61/71 constraints. Problems are: Problem set: 0 solved, 807 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/868 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 807 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 868/869 variables, and 72 constraints, problems are : Problem set: 0 solved, 807 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 61/61 constraints, ReadFeed: 1/2 constraints, PredecessorRefiner: 807/807 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 807 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 807 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 807 unsolved
At refinement iteration 2 (OVERLAPS) 807/868 variables, 61/71 constraints. Problems are: Problem set: 0 solved, 807 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/868 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 807 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 868/869 variables, and 879 constraints, problems are : Problem set: 0 solved, 807 unsolved in 32712 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 61/61 constraints, ReadFeed: 1/2 constraints, PredecessorRefiner: 807/807 constraints, Known Traps: 0/0 constraints]
After SMT, in 81799ms problems are : Problem set: 0 solved, 807 unsolved
Search for dead transitions found 0 dead transitions in 81814ms
Starting structural reductions in SI_LTL mode, iteration 1 : 61/82 places, 808/863 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 83175 ms. Remains : 61/82 places, 808/863 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-09a-LTLFireability-12
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-09a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-09a-LTLFireability-12 finished in 83231 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)||G((p1||G(p2))))))'
Support contains 16 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 863/863 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 77 transition count 813
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 77 transition count 813
Applied a total of 10 rules in 7 ms. Remains 77 /82 variables (removed 5) and now considering 813/863 (removed 50) transitions.
// Phase 1: matrix 813 rows 77 cols
[2024-05-22 06:00:23] [INFO ] Computed 11 invariants in 3 ms
[2024-05-22 06:00:23] [INFO ] Implicit Places using invariants in 173 ms returned []
[2024-05-22 06:00:23] [INFO ] Invariant cache hit.
[2024-05-22 06:00:24] [INFO ] State equation strengthened by 246 read => feed constraints.
[2024-05-22 06:00:24] [INFO ] Implicit Places using invariants and state equation in 686 ms returned []
Implicit Place search using SMT with State Equation took 871 ms to find 0 implicit places.
Running 812 sub problems to find dead transitions.
[2024-05-22 06:00:24] [INFO ] Invariant cache hit.
[2024-05-22 06:00:24] [INFO ] State equation strengthened by 246 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 812 unsolved
At refinement iteration 1 (OVERLAPS) 1/77 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 812 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 812 unsolved
At refinement iteration 3 (OVERLAPS) 812/889 variables, 77/88 constraints. Problems are: Problem set: 0 solved, 812 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/889 variables, 245/333 constraints. Problems are: Problem set: 0 solved, 812 unsolved
[2024-05-22 06:01:08] [INFO ] Deduced a trap composed of 15 places in 622 ms of which 2 ms to minimize.
[2024-05-22 06:01:09] [INFO ] Deduced a trap composed of 22 places in 861 ms of which 2 ms to minimize.
[2024-05-22 06:01:10] [INFO ] Deduced a trap composed of 7 places in 800 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 889/890 variables, and 336 constraints, problems are : Problem set: 0 solved, 812 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 77/77 constraints, ReadFeed: 245/246 constraints, PredecessorRefiner: 812/812 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 812 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 812 unsolved
At refinement iteration 1 (OVERLAPS) 1/77 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 812 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 812 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 812 unsolved
At refinement iteration 4 (OVERLAPS) 812/889 variables, 77/91 constraints. Problems are: Problem set: 0 solved, 812 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/889 variables, 245/336 constraints. Problems are: Problem set: 0 solved, 812 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 889/890 variables, and 1148 constraints, problems are : Problem set: 0 solved, 812 unsolved in 33668 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 77/77 constraints, ReadFeed: 245/246 constraints, PredecessorRefiner: 812/812 constraints, Known Traps: 3/3 constraints]
After SMT, in 81261ms problems are : Problem set: 0 solved, 812 unsolved
Search for dead transitions found 0 dead transitions in 81277ms
Starting structural reductions in LTL mode, iteration 1 : 77/82 places, 813/863 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 82160 ms. Remains : 77/82 places, 813/863 transitions.
Stuttering acceptance computed with spot in 223 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-09a-LTLFireability-14
Stuttering criterion allowed to conclude after 16 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-09a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-09a-LTLFireability-14 finished in 82404 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 10 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 863/863 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 82 transition count 854
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 73 transition count 854
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 18 place count 73 transition count 852
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 22 place count 71 transition count 852
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 27 place count 66 transition count 802
Iterating global reduction 2 with 5 rules applied. Total rules applied 32 place count 66 transition count 802
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 34 place count 65 transition count 801
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 36 place count 64 transition count 801
Applied a total of 36 rules in 156 ms. Remains 64 /82 variables (removed 18) and now considering 801/863 (removed 62) transitions.
// Phase 1: matrix 801 rows 64 cols
[2024-05-22 06:01:46] [INFO ] Computed 11 invariants in 8 ms
[2024-05-22 06:01:46] [INFO ] Implicit Places using invariants in 553 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 567 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/82 places, 801/863 transitions.
Applied a total of 0 rules in 74 ms. Remains 63 /63 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 800 ms. Remains : 63/82 places, 801/863 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-09a-LTLFireability-15
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-09a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-09a-LTLFireability-15 finished in 918 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)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X((G(p1)||X(G(p2))))||p0))))'
Found a Lengthening insensitive property : AutonomousCar-PT-09a-LTLFireability-02
Stuttering acceptance computed with spot in 227 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p1)]
Support contains 6 out of 82 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 82/82 places, 863/863 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 82 transition count 852
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 71 transition count 852
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 22 place count 71 transition count 851
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 24 place count 70 transition count 851
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 28 place count 66 transition count 811
Iterating global reduction 2 with 4 rules applied. Total rules applied 32 place count 66 transition count 811
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 36 place count 64 transition count 809
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 38 place count 63 transition count 809
Applied a total of 38 rules in 148 ms. Remains 63 /82 variables (removed 19) and now considering 809/863 (removed 54) transitions.
// Phase 1: matrix 809 rows 63 cols
[2024-05-22 06:01:47] [INFO ] Computed 11 invariants in 4 ms
[2024-05-22 06:01:47] [INFO ] Implicit Places using invariants in 323 ms returned []
[2024-05-22 06:01:47] [INFO ] Invariant cache hit.
[2024-05-22 06:01:48] [INFO ] State equation strengthened by 257 read => feed constraints.
[2024-05-22 06:01:48] [INFO ] Implicit Places using invariants and state equation in 719 ms returned []
Implicit Place search using SMT with State Equation took 1057 ms to find 0 implicit places.
Running 808 sub problems to find dead transitions.
[2024-05-22 06:01:48] [INFO ] Invariant cache hit.
[2024-05-22 06:01:48] [INFO ] State equation strengthened by 257 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 808 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 808 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 808 unsolved
At refinement iteration 3 (OVERLAPS) 808/871 variables, 63/74 constraints. Problems are: Problem set: 0 solved, 808 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/871 variables, 256/330 constraints. Problems are: Problem set: 0 solved, 808 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 871/872 variables, and 330 constraints, problems are : Problem set: 0 solved, 808 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 63/63 constraints, ReadFeed: 256/257 constraints, PredecessorRefiner: 808/808 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 808 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 808 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 808 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 808 unsolved
At refinement iteration 3 (OVERLAPS) 808/871 variables, 63/74 constraints. Problems are: Problem set: 0 solved, 808 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/871 variables, 256/330 constraints. Problems are: Problem set: 0 solved, 808 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 871/872 variables, and 1138 constraints, problems are : Problem set: 0 solved, 808 unsolved in 33579 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 63/63 constraints, ReadFeed: 256/257 constraints, PredecessorRefiner: 808/808 constraints, Known Traps: 0/0 constraints]
After SMT, in 83374ms problems are : Problem set: 0 solved, 808 unsolved
Search for dead transitions found 0 dead transitions in 83383ms
Starting structural reductions in LI_LTL mode, iteration 1 : 63/82 places, 809/863 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 84590 ms. Remains : 63/82 places, 809/863 transitions.
Running random walk in product with property : AutonomousCar-PT-09a-LTLFireability-02
Product exploration explored 100000 steps with 787 reset in 421 ms.
Product exploration explored 100000 steps with 1169 reset in 346 ms.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 88 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 7 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 220 ms :[true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 40000 steps (2515 resets) in 866 ms. (46 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (174 resets) in 107 ms. (370 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (134 resets) in 185 ms. (215 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (123 resets) in 218 ms. (182 steps per ms) remains 3/3 properties
[2024-05-22 06:03:13] [INFO ] Invariant cache hit.
[2024-05-22 06:03:13] [INFO ] State equation strengthened by 257 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 13/19 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 40/59 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 806/865 variables, 59/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/865 variables, 256/326 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/865 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 6/871 variables, 4/330 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/871 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/872 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/872 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/872 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 872/872 variables, and 331 constraints, problems are : Problem set: 0 solved, 3 unsolved in 673 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 63/63 constraints, ReadFeed: 257/257 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf0 is UNSAT
At refinement iteration 1 (OVERLAPS) 13/19 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 40/59 variables, 8/11 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 806/865 variables, 59/70 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/865 variables, 256/326 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/865 variables, 0/326 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 6/871 variables, 4/330 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/871 variables, 2/332 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/871 variables, 0/332 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/872 variables, 1/333 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/872 variables, 0/333 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/872 variables, 0/333 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 872/872 variables, and 333 constraints, problems are : Problem set: 1 solved, 2 unsolved in 1871 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 63/63 constraints, ReadFeed: 257/257 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 2636ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 995 ms.
Support contains 6 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 809/809 transitions.
Graph (complete) has 935 edges and 63 vertex of which 62 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 62 transition count 806
Free-agglomeration rule applied 9 times.
Iterating global reduction 1 with 9 rules applied. Total rules applied 12 place count 62 transition count 797
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 102 place count 53 transition count 716
Applied a total of 102 rules in 155 ms. Remains 53 /63 variables (removed 10) and now considering 716/809 (removed 93) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 155 ms. Remains : 53/63 places, 716/809 transitions.
RANDOM walk for 40000 steps (193 resets) in 2319 ms. (17 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (173 resets) in 106 ms. (373 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (174 resets) in 85 ms. (465 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 571839 steps, run timeout after 3001 ms. (steps per millisecond=190 ) properties seen :0 out of 2
Probabilistic random walk after 571839 steps, saw 72772 distinct states, run finished after 3001 ms. (steps per millisecond=190 ) properties seen :0
// Phase 1: matrix 716 rows 53 cols
[2024-05-22 06:03:21] [INFO ] Computed 12 invariants in 4 ms
[2024-05-22 06:03:21] [INFO ] State equation strengthened by 175 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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 12/18 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 32/50 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/53 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 716/769 variables, 53/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/769 variables, 175/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/769 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/769 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 769/769 variables, and 240 constraints, problems are : Problem set: 0 solved, 2 unsolved in 338 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 53/53 constraints, ReadFeed: 175/175 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 12/18 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 32/50 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/53 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 716/769 variables, 53/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/769 variables, 175/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/769 variables, 2/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/769 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/769 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 769/769 variables, and 242 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1221 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 53/53 constraints, ReadFeed: 175/175 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1601ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 748 ms.
Support contains 6 out of 53 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 53/53 places, 716/716 transitions.
Applied a total of 0 rules in 35 ms. Remains 53 /53 variables (removed 0) and now considering 716/716 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 53/53 places, 716/716 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 53/53 places, 716/716 transitions.
Applied a total of 0 rules in 34 ms. Remains 53 /53 variables (removed 0) and now considering 716/716 (removed 0) transitions.
[2024-05-22 06:03:23] [INFO ] Invariant cache hit.
[2024-05-22 06:03:23] [INFO ] Implicit Places using invariants in 284 ms returned []
[2024-05-22 06:03:23] [INFO ] Invariant cache hit.
[2024-05-22 06:03:24] [INFO ] State equation strengthened by 175 read => feed constraints.
[2024-05-22 06:03:24] [INFO ] Implicit Places using invariants and state equation in 877 ms returned []
Implicit Place search using SMT with State Equation took 1164 ms to find 0 implicit places.
[2024-05-22 06:03:24] [INFO ] Redundant transitions in 20 ms returned []
Running 715 sub problems to find dead transitions.
[2024-05-22 06:03:24] [INFO ] Invariant cache hit.
[2024-05-22 06:03:24] [INFO ] State equation strengthened by 175 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 4 (OVERLAPS) 716/769 variables, 53/65 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/769 variables, 175/240 constraints. Problems are: Problem set: 0 solved, 715 unsolved
[2024-05-22 06:04:03] [INFO ] Deduced a trap composed of 21 places in 497 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/769 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 715 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 769/769 variables, and 241 constraints, problems are : Problem set: 0 solved, 715 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 53/53 constraints, ReadFeed: 175/175 constraints, PredecessorRefiner: 715/715 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 715 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 5 (OVERLAPS) 716/769 variables, 53/66 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/769 variables, 175/241 constraints. Problems are: Problem set: 0 solved, 715 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 769/769 variables, and 956 constraints, problems are : Problem set: 0 solved, 715 unsolved in 32851 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 53/53 constraints, ReadFeed: 175/175 constraints, PredecessorRefiner: 715/715 constraints, Known Traps: 1/1 constraints]
After SMT, in 78636ms problems are : Problem set: 0 solved, 715 unsolved
Search for dead transitions found 0 dead transitions in 78651ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79879 ms. Remains : 53/53 places, 716/716 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 44 ms. Remains 53 /53 variables (removed 0) and now considering 716/716 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-05-22 06:04:43] [INFO ] Invariant cache hit.
[2024-05-22 06:04:43] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 06:04:43] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-22 06:04:43] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 4 ms returned sat
[2024-05-22 06:04:43] [INFO ] After 411ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-22 06:04:44] [INFO ] After 621ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-22 06:04:44] [INFO ] After 866ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 989 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 p2), (X p0), (X (X p0)), (X (X p1)), (G (OR p2 p1))]
False Knowledge obtained : [(F (NOT (AND p2 p1))), (F (NOT (OR p2 (NOT p1)))), (F (NOT p2))]
Knowledge based reduction with 5 factoid took 218 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 226 ms :[true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 225 ms :[true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Support contains 6 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 809/809 transitions.
Applied a total of 0 rules in 4 ms. Remains 63 /63 variables (removed 0) and now considering 809/809 (removed 0) transitions.
// Phase 1: matrix 809 rows 63 cols
[2024-05-22 06:04:44] [INFO ] Computed 11 invariants in 5 ms
[2024-05-22 06:04:45] [INFO ] Implicit Places using invariants in 329 ms returned []
[2024-05-22 06:04:45] [INFO ] Invariant cache hit.
[2024-05-22 06:04:45] [INFO ] State equation strengthened by 257 read => feed constraints.
[2024-05-22 06:04:46] [INFO ] Implicit Places using invariants and state equation in 699 ms returned []
Implicit Place search using SMT with State Equation took 1055 ms to find 0 implicit places.
Running 808 sub problems to find dead transitions.
[2024-05-22 06:04:46] [INFO ] Invariant cache hit.
[2024-05-22 06:04:46] [INFO ] State equation strengthened by 257 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 808 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 808 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 808 unsolved
At refinement iteration 3 (OVERLAPS) 808/871 variables, 63/74 constraints. Problems are: Problem set: 0 solved, 808 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/871 variables, 256/330 constraints. Problems are: Problem set: 0 solved, 808 unsolved
[2024-05-22 06:05:34] [INFO ] Deduced a trap composed of 21 places in 788 ms of which 2 ms to minimize.
SMT process timed out in 48815ms, After SMT, problems are : Problem set: 0 solved, 808 unsolved
Search for dead transitions found 0 dead transitions in 48828ms
Finished structural reductions in LTL mode , in 1 iterations and 49891 ms. Remains : 63/63 places, 809/809 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 : [(AND p2 p1 p0), (X p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 123 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 302 ms :[true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (2479 resets) in 1176 ms. (33 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (125 resets) in 85 ms. (465 steps per ms) remains 1/1 properties
[2024-05-22 06:05:35] [INFO ] Invariant cache hit.
[2024-05-22 06:05:35] [INFO ] State equation strengthened by 257 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/19 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/59 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 806/865 variables, 59/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/865 variables, 256/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/865 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/871 variables, 4/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/871 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/872 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/872 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/872 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 872/872 variables, and 331 constraints, problems are : Problem set: 0 solved, 1 unsolved in 434 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 63/63 constraints, ReadFeed: 257/257 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/19 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/59 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 806/865 variables, 59/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/865 variables, 256/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/865 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/871 variables, 4/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/871 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/871 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/872 variables, 1/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/872 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/872 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 872/872 variables, and 332 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1058 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 63/63 constraints, ReadFeed: 257/257 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1525ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 613 ms.
Support contains 4 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 809/809 transitions.
Graph (complete) has 935 edges and 63 vertex of which 62 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 62 transition count 806
Free-agglomeration rule applied 9 times.
Iterating global reduction 1 with 9 rules applied. Total rules applied 12 place count 62 transition count 797
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 102 place count 53 transition count 716
Applied a total of 102 rules in 89 ms. Remains 53 /63 variables (removed 10) and now considering 716/809 (removed 93) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 53/63 places, 716/809 transitions.
RANDOM walk for 40000 steps (175 resets) in 522 ms. (76 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (173 resets) in 64 ms. (615 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 954062 steps, run timeout after 3001 ms. (steps per millisecond=317 ) properties seen :0 out of 1
Probabilistic random walk after 954062 steps, saw 117950 distinct states, run finished after 3004 ms. (steps per millisecond=317 ) properties seen :0
// Phase 1: matrix 716 rows 53 cols
[2024-05-22 06:05:41] [INFO ] Computed 12 invariants in 3 ms
[2024-05-22 06:05:41] [INFO ] State equation strengthened by 175 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/18 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 32/50 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/53 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 716/769 variables, 53/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/769 variables, 175/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/769 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/769 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 769/769 variables, and 240 constraints, problems are : Problem set: 0 solved, 1 unsolved in 392 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 53/53 constraints, ReadFeed: 175/175 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/18 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 32/50 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/53 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 716/769 variables, 53/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/769 variables, 175/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/769 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/769 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/769 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 769/769 variables, and 241 constraints, problems are : Problem set: 0 solved, 1 unsolved in 906 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 53/53 constraints, ReadFeed: 175/175 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1338ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 271 ms.
Support contains 4 out of 53 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 53/53 places, 716/716 transitions.
Applied a total of 0 rules in 37 ms. Remains 53 /53 variables (removed 0) and now considering 716/716 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 53/53 places, 716/716 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 53/53 places, 716/716 transitions.
Applied a total of 0 rules in 36 ms. Remains 53 /53 variables (removed 0) and now considering 716/716 (removed 0) transitions.
[2024-05-22 06:05:42] [INFO ] Invariant cache hit.
[2024-05-22 06:05:43] [INFO ] Implicit Places using invariants in 428 ms returned []
[2024-05-22 06:05:43] [INFO ] Invariant cache hit.
[2024-05-22 06:05:43] [INFO ] State equation strengthened by 175 read => feed constraints.
[2024-05-22 06:05:44] [INFO ] Implicit Places using invariants and state equation in 887 ms returned []
Implicit Place search using SMT with State Equation took 1320 ms to find 0 implicit places.
[2024-05-22 06:05:44] [INFO ] Redundant transitions in 20 ms returned []
Running 715 sub problems to find dead transitions.
[2024-05-22 06:05:44] [INFO ] Invariant cache hit.
[2024-05-22 06:05:44] [INFO ] State equation strengthened by 175 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 4 (OVERLAPS) 716/769 variables, 53/65 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/769 variables, 175/240 constraints. Problems are: Problem set: 0 solved, 715 unsolved
[2024-05-22 06:06:18] [INFO ] Deduced a trap composed of 21 places in 708 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/769 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 715 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 769/769 variables, and 241 constraints, problems are : Problem set: 0 solved, 715 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 53/53 constraints, ReadFeed: 175/175 constraints, PredecessorRefiner: 715/715 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 715 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 5 (OVERLAPS) 716/769 variables, 53/66 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/769 variables, 175/241 constraints. Problems are: Problem set: 0 solved, 715 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 769/769 variables, and 956 constraints, problems are : Problem set: 0 solved, 715 unsolved in 31251 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 53/53 constraints, ReadFeed: 175/175 constraints, PredecessorRefiner: 715/715 constraints, Known Traps: 1/1 constraints]
After SMT, in 75192ms problems are : Problem set: 0 solved, 715 unsolved
Search for dead transitions found 0 dead transitions in 75206ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76594 ms. Remains : 53/53 places, 716/716 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 34 ms. Remains 53 /53 variables (removed 0) and now considering 716/716 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-22 06:06:59] [INFO ] Invariant cache hit.
[2024-05-22 06:06:59] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 06:06:59] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-22 06:06:59] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 06:06:59] [INFO ] After 302ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 06:06:59] [INFO ] After 400ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 06:06:59] [INFO ] After 537ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 619 ms.
Knowledge obtained : [(AND p2 p1 p0), (X p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT (AND p2 p1)))]
Knowledge based reduction with 4 factoid took 165 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 269 ms :[true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 438 ms :[true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 324 ms :[true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 322 reset in 253 ms.
Product exploration explored 100000 steps with 286 reset in 258 ms.
Applying partial POR strategy [true, true, true, false, false, false, false]
Stuttering acceptance computed with spot in 323 ms :[true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Support contains 6 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 809/809 transitions.
Applied a total of 0 rules in 115 ms. Remains 63 /63 variables (removed 0) and now considering 809/809 (removed 0) transitions.
[2024-05-22 06:07:02] [INFO ] Redundant transitions in 41 ms returned []
Running 808 sub problems to find dead transitions.
// Phase 1: matrix 809 rows 63 cols
[2024-05-22 06:07:02] [INFO ] Computed 11 invariants in 7 ms
[2024-05-22 06:07:02] [INFO ] State equation strengthened by 257 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 808 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 808 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 808 unsolved
At refinement iteration 3 (OVERLAPS) 808/871 variables, 63/74 constraints. Problems are: Problem set: 0 solved, 808 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/871 variables, 256/330 constraints. Problems are: Problem set: 0 solved, 808 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 871/872 variables, and 330 constraints, problems are : Problem set: 0 solved, 808 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 63/63 constraints, ReadFeed: 256/257 constraints, PredecessorRefiner: 808/808 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 808 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 808 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 808 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 808 unsolved
At refinement iteration 3 (OVERLAPS) 808/871 variables, 63/74 constraints. Problems are: Problem set: 0 solved, 808 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/871 variables, 256/330 constraints. Problems are: Problem set: 0 solved, 808 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 871/872 variables, and 1138 constraints, problems are : Problem set: 0 solved, 808 unsolved in 32398 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 63/63 constraints, ReadFeed: 256/257 constraints, PredecessorRefiner: 808/808 constraints, Known Traps: 0/0 constraints]
After SMT, in 81753ms problems are : Problem set: 0 solved, 808 unsolved
Search for dead transitions found 0 dead transitions in 81768ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 81936 ms. Remains : 63/63 places, 809/809 transitions.
Support contains 6 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 809/809 transitions.
Applied a total of 0 rules in 3 ms. Remains 63 /63 variables (removed 0) and now considering 809/809 (removed 0) transitions.
[2024-05-22 06:08:24] [INFO ] Invariant cache hit.
[2024-05-22 06:08:24] [INFO ] Implicit Places using invariants in 337 ms returned []
[2024-05-22 06:08:24] [INFO ] Invariant cache hit.
[2024-05-22 06:08:24] [INFO ] State equation strengthened by 257 read => feed constraints.
[2024-05-22 06:08:25] [INFO ] Implicit Places using invariants and state equation in 923 ms returned []
Implicit Place search using SMT with State Equation took 1264 ms to find 0 implicit places.
Running 808 sub problems to find dead transitions.
[2024-05-22 06:08:25] [INFO ] Invariant cache hit.
[2024-05-22 06:08:25] [INFO ] State equation strengthened by 257 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 808 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 808 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 808 unsolved
At refinement iteration 3 (OVERLAPS) 808/871 variables, 63/74 constraints. Problems are: Problem set: 0 solved, 808 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/871 variables, 256/330 constraints. Problems are: Problem set: 0 solved, 808 unsolved
[2024-05-22 06:09:13] [INFO ] Deduced a trap composed of 21 places in 786 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 871/872 variables, and 331 constraints, problems are : Problem set: 0 solved, 808 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 63/63 constraints, ReadFeed: 256/257 constraints, PredecessorRefiner: 808/808 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 808 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 808 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 808 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 808 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 808 unsolved
At refinement iteration 4 (OVERLAPS) 808/871 variables, 63/75 constraints. Problems are: Problem set: 0 solved, 808 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/871 variables, 256/331 constraints. Problems are: Problem set: 0 solved, 808 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 871/872 variables, and 1139 constraints, problems are : Problem set: 0 solved, 808 unsolved in 32914 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 63/63 constraints, ReadFeed: 256/257 constraints, PredecessorRefiner: 808/808 constraints, Known Traps: 1/1 constraints]
After SMT, in 80893ms problems are : Problem set: 0 solved, 808 unsolved
Search for dead transitions found 0 dead transitions in 80902ms
Finished structural reductions in LTL mode , in 1 iterations and 82172 ms. Remains : 63/63 places, 809/809 transitions.
Treatment of property AutonomousCar-PT-09a-LTLFireability-02 finished in 479436 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((F(p0)||X(p1)))))'
[2024-05-22 06:09:46] [INFO ] Flatten gal took : 198 ms
[2024-05-22 06:09:46] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2024-05-22 06:09:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 82 places, 863 transitions and 12692 arcs took 39 ms.
Total runtime 1903355 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running AutonomousCar-PT-09a

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 82
TRANSITIONS: 863
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.068s, Sys 0.015s]


SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.007s, 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: 2108
MODEL NAME: /home/mcc/execution/412/model
82 places, 863 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA AutonomousCar-PT-09a-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-09a-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-09a-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716358371223

--------------------
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-09a"
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-09a, 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-171620166400348"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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