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.r069-tall-171620503600020.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 CANConstruction-PT-020, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-tall-171620503600020
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 9.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 19:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Apr 12 19:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Apr 12 19:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 12 19:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:31 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 641K 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 CANConstruction-PT-020-LTLFireability-00
FORMULA_NAME CANConstruction-PT-020-LTLFireability-01
FORMULA_NAME CANConstruction-PT-020-LTLFireability-02
FORMULA_NAME CANConstruction-PT-020-LTLFireability-03
FORMULA_NAME CANConstruction-PT-020-LTLFireability-04
FORMULA_NAME CANConstruction-PT-020-LTLFireability-05
FORMULA_NAME CANConstruction-PT-020-LTLFireability-06
FORMULA_NAME CANConstruction-PT-020-LTLFireability-07
FORMULA_NAME CANConstruction-PT-020-LTLFireability-08
FORMULA_NAME CANConstruction-PT-020-LTLFireability-09
FORMULA_NAME CANConstruction-PT-020-LTLFireability-10
FORMULA_NAME CANConstruction-PT-020-LTLFireability-11
FORMULA_NAME CANConstruction-PT-020-LTLFireability-12
FORMULA_NAME CANConstruction-PT-020-LTLFireability-13
FORMULA_NAME CANConstruction-PT-020-LTLFireability-14
FORMULA_NAME CANConstruction-PT-020-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716361575076

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-020
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 07:06:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 07:06:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 07:06:16] [INFO ] Load time of PNML (sax parser for PT used): 134 ms
[2024-05-22 07:06:16] [INFO ] Transformed 1042 places.
[2024-05-22 07:06:16] [INFO ] Transformed 1760 transitions.
[2024-05-22 07:06:16] [INFO ] Parsed PT model containing 1042 places and 1760 transitions and 5200 arcs in 258 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA CANConstruction-PT-020-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-020-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-020-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 45 out of 1042 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1042/1042 places, 1760/1760 transitions.
Discarding 350 places :
Symmetric choice reduction at 0 with 350 rule applications. Total rules 350 place count 692 transition count 1060
Iterating global reduction 0 with 350 rules applied. Total rules applied 700 place count 692 transition count 1060
Applied a total of 700 rules in 137 ms. Remains 692 /1042 variables (removed 350) and now considering 1060/1760 (removed 700) transitions.
// Phase 1: matrix 1060 rows 692 cols
[2024-05-22 07:06:16] [INFO ] Computed 41 invariants in 35 ms
[2024-05-22 07:06:17] [INFO ] Implicit Places using invariants in 560 ms returned [12, 26, 40, 54, 68, 82, 96, 124, 138, 152, 180, 194, 208, 222, 236, 250, 264, 278]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 594 ms to find 18 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 674/1042 places, 1060/1760 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 656 transition count 1042
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 656 transition count 1042
Applied a total of 36 rules in 67 ms. Remains 656 /674 variables (removed 18) and now considering 1042/1060 (removed 18) transitions.
// Phase 1: matrix 1042 rows 656 cols
[2024-05-22 07:06:17] [INFO ] Computed 23 invariants in 11 ms
[2024-05-22 07:06:17] [INFO ] Implicit Places using invariants in 290 ms returned []
[2024-05-22 07:06:17] [INFO ] Invariant cache hit.
[2024-05-22 07:06:18] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-22 07:06:19] [INFO ] Implicit Places using invariants and state equation in 1900 ms returned []
Implicit Place search using SMT with State Equation took 2195 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 656/1042 places, 1042/1760 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3011 ms. Remains : 656/1042 places, 1042/1760 transitions.
Support contains 45 out of 656 places after structural reductions.
[2024-05-22 07:06:20] [INFO ] Flatten gal took : 87 ms
[2024-05-22 07:06:20] [INFO ] Flatten gal took : 51 ms
[2024-05-22 07:06:20] [INFO ] Input system was already deterministic with 1042 transitions.
RANDOM walk for 32471 steps (91 resets) in 2042 ms. (15 steps per ms) remains 0/25 properties
FORMULA CANConstruction-PT-020-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 63 stabilizing places and 82 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(F(p1))))))'
Support contains 4 out of 656 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 656/656 places, 1042/1042 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 646 transition count 1022
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 646 transition count 1022
Applied a total of 20 rules in 28 ms. Remains 646 /656 variables (removed 10) and now considering 1022/1042 (removed 20) transitions.
// Phase 1: matrix 1022 rows 646 cols
[2024-05-22 07:06:21] [INFO ] Computed 23 invariants in 9 ms
[2024-05-22 07:06:21] [INFO ] Implicit Places using invariants in 302 ms returned [96, 146]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 307 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 644/656 places, 1022/1042 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 642 transition count 1020
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 642 transition count 1020
Applied a total of 4 rules in 24 ms. Remains 642 /644 variables (removed 2) and now considering 1020/1022 (removed 2) transitions.
// Phase 1: matrix 1020 rows 642 cols
[2024-05-22 07:06:21] [INFO ] Computed 21 invariants in 9 ms
[2024-05-22 07:06:21] [INFO ] Implicit Places using invariants in 297 ms returned []
[2024-05-22 07:06:21] [INFO ] Invariant cache hit.
[2024-05-22 07:06:22] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-22 07:06:23] [INFO ] Implicit Places using invariants and state equation in 1872 ms returned []
Implicit Place search using SMT with State Equation took 2171 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 642/656 places, 1020/1042 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2531 ms. Remains : 642/656 places, 1020/1042 transitions.
Stuttering acceptance computed with spot in 242 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANConstruction-PT-020-LTLFireability-00
Product exploration explored 100000 steps with 302 reset in 489 ms.
Product exploration explored 100000 steps with 309 reset in 352 ms.
Computed a total of 61 stabilizing places and 80 stable transitions
Computed a total of 61 stabilizing places and 80 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 110 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (114 resets) in 496 ms. (80 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 339 ms. (117 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 303 ms. (131 steps per ms) remains 2/2 properties
[2024-05-22 07:06:25] [INFO ] Invariant cache hit.
[2024-05-22 07:06:25] [INFO ] State equation strengthened by 780 read => feed constraints.
Problem apf0 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 621/625 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-22 07:06:25] [INFO ] Deduced a trap composed of 5 places in 254 ms of which 17 ms to minimize.
[2024-05-22 07:06:26] [INFO ] Deduced a trap composed of 5 places in 214 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/625 variables, 2/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/625 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 16/641 variables, 16/23 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-22 07:06:26] [INFO ] Deduced a trap composed of 39 places in 219 ms of which 4 ms to minimize.
[2024-05-22 07:06:26] [INFO ] Deduced a trap composed of 35 places in 244 ms of which 4 ms to minimize.
[2024-05-22 07:06:26] [INFO ] Deduced a trap composed of 39 places in 214 ms of which 4 ms to minimize.
[2024-05-22 07:06:27] [INFO ] Deduced a trap composed of 38 places in 203 ms of which 4 ms to minimize.
[2024-05-22 07:06:27] [INFO ] Deduced a trap composed of 35 places in 202 ms of which 3 ms to minimize.
[2024-05-22 07:06:27] [INFO ] Deduced a trap composed of 42 places in 197 ms of which 4 ms to minimize.
[2024-05-22 07:06:27] [INFO ] Deduced a trap composed of 32 places in 178 ms of which 4 ms to minimize.
[2024-05-22 07:06:28] [INFO ] Deduced a trap composed of 32 places in 180 ms of which 3 ms to minimize.
[2024-05-22 07:06:28] [INFO ] Deduced a trap composed of 32 places in 166 ms of which 4 ms to minimize.
[2024-05-22 07:06:28] [INFO ] Deduced a trap composed of 37 places in 182 ms of which 4 ms to minimize.
[2024-05-22 07:06:28] [INFO ] Deduced a trap composed of 35 places in 161 ms of which 4 ms to minimize.
[2024-05-22 07:06:28] [INFO ] Deduced a trap composed of 32 places in 157 ms of which 4 ms to minimize.
[2024-05-22 07:06:28] [INFO ] Deduced a trap composed of 32 places in 156 ms of which 3 ms to minimize.
[2024-05-22 07:06:29] [INFO ] Deduced a trap composed of 38 places in 166 ms of which 4 ms to minimize.
[2024-05-22 07:06:29] [INFO ] Deduced a trap composed of 32 places in 140 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/641 variables, 15/38 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/641 variables, 0/38 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1020/1661 variables, 641/679 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1661 variables, 780/1459 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1661 variables, 0/1459 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/1662 variables, 1/1460 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1662 variables, 0/1460 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1662 variables, 0/1460 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1662/1662 variables, and 1460 constraints, problems are : Problem set: 1 solved, 1 unsolved in 4116 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 642/642 constraints, ReadFeed: 780/780 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 621/625 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/625 variables, 2/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-22 07:06:30] [INFO ] Deduced a trap composed of 5 places in 209 ms of which 4 ms to minimize.
[2024-05-22 07:06:30] [INFO ] Deduced a trap composed of 5 places in 207 ms of which 3 ms to minimize.
[2024-05-22 07:06:30] [INFO ] Deduced a trap composed of 5 places in 240 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/625 variables, 3/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/625 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 16/641 variables, 16/26 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/641 variables, 15/41 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-22 07:06:30] [INFO ] Deduced a trap composed of 32 places in 172 ms of which 4 ms to minimize.
[2024-05-22 07:06:30] [INFO ] Deduced a trap composed of 32 places in 155 ms of which 3 ms to minimize.
[2024-05-22 07:06:31] [INFO ] Deduced a trap composed of 32 places in 159 ms of which 3 ms to minimize.
[2024-05-22 07:06:31] [INFO ] Deduced a trap composed of 39 places in 153 ms of which 3 ms to minimize.
[2024-05-22 07:06:31] [INFO ] Deduced a trap composed of 38 places in 152 ms of which 4 ms to minimize.
[2024-05-22 07:06:31] [INFO ] Deduced a trap composed of 35 places in 143 ms of which 3 ms to minimize.
[2024-05-22 07:06:31] [INFO ] Deduced a trap composed of 32 places in 134 ms of which 3 ms to minimize.
[2024-05-22 07:06:31] [INFO ] Deduced a trap composed of 32 places in 123 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/641 variables, 8/49 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/641 variables, 0/49 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1020/1661 variables, 641/690 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1661 variables, 780/1470 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1661 variables, 1/1471 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1661 variables, 0/1471 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/1662 variables, 1/1472 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1662 variables, 0/1472 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1662 variables, 0/1472 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1662/1662 variables, and 1472 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2662 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 642/642 constraints, ReadFeed: 780/780 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 28/28 constraints]
After SMT, in 6825ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 17 ms.
Support contains 4 out of 642 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 642/642 places, 1020/1020 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 140 transitions
Trivial Post-agglo rules discarded 140 transitions
Performed 140 trivial Post agglomeration. Transition count delta: 140
Iterating post reduction 0 with 140 rules applied. Total rules applied 140 place count 642 transition count 880
Reduce places removed 140 places and 0 transitions.
Iterating post reduction 1 with 140 rules applied. Total rules applied 280 place count 502 transition count 880
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 280 place count 502 transition count 860
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 320 place count 482 transition count 860
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 356 place count 464 transition count 842
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 358 place count 464 transition count 840
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 360 place count 462 transition count 840
Applied a total of 360 rules in 126 ms. Remains 462 /642 variables (removed 180) and now considering 840/1020 (removed 180) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 126 ms. Remains : 462/642 places, 840/1020 transitions.
RANDOM walk for 40000 steps (296 resets) in 283 ms. (140 steps per ms) remains 1/1 properties
BEST_FIRST walk for 35019 steps (11 resets) in 83 ms. (416 steps per ms) remains 0/1 properties
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 8 factoid took 229 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 393 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 229 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Support contains 4 out of 642 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 642/642 places, 1020/1020 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 140 transitions
Trivial Post-agglo rules discarded 140 transitions
Performed 140 trivial Post agglomeration. Transition count delta: 140
Iterating post reduction 0 with 140 rules applied. Total rules applied 140 place count 642 transition count 880
Reduce places removed 140 places and 0 transitions.
Iterating post reduction 1 with 140 rules applied. Total rules applied 280 place count 502 transition count 880
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 280 place count 502 transition count 860
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 320 place count 482 transition count 860
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 356 place count 464 transition count 842
Applied a total of 356 rules in 75 ms. Remains 464 /642 variables (removed 178) and now considering 842/1020 (removed 178) transitions.
// Phase 1: matrix 842 rows 464 cols
[2024-05-22 07:06:33] [INFO ] Computed 21 invariants in 5 ms
[2024-05-22 07:06:33] [INFO ] Implicit Places using invariants in 256 ms returned []
[2024-05-22 07:06:33] [INFO ] Invariant cache hit.
[2024-05-22 07:06:34] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-22 07:06:35] [INFO ] Implicit Places using invariants and state equation in 1629 ms returned []
Implicit Place search using SMT with State Equation took 1888 ms to find 0 implicit places.
[2024-05-22 07:06:35] [INFO ] Redundant transitions in 48 ms returned []
Running 822 sub problems to find dead transitions.
[2024-05-22 07:06:35] [INFO ] Invariant cache hit.
[2024-05-22 07:06:35] [INFO ] State equation strengthened by 780 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/463 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-22 07:06:42] [INFO ] Deduced a trap composed of 23 places in 182 ms of which 3 ms to minimize.
[2024-05-22 07:06:42] [INFO ] Deduced a trap composed of 23 places in 169 ms of which 4 ms to minimize.
[2024-05-22 07:06:43] [INFO ] Deduced a trap composed of 23 places in 175 ms of which 4 ms to minimize.
[2024-05-22 07:06:43] [INFO ] Deduced a trap composed of 24 places in 161 ms of which 2 ms to minimize.
[2024-05-22 07:06:43] [INFO ] Deduced a trap composed of 23 places in 163 ms of which 3 ms to minimize.
[2024-05-22 07:06:43] [INFO ] Deduced a trap composed of 23 places in 160 ms of which 4 ms to minimize.
[2024-05-22 07:06:43] [INFO ] Deduced a trap composed of 23 places in 160 ms of which 7 ms to minimize.
[2024-05-22 07:06:43] [INFO ] Deduced a trap composed of 23 places in 157 ms of which 3 ms to minimize.
[2024-05-22 07:06:44] [INFO ] Deduced a trap composed of 23 places in 151 ms of which 3 ms to minimize.
[2024-05-22 07:06:44] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 3 ms to minimize.
[2024-05-22 07:06:44] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 3 ms to minimize.
[2024-05-22 07:06:44] [INFO ] Deduced a trap composed of 24 places in 139 ms of which 4 ms to minimize.
[2024-05-22 07:06:44] [INFO ] Deduced a trap composed of 28 places in 134 ms of which 3 ms to minimize.
[2024-05-22 07:06:44] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 3 ms to minimize.
[2024-05-22 07:06:44] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 3 ms to minimize.
[2024-05-22 07:06:45] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 3 ms to minimize.
[2024-05-22 07:06:45] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 3 ms to minimize.
[2024-05-22 07:06:45] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 3 ms to minimize.
[2024-05-22 07:06:45] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 2 ms to minimize.
[2024-05-22 07:06:45] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/463 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-22 07:06:46] [INFO ] Deduced a trap composed of 24 places in 150 ms of which 3 ms to minimize.
[2024-05-22 07:06:47] [INFO ] Deduced a trap composed of 23 places in 154 ms of which 3 ms to minimize.
[2024-05-22 07:06:47] [INFO ] Deduced a trap composed of 26 places in 144 ms of which 3 ms to minimize.
[2024-05-22 07:06:47] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 3 ms to minimize.
[2024-05-22 07:06:47] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 3 ms to minimize.
[2024-05-22 07:06:47] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 3 ms to minimize.
[2024-05-22 07:06:47] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 3 ms to minimize.
[2024-05-22 07:06:47] [INFO ] Deduced a trap composed of 24 places in 148 ms of which 4 ms to minimize.
[2024-05-22 07:06:48] [INFO ] Deduced a trap composed of 24 places in 137 ms of which 3 ms to minimize.
[2024-05-22 07:06:48] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 3 ms to minimize.
[2024-05-22 07:06:48] [INFO ] Deduced a trap composed of 24 places in 140 ms of which 3 ms to minimize.
[2024-05-22 07:06:48] [INFO ] Deduced a trap composed of 24 places in 141 ms of which 3 ms to minimize.
[2024-05-22 07:06:48] [INFO ] Deduced a trap composed of 24 places in 141 ms of which 2 ms to minimize.
[2024-05-22 07:06:48] [INFO ] Deduced a trap composed of 24 places in 141 ms of which 3 ms to minimize.
[2024-05-22 07:06:49] [INFO ] Deduced a trap composed of 24 places in 138 ms of which 3 ms to minimize.
[2024-05-22 07:06:49] [INFO ] Deduced a trap composed of 24 places in 144 ms of which 3 ms to minimize.
[2024-05-22 07:06:49] [INFO ] Deduced a trap composed of 26 places in 135 ms of which 3 ms to minimize.
[2024-05-22 07:06:49] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 3 ms to minimize.
[2024-05-22 07:06:49] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 2 ms to minimize.
[2024-05-22 07:06:49] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/463 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-22 07:06:50] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 3 ms to minimize.
[2024-05-22 07:06:51] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 3 ms to minimize.
[2024-05-22 07:06:51] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 3 ms to minimize.
[2024-05-22 07:06:51] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 3 ms to minimize.
[2024-05-22 07:06:51] [INFO ] Deduced a trap composed of 26 places in 125 ms of which 2 ms to minimize.
[2024-05-22 07:06:51] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 3 ms to minimize.
[2024-05-22 07:06:51] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 3 ms to minimize.
[2024-05-22 07:06:51] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 3 ms to minimize.
[2024-05-22 07:06:51] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 3 ms to minimize.
[2024-05-22 07:06:52] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 3 ms to minimize.
[2024-05-22 07:06:52] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 3 ms to minimize.
[2024-05-22 07:06:52] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 2 ms to minimize.
[2024-05-22 07:06:52] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 2 ms to minimize.
[2024-05-22 07:06:52] [INFO ] Deduced a trap composed of 25 places in 134 ms of which 3 ms to minimize.
[2024-05-22 07:06:52] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 3 ms to minimize.
[2024-05-22 07:06:52] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 3 ms to minimize.
[2024-05-22 07:06:53] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 3 ms to minimize.
[2024-05-22 07:06:53] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 2 ms to minimize.
[2024-05-22 07:06:53] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 3 ms to minimize.
[2024-05-22 07:06:53] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/463 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-22 07:07:00] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 3 ms to minimize.
[2024-05-22 07:07:00] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 2 ms to minimize.
[2024-05-22 07:07:00] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 3 ms to minimize.
[2024-05-22 07:07:00] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 2 ms to minimize.
[2024-05-22 07:07:01] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 2 ms to minimize.
[2024-05-22 07:07:01] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 3 ms to minimize.
[2024-05-22 07:07:01] [INFO ] Deduced a trap composed of 23 places in 149 ms of which 3 ms to minimize.
[2024-05-22 07:07:01] [INFO ] Deduced a trap composed of 24 places in 151 ms of which 3 ms to minimize.
[2024-05-22 07:07:01] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 3 ms to minimize.
[2024-05-22 07:07:01] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 3 ms to minimize.
[2024-05-22 07:07:02] [INFO ] Deduced a trap composed of 24 places in 141 ms of which 3 ms to minimize.
[2024-05-22 07:07:02] [INFO ] Deduced a trap composed of 24 places in 135 ms of which 2 ms to minimize.
[2024-05-22 07:07:02] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 3 ms to minimize.
[2024-05-22 07:07:02] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 3 ms to minimize.
[2024-05-22 07:07:02] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 3 ms to minimize.
[2024-05-22 07:07:02] [INFO ] Deduced a trap composed of 26 places in 120 ms of which 3 ms to minimize.
[2024-05-22 07:07:02] [INFO ] Deduced a trap composed of 23 places in 145 ms of which 3 ms to minimize.
[2024-05-22 07:07:03] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 3 ms to minimize.
[2024-05-22 07:07:03] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 3 ms to minimize.
[2024-05-22 07:07:03] [INFO ] Deduced a trap composed of 26 places in 118 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/463 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-22 07:07:04] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 3 ms to minimize.
[2024-05-22 07:07:04] [INFO ] Deduced a trap composed of 24 places in 154 ms of which 3 ms to minimize.
[2024-05-22 07:07:04] [INFO ] Deduced a trap composed of 24 places in 134 ms of which 3 ms to minimize.
[2024-05-22 07:07:05] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 2 ms to minimize.
[2024-05-22 07:07:05] [INFO ] Deduced a trap composed of 29 places in 134 ms of which 3 ms to minimize.
[2024-05-22 07:07:05] [INFO ] Deduced a trap composed of 26 places in 130 ms of which 3 ms to minimize.
[2024-05-22 07:07:05] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 2 ms to minimize.
[2024-05-22 07:07:05] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 3 ms to minimize.
[2024-05-22 07:07:05] [INFO ] Deduced a trap composed of 29 places in 130 ms of which 3 ms to minimize.
[2024-05-22 07:07:05] [INFO ] Deduced a trap composed of 27 places in 129 ms of which 3 ms to minimize.
[2024-05-22 07:07:06] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 3 ms to minimize.
SMT process timed out in 30479ms, After SMT, problems are : Problem set: 0 solved, 822 unsolved
Search for dead transitions found 0 dead transitions in 30491ms
Starting structural reductions in SI_LTL mode, iteration 1 : 464/642 places, 842/1020 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 32521 ms. Remains : 464/642 places, 842/1020 transitions.
Computed a total of 21 stabilizing places and 40 stable transitions
Computed a total of 21 stabilizing places and 40 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 117 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (288 resets) in 332 ms. (120 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (12 resets) in 60 ms. (655 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (13 resets) in 83 ms. (476 steps per ms) remains 2/2 properties
[2024-05-22 07:07:06] [INFO ] Invariant cache hit.
[2024-05-22 07:07:06] [INFO ] State equation strengthened by 780 read => feed constraints.
Problem apf0 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 443/447 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-22 07:07:06] [INFO ] Deduced a trap composed of 2 places in 155 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/447 variables, 1/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/447 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 16/463 variables, 16/22 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 842/1305 variables, 463/485 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1305 variables, 780/1265 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1305 variables, 0/1265 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/1306 variables, 1/1266 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1306 variables, 0/1266 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1306 variables, 0/1266 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1306/1306 variables, and 1266 constraints, problems are : Problem set: 1 solved, 1 unsolved in 599 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 464/464 constraints, ReadFeed: 780/780 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 443/447 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/447 variables, 1/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/447 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 16/463 variables, 16/22 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-22 07:07:07] [INFO ] Deduced a trap composed of 23 places in 166 ms of which 3 ms to minimize.
[2024-05-22 07:07:07] [INFO ] Deduced a trap composed of 26 places in 146 ms of which 2 ms to minimize.
[2024-05-22 07:07:07] [INFO ] Deduced a trap composed of 23 places in 154 ms of which 4 ms to minimize.
[2024-05-22 07:07:07] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 2 ms to minimize.
[2024-05-22 07:07:08] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 3 ms to minimize.
[2024-05-22 07:07:08] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 3 ms to minimize.
[2024-05-22 07:07:08] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 2 ms to minimize.
[2024-05-22 07:07:08] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 3 ms to minimize.
[2024-05-22 07:07:08] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 3 ms to minimize.
[2024-05-22 07:07:08] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 3 ms to minimize.
[2024-05-22 07:07:08] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 3 ms to minimize.
[2024-05-22 07:07:09] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 3 ms to minimize.
[2024-05-22 07:07:09] [INFO ] Deduced a trap composed of 24 places in 126 ms of which 3 ms to minimize.
[2024-05-22 07:07:09] [INFO ] Deduced a trap composed of 25 places in 128 ms of which 2 ms to minimize.
[2024-05-22 07:07:09] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 3 ms to minimize.
[2024-05-22 07:07:09] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 3 ms to minimize.
[2024-05-22 07:07:09] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 3 ms to minimize.
[2024-05-22 07:07:09] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 3 ms to minimize.
[2024-05-22 07:07:10] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 3 ms to minimize.
[2024-05-22 07:07:10] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 20/42 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-22 07:07:10] [INFO ] Deduced a trap composed of 26 places in 120 ms of which 2 ms to minimize.
[2024-05-22 07:07:10] [INFO ] Deduced a trap composed of 27 places in 126 ms of which 3 ms to minimize.
[2024-05-22 07:07:10] [INFO ] Deduced a trap composed of 25 places in 119 ms of which 2 ms to minimize.
[2024-05-22 07:07:10] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 3 ms to minimize.
[2024-05-22 07:07:10] [INFO ] Deduced a trap composed of 25 places in 138 ms of which 3 ms to minimize.
[2024-05-22 07:07:10] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 3 ms to minimize.
[2024-05-22 07:07:11] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 7/49 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/463 variables, 0/49 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 842/1305 variables, 463/512 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1305 variables, 780/1292 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1305 variables, 1/1293 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1305 variables, 0/1293 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/1306 variables, 1/1294 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1306 variables, 0/1294 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1306 variables, 0/1294 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1306/1306 variables, and 1294 constraints, problems are : Problem set: 1 solved, 1 unsolved in 4438 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 464/464 constraints, ReadFeed: 780/780 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 28/28 constraints]
After SMT, in 5055ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 388 steps, including 46 resets, run visited all 1 properties in 4 ms. (steps per millisecond=97 )
Parikh walk visited 1 properties in 11 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 12 factoid took 292 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 221 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Product exploration explored 100000 steps with 758 reset in 409 ms.
Product exploration explored 100000 steps with 749 reset in 402 ms.
Support contains 4 out of 464 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 464/464 places, 842/842 transitions.
Applied a total of 0 rules in 21 ms. Remains 464 /464 variables (removed 0) and now considering 842/842 (removed 0) transitions.
[2024-05-22 07:07:13] [INFO ] Invariant cache hit.
[2024-05-22 07:07:13] [INFO ] Implicit Places using invariants in 240 ms returned []
[2024-05-22 07:07:13] [INFO ] Invariant cache hit.
[2024-05-22 07:07:13] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-22 07:07:15] [INFO ] Implicit Places using invariants and state equation in 1539 ms returned []
Implicit Place search using SMT with State Equation took 1781 ms to find 0 implicit places.
[2024-05-22 07:07:15] [INFO ] Redundant transitions in 109 ms returned []
Running 822 sub problems to find dead transitions.
[2024-05-22 07:07:15] [INFO ] Invariant cache hit.
[2024-05-22 07:07:15] [INFO ] State equation strengthened by 780 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/463 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-22 07:07:22] [INFO ] Deduced a trap composed of 23 places in 183 ms of which 3 ms to minimize.
[2024-05-22 07:07:22] [INFO ] Deduced a trap composed of 23 places in 166 ms of which 3 ms to minimize.
[2024-05-22 07:07:22] [INFO ] Deduced a trap composed of 23 places in 166 ms of which 3 ms to minimize.
[2024-05-22 07:07:22] [INFO ] Deduced a trap composed of 24 places in 162 ms of which 3 ms to minimize.
[2024-05-22 07:07:23] [INFO ] Deduced a trap composed of 23 places in 159 ms of which 3 ms to minimize.
[2024-05-22 07:07:23] [INFO ] Deduced a trap composed of 23 places in 157 ms of which 3 ms to minimize.
[2024-05-22 07:07:23] [INFO ] Deduced a trap composed of 23 places in 154 ms of which 3 ms to minimize.
[2024-05-22 07:07:23] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 3 ms to minimize.
[2024-05-22 07:07:23] [INFO ] Deduced a trap composed of 23 places in 151 ms of which 3 ms to minimize.
[2024-05-22 07:07:23] [INFO ] Deduced a trap composed of 23 places in 144 ms of which 3 ms to minimize.
[2024-05-22 07:07:24] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 5 ms to minimize.
[2024-05-22 07:07:24] [INFO ] Deduced a trap composed of 24 places in 138 ms of which 2 ms to minimize.
[2024-05-22 07:07:24] [INFO ] Deduced a trap composed of 28 places in 132 ms of which 3 ms to minimize.
[2024-05-22 07:07:24] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 3 ms to minimize.
[2024-05-22 07:07:24] [INFO ] Deduced a trap composed of 23 places in 145 ms of which 3 ms to minimize.
[2024-05-22 07:07:24] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 3 ms to minimize.
[2024-05-22 07:07:24] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 2 ms to minimize.
[2024-05-22 07:07:25] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 3 ms to minimize.
[2024-05-22 07:07:25] [INFO ] Deduced a trap composed of 24 places in 108 ms of which 3 ms to minimize.
[2024-05-22 07:07:25] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/463 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-22 07:07:26] [INFO ] Deduced a trap composed of 24 places in 145 ms of which 3 ms to minimize.
[2024-05-22 07:07:26] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 3 ms to minimize.
[2024-05-22 07:07:26] [INFO ] Deduced a trap composed of 26 places in 140 ms of which 3 ms to minimize.
[2024-05-22 07:07:26] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 3 ms to minimize.
[2024-05-22 07:07:27] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 3 ms to minimize.
[2024-05-22 07:07:27] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 3 ms to minimize.
[2024-05-22 07:07:27] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 2 ms to minimize.
[2024-05-22 07:07:27] [INFO ] Deduced a trap composed of 24 places in 142 ms of which 3 ms to minimize.
[2024-05-22 07:07:27] [INFO ] Deduced a trap composed of 24 places in 133 ms of which 2 ms to minimize.
[2024-05-22 07:07:27] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 3 ms to minimize.
[2024-05-22 07:07:28] [INFO ] Deduced a trap composed of 24 places in 134 ms of which 3 ms to minimize.
[2024-05-22 07:07:28] [INFO ] Deduced a trap composed of 24 places in 144 ms of which 3 ms to minimize.
[2024-05-22 07:07:28] [INFO ] Deduced a trap composed of 24 places in 136 ms of which 3 ms to minimize.
[2024-05-22 07:07:28] [INFO ] Deduced a trap composed of 24 places in 136 ms of which 3 ms to minimize.
[2024-05-22 07:07:28] [INFO ] Deduced a trap composed of 24 places in 141 ms of which 3 ms to minimize.
[2024-05-22 07:07:28] [INFO ] Deduced a trap composed of 24 places in 143 ms of which 3 ms to minimize.
[2024-05-22 07:07:28] [INFO ] Deduced a trap composed of 26 places in 144 ms of which 3 ms to minimize.
[2024-05-22 07:07:29] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 2 ms to minimize.
[2024-05-22 07:07:29] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 3 ms to minimize.
[2024-05-22 07:07:29] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/463 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-22 07:07:30] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 3 ms to minimize.
[2024-05-22 07:07:30] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 3 ms to minimize.
[2024-05-22 07:07:30] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 2 ms to minimize.
[2024-05-22 07:07:30] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 3 ms to minimize.
[2024-05-22 07:07:30] [INFO ] Deduced a trap composed of 26 places in 131 ms of which 3 ms to minimize.
[2024-05-22 07:07:31] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 3 ms to minimize.
[2024-05-22 07:07:31] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 3 ms to minimize.
[2024-05-22 07:07:31] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 3 ms to minimize.
[2024-05-22 07:07:31] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 2 ms to minimize.
[2024-05-22 07:07:31] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 3 ms to minimize.
[2024-05-22 07:07:31] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 2 ms to minimize.
[2024-05-22 07:07:31] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 3 ms to minimize.
[2024-05-22 07:07:32] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 2 ms to minimize.
[2024-05-22 07:07:32] [INFO ] Deduced a trap composed of 25 places in 143 ms of which 3 ms to minimize.
[2024-05-22 07:07:32] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 3 ms to minimize.
[2024-05-22 07:07:32] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 2 ms to minimize.
[2024-05-22 07:07:32] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 3 ms to minimize.
[2024-05-22 07:07:32] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 2 ms to minimize.
[2024-05-22 07:07:32] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 3 ms to minimize.
[2024-05-22 07:07:33] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/463 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-22 07:07:39] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 3 ms to minimize.
[2024-05-22 07:07:39] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 3 ms to minimize.
[2024-05-22 07:07:40] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 3 ms to minimize.
[2024-05-22 07:07:40] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 3 ms to minimize.
[2024-05-22 07:07:40] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 2 ms to minimize.
[2024-05-22 07:07:40] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 3 ms to minimize.
[2024-05-22 07:07:40] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 3 ms to minimize.
[2024-05-22 07:07:41] [INFO ] Deduced a trap composed of 24 places in 137 ms of which 3 ms to minimize.
[2024-05-22 07:07:41] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 3 ms to minimize.
[2024-05-22 07:07:41] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 2 ms to minimize.
[2024-05-22 07:07:41] [INFO ] Deduced a trap composed of 24 places in 128 ms of which 3 ms to minimize.
[2024-05-22 07:07:41] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 2 ms to minimize.
[2024-05-22 07:07:41] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 3 ms to minimize.
[2024-05-22 07:07:41] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 3 ms to minimize.
[2024-05-22 07:07:42] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 3 ms to minimize.
[2024-05-22 07:07:42] [INFO ] Deduced a trap composed of 26 places in 112 ms of which 3 ms to minimize.
[2024-05-22 07:07:42] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 2 ms to minimize.
[2024-05-22 07:07:42] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 2 ms to minimize.
[2024-05-22 07:07:42] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 3 ms to minimize.
[2024-05-22 07:07:42] [INFO ] Deduced a trap composed of 26 places in 111 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/463 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-22 07:07:43] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 3 ms to minimize.
[2024-05-22 07:07:44] [INFO ] Deduced a trap composed of 24 places in 157 ms of which 3 ms to minimize.
[2024-05-22 07:07:44] [INFO ] Deduced a trap composed of 24 places in 145 ms of which 3 ms to minimize.
[2024-05-22 07:07:44] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 3 ms to minimize.
[2024-05-22 07:07:44] [INFO ] Deduced a trap composed of 29 places in 127 ms of which 3 ms to minimize.
[2024-05-22 07:07:44] [INFO ] Deduced a trap composed of 26 places in 125 ms of which 3 ms to minimize.
[2024-05-22 07:07:44] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 2 ms to minimize.
[2024-05-22 07:07:44] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 3 ms to minimize.
[2024-05-22 07:07:45] [INFO ] Deduced a trap composed of 29 places in 128 ms of which 3 ms to minimize.
[2024-05-22 07:07:45] [INFO ] Deduced a trap composed of 27 places in 129 ms of which 3 ms to minimize.
[2024-05-22 07:07:45] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 3 ms to minimize.
[2024-05-22 07:07:45] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 3 ms to minimize.
[2024-05-22 07:07:45] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 463/1306 variables, and 114 constraints, problems are : Problem set: 0 solved, 822 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 0/464 constraints, ReadFeed: 0/780 constraints, PredecessorRefiner: 822/822 constraints, Known Traps: 93/93 constraints]
Escalating to Integer solving :Problem set: 0 solved, 822 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/463 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/463 variables, 93/114 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-22 07:07:47] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 2 ms to minimize.
[2024-05-22 07:07:47] [INFO ] Deduced a trap composed of 26 places in 132 ms of which 2 ms to minimize.
[2024-05-22 07:07:47] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 3 ms to minimize.
[2024-05-22 07:07:47] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 3 ms to minimize.
[2024-05-22 07:07:47] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 3 ms to minimize.
[2024-05-22 07:07:48] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 3 ms to minimize.
[2024-05-22 07:07:48] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 3 ms to minimize.
[2024-05-22 07:07:48] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 3 ms to minimize.
[2024-05-22 07:07:48] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 4 ms to minimize.
[2024-05-22 07:07:48] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 3 ms to minimize.
[2024-05-22 07:07:48] [INFO ] Deduced a trap composed of 24 places in 142 ms of which 3 ms to minimize.
[2024-05-22 07:07:48] [INFO ] Deduced a trap composed of 23 places in 145 ms of which 3 ms to minimize.
[2024-05-22 07:07:49] [INFO ] Deduced a trap composed of 23 places in 145 ms of which 3 ms to minimize.
[2024-05-22 07:07:49] [INFO ] Deduced a trap composed of 26 places in 136 ms of which 2 ms to minimize.
[2024-05-22 07:07:49] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 3 ms to minimize.
[2024-05-22 07:07:49] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 5 ms to minimize.
[2024-05-22 07:07:49] [INFO ] Deduced a trap composed of 26 places in 128 ms of which 2 ms to minimize.
[2024-05-22 07:07:49] [INFO ] Deduced a trap composed of 28 places in 119 ms of which 3 ms to minimize.
[2024-05-22 07:07:49] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 2 ms to minimize.
[2024-05-22 07:07:50] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/463 variables, 20/134 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-22 07:07:51] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 2 ms to minimize.
[2024-05-22 07:07:51] [INFO ] Deduced a trap composed of 25 places in 141 ms of which 3 ms to minimize.
[2024-05-22 07:07:51] [INFO ] Deduced a trap composed of 26 places in 141 ms of which 3 ms to minimize.
[2024-05-22 07:07:52] [INFO ] Deduced a trap composed of 27 places in 137 ms of which 3 ms to minimize.
[2024-05-22 07:07:52] [INFO ] Deduced a trap composed of 25 places in 145 ms of which 3 ms to minimize.
[2024-05-22 07:07:52] [INFO ] Deduced a trap composed of 26 places in 147 ms of which 3 ms to minimize.
[2024-05-22 07:07:52] [INFO ] Deduced a trap composed of 29 places in 137 ms of which 3 ms to minimize.
[2024-05-22 07:07:52] [INFO ] Deduced a trap composed of 23 places in 143 ms of which 3 ms to minimize.
[2024-05-22 07:07:52] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 3 ms to minimize.
[2024-05-22 07:07:53] [INFO ] Deduced a trap composed of 26 places in 141 ms of which 3 ms to minimize.
[2024-05-22 07:07:53] [INFO ] Deduced a trap composed of 27 places in 138 ms of which 2 ms to minimize.
[2024-05-22 07:07:53] [INFO ] Deduced a trap composed of 27 places in 123 ms of which 3 ms to minimize.
[2024-05-22 07:07:53] [INFO ] Deduced a trap composed of 27 places in 129 ms of which 3 ms to minimize.
[2024-05-22 07:07:53] [INFO ] Deduced a trap composed of 26 places in 125 ms of which 2 ms to minimize.
[2024-05-22 07:07:53] [INFO ] Deduced a trap composed of 25 places in 126 ms of which 3 ms to minimize.
[2024-05-22 07:07:53] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 3 ms to minimize.
[2024-05-22 07:07:53] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 3 ms to minimize.
[2024-05-22 07:07:54] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 3 ms to minimize.
[2024-05-22 07:07:54] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 3 ms to minimize.
[2024-05-22 07:07:54] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/463 variables, 20/154 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-22 07:07:55] [INFO ] Deduced a trap composed of 25 places in 112 ms of which 2 ms to minimize.
[2024-05-22 07:07:55] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 3 ms to minimize.
[2024-05-22 07:07:56] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 3 ms to minimize.
[2024-05-22 07:07:56] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 2 ms to minimize.
[2024-05-22 07:07:56] [INFO ] Deduced a trap composed of 24 places in 133 ms of which 3 ms to minimize.
[2024-05-22 07:07:56] [INFO ] Deduced a trap composed of 24 places in 125 ms of which 3 ms to minimize.
[2024-05-22 07:07:56] [INFO ] Deduced a trap composed of 24 places in 121 ms of which 3 ms to minimize.
[2024-05-22 07:07:56] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 3 ms to minimize.
[2024-05-22 07:07:57] [INFO ] Deduced a trap composed of 26 places in 117 ms of which 3 ms to minimize.
[2024-05-22 07:07:57] [INFO ] Deduced a trap composed of 26 places in 118 ms of which 3 ms to minimize.
[2024-05-22 07:07:57] [INFO ] Deduced a trap composed of 26 places in 115 ms of which 3 ms to minimize.
[2024-05-22 07:07:57] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 2 ms to minimize.
[2024-05-22 07:07:57] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 3 ms to minimize.
[2024-05-22 07:07:57] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 3 ms to minimize.
[2024-05-22 07:07:57] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 3 ms to minimize.
[2024-05-22 07:07:58] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 3 ms to minimize.
[2024-05-22 07:07:58] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 3 ms to minimize.
[2024-05-22 07:07:58] [INFO ] Deduced a trap composed of 28 places in 123 ms of which 3 ms to minimize.
[2024-05-22 07:07:58] [INFO ] Deduced a trap composed of 24 places in 120 ms of which 2 ms to minimize.
[2024-05-22 07:07:58] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/463 variables, 20/174 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-22 07:07:59] [INFO ] Deduced a trap composed of 23 places in 170 ms of which 2 ms to minimize.
[2024-05-22 07:07:59] [INFO ] Deduced a trap composed of 23 places in 163 ms of which 3 ms to minimize.
[2024-05-22 07:07:59] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 3 ms to minimize.
[2024-05-22 07:07:59] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 3 ms to minimize.
[2024-05-22 07:08:00] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 3 ms to minimize.
[2024-05-22 07:08:00] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 3 ms to minimize.
[2024-05-22 07:08:00] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 3 ms to minimize.
[2024-05-22 07:08:00] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 3 ms to minimize.
[2024-05-22 07:08:01] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 2 ms to minimize.
[2024-05-22 07:08:01] [INFO ] Deduced a trap composed of 24 places in 117 ms of which 3 ms to minimize.
[2024-05-22 07:08:01] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 2 ms to minimize.
[2024-05-22 07:08:01] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 3 ms to minimize.
[2024-05-22 07:08:01] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 2 ms to minimize.
[2024-05-22 07:08:02] [INFO ] Deduced a trap composed of 25 places in 132 ms of which 3 ms to minimize.
[2024-05-22 07:08:02] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 2 ms to minimize.
[2024-05-22 07:08:02] [INFO ] Deduced a trap composed of 26 places in 146 ms of which 3 ms to minimize.
[2024-05-22 07:08:02] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 3 ms to minimize.
[2024-05-22 07:08:02] [INFO ] Deduced a trap composed of 27 places in 141 ms of which 3 ms to minimize.
[2024-05-22 07:08:02] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 2 ms to minimize.
[2024-05-22 07:08:03] [INFO ] Deduced a trap composed of 26 places in 118 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 20/194 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-22 07:08:03] [INFO ] Deduced a trap composed of 23 places in 181 ms of which 3 ms to minimize.
[2024-05-22 07:08:03] [INFO ] Deduced a trap composed of 23 places in 170 ms of which 3 ms to minimize.
[2024-05-22 07:08:04] [INFO ] Deduced a trap composed of 23 places in 170 ms of which 3 ms to minimize.
[2024-05-22 07:08:05] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 3 ms to minimize.
[2024-05-22 07:08:05] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 3 ms to minimize.
[2024-05-22 07:08:05] [INFO ] Deduced a trap composed of 27 places in 124 ms of which 3 ms to minimize.
[2024-05-22 07:08:05] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 3 ms to minimize.
[2024-05-22 07:08:05] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 3 ms to minimize.
[2024-05-22 07:08:05] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 2 ms to minimize.
[2024-05-22 07:08:06] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 3 ms to minimize.
[2024-05-22 07:08:06] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 2 ms to minimize.
[2024-05-22 07:08:06] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 3 ms to minimize.
[2024-05-22 07:08:06] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 3 ms to minimize.
[2024-05-22 07:08:06] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 3 ms to minimize.
[2024-05-22 07:08:07] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 3 ms to minimize.
[2024-05-22 07:08:07] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 2 ms to minimize.
[2024-05-22 07:08:07] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 3 ms to minimize.
[2024-05-22 07:08:07] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 3 ms to minimize.
[2024-05-22 07:08:07] [INFO ] Deduced a trap composed of 24 places in 136 ms of which 3 ms to minimize.
[2024-05-22 07:08:07] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 20/214 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-22 07:08:09] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 3 ms to minimize.
[2024-05-22 07:08:09] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 3 ms to minimize.
[2024-05-22 07:08:09] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 3 ms to minimize.
[2024-05-22 07:08:09] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 2 ms to minimize.
[2024-05-22 07:08:10] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 3 ms to minimize.
[2024-05-22 07:08:10] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 3 ms to minimize.
[2024-05-22 07:08:10] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 3 ms to minimize.
[2024-05-22 07:08:10] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 2 ms to minimize.
[2024-05-22 07:08:10] [INFO ] Deduced a trap composed of 24 places in 128 ms of which 3 ms to minimize.
[2024-05-22 07:08:11] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 3 ms to minimize.
[2024-05-22 07:08:11] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 2 ms to minimize.
[2024-05-22 07:08:11] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 3 ms to minimize.
[2024-05-22 07:08:11] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 2 ms to minimize.
[2024-05-22 07:08:11] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 3 ms to minimize.
[2024-05-22 07:08:11] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 3 ms to minimize.
[2024-05-22 07:08:12] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 3 ms to minimize.
[2024-05-22 07:08:12] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 2 ms to minimize.
[2024-05-22 07:08:12] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 2 ms to minimize.
[2024-05-22 07:08:12] [INFO ] Deduced a trap composed of 25 places in 118 ms of which 3 ms to minimize.
[2024-05-22 07:08:12] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/463 variables, 20/234 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-22 07:08:14] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 3 ms to minimize.
[2024-05-22 07:08:14] [INFO ] Deduced a trap composed of 25 places in 120 ms of which 2 ms to minimize.
[2024-05-22 07:08:14] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 3 ms to minimize.
[2024-05-22 07:08:14] [INFO ] Deduced a trap composed of 24 places in 108 ms of which 3 ms to minimize.
[2024-05-22 07:08:15] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 2 ms to minimize.
[2024-05-22 07:08:15] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 3 ms to minimize.
[2024-05-22 07:08:15] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 2 ms to minimize.
SMT process timed out in 60388ms, After SMT, problems are : Problem set: 0 solved, 822 unsolved
Search for dead transitions found 0 dead transitions in 60396ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62317 ms. Remains : 464/464 places, 842/842 transitions.
Treatment of property CANConstruction-PT-020-LTLFireability-00 finished in 114705 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 4 out of 656 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 656/656 places, 1042/1042 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 131 transitions
Trivial Post-agglo rules discarded 131 transitions
Performed 131 trivial Post agglomeration. Transition count delta: 131
Iterating post reduction 0 with 131 rules applied. Total rules applied 131 place count 656 transition count 911
Reduce places removed 131 places and 0 transitions.
Iterating post reduction 1 with 131 rules applied. Total rules applied 262 place count 525 transition count 911
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 262 place count 525 transition count 893
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 298 place count 507 transition count 893
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 308 place count 497 transition count 873
Iterating global reduction 2 with 10 rules applied. Total rules applied 318 place count 497 transition count 873
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 2 with 9 rules applied. Total rules applied 327 place count 497 transition count 864
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 336 place count 488 transition count 864
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 372 place count 470 transition count 846
Applied a total of 372 rules in 74 ms. Remains 470 /656 variables (removed 186) and now considering 846/1042 (removed 196) transitions.
// Phase 1: matrix 846 rows 470 cols
[2024-05-22 07:08:15] [INFO ] Computed 23 invariants in 3 ms
[2024-05-22 07:08:16] [INFO ] Implicit Places using invariants in 268 ms returned [28, 43]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 270 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 468/656 places, 846/1042 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 468 transition count 842
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 464 transition count 842
Applied a total of 8 rules in 27 ms. Remains 464 /468 variables (removed 4) and now considering 842/846 (removed 4) transitions.
// Phase 1: matrix 842 rows 464 cols
[2024-05-22 07:08:16] [INFO ] Computed 21 invariants in 7 ms
[2024-05-22 07:08:16] [INFO ] Implicit Places using invariants in 282 ms returned []
[2024-05-22 07:08:16] [INFO ] Invariant cache hit.
[2024-05-22 07:08:16] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-22 07:08:18] [INFO ] Implicit Places using invariants and state equation in 1635 ms returned []
Implicit Place search using SMT with State Equation took 1920 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 464/656 places, 842/1042 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2291 ms. Remains : 464/656 places, 842/1042 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-020-LTLFireability-02
Stuttering criterion allowed to conclude after 139 steps with 0 reset in 2 ms.
FORMULA CANConstruction-PT-020-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-020-LTLFireability-02 finished in 2363 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(F(p0))||G(p1))))'
Support contains 5 out of 656 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 656/656 places, 1042/1042 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 647 transition count 1024
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 647 transition count 1024
Applied a total of 18 rules in 27 ms. Remains 647 /656 variables (removed 9) and now considering 1024/1042 (removed 18) transitions.
// Phase 1: matrix 1024 rows 647 cols
[2024-05-22 07:08:18] [INFO ] Computed 23 invariants in 7 ms
[2024-05-22 07:08:18] [INFO ] Implicit Places using invariants in 303 ms returned [146]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 304 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 646/656 places, 1024/1042 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 645 transition count 1023
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 645 transition count 1023
Applied a total of 2 rules in 24 ms. Remains 645 /646 variables (removed 1) and now considering 1023/1024 (removed 1) transitions.
// Phase 1: matrix 1023 rows 645 cols
[2024-05-22 07:08:18] [INFO ] Computed 22 invariants in 8 ms
[2024-05-22 07:08:18] [INFO ] Implicit Places using invariants in 300 ms returned []
[2024-05-22 07:08:18] [INFO ] Invariant cache hit.
[2024-05-22 07:08:19] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-22 07:08:20] [INFO ] Implicit Places using invariants and state equation in 1970 ms returned []
Implicit Place search using SMT with State Equation took 2286 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 645/656 places, 1023/1042 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2641 ms. Remains : 645/656 places, 1023/1042 transitions.
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-020-LTLFireability-03
Stuttering criterion allowed to conclude after 1806 steps with 4 reset in 6 ms.
FORMULA CANConstruction-PT-020-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-020-LTLFireability-03 finished in 2830 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 2 out of 656 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 656/656 places, 1042/1042 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 646 transition count 1022
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 646 transition count 1022
Applied a total of 20 rules in 22 ms. Remains 646 /656 variables (removed 10) and now considering 1022/1042 (removed 20) transitions.
// Phase 1: matrix 1022 rows 646 cols
[2024-05-22 07:08:21] [INFO ] Computed 23 invariants in 8 ms
[2024-05-22 07:08:21] [INFO ] Implicit Places using invariants in 281 ms returned [96, 146]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 283 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 644/656 places, 1022/1042 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 642 transition count 1020
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 642 transition count 1020
Applied a total of 4 rules in 22 ms. Remains 642 /644 variables (removed 2) and now considering 1020/1022 (removed 2) transitions.
// Phase 1: matrix 1020 rows 642 cols
[2024-05-22 07:08:21] [INFO ] Computed 21 invariants in 8 ms
[2024-05-22 07:08:21] [INFO ] Implicit Places using invariants in 280 ms returned []
[2024-05-22 07:08:21] [INFO ] Invariant cache hit.
[2024-05-22 07:08:21] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-22 07:08:23] [INFO ] Implicit Places using invariants and state equation in 2030 ms returned []
Implicit Place search using SMT with State Equation took 2312 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 642/656 places, 1020/1042 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2639 ms. Remains : 642/656 places, 1020/1042 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-020-LTLFireability-05
Stuttering criterion allowed to conclude after 726 steps with 3 reset in 6 ms.
FORMULA CANConstruction-PT-020-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-020-LTLFireability-05 finished in 2753 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 656 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 656/656 places, 1042/1042 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 131 transitions
Trivial Post-agglo rules discarded 131 transitions
Performed 131 trivial Post agglomeration. Transition count delta: 131
Iterating post reduction 0 with 131 rules applied. Total rules applied 131 place count 656 transition count 911
Reduce places removed 131 places and 0 transitions.
Iterating post reduction 1 with 131 rules applied. Total rules applied 262 place count 525 transition count 911
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 262 place count 525 transition count 893
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 298 place count 507 transition count 893
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 307 place count 498 transition count 875
Iterating global reduction 2 with 9 rules applied. Total rules applied 316 place count 498 transition count 875
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 2 with 8 rules applied. Total rules applied 324 place count 498 transition count 867
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 332 place count 490 transition count 867
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 372 place count 470 transition count 847
Applied a total of 372 rules in 60 ms. Remains 470 /656 variables (removed 186) and now considering 847/1042 (removed 195) transitions.
// Phase 1: matrix 847 rows 470 cols
[2024-05-22 07:08:23] [INFO ] Computed 23 invariants in 10 ms
[2024-05-22 07:08:24] [INFO ] Implicit Places using invariants in 252 ms returned [27, 42]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 254 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 468/656 places, 847/1042 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 468 transition count 843
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 464 transition count 843
Applied a total of 8 rules in 25 ms. Remains 464 /468 variables (removed 4) and now considering 843/847 (removed 4) transitions.
// Phase 1: matrix 843 rows 464 cols
[2024-05-22 07:08:24] [INFO ] Computed 21 invariants in 7 ms
[2024-05-22 07:08:24] [INFO ] Implicit Places using invariants in 251 ms returned []
[2024-05-22 07:08:24] [INFO ] Invariant cache hit.
[2024-05-22 07:08:24] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-22 07:08:26] [INFO ] Implicit Places using invariants and state equation in 1702 ms returned []
Implicit Place search using SMT with State Equation took 1955 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 464/656 places, 843/1042 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2297 ms. Remains : 464/656 places, 843/1042 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-020-LTLFireability-06
Stuttering criterion allowed to conclude after 126 steps with 0 reset in 1 ms.
FORMULA CANConstruction-PT-020-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-020-LTLFireability-06 finished in 2352 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p1)||p0)))'
Support contains 3 out of 656 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 656/656 places, 1042/1042 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 646 transition count 1022
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 646 transition count 1022
Applied a total of 20 rules in 27 ms. Remains 646 /656 variables (removed 10) and now considering 1022/1042 (removed 20) transitions.
// Phase 1: matrix 1022 rows 646 cols
[2024-05-22 07:08:26] [INFO ] Computed 23 invariants in 11 ms
[2024-05-22 07:08:26] [INFO ] Implicit Places using invariants in 287 ms returned [96, 146]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 288 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 644/656 places, 1022/1042 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 642 transition count 1020
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 642 transition count 1020
Applied a total of 4 rules in 23 ms. Remains 642 /644 variables (removed 2) and now considering 1020/1022 (removed 2) transitions.
// Phase 1: matrix 1020 rows 642 cols
[2024-05-22 07:08:26] [INFO ] Computed 21 invariants in 6 ms
[2024-05-22 07:08:26] [INFO ] Implicit Places using invariants in 290 ms returned []
[2024-05-22 07:08:26] [INFO ] Invariant cache hit.
[2024-05-22 07:08:27] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-22 07:08:28] [INFO ] Implicit Places using invariants and state equation in 1965 ms returned []
Implicit Place search using SMT with State Equation took 2266 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 642/656 places, 1020/1042 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2605 ms. Remains : 642/656 places, 1020/1042 transitions.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANConstruction-PT-020-LTLFireability-08
Stuttering criterion allowed to conclude after 283 steps with 0 reset in 3 ms.
FORMULA CANConstruction-PT-020-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-020-LTLFireability-08 finished in 2702 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 U p1)))||!(p0 U !p0)))'
Support contains 2 out of 656 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 656/656 places, 1042/1042 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 648 transition count 1026
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 648 transition count 1026
Applied a total of 16 rules in 30 ms. Remains 648 /656 variables (removed 8) and now considering 1026/1042 (removed 16) transitions.
// Phase 1: matrix 1026 rows 648 cols
[2024-05-22 07:08:28] [INFO ] Computed 23 invariants in 9 ms
[2024-05-22 07:08:29] [INFO ] Implicit Places using invariants in 294 ms returned [96, 146]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 296 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 646/656 places, 1026/1042 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 644 transition count 1024
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 644 transition count 1024
Applied a total of 4 rules in 22 ms. Remains 644 /646 variables (removed 2) and now considering 1024/1026 (removed 2) transitions.
// Phase 1: matrix 1024 rows 644 cols
[2024-05-22 07:08:29] [INFO ] Computed 21 invariants in 7 ms
[2024-05-22 07:08:29] [INFO ] Implicit Places using invariants in 293 ms returned []
[2024-05-22 07:08:29] [INFO ] Invariant cache hit.
[2024-05-22 07:08:29] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-22 07:08:31] [INFO ] Implicit Places using invariants and state equation in 1873 ms returned []
Implicit Place search using SMT with State Equation took 2167 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 644/656 places, 1024/1042 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2516 ms. Remains : 644/656 places, 1024/1042 transitions.
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) p1), p1, (AND (NOT p0) p1)]
Running random walk in product with property : CANConstruction-PT-020-LTLFireability-09
Product exploration explored 100000 steps with 50000 reset in 323 ms.
Product exploration explored 100000 steps with 50000 reset in 355 ms.
Computed a total of 61 stabilizing places and 80 stable transitions
Computed a total of 61 stabilizing places and 80 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 93 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-020-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-020-LTLFireability-09 finished in 3477 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0&&X(p1))))))'
Support contains 3 out of 656 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 656/656 places, 1042/1042 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 646 transition count 1022
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 646 transition count 1022
Applied a total of 20 rules in 34 ms. Remains 646 /656 variables (removed 10) and now considering 1022/1042 (removed 20) transitions.
// Phase 1: matrix 1022 rows 646 cols
[2024-05-22 07:08:32] [INFO ] Computed 23 invariants in 9 ms
[2024-05-22 07:08:32] [INFO ] Implicit Places using invariants in 296 ms returned [96, 146]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 297 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 644/656 places, 1022/1042 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 642 transition count 1020
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 642 transition count 1020
Applied a total of 4 rules in 24 ms. Remains 642 /644 variables (removed 2) and now considering 1020/1022 (removed 2) transitions.
// Phase 1: matrix 1020 rows 642 cols
[2024-05-22 07:08:32] [INFO ] Computed 21 invariants in 12 ms
[2024-05-22 07:08:33] [INFO ] Implicit Places using invariants in 289 ms returned []
[2024-05-22 07:08:33] [INFO ] Invariant cache hit.
[2024-05-22 07:08:33] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-22 07:08:35] [INFO ] Implicit Places using invariants and state equation in 2009 ms returned []
Implicit Place search using SMT with State Equation took 2313 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 642/656 places, 1020/1042 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2672 ms. Remains : 642/656 places, 1020/1042 transitions.
Stuttering acceptance computed with spot in 218 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : CANConstruction-PT-020-LTLFireability-10
Entered a terminal (fully accepting) state of product in 1650 steps with 4 reset in 7 ms.
FORMULA CANConstruction-PT-020-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-020-LTLFireability-10 finished in 2922 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 656 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 656/656 places, 1042/1042 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 131 transitions
Trivial Post-agglo rules discarded 131 transitions
Performed 131 trivial Post agglomeration. Transition count delta: 131
Iterating post reduction 0 with 131 rules applied. Total rules applied 131 place count 656 transition count 911
Reduce places removed 131 places and 0 transitions.
Iterating post reduction 1 with 131 rules applied. Total rules applied 262 place count 525 transition count 911
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 262 place count 525 transition count 893
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 298 place count 507 transition count 893
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 307 place count 498 transition count 875
Iterating global reduction 2 with 9 rules applied. Total rules applied 316 place count 498 transition count 875
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 2 with 8 rules applied. Total rules applied 324 place count 498 transition count 867
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 332 place count 490 transition count 867
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 42 rules applied. Total rules applied 374 place count 469 transition count 846
Applied a total of 374 rules in 79 ms. Remains 469 /656 variables (removed 187) and now considering 846/1042 (removed 196) transitions.
// Phase 1: matrix 846 rows 469 cols
[2024-05-22 07:08:35] [INFO ] Computed 23 invariants in 4 ms
[2024-05-22 07:08:35] [INFO ] Implicit Places using invariants in 236 ms returned [26, 41]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 238 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 467/656 places, 846/1042 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 467 transition count 842
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 463 transition count 842
Applied a total of 8 rules in 19 ms. Remains 463 /467 variables (removed 4) and now considering 842/846 (removed 4) transitions.
// Phase 1: matrix 842 rows 463 cols
[2024-05-22 07:08:35] [INFO ] Computed 21 invariants in 3 ms
[2024-05-22 07:08:35] [INFO ] Implicit Places using invariants in 244 ms returned []
[2024-05-22 07:08:35] [INFO ] Invariant cache hit.
[2024-05-22 07:08:36] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-22 07:08:37] [INFO ] Implicit Places using invariants and state equation in 1548 ms returned []
Implicit Place search using SMT with State Equation took 1797 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 463/656 places, 842/1042 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2135 ms. Remains : 463/656 places, 842/1042 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-020-LTLFireability-12
Product exploration explored 100000 steps with 743 reset in 435 ms.
Stack based approach found an accepted trace after 48338 steps with 355 reset with depth 108 and stack size 108 in 220 ms.
FORMULA CANConstruction-PT-020-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property CANConstruction-PT-020-LTLFireability-12 finished in 2859 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(G((F(p2)||p1))))))'
Support contains 5 out of 656 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 656/656 places, 1042/1042 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 649 transition count 1028
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 649 transition count 1028
Applied a total of 14 rules in 28 ms. Remains 649 /656 variables (removed 7) and now considering 1028/1042 (removed 14) transitions.
// Phase 1: matrix 1028 rows 649 cols
[2024-05-22 07:08:38] [INFO ] Computed 23 invariants in 10 ms
[2024-05-22 07:08:38] [INFO ] Implicit Places using invariants in 316 ms returned [96, 146]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 318 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 647/656 places, 1028/1042 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 645 transition count 1026
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 645 transition count 1026
Applied a total of 4 rules in 21 ms. Remains 645 /647 variables (removed 2) and now considering 1026/1028 (removed 2) transitions.
// Phase 1: matrix 1026 rows 645 cols
[2024-05-22 07:08:38] [INFO ] Computed 21 invariants in 6 ms
[2024-05-22 07:08:38] [INFO ] Implicit Places using invariants in 289 ms returned []
[2024-05-22 07:08:38] [INFO ] Invariant cache hit.
[2024-05-22 07:08:39] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-22 07:08:40] [INFO ] Implicit Places using invariants and state equation in 2060 ms returned []
Implicit Place search using SMT with State Equation took 2353 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 645/656 places, 1026/1042 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2721 ms. Remains : 645/656 places, 1026/1042 transitions.
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : CANConstruction-PT-020-LTLFireability-13
Product exploration explored 100000 steps with 50000 reset in 302 ms.
Product exploration explored 100000 steps with 50000 reset in 308 ms.
Computed a total of 61 stabilizing places and 80 stable transitions
Computed a total of 61 stabilizing places and 80 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 17 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-020-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-020-LTLFireability-13 finished in 3551 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((G(F(!p0))||G(!p1)) U p2))))'
Support contains 7 out of 656 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 656/656 places, 1042/1042 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 127 transitions
Trivial Post-agglo rules discarded 127 transitions
Performed 127 trivial Post agglomeration. Transition count delta: 127
Iterating post reduction 0 with 127 rules applied. Total rules applied 127 place count 656 transition count 915
Reduce places removed 127 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 128 rules applied. Total rules applied 255 place count 529 transition count 914
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 256 place count 528 transition count 914
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 256 place count 528 transition count 896
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 292 place count 510 transition count 896
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 302 place count 500 transition count 876
Iterating global reduction 3 with 10 rules applied. Total rules applied 312 place count 500 transition count 876
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 3 with 8 rules applied. Total rules applied 320 place count 500 transition count 868
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 328 place count 492 transition count 868
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 362 place count 475 transition count 851
Applied a total of 362 rules in 56 ms. Remains 475 /656 variables (removed 181) and now considering 851/1042 (removed 191) transitions.
// Phase 1: matrix 851 rows 475 cols
[2024-05-22 07:08:41] [INFO ] Computed 23 invariants in 10 ms
[2024-05-22 07:08:42] [INFO ] Implicit Places using invariants in 282 ms returned [27, 43]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 284 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 473/656 places, 851/1042 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 473 transition count 847
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 469 transition count 847
Applied a total of 8 rules in 19 ms. Remains 469 /473 variables (removed 4) and now considering 847/851 (removed 4) transitions.
// Phase 1: matrix 847 rows 469 cols
[2024-05-22 07:08:42] [INFO ] Computed 21 invariants in 3 ms
[2024-05-22 07:08:42] [INFO ] Implicit Places using invariants in 223 ms returned []
[2024-05-22 07:08:42] [INFO ] Invariant cache hit.
[2024-05-22 07:08:42] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-22 07:08:43] [INFO ] Implicit Places using invariants and state equation in 1708 ms returned []
Implicit Place search using SMT with State Equation took 1933 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 469/656 places, 847/1042 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2294 ms. Remains : 469/656 places, 847/1042 transitions.
Stuttering acceptance computed with spot in 465 ms :[(NOT p2), (AND p1 (NOT p2) p0), (NOT p2), (AND p0 (NOT p2)), (AND (NOT p2) p1 p0), (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Running random walk in product with property : CANConstruction-PT-020-LTLFireability-14
Product exploration explored 100000 steps with 715 reset in 381 ms.
Product exploration explored 100000 steps with 705 reset in 388 ms.
Computed a total of 21 stabilizing places and 40 stable transitions
Computed a total of 21 stabilizing places and 40 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT (AND p0 p1))), (X (NOT (AND p2 p0 p1))), (X (NOT (AND (NOT p2) p0 p1))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (OR (AND p2 p0) (AND p0 (NOT p1))))), (X (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X (NOT p0)), (X (NOT (AND p2 p0 (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (OR (AND p2 p0) (AND p0 (NOT p1)))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT (AND p2 p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 251 ms. Reduced automaton from 7 states, 30 edges and 3 AP (stutter insensitive) to 7 states, 29 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 353 ms :[(NOT p2), (AND p1 (NOT p2) p0), (NOT p2), (AND p0 (NOT p2)), (AND p1 (NOT p2) p0), (AND p0 (NOT p2)), (AND (NOT p1) (NOT p2) p0)]
RANDOM walk for 40000 steps (274 resets) in 477 ms. (83 steps per ms) remains 3/11 properties
BEST_FIRST walk for 40004 steps (12 resets) in 33 ms. (1176 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (11 resets) in 34 ms. (1142 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (10 resets) in 75 ms. (526 steps per ms) remains 3/3 properties
[2024-05-22 07:08:46] [INFO ] Invariant cache hit.
[2024-05-22 07:08:46] [INFO ] State equation strengthened by 780 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf4 is UNSAT
Problem apf6 is UNSAT
Problem apf9 is UNSAT
After SMT solving in domain Real declared 454/1316 variables, and 7 constraints, problems are : Problem set: 3 solved, 0 unsolved in 77 ms.
Refiners :[Positive P Invariants (semi-flows): 7/21 constraints, State Equation: 0/469 constraints, ReadFeed: 0/780 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 107ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT (AND p0 p1))), (X (NOT (AND p2 p0 p1))), (X (NOT (AND (NOT p2) p0 p1))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (OR (AND p2 p0) (AND p0 (NOT p1))))), (X (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X (NOT p0)), (X (NOT (AND p2 p0 (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (OR (AND p2 p0) (AND p0 (NOT p1)))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT (AND p2 p0 (NOT p1))))), (G (OR (NOT p1) (NOT p0))), (G (OR (NOT p1) (NOT p2) (NOT p0))), (G (OR (NOT p1) p2 (NOT p0)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p1) p2))), (F p2), (F (NOT (OR p1 p2 (NOT p0)))), (F (NOT (OR p1 (NOT p2) (NOT p0)))), (F p0), (F p1), (F (NOT (AND (OR p1 (NOT p0)) (OR (NOT p2) (NOT p0)))))]
Knowledge based reduction with 26 factoid took 374 ms. Reduced automaton from 7 states, 29 edges and 3 AP (stutter insensitive) to 5 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 238 ms :[(NOT p2), (AND p1 (NOT p2) p0), (NOT p2), (AND (NOT p2) p0), (AND (NOT p2) p0)]
Stuttering acceptance computed with spot in 212 ms :[(NOT p2), (AND p1 (NOT p2) p0), (NOT p2), (AND (NOT p2) p0), (AND (NOT p2) p0)]
[2024-05-22 07:08:47] [INFO ] Invariant cache hit.
[2024-05-22 07:08:47] [INFO ] [Real]Absence check using 21 positive place invariants in 16 ms returned sat
[2024-05-22 07:08:48] [INFO ] [Real]Absence check using state equation in 539 ms returned sat
[2024-05-22 07:08:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 07:08:48] [INFO ] [Nat]Absence check using 21 positive place invariants in 16 ms returned sat
[2024-05-22 07:08:49] [INFO ] [Nat]Absence check using state equation in 553 ms returned sat
[2024-05-22 07:08:49] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-22 07:08:49] [INFO ] [Nat]Added 780 Read/Feed constraints in 133 ms returned sat
[2024-05-22 07:08:49] [INFO ] Computed and/alt/rep : 767/2502/767 causal constraints (skipped 60 transitions) in 59 ms.
[2024-05-22 07:08:49] [INFO ] Added : 43 causal constraints over 9 iterations in 588 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 7 out of 469 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 469/469 places, 847/847 transitions.
Applied a total of 0 rules in 15 ms. Remains 469 /469 variables (removed 0) and now considering 847/847 (removed 0) transitions.
[2024-05-22 07:08:49] [INFO ] Invariant cache hit.
[2024-05-22 07:08:50] [INFO ] Implicit Places using invariants in 263 ms returned []
[2024-05-22 07:08:50] [INFO ] Invariant cache hit.
[2024-05-22 07:08:50] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-22 07:08:51] [INFO ] Implicit Places using invariants and state equation in 1572 ms returned []
Implicit Place search using SMT with State Equation took 1837 ms to find 0 implicit places.
[2024-05-22 07:08:51] [INFO ] Redundant transitions in 10 ms returned []
Running 827 sub problems to find dead transitions.
[2024-05-22 07:08:51] [INFO ] Invariant cache hit.
[2024-05-22 07:08:51] [INFO ] State equation strengthened by 780 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/468 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 827 unsolved
[2024-05-22 07:08:58] [INFO ] Deduced a trap composed of 23 places in 179 ms of which 3 ms to minimize.
[2024-05-22 07:08:58] [INFO ] Deduced a trap composed of 23 places in 172 ms of which 3 ms to minimize.
[2024-05-22 07:08:59] [INFO ] Deduced a trap composed of 28 places in 172 ms of which 3 ms to minimize.
[2024-05-22 07:08:59] [INFO ] Deduced a trap composed of 23 places in 161 ms of which 3 ms to minimize.
[2024-05-22 07:08:59] [INFO ] Deduced a trap composed of 27 places in 159 ms of which 3 ms to minimize.
[2024-05-22 07:08:59] [INFO ] Deduced a trap composed of 23 places in 161 ms of which 3 ms to minimize.
[2024-05-22 07:08:59] [INFO ] Deduced a trap composed of 23 places in 154 ms of which 3 ms to minimize.
[2024-05-22 07:08:59] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 2 ms to minimize.
[2024-05-22 07:09:00] [INFO ] Deduced a trap composed of 28 places in 150 ms of which 3 ms to minimize.
[2024-05-22 07:09:00] [INFO ] Deduced a trap composed of 23 places in 143 ms of which 3 ms to minimize.
[2024-05-22 07:09:00] [INFO ] Deduced a trap composed of 30 places in 146 ms of which 3 ms to minimize.
[2024-05-22 07:09:00] [INFO ] Deduced a trap composed of 24 places in 144 ms of which 3 ms to minimize.
[2024-05-22 07:09:00] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 3 ms to minimize.
[2024-05-22 07:09:00] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 3 ms to minimize.
[2024-05-22 07:09:00] [INFO ] Deduced a trap composed of 27 places in 127 ms of which 3 ms to minimize.
[2024-05-22 07:09:01] [INFO ] Deduced a trap composed of 26 places in 136 ms of which 3 ms to minimize.
[2024-05-22 07:09:01] [INFO ] Deduced a trap composed of 24 places in 124 ms of which 3 ms to minimize.
[2024-05-22 07:09:01] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 3 ms to minimize.
[2024-05-22 07:09:01] [INFO ] Deduced a trap composed of 26 places in 137 ms of which 3 ms to minimize.
[2024-05-22 07:09:01] [INFO ] Deduced a trap composed of 24 places in 135 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/468 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 827 unsolved
[2024-05-22 07:09:02] [INFO ] Deduced a trap composed of 28 places in 125 ms of which 2 ms to minimize.
[2024-05-22 07:09:02] [INFO ] Deduced a trap composed of 28 places in 125 ms of which 2 ms to minimize.
[2024-05-22 07:09:03] [INFO ] Deduced a trap composed of 29 places in 120 ms of which 3 ms to minimize.
[2024-05-22 07:09:03] [INFO ] Deduced a trap composed of 30 places in 121 ms of which 2 ms to minimize.
[2024-05-22 07:09:03] [INFO ] Deduced a trap composed of 30 places in 124 ms of which 3 ms to minimize.
[2024-05-22 07:09:03] [INFO ] Deduced a trap composed of 29 places in 128 ms of which 3 ms to minimize.
[2024-05-22 07:09:03] [INFO ] Deduced a trap composed of 24 places in 120 ms of which 3 ms to minimize.
[2024-05-22 07:09:03] [INFO ] Deduced a trap composed of 24 places in 143 ms of which 3 ms to minimize.
[2024-05-22 07:09:04] [INFO ] Deduced a trap composed of 25 places in 142 ms of which 3 ms to minimize.
[2024-05-22 07:09:04] [INFO ] Deduced a trap composed of 30 places in 140 ms of which 3 ms to minimize.
[2024-05-22 07:09:04] [INFO ] Deduced a trap composed of 25 places in 140 ms of which 3 ms to minimize.
[2024-05-22 07:09:04] [INFO ] Deduced a trap composed of 29 places in 139 ms of which 3 ms to minimize.
[2024-05-22 07:09:04] [INFO ] Deduced a trap composed of 28 places in 137 ms of which 3 ms to minimize.
[2024-05-22 07:09:04] [INFO ] Deduced a trap composed of 25 places in 138 ms of which 2 ms to minimize.
[2024-05-22 07:09:04] [INFO ] Deduced a trap composed of 25 places in 135 ms of which 3 ms to minimize.
[2024-05-22 07:09:05] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 3 ms to minimize.
[2024-05-22 07:09:05] [INFO ] Deduced a trap composed of 24 places in 131 ms of which 3 ms to minimize.
[2024-05-22 07:09:05] [INFO ] Deduced a trap composed of 25 places in 119 ms of which 3 ms to minimize.
[2024-05-22 07:09:05] [INFO ] Deduced a trap composed of 25 places in 128 ms of which 2 ms to minimize.
[2024-05-22 07:09:05] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/468 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 827 unsolved
[2024-05-22 07:09:06] [INFO ] Deduced a trap composed of 23 places in 145 ms of which 4 ms to minimize.
[2024-05-22 07:09:06] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 2 ms to minimize.
[2024-05-22 07:09:06] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 3 ms to minimize.
[2024-05-22 07:09:07] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 3 ms to minimize.
[2024-05-22 07:09:07] [INFO ] Deduced a trap composed of 24 places in 124 ms of which 3 ms to minimize.
[2024-05-22 07:09:07] [INFO ] Deduced a trap composed of 24 places in 120 ms of which 3 ms to minimize.
[2024-05-22 07:09:07] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 3 ms to minimize.
[2024-05-22 07:09:07] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 3 ms to minimize.
[2024-05-22 07:09:07] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 2 ms to minimize.
[2024-05-22 07:09:08] [INFO ] Deduced a trap composed of 25 places in 124 ms of which 2 ms to minimize.
[2024-05-22 07:09:08] [INFO ] Deduced a trap composed of 28 places in 131 ms of which 3 ms to minimize.
[2024-05-22 07:09:08] [INFO ] Deduced a trap composed of 29 places in 127 ms of which 3 ms to minimize.
[2024-05-22 07:09:08] [INFO ] Deduced a trap composed of 27 places in 125 ms of which 2 ms to minimize.
[2024-05-22 07:09:08] [INFO ] Deduced a trap composed of 25 places in 139 ms of which 3 ms to minimize.
[2024-05-22 07:09:08] [INFO ] Deduced a trap composed of 25 places in 143 ms of which 3 ms to minimize.
[2024-05-22 07:09:08] [INFO ] Deduced a trap composed of 27 places in 132 ms of which 2 ms to minimize.
[2024-05-22 07:09:09] [INFO ] Deduced a trap composed of 27 places in 126 ms of which 2 ms to minimize.
[2024-05-22 07:09:09] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 3 ms to minimize.
[2024-05-22 07:09:09] [INFO ] Deduced a trap composed of 24 places in 122 ms of which 2 ms to minimize.
[2024-05-22 07:09:09] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/468 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 827 unsolved
[2024-05-22 07:09:16] [INFO ] Deduced a trap composed of 28 places in 131 ms of which 2 ms to minimize.
[2024-05-22 07:09:16] [INFO ] Deduced a trap composed of 24 places in 129 ms of which 2 ms to minimize.
[2024-05-22 07:09:16] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 2 ms to minimize.
[2024-05-22 07:09:16] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 2 ms to minimize.
[2024-05-22 07:09:16] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 3 ms to minimize.
[2024-05-22 07:09:17] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 2 ms to minimize.
[2024-05-22 07:09:17] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 3 ms to minimize.
[2024-05-22 07:09:17] [INFO ] Deduced a trap composed of 24 places in 153 ms of which 2 ms to minimize.
[2024-05-22 07:09:17] [INFO ] Deduced a trap composed of 24 places in 139 ms of which 3 ms to minimize.
[2024-05-22 07:09:17] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 2 ms to minimize.
[2024-05-22 07:09:17] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 2 ms to minimize.
[2024-05-22 07:09:18] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 3 ms to minimize.
[2024-05-22 07:09:18] [INFO ] Deduced a trap composed of 23 places in 143 ms of which 3 ms to minimize.
[2024-05-22 07:09:18] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 3 ms to minimize.
[2024-05-22 07:09:18] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 3 ms to minimize.
[2024-05-22 07:09:18] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 3 ms to minimize.
[2024-05-22 07:09:18] [INFO ] Deduced a trap composed of 27 places in 136 ms of which 2 ms to minimize.
[2024-05-22 07:09:19] [INFO ] Deduced a trap composed of 25 places in 146 ms of which 3 ms to minimize.
[2024-05-22 07:09:19] [INFO ] Deduced a trap composed of 27 places in 137 ms of which 3 ms to minimize.
[2024-05-22 07:09:19] [INFO ] Deduced a trap composed of 24 places in 128 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/468 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 827 unsolved
[2024-05-22 07:09:20] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 3 ms to minimize.
[2024-05-22 07:09:20] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 2 ms to minimize.
[2024-05-22 07:09:21] [INFO ] Deduced a trap composed of 28 places in 156 ms of which 3 ms to minimize.
[2024-05-22 07:09:21] [INFO ] Deduced a trap composed of 27 places in 162 ms of which 3 ms to minimize.
[2024-05-22 07:09:21] [INFO ] Deduced a trap composed of 23 places in 155 ms of which 3 ms to minimize.
[2024-05-22 07:09:21] [INFO ] Deduced a trap composed of 24 places in 172 ms of which 3 ms to minimize.
[2024-05-22 07:09:21] [INFO ] Deduced a trap composed of 24 places in 152 ms of which 3 ms to minimize.
[2024-05-22 07:09:21] [INFO ] Deduced a trap composed of 24 places in 145 ms of which 3 ms to minimize.
[2024-05-22 07:09:22] [INFO ] Deduced a trap composed of 24 places in 172 ms of which 2 ms to minimize.
[2024-05-22 07:09:22] [INFO ] Deduced a trap composed of 26 places in 141 ms of which 3 ms to minimize.
SMT process timed out in 30421ms, After SMT, problems are : Problem set: 0 solved, 827 unsolved
Search for dead transitions found 0 dead transitions in 30430ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 32299 ms. Remains : 469/469 places, 847/847 transitions.
Computed a total of 21 stabilizing places and 40 stable transitions
Computed a total of 21 stabilizing places and 40 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 188 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter insensitive) to 5 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 224 ms :[(NOT p2), (AND p1 (NOT p2) p0), (NOT p2), (AND (NOT p2) p0), (AND (NOT p2) p0)]
RANDOM walk for 40000 steps (274 resets) in 279 ms. (142 steps per ms) remains 1/7 properties
BEST_FIRST walk for 40004 steps (11 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
[2024-05-22 07:09:22] [INFO ] Invariant cache hit.
[2024-05-22 07:09:22] [INFO ] State equation strengthened by 780 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf5 is UNSAT
After SMT solving in domain Real declared 454/1316 variables, and 7 constraints, problems are : Problem set: 1 solved, 0 unsolved in 79 ms.
Refiners :[Positive P Invariants (semi-flows): 7/21 constraints, State Equation: 0/469 constraints, ReadFeed: 0/780 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 116ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT p0))), (G (OR (NOT p1) p2 (NOT p0)))]
False Knowledge obtained : [(F (NOT (OR p2 (NOT p0)))), (F (NOT (OR (NOT p1) p2))), (F p0), (F p2), (F p1), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 13 factoid took 399 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter insensitive) to 5 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 199 ms :[(NOT p2), (AND p1 (NOT p2) p0), (NOT p2), (AND (NOT p2) p0), (AND (NOT p2) p0)]
Stuttering acceptance computed with spot in 189 ms :[(NOT p2), (AND p1 (NOT p2) p0), (NOT p2), (AND (NOT p2) p0), (AND (NOT p2) p0)]
[2024-05-22 07:09:23] [INFO ] Invariant cache hit.
[2024-05-22 07:09:24] [INFO ] [Real]Absence check using 21 positive place invariants in 15 ms returned sat
[2024-05-22 07:09:24] [INFO ] [Real]Absence check using state equation in 564 ms returned sat
[2024-05-22 07:09:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 07:09:25] [INFO ] [Nat]Absence check using 21 positive place invariants in 15 ms returned sat
[2024-05-22 07:09:25] [INFO ] [Nat]Absence check using state equation in 516 ms returned sat
[2024-05-22 07:09:25] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-22 07:09:25] [INFO ] [Nat]Added 780 Read/Feed constraints in 131 ms returned sat
[2024-05-22 07:09:25] [INFO ] Computed and/alt/rep : 767/2502/767 causal constraints (skipped 60 transitions) in 50 ms.
[2024-05-22 07:09:26] [INFO ] Added : 43 causal constraints over 9 iterations in 600 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 188 ms :[(NOT p2), (AND p1 (NOT p2) p0), (NOT p2), (AND (NOT p2) p0), (AND (NOT p2) p0)]
Product exploration explored 100000 steps with 699 reset in 374 ms.
Product exploration explored 100000 steps with 689 reset in 397 ms.
Support contains 7 out of 469 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 469/469 places, 847/847 transitions.
Applied a total of 0 rules in 14 ms. Remains 469 /469 variables (removed 0) and now considering 847/847 (removed 0) transitions.
[2024-05-22 07:09:27] [INFO ] Invariant cache hit.
[2024-05-22 07:09:27] [INFO ] Implicit Places using invariants in 271 ms returned []
[2024-05-22 07:09:27] [INFO ] Invariant cache hit.
[2024-05-22 07:09:27] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-22 07:09:29] [INFO ] Implicit Places using invariants and state equation in 1640 ms returned []
Implicit Place search using SMT with State Equation took 1941 ms to find 0 implicit places.
[2024-05-22 07:09:29] [INFO ] Redundant transitions in 7 ms returned []
Running 827 sub problems to find dead transitions.
[2024-05-22 07:09:29] [INFO ] Invariant cache hit.
[2024-05-22 07:09:29] [INFO ] State equation strengthened by 780 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/468 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 827 unsolved
[2024-05-22 07:09:36] [INFO ] Deduced a trap composed of 23 places in 178 ms of which 2 ms to minimize.
[2024-05-22 07:09:36] [INFO ] Deduced a trap composed of 23 places in 177 ms of which 3 ms to minimize.
[2024-05-22 07:09:36] [INFO ] Deduced a trap composed of 28 places in 171 ms of which 2 ms to minimize.
[2024-05-22 07:09:36] [INFO ] Deduced a trap composed of 23 places in 164 ms of which 3 ms to minimize.
[2024-05-22 07:09:37] [INFO ] Deduced a trap composed of 27 places in 167 ms of which 3 ms to minimize.
[2024-05-22 07:09:37] [INFO ] Deduced a trap composed of 23 places in 161 ms of which 3 ms to minimize.
[2024-05-22 07:09:37] [INFO ] Deduced a trap composed of 23 places in 167 ms of which 3 ms to minimize.
[2024-05-22 07:09:37] [INFO ] Deduced a trap composed of 23 places in 163 ms of which 3 ms to minimize.
[2024-05-22 07:09:37] [INFO ] Deduced a trap composed of 28 places in 139 ms of which 3 ms to minimize.
[2024-05-22 07:09:37] [INFO ] Deduced a trap composed of 23 places in 162 ms of which 3 ms to minimize.
[2024-05-22 07:09:38] [INFO ] Deduced a trap composed of 30 places in 186 ms of which 2 ms to minimize.
[2024-05-22 07:09:38] [INFO ] Deduced a trap composed of 24 places in 159 ms of which 3 ms to minimize.
[2024-05-22 07:09:38] [INFO ] Deduced a trap composed of 23 places in 145 ms of which 3 ms to minimize.
[2024-05-22 07:09:38] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 3 ms to minimize.
[2024-05-22 07:09:38] [INFO ] Deduced a trap composed of 27 places in 135 ms of which 2 ms to minimize.
[2024-05-22 07:09:38] [INFO ] Deduced a trap composed of 26 places in 146 ms of which 3 ms to minimize.
[2024-05-22 07:09:39] [INFO ] Deduced a trap composed of 24 places in 154 ms of which 3 ms to minimize.
[2024-05-22 07:09:39] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 3 ms to minimize.
[2024-05-22 07:09:39] [INFO ] Deduced a trap composed of 26 places in 156 ms of which 2 ms to minimize.
[2024-05-22 07:09:39] [INFO ] Deduced a trap composed of 24 places in 148 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/468 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 827 unsolved
[2024-05-22 07:09:40] [INFO ] Deduced a trap composed of 28 places in 134 ms of which 3 ms to minimize.
[2024-05-22 07:09:40] [INFO ] Deduced a trap composed of 28 places in 131 ms of which 3 ms to minimize.
[2024-05-22 07:09:40] [INFO ] Deduced a trap composed of 29 places in 148 ms of which 3 ms to minimize.
[2024-05-22 07:09:41] [INFO ] Deduced a trap composed of 30 places in 139 ms of which 4 ms to minimize.
[2024-05-22 07:09:41] [INFO ] Deduced a trap composed of 30 places in 138 ms of which 2 ms to minimize.
[2024-05-22 07:09:41] [INFO ] Deduced a trap composed of 29 places in 132 ms of which 3 ms to minimize.
[2024-05-22 07:09:41] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 3 ms to minimize.
[2024-05-22 07:09:41] [INFO ] Deduced a trap composed of 24 places in 145 ms of which 3 ms to minimize.
[2024-05-22 07:09:41] [INFO ] Deduced a trap composed of 25 places in 160 ms of which 2 ms to minimize.
[2024-05-22 07:09:42] [INFO ] Deduced a trap composed of 30 places in 161 ms of which 3 ms to minimize.
[2024-05-22 07:09:42] [INFO ] Deduced a trap composed of 25 places in 158 ms of which 2 ms to minimize.
[2024-05-22 07:09:42] [INFO ] Deduced a trap composed of 29 places in 162 ms of which 2 ms to minimize.
[2024-05-22 07:09:42] [INFO ] Deduced a trap composed of 28 places in 180 ms of which 3 ms to minimize.
[2024-05-22 07:09:42] [INFO ] Deduced a trap composed of 25 places in 152 ms of which 3 ms to minimize.
[2024-05-22 07:09:42] [INFO ] Deduced a trap composed of 25 places in 154 ms of which 2 ms to minimize.
[2024-05-22 07:09:43] [INFO ] Deduced a trap composed of 24 places in 194 ms of which 2 ms to minimize.
[2024-05-22 07:09:43] [INFO ] Deduced a trap composed of 24 places in 147 ms of which 2 ms to minimize.
[2024-05-22 07:09:43] [INFO ] Deduced a trap composed of 25 places in 138 ms of which 3 ms to minimize.
[2024-05-22 07:09:43] [INFO ] Deduced a trap composed of 25 places in 134 ms of which 3 ms to minimize.
[2024-05-22 07:09:43] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/468 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 827 unsolved
[2024-05-22 07:09:44] [INFO ] Deduced a trap composed of 23 places in 157 ms of which 3 ms to minimize.
[2024-05-22 07:09:44] [INFO ] Deduced a trap composed of 23 places in 143 ms of which 2 ms to minimize.
[2024-05-22 07:09:45] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 3 ms to minimize.
[2024-05-22 07:09:45] [INFO ] Deduced a trap composed of 24 places in 148 ms of which 2 ms to minimize.
[2024-05-22 07:09:45] [INFO ] Deduced a trap composed of 24 places in 150 ms of which 3 ms to minimize.
[2024-05-22 07:09:45] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 3 ms to minimize.
[2024-05-22 07:09:45] [INFO ] Deduced a trap composed of 23 places in 173 ms of which 3 ms to minimize.
[2024-05-22 07:09:46] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 2 ms to minimize.
[2024-05-22 07:09:46] [INFO ] Deduced a trap composed of 23 places in 144 ms of which 2 ms to minimize.
[2024-05-22 07:09:46] [INFO ] Deduced a trap composed of 25 places in 145 ms of which 2 ms to minimize.
[2024-05-22 07:09:46] [INFO ] Deduced a trap composed of 28 places in 157 ms of which 3 ms to minimize.
[2024-05-22 07:09:46] [INFO ] Deduced a trap composed of 29 places in 181 ms of which 3 ms to minimize.
[2024-05-22 07:09:46] [INFO ] Deduced a trap composed of 27 places in 156 ms of which 3 ms to minimize.
[2024-05-22 07:09:47] [INFO ] Deduced a trap composed of 25 places in 153 ms of which 3 ms to minimize.
[2024-05-22 07:09:47] [INFO ] Deduced a trap composed of 25 places in 158 ms of which 5 ms to minimize.
[2024-05-22 07:09:47] [INFO ] Deduced a trap composed of 27 places in 136 ms of which 3 ms to minimize.
[2024-05-22 07:09:47] [INFO ] Deduced a trap composed of 27 places in 162 ms of which 3 ms to minimize.
[2024-05-22 07:09:47] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 3 ms to minimize.
[2024-05-22 07:09:48] [INFO ] Deduced a trap composed of 24 places in 147 ms of which 3 ms to minimize.
[2024-05-22 07:09:48] [INFO ] Deduced a trap composed of 24 places in 111 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/468 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 827 unsolved
[2024-05-22 07:09:55] [INFO ] Deduced a trap composed of 28 places in 138 ms of which 3 ms to minimize.
[2024-05-22 07:09:55] [INFO ] Deduced a trap composed of 24 places in 138 ms of which 2 ms to minimize.
[2024-05-22 07:09:55] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 3 ms to minimize.
[2024-05-22 07:09:55] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 3 ms to minimize.
[2024-05-22 07:09:55] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 3 ms to minimize.
[2024-05-22 07:09:55] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 2 ms to minimize.
[2024-05-22 07:09:56] [INFO ] Deduced a trap composed of 23 places in 175 ms of which 3 ms to minimize.
[2024-05-22 07:09:56] [INFO ] Deduced a trap composed of 24 places in 166 ms of which 3 ms to minimize.
[2024-05-22 07:09:56] [INFO ] Deduced a trap composed of 24 places in 156 ms of which 3 ms to minimize.
[2024-05-22 07:09:56] [INFO ] Deduced a trap composed of 24 places in 156 ms of which 2 ms to minimize.
[2024-05-22 07:09:56] [INFO ] Deduced a trap composed of 23 places in 155 ms of which 3 ms to minimize.
[2024-05-22 07:09:56] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 3 ms to minimize.
[2024-05-22 07:09:57] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 2 ms to minimize.
[2024-05-22 07:09:57] [INFO ] Deduced a trap composed of 23 places in 145 ms of which 3 ms to minimize.
[2024-05-22 07:09:57] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 2 ms to minimize.
[2024-05-22 07:09:57] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 3 ms to minimize.
[2024-05-22 07:09:57] [INFO ] Deduced a trap composed of 27 places in 130 ms of which 3 ms to minimize.
[2024-05-22 07:09:57] [INFO ] Deduced a trap composed of 25 places in 144 ms of which 2 ms to minimize.
[2024-05-22 07:09:58] [INFO ] Deduced a trap composed of 27 places in 162 ms of which 2 ms to minimize.
[2024-05-22 07:09:58] [INFO ] Deduced a trap composed of 24 places in 167 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/468 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 827 unsolved
[2024-05-22 07:09:59] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 3 ms to minimize.
[2024-05-22 07:09:59] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 468/1316 variables, and 103 constraints, problems are : Problem set: 0 solved, 827 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 0/469 constraints, ReadFeed: 0/780 constraints, PredecessorRefiner: 827/827 constraints, Known Traps: 82/82 constraints]
Escalating to Integer solving :Problem set: 0 solved, 827 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/468 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 827 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/468 variables, 82/103 constraints. Problems are: Problem set: 0 solved, 827 unsolved
[2024-05-22 07:10:01] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 3 ms to minimize.
[2024-05-22 07:10:01] [INFO ] Deduced a trap composed of 24 places in 135 ms of which 3 ms to minimize.
[2024-05-22 07:10:01] [INFO ] Deduced a trap composed of 23 places in 161 ms of which 3 ms to minimize.
[2024-05-22 07:10:01] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 2 ms to minimize.
[2024-05-22 07:10:01] [INFO ] Deduced a trap composed of 25 places in 132 ms of which 3 ms to minimize.
[2024-05-22 07:10:02] [INFO ] Deduced a trap composed of 24 places in 181 ms of which 3 ms to minimize.
[2024-05-22 07:10:02] [INFO ] Deduced a trap composed of 23 places in 162 ms of which 3 ms to minimize.
[2024-05-22 07:10:02] [INFO ] Deduced a trap composed of 23 places in 159 ms of which 3 ms to minimize.
[2024-05-22 07:10:02] [INFO ] Deduced a trap composed of 23 places in 168 ms of which 3 ms to minimize.
[2024-05-22 07:10:02] [INFO ] Deduced a trap composed of 23 places in 177 ms of which 3 ms to minimize.
[2024-05-22 07:10:03] [INFO ] Deduced a trap composed of 29 places in 152 ms of which 3 ms to minimize.
[2024-05-22 07:10:03] [INFO ] Deduced a trap composed of 24 places in 142 ms of which 3 ms to minimize.
[2024-05-22 07:10:03] [INFO ] Deduced a trap composed of 25 places in 142 ms of which 3 ms to minimize.
[2024-05-22 07:10:03] [INFO ] Deduced a trap composed of 25 places in 144 ms of which 3 ms to minimize.
[2024-05-22 07:10:03] [INFO ] Deduced a trap composed of 29 places in 151 ms of which 3 ms to minimize.
[2024-05-22 07:10:03] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 2 ms to minimize.
[2024-05-22 07:10:04] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 3 ms to minimize.
[2024-05-22 07:10:04] [INFO ] Deduced a trap composed of 23 places in 144 ms of which 2 ms to minimize.
[2024-05-22 07:10:04] [INFO ] Deduced a trap composed of 25 places in 147 ms of which 3 ms to minimize.
[2024-05-22 07:10:04] [INFO ] Deduced a trap composed of 26 places in 136 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/468 variables, 20/123 constraints. Problems are: Problem set: 0 solved, 827 unsolved
[2024-05-22 07:10:05] [INFO ] Deduced a trap composed of 27 places in 157 ms of which 2 ms to minimize.
[2024-05-22 07:10:06] [INFO ] Deduced a trap composed of 24 places in 162 ms of which 2 ms to minimize.
[2024-05-22 07:10:06] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 3 ms to minimize.
[2024-05-22 07:10:06] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 2 ms to minimize.
[2024-05-22 07:10:06] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 3 ms to minimize.
[2024-05-22 07:10:06] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 2 ms to minimize.
[2024-05-22 07:10:06] [INFO ] Deduced a trap composed of 25 places in 142 ms of which 3 ms to minimize.
[2024-05-22 07:10:07] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 3 ms to minimize.
[2024-05-22 07:10:07] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 3 ms to minimize.
[2024-05-22 07:10:07] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 3 ms to minimize.
[2024-05-22 07:10:07] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 3 ms to minimize.
[2024-05-22 07:10:07] [INFO ] Deduced a trap composed of 24 places in 154 ms of which 3 ms to minimize.
[2024-05-22 07:10:07] [INFO ] Deduced a trap composed of 24 places in 129 ms of which 3 ms to minimize.
[2024-05-22 07:10:08] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 5 ms to minimize.
[2024-05-22 07:10:08] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 2 ms to minimize.
[2024-05-22 07:10:08] [INFO ] Deduced a trap composed of 28 places in 159 ms of which 3 ms to minimize.
[2024-05-22 07:10:08] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 3 ms to minimize.
[2024-05-22 07:10:08] [INFO ] Deduced a trap composed of 25 places in 164 ms of which 3 ms to minimize.
[2024-05-22 07:10:08] [INFO ] Deduced a trap composed of 27 places in 153 ms of which 3 ms to minimize.
[2024-05-22 07:10:09] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/468 variables, 20/143 constraints. Problems are: Problem set: 0 solved, 827 unsolved
[2024-05-22 07:10:10] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 3 ms to minimize.
[2024-05-22 07:10:10] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 2 ms to minimize.
[2024-05-22 07:10:10] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 2 ms to minimize.
[2024-05-22 07:10:10] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 3 ms to minimize.
[2024-05-22 07:10:11] [INFO ] Deduced a trap composed of 24 places in 142 ms of which 2 ms to minimize.
[2024-05-22 07:10:11] [INFO ] Deduced a trap composed of 24 places in 125 ms of which 2 ms to minimize.
[2024-05-22 07:10:11] [INFO ] Deduced a trap composed of 23 places in 151 ms of which 3 ms to minimize.
[2024-05-22 07:10:11] [INFO ] Deduced a trap composed of 28 places in 120 ms of which 2 ms to minimize.
[2024-05-22 07:10:11] [INFO ] Deduced a trap composed of 24 places in 125 ms of which 3 ms to minimize.
[2024-05-22 07:10:11] [INFO ] Deduced a trap composed of 24 places in 120 ms of which 2 ms to minimize.
[2024-05-22 07:10:12] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 2 ms to minimize.
[2024-05-22 07:10:12] [INFO ] Deduced a trap composed of 24 places in 165 ms of which 2 ms to minimize.
[2024-05-22 07:10:12] [INFO ] Deduced a trap composed of 24 places in 158 ms of which 3 ms to minimize.
[2024-05-22 07:10:12] [INFO ] Deduced a trap composed of 24 places in 138 ms of which 3 ms to minimize.
[2024-05-22 07:10:12] [INFO ] Deduced a trap composed of 24 places in 143 ms of which 3 ms to minimize.
[2024-05-22 07:10:13] [INFO ] Deduced a trap composed of 24 places in 153 ms of which 3 ms to minimize.
[2024-05-22 07:10:13] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 2 ms to minimize.
[2024-05-22 07:10:13] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 3 ms to minimize.
[2024-05-22 07:10:13] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 2 ms to minimize.
[2024-05-22 07:10:13] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/468 variables, 20/163 constraints. Problems are: Problem set: 0 solved, 827 unsolved
[2024-05-22 07:10:15] [INFO ] Deduced a trap composed of 24 places in 144 ms of which 3 ms to minimize.
[2024-05-22 07:10:15] [INFO ] Deduced a trap composed of 23 places in 154 ms of which 3 ms to minimize.
[2024-05-22 07:10:15] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 3 ms to minimize.
[2024-05-22 07:10:15] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 3 ms to minimize.
[2024-05-22 07:10:16] [INFO ] Deduced a trap composed of 26 places in 157 ms of which 2 ms to minimize.
[2024-05-22 07:10:16] [INFO ] Deduced a trap composed of 26 places in 162 ms of which 2 ms to minimize.
[2024-05-22 07:10:16] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 3 ms to minimize.
[2024-05-22 07:10:16] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 3 ms to minimize.
[2024-05-22 07:10:16] [INFO ] Deduced a trap composed of 23 places in 159 ms of which 3 ms to minimize.
[2024-05-22 07:10:17] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 2 ms to minimize.
[2024-05-22 07:10:17] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 2 ms to minimize.
[2024-05-22 07:10:17] [INFO ] Deduced a trap composed of 23 places in 174 ms of which 3 ms to minimize.
[2024-05-22 07:10:17] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 2 ms to minimize.
[2024-05-22 07:10:17] [INFO ] Deduced a trap composed of 27 places in 143 ms of which 3 ms to minimize.
[2024-05-22 07:10:17] [INFO ] Deduced a trap composed of 23 places in 168 ms of which 3 ms to minimize.
[2024-05-22 07:10:18] [INFO ] Deduced a trap composed of 25 places in 152 ms of which 2 ms to minimize.
[2024-05-22 07:10:18] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 2 ms to minimize.
[2024-05-22 07:10:18] [INFO ] Deduced a trap composed of 25 places in 136 ms of which 2 ms to minimize.
[2024-05-22 07:10:18] [INFO ] Deduced a trap composed of 27 places in 128 ms of which 2 ms to minimize.
[2024-05-22 07:10:18] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/468 variables, 20/183 constraints. Problems are: Problem set: 0 solved, 827 unsolved
[2024-05-22 07:10:20] [INFO ] Deduced a trap composed of 24 places in 145 ms of which 2 ms to minimize.
[2024-05-22 07:10:20] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 2 ms to minimize.
[2024-05-22 07:10:20] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 2 ms to minimize.
[2024-05-22 07:10:20] [INFO ] Deduced a trap composed of 24 places in 143 ms of which 2 ms to minimize.
[2024-05-22 07:10:21] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 2 ms to minimize.
[2024-05-22 07:10:21] [INFO ] Deduced a trap composed of 24 places in 146 ms of which 3 ms to minimize.
[2024-05-22 07:10:21] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 3 ms to minimize.
[2024-05-22 07:10:21] [INFO ] Deduced a trap composed of 23 places in 143 ms of which 2 ms to minimize.
[2024-05-22 07:10:21] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 3 ms to minimize.
[2024-05-22 07:10:21] [INFO ] Deduced a trap composed of 24 places in 152 ms of which 3 ms to minimize.
[2024-05-22 07:10:22] [INFO ] Deduced a trap composed of 24 places in 127 ms of which 2 ms to minimize.
[2024-05-22 07:10:22] [INFO ] Deduced a trap composed of 24 places in 135 ms of which 3 ms to minimize.
[2024-05-22 07:10:22] [INFO ] Deduced a trap composed of 25 places in 162 ms of which 18 ms to minimize.
[2024-05-22 07:10:22] [INFO ] Deduced a trap composed of 27 places in 133 ms of which 3 ms to minimize.
[2024-05-22 07:10:22] [INFO ] Deduced a trap composed of 24 places in 160 ms of which 3 ms to minimize.
[2024-05-22 07:10:22] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 4 ms to minimize.
[2024-05-22 07:10:23] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 3 ms to minimize.
[2024-05-22 07:10:23] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 3 ms to minimize.
[2024-05-22 07:10:23] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 3 ms to minimize.
[2024-05-22 07:10:23] [INFO ] Deduced a trap composed of 24 places in 119 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/468 variables, 20/203 constraints. Problems are: Problem set: 0 solved, 827 unsolved
[2024-05-22 07:10:24] [INFO ] Deduced a trap composed of 24 places in 164 ms of which 3 ms to minimize.
[2024-05-22 07:10:24] [INFO ] Deduced a trap composed of 24 places in 200 ms of which 3 ms to minimize.
[2024-05-22 07:10:25] [INFO ] Deduced a trap composed of 24 places in 148 ms of which 3 ms to minimize.
[2024-05-22 07:10:25] [INFO ] Deduced a trap composed of 24 places in 123 ms of which 3 ms to minimize.
[2024-05-22 07:10:25] [INFO ] Deduced a trap composed of 24 places in 125 ms of which 2 ms to minimize.
[2024-05-22 07:10:25] [INFO ] Deduced a trap composed of 24 places in 126 ms of which 3 ms to minimize.
[2024-05-22 07:10:25] [INFO ] Deduced a trap composed of 24 places in 133 ms of which 3 ms to minimize.
[2024-05-22 07:10:25] [INFO ] Deduced a trap composed of 24 places in 125 ms of which 2 ms to minimize.
[2024-05-22 07:10:26] [INFO ] Deduced a trap composed of 24 places in 131 ms of which 2 ms to minimize.
[2024-05-22 07:10:27] [INFO ] Deduced a trap composed of 24 places in 123 ms of which 3 ms to minimize.
[2024-05-22 07:10:27] [INFO ] Deduced a trap composed of 24 places in 133 ms of which 3 ms to minimize.
[2024-05-22 07:10:27] [INFO ] Deduced a trap composed of 26 places in 144 ms of which 2 ms to minimize.
[2024-05-22 07:10:27] [INFO ] Deduced a trap composed of 24 places in 131 ms of which 3 ms to minimize.
[2024-05-22 07:10:27] [INFO ] Deduced a trap composed of 24 places in 139 ms of which 3 ms to minimize.
[2024-05-22 07:10:27] [INFO ] Deduced a trap composed of 24 places in 148 ms of which 3 ms to minimize.
[2024-05-22 07:10:27] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 3 ms to minimize.
[2024-05-22 07:10:28] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 2 ms to minimize.
[2024-05-22 07:10:28] [INFO ] Deduced a trap composed of 23 places in 144 ms of which 2 ms to minimize.
[2024-05-22 07:10:28] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 2 ms to minimize.
[2024-05-22 07:10:28] [INFO ] Deduced a trap composed of 24 places in 149 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/468 variables, 20/223 constraints. Problems are: Problem set: 0 solved, 827 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 468/1316 variables, and 223 constraints, problems are : Problem set: 0 solved, 827 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 0/469 constraints, ReadFeed: 0/780 constraints, PredecessorRefiner: 0/827 constraints, Known Traps: 202/202 constraints]
After SMT, in 60304ms problems are : Problem set: 0 solved, 827 unsolved
Search for dead transitions found 0 dead transitions in 60313ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62290 ms. Remains : 469/469 places, 847/847 transitions.
Treatment of property CANConstruction-PT-020-LTLFireability-14 finished in 108092 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X((p1||F(p2)))))'
Support contains 4 out of 656 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 656/656 places, 1042/1042 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 648 transition count 1026
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 648 transition count 1026
Applied a total of 16 rules in 22 ms. Remains 648 /656 variables (removed 8) and now considering 1026/1042 (removed 16) transitions.
// Phase 1: matrix 1026 rows 648 cols
[2024-05-22 07:10:29] [INFO ] Computed 23 invariants in 6 ms
[2024-05-22 07:10:30] [INFO ] Implicit Places using invariants in 316 ms returned [96]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 317 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 647/656 places, 1026/1042 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 646 transition count 1025
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 646 transition count 1025
Applied a total of 2 rules in 28 ms. Remains 646 /647 variables (removed 1) and now considering 1025/1026 (removed 1) transitions.
// Phase 1: matrix 1025 rows 646 cols
[2024-05-22 07:10:30] [INFO ] Computed 22 invariants in 6 ms
[2024-05-22 07:10:30] [INFO ] Implicit Places using invariants in 296 ms returned []
[2024-05-22 07:10:30] [INFO ] Invariant cache hit.
[2024-05-22 07:10:30] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-22 07:10:32] [INFO ] Implicit Places using invariants and state equation in 2151 ms returned []
Implicit Place search using SMT with State Equation took 2488 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 646/656 places, 1025/1042 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2857 ms. Remains : 646/656 places, 1025/1042 transitions.
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : CANConstruction-PT-020-LTLFireability-15
Product exploration explored 100000 steps with 50000 reset in 313 ms.
Product exploration explored 100000 steps with 50000 reset in 328 ms.
Computed a total of 62 stabilizing places and 81 stable transitions
Computed a total of 62 stabilizing places and 81 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 14 factoid took 33 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-020-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-020-LTLFireability-15 finished in 3770 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(F(p1))))))'
Found a Shortening insensitive property : CANConstruction-PT-020-LTLFireability-00
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 656 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 656/656 places, 1042/1042 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 130 transitions
Trivial Post-agglo rules discarded 130 transitions
Performed 130 trivial Post agglomeration. Transition count delta: 130
Iterating post reduction 0 with 130 rules applied. Total rules applied 130 place count 656 transition count 912
Reduce places removed 130 places and 0 transitions.
Iterating post reduction 1 with 130 rules applied. Total rules applied 260 place count 526 transition count 912
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 260 place count 526 transition count 894
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 296 place count 508 transition count 894
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 306 place count 498 transition count 874
Iterating global reduction 2 with 10 rules applied. Total rules applied 316 place count 498 transition count 874
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 2 with 9 rules applied. Total rules applied 325 place count 498 transition count 865
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 334 place count 489 transition count 865
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 372 place count 470 transition count 846
Applied a total of 372 rules in 65 ms. Remains 470 /656 variables (removed 186) and now considering 846/1042 (removed 196) transitions.
// Phase 1: matrix 846 rows 470 cols
[2024-05-22 07:10:33] [INFO ] Computed 23 invariants in 2 ms
[2024-05-22 07:10:34] [INFO ] Implicit Places using invariants in 267 ms returned [27, 42]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 288 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 468/656 places, 846/1042 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 468 transition count 843
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 465 transition count 843
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 464 transition count 842
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 464 transition count 842
Applied a total of 8 rules in 25 ms. Remains 464 /468 variables (removed 4) and now considering 842/846 (removed 4) transitions.
// Phase 1: matrix 842 rows 464 cols
[2024-05-22 07:10:34] [INFO ] Computed 21 invariants in 2 ms
[2024-05-22 07:10:34] [INFO ] Implicit Places using invariants in 302 ms returned []
[2024-05-22 07:10:34] [INFO ] Invariant cache hit.
[2024-05-22 07:10:34] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-22 07:10:36] [INFO ] Implicit Places using invariants and state equation in 1836 ms returned []
Implicit Place search using SMT with State Equation took 2172 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 464/656 places, 842/1042 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 2551 ms. Remains : 464/656 places, 842/1042 transitions.
Running random walk in product with property : CANConstruction-PT-020-LTLFireability-00
Product exploration explored 100000 steps with 754 reset in 383 ms.
Product exploration explored 100000 steps with 758 reset in 399 ms.
Computed a total of 21 stabilizing places and 40 stable transitions
Computed a total of 21 stabilizing places and 40 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 90 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (290 resets) in 277 ms. (143 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (13 resets) in 47 ms. (833 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (12 resets) in 71 ms. (555 steps per ms) remains 2/2 properties
[2024-05-22 07:10:37] [INFO ] Invariant cache hit.
[2024-05-22 07:10:37] [INFO ] State equation strengthened by 780 read => feed constraints.
Problem apf0 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 443/447 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-22 07:10:37] [INFO ] Deduced a trap composed of 2 places in 162 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/447 variables, 1/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/447 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 16/463 variables, 16/22 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 842/1305 variables, 463/485 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1305 variables, 780/1265 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1305 variables, 0/1265 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/1306 variables, 1/1266 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1306 variables, 0/1266 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1306 variables, 0/1266 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1306/1306 variables, and 1266 constraints, problems are : Problem set: 1 solved, 1 unsolved in 561 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 464/464 constraints, ReadFeed: 780/780 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 443/447 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/447 variables, 1/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/447 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 16/463 variables, 16/22 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-22 07:10:38] [INFO ] Deduced a trap composed of 23 places in 173 ms of which 3 ms to minimize.
[2024-05-22 07:10:38] [INFO ] Deduced a trap composed of 23 places in 165 ms of which 3 ms to minimize.
[2024-05-22 07:10:38] [INFO ] Deduced a trap composed of 23 places in 165 ms of which 3 ms to minimize.
[2024-05-22 07:10:38] [INFO ] Deduced a trap composed of 24 places in 161 ms of which 3 ms to minimize.
[2024-05-22 07:10:39] [INFO ] Deduced a trap composed of 23 places in 172 ms of which 3 ms to minimize.
[2024-05-22 07:10:39] [INFO ] Deduced a trap composed of 27 places in 176 ms of which 3 ms to minimize.
[2024-05-22 07:10:39] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 3 ms to minimize.
[2024-05-22 07:10:39] [INFO ] Deduced a trap composed of 25 places in 149 ms of which 3 ms to minimize.
[2024-05-22 07:10:39] [INFO ] Deduced a trap composed of 23 places in 149 ms of which 3 ms to minimize.
[2024-05-22 07:10:40] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 3 ms to minimize.
[2024-05-22 07:10:40] [INFO ] Deduced a trap composed of 24 places in 164 ms of which 3 ms to minimize.
[2024-05-22 07:10:40] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 3 ms to minimize.
[2024-05-22 07:10:40] [INFO ] Deduced a trap composed of 23 places in 157 ms of which 2 ms to minimize.
[2024-05-22 07:10:40] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 2 ms to minimize.
[2024-05-22 07:10:40] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 3 ms to minimize.
[2024-05-22 07:10:40] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 2 ms to minimize.
[2024-05-22 07:10:41] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 3 ms to minimize.
[2024-05-22 07:10:41] [INFO ] Deduced a trap composed of 23 places in 144 ms of which 3 ms to minimize.
[2024-05-22 07:10:41] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 3 ms to minimize.
[2024-05-22 07:10:41] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 20/42 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-22 07:10:41] [INFO ] Deduced a trap composed of 26 places in 148 ms of which 2 ms to minimize.
[2024-05-22 07:10:41] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 2/44 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/463 variables, 0/44 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 842/1305 variables, 463/507 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1305 variables, 780/1287 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1305 variables, 1/1288 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1305 variables, 0/1288 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/1306 variables, 1/1289 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1306 variables, 0/1289 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1306 variables, 0/1289 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1306/1306 variables, and 1289 constraints, problems are : Problem set: 1 solved, 1 unsolved in 4072 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 464/464 constraints, ReadFeed: 780/780 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 23/23 constraints]
After SMT, in 4677ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 945 steps, including 114 resets, run visited all 1 properties in 3 ms. (steps per millisecond=315 )
Parikh walk visited 1 properties in 3 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 8 factoid took 229 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 215 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Support contains 4 out of 464 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 464/464 places, 842/842 transitions.
Applied a total of 0 rules in 16 ms. Remains 464 /464 variables (removed 0) and now considering 842/842 (removed 0) transitions.
[2024-05-22 07:10:42] [INFO ] Invariant cache hit.
[2024-05-22 07:10:43] [INFO ] Implicit Places using invariants in 264 ms returned []
[2024-05-22 07:10:43] [INFO ] Invariant cache hit.
[2024-05-22 07:10:43] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-22 07:10:44] [INFO ] Implicit Places using invariants and state equation in 1674 ms returned []
Implicit Place search using SMT with State Equation took 1964 ms to find 0 implicit places.
[2024-05-22 07:10:44] [INFO ] Redundant transitions in 6 ms returned []
Running 822 sub problems to find dead transitions.
[2024-05-22 07:10:44] [INFO ] Invariant cache hit.
[2024-05-22 07:10:44] [INFO ] State equation strengthened by 780 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/463 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-22 07:10:51] [INFO ] Deduced a trap composed of 23 places in 219 ms of which 3 ms to minimize.
[2024-05-22 07:10:52] [INFO ] Deduced a trap composed of 26 places in 184 ms of which 2 ms to minimize.
[2024-05-22 07:10:52] [INFO ] Deduced a trap composed of 24 places in 180 ms of which 3 ms to minimize.
[2024-05-22 07:10:52] [INFO ] Deduced a trap composed of 23 places in 181 ms of which 3 ms to minimize.
[2024-05-22 07:10:52] [INFO ] Deduced a trap composed of 23 places in 173 ms of which 2 ms to minimize.
[2024-05-22 07:10:52] [INFO ] Deduced a trap composed of 23 places in 191 ms of which 3 ms to minimize.
[2024-05-22 07:10:52] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 3 ms to minimize.
[2024-05-22 07:10:53] [INFO ] Deduced a trap composed of 23 places in 151 ms of which 2 ms to minimize.
[2024-05-22 07:10:53] [INFO ] Deduced a trap composed of 23 places in 143 ms of which 2 ms to minimize.
[2024-05-22 07:10:53] [INFO ] Deduced a trap composed of 23 places in 162 ms of which 3 ms to minimize.
[2024-05-22 07:10:53] [INFO ] Deduced a trap composed of 23 places in 171 ms of which 3 ms to minimize.
[2024-05-22 07:10:53] [INFO ] Deduced a trap composed of 27 places in 148 ms of which 2 ms to minimize.
[2024-05-22 07:10:53] [INFO ] Deduced a trap composed of 25 places in 173 ms of which 3 ms to minimize.
[2024-05-22 07:10:54] [INFO ] Deduced a trap composed of 26 places in 153 ms of which 3 ms to minimize.
[2024-05-22 07:10:54] [INFO ] Deduced a trap composed of 23 places in 143 ms of which 3 ms to minimize.
[2024-05-22 07:10:54] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 3 ms to minimize.
[2024-05-22 07:10:54] [INFO ] Deduced a trap composed of 25 places in 144 ms of which 3 ms to minimize.
[2024-05-22 07:10:54] [INFO ] Deduced a trap composed of 24 places in 135 ms of which 3 ms to minimize.
[2024-05-22 07:10:54] [INFO ] Deduced a trap composed of 26 places in 134 ms of which 3 ms to minimize.
[2024-05-22 07:10:55] [INFO ] Deduced a trap composed of 26 places in 129 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/463 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-22 07:10:56] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 3 ms to minimize.
[2024-05-22 07:10:56] [INFO ] Deduced a trap composed of 23 places in 163 ms of which 3 ms to minimize.
[2024-05-22 07:10:56] [INFO ] Deduced a trap composed of 24 places in 138 ms of which 2 ms to minimize.
[2024-05-22 07:10:56] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 2 ms to minimize.
[2024-05-22 07:10:56] [INFO ] Deduced a trap composed of 24 places in 163 ms of which 3 ms to minimize.
[2024-05-22 07:10:56] [INFO ] Deduced a trap composed of 24 places in 156 ms of which 3 ms to minimize.
[2024-05-22 07:10:57] [INFO ] Deduced a trap composed of 25 places in 153 ms of which 3 ms to minimize.
[2024-05-22 07:10:57] [INFO ] Deduced a trap composed of 23 places in 151 ms of which 2 ms to minimize.
[2024-05-22 07:10:57] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 3 ms to minimize.
[2024-05-22 07:10:57] [INFO ] Deduced a trap composed of 23 places in 185 ms of which 2 ms to minimize.
[2024-05-22 07:10:57] [INFO ] Deduced a trap composed of 24 places in 165 ms of which 3 ms to minimize.
[2024-05-22 07:10:58] [INFO ] Deduced a trap composed of 24 places in 152 ms of which 3 ms to minimize.
[2024-05-22 07:10:58] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 3 ms to minimize.
[2024-05-22 07:10:58] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 3 ms to minimize.
[2024-05-22 07:10:58] [INFO ] Deduced a trap composed of 28 places in 135 ms of which 3 ms to minimize.
[2024-05-22 07:10:58] [INFO ] Deduced a trap composed of 27 places in 149 ms of which 3 ms to minimize.
[2024-05-22 07:10:58] [INFO ] Deduced a trap composed of 27 places in 131 ms of which 2 ms to minimize.
[2024-05-22 07:10:58] [INFO ] Deduced a trap composed of 27 places in 141 ms of which 3 ms to minimize.
[2024-05-22 07:10:59] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 2 ms to minimize.
[2024-05-22 07:10:59] [INFO ] Deduced a trap composed of 26 places in 127 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/463 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-22 07:11:00] [INFO ] Deduced a trap composed of 24 places in 141 ms of which 3 ms to minimize.
[2024-05-22 07:11:00] [INFO ] Deduced a trap composed of 23 places in 151 ms of which 2 ms to minimize.
[2024-05-22 07:11:00] [INFO ] Deduced a trap composed of 23 places in 145 ms of which 3 ms to minimize.
[2024-05-22 07:11:00] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 3 ms to minimize.
[2024-05-22 07:11:01] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 3 ms to minimize.
[2024-05-22 07:11:01] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 3 ms to minimize.
[2024-05-22 07:11:01] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 2 ms to minimize.
[2024-05-22 07:11:01] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 3 ms to minimize.
[2024-05-22 07:11:01] [INFO ] Deduced a trap composed of 24 places in 153 ms of which 2 ms to minimize.
[2024-05-22 07:11:01] [INFO ] Deduced a trap composed of 25 places in 133 ms of which 3 ms to minimize.
[2024-05-22 07:11:01] [INFO ] Deduced a trap composed of 25 places in 122 ms of which 3 ms to minimize.
[2024-05-22 07:11:02] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 3 ms to minimize.
[2024-05-22 07:11:02] [INFO ] Deduced a trap composed of 23 places in 155 ms of which 2 ms to minimize.
[2024-05-22 07:11:02] [INFO ] Deduced a trap composed of 23 places in 154 ms of which 3 ms to minimize.
[2024-05-22 07:11:02] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 3 ms to minimize.
[2024-05-22 07:11:02] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 3 ms to minimize.
[2024-05-22 07:11:02] [INFO ] Deduced a trap composed of 24 places in 160 ms of which 2 ms to minimize.
[2024-05-22 07:11:03] [INFO ] Deduced a trap composed of 24 places in 162 ms of which 3 ms to minimize.
[2024-05-22 07:11:03] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 3 ms to minimize.
[2024-05-22 07:11:03] [INFO ] Deduced a trap composed of 23 places in 161 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/463 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-22 07:11:10] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 3 ms to minimize.
[2024-05-22 07:11:10] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 2 ms to minimize.
[2024-05-22 07:11:10] [INFO ] Deduced a trap composed of 24 places in 104 ms of which 3 ms to minimize.
[2024-05-22 07:11:10] [INFO ] Deduced a trap composed of 26 places in 123 ms of which 3 ms to minimize.
[2024-05-22 07:11:10] [INFO ] Deduced a trap composed of 24 places in 107 ms of which 2 ms to minimize.
[2024-05-22 07:11:10] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 3 ms to minimize.
[2024-05-22 07:11:10] [INFO ] Deduced a trap composed of 24 places in 103 ms of which 2 ms to minimize.
[2024-05-22 07:11:10] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 3 ms to minimize.
[2024-05-22 07:11:11] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 3 ms to minimize.
[2024-05-22 07:11:11] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 2 ms to minimize.
[2024-05-22 07:11:11] [INFO ] Deduced a trap composed of 27 places in 123 ms of which 2 ms to minimize.
[2024-05-22 07:11:11] [INFO ] Deduced a trap composed of 25 places in 121 ms of which 3 ms to minimize.
[2024-05-22 07:11:11] [INFO ] Deduced a trap composed of 24 places in 118 ms of which 2 ms to minimize.
[2024-05-22 07:11:11] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 3 ms to minimize.
[2024-05-22 07:11:12] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 3 ms to minimize.
[2024-05-22 07:11:12] [INFO ] Deduced a trap composed of 25 places in 124 ms of which 3 ms to minimize.
[2024-05-22 07:11:12] [INFO ] Deduced a trap composed of 26 places in 132 ms of which 3 ms to minimize.
[2024-05-22 07:11:12] [INFO ] Deduced a trap composed of 24 places in 131 ms of which 2 ms to minimize.
[2024-05-22 07:11:12] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 3 ms to minimize.
[2024-05-22 07:11:12] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/463 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-22 07:11:14] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 2 ms to minimize.
[2024-05-22 07:11:14] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 3 ms to minimize.
[2024-05-22 07:11:14] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 3 ms to minimize.
[2024-05-22 07:11:14] [INFO ] Deduced a trap composed of 30 places in 121 ms of which 3 ms to minimize.
[2024-05-22 07:11:14] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 3 ms to minimize.
[2024-05-22 07:11:14] [INFO ] Deduced a trap composed of 30 places in 124 ms of which 3 ms to minimize.
[2024-05-22 07:11:14] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 2 ms to minimize.
[2024-05-22 07:11:15] [INFO ] Deduced a trap composed of 27 places in 117 ms of which 2 ms to minimize.
[2024-05-22 07:11:15] [INFO ] Deduced a trap composed of 24 places in 127 ms of which 3 ms to minimize.
[2024-05-22 07:11:15] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 2 ms to minimize.
SMT process timed out in 30318ms, After SMT, problems are : Problem set: 0 solved, 822 unsolved
Search for dead transitions found 0 dead transitions in 30327ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 32321 ms. Remains : 464/464 places, 842/842 transitions.
Computed a total of 21 stabilizing places and 40 stable transitions
Computed a total of 21 stabilizing places and 40 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 111 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (285 resets) in 325 ms. (122 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (12 resets) in 63 ms. (625 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (13 resets) in 62 ms. (634 steps per ms) remains 2/2 properties
[2024-05-22 07:11:15] [INFO ] Invariant cache hit.
[2024-05-22 07:11:15] [INFO ] State equation strengthened by 780 read => feed constraints.
Problem apf0 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 443/447 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-22 07:11:16] [INFO ] Deduced a trap composed of 2 places in 153 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/447 variables, 1/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/447 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 16/463 variables, 16/22 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 842/1305 variables, 463/485 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1305 variables, 780/1265 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1305 variables, 0/1265 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/1306 variables, 1/1266 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1306 variables, 0/1266 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1306 variables, 0/1266 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1306/1306 variables, and 1266 constraints, problems are : Problem set: 1 solved, 1 unsolved in 566 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 464/464 constraints, ReadFeed: 780/780 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 443/447 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/447 variables, 1/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/447 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 16/463 variables, 16/22 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-22 07:11:16] [INFO ] Deduced a trap composed of 23 places in 144 ms of which 3 ms to minimize.
[2024-05-22 07:11:16] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 3 ms to minimize.
[2024-05-22 07:11:16] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 3 ms to minimize.
[2024-05-22 07:11:17] [INFO ] Deduced a trap composed of 24 places in 143 ms of which 2 ms to minimize.
[2024-05-22 07:11:17] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 3 ms to minimize.
[2024-05-22 07:11:17] [INFO ] Deduced a trap composed of 27 places in 142 ms of which 3 ms to minimize.
[2024-05-22 07:11:17] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 3 ms to minimize.
[2024-05-22 07:11:17] [INFO ] Deduced a trap composed of 25 places in 136 ms of which 3 ms to minimize.
[2024-05-22 07:11:17] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 3 ms to minimize.
[2024-05-22 07:11:17] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 3 ms to minimize.
[2024-05-22 07:11:18] [INFO ] Deduced a trap composed of 24 places in 121 ms of which 3 ms to minimize.
[2024-05-22 07:11:18] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 3 ms to minimize.
[2024-05-22 07:11:18] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 2 ms to minimize.
[2024-05-22 07:11:18] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 3 ms to minimize.
[2024-05-22 07:11:18] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 2 ms to minimize.
[2024-05-22 07:11:18] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 3 ms to minimize.
[2024-05-22 07:11:18] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 2 ms to minimize.
[2024-05-22 07:11:19] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 3 ms to minimize.
[2024-05-22 07:11:19] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 3 ms to minimize.
[2024-05-22 07:11:19] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 20/42 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-22 07:11:19] [INFO ] Deduced a trap composed of 26 places in 117 ms of which 3 ms to minimize.
[2024-05-22 07:11:19] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 2/44 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/463 variables, 0/44 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 842/1305 variables, 463/507 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1305 variables, 780/1287 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1305 variables, 1/1288 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1305 variables, 0/1288 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/1306 variables, 1/1289 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1306 variables, 0/1289 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1306 variables, 0/1289 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1306/1306 variables, and 1289 constraints, problems are : Problem set: 1 solved, 1 unsolved in 3616 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 464/464 constraints, ReadFeed: 780/780 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 23/23 constraints]
After SMT, in 4202ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 1030 steps, including 124 resets, run visited all 1 properties in 5 ms. (steps per millisecond=206 )
Parikh walk visited 1 properties in 5 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 12 factoid took 272 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 238 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 226 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Product exploration explored 100000 steps with 760 reset in 414 ms.
Product exploration explored 100000 steps with 763 reset in 425 ms.
Support contains 4 out of 464 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 464/464 places, 842/842 transitions.
Applied a total of 0 rules in 14 ms. Remains 464 /464 variables (removed 0) and now considering 842/842 (removed 0) transitions.
[2024-05-22 07:11:21] [INFO ] Invariant cache hit.
[2024-05-22 07:11:22] [INFO ] Implicit Places using invariants in 263 ms returned []
[2024-05-22 07:11:22] [INFO ] Invariant cache hit.
[2024-05-22 07:11:22] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-22 07:11:23] [INFO ] Implicit Places using invariants and state equation in 1629 ms returned []
Implicit Place search using SMT with State Equation took 1902 ms to find 0 implicit places.
[2024-05-22 07:11:23] [INFO ] Redundant transitions in 8 ms returned []
Running 822 sub problems to find dead transitions.
[2024-05-22 07:11:23] [INFO ] Invariant cache hit.
[2024-05-22 07:11:23] [INFO ] State equation strengthened by 780 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/463 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-22 07:11:30] [INFO ] Deduced a trap composed of 23 places in 177 ms of which 3 ms to minimize.
[2024-05-22 07:11:31] [INFO ] Deduced a trap composed of 26 places in 176 ms of which 3 ms to minimize.
[2024-05-22 07:11:31] [INFO ] Deduced a trap composed of 24 places in 169 ms of which 3 ms to minimize.
[2024-05-22 07:11:31] [INFO ] Deduced a trap composed of 23 places in 161 ms of which 3 ms to minimize.
[2024-05-22 07:11:31] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 3 ms to minimize.
[2024-05-22 07:11:31] [INFO ] Deduced a trap composed of 23 places in 151 ms of which 3 ms to minimize.
[2024-05-22 07:11:31] [INFO ] Deduced a trap composed of 23 places in 166 ms of which 3 ms to minimize.
[2024-05-22 07:11:32] [INFO ] Deduced a trap composed of 23 places in 151 ms of which 3 ms to minimize.
[2024-05-22 07:11:32] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 3 ms to minimize.
[2024-05-22 07:11:32] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 3 ms to minimize.
[2024-05-22 07:11:32] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 3 ms to minimize.
[2024-05-22 07:11:32] [INFO ] Deduced a trap composed of 27 places in 142 ms of which 3 ms to minimize.
[2024-05-22 07:11:32] [INFO ] Deduced a trap composed of 25 places in 127 ms of which 2 ms to minimize.
[2024-05-22 07:11:32] [INFO ] Deduced a trap composed of 26 places in 121 ms of which 3 ms to minimize.
[2024-05-22 07:11:33] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 3 ms to minimize.
[2024-05-22 07:11:33] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 3 ms to minimize.
[2024-05-22 07:11:33] [INFO ] Deduced a trap composed of 25 places in 132 ms of which 3 ms to minimize.
[2024-05-22 07:11:33] [INFO ] Deduced a trap composed of 24 places in 114 ms of which 3 ms to minimize.
[2024-05-22 07:11:33] [INFO ] Deduced a trap composed of 26 places in 140 ms of which 3 ms to minimize.
[2024-05-22 07:11:33] [INFO ] Deduced a trap composed of 26 places in 121 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/463 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-22 07:11:34] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 3 ms to minimize.
[2024-05-22 07:11:34] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 3 ms to minimize.
[2024-05-22 07:11:34] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 3 ms to minimize.
[2024-05-22 07:11:35] [INFO ] Deduced a trap composed of 23 places in 161 ms of which 3 ms to minimize.
[2024-05-22 07:11:35] [INFO ] Deduced a trap composed of 24 places in 140 ms of which 2 ms to minimize.
[2024-05-22 07:11:35] [INFO ] Deduced a trap composed of 24 places in 147 ms of which 3 ms to minimize.
[2024-05-22 07:11:35] [INFO ] Deduced a trap composed of 25 places in 157 ms of which 4 ms to minimize.
[2024-05-22 07:11:35] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 3 ms to minimize.
[2024-05-22 07:11:35] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 3 ms to minimize.
[2024-05-22 07:11:36] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 3 ms to minimize.
[2024-05-22 07:11:36] [INFO ] Deduced a trap composed of 24 places in 127 ms of which 2 ms to minimize.
[2024-05-22 07:11:36] [INFO ] Deduced a trap composed of 24 places in 123 ms of which 3 ms to minimize.
[2024-05-22 07:11:36] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 3 ms to minimize.
[2024-05-22 07:11:36] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 2 ms to minimize.
[2024-05-22 07:11:36] [INFO ] Deduced a trap composed of 28 places in 122 ms of which 3 ms to minimize.
[2024-05-22 07:11:36] [INFO ] Deduced a trap composed of 27 places in 126 ms of which 3 ms to minimize.
[2024-05-22 07:11:37] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 2 ms to minimize.
[2024-05-22 07:11:37] [INFO ] Deduced a trap composed of 27 places in 126 ms of which 2 ms to minimize.
[2024-05-22 07:11:37] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 2 ms to minimize.
[2024-05-22 07:11:37] [INFO ] Deduced a trap composed of 26 places in 125 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/463 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-22 07:11:38] [INFO ] Deduced a trap composed of 24 places in 120 ms of which 2 ms to minimize.
[2024-05-22 07:11:38] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 3 ms to minimize.
[2024-05-22 07:11:38] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 3 ms to minimize.
[2024-05-22 07:11:38] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 3 ms to minimize.
[2024-05-22 07:11:39] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 5 ms to minimize.
[2024-05-22 07:11:39] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 3 ms to minimize.
[2024-05-22 07:11:39] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 3 ms to minimize.
[2024-05-22 07:11:39] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 2 ms to minimize.
[2024-05-22 07:11:39] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 3 ms to minimize.
[2024-05-22 07:11:39] [INFO ] Deduced a trap composed of 25 places in 114 ms of which 2 ms to minimize.
[2024-05-22 07:11:39] [INFO ] Deduced a trap composed of 25 places in 114 ms of which 2 ms to minimize.
[2024-05-22 07:11:40] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 3 ms to minimize.
[2024-05-22 07:11:40] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 3 ms to minimize.
[2024-05-22 07:11:40] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 3 ms to minimize.
[2024-05-22 07:11:40] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 3 ms to minimize.
[2024-05-22 07:11:40] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 3 ms to minimize.
[2024-05-22 07:11:40] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 3 ms to minimize.
[2024-05-22 07:11:40] [INFO ] Deduced a trap composed of 24 places in 123 ms of which 3 ms to minimize.
[2024-05-22 07:11:41] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 3 ms to minimize.
[2024-05-22 07:11:41] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/463 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-22 07:11:47] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 2 ms to minimize.
[2024-05-22 07:11:48] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 3 ms to minimize.
[2024-05-22 07:11:48] [INFO ] Deduced a trap composed of 24 places in 124 ms of which 2 ms to minimize.
[2024-05-22 07:11:48] [INFO ] Deduced a trap composed of 26 places in 123 ms of which 3 ms to minimize.
[2024-05-22 07:11:48] [INFO ] Deduced a trap composed of 24 places in 107 ms of which 3 ms to minimize.
[2024-05-22 07:11:48] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 3 ms to minimize.
[2024-05-22 07:11:48] [INFO ] Deduced a trap composed of 24 places in 107 ms of which 2 ms to minimize.
[2024-05-22 07:11:48] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 3 ms to minimize.
[2024-05-22 07:11:48] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 3 ms to minimize.
[2024-05-22 07:11:49] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 3 ms to minimize.
[2024-05-22 07:11:49] [INFO ] Deduced a trap composed of 27 places in 132 ms of which 3 ms to minimize.
[2024-05-22 07:11:49] [INFO ] Deduced a trap composed of 25 places in 123 ms of which 3 ms to minimize.
[2024-05-22 07:11:49] [INFO ] Deduced a trap composed of 24 places in 129 ms of which 3 ms to minimize.
[2024-05-22 07:11:49] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 3 ms to minimize.
[2024-05-22 07:11:49] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 3 ms to minimize.
[2024-05-22 07:11:50] [INFO ] Deduced a trap composed of 25 places in 139 ms of which 3 ms to minimize.
[2024-05-22 07:11:50] [INFO ] Deduced a trap composed of 26 places in 138 ms of which 3 ms to minimize.
[2024-05-22 07:11:50] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 2 ms to minimize.
[2024-05-22 07:11:50] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 3 ms to minimize.
[2024-05-22 07:11:50] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/463 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-22 07:11:52] [INFO ] Deduced a trap composed of 23 places in 144 ms of which 2 ms to minimize.
[2024-05-22 07:11:52] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 2 ms to minimize.
[2024-05-22 07:11:52] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 3 ms to minimize.
[2024-05-22 07:11:52] [INFO ] Deduced a trap composed of 30 places in 147 ms of which 3 ms to minimize.
[2024-05-22 07:11:52] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 2 ms to minimize.
[2024-05-22 07:11:52] [INFO ] Deduced a trap composed of 30 places in 135 ms of which 3 ms to minimize.
[2024-05-22 07:11:52] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 3 ms to minimize.
[2024-05-22 07:11:53] [INFO ] Deduced a trap composed of 27 places in 128 ms of which 3 ms to minimize.
[2024-05-22 07:11:53] [INFO ] Deduced a trap composed of 24 places in 128 ms of which 3 ms to minimize.
[2024-05-22 07:11:53] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 3 ms to minimize.
[2024-05-22 07:11:53] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 3 ms to minimize.
[2024-05-22 07:11:53] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 2 ms to minimize.
[2024-05-22 07:11:53] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 2 ms to minimize.
[2024-05-22 07:11:53] [INFO ] Deduced a trap composed of 27 places in 136 ms of which 3 ms to minimize.
[2024-05-22 07:11:53] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 2 ms to minimize.
[2024-05-22 07:11:54] [INFO ] Deduced a trap composed of 24 places in 138 ms of which 3 ms to minimize.
SMT process timed out in 30370ms, After SMT, problems are : Problem set: 0 solved, 822 unsolved
Search for dead transitions found 0 dead transitions in 30378ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 32312 ms. Remains : 464/464 places, 842/842 transitions.
Treatment of property CANConstruction-PT-020-LTLFireability-00 finished in 80596 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((G(F(!p0))||G(!p1)) U p2))))'
[2024-05-22 07:11:54] [INFO ] Flatten gal took : 45 ms
[2024-05-22 07:11:54] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2024-05-22 07:11:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 656 places, 1042 transitions and 3692 arcs took 11 ms.
Total runtime 338104 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running CANConstruction-PT-020

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 656
TRANSITIONS: 1042
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.011s, Sys 0.010s]


SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.003s, 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: 4377
MODEL NAME: /home/mcc/execution/413/model
656 places, 1042 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.
CANNOT_COMPUTE
EXITCODE: 87
----------------------------------------------------------------------

BK_STOP 1716362503895

--------------------
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
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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="CANConstruction-PT-020"
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 CANConstruction-PT-020, 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 r069-tall-171620503600020"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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