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.r524-tall-171679080200371.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 SafeBus-COL-10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r524-tall-171679080200371
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 8.0K Apr 12 15:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Apr 12 15:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Apr 12 15:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 12 15:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 23 07:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 23 07:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 15:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Apr 12 15:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 12 15:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 12 15:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 42K May 18 16:43 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 SafeBus-COL-10-LTLCardinality-00
FORMULA_NAME SafeBus-COL-10-LTLCardinality-01
FORMULA_NAME SafeBus-COL-10-LTLCardinality-02
FORMULA_NAME SafeBus-COL-10-LTLCardinality-03
FORMULA_NAME SafeBus-COL-10-LTLCardinality-04
FORMULA_NAME SafeBus-COL-10-LTLCardinality-05
FORMULA_NAME SafeBus-COL-10-LTLCardinality-06
FORMULA_NAME SafeBus-COL-10-LTLCardinality-07
FORMULA_NAME SafeBus-COL-10-LTLCardinality-08
FORMULA_NAME SafeBus-COL-10-LTLCardinality-09
FORMULA_NAME SafeBus-COL-10-LTLCardinality-10
FORMULA_NAME SafeBus-COL-10-LTLCardinality-11
FORMULA_NAME SafeBus-COL-10-LTLCardinality-12
FORMULA_NAME SafeBus-COL-10-LTLCardinality-13
FORMULA_NAME SafeBus-COL-10-LTLCardinality-14
FORMULA_NAME SafeBus-COL-10-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717222373162

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SafeBus-COL-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:12:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 06:12:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:12:54] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-06-01 06:12:54] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 06:12:54] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 549 ms
[2024-06-01 06:12:54] [INFO ] Detected 1 constant HL places corresponding to 10 PT places.
[2024-06-01 06:12:55] [INFO ] Imported 20 HL places and 14 HL transitions for a total of 326 PT places and 12821.0 transition bindings in 21 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2024-06-01 06:12:55] [INFO ] Built PT skeleton of HLPN with 20 places and 14 transitions 68 arcs in 4 ms.
[2024-06-01 06:12:55] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 5 formulas.
FORMULA SafeBus-COL-10-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-COL-10-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-COL-10-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-COL-10-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-COL-10-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3 stabilizing places and 0 stable transitions
Remains 11 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40001 steps (8 resets) in 1386 ms. (28 steps per ms) remains 7/19 properties
BEST_FIRST walk for 40003 steps (8 resets) in 228 ms. (174 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 56 ms. (701 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 75 ms. (526 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 122 ms. (325 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 81 ms. (487 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 68 ms. (579 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 7/7 properties
// Phase 1: matrix 14 rows 17 cols
[2024-06-01 06:12:55] [INFO ] Computed 7 invariants in 6 ms
[2024-06-01 06:12:55] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp16 is UNSAT
At refinement iteration 1 (OVERLAPS) 2/7 variables, 2/2 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 4 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
After SMT solving in domain Real declared 11/31 variables, and 5 constraints, problems are : Problem set: 7 solved, 0 unsolved in 267 ms.
Refiners :[Positive P Invariants (semi-flows): 2/4 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/17 constraints, ReadFeed: 0/3 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 318ms problems are : Problem set: 7 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 7 atomic propositions for a total of 11 simplifications.
FORMULA SafeBus-COL-10-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 06:12:56] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2024-06-01 06:12:56] [INFO ] Flatten gal took : 16 ms
FORMULA SafeBus-COL-10-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-COL-10-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 06:12:56] [INFO ] Flatten gal took : 4 ms
Domain [It(10), It(10)] of place AMC breaks symmetries in sort It
[2024-06-01 06:12:56] [INFO ] Unfolded HLPN to a Petri net with 326 places and 1651 transitions 11294 arcs in 86 ms.
[2024-06-01 06:12:56] [INFO ] Unfolded 8 HLPN properties in 1 ms.
Deduced a syphon composed of 10 places in 4 ms
Reduce places removed 20 places and 20 transitions.
Support contains 144 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1631/1631 transitions.
Applied a total of 0 rules in 48 ms. Remains 306 /306 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
[2024-06-01 06:12:56] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
// Phase 1: matrix 642 rows 306 cols
[2024-06-01 06:12:56] [INFO ] Computed 45 invariants in 42 ms
[2024-06-01 06:12:57] [INFO ] Implicit Places using invariants in 686 ms returned []
[2024-06-01 06:12:57] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2024-06-01 06:12:57] [INFO ] Invariant cache hit.
[2024-06-01 06:12:57] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-01 06:12:58] [INFO ] Implicit Places using invariants and state equation in 1304 ms returned []
Implicit Place search using SMT with State Equation took 1997 ms to find 0 implicit places.
Running 1621 sub problems to find dead transitions.
[2024-06-01 06:12:58] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2024-06-01 06:12:58] [INFO ] Invariant cache hit.
[2024-06-01 06:12:58] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1621 unsolved
Problem TDEAD91 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD902 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD935 is UNSAT
Problem TDEAD946 is UNSAT
Problem TDEAD957 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD1002 is UNSAT
Problem TDEAD1013 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1046 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1068 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1090 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
[2024-06-01 06:13:12] [INFO ] Deduced a trap composed of 39 places in 266 ms of which 26 ms to minimize.
[2024-06-01 06:13:13] [INFO ] Deduced a trap composed of 52 places in 333 ms of which 16 ms to minimize.
[2024-06-01 06:13:13] [INFO ] Deduced a trap composed of 58 places in 160 ms of which 2 ms to minimize.
[2024-06-01 06:13:13] [INFO ] Deduced a trap composed of 53 places in 162 ms of which 6 ms to minimize.
[2024-06-01 06:13:13] [INFO ] Deduced a trap composed of 59 places in 203 ms of which 11 ms to minimize.
[2024-06-01 06:13:13] [INFO ] Deduced a trap composed of 58 places in 145 ms of which 3 ms to minimize.
[2024-06-01 06:13:13] [INFO ] Deduced a trap composed of 47 places in 119 ms of which 1 ms to minimize.
[2024-06-01 06:13:14] [INFO ] Deduced a trap composed of 36 places in 120 ms of which 3 ms to minimize.
[2024-06-01 06:13:14] [INFO ] Deduced a trap composed of 40 places in 155 ms of which 2 ms to minimize.
[2024-06-01 06:13:14] [INFO ] Deduced a trap composed of 37 places in 154 ms of which 2 ms to minimize.
[2024-06-01 06:13:23] [INFO ] Deduced a trap composed of 30 places in 237 ms of which 2 ms to minimize.
[2024-06-01 06:13:24] [INFO ] Deduced a trap composed of 34 places in 231 ms of which 2 ms to minimize.
[2024-06-01 06:13:24] [INFO ] Deduced a trap composed of 34 places in 241 ms of which 1 ms to minimize.
[2024-06-01 06:13:24] [INFO ] Deduced a trap composed of 32 places in 238 ms of which 2 ms to minimize.
[2024-06-01 06:13:24] [INFO ] Deduced a trap composed of 34 places in 264 ms of which 2 ms to minimize.
[2024-06-01 06:13:25] [INFO ] Deduced a trap composed of 30 places in 219 ms of which 2 ms to minimize.
[2024-06-01 06:13:25] [INFO ] Deduced a trap composed of 26 places in 228 ms of which 2 ms to minimize.
[2024-06-01 06:13:25] [INFO ] Deduced a trap composed of 30 places in 224 ms of which 2 ms to minimize.
[2024-06-01 06:13:25] [INFO ] Deduced a trap composed of 30 places in 226 ms of which 2 ms to minimize.
[2024-06-01 06:13:26] [INFO ] Deduced a trap composed of 41 places in 235 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/948 variables, and 65 constraints, problems are : Problem set: 100 solved, 1521 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1621/1621 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 100 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
[2024-06-01 06:13:45] [INFO ] Deduced a trap composed of 49 places in 135 ms of which 2 ms to minimize.
[2024-06-01 06:13:45] [INFO ] Deduced a trap composed of 41 places in 131 ms of which 2 ms to minimize.
[2024-06-01 06:13:45] [INFO ] Deduced a trap composed of 49 places in 140 ms of which 2 ms to minimize.
[2024-06-01 06:13:46] [INFO ] Deduced a trap composed of 58 places in 128 ms of which 1 ms to minimize.
[2024-06-01 06:13:46] [INFO ] Deduced a trap composed of 49 places in 137 ms of which 2 ms to minimize.
[2024-06-01 06:13:46] [INFO ] Deduced a trap composed of 49 places in 135 ms of which 2 ms to minimize.
[2024-06-01 06:13:46] [INFO ] Deduced a trap composed of 49 places in 147 ms of which 1 ms to minimize.
[2024-06-01 06:13:46] [INFO ] Deduced a trap composed of 49 places in 212 ms of which 2 ms to minimize.
[2024-06-01 06:13:47] [INFO ] Deduced a trap composed of 41 places in 206 ms of which 3 ms to minimize.
[2024-06-01 06:13:47] [INFO ] Deduced a trap composed of 41 places in 223 ms of which 2 ms to minimize.
[2024-06-01 06:13:50] [INFO ] Deduced a trap composed of 47 places in 234 ms of which 2 ms to minimize.
[2024-06-01 06:13:50] [INFO ] Deduced a trap composed of 45 places in 233 ms of which 2 ms to minimize.
[2024-06-01 06:13:50] [INFO ] Deduced a trap composed of 42 places in 217 ms of which 2 ms to minimize.
[2024-06-01 06:13:50] [INFO ] Deduced a trap composed of 42 places in 232 ms of which 2 ms to minimize.
[2024-06-01 06:13:51] [INFO ] Deduced a trap composed of 48 places in 236 ms of which 5 ms to minimize.
[2024-06-01 06:13:51] [INFO ] Deduced a trap composed of 47 places in 225 ms of which 2 ms to minimize.
[2024-06-01 06:13:51] [INFO ] Deduced a trap composed of 44 places in 229 ms of which 2 ms to minimize.
[2024-06-01 06:13:51] [INFO ] Deduced a trap composed of 46 places in 239 ms of which 2 ms to minimize.
[2024-06-01 06:13:52] [INFO ] Deduced a trap composed of 59 places in 149 ms of which 1 ms to minimize.
[2024-06-01 06:13:52] [INFO ] Deduced a trap composed of 51 places in 160 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 20/85 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
[2024-06-01 06:14:02] [INFO ] Deduced a trap composed of 21 places in 216 ms of which 2 ms to minimize.
[2024-06-01 06:14:02] [INFO ] Deduced a trap composed of 30 places in 208 ms of which 2 ms to minimize.
[2024-06-01 06:14:02] [INFO ] Deduced a trap composed of 30 places in 226 ms of which 2 ms to minimize.
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 Int declared 306/948 variables, and 88 constraints, problems are : Problem set: 100 solved, 1521 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1621 constraints, Known Traps: 43/43 constraints]
After SMT, in 64814ms problems are : Problem set: 100 solved, 1521 unsolved
Search for dead transitions found 100 dead transitions in 64854ms
Found 100 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 100 transitions
Dead transitions reduction (with SMT) removed 100 transitions
Starting structural reductions in LTL mode, iteration 1 : 306/306 places, 1531/1631 transitions.
Applied a total of 0 rules in 8 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 66931 ms. Remains : 306/306 places, 1531/1631 transitions.
Support contains 144 out of 306 places after structural reductions.
[2024-06-01 06:14:03] [INFO ] Flatten gal took : 168 ms
[2024-06-01 06:14:03] [INFO ] Flatten gal took : 145 ms
[2024-06-01 06:14:04] [INFO ] Input system was already deterministic with 1531 transitions.
RANDOM walk for 40000 steps (8 resets) in 1399 ms. (28 steps per ms) remains 3/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 191 ms. (208 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 137 ms. (289 steps per ms) remains 3/3 properties
[2024-06-01 06:14:04] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 06:14:04] [INFO ] Invariant cache hit.
[2024-06-01 06:14:04] [INFO ] State equation strengthened by 111 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp10 is UNSAT
At refinement iteration 1 (OVERLAPS) 155/247 variables, 20/20 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/247 variables, 0/20 constraints. Problems are: Problem set: 2 solved, 1 unsolved
Problem AtomicPropp6 is UNSAT
After SMT solving in domain Real declared 305/948 variables, and 44 constraints, problems are : Problem set: 3 solved, 0 unsolved in 180 ms.
Refiners :[Positive P Invariants (semi-flows): 20/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 228ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 3 atomic propositions for a total of 8 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 110 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 218 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-06-01 06:14:05] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 06:14:05] [INFO ] Invariant cache hit.
[2024-06-01 06:14:05] [INFO ] Implicit Places using invariants in 428 ms returned [231, 232, 233, 234, 235, 236, 237, 238, 239, 240]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 432 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 296/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 379 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1029 ms. Remains : 296/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 268 ms :[(NOT p0)]
Running random walk in product with property : SafeBus-COL-10-LTLCardinality-00
Product exploration explored 100000 steps with 0 reset in 873 ms.
Product exploration explored 100000 steps with 0 reset in 782 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 67 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
RANDOM walk for 82 steps (0 resets) in 6 ms. (11 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
[2024-06-01 06:14:08] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 296 cols
[2024-06-01 06:14:08] [INFO ] Computed 35 invariants in 14 ms
[2024-06-01 06:14:09] [INFO ] [Real]Absence check using 14 positive place invariants in 10 ms returned sat
[2024-06-01 06:14:09] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 28 ms returned sat
[2024-06-01 06:14:09] [INFO ] [Real]Absence check using state equation in 632 ms returned sat
[2024-06-01 06:14:09] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:14:10] [INFO ] [Nat]Absence check using 14 positive place invariants in 13 ms returned sat
[2024-06-01 06:14:10] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 28 ms returned sat
[2024-06-01 06:14:11] [INFO ] [Nat]Absence check using state equation in 371 ms returned sat
[2024-06-01 06:14:11] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-01 06:14:11] [INFO ] [Nat]Added 111 Read/Feed constraints in 98 ms returned sat
[2024-06-01 06:14:11] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 88 ms.
[2024-06-01 06:14:11] [INFO ] Added : 0 causal constraints over 0 iterations in 157 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 110 out of 296 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 296/296 places, 1531/1531 transitions.
Applied a total of 0 rules in 94 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-06-01 06:14:11] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 06:14:11] [INFO ] Invariant cache hit.
[2024-06-01 06:14:11] [INFO ] Implicit Places using invariants in 397 ms returned []
[2024-06-01 06:14:11] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 06:14:11] [INFO ] Invariant cache hit.
[2024-06-01 06:14:12] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-01 06:14:13] [INFO ] Implicit Places using invariants and state equation in 1526 ms returned []
Implicit Place search using SMT with State Equation took 1925 ms to find 0 implicit places.
[2024-06-01 06:14:13] [INFO ] Redundant transitions in 121 ms returned []
Running 1521 sub problems to find dead transitions.
[2024-06-01 06:14:13] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 06:14:13] [INFO ] Invariant cache hit.
[2024-06-01 06:14:13] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-06-01 06:14:25] [INFO ] Deduced a trap composed of 37 places in 202 ms of which 2 ms to minimize.
[2024-06-01 06:14:26] [INFO ] Deduced a trap composed of 53 places in 497 ms of which 1 ms to minimize.
[2024-06-01 06:14:33] [INFO ] Deduced a trap composed of 21 places in 211 ms of which 2 ms to minimize.
[2024-06-01 06:14:33] [INFO ] Deduced a trap composed of 30 places in 208 ms of which 2 ms to minimize.
[2024-06-01 06:14:34] [INFO ] Deduced a trap composed of 30 places in 215 ms of which 2 ms to minimize.
[2024-06-01 06:14:34] [INFO ] Deduced a trap composed of 21 places in 216 ms of which 2 ms to minimize.
[2024-06-01 06:14:34] [INFO ] Deduced a trap composed of 21 places in 212 ms of which 2 ms to minimize.
[2024-06-01 06:14:35] [INFO ] Deduced a trap composed of 41 places in 201 ms of which 2 ms to minimize.
[2024-06-01 06:14:35] [INFO ] Deduced a trap composed of 49 places in 196 ms of which 2 ms to minimize.
[2024-06-01 06:14:35] [INFO ] Deduced a trap composed of 49 places in 192 ms of which 2 ms to minimize.
[2024-06-01 06:14:36] [INFO ] Deduced a trap composed of 65 places in 203 ms of which 2 ms to minimize.
[2024-06-01 06:14:36] [INFO ] Deduced a trap composed of 49 places in 187 ms of which 2 ms to minimize.
[2024-06-01 06:14:38] [INFO ] Deduced a trap composed of 36 places in 212 ms of which 5 ms to minimize.
[2024-06-01 06:14:39] [INFO ] Deduced a trap composed of 35 places in 214 ms of which 2 ms to minimize.
[2024-06-01 06:14:39] [INFO ] Deduced a trap composed of 34 places in 208 ms of which 2 ms to minimize.
[2024-06-01 06:14:39] [INFO ] Deduced a trap composed of 37 places in 212 ms of which 2 ms to minimize.
[2024-06-01 06:14:39] [INFO ] Deduced a trap composed of 37 places in 211 ms of which 2 ms to minimize.
[2024-06-01 06:14:40] [INFO ] Deduced a trap composed of 59 places in 162 ms of which 1 ms to minimize.
[2024-06-01 06:14:40] [INFO ] Deduced a trap composed of 59 places in 138 ms of which 2 ms to minimize.
[2024-06-01 06:14:40] [INFO ] Deduced a trap composed of 51 places in 127 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 296/938 variables, and 55 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/296 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-06-01 06:14:48] [INFO ] Deduced a trap composed of 32 places in 202 ms of which 2 ms to minimize.
[2024-06-01 06:14:48] [INFO ] Deduced a trap composed of 34 places in 203 ms of which 2 ms to minimize.
[2024-06-01 06:14:48] [INFO ] Deduced a trap composed of 38 places in 142 ms of which 2 ms to minimize.
[2024-06-01 06:14:57] [INFO ] Deduced a trap composed of 31 places in 196 ms of which 1 ms to minimize.
[2024-06-01 06:14:57] [INFO ] Deduced a trap composed of 21 places in 221 ms of which 2 ms to minimize.
[2024-06-01 06:14:57] [INFO ] Deduced a trap composed of 30 places in 213 ms of which 2 ms to minimize.
[2024-06-01 06:14:58] [INFO ] Deduced a trap composed of 49 places in 133 ms of which 2 ms to minimize.
[2024-06-01 06:14:59] [INFO ] Deduced a trap composed of 49 places in 190 ms of which 2 ms to minimize.
[2024-06-01 06:14:59] [INFO ] Deduced a trap composed of 49 places in 131 ms of which 2 ms to minimize.
[2024-06-01 06:14:59] [INFO ] Deduced a trap composed of 41 places in 193 ms of which 2 ms to minimize.
[2024-06-01 06:15:02] [INFO ] Deduced a trap composed of 49 places in 126 ms of which 2 ms to minimize.
[2024-06-01 06:15:02] [INFO ] Deduced a trap composed of 49 places in 107 ms of which 1 ms to minimize.
[2024-06-01 06:15:02] [INFO ] Deduced a trap composed of 46 places in 102 ms of which 2 ms to minimize.
[2024-06-01 06:15:02] [INFO ] Deduced a trap composed of 45 places in 108 ms of which 1 ms to minimize.
[2024-06-01 06:15:02] [INFO ] Deduced a trap composed of 38 places in 93 ms of which 1 ms to minimize.
[2024-06-01 06:15:02] [INFO ] Deduced a trap composed of 40 places in 89 ms of which 1 ms to minimize.
[2024-06-01 06:15:02] [INFO ] Deduced a trap composed of 59 places in 108 ms of which 1 ms to minimize.
[2024-06-01 06:15:02] [INFO ] Deduced a trap composed of 56 places in 98 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 18/73 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-06-01 06:15:12] [INFO ] Deduced a trap composed of 21 places in 204 ms of which 2 ms to minimize.
[2024-06-01 06:15:13] [INFO ] Deduced a trap composed of 49 places in 196 ms of which 2 ms to minimize.
[2024-06-01 06:15:14] [INFO ] Deduced a trap composed of 41 places in 207 ms of which 2 ms to minimize.
[2024-06-01 06:15:14] [INFO ] Deduced a trap composed of 65 places in 179 ms of which 1 ms to minimize.
[2024-06-01 06:15:14] [INFO ] Deduced a trap composed of 41 places in 184 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 296/938 variables, and 78 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/296 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 43/43 constraints]
After SMT, in 63312ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 63328ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 65478 ms. Remains : 296/296 places, 1531/1531 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
RANDOM walk for 78 steps (0 resets) in 5 ms. (13 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
[2024-06-01 06:15:17] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 06:15:17] [INFO ] Invariant cache hit.
[2024-06-01 06:15:18] [INFO ] [Real]Absence check using 14 positive place invariants in 8 ms returned sat
[2024-06-01 06:15:18] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 78 ms returned sat
[2024-06-01 06:15:18] [INFO ] [Real]Absence check using state equation in 489 ms returned sat
[2024-06-01 06:15:18] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:15:19] [INFO ] [Nat]Absence check using 14 positive place invariants in 9 ms returned sat
[2024-06-01 06:15:19] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 42 ms returned sat
[2024-06-01 06:15:19] [INFO ] [Nat]Absence check using state equation in 362 ms returned sat
[2024-06-01 06:15:19] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-01 06:15:19] [INFO ] [Nat]Added 111 Read/Feed constraints in 105 ms returned sat
[2024-06-01 06:15:19] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 60 ms.
[2024-06-01 06:15:20] [INFO ] Added : 1 causal constraints over 1 iterations in 169 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 744 ms.
Product exploration explored 100000 steps with 0 reset in 742 ms.
Support contains 110 out of 296 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 296/296 places, 1531/1531 transitions.
Applied a total of 0 rules in 85 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-06-01 06:15:21] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 06:15:21] [INFO ] Invariant cache hit.
[2024-06-01 06:15:22] [INFO ] Implicit Places using invariants in 436 ms returned []
[2024-06-01 06:15:22] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 06:15:22] [INFO ] Invariant cache hit.
[2024-06-01 06:15:22] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-01 06:15:23] [INFO ] Implicit Places using invariants and state equation in 1487 ms returned []
Implicit Place search using SMT with State Equation took 1924 ms to find 0 implicit places.
[2024-06-01 06:15:23] [INFO ] Redundant transitions in 52 ms returned []
Running 1521 sub problems to find dead transitions.
[2024-06-01 06:15:23] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 06:15:23] [INFO ] Invariant cache hit.
[2024-06-01 06:15:23] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-06-01 06:15:35] [INFO ] Deduced a trap composed of 37 places in 198 ms of which 2 ms to minimize.
[2024-06-01 06:15:36] [INFO ] Deduced a trap composed of 53 places in 107 ms of which 2 ms to minimize.
[2024-06-01 06:15:43] [INFO ] Deduced a trap composed of 21 places in 219 ms of which 2 ms to minimize.
[2024-06-01 06:15:44] [INFO ] Deduced a trap composed of 30 places in 208 ms of which 2 ms to minimize.
[2024-06-01 06:15:44] [INFO ] Deduced a trap composed of 30 places in 206 ms of which 2 ms to minimize.
[2024-06-01 06:15:44] [INFO ] Deduced a trap composed of 21 places in 207 ms of which 1 ms to minimize.
[2024-06-01 06:15:44] [INFO ] Deduced a trap composed of 21 places in 216 ms of which 2 ms to minimize.
[2024-06-01 06:15:45] [INFO ] Deduced a trap composed of 41 places in 190 ms of which 2 ms to minimize.
[2024-06-01 06:15:46] [INFO ] Deduced a trap composed of 49 places in 205 ms of which 2 ms to minimize.
[2024-06-01 06:15:46] [INFO ] Deduced a trap composed of 49 places in 193 ms of which 2 ms to minimize.
[2024-06-01 06:15:46] [INFO ] Deduced a trap composed of 65 places in 189 ms of which 2 ms to minimize.
[2024-06-01 06:15:46] [INFO ] Deduced a trap composed of 49 places in 195 ms of which 2 ms to minimize.
[2024-06-01 06:15:49] [INFO ] Deduced a trap composed of 36 places in 218 ms of which 2 ms to minimize.
[2024-06-01 06:15:49] [INFO ] Deduced a trap composed of 35 places in 205 ms of which 2 ms to minimize.
[2024-06-01 06:15:49] [INFO ] Deduced a trap composed of 34 places in 197 ms of which 1 ms to minimize.
[2024-06-01 06:15:49] [INFO ] Deduced a trap composed of 37 places in 208 ms of which 2 ms to minimize.
[2024-06-01 06:15:50] [INFO ] Deduced a trap composed of 37 places in 208 ms of which 2 ms to minimize.
[2024-06-01 06:15:50] [INFO ] Deduced a trap composed of 59 places in 138 ms of which 2 ms to minimize.
[2024-06-01 06:15:50] [INFO ] Deduced a trap composed of 59 places in 137 ms of which 2 ms to minimize.
[2024-06-01 06:15:50] [INFO ] Deduced a trap composed of 51 places in 138 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 1521 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 296/938 variables, and 55 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/296 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-06-01 06:15:58] [INFO ] Deduced a trap composed of 32 places in 203 ms of which 2 ms to minimize.
[2024-06-01 06:15:59] [INFO ] Deduced a trap composed of 34 places in 199 ms of which 2 ms to minimize.
[2024-06-01 06:15:59] [INFO ] Deduced a trap composed of 38 places in 133 ms of which 2 ms to minimize.
[2024-06-01 06:16:07] [INFO ] Deduced a trap composed of 31 places in 216 ms of which 2 ms to minimize.
[2024-06-01 06:16:07] [INFO ] Deduced a trap composed of 21 places in 211 ms of which 2 ms to minimize.
[2024-06-01 06:16:08] [INFO ] Deduced a trap composed of 30 places in 206 ms of which 2 ms to minimize.
[2024-06-01 06:16:09] [INFO ] Deduced a trap composed of 49 places in 142 ms of which 2 ms to minimize.
[2024-06-01 06:16:09] [INFO ] Deduced a trap composed of 49 places in 187 ms of which 1 ms to minimize.
[2024-06-01 06:16:09] [INFO ] Deduced a trap composed of 49 places in 136 ms of which 1 ms to minimize.
[2024-06-01 06:16:09] [INFO ] Deduced a trap composed of 41 places in 189 ms of which 2 ms to minimize.
[2024-06-01 06:16:12] [INFO ] Deduced a trap composed of 49 places in 135 ms of which 1 ms to minimize.
[2024-06-01 06:16:12] [INFO ] Deduced a trap composed of 49 places in 100 ms of which 1 ms to minimize.
[2024-06-01 06:16:12] [INFO ] Deduced a trap composed of 46 places in 108 ms of which 2 ms to minimize.
[2024-06-01 06:16:12] [INFO ] Deduced a trap composed of 45 places in 100 ms of which 1 ms to minimize.
[2024-06-01 06:16:12] [INFO ] Deduced a trap composed of 38 places in 93 ms of which 1 ms to minimize.
[2024-06-01 06:16:13] [INFO ] Deduced a trap composed of 40 places in 92 ms of which 1 ms to minimize.
[2024-06-01 06:16:13] [INFO ] Deduced a trap composed of 59 places in 110 ms of which 1 ms to minimize.
[2024-06-01 06:16:13] [INFO ] Deduced a trap composed of 56 places in 96 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 18/73 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-06-01 06:16:23] [INFO ] Deduced a trap composed of 21 places in 211 ms of which 2 ms to minimize.
[2024-06-01 06:16:24] [INFO ] Deduced a trap composed of 49 places in 202 ms of which 1 ms to minimize.
[2024-06-01 06:16:24] [INFO ] Deduced a trap composed of 41 places in 200 ms of which 2 ms to minimize.
[2024-06-01 06:16:24] [INFO ] Deduced a trap composed of 65 places in 198 ms of which 2 ms to minimize.
[2024-06-01 06:16:24] [INFO ] Deduced a trap composed of 41 places in 211 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 296/938 variables, and 78 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/296 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 43/43 constraints]
After SMT, in 63770ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 63784ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 65854 ms. Remains : 296/296 places, 1531/1531 transitions.
Treatment of property SafeBus-COL-10-LTLCardinality-00 finished in 142578 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 7 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-06-01 06:16:27] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 306 cols
[2024-06-01 06:16:27] [INFO ] Computed 45 invariants in 11 ms
[2024-06-01 06:16:28] [INFO ] Implicit Places using invariants in 396 ms returned [231, 232, 233, 234, 235, 236, 237, 238, 239, 240]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 402 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 296/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 11 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 420 ms. Remains : 296/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 131 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SafeBus-COL-10-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA SafeBus-COL-10-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SafeBus-COL-10-LTLCardinality-02 finished in 577 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 11 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 99 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-06-01 06:16:28] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 06:16:28] [INFO ] Invariant cache hit.
[2024-06-01 06:16:28] [INFO ] Implicit Places using invariants in 388 ms returned [231, 232, 233, 234, 235, 236, 237, 238, 239, 240]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 390 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 296/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 94 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 584 ms. Remains : 296/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SafeBus-COL-10-LTLCardinality-03
Product exploration explored 100000 steps with 5888 reset in 382 ms.
Product exploration explored 100000 steps with 2621 reset in 453 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 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 73 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 56 steps (0 resets) in 5 ms. (9 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 111 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 82 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (NOT p0)]
[2024-06-01 06:16:30] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 296 cols
[2024-06-01 06:16:30] [INFO ] Computed 35 invariants in 13 ms
[2024-06-01 06:16:30] [INFO ] [Real]Absence check using 14 positive place invariants in 11 ms returned sat
[2024-06-01 06:16:30] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 39 ms returned sat
[2024-06-01 06:16:31] [INFO ] [Real]Absence check using state equation in 530 ms returned sat
[2024-06-01 06:16:31] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:16:31] [INFO ] [Nat]Absence check using 14 positive place invariants in 9 ms returned sat
[2024-06-01 06:16:31] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 21 ms returned sat
[2024-06-01 06:16:32] [INFO ] [Nat]Absence check using state equation in 270 ms returned sat
[2024-06-01 06:16:32] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-01 06:16:32] [INFO ] [Nat]Added 111 Read/Feed constraints in 720 ms returned sat
[2024-06-01 06:16:33] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 50 ms.
[2024-06-01 06:16:33] [INFO ] Added : 1 causal constraints over 1 iterations in 141 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 11 out of 296 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 296/296 places, 1531/1531 transitions.
Applied a total of 0 rules in 159 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-06-01 06:16:33] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 06:16:33] [INFO ] Invariant cache hit.
[2024-06-01 06:16:33] [INFO ] Implicit Places using invariants in 363 ms returned []
[2024-06-01 06:16:33] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 06:16:33] [INFO ] Invariant cache hit.
[2024-06-01 06:16:33] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-01 06:16:35] [INFO ] Implicit Places using invariants and state equation in 1632 ms returned []
Implicit Place search using SMT with State Equation took 1996 ms to find 0 implicit places.
[2024-06-01 06:16:35] [INFO ] Redundant transitions in 28 ms returned []
Running 1521 sub problems to find dead transitions.
[2024-06-01 06:16:35] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 06:16:35] [INFO ] Invariant cache hit.
[2024-06-01 06:16:35] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-06-01 06:16:47] [INFO ] Deduced a trap composed of 37 places in 196 ms of which 2 ms to minimize.
[2024-06-01 06:16:49] [INFO ] Deduced a trap composed of 53 places in 95 ms of which 2 ms to minimize.
[2024-06-01 06:16:56] [INFO ] Deduced a trap composed of 21 places in 230 ms of which 3 ms to minimize.
[2024-06-01 06:16:56] [INFO ] Deduced a trap composed of 30 places in 217 ms of which 2 ms to minimize.
[2024-06-01 06:16:56] [INFO ] Deduced a trap composed of 30 places in 218 ms of which 2 ms to minimize.
[2024-06-01 06:16:56] [INFO ] Deduced a trap composed of 21 places in 214 ms of which 2 ms to minimize.
[2024-06-01 06:16:57] [INFO ] Deduced a trap composed of 21 places in 220 ms of which 1 ms to minimize.
[2024-06-01 06:16:58] [INFO ] Deduced a trap composed of 41 places in 208 ms of which 2 ms to minimize.
[2024-06-01 06:16:58] [INFO ] Deduced a trap composed of 49 places in 219 ms of which 2 ms to minimize.
[2024-06-01 06:16:58] [INFO ] Deduced a trap composed of 49 places in 214 ms of which 2 ms to minimize.
[2024-06-01 06:16:58] [INFO ] Deduced a trap composed of 65 places in 196 ms of which 1 ms to minimize.
[2024-06-01 06:16:58] [INFO ] Deduced a trap composed of 49 places in 207 ms of which 2 ms to minimize.
[2024-06-01 06:17:01] [INFO ] Deduced a trap composed of 36 places in 220 ms of which 2 ms to minimize.
[2024-06-01 06:17:01] [INFO ] Deduced a trap composed of 35 places in 215 ms of which 3 ms to minimize.
[2024-06-01 06:17:02] [INFO ] Deduced a trap composed of 34 places in 221 ms of which 2 ms to minimize.
[2024-06-01 06:17:02] [INFO ] Deduced a trap composed of 37 places in 205 ms of which 2 ms to minimize.
[2024-06-01 06:17:02] [INFO ] Deduced a trap composed of 37 places in 209 ms of which 2 ms to minimize.
[2024-06-01 06:17:02] [INFO ] Deduced a trap composed of 59 places in 133 ms of which 2 ms to minimize.
[2024-06-01 06:17:03] [INFO ] Deduced a trap composed of 59 places in 127 ms of which 2 ms to minimize.
[2024-06-01 06:17:03] [INFO ] Deduced a trap composed of 51 places in 144 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 296/938 variables, and 55 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/296 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-06-01 06:17:10] [INFO ] Deduced a trap composed of 32 places in 220 ms of which 1 ms to minimize.
[2024-06-01 06:17:10] [INFO ] Deduced a trap composed of 34 places in 215 ms of which 2 ms to minimize.
[2024-06-01 06:17:10] [INFO ] Deduced a trap composed of 38 places in 147 ms of which 2 ms to minimize.
[2024-06-01 06:17:19] [INFO ] Deduced a trap composed of 31 places in 206 ms of which 2 ms to minimize.
[2024-06-01 06:17:19] [INFO ] Deduced a trap composed of 21 places in 207 ms of which 1 ms to minimize.
[2024-06-01 06:17:19] [INFO ] Deduced a trap composed of 30 places in 198 ms of which 1 ms to minimize.
[2024-06-01 06:17:20] [INFO ] Deduced a trap composed of 49 places in 135 ms of which 2 ms to minimize.
[2024-06-01 06:17:20] [INFO ] Deduced a trap composed of 49 places in 192 ms of which 2 ms to minimize.
[2024-06-01 06:17:21] [INFO ] Deduced a trap composed of 49 places in 136 ms of which 2 ms to minimize.
[2024-06-01 06:17:21] [INFO ] Deduced a trap composed of 41 places in 213 ms of which 2 ms to minimize.
[2024-06-01 06:17:24] [INFO ] Deduced a trap composed of 49 places in 129 ms of which 1 ms to minimize.
[2024-06-01 06:17:24] [INFO ] Deduced a trap composed of 49 places in 100 ms of which 1 ms to minimize.
[2024-06-01 06:17:24] [INFO ] Deduced a trap composed of 46 places in 105 ms of which 1 ms to minimize.
[2024-06-01 06:17:24] [INFO ] Deduced a trap composed of 45 places in 101 ms of which 2 ms to minimize.
[2024-06-01 06:17:24] [INFO ] Deduced a trap composed of 38 places in 89 ms of which 1 ms to minimize.
[2024-06-01 06:17:24] [INFO ] Deduced a trap composed of 40 places in 94 ms of which 1 ms to minimize.
[2024-06-01 06:17:24] [INFO ] Deduced a trap composed of 59 places in 109 ms of which 1 ms to minimize.
[2024-06-01 06:17:24] [INFO ] Deduced a trap composed of 56 places in 100 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 18/73 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-06-01 06:17:34] [INFO ] Deduced a trap composed of 21 places in 211 ms of which 2 ms to minimize.
[2024-06-01 06:17:36] [INFO ] Deduced a trap composed of 49 places in 196 ms of which 2 ms to minimize.
[2024-06-01 06:17:36] [INFO ] Deduced a trap composed of 41 places in 208 ms of which 2 ms to minimize.
[2024-06-01 06:17:36] [INFO ] Deduced a trap composed of 65 places in 195 ms of which 2 ms to minimize.
[2024-06-01 06:17:36] [INFO ] Deduced a trap composed of 41 places in 197 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 296/938 variables, and 78 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/296 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 43/43 constraints]
After SMT, in 63507ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 63520ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 65719 ms. Remains : 296/296 places, 1531/1531 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 67 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 70 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 46 steps (0 resets) in 8 ms. (5 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
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 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
[2024-06-01 06:17:39] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 06:17:39] [INFO ] Invariant cache hit.
[2024-06-01 06:17:39] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2024-06-01 06:17:39] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 34 ms returned sat
[2024-06-01 06:17:40] [INFO ] [Real]Absence check using state equation in 530 ms returned sat
[2024-06-01 06:17:40] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:17:40] [INFO ] [Nat]Absence check using 14 positive place invariants in 7 ms returned sat
[2024-06-01 06:17:41] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 49 ms returned sat
[2024-06-01 06:17:41] [INFO ] [Nat]Absence check using state equation in 319 ms returned sat
[2024-06-01 06:17:41] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-01 06:17:41] [INFO ] [Nat]Added 111 Read/Feed constraints in 88 ms returned sat
[2024-06-01 06:17:41] [INFO ] Deduced a trap composed of 50 places in 79 ms of which 1 ms to minimize.
[2024-06-01 06:17:41] [INFO ] Deduced a trap composed of 42 places in 85 ms of which 1 ms to minimize.
[2024-06-01 06:17:41] [INFO ] Deduced a trap composed of 42 places in 84 ms of which 1 ms to minimize.
[2024-06-01 06:17:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 347 ms
[2024-06-01 06:17:41] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 55 ms.
[2024-06-01 06:17:41] [INFO ] Added : 0 causal constraints over 0 iterations in 131 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 6453 reset in 333 ms.
Product exploration explored 100000 steps with 1005 reset in 568 ms.
Support contains 11 out of 296 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 296/296 places, 1531/1531 transitions.
Applied a total of 0 rules in 85 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-06-01 06:17:42] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 06:17:42] [INFO ] Invariant cache hit.
[2024-06-01 06:17:43] [INFO ] Implicit Places using invariants in 357 ms returned []
[2024-06-01 06:17:43] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 06:17:43] [INFO ] Invariant cache hit.
[2024-06-01 06:17:43] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-01 06:17:44] [INFO ] Implicit Places using invariants and state equation in 1631 ms returned []
Implicit Place search using SMT with State Equation took 1991 ms to find 0 implicit places.
[2024-06-01 06:17:45] [INFO ] Redundant transitions in 25 ms returned []
Running 1521 sub problems to find dead transitions.
[2024-06-01 06:17:45] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 06:17:45] [INFO ] Invariant cache hit.
[2024-06-01 06:17:45] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-06-01 06:17:57] [INFO ] Deduced a trap composed of 37 places in 202 ms of which 2 ms to minimize.
[2024-06-01 06:17:58] [INFO ] Deduced a trap composed of 53 places in 115 ms of which 1 ms to minimize.
[2024-06-01 06:18:05] [INFO ] Deduced a trap composed of 21 places in 225 ms of which 2 ms to minimize.
[2024-06-01 06:18:06] [INFO ] Deduced a trap composed of 30 places in 217 ms of which 2 ms to minimize.
[2024-06-01 06:18:06] [INFO ] Deduced a trap composed of 30 places in 224 ms of which 2 ms to minimize.
[2024-06-01 06:18:06] [INFO ] Deduced a trap composed of 21 places in 232 ms of which 2 ms to minimize.
[2024-06-01 06:18:06] [INFO ] Deduced a trap composed of 21 places in 216 ms of which 2 ms to minimize.
[2024-06-01 06:18:07] [INFO ] Deduced a trap composed of 41 places in 192 ms of which 2 ms to minimize.
[2024-06-01 06:18:08] [INFO ] Deduced a trap composed of 49 places in 190 ms of which 2 ms to minimize.
[2024-06-01 06:18:08] [INFO ] Deduced a trap composed of 49 places in 192 ms of which 1 ms to minimize.
[2024-06-01 06:18:08] [INFO ] Deduced a trap composed of 65 places in 188 ms of which 2 ms to minimize.
[2024-06-01 06:18:08] [INFO ] Deduced a trap composed of 49 places in 204 ms of which 2 ms to minimize.
[2024-06-01 06:18:11] [INFO ] Deduced a trap composed of 36 places in 215 ms of which 2 ms to minimize.
[2024-06-01 06:18:11] [INFO ] Deduced a trap composed of 35 places in 215 ms of which 2 ms to minimize.
[2024-06-01 06:18:12] [INFO ] Deduced a trap composed of 34 places in 193 ms of which 2 ms to minimize.
[2024-06-01 06:18:12] [INFO ] Deduced a trap composed of 37 places in 223 ms of which 2 ms to minimize.
[2024-06-01 06:18:12] [INFO ] Deduced a trap composed of 37 places in 197 ms of which 2 ms to minimize.
[2024-06-01 06:18:12] [INFO ] Deduced a trap composed of 59 places in 139 ms of which 1 ms to minimize.
[2024-06-01 06:18:12] [INFO ] Deduced a trap composed of 59 places in 137 ms of which 2 ms to minimize.
[2024-06-01 06:18:13] [INFO ] Deduced a trap composed of 51 places in 141 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 296/938 variables, and 55 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/296 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-06-01 06:18:20] [INFO ] Deduced a trap composed of 32 places in 202 ms of which 2 ms to minimize.
[2024-06-01 06:18:20] [INFO ] Deduced a trap composed of 34 places in 204 ms of which 2 ms to minimize.
[2024-06-01 06:18:20] [INFO ] Deduced a trap composed of 38 places in 134 ms of which 2 ms to minimize.
[2024-06-01 06:18:29] [INFO ] Deduced a trap composed of 31 places in 215 ms of which 2 ms to minimize.
[2024-06-01 06:18:29] [INFO ] Deduced a trap composed of 21 places in 207 ms of which 2 ms to minimize.
[2024-06-01 06:18:29] [INFO ] Deduced a trap composed of 30 places in 228 ms of which 2 ms to minimize.
[2024-06-01 06:18:31] [INFO ] Deduced a trap composed of 49 places in 143 ms of which 2 ms to minimize.
[2024-06-01 06:18:31] [INFO ] Deduced a trap composed of 49 places in 205 ms of which 2 ms to minimize.
[2024-06-01 06:18:31] [INFO ] Deduced a trap composed of 49 places in 132 ms of which 1 ms to minimize.
[2024-06-01 06:18:31] [INFO ] Deduced a trap composed of 41 places in 209 ms of which 3 ms to minimize.
[2024-06-01 06:18:34] [INFO ] Deduced a trap composed of 49 places in 127 ms of which 1 ms to minimize.
[2024-06-01 06:18:34] [INFO ] Deduced a trap composed of 49 places in 105 ms of which 1 ms to minimize.
[2024-06-01 06:18:34] [INFO ] Deduced a trap composed of 46 places in 110 ms of which 2 ms to minimize.
[2024-06-01 06:18:34] [INFO ] Deduced a trap composed of 45 places in 109 ms of which 1 ms to minimize.
[2024-06-01 06:18:34] [INFO ] Deduced a trap composed of 38 places in 92 ms of which 2 ms to minimize.
[2024-06-01 06:18:35] [INFO ] Deduced a trap composed of 40 places in 94 ms of which 2 ms to minimize.
[2024-06-01 06:18:35] [INFO ] Deduced a trap composed of 59 places in 121 ms of which 2 ms to minimize.
[2024-06-01 06:18:35] [INFO ] Deduced a trap composed of 56 places in 96 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 18/73 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-06-01 06:18:44] [INFO ] Deduced a trap composed of 21 places in 185 ms of which 2 ms to minimize.
[2024-06-01 06:18:45] [INFO ] Deduced a trap composed of 49 places in 195 ms of which 2 ms to minimize.
[2024-06-01 06:18:46] [INFO ] Deduced a trap composed of 41 places in 183 ms of which 2 ms to minimize.
[2024-06-01 06:18:46] [INFO ] Deduced a trap composed of 65 places in 183 ms of which 1 ms to minimize.
[2024-06-01 06:18:46] [INFO ] Deduced a trap composed of 41 places in 193 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 296/938 variables, and 78 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/296 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 43/43 constraints]
After SMT, in 63729ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 63746ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 65861 ms. Remains : 296/296 places, 1531/1531 transitions.
Treatment of property SafeBus-COL-10-LTLCardinality-03 finished in 140612 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 11 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 5 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-06-01 06:18:48] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 306 cols
[2024-06-01 06:18:48] [INFO ] Computed 45 invariants in 5 ms
[2024-06-01 06:18:49] [INFO ] Implicit Places using invariants in 412 ms returned [231, 232, 233, 234, 235, 236, 237, 238, 239, 240]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 415 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 296/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 4 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 425 ms. Remains : 296/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SafeBus-COL-10-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA SafeBus-COL-10-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SafeBus-COL-10-LTLCardinality-04 finished in 528 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 88 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-06-01 06:18:49] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 06:18:49] [INFO ] Invariant cache hit.
[2024-06-01 06:18:49] [INFO ] Implicit Places using invariants in 422 ms returned [231, 232, 233, 234, 235, 236, 237, 238, 239, 240]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 425 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 296/306 places, 1531/1531 transitions.
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 0 place count 296 transition count 1521
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 286 transition count 1521
Applied a total of 20 rules in 97 ms. Remains 286 /296 variables (removed 10) and now considering 1521/1531 (removed 10) transitions.
[2024-06-01 06:18:49] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
// Phase 1: matrix 632 rows 286 cols
[2024-06-01 06:18:49] [INFO ] Computed 35 invariants in 12 ms
[2024-06-01 06:18:50] [INFO ] Implicit Places using invariants in 377 ms returned []
[2024-06-01 06:18:50] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2024-06-01 06:18:50] [INFO ] Invariant cache hit.
[2024-06-01 06:18:50] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-01 06:18:52] [INFO ] Implicit Places using invariants and state equation in 1669 ms returned []
Implicit Place search using SMT with State Equation took 2048 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 286/306 places, 1521/1531 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2660 ms. Remains : 286/306 places, 1521/1531 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : SafeBus-COL-10-LTLCardinality-07
Product exploration explored 100000 steps with 0 reset in 524 ms.
Stack based approach found an accepted trace after 223 steps with 0 reset with depth 224 and stack size 224 in 2 ms.
FORMULA SafeBus-COL-10-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property SafeBus-COL-10-LTLCardinality-07 finished in 3231 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0 U (G(p0)||(p0&&(G(p1)||(p1&&F(!p2)))))))))'
Support contains 110 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 5 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-06-01 06:18:52] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 306 cols
[2024-06-01 06:18:52] [INFO ] Computed 45 invariants in 4 ms
[2024-06-01 06:18:53] [INFO ] Implicit Places using invariants in 392 ms returned [231, 232, 233, 234, 235, 236, 237, 238, 239, 240]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 395 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 296/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 5 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 405 ms. Remains : 296/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 181 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0) p2), (AND (NOT p0) p2)]
Running random walk in product with property : SafeBus-COL-10-LTLCardinality-10
Product exploration explored 100000 steps with 50000 reset in 447 ms.
Product exploration explored 100000 steps with 50000 reset in 408 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (NOT p2)), (X (NOT (AND p1 p2 p0))), (X p0), (X (NOT (AND (NOT p1) p0))), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 14 factoid took 148 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SafeBus-COL-10-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SafeBus-COL-10-LTLCardinality-10 finished in 1621 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||G(!p1)))))'
Support contains 20 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 122 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-06-01 06:18:54] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 06:18:54] [INFO ] Invariant cache hit.
[2024-06-01 06:18:54] [INFO ] Implicit Places using invariants in 420 ms returned [231, 232, 233, 234, 235, 236, 237, 238, 239, 240]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 424 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 296/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 120 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 667 ms. Remains : 296/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 75 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : SafeBus-COL-10-LTLCardinality-13
Product exploration explored 100000 steps with 5224 reset in 380 ms.
Product exploration explored 100000 steps with 5207 reset in 392 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 96 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
RANDOM walk for 62 steps (0 resets) in 4 ms. (12 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT (AND (NOT p0) p1))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 9 factoid took 216 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
[2024-06-01 06:18:56] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 296 cols
[2024-06-01 06:18:56] [INFO ] Computed 35 invariants in 8 ms
[2024-06-01 06:18:56] [INFO ] [Real]Absence check using 14 positive place invariants in 12 ms returned sat
[2024-06-01 06:18:56] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 37 ms returned sat
[2024-06-01 06:18:57] [INFO ] [Real]Absence check using state equation in 506 ms returned sat
[2024-06-01 06:18:57] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:18:57] [INFO ] [Nat]Absence check using 14 positive place invariants in 11 ms returned sat
[2024-06-01 06:18:57] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 172 ms returned sat
[2024-06-01 06:18:58] [INFO ] [Nat]Absence check using state equation in 280 ms returned sat
[2024-06-01 06:18:58] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-01 06:18:58] [INFO ] [Nat]Added 111 Read/Feed constraints in 167 ms returned sat
[2024-06-01 06:18:58] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 50 ms.
[2024-06-01 06:18:58] [INFO ] Added : 1 causal constraints over 1 iterations in 148 ms. Result :sat
Could not prove EG (AND (NOT p0) p1)
Support contains 20 out of 296 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 296/296 places, 1531/1531 transitions.
Applied a total of 0 rules in 116 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-06-01 06:18:58] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 06:18:58] [INFO ] Invariant cache hit.
[2024-06-01 06:18:59] [INFO ] Implicit Places using invariants in 377 ms returned []
[2024-06-01 06:18:59] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 06:18:59] [INFO ] Invariant cache hit.
[2024-06-01 06:18:59] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-01 06:19:00] [INFO ] Implicit Places using invariants and state equation in 1631 ms returned []
Implicit Place search using SMT with State Equation took 2010 ms to find 0 implicit places.
[2024-06-01 06:19:00] [INFO ] Redundant transitions in 19 ms returned []
Running 1521 sub problems to find dead transitions.
[2024-06-01 06:19:00] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 06:19:00] [INFO ] Invariant cache hit.
[2024-06-01 06:19:00] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-06-01 06:19:12] [INFO ] Deduced a trap composed of 37 places in 209 ms of which 2 ms to minimize.
[2024-06-01 06:19:13] [INFO ] Deduced a trap composed of 53 places in 99 ms of which 1 ms to minimize.
[2024-06-01 06:19:20] [INFO ] Deduced a trap composed of 21 places in 209 ms of which 2 ms to minimize.
[2024-06-01 06:19:21] [INFO ] Deduced a trap composed of 30 places in 244 ms of which 2 ms to minimize.
[2024-06-01 06:19:21] [INFO ] Deduced a trap composed of 30 places in 218 ms of which 1 ms to minimize.
[2024-06-01 06:19:21] [INFO ] Deduced a trap composed of 21 places in 213 ms of which 2 ms to minimize.
[2024-06-01 06:19:21] [INFO ] Deduced a trap composed of 21 places in 211 ms of which 2 ms to minimize.
[2024-06-01 06:19:22] [INFO ] Deduced a trap composed of 41 places in 209 ms of which 2 ms to minimize.
[2024-06-01 06:19:22] [INFO ] Deduced a trap composed of 49 places in 205 ms of which 2 ms to minimize.
[2024-06-01 06:19:23] [INFO ] Deduced a trap composed of 49 places in 220 ms of which 2 ms to minimize.
[2024-06-01 06:19:23] [INFO ] Deduced a trap composed of 65 places in 217 ms of which 2 ms to minimize.
[2024-06-01 06:19:23] [INFO ] Deduced a trap composed of 49 places in 214 ms of which 2 ms to minimize.
[2024-06-01 06:19:26] [INFO ] Deduced a trap composed of 36 places in 225 ms of which 2 ms to minimize.
[2024-06-01 06:19:26] [INFO ] Deduced a trap composed of 35 places in 229 ms of which 3 ms to minimize.
[2024-06-01 06:19:26] [INFO ] Deduced a trap composed of 34 places in 230 ms of which 2 ms to minimize.
[2024-06-01 06:19:27] [INFO ] Deduced a trap composed of 37 places in 226 ms of which 2 ms to minimize.
[2024-06-01 06:19:27] [INFO ] Deduced a trap composed of 37 places in 228 ms of which 2 ms to minimize.
[2024-06-01 06:19:27] [INFO ] Deduced a trap composed of 59 places in 147 ms of which 2 ms to minimize.
[2024-06-01 06:19:27] [INFO ] Deduced a trap composed of 59 places in 144 ms of which 2 ms to minimize.
[2024-06-01 06:19:28] [INFO ] Deduced a trap composed of 51 places in 145 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 1521 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 296/938 variables, and 55 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/296 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-06-01 06:19:35] [INFO ] Deduced a trap composed of 32 places in 193 ms of which 2 ms to minimize.
[2024-06-01 06:19:35] [INFO ] Deduced a trap composed of 34 places in 202 ms of which 1 ms to minimize.
[2024-06-01 06:19:35] [INFO ] Deduced a trap composed of 38 places in 129 ms of which 1 ms to minimize.
[2024-06-01 06:19:44] [INFO ] Deduced a trap composed of 31 places in 206 ms of which 2 ms to minimize.
[2024-06-01 06:19:44] [INFO ] Deduced a trap composed of 21 places in 212 ms of which 2 ms to minimize.
[2024-06-01 06:19:44] [INFO ] Deduced a trap composed of 30 places in 196 ms of which 2 ms to minimize.
[2024-06-01 06:19:45] [INFO ] Deduced a trap composed of 49 places in 133 ms of which 1 ms to minimize.
[2024-06-01 06:19:46] [INFO ] Deduced a trap composed of 49 places in 197 ms of which 1 ms to minimize.
[2024-06-01 06:19:46] [INFO ] Deduced a trap composed of 49 places in 136 ms of which 2 ms to minimize.
[2024-06-01 06:19:46] [INFO ] Deduced a trap composed of 41 places in 185 ms of which 1 ms to minimize.
[2024-06-01 06:19:49] [INFO ] Deduced a trap composed of 49 places in 127 ms of which 4 ms to minimize.
[2024-06-01 06:19:49] [INFO ] Deduced a trap composed of 49 places in 97 ms of which 2 ms to minimize.
[2024-06-01 06:19:49] [INFO ] Deduced a trap composed of 46 places in 98 ms of which 1 ms to minimize.
[2024-06-01 06:19:49] [INFO ] Deduced a trap composed of 45 places in 105 ms of which 2 ms to minimize.
[2024-06-01 06:19:49] [INFO ] Deduced a trap composed of 38 places in 96 ms of which 2 ms to minimize.
[2024-06-01 06:19:49] [INFO ] Deduced a trap composed of 40 places in 93 ms of which 1 ms to minimize.
[2024-06-01 06:19:50] [INFO ] Deduced a trap composed of 59 places in 122 ms of which 2 ms to minimize.
[2024-06-01 06:19:50] [INFO ] Deduced a trap composed of 56 places in 105 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 18/73 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-06-01 06:20:00] [INFO ] Deduced a trap composed of 21 places in 192 ms of which 1 ms to minimize.
[2024-06-01 06:20:01] [INFO ] Deduced a trap composed of 49 places in 201 ms of which 2 ms to minimize.
[2024-06-01 06:20:01] [INFO ] Deduced a trap composed of 41 places in 192 ms of which 2 ms to minimize.
[2024-06-01 06:20:01] [INFO ] Deduced a trap composed of 65 places in 190 ms of which 2 ms to minimize.
[2024-06-01 06:20:01] [INFO ] Deduced a trap composed of 41 places in 207 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 296/938 variables, and 78 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/296 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 43/43 constraints]
After SMT, in 63419ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 63433ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 65590 ms. Remains : 296/296 places, 1531/1531 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 101 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
RANDOM walk for 74 steps (0 resets) in 5 ms. (12 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT (AND (NOT p0) p1))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 9 factoid took 192 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
[2024-06-01 06:20:04] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 06:20:04] [INFO ] Invariant cache hit.
[2024-06-01 06:20:05] [INFO ] [Real]Absence check using 14 positive place invariants in 8 ms returned sat
[2024-06-01 06:20:05] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 39 ms returned sat
[2024-06-01 06:20:05] [INFO ] [Real]Absence check using state equation in 610 ms returned sat
[2024-06-01 06:20:05] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:20:06] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2024-06-01 06:20:06] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 17 ms returned sat
[2024-06-01 06:20:06] [INFO ] [Nat]Absence check using state equation in 288 ms returned sat
[2024-06-01 06:20:06] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-01 06:20:06] [INFO ] [Nat]Added 111 Read/Feed constraints in 112 ms returned sat
[2024-06-01 06:20:06] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 48 ms.
[2024-06-01 06:20:06] [INFO ] Added : 0 causal constraints over 0 iterations in 113 ms. Result :sat
Could not prove EG (AND (NOT p0) p1)
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 5226 reset in 401 ms.
Product exploration explored 100000 steps with 5282 reset in 406 ms.
Support contains 20 out of 296 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 296/296 places, 1531/1531 transitions.
Applied a total of 0 rules in 111 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-06-01 06:20:07] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 06:20:07] [INFO ] Invariant cache hit.
[2024-06-01 06:20:08] [INFO ] Implicit Places using invariants in 373 ms returned []
[2024-06-01 06:20:08] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 06:20:08] [INFO ] Invariant cache hit.
[2024-06-01 06:20:08] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-01 06:20:09] [INFO ] Implicit Places using invariants and state equation in 1668 ms returned []
Implicit Place search using SMT with State Equation took 2052 ms to find 0 implicit places.
[2024-06-01 06:20:09] [INFO ] Redundant transitions in 22 ms returned []
Running 1521 sub problems to find dead transitions.
[2024-06-01 06:20:09] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 06:20:09] [INFO ] Invariant cache hit.
[2024-06-01 06:20:09] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-06-01 06:20:22] [INFO ] Deduced a trap composed of 37 places in 209 ms of which 2 ms to minimize.
[2024-06-01 06:20:23] [INFO ] Deduced a trap composed of 53 places in 103 ms of which 1 ms to minimize.
[2024-06-01 06:20:30] [INFO ] Deduced a trap composed of 21 places in 217 ms of which 1 ms to minimize.
[2024-06-01 06:20:30] [INFO ] Deduced a trap composed of 30 places in 202 ms of which 2 ms to minimize.
[2024-06-01 06:20:30] [INFO ] Deduced a trap composed of 30 places in 219 ms of which 2 ms to minimize.
[2024-06-01 06:20:30] [INFO ] Deduced a trap composed of 21 places in 208 ms of which 1 ms to minimize.
[2024-06-01 06:20:31] [INFO ] Deduced a trap composed of 21 places in 212 ms of which 2 ms to minimize.
[2024-06-01 06:20:31] [INFO ] Deduced a trap composed of 41 places in 205 ms of which 2 ms to minimize.
[2024-06-01 06:20:32] [INFO ] Deduced a trap composed of 49 places in 227 ms of which 2 ms to minimize.
[2024-06-01 06:20:32] [INFO ] Deduced a trap composed of 49 places in 212 ms of which 1 ms to minimize.
[2024-06-01 06:20:32] [INFO ] Deduced a trap composed of 65 places in 227 ms of which 2 ms to minimize.
[2024-06-01 06:20:32] [INFO ] Deduced a trap composed of 49 places in 202 ms of which 2 ms to minimize.
[2024-06-01 06:20:35] [INFO ] Deduced a trap composed of 36 places in 225 ms of which 2 ms to minimize.
[2024-06-01 06:20:35] [INFO ] Deduced a trap composed of 35 places in 209 ms of which 2 ms to minimize.
[2024-06-01 06:20:35] [INFO ] Deduced a trap composed of 34 places in 202 ms of which 2 ms to minimize.
[2024-06-01 06:20:36] [INFO ] Deduced a trap composed of 37 places in 202 ms of which 2 ms to minimize.
[2024-06-01 06:20:36] [INFO ] Deduced a trap composed of 37 places in 212 ms of which 2 ms to minimize.
[2024-06-01 06:20:36] [INFO ] Deduced a trap composed of 59 places in 147 ms of which 1 ms to minimize.
[2024-06-01 06:20:36] [INFO ] Deduced a trap composed of 59 places in 145 ms of which 1 ms to minimize.
[2024-06-01 06:20:37] [INFO ] Deduced a trap composed of 51 places in 141 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 1521 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 296/938 variables, and 55 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/296 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-06-01 06:20:45] [INFO ] Deduced a trap composed of 32 places in 208 ms of which 2 ms to minimize.
[2024-06-01 06:20:45] [INFO ] Deduced a trap composed of 34 places in 206 ms of which 2 ms to minimize.
[2024-06-01 06:20:45] [INFO ] Deduced a trap composed of 38 places in 138 ms of which 2 ms to minimize.
[2024-06-01 06:20:54] [INFO ] Deduced a trap composed of 31 places in 223 ms of which 2 ms to minimize.
[2024-06-01 06:20:54] [INFO ] Deduced a trap composed of 21 places in 208 ms of which 2 ms to minimize.
[2024-06-01 06:20:54] [INFO ] Deduced a trap composed of 30 places in 201 ms of which 1 ms to minimize.
[2024-06-01 06:20:55] [INFO ] Deduced a trap composed of 49 places in 132 ms of which 2 ms to minimize.
[2024-06-01 06:20:55] [INFO ] Deduced a trap composed of 49 places in 211 ms of which 1 ms to minimize.
[2024-06-01 06:20:56] [INFO ] Deduced a trap composed of 49 places in 147 ms of which 2 ms to minimize.
[2024-06-01 06:20:56] [INFO ] Deduced a trap composed of 41 places in 209 ms of which 2 ms to minimize.
[2024-06-01 06:20:59] [INFO ] Deduced a trap composed of 49 places in 125 ms of which 2 ms to minimize.
[2024-06-01 06:20:59] [INFO ] Deduced a trap composed of 49 places in 104 ms of which 1 ms to minimize.
[2024-06-01 06:20:59] [INFO ] Deduced a trap composed of 46 places in 103 ms of which 2 ms to minimize.
[2024-06-01 06:20:59] [INFO ] Deduced a trap composed of 45 places in 98 ms of which 2 ms to minimize.
[2024-06-01 06:20:59] [INFO ] Deduced a trap composed of 38 places in 86 ms of which 1 ms to minimize.
[2024-06-01 06:20:59] [INFO ] Deduced a trap composed of 40 places in 100 ms of which 1 ms to minimize.
[2024-06-01 06:20:59] [INFO ] Deduced a trap composed of 59 places in 116 ms of which 2 ms to minimize.
[2024-06-01 06:20:59] [INFO ] Deduced a trap composed of 56 places in 106 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 18/73 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-06-01 06:21:09] [INFO ] Deduced a trap composed of 21 places in 225 ms of which 2 ms to minimize.
[2024-06-01 06:21:10] [INFO ] Deduced a trap composed of 49 places in 185 ms of which 2 ms to minimize.
[2024-06-01 06:21:10] [INFO ] Deduced a trap composed of 41 places in 182 ms of which 2 ms to minimize.
[2024-06-01 06:21:11] [INFO ] Deduced a trap composed of 65 places in 205 ms of which 2 ms to minimize.
[2024-06-01 06:21:11] [INFO ] Deduced a trap composed of 41 places in 202 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 296/938 variables, and 78 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/296 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 43/43 constraints]
After SMT, in 63754ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 63768ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 65965 ms. Remains : 296/296 places, 1531/1531 transitions.
Treatment of property SafeBus-COL-10-LTLCardinality-13 finished in 139549 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0)) U p0)))'
Support contains 10 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 7 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-06-01 06:21:13] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 306 cols
[2024-06-01 06:21:13] [INFO ] Computed 45 invariants in 6 ms
[2024-06-01 06:21:14] [INFO ] Implicit Places using invariants in 385 ms returned []
[2024-06-01 06:21:14] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 06:21:14] [INFO ] Invariant cache hit.
[2024-06-01 06:21:14] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-01 06:21:16] [INFO ] Implicit Places using invariants and state equation in 1942 ms returned []
Implicit Place search using SMT with State Equation took 2331 ms to find 0 implicit places.
Running 1521 sub problems to find dead transitions.
[2024-06-01 06:21:16] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 06:21:16] [INFO ] Invariant cache hit.
[2024-06-01 06:21:16] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-06-01 06:21:27] [INFO ] Deduced a trap composed of 35 places in 222 ms of which 2 ms to minimize.
[2024-06-01 06:21:27] [INFO ] Deduced a trap composed of 59 places in 228 ms of which 3 ms to minimize.
[2024-06-01 06:21:28] [INFO ] Deduced a trap composed of 42 places in 224 ms of which 2 ms to minimize.
[2024-06-01 06:21:28] [INFO ] Deduced a trap composed of 56 places in 166 ms of which 1 ms to minimize.
[2024-06-01 06:21:28] [INFO ] Deduced a trap composed of 40 places in 156 ms of which 2 ms to minimize.
[2024-06-01 06:21:28] [INFO ] Deduced a trap composed of 50 places in 442 ms of which 2 ms to minimize.
[2024-06-01 06:21:29] [INFO ] Deduced a trap composed of 49 places in 151 ms of which 2 ms to minimize.
[2024-06-01 06:21:29] [INFO ] Deduced a trap composed of 48 places in 139 ms of which 1 ms to minimize.
[2024-06-01 06:21:37] [INFO ] Deduced a trap composed of 31 places in 225 ms of which 1 ms to minimize.
[2024-06-01 06:21:38] [INFO ] Deduced a trap composed of 30 places in 223 ms of which 2 ms to minimize.
[2024-06-01 06:21:38] [INFO ] Deduced a trap composed of 30 places in 219 ms of which 2 ms to minimize.
[2024-06-01 06:21:38] [INFO ] Deduced a trap composed of 21 places in 218 ms of which 2 ms to minimize.
[2024-06-01 06:21:38] [INFO ] Deduced a trap composed of 30 places in 219 ms of which 2 ms to minimize.
[2024-06-01 06:21:38] [INFO ] Deduced a trap composed of 30 places in 217 ms of which 1 ms to minimize.
[2024-06-01 06:21:39] [INFO ] Deduced a trap composed of 21 places in 337 ms of which 1 ms to minimize.
[2024-06-01 06:21:39] [INFO ] Deduced a trap composed of 30 places in 220 ms of which 2 ms to minimize.
[2024-06-01 06:21:39] [INFO ] Deduced a trap composed of 30 places in 198 ms of which 2 ms to minimize.
[2024-06-01 06:21:40] [INFO ] Deduced a trap composed of 65 places in 203 ms of which 2 ms to minimize.
[2024-06-01 06:21:40] [INFO ] Deduced a trap composed of 49 places in 207 ms of which 2 ms to minimize.
[2024-06-01 06:21:41] [INFO ] Deduced a trap composed of 49 places in 205 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/948 variables, and 65 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-06-01 06:22:01] [INFO ] Deduced a trap composed of 65 places in 142 ms of which 1 ms to minimize.
[2024-06-01 06:22:01] [INFO ] Deduced a trap composed of 65 places in 127 ms of which 3 ms to minimize.
[2024-06-01 06:22:01] [INFO ] Deduced a trap composed of 65 places in 128 ms of which 2 ms to minimize.
[2024-06-01 06:22:01] [INFO ] Deduced a trap composed of 57 places in 147 ms of which 2 ms to minimize.
[2024-06-01 06:22:01] [INFO ] Deduced a trap composed of 50 places in 145 ms of which 2 ms to minimize.
[2024-06-01 06:22:02] [INFO ] Deduced a trap composed of 44 places in 158 ms of which 2 ms to minimize.
[2024-06-01 06:22:02] [INFO ] Deduced a trap composed of 65 places in 217 ms of which 2 ms to minimize.
[2024-06-01 06:22:02] [INFO ] Deduced a trap composed of 57 places in 219 ms of which 2 ms to minimize.
[2024-06-01 06:22:05] [INFO ] Deduced a trap composed of 44 places in 227 ms of which 2 ms to minimize.
[2024-06-01 06:22:05] [INFO ] Deduced a trap composed of 41 places in 201 ms of which 2 ms to minimize.
[2024-06-01 06:22:05] [INFO ] Deduced a trap composed of 53 places in 206 ms of which 2 ms to minimize.
[2024-06-01 06:22:05] [INFO ] Deduced a trap composed of 41 places in 204 ms of which 2 ms to minimize.
[2024-06-01 06:22:06] [INFO ] Deduced a trap composed of 40 places in 204 ms of which 2 ms to minimize.
[2024-06-01 06:22:06] [INFO ] Deduced a trap composed of 59 places in 145 ms of which 2 ms to minimize.
[2024-06-01 06:22:06] [INFO ] Deduced a trap composed of 49 places in 146 ms of which 2 ms to minimize.
[2024-06-01 06:22:06] [INFO ] Deduced a trap composed of 49 places in 134 ms of which 2 ms to minimize.
[2024-06-01 06:22:06] [INFO ] Deduced a trap composed of 57 places in 125 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 17/82 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-06-01 06:22:18] [INFO ] Deduced a trap composed of 49 places in 142 ms of which 2 ms to minimize.
[2024-06-01 06:22:18] [INFO ] Deduced a trap composed of 49 places in 151 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/948 variables, and 84 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 39/39 constraints]
After SMT, in 63294ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 63308ms
Finished structural reductions in LTL mode , in 1 iterations and 65652 ms. Remains : 306/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SafeBus-COL-10-LTLCardinality-15
Product exploration explored 100000 steps with 50000 reset in 274 ms.
Product exploration explored 100000 steps with 50000 reset in 279 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 16 ms. Reduced automaton from 4 states, 6 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SafeBus-COL-10-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SafeBus-COL-10-LTLCardinality-15 finished in 66404 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(!p1)))))'
[2024-06-01 06:22:20] [INFO ] Flatten gal took : 75 ms
[2024-06-01 06:22:20] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-06-01 06:22:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 306 places, 1531 transitions and 10404 arcs took 16 ms.
Total runtime 566378 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA SafeBus-COL-10-LTLCardinality-00 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA SafeBus-COL-10-LTLCardinality-03 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA SafeBus-COL-10-LTLCardinality-13 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717223535976

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name SafeBus-COL-10-LTLCardinality-00
ltl formula formula --ltl=/tmp/2134/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 306 places, 1531 transitions and 10404 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.160 real 0.040 user 0.060 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2134/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2134/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2134/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2134/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 307 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 307, there are 1537 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~2382 levels ~10000 states ~32656 transitions
pnml2lts-mc( 0/ 4): ~4638 levels ~20000 states ~69356 transitions
pnml2lts-mc( 0/ 4): ~9237 levels ~40000 states ~146372 transitions
pnml2lts-mc( 0/ 4): ~18262 levels ~80000 states ~310276 transitions
pnml2lts-mc( 0/ 4): ~36001 levels ~160000 states ~654052 transitions
pnml2lts-mc( 0/ 4): ~70927 levels ~320000 states ~1339140 transitions
pnml2lts-mc( 0/ 4): ~138592 levels ~640000 states ~2771832 transitions
pnml2lts-mc( 0/ 4): ~271476 levels ~1280000 states ~5765852 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~316671!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 1486845
pnml2lts-mc( 0/ 4): unique transitions count: 6709107
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 2471532
pnml2lts-mc( 0/ 4): - claim success count: 1486872
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1222498
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1486873 states 6709238 transitions, fanout: 4.512
pnml2lts-mc( 0/ 4): Total exploration time 31.300 sec (31.300 sec minimum, 31.300 sec on average)
pnml2lts-mc( 0/ 4): States per second: 47504, Transitions per second: 214353
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 86.9MB, 25.4 B/state, compr.: 2.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 10.0%/93.0%
pnml2lts-mc( 0/ 4): Stored 1561 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 86.9MB (~256.0MB paged-in)
ltl formula name SafeBus-COL-10-LTLCardinality-03
ltl formula formula --ltl=/tmp/2134/ltl_1_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 306 places, 1531 transitions and 10404 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.140 real 0.070 user 0.030 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2134/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2134/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2134/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2134/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 308 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 307, there are 1534 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~27 levels ~10000 states ~12368 transitions
pnml2lts-mc( 2/ 4): ~27 levels ~20000 states ~25092 transitions
pnml2lts-mc( 2/ 4): ~27 levels ~40000 states ~53196 transitions
pnml2lts-mc( 1/ 4): ~27 levels ~80000 states ~102800 transitions
pnml2lts-mc( 1/ 4): ~27 levels ~160000 states ~215876 transitions
pnml2lts-mc( 1/ 4): ~27 levels ~320000 states ~446680 transitions
pnml2lts-mc( 1/ 4): ~27 levels ~640000 states ~916104 transitions
pnml2lts-mc( 1/ 4): ~27 levels ~1280000 states ~1909416 transitions
pnml2lts-mc( 1/ 4): ~27 levels ~2560000 states ~3835420 transitions
pnml2lts-mc( 2/ 4): ~27 levels ~5120000 states ~8107352 transitions
pnml2lts-mc( 2/ 4): ~27 levels ~10240000 states ~16509432 transitions
pnml2lts-mc( 0/ 4): ~27 levels ~20480000 states ~33758004 transitions
pnml2lts-mc( 3/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33553978
pnml2lts-mc( 0/ 4): unique states count: 33554048
pnml2lts-mc( 0/ 4): unique transitions count: 57392362
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 23837971
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 33554051
pnml2lts-mc( 0/ 4): - cum. max stack depth: 108
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33554051 states 57392424 transitions, fanout: 1.710
pnml2lts-mc( 0/ 4): Total exploration time 562.130 sec (562.060 sec minimum, 562.083 sec on average)
pnml2lts-mc( 0/ 4): States per second: 59691, Transitions per second: 102098
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 315.4MB, 9.9 B/state, compr.: 0.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/92.0%
pnml2lts-mc( 0/ 4): Stored 1561 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 315.4MB (~256.0MB paged-in)
ltl formula name SafeBus-COL-10-LTLCardinality-13
ltl formula formula --ltl=/tmp/2134/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 306 places, 1531 transitions and 10404 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.160 real 0.060 user 0.060 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2134/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2134/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2134/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2134/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 307 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 307, there are 1537 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~99!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 26
pnml2lts-mc( 0/ 4): unique states count: 402
pnml2lts-mc( 0/ 4): unique transitions count: 1283
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 406
pnml2lts-mc( 0/ 4): - cum. max stack depth: 380
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 406 states 1357 transitions, fanout: 3.342
pnml2lts-mc( 0/ 4): Total exploration time 0.030 sec (0.030 sec minimum, 0.030 sec on average)
pnml2lts-mc( 0/ 4): States per second: 13533, Transitions per second: 45233
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 51.7 B/state, compr.: 4.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 1561 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)

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="SafeBus-COL-10"
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 SafeBus-COL-10, 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 r524-tall-171679080200371"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SafeBus-COL-10.tgz
mv SafeBus-COL-10 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 ;