Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r070-tall-171620505300155.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is CANInsertWithFailure-PT-080, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r070-tall-171620505300155
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 39M
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K 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 39M 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-080-LTLCardinality-00
FORMULA_NAME CANInsertWithFailure-PT-080-LTLCardinality-01
FORMULA_NAME CANInsertWithFailure-PT-080-LTLCardinality-02
FORMULA_NAME CANInsertWithFailure-PT-080-LTLCardinality-03
FORMULA_NAME CANInsertWithFailure-PT-080-LTLCardinality-04
FORMULA_NAME CANInsertWithFailure-PT-080-LTLCardinality-05
FORMULA_NAME CANInsertWithFailure-PT-080-LTLCardinality-06
FORMULA_NAME CANInsertWithFailure-PT-080-LTLCardinality-07
FORMULA_NAME CANInsertWithFailure-PT-080-LTLCardinality-08
FORMULA_NAME CANInsertWithFailure-PT-080-LTLCardinality-09
FORMULA_NAME CANInsertWithFailure-PT-080-LTLCardinality-10
FORMULA_NAME CANInsertWithFailure-PT-080-LTLCardinality-11
FORMULA_NAME CANInsertWithFailure-PT-080-LTLCardinality-12
FORMULA_NAME CANInsertWithFailure-PT-080-LTLCardinality-13
FORMULA_NAME CANInsertWithFailure-PT-080-LTLCardinality-14
FORMULA_NAME CANInsertWithFailure-PT-080-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716259391377

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-080
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-21 02:43:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 02:43:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 02:43:13] [INFO ] Load time of PNML (sax parser for PT used): 958 ms
[2024-05-21 02:43:13] [INFO ] Transformed 13764 places.
[2024-05-21 02:43:13] [INFO ] Transformed 38880 transitions.
[2024-05-21 02:43:13] [INFO ] Parsed PT model containing 13764 places and 38880 transitions and 104000 arcs in 1207 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 87 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA CANInsertWithFailure-PT-080-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-080-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-080-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-080-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 13764 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13764/13764 places, 38880/38880 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 13763 transition count 38880
Applied a total of 1 rules in 4760 ms. Remains 13763 /13764 variables (removed 1) and now considering 38880/38880 (removed 0) transitions.
// Phase 1: matrix 38880 rows 13763 cols
[2024-05-21 02:43:29] [INFO ] Computed 82 invariants in 10583 ms
[2024-05-21 02:43:52] [INFO ] Implicit Places using invariants in 33048 ms returned []
Implicit Place search using SMT only with invariants took 33084 ms to find 0 implicit places.
Running 38800 sub problems to find dead transitions.
[2024-05-21 02:43:52] [INFO ] Invariant cache hit.
[2024-05-21 02:43:53] [INFO ] State equation strengthened by 12720 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13762 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 38800 unsolved
SMT process timed out in 193985ms, After SMT, problems are : Problem set: 0 solved, 38800 unsolved
Search for dead transitions found 0 dead transitions in 194373ms
Starting structural reductions in LTL mode, iteration 1 : 13763/13764 places, 38880/38880 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 232394 ms. Remains : 13763/13764 places, 38880/38880 transitions.
Support contains 33 out of 13763 places after structural reductions.
[2024-05-21 02:47:08] [INFO ] Flatten gal took : 1065 ms
[2024-05-21 02:47:09] [INFO ] Flatten gal took : 955 ms
[2024-05-21 02:47:10] [INFO ] Input system was already deterministic with 38880 transitions.
Support contains 30 out of 13763 places (down from 33) after GAL structural reductions.
RANDOM walk for 40000 steps (18 resets) in 3750 ms. (10 steps per ms) remains 14/18 properties
BEST_FIRST walk for 40004 steps (8 resets) in 221 ms. (180 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 13/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 13/13 properties
[2024-05-21 02:47:12] [INFO ] Invariant cache hit.
[2024-05-21 02:47:12] [INFO ] State equation strengthened by 12720 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 13580/13601 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13601 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 158/13759 variables, 79/80 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 13759/52643 variables, and 80 constraints, problems are : Problem set: 0 solved, 13 unsolved in 5020 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/13763 constraints, ReadFeed: 0/12720 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 13580/13601 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-21 02:47:20] [INFO ] Deduced a trap composed of 5 places in 635 ms of which 26 ms to minimize.
[2024-05-21 02:47:20] [INFO ] Deduced a trap composed of 5 places in 516 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 13601/52643 variables, and 3 constraints, problems are : Problem set: 0 solved, 13 unsolved in 5015 ms.
Refiners :[Positive P Invariants (semi-flows): 1/80 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/13763 constraints, ReadFeed: 0/12720 constraints, PredecessorRefiner: 0/13 constraints, Known Traps: 2/2 constraints]
After SMT, in 10309ms problems are : Problem set: 0 solved, 13 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 21 out of 13763 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 560 transitions
Trivial Post-agglo rules discarded 560 transitions
Performed 560 trivial Post agglomeration. Transition count delta: 560
Iterating post reduction 0 with 560 rules applied. Total rules applied 560 place count 13763 transition count 38320
Reduce places removed 560 places and 0 transitions.
Iterating post reduction 1 with 560 rules applied. Total rules applied 1120 place count 13203 transition count 38320
Performed 6310 Post agglomeration using F-continuation condition.Transition count delta: 6310
Deduced a syphon composed of 6310 places in 22 ms
Reduce places removed 6310 places and 0 transitions.
Iterating global reduction 2 with 12620 rules applied. Total rules applied 13740 place count 6893 transition count 32010
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 13741 place count 6893 transition count 32009
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13742 place count 6892 transition count 32009
Partial Free-agglomeration rule applied 6470 times.
Drop transitions (Partial Free agglomeration) removed 6470 transitions
Iterating global reduction 3 with 6470 rules applied. Total rules applied 20212 place count 6892 transition count 32009
Applied a total of 20212 rules in 14521 ms. Remains 6892 /13763 variables (removed 6871) and now considering 32009/38880 (removed 6871) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14545 ms. Remains : 6892/13763 places, 32009/38880 transitions.
RANDOM walk for 40000 steps (80 resets) in 3974 ms. (10 steps per ms) remains 10/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 256 ms. (155 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 102 ms. (388 steps per ms) remains 10/10 properties
[2024-05-21 02:47:38] [INFO ] Flow matrix only has 31998 transitions (discarded 11 similar events)
// Phase 1: matrix 31998 rows 6892 cols
[2024-05-21 02:47:40] [INFO ] Computed 82 invariants in 2044 ms
[2024-05-21 02:47:41] [INFO ] State equation strengthened by 31718 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 6714/6730 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6730 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 158/6888 variables, 79/80 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6888 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 2/6890 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6890 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 31998/38888 variables, 6890/6972 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/38888 variables, 31718/38690 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/38888 variables, 0/38690 constraints. Problems are: Problem set: 0 solved, 10 unsolved
SMT process timed out in 47507ms, After SMT, problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 16 out of 6892 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6892/6892 places, 32009/32009 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 6890 transition count 32007
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 6890 transition count 32007
Applied a total of 7 rules in 8372 ms. Remains 6890 /6892 variables (removed 2) and now considering 32007/32009 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8372 ms. Remains : 6890/6892 places, 32007/32009 transitions.
RANDOM walk for 40000 steps (80 resets) in 1869 ms. (21 steps per ms) remains 8/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 95 ms. (416 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 8/8 properties
[2024-05-21 02:48:35] [INFO ] Flow matrix only has 31999 transitions (discarded 8 similar events)
// Phase 1: matrix 31999 rows 6890 cols
[2024-05-21 02:48:37] [INFO ] Computed 82 invariants in 2043 ms
[2024-05-21 02:48:38] [INFO ] State equation strengthened by 31728 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 6716/6728 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-21 02:48:39] [INFO ] Deduced a trap composed of 2 places in 221 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/6728 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6728 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 158/6886 variables, 79/81 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/6886 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 2/6888 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-21 02:49:01] [INFO ] Deduced a trap composed of 138 places in 16250 ms of which 47 ms to minimize.
[2024-05-21 02:49:18] [INFO ] Deduced a trap composed of 101 places in 16473 ms of which 41 ms to minimize.
[2024-05-21 02:49:33] [INFO ] Deduced a trap composed of 177 places in 15364 ms of which 46 ms to minimize.
[2024-05-21 02:49:49] [INFO ] Deduced a trap composed of 196 places in 15476 ms of which 41 ms to minimize.
[2024-05-21 02:50:05] [INFO ] Deduced a trap composed of 148 places in 15897 ms of which 45 ms to minimize.
SMT process timed out in 89536ms, After SMT, problems are : Problem set: 0 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 12 out of 6890 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6890/6890 places, 32007/32007 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 7 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 6888 transition count 32005
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 6888 transition count 32005
Applied a total of 6 rules in 6156 ms. Remains 6888 /6890 variables (removed 2) and now considering 32005/32007 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6156 ms. Remains : 6888/6890 places, 32005/32007 transitions.
Computed a total of 322 stabilizing places and 560 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 4 out of 13763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Applied a total of 0 rules in 3333 ms. Remains 13763 /13763 variables (removed 0) and now considering 38880/38880 (removed 0) transitions.
// Phase 1: matrix 38880 rows 13763 cols
[2024-05-21 02:50:23] [INFO ] Computed 82 invariants in 9039 ms
[2024-05-21 02:50:46] [INFO ] Implicit Places using invariants in 31136 ms returned []
Implicit Place search using SMT only with invariants took 31144 ms to find 0 implicit places.
Running 38800 sub problems to find dead transitions.
[2024-05-21 02:50:46] [INFO ] Invariant cache hit.
[2024-05-21 02:50:46] [INFO ] State equation strengthened by 12720 read => feed constraints.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 13762/52643 variables, and 80 constraints, problems are : Problem set: 0 solved, 38800 unsolved in 30429 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/13763 constraints, ReadFeed: 0/12720 constraints, PredecessorRefiner: 38800/38800 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38800 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 13762/52643 variables, and 80 constraints, problems are : Problem set: 0 solved, 38800 unsolved in 30431 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/13763 constraints, ReadFeed: 0/12720 constraints, PredecessorRefiner: 0/38800 constraints, Known Traps: 0/0 constraints]
After SMT, in 251905ms problems are : Problem set: 0 solved, 38800 unsolved
Search for dead transitions found 0 dead transitions in 252293ms
Finished structural reductions in LTL mode , in 1 iterations and 286865 ms. Remains : 13763/13763 places, 38880/38880 transitions.
Stuttering acceptance computed with spot in 230 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 7 ms.
FORMULA CANInsertWithFailure-PT-080-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-080-LTLCardinality-00 finished in 287260 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(F(p0))))'
Support contains 2 out of 13763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Applied a total of 0 rules in 3481 ms. Remains 13763 /13763 variables (removed 0) and now considering 38880/38880 (removed 0) transitions.
[2024-05-21 02:55:02] [INFO ] Invariant cache hit.
[2024-05-21 02:55:24] [INFO ] Implicit Places using invariants in 22217 ms returned []
Implicit Place search using SMT only with invariants took 22222 ms to find 0 implicit places.
Running 38800 sub problems to find dead transitions.
[2024-05-21 02:55:24] [INFO ] Invariant cache hit.
[2024-05-21 02:55:25] [INFO ] State equation strengthened by 12720 read => feed constraints.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 13762/52643 variables, and 80 constraints, problems are : Problem set: 0 solved, 38800 unsolved in 30449 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/13763 constraints, ReadFeed: 0/12720 constraints, PredecessorRefiner: 38800/38800 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38800 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 13762/52643 variables, and 80 constraints, problems are : Problem set: 0 solved, 38800 unsolved in 30430 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/13763 constraints, ReadFeed: 0/12720 constraints, PredecessorRefiner: 0/38800 constraints, Known Traps: 0/0 constraints]
After SMT, in 230875ms problems are : Problem set: 0 solved, 38800 unsolved
Search for dead transitions found 0 dead transitions in 231213ms
Finished structural reductions in LTL mode , in 1 iterations and 256975 ms. Remains : 13763/13763 places, 38880/38880 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLCardinality-01
Product exploration explored 100000 steps with 33333 reset in 4415 ms.
Product exploration explored 100000 steps with 33333 reset in 3763 ms.
Computed a total of 322 stabilizing places and 560 stable transitions
Computed a total of 322 stabilizing places and 560 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 21 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-080-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-080-LTLCardinality-01 finished in 265531 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 13763 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 560 transitions
Trivial Post-agglo rules discarded 560 transitions
Performed 560 trivial Post agglomeration. Transition count delta: 560
Iterating post reduction 0 with 560 rules applied. Total rules applied 560 place count 13763 transition count 38320
Reduce places removed 560 places and 0 transitions.
Iterating post reduction 1 with 560 rules applied. Total rules applied 1120 place count 13203 transition count 38320
Performed 6320 Post agglomeration using F-continuation condition.Transition count delta: 6320
Deduced a syphon composed of 6320 places in 20 ms
Reduce places removed 6320 places and 0 transitions.
Iterating global reduction 2 with 12640 rules applied. Total rules applied 13760 place count 6883 transition count 32000
Applied a total of 13760 rules in 8970 ms. Remains 6883 /13763 variables (removed 6880) and now considering 32000/38880 (removed 6880) transitions.
[2024-05-21 02:59:33] [INFO ] Flow matrix only has 25838 transitions (discarded 6162 similar events)
// Phase 1: matrix 25838 rows 6883 cols
[2024-05-21 02:59:37] [INFO ] Computed 82 invariants in 3967 ms
[2024-05-21 02:59:48] [INFO ] Implicit Places using invariants in 15475 ms returned []
Implicit Place search using SMT only with invariants took 15476 ms to find 0 implicit places.
Running 31920 sub problems to find dead transitions.
[2024-05-21 02:59:49] [INFO ] Flow matrix only has 25838 transitions (discarded 6162 similar events)
[2024-05-21 02:59:49] [INFO ] Invariant cache hit.
[2024-05-21 02:59:49] [INFO ] State equation strengthened by 19118 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6882 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 31920 unsolved
SMT process timed out in 142073ms, After SMT, problems are : Problem set: 0 solved, 31920 unsolved
Search for dead transitions found 0 dead transitions in 142343ms
Starting structural reductions in SI_LTL mode, iteration 1 : 6883/13763 places, 32000/38880 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 166839 ms. Remains : 6883/13763 places, 32000/38880 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLCardinality-02
Product exploration explored 100000 steps with 249 reset in 3247 ms.
Product exploration explored 100000 steps with 246 reset in 3483 ms.
Computed a total of 243 stabilizing places and 400 stable transitions
Computed a total of 243 stabilizing places and 400 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 83 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 71 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (97 resets) in 2155 ms. (18 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 58895 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :0 out of 1
Probabilistic random walk after 58895 steps, saw 46784 distinct states, run finished after 3005 ms. (steps per millisecond=19 ) properties seen :0
[2024-05-21 03:02:22] [INFO ] Flow matrix only has 25838 transitions (discarded 6162 similar events)
[2024-05-21 03:02:22] [INFO ] Invariant cache hit.
[2024-05-21 03:02:22] [INFO ] State equation strengthened by 19118 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) 6720/6721 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 03:02:23] [INFO ] Deduced a trap composed of 2 places in 255 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/6721 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6721 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 158/6879 variables, 79/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/6879 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/6881 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 03:02:39] [INFO ] Deduced a trap composed of 96 places in 15627 ms of which 46 ms to minimize.
SMT process timed out in 17956ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 6883 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6883/6883 places, 32000/32000 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 6883 transition count 31999
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 6882 transition count 31999
Partial Free-agglomeration rule applied 6480 times.
Drop transitions (Partial Free agglomeration) removed 6480 transitions
Iterating global reduction 1 with 6480 rules applied. Total rules applied 6482 place count 6882 transition count 31999
Applied a total of 6482 rules in 5642 ms. Remains 6882 /6883 variables (removed 1) and now considering 31999/32000 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5643 ms. Remains : 6882/6883 places, 31999/32000 transitions.
RANDOM walk for 40000 steps (81 resets) in 1983 ms. (20 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 74388 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :0 out of 1
Probabilistic random walk after 74388 steps, saw 64089 distinct states, run finished after 3002 ms. (steps per millisecond=24 ) properties seen :0
[2024-05-21 03:02:49] [INFO ] Flow matrix only has 31998 transitions (discarded 1 similar events)
// Phase 1: matrix 31998 rows 6882 cols
[2024-05-21 03:02:51] [INFO ] Computed 82 invariants in 1973 ms
[2024-05-21 03:02:51] [INFO ] State equation strengthened by 31758 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) 6719/6720 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 03:02:52] [INFO ] Deduced a trap composed of 2 places in 195 ms of which 1 ms to minimize.
[2024-05-21 03:02:52] [INFO ] Deduced a trap composed of 2 places in 319 ms of which 3 ms to minimize.
[2024-05-21 03:02:53] [INFO ] Deduced a trap composed of 2 places in 183 ms of which 1 ms to minimize.
[2024-05-21 03:02:53] [INFO ] Deduced a trap composed of 2 places in 186 ms of which 1 ms to minimize.
[2024-05-21 03:02:53] [INFO ] Deduced a trap composed of 2 places in 182 ms of which 1 ms to minimize.
[2024-05-21 03:02:54] [INFO ] Deduced a trap composed of 2 places in 182 ms of which 1 ms to minimize.
[2024-05-21 03:02:54] [INFO ] Deduced a trap composed of 2 places in 180 ms of which 2 ms to minimize.
[2024-05-21 03:02:54] [INFO ] Deduced a trap composed of 2 places in 186 ms of which 2 ms to minimize.
[2024-05-21 03:02:54] [INFO ] Deduced a trap composed of 2 places in 182 ms of which 1 ms to minimize.
[2024-05-21 03:02:55] [INFO ] Deduced a trap composed of 2 places in 185 ms of which 1 ms to minimize.
[2024-05-21 03:02:55] [INFO ] Deduced a trap composed of 2 places in 180 ms of which 1 ms to minimize.
[2024-05-21 03:02:55] [INFO ] Deduced a trap composed of 2 places in 184 ms of which 1 ms to minimize.
[2024-05-21 03:02:55] [INFO ] Deduced a trap composed of 2 places in 185 ms of which 1 ms to minimize.
[2024-05-21 03:02:56] [INFO ] Deduced a trap composed of 2 places in 185 ms of which 2 ms to minimize.
[2024-05-21 03:02:56] [INFO ] Deduced a trap composed of 2 places in 183 ms of which 2 ms to minimize.
[2024-05-21 03:02:56] [INFO ] Deduced a trap composed of 2 places in 183 ms of which 1 ms to minimize.
[2024-05-21 03:02:56] [INFO ] Deduced a trap composed of 2 places in 179 ms of which 1 ms to minimize.
[2024-05-21 03:02:57] [INFO ] Deduced a trap composed of 2 places in 184 ms of which 1 ms to minimize.
[2024-05-21 03:02:57] [INFO ] Deduced a trap composed of 2 places in 179 ms of which 2 ms to minimize.
[2024-05-21 03:02:57] [INFO ] Deduced a trap composed of 2 places in 180 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/6720 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 03:02:58] [INFO ] Deduced a trap composed of 2 places in 182 ms of which 1 ms to minimize.
[2024-05-21 03:02:58] [INFO ] Deduced a trap composed of 2 places in 182 ms of which 1 ms to minimize.
[2024-05-21 03:02:58] [INFO ] Deduced a trap composed of 2 places in 181 ms of which 1 ms to minimize.
[2024-05-21 03:02:58] [INFO ] Deduced a trap composed of 2 places in 184 ms of which 2 ms to minimize.
[2024-05-21 03:02:59] [INFO ] Deduced a trap composed of 2 places in 182 ms of which 4 ms to minimize.
[2024-05-21 03:02:59] [INFO ] Deduced a trap composed of 2 places in 177 ms of which 1 ms to minimize.
[2024-05-21 03:02:59] [INFO ] Deduced a trap composed of 2 places in 175 ms of which 1 ms to minimize.
[2024-05-21 03:02:59] [INFO ] Deduced a trap composed of 2 places in 177 ms of which 1 ms to minimize.
[2024-05-21 03:03:00] [INFO ] Deduced a trap composed of 2 places in 175 ms of which 1 ms to minimize.
[2024-05-21 03:03:00] [INFO ] Deduced a trap composed of 2 places in 180 ms of which 1 ms to minimize.
[2024-05-21 03:03:00] [INFO ] Deduced a trap composed of 2 places in 175 ms of which 2 ms to minimize.
[2024-05-21 03:03:00] [INFO ] Deduced a trap composed of 2 places in 177 ms of which 2 ms to minimize.
[2024-05-21 03:03:01] [INFO ] Deduced a trap composed of 2 places in 170 ms of which 1 ms to minimize.
[2024-05-21 03:03:01] [INFO ] Deduced a trap composed of 2 places in 178 ms of which 1 ms to minimize.
[2024-05-21 03:03:01] [INFO ] Deduced a trap composed of 2 places in 173 ms of which 1 ms to minimize.
[2024-05-21 03:03:01] [INFO ] Deduced a trap composed of 2 places in 175 ms of which 1 ms to minimize.
[2024-05-21 03:03:02] [INFO ] Deduced a trap composed of 2 places in 168 ms of which 1 ms to minimize.
[2024-05-21 03:03:02] [INFO ] Deduced a trap composed of 2 places in 171 ms of which 1 ms to minimize.
[2024-05-21 03:03:02] [INFO ] Deduced a trap composed of 2 places in 171 ms of which 1 ms to minimize.
[2024-05-21 03:03:02] [INFO ] Deduced a trap composed of 2 places in 173 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/6720 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 03:03:03] [INFO ] Deduced a trap composed of 2 places in 178 ms of which 1 ms to minimize.
[2024-05-21 03:03:03] [INFO ] Deduced a trap composed of 2 places in 176 ms of which 1 ms to minimize.
[2024-05-21 03:03:03] [INFO ] Deduced a trap composed of 2 places in 177 ms of which 2 ms to minimize.
[2024-05-21 03:03:04] [INFO ] Deduced a trap composed of 2 places in 173 ms of which 1 ms to minimize.
[2024-05-21 03:03:04] [INFO ] Deduced a trap composed of 2 places in 169 ms of which 1 ms to minimize.
[2024-05-21 03:03:04] [INFO ] Deduced a trap composed of 2 places in 174 ms of which 1 ms to minimize.
[2024-05-21 03:03:04] [INFO ] Deduced a trap composed of 2 places in 175 ms of which 1 ms to minimize.
[2024-05-21 03:03:05] [INFO ] Deduced a trap composed of 2 places in 169 ms of which 1 ms to minimize.
[2024-05-21 03:03:05] [INFO ] Deduced a trap composed of 2 places in 173 ms of which 1 ms to minimize.
[2024-05-21 03:03:05] [INFO ] Deduced a trap composed of 2 places in 172 ms of which 1 ms to minimize.
[2024-05-21 03:03:05] [INFO ] Deduced a trap composed of 2 places in 171 ms of which 1 ms to minimize.
[2024-05-21 03:03:06] [INFO ] Deduced a trap composed of 2 places in 170 ms of which 1 ms to minimize.
[2024-05-21 03:03:06] [INFO ] Deduced a trap composed of 2 places in 170 ms of which 1 ms to minimize.
[2024-05-21 03:03:06] [INFO ] Deduced a trap composed of 2 places in 169 ms of which 1 ms to minimize.
[2024-05-21 03:03:06] [INFO ] Deduced a trap composed of 2 places in 169 ms of which 1 ms to minimize.
[2024-05-21 03:03:07] [INFO ] Deduced a trap composed of 2 places in 169 ms of which 1 ms to minimize.
[2024-05-21 03:03:07] [INFO ] Deduced a trap composed of 2 places in 166 ms of which 1 ms to minimize.
[2024-05-21 03:03:07] [INFO ] Deduced a trap composed of 2 places in 174 ms of which 1 ms to minimize.
[2024-05-21 03:03:07] [INFO ] Deduced a trap composed of 2 places in 170 ms of which 1 ms to minimize.
[2024-05-21 03:03:08] [INFO ] Deduced a trap composed of 2 places in 169 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/6720 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 03:03:08] [INFO ] Deduced a trap composed of 2 places in 171 ms of which 1 ms to minimize.
[2024-05-21 03:03:08] [INFO ] Deduced a trap composed of 2 places in 169 ms of which 1 ms to minimize.
[2024-05-21 03:03:09] [INFO ] Deduced a trap composed of 2 places in 168 ms of which 1 ms to minimize.
[2024-05-21 03:03:09] [INFO ] Deduced a trap composed of 2 places in 169 ms of which 1 ms to minimize.
[2024-05-21 03:03:09] [INFO ] Deduced a trap composed of 2 places in 173 ms of which 1 ms to minimize.
[2024-05-21 03:03:09] [INFO ] Deduced a trap composed of 2 places in 181 ms of which 0 ms to minimize.
[2024-05-21 03:03:10] [INFO ] Deduced a trap composed of 2 places in 171 ms of which 0 ms to minimize.
[2024-05-21 03:03:10] [INFO ] Deduced a trap composed of 2 places in 173 ms of which 1 ms to minimize.
[2024-05-21 03:03:10] [INFO ] Deduced a trap composed of 2 places in 173 ms of which 0 ms to minimize.
[2024-05-21 03:03:10] [INFO ] Deduced a trap composed of 2 places in 172 ms of which 1 ms to minimize.
[2024-05-21 03:03:11] [INFO ] Deduced a trap composed of 2 places in 171 ms of which 1 ms to minimize.
[2024-05-21 03:03:11] [INFO ] Deduced a trap composed of 2 places in 170 ms of which 1 ms to minimize.
[2024-05-21 03:03:11] [INFO ] Deduced a trap composed of 2 places in 172 ms of which 1 ms to minimize.
[2024-05-21 03:03:11] [INFO ] Deduced a trap composed of 2 places in 169 ms of which 1 ms to minimize.
[2024-05-21 03:03:12] [INFO ] Deduced a trap composed of 2 places in 171 ms of which 1 ms to minimize.
[2024-05-21 03:03:12] [INFO ] Deduced a trap composed of 2 places in 171 ms of which 1 ms to minimize.
[2024-05-21 03:03:12] [INFO ] Deduced a trap composed of 2 places in 170 ms of which 1 ms to minimize.
[2024-05-21 03:03:12] [INFO ] Deduced a trap composed of 2 places in 167 ms of which 1 ms to minimize.
[2024-05-21 03:03:13] [INFO ] Deduced a trap composed of 2 places in 162 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/6720 variables, 19/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/6720 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 158/6878 variables, 79/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/6878 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/6880 variables, 2/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/6880 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 38878/38880 variables, and 7041 constraints, problems are : Problem set: 0 solved, 1 unsolved in 36464 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 6880/6882 constraints, ReadFeed: 0/31758 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 79/79 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) 6719/6720 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6720 variables, 79/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6720 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 158/6878 variables, 79/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/6878 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/6880 variables, 2/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 03:03:45] [INFO ] Deduced a trap composed of 92 places in 15761 ms of which 44 ms to minimize.
[2024-05-21 03:04:01] [INFO ] Deduced a trap composed of 100 places in 15816 ms of which 46 ms to minimize.
[2024-05-21 03:04:17] [INFO ] Deduced a trap composed of 193 places in 16380 ms of which 44 ms to minimize.
SMT process timed out in 88787ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 6882 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6882/6882 places, 31999/31999 transitions.
Applied a total of 0 rules in 2190 ms. Remains 6882 /6882 variables (removed 0) and now considering 31999/31999 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2191 ms. Remains : 6882/6882 places, 31999/31999 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6882/6882 places, 31999/31999 transitions.
Applied a total of 0 rules in 2077 ms. Remains 6882 /6882 variables (removed 0) and now considering 31999/31999 (removed 0) transitions.
[2024-05-21 03:04:22] [INFO ] Flow matrix only has 31998 transitions (discarded 1 similar events)
[2024-05-21 03:04:22] [INFO ] Invariant cache hit.
[2024-05-21 03:04:39] [INFO ] Implicit Places using invariants in 16846 ms returned []
Implicit Place search using SMT only with invariants took 16849 ms to find 0 implicit places.
Running 31919 sub problems to find dead transitions.
[2024-05-21 03:04:39] [INFO ] Flow matrix only has 31998 transitions (discarded 1 similar events)
[2024-05-21 03:04:39] [INFO ] Invariant cache hit.
[2024-05-21 03:04:39] [INFO ] State equation strengthened by 31758 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/6881 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 31919 unsolved
SMT process timed out in 156198ms, After SMT, problems are : Problem set: 0 solved, 31919 unsolved
Search for dead transitions found 0 dead transitions in 156481ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 175458 ms. Remains : 6882/6882 places, 31999/31999 transitions.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 106 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 86 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 6883 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6883/6883 places, 32000/32000 transitions.
Applied a total of 0 rules in 1671 ms. Remains 6883 /6883 variables (removed 0) and now considering 32000/32000 (removed 0) transitions.
[2024-05-21 03:07:17] [INFO ] Flow matrix only has 25838 transitions (discarded 6162 similar events)
// Phase 1: matrix 25838 rows 6883 cols
[2024-05-21 03:07:21] [INFO ] Computed 82 invariants in 4217 ms
[2024-05-21 03:07:33] [INFO ] Implicit Places using invariants in 15634 ms returned []
Implicit Place search using SMT only with invariants took 15637 ms to find 0 implicit places.
Running 31920 sub problems to find dead transitions.
[2024-05-21 03:07:33] [INFO ] Flow matrix only has 25838 transitions (discarded 6162 similar events)
[2024-05-21 03:07:33] [INFO ] Invariant cache hit.
[2024-05-21 03:07:33] [INFO ] State equation strengthened by 19118 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/6882 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 31920 unsolved
SMT process timed out in 139413ms, After SMT, problems are : Problem set: 0 solved, 31920 unsolved
Search for dead transitions found 0 dead transitions in 139738ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 157098 ms. Remains : 6883/6883 places, 32000/32000 transitions.
Computed a total of 243 stabilizing places and 400 stable transitions
Computed a total of 243 stabilizing places and 400 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 73 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 76 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (96 resets) in 1989 ms. (20 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 56964 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :0 out of 1
Probabilistic random walk after 56964 steps, saw 46521 distinct states, run finished after 3001 ms. (steps per millisecond=18 ) properties seen :0
[2024-05-21 03:09:56] [INFO ] Flow matrix only has 25838 transitions (discarded 6162 similar events)
[2024-05-21 03:09:56] [INFO ] Invariant cache hit.
[2024-05-21 03:09:57] [INFO ] State equation strengthened by 19118 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) 6720/6721 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 03:09:58] [INFO ] Deduced a trap composed of 2 places in 246 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/6721 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6721 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 158/6879 variables, 79/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/6879 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/6881 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 03:10:15] [INFO ] Deduced a trap composed of 96 places in 15906 ms of which 49 ms to minimize.
SMT process timed out in 18128ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 6883 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6883/6883 places, 32000/32000 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 6883 transition count 31999
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 6882 transition count 31999
Partial Free-agglomeration rule applied 6480 times.
Drop transitions (Partial Free agglomeration) removed 6480 transitions
Iterating global reduction 1 with 6480 rules applied. Total rules applied 6482 place count 6882 transition count 31999
Applied a total of 6482 rules in 5562 ms. Remains 6882 /6883 variables (removed 1) and now considering 31999/32000 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5564 ms. Remains : 6882/6883 places, 31999/32000 transitions.
RANDOM walk for 40000 steps (81 resets) in 1453 ms. (27 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 74933 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :0 out of 1
Probabilistic random walk after 74933 steps, saw 64169 distinct states, run finished after 3001 ms. (steps per millisecond=24 ) properties seen :0
[2024-05-21 03:10:24] [INFO ] Flow matrix only has 31998 transitions (discarded 1 similar events)
// Phase 1: matrix 31998 rows 6882 cols
[2024-05-21 03:10:26] [INFO ] Computed 82 invariants in 2043 ms
[2024-05-21 03:10:26] [INFO ] State equation strengthened by 31758 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) 6719/6720 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 03:10:27] [INFO ] Deduced a trap composed of 2 places in 189 ms of which 1 ms to minimize.
[2024-05-21 03:10:27] [INFO ] Deduced a trap composed of 2 places in 195 ms of which 2 ms to minimize.
[2024-05-21 03:10:28] [INFO ] Deduced a trap composed of 2 places in 190 ms of which 1 ms to minimize.
[2024-05-21 03:10:28] [INFO ] Deduced a trap composed of 2 places in 194 ms of which 1 ms to minimize.
[2024-05-21 03:10:28] [INFO ] Deduced a trap composed of 2 places in 202 ms of which 2 ms to minimize.
[2024-05-21 03:10:28] [INFO ] Deduced a trap composed of 2 places in 184 ms of which 1 ms to minimize.
[2024-05-21 03:10:29] [INFO ] Deduced a trap composed of 2 places in 181 ms of which 1 ms to minimize.
[2024-05-21 03:10:29] [INFO ] Deduced a trap composed of 2 places in 189 ms of which 1 ms to minimize.
[2024-05-21 03:10:29] [INFO ] Deduced a trap composed of 2 places in 185 ms of which 2 ms to minimize.
[2024-05-21 03:10:29] [INFO ] Deduced a trap composed of 2 places in 185 ms of which 2 ms to minimize.
[2024-05-21 03:10:30] [INFO ] Deduced a trap composed of 2 places in 188 ms of which 1 ms to minimize.
[2024-05-21 03:10:30] [INFO ] Deduced a trap composed of 2 places in 183 ms of which 1 ms to minimize.
[2024-05-21 03:10:30] [INFO ] Deduced a trap composed of 2 places in 183 ms of which 2 ms to minimize.
[2024-05-21 03:10:31] [INFO ] Deduced a trap composed of 2 places in 184 ms of which 1 ms to minimize.
[2024-05-21 03:10:31] [INFO ] Deduced a trap composed of 2 places in 177 ms of which 1 ms to minimize.
[2024-05-21 03:10:31] [INFO ] Deduced a trap composed of 2 places in 172 ms of which 1 ms to minimize.
[2024-05-21 03:10:31] [INFO ] Deduced a trap composed of 2 places in 178 ms of which 2 ms to minimize.
[2024-05-21 03:10:32] [INFO ] Deduced a trap composed of 2 places in 176 ms of which 1 ms to minimize.
[2024-05-21 03:10:32] [INFO ] Deduced a trap composed of 2 places in 174 ms of which 1 ms to minimize.
[2024-05-21 03:10:32] [INFO ] Deduced a trap composed of 2 places in 173 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/6720 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 03:10:32] [INFO ] Deduced a trap composed of 2 places in 176 ms of which 1 ms to minimize.
[2024-05-21 03:10:33] [INFO ] Deduced a trap composed of 2 places in 178 ms of which 1 ms to minimize.
[2024-05-21 03:10:33] [INFO ] Deduced a trap composed of 2 places in 174 ms of which 1 ms to minimize.
[2024-05-21 03:10:33] [INFO ] Deduced a trap composed of 2 places in 167 ms of which 1 ms to minimize.
[2024-05-21 03:10:33] [INFO ] Deduced a trap composed of 2 places in 176 ms of which 1 ms to minimize.
[2024-05-21 03:10:34] [INFO ] Deduced a trap composed of 2 places in 175 ms of which 1 ms to minimize.
[2024-05-21 03:10:34] [INFO ] Deduced a trap composed of 2 places in 177 ms of which 1 ms to minimize.
[2024-05-21 03:10:34] [INFO ] Deduced a trap composed of 2 places in 177 ms of which 1 ms to minimize.
[2024-05-21 03:10:34] [INFO ] Deduced a trap composed of 2 places in 177 ms of which 1 ms to minimize.
[2024-05-21 03:10:35] [INFO ] Deduced a trap composed of 2 places in 173 ms of which 1 ms to minimize.
[2024-05-21 03:10:35] [INFO ] Deduced a trap composed of 2 places in 178 ms of which 1 ms to minimize.
[2024-05-21 03:10:35] [INFO ] Deduced a trap composed of 2 places in 176 ms of which 1 ms to minimize.
[2024-05-21 03:10:35] [INFO ] Deduced a trap composed of 2 places in 173 ms of which 2 ms to minimize.
[2024-05-21 03:10:36] [INFO ] Deduced a trap composed of 2 places in 180 ms of which 2 ms to minimize.
[2024-05-21 03:10:36] [INFO ] Deduced a trap composed of 2 places in 175 ms of which 1 ms to minimize.
[2024-05-21 03:10:36] [INFO ] Deduced a trap composed of 2 places in 185 ms of which 1 ms to minimize.
[2024-05-21 03:10:37] [INFO ] Deduced a trap composed of 2 places in 173 ms of which 1 ms to minimize.
[2024-05-21 03:10:37] [INFO ] Deduced a trap composed of 2 places in 172 ms of which 1 ms to minimize.
[2024-05-21 03:10:37] [INFO ] Deduced a trap composed of 2 places in 170 ms of which 1 ms to minimize.
[2024-05-21 03:10:37] [INFO ] Deduced a trap composed of 2 places in 173 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/6720 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 03:10:38] [INFO ] Deduced a trap composed of 2 places in 170 ms of which 1 ms to minimize.
[2024-05-21 03:10:38] [INFO ] Deduced a trap composed of 2 places in 173 ms of which 1 ms to minimize.
[2024-05-21 03:10:38] [INFO ] Deduced a trap composed of 2 places in 176 ms of which 1 ms to minimize.
[2024-05-21 03:10:38] [INFO ] Deduced a trap composed of 2 places in 174 ms of which 1 ms to minimize.
[2024-05-21 03:10:39] [INFO ] Deduced a trap composed of 2 places in 186 ms of which 1 ms to minimize.
[2024-05-21 03:10:39] [INFO ] Deduced a trap composed of 2 places in 181 ms of which 1 ms to minimize.
[2024-05-21 03:10:39] [INFO ] Deduced a trap composed of 2 places in 182 ms of which 1 ms to minimize.
[2024-05-21 03:10:40] [INFO ] Deduced a trap composed of 2 places in 181 ms of which 1 ms to minimize.
[2024-05-21 03:10:40] [INFO ] Deduced a trap composed of 2 places in 186 ms of which 2 ms to minimize.
[2024-05-21 03:10:40] [INFO ] Deduced a trap composed of 2 places in 194 ms of which 1 ms to minimize.
[2024-05-21 03:10:40] [INFO ] Deduced a trap composed of 2 places in 174 ms of which 1 ms to minimize.
[2024-05-21 03:10:41] [INFO ] Deduced a trap composed of 2 places in 172 ms of which 1 ms to minimize.
[2024-05-21 03:10:41] [INFO ] Deduced a trap composed of 2 places in 173 ms of which 1 ms to minimize.
[2024-05-21 03:10:41] [INFO ] Deduced a trap composed of 2 places in 174 ms of which 1 ms to minimize.
[2024-05-21 03:10:41] [INFO ] Deduced a trap composed of 2 places in 174 ms of which 1 ms to minimize.
[2024-05-21 03:10:42] [INFO ] Deduced a trap composed of 2 places in 178 ms of which 1 ms to minimize.
[2024-05-21 03:10:42] [INFO ] Deduced a trap composed of 2 places in 170 ms of which 1 ms to minimize.
[2024-05-21 03:10:42] [INFO ] Deduced a trap composed of 2 places in 172 ms of which 1 ms to minimize.
[2024-05-21 03:10:42] [INFO ] Deduced a trap composed of 2 places in 173 ms of which 1 ms to minimize.
[2024-05-21 03:10:43] [INFO ] Deduced a trap composed of 2 places in 172 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/6720 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 03:10:43] [INFO ] Deduced a trap composed of 2 places in 194 ms of which 2 ms to minimize.
[2024-05-21 03:10:43] [INFO ] Deduced a trap composed of 2 places in 180 ms of which 1 ms to minimize.
[2024-05-21 03:10:44] [INFO ] Deduced a trap composed of 2 places in 180 ms of which 1 ms to minimize.
[2024-05-21 03:10:44] [INFO ] Deduced a trap composed of 2 places in 178 ms of which 1 ms to minimize.
[2024-05-21 03:10:44] [INFO ] Deduced a trap composed of 2 places in 163 ms of which 1 ms to minimize.
[2024-05-21 03:10:44] [INFO ] Deduced a trap composed of 2 places in 165 ms of which 1 ms to minimize.
[2024-05-21 03:10:45] [INFO ] Deduced a trap composed of 2 places in 166 ms of which 1 ms to minimize.
[2024-05-21 03:10:45] [INFO ] Deduced a trap composed of 2 places in 163 ms of which 1 ms to minimize.
[2024-05-21 03:10:45] [INFO ] Deduced a trap composed of 2 places in 181 ms of which 1 ms to minimize.
[2024-05-21 03:10:45] [INFO ] Deduced a trap composed of 2 places in 199 ms of which 1 ms to minimize.
[2024-05-21 03:10:46] [INFO ] Deduced a trap composed of 2 places in 178 ms of which 1 ms to minimize.
[2024-05-21 03:10:46] [INFO ] Deduced a trap composed of 2 places in 161 ms of which 1 ms to minimize.
[2024-05-21 03:10:46] [INFO ] Deduced a trap composed of 2 places in 182 ms of which 1 ms to minimize.
[2024-05-21 03:10:46] [INFO ] Deduced a trap composed of 2 places in 176 ms of which 1 ms to minimize.
[2024-05-21 03:10:47] [INFO ] Deduced a trap composed of 2 places in 186 ms of which 1 ms to minimize.
[2024-05-21 03:10:47] [INFO ] Deduced a trap composed of 2 places in 190 ms of which 1 ms to minimize.
[2024-05-21 03:10:47] [INFO ] Deduced a trap composed of 2 places in 190 ms of which 1 ms to minimize.
[2024-05-21 03:10:47] [INFO ] Deduced a trap composed of 2 places in 201 ms of which 1 ms to minimize.
[2024-05-21 03:10:48] [INFO ] Deduced a trap composed of 2 places in 183 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/6720 variables, 19/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/6720 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 158/6878 variables, 79/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/6878 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/6880 variables, 2/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/6880 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 38878/38880 variables, and 7041 constraints, problems are : Problem set: 0 solved, 1 unsolved in 36832 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 6880/6882 constraints, ReadFeed: 0/31758 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 79/79 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) 6719/6720 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6720 variables, 79/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6720 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 158/6878 variables, 79/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/6878 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/6880 variables, 2/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 03:11:21] [INFO ] Deduced a trap composed of 92 places in 16315 ms of which 48 ms to minimize.
[2024-05-21 03:11:36] [INFO ] Deduced a trap composed of 100 places in 15328 ms of which 43 ms to minimize.
[2024-05-21 03:11:53] [INFO ] Deduced a trap composed of 193 places in 16536 ms of which 48 ms to minimize.
SMT process timed out in 89487ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 6882 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6882/6882 places, 31999/31999 transitions.
Applied a total of 0 rules in 2052 ms. Remains 6882 /6882 variables (removed 0) and now considering 31999/31999 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2054 ms. Remains : 6882/6882 places, 31999/31999 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6882/6882 places, 31999/31999 transitions.
Applied a total of 0 rules in 2025 ms. Remains 6882 /6882 variables (removed 0) and now considering 31999/31999 (removed 0) transitions.
[2024-05-21 03:11:57] [INFO ] Flow matrix only has 31998 transitions (discarded 1 similar events)
[2024-05-21 03:11:57] [INFO ] Invariant cache hit.
[2024-05-21 03:12:14] [INFO ] Implicit Places using invariants in 16617 ms returned []
Implicit Place search using SMT only with invariants took 16636 ms to find 0 implicit places.
Running 31919 sub problems to find dead transitions.
[2024-05-21 03:12:14] [INFO ] Flow matrix only has 31998 transitions (discarded 1 similar events)
[2024-05-21 03:12:14] [INFO ] Invariant cache hit.
[2024-05-21 03:12:14] [INFO ] State equation strengthened by 31758 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6881 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 31919 unsolved
SMT process timed out in 147692ms, After SMT, problems are : Problem set: 0 solved, 31919 unsolved
Search for dead transitions found 0 dead transitions in 147970ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 166706 ms. Remains : 6882/6882 places, 31999/31999 transitions.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 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 83 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 247 reset in 3448 ms.
Product exploration explored 100000 steps with 247 reset in 3434 ms.
Built C files in :
/tmp/ltsmin14727575011094767174
[2024-05-21 03:14:49] [INFO ] Too many transitions (32000) to apply POR reductions. Disabling POR matrices.
[2024-05-21 03:14:49] [INFO ] Built C files in 295ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14727575011094767174
Running compilation step : cd /tmp/ltsmin14727575011094767174;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14727575011094767174;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14727575011094767174;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 1 out of 6883 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6883/6883 places, 32000/32000 transitions.
Applied a total of 0 rules in 1729 ms. Remains 6883 /6883 variables (removed 0) and now considering 32000/32000 (removed 0) transitions.
[2024-05-21 03:14:57] [INFO ] Flow matrix only has 25838 transitions (discarded 6162 similar events)
// Phase 1: matrix 25838 rows 6883 cols
[2024-05-21 03:15:01] [INFO ] Computed 82 invariants in 3963 ms
[2024-05-21 03:15:13] [INFO ] Implicit Places using invariants in 15394 ms returned []
Implicit Place search using SMT only with invariants took 15396 ms to find 0 implicit places.
Running 31920 sub problems to find dead transitions.
[2024-05-21 03:15:13] [INFO ] Flow matrix only has 25838 transitions (discarded 6162 similar events)
[2024-05-21 03:15:13] [INFO ] Invariant cache hit.
[2024-05-21 03:15:13] [INFO ] State equation strengthened by 19118 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6882 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 31920 unsolved
SMT process timed out in 161456ms, After SMT, problems are : Problem set: 0 solved, 31920 unsolved
Search for dead transitions found 0 dead transitions in 161735ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 178896 ms. Remains : 6883/6883 places, 32000/32000 transitions.
Built C files in :
/tmp/ltsmin15859182413277357611
[2024-05-21 03:17:55] [INFO ] Too many transitions (32000) to apply POR reductions. Disabling POR matrices.
[2024-05-21 03:17:55] [INFO ] Built C files in 264ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15859182413277357611
Running compilation step : cd /tmp/ltsmin15859182413277357611;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'

BK_STOP 1716261478131

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CANInsertWithFailure-PT-080"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is CANInsertWithFailure-PT-080, 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 r070-tall-171620505300155"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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