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.r476-tall-171620505200147.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 ltsminxred
Input is CANInsertWithFailure-PT-070, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r476-tall-171620505200147
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 30M
-rw-r--r-- 1 mcc users 9.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 34K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.9K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 19 17:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 19 15:24 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 30M 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 CANInsertWithFailure-PT-070-LTLCardinality-00
FORMULA_NAME CANInsertWithFailure-PT-070-LTLCardinality-01
FORMULA_NAME CANInsertWithFailure-PT-070-LTLCardinality-02
FORMULA_NAME CANInsertWithFailure-PT-070-LTLCardinality-03
FORMULA_NAME CANInsertWithFailure-PT-070-LTLCardinality-04
FORMULA_NAME CANInsertWithFailure-PT-070-LTLCardinality-05
FORMULA_NAME CANInsertWithFailure-PT-070-LTLCardinality-06
FORMULA_NAME CANInsertWithFailure-PT-070-LTLCardinality-07
FORMULA_NAME CANInsertWithFailure-PT-070-LTLCardinality-08
FORMULA_NAME CANInsertWithFailure-PT-070-LTLCardinality-09
FORMULA_NAME CANInsertWithFailure-PT-070-LTLCardinality-10
FORMULA_NAME CANInsertWithFailure-PT-070-LTLCardinality-11
FORMULA_NAME CANInsertWithFailure-PT-070-LTLCardinality-12
FORMULA_NAME CANInsertWithFailure-PT-070-LTLCardinality-13
FORMULA_NAME CANInsertWithFailure-PT-070-LTLCardinality-14
FORMULA_NAME CANInsertWithFailure-PT-070-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717193610262

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-070
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:13:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 22:13:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:13:32] [INFO ] Load time of PNML (sax parser for PT used): 774 ms
[2024-05-31 22:13:32] [INFO ] Transformed 10644 places.
[2024-05-31 22:13:32] [INFO ] Transformed 29820 transitions.
[2024-05-31 22:13:32] [INFO ] Parsed PT model containing 10644 places and 29820 transitions and 79800 arcs in 982 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CANInsertWithFailure-PT-070-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-070-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 10644 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10644/10644 places, 29820/29820 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 10643 transition count 29820
Applied a total of 1 rules in 3067 ms. Remains 10643 /10644 variables (removed 1) and now considering 29820/29820 (removed 0) transitions.
// Phase 1: matrix 29820 rows 10643 cols
[2024-05-31 22:13:40] [INFO ] Computed 72 invariants in 5187 ms
[2024-05-31 22:13:54] [INFO ] Implicit Places using invariants in 18815 ms returned []
Implicit Place search using SMT only with invariants took 18854 ms to find 0 implicit places.
Running 29750 sub problems to find dead transitions.
[2024-05-31 22:13:54] [INFO ] Invariant cache hit.
[2024-05-31 22:13:55] [INFO ] State equation strengthened by 9730 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10642 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 29750 unsolved
SMT process timed out in 117978ms, After SMT, problems are : Problem set: 0 solved, 29750 unsolved
Search for dead transitions found 0 dead transitions in 118279ms
Starting structural reductions in LTL mode, iteration 1 : 10643/10644 places, 29820/29820 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 140310 ms. Remains : 10643/10644 places, 29820/29820 transitions.
Support contains 42 out of 10643 places after structural reductions.
[2024-05-31 22:15:54] [INFO ] Flatten gal took : 903 ms
[2024-05-31 22:15:54] [INFO ] Flatten gal took : 642 ms
[2024-05-31 22:15:56] [INFO ] Input system was already deterministic with 29820 transitions.
RANDOM walk for 40000 steps (20 resets) in 3950 ms. (10 steps per ms) remains 14/28 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 14/14 properties
[2024-05-31 22:15:57] [INFO ] Invariant cache hit.
[2024-05-31 22:15:57] [INFO ] State equation strengthened by 9730 read => feed constraints.
Problem AtomicPropp3 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 10482/10501 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10501 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 138/10639 variables, 69/70 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10639 variables, 0/70 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 2/10641 variables, 2/72 constraints. Problems are: Problem set: 1 solved, 13 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 10641/40463 variables, and 72 constraints, problems are : Problem set: 1 solved, 13 unsolved in 5017 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/10643 constraints, ReadFeed: 0/9730 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 10483/10501 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 13 unsolved
[2024-05-31 22:16:04] [INFO ] Deduced a trap composed of 5 places in 430 ms of which 24 ms to minimize.
[2024-05-31 22:16:05] [INFO ] Deduced a trap composed of 5 places in 351 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 10501/40463 variables, and 3 constraints, problems are : Problem set: 1 solved, 13 unsolved in 5159 ms.
Refiners :[Positive P Invariants (semi-flows): 1/70 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/10643 constraints, ReadFeed: 0/9730 constraints, PredecessorRefiner: 0/14 constraints, Known Traps: 2/2 constraints]
After SMT, in 10412ms problems are : Problem set: 1 solved, 13 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 18 out of 10643 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 490 transitions
Trivial Post-agglo rules discarded 490 transitions
Performed 490 trivial Post agglomeration. Transition count delta: 490
Iterating post reduction 0 with 490 rules applied. Total rules applied 490 place count 10643 transition count 29330
Reduce places removed 490 places and 0 transitions.
Iterating post reduction 1 with 490 rules applied. Total rules applied 980 place count 10153 transition count 29330
Performed 4821 Post agglomeration using F-continuation condition.Transition count delta: 4821
Deduced a syphon composed of 4821 places in 13 ms
Reduce places removed 4821 places and 0 transitions.
Iterating global reduction 2 with 9642 rules applied. Total rules applied 10622 place count 5332 transition count 24509
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 10623 place count 5332 transition count 24508
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10624 place count 5331 transition count 24508
Partial Free-agglomeration rule applied 4962 times.
Drop transitions (Partial Free agglomeration) removed 4962 transitions
Iterating global reduction 3 with 4962 rules applied. Total rules applied 15586 place count 5331 transition count 24508
Applied a total of 15586 rules in 8534 ms. Remains 5331 /10643 variables (removed 5312) and now considering 24508/29820 (removed 5312) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8539 ms. Remains : 5331/10643 places, 24508/29820 transitions.
RANDOM walk for 40000 steps (93 resets) in 2553 ms. (15 steps per ms) remains 10/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 614 ms. (65 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 10/10 properties
[2024-05-31 22:16:17] [INFO ] Flow matrix only has 24501 transitions (discarded 7 similar events)
// Phase 1: matrix 24501 rows 5331 cols
[2024-05-31 22:16:19] [INFO ] Computed 72 invariants in 1240 ms
[2024-05-31 22:16:19] [INFO ] State equation strengthened by 24256 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 5176/5189 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5189 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 138/5327 variables, 69/70 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/5327 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 2/5329 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5329 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 24501/29830 variables, 5329/5401 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/29830 variables, 24256/29657 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/29830 variables, 0/29657 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 2/29832 variables, 2/29659 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/29832 variables, 0/29659 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 0/29832 variables, 0/29659 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 29832/29832 variables, and 29659 constraints, problems are : Problem set: 0 solved, 10 unsolved in 45031 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 5331/5331 constraints, ReadFeed: 24256/24256 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 5176/5189 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-31 22:17:05] [INFO ] Deduced a trap composed of 2 places in 161 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/5189 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5189 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 138/5327 variables, 69/71 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/5327 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 2/5329 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-31 22:17:18] [INFO ] Deduced a trap composed of 85 places in 9610 ms of which 42 ms to minimize.
[2024-05-31 22:17:28] [INFO ] Deduced a trap composed of 87 places in 9534 ms of which 35 ms to minimize.
[2024-05-31 22:17:28] [INFO ] Deduced a trap composed of 80 places in 128 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/5329 variables, 3/76 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/5329 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 24501/29830 variables, 5329/5405 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 29830/29832 variables, and 29661 constraints, problems are : Problem set: 0 solved, 10 unsolved in 45050 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 5329/5331 constraints, ReadFeed: 24256/24256 constraints, PredecessorRefiner: 0/10 constraints, Known Traps: 4/4 constraints]
After SMT, in 91630ms problems are : Problem set: 0 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 13 out of 5331 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5331/5331 places, 24508/24508 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 5329 transition count 24506
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 5329 transition count 24506
Applied a total of 7 rules in 4283 ms. Remains 5329 /5331 variables (removed 2) and now considering 24506/24508 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4283 ms. Remains : 5329/5331 places, 24506/24508 transitions.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
Computed a total of 282 stabilizing places and 490 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||(p1 U p2)))))'
Support contains 4 out of 10643 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 490 transitions
Trivial Post-agglo rules discarded 490 transitions
Performed 490 trivial Post agglomeration. Transition count delta: 490
Iterating post reduction 0 with 490 rules applied. Total rules applied 490 place count 10643 transition count 29330
Reduce places removed 490 places and 0 transitions.
Iterating post reduction 1 with 490 rules applied. Total rules applied 980 place count 10153 transition count 29330
Performed 4827 Post agglomeration using F-continuation condition.Transition count delta: 4827
Deduced a syphon composed of 4827 places in 9 ms
Reduce places removed 4827 places and 0 transitions.
Iterating global reduction 2 with 9654 rules applied. Total rules applied 10634 place count 5326 transition count 24503
Applied a total of 10634 rules in 4819 ms. Remains 5326 /10643 variables (removed 5317) and now considering 24503/29820 (removed 5317) transitions.
[2024-05-31 22:17:59] [INFO ] Flow matrix only has 19814 transitions (discarded 4689 similar events)
// Phase 1: matrix 19814 rows 5326 cols
[2024-05-31 22:18:00] [INFO ] Computed 72 invariants in 1574 ms
[2024-05-31 22:18:07] [INFO ] Implicit Places using invariants in 8616 ms returned []
Implicit Place search using SMT only with invariants took 8616 ms to find 0 implicit places.
Running 24433 sub problems to find dead transitions.
[2024-05-31 22:18:07] [INFO ] Flow matrix only has 19814 transitions (discarded 4689 similar events)
[2024-05-31 22:18:07] [INFO ] Invariant cache hit.
[2024-05-31 22:18:08] [INFO ] State equation strengthened by 14625 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5325 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 24433 unsolved
SMT process timed out in 82662ms, After SMT, problems are : Problem set: 0 solved, 24433 unsolved
Search for dead transitions found 0 dead transitions in 82879ms
Starting structural reductions in SI_LTL mode, iteration 1 : 5326/10643 places, 24503/29820 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 96378 ms. Remains : 5326/10643 places, 24503/29820 transitions.
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : CANInsertWithFailure-PT-070-LTLCardinality-00
Product exploration explored 100000 steps with 281 reset in 2294 ms.
Product exploration explored 100000 steps with 282 reset in 2236 ms.
Computed a total of 213 stabilizing places and 350 stable transitions
Computed a total of 213 stabilizing places and 350 stable transitions
Knowledge obtained : [(AND (NOT p2) p0), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 95 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
RANDOM walk for 40000 steps (111 resets) in 871 ms. (45 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 343 ms. (116 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 290 ms. (137 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 52004 steps, run timeout after 3001 ms. (steps per millisecond=17 ) properties seen :0 out of 3
Probabilistic random walk after 52004 steps, saw 38687 distinct states, run finished after 3004 ms. (steps per millisecond=17 ) properties seen :0
[2024-05-31 22:19:39] [INFO ] Flow matrix only has 19814 transitions (discarded 4689 similar events)
[2024-05-31 22:19:39] [INFO ] Invariant cache hit.
[2024-05-31 22:19:39] [INFO ] State equation strengthened by 14625 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 5180/5184 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5184 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 138/5322 variables, 69/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/5322 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2/5324 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5324 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 25138/25140 variables, and 5396 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5028 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 5324/5326 constraints, ReadFeed: 0/14625 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 5180/5184 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 22:19:45] [INFO ] Deduced a trap composed of 2 places in 175 ms of which 2 ms to minimize.
[2024-05-31 22:19:45] [INFO ] Deduced a trap composed of 2 places in 174 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/5184 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5184 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 138/5322 variables, 69/72 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/5322 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 2/5324 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 22:19:56] [INFO ] Deduced a trap composed of 80 places in 9518 ms of which 34 ms to minimize.
SMT process timed out in 16956ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 5326 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5326/5326 places, 24503/24503 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 5326 transition count 24502
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 5325 transition count 24502
Partial Free-agglomeration rule applied 4970 times.
Drop transitions (Partial Free agglomeration) removed 4970 transitions
Iterating global reduction 1 with 4970 rules applied. Total rules applied 4972 place count 5325 transition count 24502
Applied a total of 4972 rules in 3458 ms. Remains 5325 /5326 variables (removed 1) and now considering 24502/24503 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3459 ms. Remains : 5325/5326 places, 24502/24503 transitions.
RANDOM walk for 40000 steps (93 resets) in 1856 ms. (21 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 1/1 properties
[2024-05-31 22:20:00] [INFO ] Flow matrix only has 24501 transitions (discarded 1 similar events)
// Phase 1: matrix 24501 rows 5325 cols
[2024-05-31 22:20:01] [INFO ] Computed 72 invariants in 1154 ms
[2024-05-31 22:20:01] [INFO ] State equation strengthened by 24282 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5182/5183 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:20:02] [INFO ] Deduced a trap composed of 2 places in 129 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/5183 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5183 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 138/5321 variables, 69/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/5321 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/5323 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:20:12] [INFO ] Deduced a trap composed of 84 places in 9480 ms of which 30 ms to minimize.
[2024-05-31 22:20:21] [INFO ] Deduced a trap composed of 90 places in 9052 ms of which 30 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/5323 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/5323 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 24501/29824 variables, 5323/5398 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 29824/29826 variables, and 29680 constraints, problems are : Problem set: 0 solved, 1 unsolved in 33394 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 5323/5325 constraints, ReadFeed: 24282/24282 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5182/5183 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5183 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:20:35] [INFO ] Deduced a trap composed of 2 places in 130 ms of which 1 ms to minimize.
[2024-05-31 22:20:35] [INFO ] Deduced a trap composed of 2 places in 128 ms of which 1 ms to minimize.
[2024-05-31 22:20:36] [INFO ] Deduced a trap composed of 2 places in 129 ms of which 1 ms to minimize.
[2024-05-31 22:20:36] [INFO ] Deduced a trap composed of 2 places in 146 ms of which 1 ms to minimize.
[2024-05-31 22:20:36] [INFO ] Deduced a trap composed of 2 places in 130 ms of which 1 ms to minimize.
[2024-05-31 22:20:36] [INFO ] Deduced a trap composed of 2 places in 127 ms of which 1 ms to minimize.
[2024-05-31 22:20:36] [INFO ] Deduced a trap composed of 2 places in 127 ms of which 1 ms to minimize.
[2024-05-31 22:20:36] [INFO ] Deduced a trap composed of 2 places in 127 ms of which 1 ms to minimize.
[2024-05-31 22:20:37] [INFO ] Deduced a trap composed of 2 places in 127 ms of which 1 ms to minimize.
[2024-05-31 22:20:37] [INFO ] Deduced a trap composed of 2 places in 128 ms of which 1 ms to minimize.
[2024-05-31 22:20:37] [INFO ] Deduced a trap composed of 2 places in 132 ms of which 1 ms to minimize.
[2024-05-31 22:20:37] [INFO ] Deduced a trap composed of 2 places in 265 ms of which 1 ms to minimize.
[2024-05-31 22:20:38] [INFO ] Deduced a trap composed of 2 places in 125 ms of which 1 ms to minimize.
[2024-05-31 22:20:38] [INFO ] Deduced a trap composed of 2 places in 128 ms of which 1 ms to minimize.
[2024-05-31 22:20:38] [INFO ] Deduced a trap composed of 2 places in 124 ms of which 0 ms to minimize.
[2024-05-31 22:20:38] [INFO ] Deduced a trap composed of 2 places in 125 ms of which 1 ms to minimize.
[2024-05-31 22:20:38] [INFO ] Deduced a trap composed of 2 places in 122 ms of which 1 ms to minimize.
[2024-05-31 22:20:39] [INFO ] Deduced a trap composed of 2 places in 118 ms of which 1 ms to minimize.
[2024-05-31 22:20:39] [INFO ] Deduced a trap composed of 2 places in 127 ms of which 1 ms to minimize.
[2024-05-31 22:20:39] [INFO ] Deduced a trap composed of 2 places in 128 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/5183 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:20:39] [INFO ] Deduced a trap composed of 2 places in 126 ms of which 1 ms to minimize.
[2024-05-31 22:20:39] [INFO ] Deduced a trap composed of 2 places in 123 ms of which 1 ms to minimize.
[2024-05-31 22:20:39] [INFO ] Deduced a trap composed of 2 places in 125 ms of which 1 ms to minimize.
[2024-05-31 22:20:40] [INFO ] Deduced a trap composed of 2 places in 125 ms of which 1 ms to minimize.
[2024-05-31 22:20:40] [INFO ] Deduced a trap composed of 2 places in 124 ms of which 1 ms to minimize.
[2024-05-31 22:20:40] [INFO ] Deduced a trap composed of 2 places in 123 ms of which 1 ms to minimize.
[2024-05-31 22:20:40] [INFO ] Deduced a trap composed of 2 places in 125 ms of which 1 ms to minimize.
[2024-05-31 22:20:40] [INFO ] Deduced a trap composed of 2 places in 121 ms of which 2 ms to minimize.
[2024-05-31 22:20:41] [INFO ] Deduced a trap composed of 2 places in 116 ms of which 1 ms to minimize.
[2024-05-31 22:20:41] [INFO ] Deduced a trap composed of 2 places in 125 ms of which 1 ms to minimize.
[2024-05-31 22:20:41] [INFO ] Deduced a trap composed of 2 places in 120 ms of which 1 ms to minimize.
[2024-05-31 22:20:41] [INFO ] Deduced a trap composed of 2 places in 126 ms of which 1 ms to minimize.
[2024-05-31 22:20:41] [INFO ] Deduced a trap composed of 2 places in 120 ms of which 1 ms to minimize.
[2024-05-31 22:20:41] [INFO ] Deduced a trap composed of 2 places in 117 ms of which 0 ms to minimize.
[2024-05-31 22:20:42] [INFO ] Deduced a trap composed of 2 places in 122 ms of which 1 ms to minimize.
[2024-05-31 22:20:42] [INFO ] Deduced a trap composed of 2 places in 122 ms of which 1 ms to minimize.
[2024-05-31 22:20:42] [INFO ] Deduced a trap composed of 2 places in 116 ms of which 1 ms to minimize.
[2024-05-31 22:20:42] [INFO ] Deduced a trap composed of 2 places in 122 ms of which 1 ms to minimize.
[2024-05-31 22:20:42] [INFO ] Deduced a trap composed of 2 places in 116 ms of which 1 ms to minimize.
[2024-05-31 22:20:43] [INFO ] Deduced a trap composed of 2 places in 117 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/5183 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:20:43] [INFO ] Deduced a trap composed of 2 places in 117 ms of which 1 ms to minimize.
[2024-05-31 22:20:43] [INFO ] Deduced a trap composed of 2 places in 122 ms of which 1 ms to minimize.
[2024-05-31 22:20:43] [INFO ] Deduced a trap composed of 2 places in 127 ms of which 1 ms to minimize.
[2024-05-31 22:20:43] [INFO ] Deduced a trap composed of 2 places in 120 ms of which 1 ms to minimize.
[2024-05-31 22:20:43] [INFO ] Deduced a trap composed of 2 places in 117 ms of which 1 ms to minimize.
[2024-05-31 22:20:44] [INFO ] Deduced a trap composed of 2 places in 118 ms of which 1 ms to minimize.
[2024-05-31 22:20:44] [INFO ] Deduced a trap composed of 2 places in 119 ms of which 0 ms to minimize.
[2024-05-31 22:20:44] [INFO ] Deduced a trap composed of 2 places in 118 ms of which 1 ms to minimize.
[2024-05-31 22:20:44] [INFO ] Deduced a trap composed of 2 places in 120 ms of which 0 ms to minimize.
[2024-05-31 22:20:44] [INFO ] Deduced a trap composed of 2 places in 117 ms of which 1 ms to minimize.
[2024-05-31 22:20:45] [INFO ] Deduced a trap composed of 2 places in 108 ms of which 1 ms to minimize.
[2024-05-31 22:20:45] [INFO ] Deduced a trap composed of 2 places in 116 ms of which 1 ms to minimize.
[2024-05-31 22:20:45] [INFO ] Deduced a trap composed of 2 places in 118 ms of which 1 ms to minimize.
[2024-05-31 22:20:45] [INFO ] Deduced a trap composed of 2 places in 117 ms of which 1 ms to minimize.
[2024-05-31 22:20:45] [INFO ] Deduced a trap composed of 2 places in 116 ms of which 1 ms to minimize.
[2024-05-31 22:20:45] [INFO ] Deduced a trap composed of 2 places in 118 ms of which 1 ms to minimize.
[2024-05-31 22:20:46] [INFO ] Deduced a trap composed of 2 places in 118 ms of which 0 ms to minimize.
[2024-05-31 22:20:46] [INFO ] Deduced a trap composed of 2 places in 118 ms of which 0 ms to minimize.
[2024-05-31 22:20:46] [INFO ] Deduced a trap composed of 2 places in 113 ms of which 1 ms to minimize.
[2024-05-31 22:20:46] [INFO ] Deduced a trap composed of 2 places in 113 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/5183 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:20:46] [INFO ] Deduced a trap composed of 2 places in 117 ms of which 0 ms to minimize.
[2024-05-31 22:20:46] [INFO ] Deduced a trap composed of 2 places in 112 ms of which 0 ms to minimize.
[2024-05-31 22:20:47] [INFO ] Deduced a trap composed of 2 places in 117 ms of which 1 ms to minimize.
[2024-05-31 22:20:47] [INFO ] Deduced a trap composed of 2 places in 115 ms of which 0 ms to minimize.
[2024-05-31 22:20:47] [INFO ] Deduced a trap composed of 2 places in 118 ms of which 1 ms to minimize.
[2024-05-31 22:20:47] [INFO ] Deduced a trap composed of 2 places in 119 ms of which 0 ms to minimize.
[2024-05-31 22:20:47] [INFO ] Deduced a trap composed of 2 places in 113 ms of which 0 ms to minimize.
[2024-05-31 22:20:47] [INFO ] Deduced a trap composed of 2 places in 115 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/5183 variables, 8/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/5183 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 138/5321 variables, 69/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5321 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/5323 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/5323 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:20:59] [INFO ] Deduced a trap composed of 139 places in 10200 ms of which 33 ms to minimize.
[2024-05-31 22:21:08] [INFO ] Deduced a trap composed of 84 places in 9319 ms of which 35 ms to minimize.
[2024-05-31 22:21:17] [INFO ] Deduced a trap composed of 145 places in 9458 ms of which 33 ms to minimize.
[2024-05-31 22:21:27] [INFO ] Deduced a trap composed of 87 places in 9738 ms of which 34 ms to minimize.
SMT process timed out in 87650ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 5325 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5325/5325 places, 24502/24502 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 5323 transition count 24500
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 5323 transition count 24500
Applied a total of 5 rules in 4036 ms. Remains 5323 /5325 variables (removed 2) and now considering 24500/24502 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4036 ms. Remains : 5323/5325 places, 24500/24502 transitions.
Knowledge obtained : [(AND (NOT p2) p0), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p2 p0)))]
Knowledge based reduction with 7 factoid took 174 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Support contains 4 out of 5326 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 5326/5326 places, 24503/24503 transitions.
Applied a total of 0 rules in 1117 ms. Remains 5326 /5326 variables (removed 0) and now considering 24503/24503 (removed 0) transitions.
[2024-05-31 22:21:33] [INFO ] Flow matrix only has 19814 transitions (discarded 4689 similar events)
// Phase 1: matrix 19814 rows 5326 cols
[2024-05-31 22:21:34] [INFO ] Computed 72 invariants in 1565 ms
[2024-05-31 22:21:41] [INFO ] Implicit Places using invariants in 8522 ms returned []
Implicit Place search using SMT only with invariants took 8522 ms to find 0 implicit places.
Running 24433 sub problems to find dead transitions.
[2024-05-31 22:21:42] [INFO ] Flow matrix only has 19814 transitions (discarded 4689 similar events)
[2024-05-31 22:21:42] [INFO ] Invariant cache hit.
[2024-05-31 22:21:42] [INFO ] State equation strengthened by 14625 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5325 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 24433 unsolved
SMT process timed out in 82676ms, After SMT, problems are : Problem set: 0 solved, 24433 unsolved
Search for dead transitions found 0 dead transitions in 82880ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 92574 ms. Remains : 5326/5326 places, 24503/24503 transitions.
Computed a total of 213 stabilizing places and 350 stable transitions
Computed a total of 213 stabilizing places and 350 stable transitions
Knowledge obtained : [(AND (NOT p2) p0), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 86 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
RANDOM walk for 40000 steps (111 resets) in 1284 ms. (31 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 1/1 properties
[2024-05-31 22:23:05] [INFO ] Flow matrix only has 19814 transitions (discarded 4689 similar events)
[2024-05-31 22:23:05] [INFO ] Invariant cache hit.
[2024-05-31 22:23:05] [INFO ] State equation strengthened by 14625 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5183/5184 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:23:06] [INFO ] Deduced a trap composed of 2 places in 177 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/5184 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5184 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 138/5322 variables, 69/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/5322 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/5324 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:23:16] [INFO ] Deduced a trap composed of 77 places in 9087 ms of which 30 ms to minimize.
SMT process timed out in 10664ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 5326 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5326/5326 places, 24503/24503 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 5324 transition count 24501
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 5324 transition count 24500
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 6 place count 5323 transition count 24500
Partial Free-agglomeration rule applied 4971 times.
Drop transitions (Partial Free agglomeration) removed 4971 transitions
Iterating global reduction 1 with 4971 rules applied. Total rules applied 4977 place count 5323 transition count 24500
Applied a total of 4977 rules in 4549 ms. Remains 5323 /5326 variables (removed 3) and now considering 24500/24503 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4550 ms. Remains : 5323/5326 places, 24500/24503 transitions.
RANDOM walk for 40000 steps (94 resets) in 1051 ms. (38 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 67366 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :0 out of 1
Probabilistic random walk after 67366 steps, saw 52382 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
// Phase 1: matrix 24500 rows 5323 cols
[2024-05-31 22:23:25] [INFO ] Computed 72 invariants in 1230 ms
[2024-05-31 22:23:25] [INFO ] State equation strengthened by 24288 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5180/5181 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:23:26] [INFO ] Deduced a trap composed of 2 places in 128 ms of which 1 ms to minimize.
[2024-05-31 22:23:26] [INFO ] Deduced a trap composed of 2 places in 129 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/5181 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5181 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 138/5319 variables, 69/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/5319 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/5321 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:23:36] [INFO ] Deduced a trap composed of 76 places in 9399 ms of which 33 ms to minimize.
[2024-05-31 22:23:45] [INFO ] Deduced a trap composed of 78 places in 9312 ms of which 28 ms to minimize.
[2024-05-31 22:23:55] [INFO ] Deduced a trap composed of 78 places in 9487 ms of which 33 ms to minimize.
[2024-05-31 22:24:04] [INFO ] Deduced a trap composed of 98 places in 8849 ms of which 34 ms to minimize.
[2024-05-31 22:24:12] [INFO ] Deduced a trap composed of 94 places in 8549 ms of which 33 ms to minimize.
SMT process timed out in 48891ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 5323 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5323/5323 places, 24500/24500 transitions.
Applied a total of 0 rules in 1373 ms. Remains 5323 /5323 variables (removed 0) and now considering 24500/24500 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1373 ms. Remains : 5323/5323 places, 24500/24500 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5323/5323 places, 24500/24500 transitions.
Applied a total of 0 rules in 1384 ms. Remains 5323 /5323 variables (removed 0) and now considering 24500/24500 (removed 0) transitions.
[2024-05-31 22:24:15] [INFO ] Invariant cache hit.
[2024-05-31 22:24:26] [INFO ] Implicit Places using invariants in 10866 ms returned []
Implicit Place search using SMT only with invariants took 10867 ms to find 0 implicit places.
Running 24430 sub problems to find dead transitions.
[2024-05-31 22:24:26] [INFO ] Invariant cache hit.
[2024-05-31 22:24:26] [INFO ] State equation strengthened by 24288 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5322 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 24430 unsolved
SMT process timed out in 92106ms, After SMT, problems are : Problem set: 0 solved, 24430 unsolved
Search for dead transitions found 0 dead transitions in 92304ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104587 ms. Remains : 5323/5323 places, 24500/24500 transitions.
Knowledge obtained : [(AND (NOT p2) p0), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p2 p0)))]
Knowledge based reduction with 7 factoid took 141 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 282 reset in 2335 ms.
Product exploration explored 100000 steps with 283 reset in 2050 ms.
Support contains 4 out of 5326 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5326/5326 places, 24503/24503 transitions.
Applied a total of 0 rules in 997 ms. Remains 5326 /5326 variables (removed 0) and now considering 24503/24503 (removed 0) transitions.
[2024-05-31 22:26:04] [INFO ] Flow matrix only has 19814 transitions (discarded 4689 similar events)
// Phase 1: matrix 19814 rows 5326 cols
[2024-05-31 22:26:06] [INFO ] Computed 72 invariants in 1563 ms
[2024-05-31 22:26:13] [INFO ] Implicit Places using invariants in 8485 ms returned []
Implicit Place search using SMT only with invariants took 8486 ms to find 0 implicit places.
Running 24433 sub problems to find dead transitions.
[2024-05-31 22:26:13] [INFO ] Flow matrix only has 19814 transitions (discarded 4689 similar events)
[2024-05-31 22:26:13] [INFO ] Invariant cache hit.
[2024-05-31 22:26:13] [INFO ] State equation strengthened by 14625 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5325 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 24433 unsolved
SMT process timed out in 82009ms, After SMT, problems are : Problem set: 0 solved, 24433 unsolved
Search for dead transitions found 0 dead transitions in 82208ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 91718 ms. Remains : 5326/5326 places, 24503/24503 transitions.
Treatment of property CANInsertWithFailure-PT-070-LTLCardinality-00 finished in 582302 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 10643 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Applied a total of 0 rules in 1990 ms. Remains 10643 /10643 variables (removed 0) and now considering 29820/29820 (removed 0) transitions.
// Phase 1: matrix 29820 rows 10643 cols
[2024-05-31 22:27:43] [INFO ] Computed 72 invariants in 5070 ms
[2024-05-31 22:27:56] [INFO ] Implicit Places using invariants in 18528 ms returned []
Implicit Place search using SMT only with invariants took 18528 ms to find 0 implicit places.
Running 29750 sub problems to find dead transitions.
[2024-05-31 22:27:57] [INFO ] Invariant cache hit.
[2024-05-31 22:27:57] [INFO ] State equation strengthened by 9730 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10642 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 29750 unsolved
SMT process timed out in 117108ms, After SMT, problems are : Problem set: 0 solved, 29750 unsolved
Search for dead transitions found 0 dead transitions in 117345ms
Finished structural reductions in LTL mode , in 1 iterations and 137896 ms. Remains : 10643/10643 places, 29820/29820 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-070-LTLCardinality-02
Product exploration explored 100000 steps with 50000 reset in 3728 ms.
Product exploration explored 100000 steps with 50000 reset in 3727 ms.
Computed a total of 282 stabilizing places and 490 stable transitions
Computed a total of 282 stabilizing places and 490 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 18 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-070-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-070-LTLCardinality-02 finished in 145710 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 10643 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 490 transitions
Trivial Post-agglo rules discarded 490 transitions
Performed 490 trivial Post agglomeration. Transition count delta: 490
Iterating post reduction 0 with 490 rules applied. Total rules applied 490 place count 10643 transition count 29330
Reduce places removed 490 places and 0 transitions.
Iterating post reduction 1 with 490 rules applied. Total rules applied 980 place count 10153 transition count 29330
Performed 4829 Post agglomeration using F-continuation condition.Transition count delta: 4829
Deduced a syphon composed of 4829 places in 8 ms
Reduce places removed 4829 places and 0 transitions.
Iterating global reduction 2 with 9658 rules applied. Total rules applied 10638 place count 5324 transition count 24501
Applied a total of 10638 rules in 4554 ms. Remains 5324 /10643 variables (removed 5319) and now considering 24501/29820 (removed 5319) transitions.
[2024-05-31 22:30:06] [INFO ] Flow matrix only has 19810 transitions (discarded 4691 similar events)
// Phase 1: matrix 19810 rows 5324 cols
[2024-05-31 22:30:08] [INFO ] Computed 72 invariants in 1499 ms
[2024-05-31 22:30:15] [INFO ] Implicit Places using invariants in 8610 ms returned []
Implicit Place search using SMT only with invariants took 8611 ms to find 0 implicit places.
Running 24431 sub problems to find dead transitions.
[2024-05-31 22:30:15] [INFO ] Flow matrix only has 19810 transitions (discarded 4691 similar events)
[2024-05-31 22:30:15] [INFO ] Invariant cache hit.
[2024-05-31 22:30:15] [INFO ] State equation strengthened by 14627 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/5323 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 24431 unsolved
SMT process timed out in 82713ms, After SMT, problems are : Problem set: 0 solved, 24431 unsolved
Search for dead transitions found 0 dead transitions in 83047ms
Starting structural reductions in SI_LTL mode, iteration 1 : 5324/10643 places, 24501/29820 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 96240 ms. Remains : 5324/10643 places, 24501/29820 transitions.
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-070-LTLCardinality-03
Product exploration explored 100000 steps with 286 reset in 2102 ms.
Product exploration explored 100000 steps with 285 reset in 2259 ms.
Computed a total of 213 stabilizing places and 350 stable transitions
Computed a total of 213 stabilizing places and 350 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 69 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 32172 steps (89 resets) in 728 ms. (44 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 261 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 5324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5324/5324 places, 24501/24501 transitions.
Applied a total of 0 rules in 1000 ms. Remains 5324 /5324 variables (removed 0) and now considering 24501/24501 (removed 0) transitions.
[2024-05-31 22:31:44] [INFO ] Flow matrix only has 19810 transitions (discarded 4691 similar events)
[2024-05-31 22:31:44] [INFO ] Invariant cache hit.
[2024-05-31 22:31:51] [INFO ] Implicit Places using invariants in 6970 ms returned []
Implicit Place search using SMT only with invariants took 6971 ms to find 0 implicit places.
Running 24431 sub problems to find dead transitions.
[2024-05-31 22:31:52] [INFO ] Flow matrix only has 19810 transitions (discarded 4691 similar events)
[2024-05-31 22:31:52] [INFO ] Invariant cache hit.
[2024-05-31 22:31:52] [INFO ] State equation strengthened by 14627 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/5323 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 24431 unsolved
SMT process timed out in 82609ms, After SMT, problems are : Problem set: 0 solved, 24431 unsolved
Search for dead transitions found 0 dead transitions in 82805ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 90803 ms. Remains : 5324/5324 places, 24501/24501 transitions.
Computed a total of 213 stabilizing places and 350 stable transitions
Computed a total of 213 stabilizing places and 350 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 36243 steps (101 resets) in 800 ms. (45 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 286 reset in 2418 ms.
Product exploration explored 100000 steps with 288 reset in 2212 ms.
Support contains 2 out of 5324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5324/5324 places, 24501/24501 transitions.
Applied a total of 0 rules in 1026 ms. Remains 5324 /5324 variables (removed 0) and now considering 24501/24501 (removed 0) transitions.
[2024-05-31 22:33:21] [INFO ] Flow matrix only has 19810 transitions (discarded 4691 similar events)
[2024-05-31 22:33:21] [INFO ] Invariant cache hit.
[2024-05-31 22:33:28] [INFO ] Implicit Places using invariants in 7207 ms returned []
Implicit Place search using SMT only with invariants took 7208 ms to find 0 implicit places.
Running 24431 sub problems to find dead transitions.
[2024-05-31 22:33:28] [INFO ] Flow matrix only has 19810 transitions (discarded 4691 similar events)
[2024-05-31 22:33:28] [INFO ] Invariant cache hit.
[2024-05-31 22:33:28] [INFO ] State equation strengthened by 14627 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5323 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 24431 unsolved
SMT process timed out in 83339ms, After SMT, problems are : Problem set: 0 solved, 24431 unsolved
Search for dead transitions found 0 dead transitions in 83540ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 91802 ms. Remains : 5324/5324 places, 24501/24501 transitions.
Treatment of property CANInsertWithFailure-PT-070-LTLCardinality-03 finished in 290372 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&F(G(p1)))))'
Support contains 4 out of 10643 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Applied a total of 0 rules in 2025 ms. Remains 10643 /10643 variables (removed 0) and now considering 29820/29820 (removed 0) transitions.
// Phase 1: matrix 29820 rows 10643 cols
[2024-05-31 22:34:59] [INFO ] Computed 72 invariants in 4648 ms
[2024-05-31 22:35:12] [INFO ] Implicit Places using invariants in 18080 ms returned []
Implicit Place search using SMT only with invariants took 18081 ms to find 0 implicit places.
Running 29750 sub problems to find dead transitions.
[2024-05-31 22:35:12] [INFO ] Invariant cache hit.
[2024-05-31 22:35:13] [INFO ] State equation strengthened by 9730 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10642 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 29750 unsolved
SMT process timed out in 125627ms, After SMT, problems are : Problem set: 0 solved, 29750 unsolved
Search for dead transitions found 0 dead transitions in 125863ms
Finished structural reductions in LTL mode , in 1 iterations and 146000 ms. Remains : 10643/10643 places, 29820/29820 transitions.
Stuttering acceptance computed with spot in 216 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-070-LTLCardinality-04
Stuttering criterion allowed to conclude after 1849 steps with 0 reset in 33 ms.
FORMULA CANInsertWithFailure-PT-070-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-070-LTLCardinality-04 finished in 146362 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0)&&(X(X(p1))||G(p0))) U (p2&&X(p1))))'
Support contains 3 out of 10643 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Applied a total of 0 rules in 1995 ms. Remains 10643 /10643 variables (removed 0) and now considering 29820/29820 (removed 0) transitions.
[2024-05-31 22:37:20] [INFO ] Invariant cache hit.
[2024-05-31 22:37:34] [INFO ] Implicit Places using invariants in 13344 ms returned []
Implicit Place search using SMT only with invariants took 13345 ms to find 0 implicit places.
Running 29750 sub problems to find dead transitions.
[2024-05-31 22:37:34] [INFO ] Invariant cache hit.
[2024-05-31 22:37:34] [INFO ] State equation strengthened by 9730 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10642 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 29750 unsolved
SMT process timed out in 126063ms, After SMT, problems are : Problem set: 0 solved, 29750 unsolved
Search for dead transitions found 0 dead transitions in 126299ms
Finished structural reductions in LTL mode , in 1 iterations and 141671 ms. Remains : 10643/10643 places, 29820/29820 transitions.
Stuttering acceptance computed with spot in 434 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), true, (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-070-LTLCardinality-05
Stuttering criterion allowed to conclude after 1652 steps with 0 reset in 28 ms.
FORMULA CANInsertWithFailure-PT-070-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-070-LTLCardinality-05 finished in 142207 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||F((p1||(X(!p0) U ((X(!p0)&&G(p2))||X(G(!p0)))))))))'
Support contains 3 out of 10643 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Applied a total of 0 rules in 2026 ms. Remains 10643 /10643 variables (removed 0) and now considering 29820/29820 (removed 0) transitions.
[2024-05-31 22:39:43] [INFO ] Invariant cache hit.
[2024-05-31 22:39:56] [INFO ] Implicit Places using invariants in 13528 ms returned []
Implicit Place search using SMT only with invariants took 13528 ms to find 0 implicit places.
Running 29750 sub problems to find dead transitions.
[2024-05-31 22:39:56] [INFO ] Invariant cache hit.
[2024-05-31 22:39:57] [INFO ] State equation strengthened by 9730 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10642 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 29750 unsolved
SMT process timed out in 120268ms, After SMT, problems are : Problem set: 0 solved, 29750 unsolved
Search for dead transitions found 0 dead transitions in 120503ms
Finished structural reductions in LTL mode , in 1 iterations and 136089 ms. Remains : 10643/10643 places, 29820/29820 transitions.
Stuttering acceptance computed with spot in 270 ms :[false, false, false, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p1) (NOT p2) p0)]
Running random walk in product with property : CANInsertWithFailure-PT-070-LTLCardinality-06
Product exploration explored 100000 steps with 572 reset in 1720 ms.
Product exploration explored 100000 steps with 590 reset in 1731 ms.
Computed a total of 282 stabilizing places and 490 stable transitions
Computed a total of 282 stabilizing places and 490 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X p2), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (AND (NOT p1) p2 (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 146 ms. Reduced automaton from 6 states, 21 edges and 3 AP (stutter sensitive) to 6 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 326 ms :[false, false, false, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p2) (NOT p1) p0)]
RANDOM walk for 40000 steps (22 resets) in 1544 ms. (25 steps per ms) remains 6/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 63 ms. (625 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 6/6 properties
[2024-05-31 22:42:02] [INFO ] Invariant cache hit.
[2024-05-31 22:42:02] [INFO ] State equation strengthened by 9730 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 10500/10503 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-31 22:42:03] [INFO ] Deduced a trap composed of 5 places in 301 ms of which 2 ms to minimize.
[2024-05-31 22:42:04] [INFO ] Deduced a trap composed of 5 places in 318 ms of which 2 ms to minimize.
[2024-05-31 22:42:04] [INFO ] Deduced a trap composed of 5 places in 312 ms of which 2 ms to minimize.
[2024-05-31 22:42:05] [INFO ] Deduced a trap composed of 5 places in 308 ms of which 2 ms to minimize.
[2024-05-31 22:42:05] [INFO ] Deduced a trap composed of 5 places in 323 ms of which 2 ms to minimize.
[2024-05-31 22:42:06] [INFO ] Deduced a trap composed of 5 places in 311 ms of which 2 ms to minimize.
[2024-05-31 22:42:06] [INFO ] Deduced a trap composed of 5 places in 306 ms of which 2 ms to minimize.
[2024-05-31 22:42:06] [INFO ] Deduced a trap composed of 5 places in 308 ms of which 2 ms to minimize.
[2024-05-31 22:42:07] [INFO ] Deduced a trap composed of 5 places in 310 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 10503/40463 variables, and 11 constraints, problems are : Problem set: 0 solved, 6 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 2/70 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/10643 constraints, ReadFeed: 0/9730 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 10500/10503 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10503 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-31 22:42:08] [INFO ] Deduced a trap composed of 5 places in 307 ms of which 2 ms to minimize.
[2024-05-31 22:42:09] [INFO ] Deduced a trap composed of 5 places in 315 ms of which 2 ms to minimize.
[2024-05-31 22:42:09] [INFO ] Deduced a trap composed of 5 places in 304 ms of which 3 ms to minimize.
[2024-05-31 22:42:10] [INFO ] Deduced a trap composed of 5 places in 306 ms of which 2 ms to minimize.
[2024-05-31 22:42:10] [INFO ] Deduced a trap composed of 5 places in 308 ms of which 3 ms to minimize.
[2024-05-31 22:42:10] [INFO ] Deduced a trap composed of 5 places in 296 ms of which 2 ms to minimize.
[2024-05-31 22:42:11] [INFO ] Deduced a trap composed of 5 places in 305 ms of which 2 ms to minimize.
[2024-05-31 22:42:11] [INFO ] Deduced a trap composed of 5 places in 310 ms of which 2 ms to minimize.
[2024-05-31 22:42:12] [INFO ] Deduced a trap composed of 5 places in 292 ms of which 2 ms to minimize.
[2024-05-31 22:42:12] [INFO ] Deduced a trap composed of 5 places in 299 ms of which 2 ms to minimize.
SMT process timed out in 10437ms, After SMT, problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 10643 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 488 transitions
Trivial Post-agglo rules discarded 488 transitions
Performed 488 trivial Post agglomeration. Transition count delta: 488
Iterating post reduction 0 with 488 rules applied. Total rules applied 488 place count 10643 transition count 29332
Reduce places removed 488 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 489 rules applied. Total rules applied 977 place count 10155 transition count 29331
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 978 place count 10154 transition count 29331
Performed 4827 Post agglomeration using F-continuation condition.Transition count delta: 4827
Deduced a syphon composed of 4827 places in 11 ms
Reduce places removed 4827 places and 0 transitions.
Iterating global reduction 3 with 9654 rules applied. Total rules applied 10632 place count 5327 transition count 24504
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 10633 place count 5327 transition count 24503
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 10634 place count 5326 transition count 24503
Partial Free-agglomeration rule applied 4972 times.
Drop transitions (Partial Free agglomeration) removed 4972 transitions
Iterating global reduction 4 with 4972 rules applied. Total rules applied 15606 place count 5326 transition count 24503
Partial Free-agglomeration rule applied 70 times.
Drop transitions (Partial Free agglomeration) removed 70 transitions
Iterating global reduction 4 with 70 rules applied. Total rules applied 15676 place count 5326 transition count 24503
Applied a total of 15676 rules in 9437 ms. Remains 5326 /10643 variables (removed 5317) and now considering 24503/29820 (removed 5317) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9438 ms. Remains : 5326/10643 places, 24503/29820 transitions.
RANDOM walk for 40000 steps (92 resets) in 1156 ms. (34 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 467 ms. (85 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 62635 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :0 out of 6
Probabilistic random walk after 62635 steps, saw 52010 distinct states, run finished after 3001 ms. (steps per millisecond=20 ) properties seen :0
// Phase 1: matrix 24503 rows 5326 cols
[2024-05-31 22:42:26] [INFO ] Computed 72 invariants in 1204 ms
[2024-05-31 22:42:27] [INFO ] State equation strengthened by 24215 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 5183/5186 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-31 22:42:27] [INFO ] Deduced a trap composed of 2 places in 127 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/5186 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5186 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 136/5322 variables, 68/71 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/5322 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 2/5324 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-31 22:42:40] [INFO ] Deduced a trap composed of 83 places in 9634 ms of which 34 ms to minimize.
[2024-05-31 22:42:49] [INFO ] Deduced a trap composed of 79 places in 9079 ms of which 29 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/5324 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/5324 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 24503/29827 variables, 5324/5399 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/29827 variables, 24215/29614 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 29827/29829 variables, and 29614 constraints, problems are : Problem set: 0 solved, 6 unsolved in 45037 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 5324/5326 constraints, ReadFeed: 24215/24215 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 5183/5186 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5186 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-31 22:43:12] [INFO ] Deduced a trap composed of 2 places in 131 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/5186 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/5186 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 136/5322 variables, 68/72 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5322 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 2/5324 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/5324 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-31 22:43:25] [INFO ] Deduced a trap composed of 80 places in 9744 ms of which 35 ms to minimize.
[2024-05-31 22:43:35] [INFO ] Deduced a trap composed of 138 places in 9767 ms of which 29 ms to minimize.
[2024-05-31 22:43:44] [INFO ] Deduced a trap composed of 77 places in 9274 ms of which 29 ms to minimize.
[2024-05-31 22:43:54] [INFO ] Deduced a trap composed of 83 places in 9699 ms of which 34 ms to minimize.
[2024-05-31 22:44:03] [INFO ] Deduced a trap composed of 81 places in 9182 ms of which 33 ms to minimize.
SMT process timed out in 97648ms, After SMT, problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 5326 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5326/5326 places, 24503/24503 transitions.
Applied a total of 0 rules in 1486 ms. Remains 5326 /5326 variables (removed 0) and now considering 24503/24503 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1486 ms. Remains : 5326/5326 places, 24503/24503 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5326/5326 places, 24503/24503 transitions.
Applied a total of 0 rules in 1400 ms. Remains 5326 /5326 variables (removed 0) and now considering 24503/24503 (removed 0) transitions.
[2024-05-31 22:44:06] [INFO ] Invariant cache hit.
[2024-05-31 22:44:17] [INFO ] Implicit Places using invariants in 10814 ms returned []
Implicit Place search using SMT only with invariants took 10814 ms to find 0 implicit places.
Running 24433 sub problems to find dead transitions.
[2024-05-31 22:44:17] [INFO ] Invariant cache hit.
[2024-05-31 22:44:17] [INFO ] State equation strengthened by 24215 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5325 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 24433 unsolved
SMT process timed out in 93932ms, After SMT, problems are : Problem set: 0 solved, 24433 unsolved
Search for dead transitions found 0 dead transitions in 94128ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106378 ms. Remains : 5326/5326 places, 24503/24503 transitions.
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X p2), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (AND (NOT p1) p2 (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND p2 (NOT p1)))), (F (NOT (AND (NOT p0) p2 (NOT p1)))), (F p1)]
Knowledge based reduction with 13 factoid took 242 ms. Reduced automaton from 6 states, 21 edges and 3 AP (stutter sensitive) to 6 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 243 ms :[false, false, false, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p2) (NOT p1) p0)]
Stuttering acceptance computed with spot in 239 ms :[false, false, false, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p2) (NOT p1) p0)]
Support contains 3 out of 10643 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Applied a total of 0 rules in 1996 ms. Remains 10643 /10643 variables (removed 0) and now considering 29820/29820 (removed 0) transitions.
// Phase 1: matrix 29820 rows 10643 cols
[2024-05-31 22:45:58] [INFO ] Computed 72 invariants in 4874 ms
[2024-05-31 22:46:12] [INFO ] Implicit Places using invariants in 18351 ms returned []
Implicit Place search using SMT only with invariants took 18351 ms to find 0 implicit places.
Running 29750 sub problems to find dead transitions.
[2024-05-31 22:46:12] [INFO ] Invariant cache hit.
[2024-05-31 22:46:12] [INFO ] State equation strengthened by 9730 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10642 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 29750 unsolved
SMT process timed out in 127073ms, After SMT, problems are : Problem set: 0 solved, 29750 unsolved
Search for dead transitions found 0 dead transitions in 127308ms
Finished structural reductions in LTL mode , in 1 iterations and 147688 ms. Remains : 10643/10643 places, 29820/29820 transitions.
Computed a total of 282 stabilizing places and 490 stable transitions
Computed a total of 282 stabilizing places and 490 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X p2), (X (AND (NOT p0) p2 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 143 ms. Reduced automaton from 6 states, 21 edges and 3 AP (stutter sensitive) to 6 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 255 ms :[false, false, false, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p2) (NOT p1) p0)]
RANDOM walk for 40000 steps (22 resets) in 920 ms. (43 steps per ms) remains 6/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 6/6 properties
[2024-05-31 22:48:20] [INFO ] Invariant cache hit.
[2024-05-31 22:48:20] [INFO ] State equation strengthened by 9730 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 10500/10503 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-31 22:48:22] [INFO ] Deduced a trap composed of 5 places in 325 ms of which 3 ms to minimize.
[2024-05-31 22:48:22] [INFO ] Deduced a trap composed of 5 places in 308 ms of which 3 ms to minimize.
[2024-05-31 22:48:23] [INFO ] Deduced a trap composed of 5 places in 313 ms of which 2 ms to minimize.
[2024-05-31 22:48:23] [INFO ] Deduced a trap composed of 5 places in 315 ms of which 2 ms to minimize.
[2024-05-31 22:48:24] [INFO ] Deduced a trap composed of 5 places in 365 ms of which 2 ms to minimize.
[2024-05-31 22:48:24] [INFO ] Deduced a trap composed of 5 places in 318 ms of which 3 ms to minimize.
[2024-05-31 22:48:25] [INFO ] Deduced a trap composed of 5 places in 310 ms of which 2 ms to minimize.
[2024-05-31 22:48:25] [INFO ] Deduced a trap composed of 5 places in 318 ms of which 3 ms to minimize.
[2024-05-31 22:48:26] [INFO ] Deduced a trap composed of 5 places in 306 ms of which 2 ms to minimize.
SMT process timed out in 5197ms, After SMT, problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 10643 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 488 transitions
Trivial Post-agglo rules discarded 488 transitions
Performed 488 trivial Post agglomeration. Transition count delta: 488
Iterating post reduction 0 with 488 rules applied. Total rules applied 488 place count 10643 transition count 29332
Reduce places removed 488 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 489 rules applied. Total rules applied 977 place count 10155 transition count 29331
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 978 place count 10154 transition count 29331
Performed 4827 Post agglomeration using F-continuation condition.Transition count delta: 4827
Deduced a syphon composed of 4827 places in 11 ms
Reduce places removed 4827 places and 0 transitions.
Iterating global reduction 3 with 9654 rules applied. Total rules applied 10632 place count 5327 transition count 24504
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 10633 place count 5327 transition count 24503
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 10634 place count 5326 transition count 24503
Partial Free-agglomeration rule applied 4972 times.
Drop transitions (Partial Free agglomeration) removed 4972 transitions
Iterating global reduction 4 with 4972 rules applied. Total rules applied 15606 place count 5326 transition count 24503
Partial Free-agglomeration rule applied 70 times.
Drop transitions (Partial Free agglomeration) removed 70 transitions
Iterating global reduction 4 with 70 rules applied. Total rules applied 15676 place count 5326 transition count 24503
Applied a total of 15676 rules in 9037 ms. Remains 5326 /10643 variables (removed 5317) and now considering 24503/29820 (removed 5317) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9037 ms. Remains : 5326/10643 places, 24503/29820 transitions.
RANDOM walk for 40000 steps (93 resets) in 1561 ms. (25 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 88 ms. (449 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 83 ms. (476 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 63200 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :0 out of 6
Probabilistic random walk after 63200 steps, saw 52089 distinct states, run finished after 3002 ms. (steps per millisecond=21 ) properties seen :0
// Phase 1: matrix 24503 rows 5326 cols
[2024-05-31 22:48:39] [INFO ] Computed 72 invariants in 1237 ms
[2024-05-31 22:48:40] [INFO ] State equation strengthened by 24215 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 5183/5186 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-31 22:48:40] [INFO ] Deduced a trap composed of 2 places in 129 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/5186 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5186 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 136/5322 variables, 68/71 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/5322 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 2/5324 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-31 22:48:54] [INFO ] Deduced a trap composed of 83 places in 9852 ms of which 34 ms to minimize.
[2024-05-31 22:49:03] [INFO ] Deduced a trap composed of 79 places in 9251 ms of which 33 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/5324 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/5324 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 24503/29827 variables, 5324/5399 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/29827 variables, 24215/29614 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 29827/29829 variables, and 29614 constraints, problems are : Problem set: 0 solved, 6 unsolved in 45036 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 5324/5326 constraints, ReadFeed: 24215/24215 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 5183/5186 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5186 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-31 22:49:25] [INFO ] Deduced a trap composed of 2 places in 133 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/5186 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/5186 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 136/5322 variables, 68/72 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5322 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 2/5324 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/5324 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-31 22:49:38] [INFO ] Deduced a trap composed of 80 places in 9664 ms of which 34 ms to minimize.
[2024-05-31 22:49:48] [INFO ] Deduced a trap composed of 138 places in 9784 ms of which 34 ms to minimize.
[2024-05-31 22:49:57] [INFO ] Deduced a trap composed of 77 places in 9534 ms of which 34 ms to minimize.
[2024-05-31 22:50:07] [INFO ] Deduced a trap composed of 83 places in 9822 ms of which 32 ms to minimize.
[2024-05-31 22:50:18] [INFO ] Deduced a trap composed of 81 places in 10159 ms of which 36 ms to minimize.
SMT process timed out in 99297ms, After SMT, problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 5326 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5326/5326 places, 24503/24503 transitions.
Applied a total of 0 rules in 1428 ms. Remains 5326 /5326 variables (removed 0) and now considering 24503/24503 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1428 ms. Remains : 5326/5326 places, 24503/24503 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5326/5326 places, 24503/24503 transitions.
Applied a total of 0 rules in 1466 ms. Remains 5326 /5326 variables (removed 0) and now considering 24503/24503 (removed 0) transitions.
[2024-05-31 22:50:20] [INFO ] Invariant cache hit.
[2024-05-31 22:50:31] [INFO ] Implicit Places using invariants in 10888 ms returned []
Implicit Place search using SMT only with invariants took 10889 ms to find 0 implicit places.
Running 24433 sub problems to find dead transitions.
[2024-05-31 22:50:32] [INFO ] Invariant cache hit.
[2024-05-31 22:50:32] [INFO ] State equation strengthened by 24215 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5325 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 24433 unsolved
SMT process timed out in 95985ms, After SMT, problems are : Problem set: 0 solved, 24433 unsolved
Search for dead transitions found 0 dead transitions in 96176ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108576 ms. Remains : 5326/5326 places, 24503/24503 transitions.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X p2), (X (AND (NOT p0) p2 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND p2 (NOT p1)))), (F (NOT (AND (NOT p0) p2 (NOT p1)))), (F p1)]
Knowledge based reduction with 13 factoid took 244 ms. Reduced automaton from 6 states, 21 edges and 3 AP (stutter sensitive) to 6 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 272 ms :[false, false, false, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p2) (NOT p1) p0)]
Stuttering acceptance computed with spot in 250 ms :[false, false, false, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p2) (NOT p1) p0)]
Stuttering acceptance computed with spot in 242 ms :[false, false, false, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p2) (NOT p1) p0)]
Product exploration explored 100000 steps with 623 reset in 1646 ms.
Product exploration explored 100000 steps with 621 reset in 1686 ms.
Support contains 3 out of 10643 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Applied a total of 0 rules in 2219 ms. Remains 10643 /10643 variables (removed 0) and now considering 29820/29820 (removed 0) transitions.
// Phase 1: matrix 29820 rows 10643 cols
[2024-05-31 22:52:19] [INFO ] Computed 72 invariants in 4582 ms
[2024-05-31 22:52:32] [INFO ] Implicit Places using invariants in 18041 ms returned []
Implicit Place search using SMT only with invariants took 18042 ms to find 0 implicit places.
Running 29750 sub problems to find dead transitions.
[2024-05-31 22:52:33] [INFO ] Invariant cache hit.
[2024-05-31 22:52:33] [INFO ] State equation strengthened by 9730 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10642 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 29750 unsolved
SMT process timed out in 128261ms, After SMT, problems are : Problem set: 0 solved, 29750 unsolved
Search for dead transitions found 0 dead transitions in 128492ms
Finished structural reductions in LTL mode , in 1 iterations and 148786 ms. Remains : 10643/10643 places, 29820/29820 transitions.
Treatment of property CANInsertWithFailure-PT-070-LTLCardinality-06 finished in 900854 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||(p1&&X(F(p2)))))))'
Support contains 4 out of 10643 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 490 transitions
Trivial Post-agglo rules discarded 490 transitions
Performed 490 trivial Post agglomeration. Transition count delta: 490
Iterating post reduction 0 with 490 rules applied. Total rules applied 490 place count 10643 transition count 29330
Reduce places removed 490 places and 0 transitions.
Iterating post reduction 1 with 490 rules applied. Total rules applied 980 place count 10153 transition count 29330
Performed 4829 Post agglomeration using F-continuation condition.Transition count delta: 4829
Deduced a syphon composed of 4829 places in 7 ms
Reduce places removed 4829 places and 0 transitions.
Iterating global reduction 2 with 9658 rules applied. Total rules applied 10638 place count 5324 transition count 24501
Applied a total of 10638 rules in 4695 ms. Remains 5324 /10643 variables (removed 5319) and now considering 24501/29820 (removed 5319) transitions.
[2024-05-31 22:54:46] [INFO ] Flow matrix only has 19810 transitions (discarded 4691 similar events)
// Phase 1: matrix 19810 rows 5324 cols
[2024-05-31 22:54:48] [INFO ] Computed 72 invariants in 1558 ms
[2024-05-31 22:54:55] [INFO ] Implicit Places using invariants in 8551 ms returned []
Implicit Place search using SMT only with invariants took 8552 ms to find 0 implicit places.
Running 24431 sub problems to find dead transitions.
[2024-05-31 22:54:55] [INFO ] Flow matrix only has 19810 transitions (discarded 4691 similar events)
[2024-05-31 22:54:55] [INFO ] Invariant cache hit.
[2024-05-31 22:54:55] [INFO ] State equation strengthened by 14627 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/5323 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 24431 unsolved
SMT process timed out in 83251ms, After SMT, problems are : Problem set: 0 solved, 24431 unsolved
Search for dead transitions found 0 dead transitions in 83447ms
Starting structural reductions in SI_LTL mode, iteration 1 : 5324/10643 places, 24501/29820 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 96722 ms. Remains : 5324/10643 places, 24501/29820 transitions.
Stuttering acceptance computed with spot in 121 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CANInsertWithFailure-PT-070-LTLCardinality-07
Stuttering criterion allowed to conclude after 345 steps with 0 reset in 7 ms.
FORMULA CANInsertWithFailure-PT-070-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-070-LTLCardinality-07 finished in 96909 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 2 out of 10643 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 490 transitions
Trivial Post-agglo rules discarded 490 transitions
Performed 490 trivial Post agglomeration. Transition count delta: 490
Iterating post reduction 0 with 490 rules applied. Total rules applied 490 place count 10643 transition count 29330
Reduce places removed 490 places and 0 transitions.
Iterating post reduction 1 with 490 rules applied. Total rules applied 980 place count 10153 transition count 29330
Performed 4829 Post agglomeration using F-continuation condition.Transition count delta: 4829
Deduced a syphon composed of 4829 places in 10 ms
Reduce places removed 4829 places and 0 transitions.
Iterating global reduction 2 with 9658 rules applied. Total rules applied 10638 place count 5324 transition count 24501
Applied a total of 10638 rules in 4706 ms. Remains 5324 /10643 variables (removed 5319) and now considering 24501/29820 (removed 5319) transitions.
[2024-05-31 22:56:23] [INFO ] Flow matrix only has 19810 transitions (discarded 4691 similar events)
// Phase 1: matrix 19810 rows 5324 cols
[2024-05-31 22:56:25] [INFO ] Computed 72 invariants in 1555 ms
[2024-05-31 22:56:32] [INFO ] Implicit Places using invariants in 8620 ms returned []
Implicit Place search using SMT only with invariants took 8621 ms to find 0 implicit places.
Running 24431 sub problems to find dead transitions.
[2024-05-31 22:56:32] [INFO ] Flow matrix only has 19810 transitions (discarded 4691 similar events)
[2024-05-31 22:56:32] [INFO ] Invariant cache hit.
[2024-05-31 22:56:32] [INFO ] State equation strengthened by 14627 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5323 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 24431 unsolved
SMT process timed out in 83687ms, After SMT, problems are : Problem set: 0 solved, 24431 unsolved
Search for dead transitions found 0 dead transitions in 83884ms
Starting structural reductions in SI_LTL mode, iteration 1 : 5324/10643 places, 24501/29820 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 97241 ms. Remains : 5324/10643 places, 24501/29820 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-070-LTLCardinality-09
Stuttering criterion allowed to conclude after 348 steps with 0 reset in 8 ms.
FORMULA CANInsertWithFailure-PT-070-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-070-LTLCardinality-09 finished in 97331 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(X((p0&&F(G(p1)))))))'
Support contains 3 out of 10643 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Applied a total of 0 rules in 2173 ms. Remains 10643 /10643 variables (removed 0) and now considering 29820/29820 (removed 0) transitions.
// Phase 1: matrix 29820 rows 10643 cols
[2024-05-31 22:58:02] [INFO ] Computed 72 invariants in 4612 ms
[2024-05-31 22:58:16] [INFO ] Implicit Places using invariants in 18061 ms returned []
Implicit Place search using SMT only with invariants took 18062 ms to find 0 implicit places.
Running 29750 sub problems to find dead transitions.
[2024-05-31 22:58:16] [INFO ] Invariant cache hit.
[2024-05-31 22:58:16] [INFO ] State equation strengthened by 9730 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10642 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 29750 unsolved
SMT process timed out in 125300ms, After SMT, problems are : Problem set: 0 solved, 29750 unsolved
Search for dead transitions found 0 dead transitions in 125537ms
Finished structural reductions in LTL mode , in 1 iterations and 145812 ms. Remains : 10643/10643 places, 29820/29820 transitions.
Stuttering acceptance computed with spot in 203 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-070-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA CANInsertWithFailure-PT-070-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-070-LTLCardinality-10 finished in 146082 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 10643 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Applied a total of 0 rules in 1960 ms. Remains 10643 /10643 variables (removed 0) and now considering 29820/29820 (removed 0) transitions.
[2024-05-31 23:00:24] [INFO ] Invariant cache hit.
[2024-05-31 23:00:37] [INFO ] Implicit Places using invariants in 13406 ms returned []
Implicit Place search using SMT only with invariants took 13407 ms to find 0 implicit places.
Running 29750 sub problems to find dead transitions.
[2024-05-31 23:00:37] [INFO ] Invariant cache hit.
[2024-05-31 23:00:38] [INFO ] State equation strengthened by 9730 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10642 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 29750 unsolved
SMT process timed out in 119750ms, After SMT, problems are : Problem set: 0 solved, 29750 unsolved
Search for dead transitions found 0 dead transitions in 119987ms
Finished structural reductions in LTL mode , in 1 iterations and 135385 ms. Remains : 10643/10643 places, 29820/29820 transitions.
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-070-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 51435 steps with 29 reset in 887 ms.
FORMULA CANInsertWithFailure-PT-070-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-070-LTLCardinality-11 finished in 136434 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))'
Support contains 1 out of 10643 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 490 transitions
Trivial Post-agglo rules discarded 490 transitions
Performed 490 trivial Post agglomeration. Transition count delta: 490
Iterating post reduction 0 with 490 rules applied. Total rules applied 490 place count 10643 transition count 29330
Reduce places removed 490 places and 0 transitions.
Iterating post reduction 1 with 490 rules applied. Total rules applied 980 place count 10153 transition count 29330
Performed 4830 Post agglomeration using F-continuation condition.Transition count delta: 4830
Deduced a syphon composed of 4830 places in 10 ms
Reduce places removed 4830 places and 0 transitions.
Iterating global reduction 2 with 9660 rules applied. Total rules applied 10640 place count 5323 transition count 24500
Applied a total of 10640 rules in 5007 ms. Remains 5323 /10643 variables (removed 5320) and now considering 24500/29820 (removed 5320) transitions.
[2024-05-31 23:02:43] [INFO ] Flow matrix only has 19808 transitions (discarded 4692 similar events)
// Phase 1: matrix 19808 rows 5323 cols
[2024-05-31 23:02:45] [INFO ] Computed 72 invariants in 1625 ms
[2024-05-31 23:02:52] [INFO ] Implicit Places using invariants in 8770 ms returned []
Implicit Place search using SMT only with invariants took 8771 ms to find 0 implicit places.
Running 24430 sub problems to find dead transitions.
[2024-05-31 23:02:52] [INFO ] Flow matrix only has 19808 transitions (discarded 4692 similar events)
[2024-05-31 23:02:52] [INFO ] Invariant cache hit.
[2024-05-31 23:02:52] [INFO ] State equation strengthened by 14628 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5322 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 24430 unsolved
SMT process timed out in 84338ms, After SMT, problems are : Problem set: 0 solved, 24430 unsolved
Search for dead transitions found 0 dead transitions in 84535ms
Starting structural reductions in SI_LTL mode, iteration 1 : 5323/10643 places, 24500/29820 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 98342 ms. Remains : 5323/10643 places, 24500/29820 transitions.
Stuttering acceptance computed with spot in 45 ms :[true, (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-070-LTLCardinality-12
Product exploration explored 100000 steps with 284 reset in 2252 ms.
Product exploration explored 100000 steps with 284 reset in 2225 ms.
Computed a total of 213 stabilizing places and 350 stable transitions
Computed a total of 213 stabilizing places and 350 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (112 resets) in 1007 ms. (39 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 55450 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :0 out of 1
Probabilistic random walk after 55450 steps, saw 39158 distinct states, run finished after 3001 ms. (steps per millisecond=18 ) properties seen :0
[2024-05-31 23:04:25] [INFO ] Flow matrix only has 19808 transitions (discarded 4692 similar events)
[2024-05-31 23:04:25] [INFO ] Invariant cache hit.
[2024-05-31 23:04:25] [INFO ] State equation strengthened by 14628 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5180/5181 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 23:04:25] [INFO ] Deduced a trap composed of 2 places in 167 ms of which 1 ms to minimize.
[2024-05-31 23:04:26] [INFO ] Deduced a trap composed of 2 places in 174 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/5181 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5181 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 138/5319 variables, 69/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/5319 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/5321 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 23:04:36] [INFO ] Deduced a trap composed of 85 places in 9972 ms of which 36 ms to minimize.
SMT process timed out in 11774ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 5323 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5323/5323 places, 24500/24500 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 5323 transition count 24499
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 5322 transition count 24499
Partial Free-agglomeration rule applied 4970 times.
Drop transitions (Partial Free agglomeration) removed 4970 transitions
Iterating global reduction 1 with 4970 rules applied. Total rules applied 4972 place count 5322 transition count 24499
Applied a total of 4972 rules in 3537 ms. Remains 5322 /5323 variables (removed 1) and now considering 24499/24500 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3538 ms. Remains : 5322/5323 places, 24499/24500 transitions.
RANDOM walk for 40000 steps (92 resets) in 1070 ms. (37 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 67306 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :0 out of 1
Probabilistic random walk after 67306 steps, saw 52373 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
[2024-05-31 23:04:43] [INFO ] Flow matrix only has 24498 transitions (discarded 1 similar events)
// Phase 1: matrix 24498 rows 5322 cols
[2024-05-31 23:04:44] [INFO ] Computed 72 invariants in 1234 ms
[2024-05-31 23:04:45] [INFO ] State equation strengthened by 24288 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5179/5180 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 23:04:45] [INFO ] Deduced a trap composed of 2 places in 130 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/5180 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5180 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 138/5318 variables, 69/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/5318 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/5320 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 23:04:56] [INFO ] Deduced a trap composed of 92 places in 10247 ms of which 35 ms to minimize.
[2024-05-31 23:05:06] [INFO ] Deduced a trap composed of 95 places in 9937 ms of which 33 ms to minimize.
[2024-05-31 23:05:16] [INFO ] Deduced a trap composed of 87 places in 9861 ms of which 35 ms to minimize.
[2024-05-31 23:05:25] [INFO ] Deduced a trap composed of 83 places in 9125 ms of which 35 ms to minimize.
[2024-05-31 23:05:35] [INFO ] Deduced a trap composed of 84 places in 9405 ms of which 35 ms to minimize.
SMT process timed out in 51695ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 5322 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5322/5322 places, 24499/24499 transitions.
Applied a total of 0 rules in 1387 ms. Remains 5322 /5322 variables (removed 0) and now considering 24499/24499 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1387 ms. Remains : 5322/5322 places, 24499/24499 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5322/5322 places, 24499/24499 transitions.
Applied a total of 0 rules in 1413 ms. Remains 5322 /5322 variables (removed 0) and now considering 24499/24499 (removed 0) transitions.
[2024-05-31 23:05:38] [INFO ] Flow matrix only has 24498 transitions (discarded 1 similar events)
[2024-05-31 23:05:38] [INFO ] Invariant cache hit.
[2024-05-31 23:05:48] [INFO ] Implicit Places using invariants in 10613 ms returned []
Implicit Place search using SMT only with invariants took 10614 ms to find 0 implicit places.
Running 24429 sub problems to find dead transitions.
[2024-05-31 23:05:49] [INFO ] Flow matrix only has 24498 transitions (discarded 1 similar events)
[2024-05-31 23:05:49] [INFO ] Invariant cache hit.
[2024-05-31 23:05:49] [INFO ] State equation strengthened by 24288 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/5321 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 24429 unsolved
SMT process timed out in 94431ms, After SMT, problems are : Problem set: 0 solved, 24429 unsolved
Search for dead transitions found 0 dead transitions in 94627ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106690 ms. Remains : 5322/5322 places, 24499/24499 transitions.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 54 ms :[true, (NOT p0)]
Support contains 1 out of 5323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5323/5323 places, 24500/24500 transitions.
Applied a total of 0 rules in 1025 ms. Remains 5323 /5323 variables (removed 0) and now considering 24500/24500 (removed 0) transitions.
[2024-05-31 23:07:24] [INFO ] Flow matrix only has 19808 transitions (discarded 4692 similar events)
// Phase 1: matrix 19808 rows 5323 cols
[2024-05-31 23:07:26] [INFO ] Computed 72 invariants in 1649 ms
[2024-05-31 23:07:33] [INFO ] Implicit Places using invariants in 8620 ms returned []
Implicit Place search using SMT only with invariants took 8621 ms to find 0 implicit places.
Running 24430 sub problems to find dead transitions.
[2024-05-31 23:07:33] [INFO ] Flow matrix only has 19808 transitions (discarded 4692 similar events)
[2024-05-31 23:07:33] [INFO ] Invariant cache hit.
[2024-05-31 23:07:33] [INFO ] State equation strengthened by 14628 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5322 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 24430 unsolved
SMT process timed out in 85315ms, After SMT, problems are : Problem set: 0 solved, 24430 unsolved
Search for dead transitions found 0 dead transitions in 85511ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 95184 ms. Remains : 5323/5323 places, 24500/24500 transitions.
Computed a total of 213 stabilizing places and 350 stable transitions
Computed a total of 213 stabilizing places and 350 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (112 resets) in 1166 ms. (34 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 55058 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :0 out of 1
Probabilistic random walk after 55058 steps, saw 39117 distinct states, run finished after 3001 ms. (steps per millisecond=18 ) properties seen :0
[2024-05-31 23:09:02] [INFO ] Flow matrix only has 19808 transitions (discarded 4692 similar events)
[2024-05-31 23:09:02] [INFO ] Invariant cache hit.
[2024-05-31 23:09:02] [INFO ] State equation strengthened by 14628 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5180/5181 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 23:09:03] [INFO ] Deduced a trap composed of 2 places in 168 ms of which 1 ms to minimize.
[2024-05-31 23:09:03] [INFO ] Deduced a trap composed of 2 places in 173 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/5181 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5181 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 138/5319 variables, 69/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/5319 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/5321 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 23:09:14] [INFO ] Deduced a trap composed of 85 places in 9884 ms of which 36 ms to minimize.
SMT process timed out in 11690ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 5323 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5323/5323 places, 24500/24500 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 5323 transition count 24499
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 5322 transition count 24499
Partial Free-agglomeration rule applied 4970 times.
Drop transitions (Partial Free agglomeration) removed 4970 transitions
Iterating global reduction 1 with 4970 rules applied. Total rules applied 4972 place count 5322 transition count 24499
Applied a total of 4972 rules in 3541 ms. Remains 5322 /5323 variables (removed 1) and now considering 24499/24500 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3541 ms. Remains : 5322/5323 places, 24499/24500 transitions.
RANDOM walk for 40000 steps (92 resets) in 991 ms. (40 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 67144 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :0 out of 1
Probabilistic random walk after 67144 steps, saw 52354 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
[2024-05-31 23:09:21] [INFO ] Flow matrix only has 24498 transitions (discarded 1 similar events)
// Phase 1: matrix 24498 rows 5322 cols
[2024-05-31 23:09:22] [INFO ] Computed 72 invariants in 1206 ms
[2024-05-31 23:09:22] [INFO ] State equation strengthened by 24288 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5179/5180 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 23:09:23] [INFO ] Deduced a trap composed of 2 places in 128 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/5180 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5180 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 138/5318 variables, 69/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/5318 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/5320 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 23:09:33] [INFO ] Deduced a trap composed of 92 places in 9977 ms of which 30 ms to minimize.
[2024-05-31 23:09:43] [INFO ] Deduced a trap composed of 95 places in 9519 ms of which 29 ms to minimize.
[2024-05-31 23:09:53] [INFO ] Deduced a trap composed of 87 places in 9592 ms of which 36 ms to minimize.
[2024-05-31 23:10:02] [INFO ] Deduced a trap composed of 83 places in 9705 ms of which 34 ms to minimize.
[2024-05-31 23:10:12] [INFO ] Deduced a trap composed of 84 places in 9115 ms of which 39 ms to minimize.
SMT process timed out in 51044ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 5322 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5322/5322 places, 24499/24499 transitions.
Applied a total of 0 rules in 1401 ms. Remains 5322 /5322 variables (removed 0) and now considering 24499/24499 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1401 ms. Remains : 5322/5322 places, 24499/24499 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5322/5322 places, 24499/24499 transitions.
Applied a total of 0 rules in 1412 ms. Remains 5322 /5322 variables (removed 0) and now considering 24499/24499 (removed 0) transitions.
[2024-05-31 23:10:14] [INFO ] Flow matrix only has 24498 transitions (discarded 1 similar events)
[2024-05-31 23:10:14] [INFO ] Invariant cache hit.
[2024-05-31 23:10:25] [INFO ] Implicit Places using invariants in 10726 ms returned []
Implicit Place search using SMT only with invariants took 10727 ms to find 0 implicit places.
Running 24429 sub problems to find dead transitions.
[2024-05-31 23:10:25] [INFO ] Flow matrix only has 24498 transitions (discarded 1 similar events)
[2024-05-31 23:10:25] [INFO ] Invariant cache hit.
[2024-05-31 23:10:26] [INFO ] State equation strengthened by 24288 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5321 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 24429 unsolved
SMT process timed out in 96737ms, After SMT, problems are : Problem set: 0 solved, 24429 unsolved
Search for dead transitions found 0 dead transitions in 96959ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109127 ms. Remains : 5322/5322 places, 24499/24499 transitions.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 283 reset in 2295 ms.
Product exploration explored 100000 steps with 284 reset in 2250 ms.
Support contains 1 out of 5323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5323/5323 places, 24500/24500 transitions.
Applied a total of 0 rules in 1021 ms. Remains 5323 /5323 variables (removed 0) and now considering 24500/24500 (removed 0) transitions.
[2024-05-31 23:12:08] [INFO ] Flow matrix only has 19808 transitions (discarded 4692 similar events)
// Phase 1: matrix 19808 rows 5323 cols
[2024-05-31 23:12:10] [INFO ] Computed 72 invariants in 1596 ms
[2024-05-31 23:12:17] [INFO ] Implicit Places using invariants in 8651 ms returned []
Implicit Place search using SMT only with invariants took 8651 ms to find 0 implicit places.
Running 24430 sub problems to find dead transitions.
[2024-05-31 23:12:17] [INFO ] Flow matrix only has 19808 transitions (discarded 4692 similar events)
[2024-05-31 23:12:17] [INFO ] Invariant cache hit.
[2024-05-31 23:12:17] [INFO ] State equation strengthened by 14628 read => feed constraints.

BK_TIME_CONFINEMENT_REACHED

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CANInsertWithFailure-PT-070"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is CANInsertWithFailure-PT-070, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r476-tall-171620505200147"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CANInsertWithFailure-PT-070.tgz
mv CANInsertWithFailure-PT-070 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;