MCC'2024- Execution of r524-tall-171679080300428

About the Execution of LTSMin+red for SafeBus-PT-10

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
12592.476	1153087.00	1608882.00	2845.00	?TFFFFFFFFFF?T?F	normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.9M
-rw-r--r-- 1 mcc users 21K Apr 12 15:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 147K Apr 12 15:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 145K Apr 12 15:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 605K Apr 12 15:01 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 8.4K Apr 23 07:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 42K Apr 23 07:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 79K Apr 23 07:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 245K Apr 23 07:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 25K Apr 12 15:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Apr 12 15:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 218K Apr 12 15:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 989K Apr 12 15:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.1K Apr 23 07:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.2M 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-PT-10-LTLFireability-00
FORMULA_NAME SafeBus-PT-10-LTLFireability-01
FORMULA_NAME SafeBus-PT-10-LTLFireability-02
FORMULA_NAME SafeBus-PT-10-LTLFireability-03
FORMULA_NAME SafeBus-PT-10-LTLFireability-04
FORMULA_NAME SafeBus-PT-10-LTLFireability-05
FORMULA_NAME SafeBus-PT-10-LTLFireability-06
FORMULA_NAME SafeBus-PT-10-LTLFireability-07
FORMULA_NAME SafeBus-PT-10-LTLFireability-08
FORMULA_NAME SafeBus-PT-10-LTLFireability-09
FORMULA_NAME SafeBus-PT-10-LTLFireability-10
FORMULA_NAME SafeBus-PT-10-LTLFireability-11
FORMULA_NAME SafeBus-PT-10-LTLFireability-12
FORMULA_NAME SafeBus-PT-10-LTLFireability-13
FORMULA_NAME SafeBus-PT-10-LTLFireability-14
FORMULA_NAME SafeBus-PT-10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717226971937

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SafeBus-PT-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:29:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 07:29:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:29:33] [INFO ] Load time of PNML (sax parser for PT used): 162 ms
[2024-06-01 07:29:33] [INFO ] Transformed 316 places.
[2024-06-01 07:29:33] [INFO ] Transformed 1631 transitions.
[2024-06-01 07:29:33] [INFO ] Found NUPN structural information;
[2024-06-01 07:29:33] [INFO ] Parsed PT model containing 316 places and 1631 transitions and 11384 arcs in 273 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 26 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Reduce places removed 10 places and 0 transitions.
FORMULA SafeBus-PT-10-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 203 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 27 ms. Remains 306 /306 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
[2024-06-01 07:29:33] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
// Phase 1: matrix 642 rows 306 cols
[2024-06-01 07:29:33] [INFO ] Computed 45 invariants in 39 ms
[2024-06-01 07:29:34] [INFO ] Implicit Places using invariants in 334 ms returned []
[2024-06-01 07:29:34] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2024-06-01 07:29:34] [INFO ] Invariant cache hit.
[2024-06-01 07:29:34] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-01 07:29:34] [INFO ] Implicit Places using invariants and state equation in 570 ms returned []
Implicit Place search using SMT with State Equation took 931 ms to find 0 implicit places.
Running 1621 sub problems to find dead transitions.
[2024-06-01 07:29:34] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2024-06-01 07:29:34] [INFO ] Invariant cache hit.
[2024-06-01 07:29:34] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 306/306 constraints. Problems are: Problem set: 0 solved, 1621 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/330 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 2 (INCLUDED_ONLY) 0/306 variables, 21/351 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
[2024-06-01 07:29:49] [INFO ] Deduced a trap composed of 41 places in 258 ms of which 22 ms to minimize.
[2024-06-01 07:29:59] [INFO ] Deduced a trap composed of 21 places in 292 ms of which 4 ms to minimize.
[2024-06-01 07:29:59] [INFO ] Deduced a trap composed of 21 places in 222 ms of which 2 ms to minimize.
[2024-06-01 07:29:59] [INFO ] Deduced a trap composed of 21 places in 249 ms of which 2 ms to minimize.
[2024-06-01 07:30:00] [INFO ] Deduced a trap composed of 21 places in 282 ms of which 3 ms to minimize.
[2024-06-01 07:30:00] [INFO ] Deduced a trap composed of 30 places in 229 ms of which 3 ms to minimize.
[2024-06-01 07:30:00] [INFO ] Deduced a trap composed of 30 places in 240 ms of which 2 ms to minimize.
[2024-06-01 07:30:00] [INFO ] Deduced a trap composed of 31 places in 221 ms of which 2 ms to minimize.
[2024-06-01 07:30:01] [INFO ] Deduced a trap composed of 30 places in 260 ms of which 2 ms to minimize.
[2024-06-01 07:30:01] [INFO ] Deduced a trap composed of 21 places in 221 ms of which 2 ms to minimize.
[2024-06-01 07:30:02] [INFO ] Deduced a trap composed of 49 places in 224 ms of which 2 ms to minimize.
[2024-06-01 07:30:02] [INFO ] Deduced a trap composed of 41 places in 223 ms of which 2 ms to minimize.
[2024-06-01 07:30:02] [INFO ] Deduced a trap composed of 49 places in 215 ms of which 2 ms to minimize.
[2024-06-01 07:30:03] [INFO ] Deduced a trap composed of 49 places in 213 ms of which 2 ms to minimize.
[2024-06-01 07:30:03] [INFO ] Deduced a trap composed of 49 places in 232 ms of which 2 ms to minimize.
[2024-06-01 07:30:06] [INFO ] Deduced a trap composed of 38 places in 213 ms of which 2 ms to minimize.
[2024-06-01 07:30:06] [INFO ] Deduced a trap composed of 51 places in 220 ms of which 3 ms to minimize.
[2024-06-01 07:30:06] [INFO ] Deduced a trap composed of 37 places in 210 ms of which 2 ms to minimize.
[2024-06-01 07:30:06] [INFO ] Deduced a trap composed of 39 places in 212 ms of which 2 ms to minimize.
[2024-06-01 07:30:07] [INFO ] Deduced a trap composed of 38 places in 218 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 20/371 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 371 constraints, problems are : Problem set: 100 solved, 1521 unsolved in 30046 ms.
Refiners :[Domain max(s): 306/306 constraints, Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 21/21 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, 306/306 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/330 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 21/351 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 20/371 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
[2024-06-01 07:30:23] [INFO ] Deduced a trap composed of 49 places in 135 ms of which 1 ms to minimize.
[2024-06-01 07:30:23] [INFO ] Deduced a trap composed of 41 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:30:23] [INFO ] Deduced a trap composed of 49 places in 142 ms of which 2 ms to minimize.
[2024-06-01 07:30:23] [INFO ] Deduced a trap composed of 49 places in 154 ms of which 1 ms to minimize.
[2024-06-01 07:30:23] [INFO ] Deduced a trap composed of 53 places in 159 ms of which 2 ms to minimize.
[2024-06-01 07:30:26] [INFO ] Deduced a trap composed of 37 places in 223 ms of which 2 ms to minimize.
[2024-06-01 07:30:27] [INFO ] Deduced a trap composed of 37 places in 236 ms of which 2 ms to minimize.
[2024-06-01 07:30:27] [INFO ] Deduced a trap composed of 44 places in 232 ms of which 2 ms to minimize.
[2024-06-01 07:30:27] [INFO ] Deduced a trap composed of 37 places in 236 ms of which 3 ms to minimize.
[2024-06-01 07:30:27] [INFO ] Deduced a trap composed of 35 places in 232 ms of which 2 ms to minimize.
[2024-06-01 07:30:28] [INFO ] Deduced a trap composed of 57 places in 147 ms of which 2 ms to minimize.
[2024-06-01 07:30:28] [INFO ] Deduced a trap composed of 49 places in 143 ms of which 2 ms to minimize.
[2024-06-01 07:30:28] [INFO ] Deduced a trap composed of 41 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:30:28] [INFO ] Deduced a trap composed of 49 places in 119 ms of which 1 ms to minimize.
[2024-06-01 07:30:28] [INFO ] Deduced a trap composed of 49 places in 89 ms of which 7 ms to minimize.
[2024-06-01 07:30:28] [INFO ] Deduced a trap composed of 49 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:30:28] [INFO ] Deduced a trap composed of 49 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:30:29] [INFO ] Deduced a trap composed of 70 places in 164 ms of which 3 ms to minimize.
[2024-06-01 07:30:29] [INFO ] Deduced a trap composed of 41 places in 145 ms of which 1 ms to minimize.
[2024-06-01 07:30:29] [INFO ] Deduced a trap composed of 69 places in 206 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 20/391 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/948 variables, and 391 constraints, problems are : Problem set: 100 solved, 1521 unsolved in 30032 ms.
Refiners :[Domain max(s): 306/306 constraints, Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1621 constraints, Known Traps: 40/40 constraints]
After SMT, in 64520ms problems are : Problem set: 100 solved, 1521 unsolved
Search for dead transitions found 100 dead transitions in 64561ms
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 10 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 65559 ms. Remains : 306/306 places, 1531/1631 transitions.
Support contains 203 out of 306 places after structural reductions.
[2024-06-01 07:30:39] [INFO ] Flatten gal took : 240 ms
[2024-06-01 07:30:40] [INFO ] Flatten gal took : 195 ms
[2024-06-01 07:30:41] [INFO ] Input system was already deterministic with 1531 transitions.
Reduction of identical properties reduced properties to check from 30 to 25
RANDOM walk for 26376 steps (5 resets) in 1084 ms. (24 steps per ms) remains 0/25 properties
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' '!(X(G((p0||F(p1)))))'
Support contains 50 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 22 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-06-01 07:30:42] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 306 cols
[2024-06-01 07:30:42] [INFO ] Computed 45 invariants in 9 ms
[2024-06-01 07:30:43] [INFO ] Implicit Places using invariants in 1145 ms returned []
[2024-06-01 07:30:43] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 07:30:43] [INFO ] Invariant cache hit.
[2024-06-01 07:30:43] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-01 07:30:45] [INFO ] Implicit Places using invariants and state equation in 2214 ms returned []
Implicit Place search using SMT with State Equation took 3364 ms to find 0 implicit places.
Running 1521 sub problems to find dead transitions.
[2024-06-01 07:30:45] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 07:30:45] [INFO ] Invariant cache hit.
[2024-06-01 07:30:45] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 306/306 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/330 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 21/351 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-06-01 07:30:58] [INFO ] Deduced a trap composed of 40 places in 202 ms of which 2 ms to minimize.
[2024-06-01 07:31:07] [INFO ] Deduced a trap composed of 49 places in 228 ms of which 2 ms to minimize.
[2024-06-01 07:31:08] [INFO ] Deduced a trap composed of 41 places in 216 ms of which 2 ms to minimize.
[2024-06-01 07:31:08] [INFO ] Deduced a trap composed of 41 places in 223 ms of which 2 ms to minimize.
[2024-06-01 07:31:11] [INFO ] Deduced a trap composed of 42 places in 212 ms of which 2 ms to minimize.
[2024-06-01 07:31:11] [INFO ] Deduced a trap composed of 41 places in 200 ms of which 1 ms to minimize.
[2024-06-01 07:31:11] [INFO ] Deduced a trap composed of 39 places in 209 ms of which 2 ms to minimize.
[2024-06-01 07:31:11] [INFO ] Deduced a trap composed of 41 places in 227 ms of which 2 ms to minimize.
[2024-06-01 07:31:12] [INFO ] Deduced a trap composed of 40 places in 206 ms of which 2 ms to minimize.
[2024-06-01 07:31:12] [INFO ] Deduced a trap composed of 41 places in 218 ms of which 2 ms to minimize.
[2024-06-01 07:31:12] [INFO ] Deduced a trap composed of 38 places in 204 ms of which 2 ms to minimize.
[2024-06-01 07:31:12] [INFO ] Deduced a trap composed of 35 places in 204 ms of which 2 ms to minimize.
[2024-06-01 07:31:13] [INFO ] Deduced a trap composed of 57 places in 136 ms of which 1 ms to minimize.
[2024-06-01 07:31:13] [INFO ] Deduced a trap composed of 41 places in 131 ms of which 1 ms to minimize.
[2024-06-01 07:31:13] [INFO ] Deduced a trap composed of 49 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:31:13] [INFO ] Deduced a trap composed of 49 places in 108 ms of which 1 ms to minimize.
[2024-06-01 07:31:13] [INFO ] Deduced a trap composed of 49 places in 94 ms of which 1 ms to minimize.
[2024-06-01 07:31:13] [INFO ] Deduced a trap composed of 51 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:31:13] [INFO ] Deduced a trap composed of 49 places in 109 ms of which 1 ms to minimize.
[2024-06-01 07:31:14] [INFO ] Deduced a trap composed of 34 places in 218 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 20/371 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 371 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30028 ms.
Refiners :[Domain max(s): 306/306 constraints, Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 21/21 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, 306/306 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/330 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 21/351 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 20/371 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-06-01 07:31:33] [INFO ] Deduced a trap composed of 21 places in 219 ms of which 2 ms to minimize.
[2024-06-01 07:31:34] [INFO ] Deduced a trap composed of 21 places in 213 ms of which 2 ms to minimize.
[2024-06-01 07:31:34] [INFO ] Deduced a trap composed of 30 places in 202 ms of which 2 ms to minimize.
[2024-06-01 07:31:34] [INFO ] Deduced a trap composed of 21 places in 203 ms of which 3 ms to minimize.
[2024-06-01 07:31:34] [INFO ] Deduced a trap composed of 31 places in 200 ms of which 1 ms to minimize.
[2024-06-01 07:31:34] [INFO ] Deduced a trap composed of 21 places in 214 ms of which 2 ms to minimize.
[2024-06-01 07:31:35] [INFO ] Deduced a trap composed of 34 places in 206 ms of which 2 ms to minimize.
[2024-06-01 07:31:35] [INFO ] Deduced a trap composed of 21 places in 212 ms of which 2 ms to minimize.
[2024-06-01 07:31:37] [INFO ] Deduced a trap composed of 57 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:31:37] [INFO ] Deduced a trap composed of 49 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:31:37] [INFO ] Deduced a trap composed of 41 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:31:37] [INFO ] Deduced a trap composed of 49 places in 136 ms of which 2 ms to minimize.
[2024-06-01 07:31:43] [INFO ] Deduced a trap composed of 35 places in 149 ms of which 2 ms to minimize.
[2024-06-01 07:31:43] [INFO ] Deduced a trap composed of 30 places in 205 ms of which 2 ms to minimize.
[2024-06-01 07:31:43] [INFO ] Deduced a trap composed of 41 places in 146 ms of which 2 ms to minimize.
[2024-06-01 07:31:43] [INFO ] Deduced a trap composed of 49 places in 141 ms of which 2 ms to minimize.
[2024-06-01 07:31:44] [INFO ] Deduced a trap composed of 49 places in 133 ms of which 1 ms to minimize.
[2024-06-01 07:31:46] [INFO ] Deduced a trap composed of 75 places in 200 ms of which 2 ms to minimize.
[2024-06-01 07:31:47] [INFO ] Deduced a trap composed of 84 places in 196 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 19/390 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/948 variables, and 390 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30036 ms.
Refiners :[Domain max(s): 306/306 constraints, Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 39/39 constraints]
After SMT, in 63775ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 63796ms
Finished structural reductions in LTL mode , in 1 iterations and 67189 ms. Remains : 306/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 223 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : SafeBus-PT-10-LTLFireability-00
Product exploration explored 100000 steps with 877 reset in 1098 ms.
Product exploration explored 100000 steps with 825 reset in 1027 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 p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 119 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 173 steps (0 resets) in 13 ms. (12 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 6 factoid took 220 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 50 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 236 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-06-01 07:31:52] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 07:31:52] [INFO ] Invariant cache hit.
[2024-06-01 07:31:53] [INFO ] Implicit Places using invariants in 1121 ms returned []
[2024-06-01 07:31:53] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 07:31:53] [INFO ] Invariant cache hit.
[2024-06-01 07:31:53] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-01 07:31:55] [INFO ] Implicit Places using invariants and state equation in 2281 ms returned []
Implicit Place search using SMT with State Equation took 3404 ms to find 0 implicit places.
[2024-06-01 07:31:55] [INFO ] Redundant transitions in 100 ms returned []
Running 1521 sub problems to find dead transitions.
[2024-06-01 07:31:55] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 07:31:55] [INFO ] Invariant cache hit.
[2024-06-01 07:31:56] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 306/306 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/330 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 21/351 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-06-01 07:32:09] [INFO ] Deduced a trap composed of 40 places in 226 ms of which 2 ms to minimize.
[2024-06-01 07:32:19] [INFO ] Deduced a trap composed of 49 places in 230 ms of which 2 ms to minimize.
[2024-06-01 07:32:19] [INFO ] Deduced a trap composed of 41 places in 225 ms of which 2 ms to minimize.
[2024-06-01 07:32:19] [INFO ] Deduced a trap composed of 41 places in 319 ms of which 2 ms to minimize.
[2024-06-01 07:32:22] [INFO ] Deduced a trap composed of 42 places in 214 ms of which 2 ms to minimize.
[2024-06-01 07:32:22] [INFO ] Deduced a trap composed of 41 places in 205 ms of which 2 ms to minimize.
[2024-06-01 07:32:23] [INFO ] Deduced a trap composed of 39 places in 211 ms of which 2 ms to minimize.
[2024-06-01 07:32:23] [INFO ] Deduced a trap composed of 41 places in 199 ms of which 2 ms to minimize.
[2024-06-01 07:32:23] [INFO ] Deduced a trap composed of 40 places in 200 ms of which 2 ms to minimize.
[2024-06-01 07:32:23] [INFO ] Deduced a trap composed of 41 places in 210 ms of which 2 ms to minimize.
[2024-06-01 07:32:24] [INFO ] Deduced a trap composed of 38 places in 229 ms of which 3 ms to minimize.
[2024-06-01 07:32:24] [INFO ] Deduced a trap composed of 35 places in 229 ms of which 2 ms to minimize.
[2024-06-01 07:32:24] [INFO ] Deduced a trap composed of 57 places in 146 ms of which 2 ms to minimize.
[2024-06-01 07:32:24] [INFO ] Deduced a trap composed of 41 places in 142 ms of which 2 ms to minimize.
[2024-06-01 07:32:24] [INFO ] Deduced a trap composed of 49 places in 115 ms of which 1 ms to minimize.
[2024-06-01 07:32:24] [INFO ] Deduced a trap composed of 49 places in 106 ms of which 1 ms to minimize.
[2024-06-01 07:32:25] [INFO ] Deduced a trap composed of 49 places in 95 ms of which 1 ms to minimize.
[2024-06-01 07:32:25] [INFO ] Deduced a trap composed of 51 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:32:25] [INFO ] Deduced a trap composed of 49 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:32:25] [INFO ] Deduced a trap composed of 34 places in 222 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 20/371 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 371 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30027 ms.
Refiners :[Domain max(s): 306/306 constraints, Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 21/21 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, 306/306 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/330 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 21/351 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 20/371 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-06-01 07:32:44] [INFO ] Deduced a trap composed of 21 places in 229 ms of which 2 ms to minimize.
[2024-06-01 07:32:45] [INFO ] Deduced a trap composed of 21 places in 234 ms of which 4 ms to minimize.
[2024-06-01 07:32:45] [INFO ] Deduced a trap composed of 30 places in 203 ms of which 2 ms to minimize.
[2024-06-01 07:32:45] [INFO ] Deduced a trap composed of 21 places in 203 ms of which 2 ms to minimize.
[2024-06-01 07:32:45] [INFO ] Deduced a trap composed of 31 places in 205 ms of which 2 ms to minimize.
[2024-06-01 07:32:46] [INFO ] Deduced a trap composed of 21 places in 204 ms of which 2 ms to minimize.
[2024-06-01 07:32:46] [INFO ] Deduced a trap composed of 34 places in 225 ms of which 2 ms to minimize.
[2024-06-01 07:32:46] [INFO ] Deduced a trap composed of 21 places in 226 ms of which 2 ms to minimize.
[2024-06-01 07:32:48] [INFO ] Deduced a trap composed of 57 places in 100 ms of which 1 ms to minimize.
[2024-06-01 07:32:48] [INFO ] Deduced a trap composed of 49 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:32:48] [INFO ] Deduced a trap composed of 41 places in 102 ms of which 1 ms to minimize.
[2024-06-01 07:32:48] [INFO ] Deduced a trap composed of 49 places in 144 ms of which 1 ms to minimize.
[2024-06-01 07:32:54] [INFO ] Deduced a trap composed of 35 places in 161 ms of which 2 ms to minimize.
[2024-06-01 07:32:54] [INFO ] Deduced a trap composed of 30 places in 233 ms of which 2 ms to minimize.
[2024-06-01 07:32:55] [INFO ] Deduced a trap composed of 41 places in 158 ms of which 1 ms to minimize.
[2024-06-01 07:32:55] [INFO ] Deduced a trap composed of 49 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:32:55] [INFO ] Deduced a trap composed of 49 places in 129 ms of which 1 ms to minimize.
[2024-06-01 07:32:58] [INFO ] Deduced a trap composed of 75 places in 214 ms of which 2 ms to minimize.
[2024-06-01 07:32:58] [INFO ] Deduced a trap composed of 84 places in 216 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 19/390 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/948 variables, and 390 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30036 ms.
Refiners :[Domain max(s): 306/306 constraints, Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 39/39 constraints]
After SMT, in 63866ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 63881ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 67630 ms. Remains : 306/306 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 p0 p1), (X p1)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 138 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 500 steps (0 resets) in 21 ms. (22 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1), (X p1)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 190 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 858 reset in 984 ms.
Product exploration explored 100000 steps with 868 reset in 992 ms.
Support contains 50 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 128 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-06-01 07:33:02] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 07:33:02] [INFO ] Invariant cache hit.
[2024-06-01 07:33:03] [INFO ] Implicit Places using invariants in 1128 ms returned []
[2024-06-01 07:33:03] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 07:33:03] [INFO ] Invariant cache hit.
[2024-06-01 07:33:04] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-01 07:33:06] [INFO ] Implicit Places using invariants and state equation in 2287 ms returned []
Implicit Place search using SMT with State Equation took 3423 ms to find 0 implicit places.
[2024-06-01 07:33:06] [INFO ] Redundant transitions in 32 ms returned []
Running 1521 sub problems to find dead transitions.
[2024-06-01 07:33:06] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 07:33:06] [INFO ] Invariant cache hit.
[2024-06-01 07:33:06] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 306/306 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/330 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 21/351 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-06-01 07:33:19] [INFO ] Deduced a trap composed of 40 places in 227 ms of which 3 ms to minimize.
[2024-06-01 07:33:29] [INFO ] Deduced a trap composed of 49 places in 230 ms of which 2 ms to minimize.
[2024-06-01 07:33:29] [INFO ] Deduced a trap composed of 41 places in 223 ms of which 2 ms to minimize.
[2024-06-01 07:33:29] [INFO ] Deduced a trap composed of 41 places in 226 ms of which 2 ms to minimize.
[2024-06-01 07:33:32] [INFO ] Deduced a trap composed of 42 places in 220 ms of which 2 ms to minimize.
[2024-06-01 07:33:32] [INFO ] Deduced a trap composed of 41 places in 208 ms of which 2 ms to minimize.
[2024-06-01 07:33:32] [INFO ] Deduced a trap composed of 39 places in 232 ms of which 2 ms to minimize.
[2024-06-01 07:33:33] [INFO ] Deduced a trap composed of 41 places in 224 ms of which 2 ms to minimize.
[2024-06-01 07:33:33] [INFO ] Deduced a trap composed of 40 places in 225 ms of which 2 ms to minimize.
[2024-06-01 07:33:33] [INFO ] Deduced a trap composed of 41 places in 232 ms of which 2 ms to minimize.
[2024-06-01 07:33:33] [INFO ] Deduced a trap composed of 38 places in 233 ms of which 2 ms to minimize.
[2024-06-01 07:33:34] [INFO ] Deduced a trap composed of 35 places in 224 ms of which 2 ms to minimize.
[2024-06-01 07:33:34] [INFO ] Deduced a trap composed of 57 places in 140 ms of which 2 ms to minimize.
[2024-06-01 07:33:34] [INFO ] Deduced a trap composed of 41 places in 131 ms of which 1 ms to minimize.
[2024-06-01 07:33:34] [INFO ] Deduced a trap composed of 49 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:33:34] [INFO ] Deduced a trap composed of 49 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:33:34] [INFO ] Deduced a trap composed of 49 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:33:35] [INFO ] Deduced a trap composed of 51 places in 114 ms of which 1 ms to minimize.
[2024-06-01 07:33:35] [INFO ] Deduced a trap composed of 49 places in 107 ms of which 1 ms to minimize.
[2024-06-01 07:33:35] [INFO ] Deduced a trap composed of 34 places in 212 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 20/371 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 371 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30025 ms.
Refiners :[Domain max(s): 306/306 constraints, Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 21/21 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, 306/306 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/330 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 21/351 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 20/371 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-06-01 07:33:54] [INFO ] Deduced a trap composed of 21 places in 214 ms of which 2 ms to minimize.
[2024-06-01 07:33:55] [INFO ] Deduced a trap composed of 21 places in 224 ms of which 2 ms to minimize.
[2024-06-01 07:33:55] [INFO ] Deduced a trap composed of 30 places in 231 ms of which 2 ms to minimize.
[2024-06-01 07:33:55] [INFO ] Deduced a trap composed of 21 places in 232 ms of which 2 ms to minimize.
[2024-06-01 07:33:55] [INFO ] Deduced a trap composed of 31 places in 214 ms of which 4 ms to minimize.
[2024-06-01 07:33:56] [INFO ] Deduced a trap composed of 21 places in 212 ms of which 2 ms to minimize.
[2024-06-01 07:33:56] [INFO ] Deduced a trap composed of 34 places in 207 ms of which 2 ms to minimize.
[2024-06-01 07:33:56] [INFO ] Deduced a trap composed of 21 places in 205 ms of which 2 ms to minimize.
[2024-06-01 07:33:58] [INFO ] Deduced a trap composed of 57 places in 98 ms of which 1 ms to minimize.
[2024-06-01 07:33:58] [INFO ] Deduced a trap composed of 49 places in 95 ms of which 1 ms to minimize.
[2024-06-01 07:33:58] [INFO ] Deduced a trap composed of 41 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:33:58] [INFO ] Deduced a trap composed of 49 places in 141 ms of which 2 ms to minimize.
[2024-06-01 07:34:04] [INFO ] Deduced a trap composed of 35 places in 159 ms of which 2 ms to minimize.
[2024-06-01 07:34:04] [INFO ] Deduced a trap composed of 30 places in 225 ms of which 1 ms to minimize.
[2024-06-01 07:34:04] [INFO ] Deduced a trap composed of 41 places in 166 ms of which 4 ms to minimize.
[2024-06-01 07:34:05] [INFO ] Deduced a trap composed of 49 places in 138 ms of which 2 ms to minimize.
[2024-06-01 07:34:05] [INFO ] Deduced a trap composed of 49 places in 138 ms of which 2 ms to minimize.
[2024-06-01 07:34:08] [INFO ] Deduced a trap composed of 75 places in 211 ms of which 2 ms to minimize.
[2024-06-01 07:34:08] [INFO ] Deduced a trap composed of 84 places in 205 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 19/390 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/948 variables, and 390 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30029 ms.
Refiners :[Domain max(s): 306/306 constraints, Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 39/39 constraints]
After SMT, in 64052ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 64067ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 67668 ms. Remains : 306/306 places, 1531/1531 transitions.
Treatment of property SafeBus-PT-10-LTLFireability-00 finished in 208564 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(p0))||F((G(p0)||X((X(!p1) U ((!p2&&X(!p1))||X(G(!p1)))))))))'
Support contains 32 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 6 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-06-01 07:34:10] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 07:34:10] [INFO ] Invariant cache hit.
[2024-06-01 07:34:11] [INFO ] Implicit Places using invariants in 805 ms returned [266, 267, 268, 269, 270, 271, 272, 273, 274, 275]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 826 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 6 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 839 ms. Remains : 296/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 254 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : SafeBus-PT-10-LTLFireability-01
Product exploration explored 100000 steps with 33333 reset in 397 ms.
Product exploration explored 100000 steps with 33333 reset in 388 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 (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 17 ms. Reduced automaton from 6 states, 19 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SafeBus-PT-10-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SafeBus-PT-10-LTLFireability-01 finished in 1940 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 20 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 9 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-06-01 07:34:12] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 07:34:12] [INFO ] Invariant cache hit.
[2024-06-01 07:34:13] [INFO ] Implicit Places using invariants in 1155 ms returned []
[2024-06-01 07:34:13] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 07:34:13] [INFO ] Invariant cache hit.
[2024-06-01 07:34:13] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-01 07:34:16] [INFO ] Implicit Places using invariants and state equation in 2531 ms returned []
Implicit Place search using SMT with State Equation took 3688 ms to find 0 implicit places.
Running 1521 sub problems to find dead transitions.
[2024-06-01 07:34:16] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 07:34:16] [INFO ] Invariant cache hit.
[2024-06-01 07:34:16] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 306/306 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/330 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 21/351 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-06-01 07:34:29] [INFO ] Deduced a trap composed of 40 places in 212 ms of which 2 ms to minimize.
[2024-06-01 07:34:39] [INFO ] Deduced a trap composed of 49 places in 208 ms of which 2 ms to minimize.
[2024-06-01 07:34:39] [INFO ] Deduced a trap composed of 41 places in 210 ms of which 2 ms to minimize.
[2024-06-01 07:34:39] [INFO ] Deduced a trap composed of 41 places in 211 ms of which 2 ms to minimize.
[2024-06-01 07:34:42] [INFO ] Deduced a trap composed of 42 places in 204 ms of which 2 ms to minimize.
[2024-06-01 07:34:42] [INFO ] Deduced a trap composed of 41 places in 217 ms of which 2 ms to minimize.
[2024-06-01 07:34:43] [INFO ] Deduced a trap composed of 39 places in 210 ms of which 2 ms to minimize.
[2024-06-01 07:34:43] [INFO ] Deduced a trap composed of 41 places in 203 ms of which 2 ms to minimize.
[2024-06-01 07:34:43] [INFO ] Deduced a trap composed of 40 places in 208 ms of which 2 ms to minimize.
[2024-06-01 07:34:43] [INFO ] Deduced a trap composed of 41 places in 206 ms of which 2 ms to minimize.
[2024-06-01 07:34:44] [INFO ] Deduced a trap composed of 38 places in 220 ms of which 2 ms to minimize.
[2024-06-01 07:34:44] [INFO ] Deduced a trap composed of 35 places in 209 ms of which 2 ms to minimize.
[2024-06-01 07:34:44] [INFO ] Deduced a trap composed of 57 places in 149 ms of which 1 ms to minimize.
[2024-06-01 07:34:44] [INFO ] Deduced a trap composed of 41 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:34:44] [INFO ] Deduced a trap composed of 49 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:34:45] [INFO ] Deduced a trap composed of 49 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:34:45] [INFO ] Deduced a trap composed of 49 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:34:45] [INFO ] Deduced a trap composed of 51 places in 112 ms of which 1 ms to minimize.
[2024-06-01 07:34:45] [INFO ] Deduced a trap composed of 49 places in 110 ms of which 1 ms to minimize.
[2024-06-01 07:34:45] [INFO ] Deduced a trap composed of 34 places in 218 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 20/371 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 371 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30031 ms.
Refiners :[Domain max(s): 306/306 constraints, Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 21/21 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, 306/306 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/330 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 21/351 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 20/371 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-06-01 07:35:05] [INFO ] Deduced a trap composed of 21 places in 211 ms of which 3 ms to minimize.
[2024-06-01 07:35:05] [INFO ] Deduced a trap composed of 21 places in 205 ms of which 2 ms to minimize.
[2024-06-01 07:35:05] [INFO ] Deduced a trap composed of 30 places in 204 ms of which 2 ms to minimize.
[2024-06-01 07:35:05] [INFO ] Deduced a trap composed of 21 places in 212 ms of which 2 ms to minimize.
[2024-06-01 07:35:06] [INFO ] Deduced a trap composed of 31 places in 205 ms of which 2 ms to minimize.
[2024-06-01 07:35:06] [INFO ] Deduced a trap composed of 21 places in 199 ms of which 2 ms to minimize.
[2024-06-01 07:35:06] [INFO ] Deduced a trap composed of 34 places in 202 ms of which 2 ms to minimize.
[2024-06-01 07:35:06] [INFO ] Deduced a trap composed of 21 places in 207 ms of which 2 ms to minimize.
[2024-06-01 07:35:08] [INFO ] Deduced a trap composed of 57 places in 99 ms of which 1 ms to minimize.
[2024-06-01 07:35:08] [INFO ] Deduced a trap composed of 49 places in 91 ms of which 1 ms to minimize.
[2024-06-01 07:35:08] [INFO ] Deduced a trap composed of 41 places in 88 ms of which 1 ms to minimize.
[2024-06-01 07:35:08] [INFO ] Deduced a trap composed of 49 places in 138 ms of which 1 ms to minimize.
[2024-06-01 07:35:14] [INFO ] Deduced a trap composed of 35 places in 157 ms of which 1 ms to minimize.
[2024-06-01 07:35:14] [INFO ] Deduced a trap composed of 30 places in 229 ms of which 2 ms to minimize.
[2024-06-01 07:35:15] [INFO ] Deduced a trap composed of 41 places in 165 ms of which 2 ms to minimize.
[2024-06-01 07:35:15] [INFO ] Deduced a trap composed of 49 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:35:15] [INFO ] Deduced a trap composed of 49 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:35:18] [INFO ] Deduced a trap composed of 75 places in 209 ms of which 2 ms to minimize.
[2024-06-01 07:35:18] [INFO ] Deduced a trap composed of 84 places in 210 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 19/390 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/948 variables, and 390 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30034 ms.
Refiners :[Domain max(s): 306/306 constraints, Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 39/39 constraints]
After SMT, in 64157ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 64177ms
Finished structural reductions in LTL mode , in 1 iterations and 67880 ms. Remains : 306/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SafeBus-PT-10-LTLFireability-02
Entered a terminal (fully accepting) state of product in 13 steps with 0 reset in 0 ms.
FORMULA SafeBus-PT-10-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SafeBus-PT-10-LTLFireability-02 finished in 67981 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 U p1))||F(G(p1)))))'
Support contains 40 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 10 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-06-01 07:35:20] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 07:35:20] [INFO ] Invariant cache hit.
[2024-06-01 07:35:21] [INFO ] Implicit Places using invariants in 829 ms returned []
[2024-06-01 07:35:21] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 07:35:21] [INFO ] Invariant cache hit.
[2024-06-01 07:35:21] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-01 07:35:23] [INFO ] Implicit Places using invariants and state equation in 2091 ms returned []
Implicit Place search using SMT with State Equation took 2922 ms to find 0 implicit places.
Running 1521 sub problems to find dead transitions.
[2024-06-01 07:35:23] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 07:35:23] [INFO ] Invariant cache hit.
[2024-06-01 07:35:23] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 306/306 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/330 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 21/351 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-06-01 07:35:36] [INFO ] Deduced a trap composed of 40 places in 218 ms of which 2 ms to minimize.
[2024-06-01 07:35:46] [INFO ] Deduced a trap composed of 49 places in 214 ms of which 2 ms to minimize.
[2024-06-01 07:35:46] [INFO ] Deduced a trap composed of 41 places in 221 ms of which 2 ms to minimize.
[2024-06-01 07:35:46] [INFO ] Deduced a trap composed of 41 places in 209 ms of which 2 ms to minimize.
[2024-06-01 07:35:49] [INFO ] Deduced a trap composed of 42 places in 211 ms of which 2 ms to minimize.
[2024-06-01 07:35:50] [INFO ] Deduced a trap composed of 41 places in 209 ms of which 2 ms to minimize.
[2024-06-01 07:35:50] [INFO ] Deduced a trap composed of 39 places in 212 ms of which 2 ms to minimize.
[2024-06-01 07:35:50] [INFO ] Deduced a trap composed of 41 places in 215 ms of which 2 ms to minimize.
[2024-06-01 07:35:50] [INFO ] Deduced a trap composed of 40 places in 214 ms of which 2 ms to minimize.
[2024-06-01 07:35:50] [INFO ] Deduced a trap composed of 41 places in 215 ms of which 2 ms to minimize.
[2024-06-01 07:35:51] [INFO ] Deduced a trap composed of 38 places in 215 ms of which 2 ms to minimize.
[2024-06-01 07:35:51] [INFO ] Deduced a trap composed of 35 places in 213 ms of which 2 ms to minimize.
[2024-06-01 07:35:51] [INFO ] Deduced a trap composed of 57 places in 141 ms of which 1 ms to minimize.
[2024-06-01 07:35:51] [INFO ] Deduced a trap composed of 41 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:35:52] [INFO ] Deduced a trap composed of 49 places in 188 ms of which 2 ms to minimize.
[2024-06-01 07:35:52] [INFO ] Deduced a trap composed of 49 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:35:52] [INFO ] Deduced a trap composed of 49 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:35:52] [INFO ] Deduced a trap composed of 51 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:35:52] [INFO ] Deduced a trap composed of 49 places in 103 ms of which 1 ms to minimize.
[2024-06-01 07:35:52] [INFO ] Deduced a trap composed of 34 places in 219 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 20/371 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 371 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30032 ms.
Refiners :[Domain max(s): 306/306 constraints, Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 21/21 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, 306/306 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/330 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 21/351 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 20/371 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-06-01 07:36:11] [INFO ] Deduced a trap composed of 21 places in 217 ms of which 2 ms to minimize.
[2024-06-01 07:36:12] [INFO ] Deduced a trap composed of 21 places in 212 ms of which 2 ms to minimize.
[2024-06-01 07:36:12] [INFO ] Deduced a trap composed of 30 places in 216 ms of which 2 ms to minimize.
[2024-06-01 07:36:12] [INFO ] Deduced a trap composed of 21 places in 206 ms of which 2 ms to minimize.
[2024-06-01 07:36:12] [INFO ] Deduced a trap composed of 31 places in 213 ms of which 2 ms to minimize.
[2024-06-01 07:36:12] [INFO ] Deduced a trap composed of 21 places in 211 ms of which 2 ms to minimize.
[2024-06-01 07:36:13] [INFO ] Deduced a trap composed of 34 places in 214 ms of which 2 ms to minimize.
[2024-06-01 07:36:13] [INFO ] Deduced a trap composed of 21 places in 220 ms of which 2 ms to minimize.
[2024-06-01 07:36:15] [INFO ] Deduced a trap composed of 57 places in 100 ms of which 1 ms to minimize.
[2024-06-01 07:36:15] [INFO ] Deduced a trap composed of 49 places in 92 ms of which 1 ms to minimize.
[2024-06-01 07:36:15] [INFO ] Deduced a trap composed of 41 places in 99 ms of which 1 ms to minimize.
[2024-06-01 07:36:15] [INFO ] Deduced a trap composed of 49 places in 138 ms of which 1 ms to minimize.
[2024-06-01 07:36:20] [INFO ] Deduced a trap composed of 35 places in 138 ms of which 2 ms to minimize.
[2024-06-01 07:36:21] [INFO ] Deduced a trap composed of 30 places in 219 ms of which 2 ms to minimize.
[2024-06-01 07:36:21] [INFO ] Deduced a trap composed of 41 places in 157 ms of which 2 ms to minimize.
[2024-06-01 07:36:21] [INFO ] Deduced a trap composed of 49 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:36:22] [INFO ] Deduced a trap composed of 49 places in 127 ms of which 1 ms to minimize.
[2024-06-01 07:36:24] [INFO ] Deduced a trap composed of 75 places in 193 ms of which 3 ms to minimize.
[2024-06-01 07:36:25] [INFO ] Deduced a trap composed of 84 places in 192 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 19/390 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/948 variables, and 390 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30034 ms.
Refiners :[Domain max(s): 306/306 constraints, Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 39/39 constraints]
After SMT, in 63778ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 63793ms
Finished structural reductions in LTL mode , in 1 iterations and 66732 ms. Remains : 306/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 151 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : SafeBus-PT-10-LTLFireability-03
Product exploration explored 100000 steps with 0 reset in 628 ms.
Stack based approach found an accepted trace after 289 steps with 0 reset with depth 290 and stack size 290 in 3 ms.
FORMULA SafeBus-PT-10-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property SafeBus-PT-10-LTLFireability-03 finished in 67542 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)&&((!p1 U (p2||G(!p1))) U G(p1)))))'
Support contains 134 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 07:36:27] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 07:36:27] [INFO ] Invariant cache hit.
[2024-06-01 07:36:28] [INFO ] Implicit Places using invariants in 624 ms returned []
[2024-06-01 07:36:28] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 07:36:28] [INFO ] Invariant cache hit.
[2024-06-01 07:36:28] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-01 07:36:30] [INFO ] Implicit Places using invariants and state equation in 1475 ms returned []
Implicit Place search using SMT with State Equation took 2100 ms to find 0 implicit places.
Running 1521 sub problems to find dead transitions.
[2024-06-01 07:36:30] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 07:36:30] [INFO ] Invariant cache hit.
[2024-06-01 07:36:30] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 306/306 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/330 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 21/351 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-06-01 07:36:43] [INFO ] Deduced a trap composed of 40 places in 212 ms of which 2 ms to minimize.
[2024-06-01 07:36:53] [INFO ] Deduced a trap composed of 49 places in 216 ms of which 2 ms to minimize.
[2024-06-01 07:36:53] [INFO ] Deduced a trap composed of 41 places in 199 ms of which 1 ms to minimize.
[2024-06-01 07:36:53] [INFO ] Deduced a trap composed of 41 places in 215 ms of which 2 ms to minimize.
[2024-06-01 07:36:56] [INFO ] Deduced a trap composed of 42 places in 211 ms of which 2 ms to minimize.
[2024-06-01 07:36:56] [INFO ] Deduced a trap composed of 41 places in 204 ms of which 2 ms to minimize.
[2024-06-01 07:36:56] [INFO ] Deduced a trap composed of 39 places in 203 ms of which 2 ms to minimize.
[2024-06-01 07:36:56] [INFO ] Deduced a trap composed of 41 places in 210 ms of which 2 ms to minimize.
[2024-06-01 07:36:57] [INFO ] Deduced a trap composed of 40 places in 210 ms of which 2 ms to minimize.
[2024-06-01 07:36:57] [INFO ] Deduced a trap composed of 41 places in 207 ms of which 2 ms to minimize.
[2024-06-01 07:36:57] [INFO ] Deduced a trap composed of 38 places in 209 ms of which 1 ms to minimize.
[2024-06-01 07:36:57] [INFO ] Deduced a trap composed of 35 places in 204 ms of which 2 ms to minimize.
[2024-06-01 07:36:58] [INFO ] Deduced a trap composed of 57 places in 136 ms of which 2 ms to minimize.
[2024-06-01 07:36:58] [INFO ] Deduced a trap composed of 41 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:36:58] [INFO ] Deduced a trap composed of 49 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:36:58] [INFO ] Deduced a trap composed of 49 places in 108 ms of which 1 ms to minimize.
[2024-06-01 07:36:58] [INFO ] Deduced a trap composed of 49 places in 99 ms of which 1 ms to minimize.
[2024-06-01 07:36:58] [INFO ] Deduced a trap composed of 51 places in 115 ms of which 1 ms to minimize.
[2024-06-01 07:36:59] [INFO ] Deduced a trap composed of 49 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:36:59] [INFO ] Deduced a trap composed of 34 places in 222 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 20/371 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 371 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30036 ms.
Refiners :[Domain max(s): 306/306 constraints, Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 21/21 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, 306/306 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/330 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 21/351 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 20/371 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-06-01 07:37:18] [INFO ] Deduced a trap composed of 21 places in 211 ms of which 4 ms to minimize.
[2024-06-01 07:37:18] [INFO ] Deduced a trap composed of 21 places in 209 ms of which 2 ms to minimize.
[2024-06-01 07:37:18] [INFO ] Deduced a trap composed of 30 places in 204 ms of which 2 ms to minimize.
[2024-06-01 07:37:18] [INFO ] Deduced a trap composed of 21 places in 209 ms of which 2 ms to minimize.
[2024-06-01 07:37:19] [INFO ] Deduced a trap composed of 31 places in 203 ms of which 2 ms to minimize.
[2024-06-01 07:37:19] [INFO ] Deduced a trap composed of 21 places in 203 ms of which 2 ms to minimize.
[2024-06-01 07:37:19] [INFO ] Deduced a trap composed of 34 places in 206 ms of which 2 ms to minimize.
[2024-06-01 07:37:19] [INFO ] Deduced a trap composed of 21 places in 210 ms of which 1 ms to minimize.
[2024-06-01 07:37:21] [INFO ] Deduced a trap composed of 57 places in 93 ms of which 1 ms to minimize.
[2024-06-01 07:37:21] [INFO ] Deduced a trap composed of 49 places in 92 ms of which 1 ms to minimize.
[2024-06-01 07:37:21] [INFO ] Deduced a trap composed of 41 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:37:22] [INFO ] Deduced a trap composed of 49 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:37:27] [INFO ] Deduced a trap composed of 35 places in 156 ms of which 2 ms to minimize.
[2024-06-01 07:37:27] [INFO ] Deduced a trap composed of 30 places in 232 ms of which 1 ms to minimize.
[2024-06-01 07:37:28] [INFO ] Deduced a trap composed of 41 places in 158 ms of which 2 ms to minimize.
[2024-06-01 07:37:28] [INFO ] Deduced a trap composed of 49 places in 141 ms of which 1 ms to minimize.
[2024-06-01 07:37:28] [INFO ] Deduced a trap composed of 49 places in 127 ms of which 1 ms to minimize.
[2024-06-01 07:37:31] [INFO ] Deduced a trap composed of 75 places in 194 ms of which 2 ms to minimize.
[2024-06-01 07:37:31] [INFO ] Deduced a trap composed of 84 places in 196 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 19/390 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/948 variables, and 390 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30034 ms.
Refiners :[Domain max(s): 306/306 constraints, Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 39/39 constraints]
After SMT, in 63720ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 63736ms
Finished structural reductions in LTL mode , in 1 iterations and 65849 ms. Remains : 306/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 233 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0), (NOT p1), (AND p1 (NOT p2)), (NOT p1)]
Running random walk in product with property : SafeBus-PT-10-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SafeBus-PT-10-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SafeBus-PT-10-LTLFireability-04 finished in 66122 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 121 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 4 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-06-01 07:37:34] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 07:37:34] [INFO ] Invariant cache hit.
[2024-06-01 07:37:34] [INFO ] Implicit Places using invariants in 274 ms returned [266, 267, 268, 269, 270, 271, 272, 273, 274, 275]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 277 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 296 ms. Remains : 296/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SafeBus-PT-10-LTLFireability-06
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA SafeBus-PT-10-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SafeBus-PT-10-LTLFireability-06 finished in 391 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0&&X(!p1)))||G(p0)))'
Support contains 141 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 4 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-06-01 07:37:34] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 07:37:34] [INFO ] Invariant cache hit.
[2024-06-01 07:37:34] [INFO ] Implicit Places using invariants in 230 ms returned []
[2024-06-01 07:37:34] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 07:37:34] [INFO ] Invariant cache hit.
[2024-06-01 07:37:34] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-01 07:37:35] [INFO ] Implicit Places using invariants and state equation in 1016 ms returned []
Implicit Place search using SMT with State Equation took 1248 ms to find 0 implicit places.
Running 1521 sub problems to find dead transitions.
[2024-06-01 07:37:35] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 07:37:35] [INFO ] Invariant cache hit.
[2024-06-01 07:37:35] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 306/306 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/330 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 21/351 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-06-01 07:37:49] [INFO ] Deduced a trap composed of 40 places in 226 ms of which 2 ms to minimize.
[2024-06-01 07:37:58] [INFO ] Deduced a trap composed of 49 places in 214 ms of which 2 ms to minimize.
[2024-06-01 07:37:58] [INFO ] Deduced a trap composed of 41 places in 217 ms of which 2 ms to minimize.
[2024-06-01 07:37:59] [INFO ] Deduced a trap composed of 41 places in 220 ms of which 2 ms to minimize.
[2024-06-01 07:38:02] [INFO ] Deduced a trap composed of 42 places in 208 ms of which 2 ms to minimize.
[2024-06-01 07:38:02] [INFO ] Deduced a trap composed of 41 places in 217 ms of which 2 ms to minimize.
[2024-06-01 07:38:02] [INFO ] Deduced a trap composed of 39 places in 206 ms of which 2 ms to minimize.
[2024-06-01 07:38:02] [INFO ] Deduced a trap composed of 41 places in 220 ms of which 1 ms to minimize.
[2024-06-01 07:38:03] [INFO ] Deduced a trap composed of 40 places in 225 ms of which 2 ms to minimize.
[2024-06-01 07:38:03] [INFO ] Deduced a trap composed of 41 places in 206 ms of which 2 ms to minimize.
[2024-06-01 07:38:03] [INFO ] Deduced a trap composed of 38 places in 220 ms of which 2 ms to minimize.
[2024-06-01 07:38:03] [INFO ] Deduced a trap composed of 35 places in 209 ms of which 2 ms to minimize.
[2024-06-01 07:38:04] [INFO ] Deduced a trap composed of 57 places in 156 ms of which 2 ms to minimize.
[2024-06-01 07:38:04] [INFO ] Deduced a trap composed of 41 places in 131 ms of which 1 ms to minimize.
[2024-06-01 07:38:04] [INFO ] Deduced a trap composed of 49 places in 118 ms of which 1 ms to minimize.
[2024-06-01 07:38:04] [INFO ] Deduced a trap composed of 49 places in 111 ms of which 1 ms to minimize.
[2024-06-01 07:38:04] [INFO ] Deduced a trap composed of 49 places in 95 ms of which 1 ms to minimize.
[2024-06-01 07:38:04] [INFO ] Deduced a trap composed of 51 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:38:04] [INFO ] Deduced a trap composed of 49 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:38:05] [INFO ] Deduced a trap composed of 34 places in 227 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 20/371 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 371 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30032 ms.
Refiners :[Domain max(s): 306/306 constraints, Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 21/21 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, 306/306 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/330 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 21/351 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 20/371 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-06-01 07:38:24] [INFO ] Deduced a trap composed of 21 places in 207 ms of which 2 ms to minimize.
[2024-06-01 07:38:24] [INFO ] Deduced a trap composed of 21 places in 207 ms of which 2 ms to minimize.
[2024-06-01 07:38:25] [INFO ] Deduced a trap composed of 30 places in 204 ms of which 2 ms to minimize.
[2024-06-01 07:38:25] [INFO ] Deduced a trap composed of 21 places in 214 ms of which 1 ms to minimize.
[2024-06-01 07:38:25] [INFO ] Deduced a trap composed of 31 places in 215 ms of which 2 ms to minimize.
[2024-06-01 07:38:25] [INFO ] Deduced a trap composed of 21 places in 206 ms of which 2 ms to minimize.
[2024-06-01 07:38:26] [INFO ] Deduced a trap composed of 34 places in 205 ms of which 2 ms to minimize.
[2024-06-01 07:38:26] [INFO ] Deduced a trap composed of 21 places in 211 ms of which 2 ms to minimize.
[2024-06-01 07:38:28] [INFO ] Deduced a trap composed of 57 places in 94 ms of which 1 ms to minimize.
[2024-06-01 07:38:28] [INFO ] Deduced a trap composed of 49 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:38:28] [INFO ] Deduced a trap composed of 41 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:38:28] [INFO ] Deduced a trap composed of 49 places in 135 ms of which 2 ms to minimize.
[2024-06-01 07:38:33] [INFO ] Deduced a trap composed of 35 places in 154 ms of which 2 ms to minimize.
[2024-06-01 07:38:34] [INFO ] Deduced a trap composed of 30 places in 214 ms of which 2 ms to minimize.
[2024-06-01 07:38:34] [INFO ] Deduced a trap composed of 41 places in 145 ms of which 2 ms to minimize.
[2024-06-01 07:38:34] [INFO ] Deduced a trap composed of 49 places in 135 ms of which 2 ms to minimize.
[2024-06-01 07:38:35] [INFO ] Deduced a trap composed of 49 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:38:37] [INFO ] Deduced a trap composed of 75 places in 188 ms of which 2 ms to minimize.
[2024-06-01 07:38:38] [INFO ] Deduced a trap composed of 84 places in 205 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 19/390 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/948 variables, and 390 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30030 ms.
Refiners :[Domain max(s): 306/306 constraints, Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 39/39 constraints]
After SMT, in 63864ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 63878ms
Finished structural reductions in LTL mode , in 1 iterations and 65137 ms. Remains : 306/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 250 ms :[p1, (AND (NOT p0) p1), true, (OR (NOT p0) p1), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SafeBus-PT-10-LTLFireability-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA SafeBus-PT-10-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SafeBus-PT-10-LTLFireability-07 finished in 65423 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||(F(p1)&&G(p2)))))'
Support contains 6 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 9 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-06-01 07:38:39] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 07:38:39] [INFO ] Invariant cache hit.
[2024-06-01 07:38:41] [INFO ] Implicit Places using invariants in 1117 ms returned [266, 267, 268, 269, 270, 271, 272, 273, 274, 275]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 1121 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 7 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 1138 ms. Remains : 296/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 165 ms :[(NOT p2), (OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), true]
Running random walk in product with property : SafeBus-PT-10-LTLFireability-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SafeBus-PT-10-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SafeBus-PT-10-LTLFireability-08 finished in 1326 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 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 89 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-06-01 07:38:41] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 07:38:41] [INFO ] Invariant cache hit.
[2024-06-01 07:38:42] [INFO ] Implicit Places using invariants in 1269 ms returned [266, 267, 268, 270, 271, 272, 273, 274, 275]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 1271 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 297/306 places, 1531/1531 transitions.
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 9 Pre rules applied. Total rules applied 0 place count 297 transition count 1522
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 288 transition count 1522
Applied a total of 18 rules in 118 ms. Remains 288 /297 variables (removed 9) and now considering 1522/1531 (removed 9) transitions.
[2024-06-01 07:38:42] [INFO ] Flow matrix only has 633 transitions (discarded 889 similar events)
// Phase 1: matrix 633 rows 288 cols
[2024-06-01 07:38:42] [INFO ] Computed 36 invariants in 9 ms
[2024-06-01 07:38:43] [INFO ] Implicit Places using invariants in 1242 ms returned []
[2024-06-01 07:38:43] [INFO ] Flow matrix only has 633 transitions (discarded 889 similar events)
[2024-06-01 07:38:43] [INFO ] Invariant cache hit.
[2024-06-01 07:38:44] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-01 07:38:46] [INFO ] Implicit Places using invariants and state equation in 2104 ms returned []
Implicit Place search using SMT with State Equation took 3350 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 288/306 places, 1522/1531 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4829 ms. Remains : 288/306 places, 1522/1531 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : SafeBus-PT-10-LTLFireability-09
Product exploration explored 100000 steps with 590 reset in 564 ms.
Stack based approach found an accepted trace after 977 steps with 5 reset with depth 415 and stack size 415 in 7 ms.
FORMULA SafeBus-PT-10-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property SafeBus-PT-10-LTLFireability-09 finished in 5450 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U X(p1))))'
Support contains 4 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 13 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-06-01 07:38:46] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 306 cols
[2024-06-01 07:38:46] [INFO ] Computed 45 invariants in 8 ms
[2024-06-01 07:38:47] [INFO ] Implicit Places using invariants in 1296 ms returned [267, 268, 269, 270, 271, 272, 273, 274, 275]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 1298 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 297/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 8 ms. Remains 297 /297 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1320 ms. Remains : 297/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 218 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : SafeBus-PT-10-LTLFireability-10
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA SafeBus-PT-10-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SafeBus-PT-10-LTLFireability-10 finished in 1562 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))||G(p1)))'
Support contains 2 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 121 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-06-01 07:38:48] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 07:38:48] [INFO ] Invariant cache hit.
[2024-06-01 07:38:49] [INFO ] Implicit Places using invariants in 1353 ms returned [266, 267, 268, 269, 270, 271, 272, 273, 274, 275]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 1363 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 1 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 108 ms. Remains 286 /296 variables (removed 10) and now considering 1521/1531 (removed 10) transitions.
[2024-06-01 07:38:49] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
// Phase 1: matrix 632 rows 286 cols
[2024-06-01 07:38:49] [INFO ] Computed 35 invariants in 12 ms
[2024-06-01 07:38:50] [INFO ] Implicit Places using invariants in 1060 ms returned []
[2024-06-01 07:38:50] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2024-06-01 07:38:50] [INFO ] Invariant cache hit.
[2024-06-01 07:38:51] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-01 07:38:53] [INFO ] Implicit Places using invariants and state equation in 2248 ms returned []
Implicit Place search using SMT with State Equation took 3310 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 4903 ms. Remains : 286/306 places, 1521/1531 transitions.
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : SafeBus-PT-10-LTLFireability-11
Product exploration explored 100000 steps with 0 reset in 600 ms.
Stack based approach found an accepted trace after 701 steps with 0 reset with depth 702 and stack size 702 in 5 ms.
FORMULA SafeBus-PT-10-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property SafeBus-PT-10-LTLFireability-11 finished in 5661 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(!p0)&&((!p0||X(!p1)) U (G((!p0||X(!p1)))||((!p0||X(!p1))&&p2))))))'
Support contains 5 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 11 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-06-01 07:38:53] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 306 cols
[2024-06-01 07:38:53] [INFO ] Computed 45 invariants in 7 ms
[2024-06-01 07:38:55] [INFO ] Implicit Places using invariants in 1113 ms returned [266, 267, 268, 269, 270, 271, 272, 273, 274, 275]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 1115 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 8 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 1134 ms. Remains : 296/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 145 ms :[p0, p0, (AND p0 p1), (AND p0 p1)]
Running random walk in product with property : SafeBus-PT-10-LTLFireability-12
Product exploration explored 100000 steps with 329 reset in 545 ms.
Product exploration explored 100000 steps with 312 reset in 525 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 (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 123 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(AND p0 p1), p0, (AND p0 p1), (AND p0 p1)]
RANDOM walk for 40000 steps (8 resets) in 503 ms. (79 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 203 ms. (196 steps per ms) remains 1/1 properties
[2024-06-01 07:38:56] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 296 cols
[2024-06-01 07:38:56] [INFO ] Computed 35 invariants in 10 ms
[2024-06-01 07:38:56] [INFO ] State equation strengthened by 111 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 177/180 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 177/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 72/252 variables, 8/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/252 variables, 72/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/252 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 40/292 variables, 21/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/292 variables, 40/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/292 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/294 variables, 2/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/294 variables, 2/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/294 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 641/935 variables, 294/622 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/935 variables, 110/732 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/935 variables, 0/732 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 3/938 variables, 2/734 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/938 variables, 2/736 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/938 variables, 1/737 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/938 variables, 1/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/938 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/938 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 938/938 variables, and 738 constraints, problems are : Problem set: 0 solved, 1 unsolved in 405 ms.
Refiners :[Domain max(s): 296/296 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 296/296 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 177/180 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 177/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 72/252 variables, 8/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/252 variables, 72/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/252 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Int declared 292/938 variables, and 284 constraints, problems are : Problem set: 1 solved, 0 unsolved in 125 ms.
Refiners :[Domain max(s): 252/296 constraints, Positive P Invariants (semi-flows): 11/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/296 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 573ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p1)))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (OR p2 (NOT p1)))), (F p2), (F (NOT (OR p2 (NOT p0))))]
Knowledge based reduction with 14 factoid took 266 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(AND p0 p1), p0, (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 153 ms :[(AND p0 p1), p0, (AND p0 p1), (AND p0 p1)]
Support contains 5 out of 296 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 296/296 places, 1531/1531 transitions.
Applied a total of 0 rules in 8 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-06-01 07:38:57] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 07:38:57] [INFO ] Invariant cache hit.
[2024-06-01 07:38:58] [INFO ] Implicit Places using invariants in 926 ms returned []
[2024-06-01 07:38:58] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 07:38:58] [INFO ] Invariant cache hit.
[2024-06-01 07:38:59] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-01 07:39:01] [INFO ] Implicit Places using invariants and state equation in 2163 ms returned []
Implicit Place search using SMT with State Equation took 3099 ms to find 0 implicit places.
Running 1521 sub problems to find dead transitions.
[2024-06-01 07:39:01] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 07:39:01] [INFO ] Invariant cache hit.
[2024-06-01 07:39:01] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 296/296 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 14/310 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 21/331 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-06-01 07:39:13] [INFO ] Deduced a trap composed of 40 places in 201 ms of which 2 ms to minimize.
[2024-06-01 07:39:14] [INFO ] Deduced a trap composed of 36 places in 191 ms of which 2 ms to minimize.
[2024-06-01 07:39:14] [INFO ] Deduced a trap composed of 36 places in 190 ms of which 2 ms to minimize.
[2024-06-01 07:39:14] [INFO ] Deduced a trap composed of 74 places in 191 ms of which 2 ms to minimize.
[2024-06-01 07:39:14] [INFO ] Deduced a trap composed of 38 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:39:22] [INFO ] Deduced a trap composed of 35 places in 215 ms of which 1 ms to minimize.
[2024-06-01 07:39:23] [INFO ] Deduced a trap composed of 33 places in 205 ms of which 1 ms to minimize.
[2024-06-01 07:39:23] [INFO ] Deduced a trap composed of 30 places in 198 ms of which 2 ms to minimize.
[2024-06-01 07:39:23] [INFO ] Deduced a trap composed of 21 places in 202 ms of which 2 ms to minimize.
[2024-06-01 07:39:24] [INFO ] Deduced a trap composed of 57 places in 188 ms of which 2 ms to minimize.
[2024-06-01 07:39:24] [INFO ] Deduced a trap composed of 41 places in 184 ms of which 2 ms to minimize.
[2024-06-01 07:39:25] [INFO ] Deduced a trap composed of 49 places in 197 ms of which 2 ms to minimize.
[2024-06-01 07:39:25] [INFO ] Deduced a trap composed of 49 places in 190 ms of which 1 ms to minimize.
[2024-06-01 07:39:25] [INFO ] Deduced a trap composed of 41 places in 191 ms of which 2 ms to minimize.
[2024-06-01 07:39:25] [INFO ] Deduced a trap composed of 41 places in 193 ms of which 2 ms to minimize.
[2024-06-01 07:39:28] [INFO ] Deduced a trap composed of 38 places in 206 ms of which 2 ms to minimize.
[2024-06-01 07:39:28] [INFO ] Deduced a trap composed of 44 places in 207 ms of which 2 ms to minimize.
[2024-06-01 07:39:28] [INFO ] Deduced a trap composed of 42 places in 204 ms of which 2 ms to minimize.
[2024-06-01 07:39:29] [INFO ] Deduced a trap composed of 46 places in 139 ms of which 1 ms to minimize.
[2024-06-01 07:39:29] [INFO ] Deduced a trap composed of 57 places in 162 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 20/351 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 351 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30026 ms.
Refiners :[Domain max(s): 296/296 constraints, 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, 296/296 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 14/310 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 21/331 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 20/351 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 Int declared 296/938 variables, and 351 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30030 ms.
Refiners :[Domain max(s): 296/296 constraints, 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: 20/20 constraints]
After SMT, in 63216ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 63233ms
Finished structural reductions in LTL mode , in 1 iterations and 66348 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) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 87 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(AND p0 p1), p0, (AND p0 p1), (AND p0 p1)]
RANDOM walk for 9093 steps (1 resets) in 92 ms. (97 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : [(F (NOT (OR p2 (NOT p1)))), (F p1), (F p2), (F p0), (F (NOT (OR p2 (NOT p0))))]
Knowledge based reduction with 7 factoid took 232 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(AND p0 p1), p0, (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 142 ms :[(AND p0 p1), p0, (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 145 ms :[(AND p0 p1), p0, (AND p0 p1), (AND p0 p1)]
Product exploration explored 100000 steps with 162 reset in 523 ms.
Product exploration explored 100000 steps with 175 reset in 558 ms.
Support contains 5 out of 296 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 296/296 places, 1531/1531 transitions.
Applied a total of 0 rules in 9 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-06-01 07:40:06] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 07:40:06] [INFO ] Invariant cache hit.
[2024-06-01 07:40:07] [INFO ] Implicit Places using invariants in 939 ms returned []
[2024-06-01 07:40:07] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 07:40:07] [INFO ] Invariant cache hit.
[2024-06-01 07:40:07] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-01 07:40:09] [INFO ] Implicit Places using invariants and state equation in 2213 ms returned []
Implicit Place search using SMT with State Equation took 3154 ms to find 0 implicit places.
Running 1521 sub problems to find dead transitions.
[2024-06-01 07:40:09] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 07:40:09] [INFO ] Invariant cache hit.
[2024-06-01 07:40:09] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 296/296 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 14/310 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 21/331 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-06-01 07:40:22] [INFO ] Deduced a trap composed of 40 places in 200 ms of which 2 ms to minimize.
[2024-06-01 07:40:22] [INFO ] Deduced a trap composed of 36 places in 193 ms of which 2 ms to minimize.
[2024-06-01 07:40:23] [INFO ] Deduced a trap composed of 36 places in 212 ms of which 2 ms to minimize.
[2024-06-01 07:40:23] [INFO ] Deduced a trap composed of 74 places in 200 ms of which 2 ms to minimize.
[2024-06-01 07:40:23] [INFO ] Deduced a trap composed of 38 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:40:32] [INFO ] Deduced a trap composed of 35 places in 213 ms of which 2 ms to minimize.
[2024-06-01 07:40:32] [INFO ] Deduced a trap composed of 33 places in 204 ms of which 2 ms to minimize.
[2024-06-01 07:40:32] [INFO ] Deduced a trap composed of 30 places in 201 ms of which 2 ms to minimize.
[2024-06-01 07:40:32] [INFO ] Deduced a trap composed of 21 places in 214 ms of which 2 ms to minimize.
[2024-06-01 07:40:33] [INFO ] Deduced a trap composed of 57 places in 187 ms of which 1 ms to minimize.
[2024-06-01 07:40:34] [INFO ] Deduced a trap composed of 41 places in 187 ms of which 2 ms to minimize.
[2024-06-01 07:40:34] [INFO ] Deduced a trap composed of 49 places in 185 ms of which 2 ms to minimize.
[2024-06-01 07:40:34] [INFO ] Deduced a trap composed of 49 places in 195 ms of which 1 ms to minimize.
[2024-06-01 07:40:34] [INFO ] Deduced a trap composed of 41 places in 191 ms of which 2 ms to minimize.
[2024-06-01 07:40:34] [INFO ] Deduced a trap composed of 41 places in 212 ms of which 2 ms to minimize.
[2024-06-01 07:40:37] [INFO ] Deduced a trap composed of 38 places in 223 ms of which 2 ms to minimize.
[2024-06-01 07:40:37] [INFO ] Deduced a trap composed of 44 places in 210 ms of which 2 ms to minimize.
[2024-06-01 07:40:38] [INFO ] Deduced a trap composed of 42 places in 206 ms of which 2 ms to minimize.
[2024-06-01 07:40:38] [INFO ] Deduced a trap composed of 46 places in 139 ms of which 2 ms to minimize.
[2024-06-01 07:40:38] [INFO ] Deduced a trap composed of 57 places in 147 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 20/351 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 351 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30028 ms.
Refiners :[Domain max(s): 296/296 constraints, 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, 296/296 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 14/310 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 21/331 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 20/351 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-06-01 07:41:13] [INFO ] Deduced a trap composed of 32 places in 208 ms of which 2 ms to minimize.
[2024-06-01 07:41:13] [INFO ] Deduced a trap composed of 39 places in 192 ms of which 2 ms to minimize.
[2024-06-01 07:41:13] [INFO ] Deduced a trap composed of 21 places in 205 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 296/938 variables, and 354 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30028 ms.
Refiners :[Domain max(s): 296/296 constraints, 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: 23/23 constraints]
After SMT, in 63665ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 63682ms
Finished structural reductions in LTL mode , in 1 iterations and 66852 ms. Remains : 296/296 places, 1531/1531 transitions.
Treatment of property SafeBus-PT-10-LTLFireability-12 finished in 139816 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X((X(X((p2&&G(p3))))||p1)))))'
Support contains 5 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 10 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-06-01 07:41:13] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 306 cols
[2024-06-01 07:41:13] [INFO ] Computed 45 invariants in 9 ms
[2024-06-01 07:41:14] [INFO ] Implicit Places using invariants in 1185 ms returned [266, 267, 268, 269, 270, 271, 272, 273, 274, 275]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 1186 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 1202 ms. Remains : 296/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 226 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p3))]
Running random walk in product with property : SafeBus-PT-10-LTLFireability-13
Product exploration explored 100000 steps with 50000 reset in 239 ms.
Product exploration explored 100000 steps with 50000 reset in 250 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 (NOT p0) p1 p2 p3), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 19 ms. Reduced automaton from 5 states, 7 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SafeBus-PT-10-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SafeBus-PT-10-LTLFireability-13 finished in 1964 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 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 93 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-06-01 07:41:15] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 07:41:15] [INFO ] Invariant cache hit.
[2024-06-01 07:41:16] [INFO ] Implicit Places using invariants in 1184 ms returned [266, 267, 268, 269, 270, 271, 272, 273, 274, 275]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 1186 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 98 ms. Remains 286 /296 variables (removed 10) and now considering 1521/1531 (removed 10) transitions.
[2024-06-01 07:41:17] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
// Phase 1: matrix 632 rows 286 cols
[2024-06-01 07:41:17] [INFO ] Computed 35 invariants in 4 ms
[2024-06-01 07:41:18] [INFO ] Implicit Places using invariants in 1003 ms returned []
[2024-06-01 07:41:18] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2024-06-01 07:41:18] [INFO ] Invariant cache hit.
[2024-06-01 07:41:18] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-01 07:41:20] [INFO ] Implicit Places using invariants and state equation in 2460 ms returned []
Implicit Place search using SMT with State Equation took 3471 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 4848 ms. Remains : 286/306 places, 1521/1531 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SafeBus-PT-10-LTLFireability-14
Product exploration explored 100000 steps with 203 reset in 595 ms.
Product exploration explored 100000 steps with 176 reset in 567 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 p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 72 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 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X p0), (X (X p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 81 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 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
[2024-06-01 07:41:22] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2024-06-01 07:41:22] [INFO ] Invariant cache hit.
[2024-06-01 07:41:22] [INFO ] [Real]Absence check using 14 positive place invariants in 24 ms returned sat
[2024-06-01 07:41:23] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 321 ms returned sat
[2024-06-01 07:41:23] [INFO ] [Real]Absence check using state equation in 839 ms returned sat
[2024-06-01 07:41:23] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:41:24] [INFO ] [Nat]Absence check using 14 positive place invariants in 14 ms returned sat
[2024-06-01 07:41:24] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 137 ms returned sat
[2024-06-01 07:41:25] [INFO ] [Nat]Absence check using state equation in 522 ms returned sat
[2024-06-01 07:41:25] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-01 07:41:25] [INFO ] [Nat]Added 111 Read/Feed constraints in 86 ms returned sat
[2024-06-01 07:41:25] [INFO ] Deduced a trap composed of 60 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:41:25] [INFO ] Deduced a trap composed of 41 places in 138 ms of which 1 ms to minimize.
[2024-06-01 07:41:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 342 ms
[2024-06-01 07:41:25] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 602 transitions) in 100 ms.
[2024-06-01 07:41:25] [INFO ] Added : 0 causal constraints over 0 iterations in 166 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 286 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 286/286 places, 1521/1521 transitions.
Applied a total of 0 rules in 88 ms. Remains 286 /286 variables (removed 0) and now considering 1521/1521 (removed 0) transitions.
[2024-06-01 07:41:25] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2024-06-01 07:41:25] [INFO ] Invariant cache hit.
[2024-06-01 07:41:27] [INFO ] Implicit Places using invariants in 1118 ms returned []
[2024-06-01 07:41:27] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2024-06-01 07:41:27] [INFO ] Invariant cache hit.
[2024-06-01 07:41:27] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-01 07:41:29] [INFO ] Implicit Places using invariants and state equation in 2380 ms returned []
Implicit Place search using SMT with State Equation took 3500 ms to find 0 implicit places.
[2024-06-01 07:41:29] [INFO ] Redundant transitions in 27 ms returned []
Running 1511 sub problems to find dead transitions.
[2024-06-01 07:41:29] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2024-06-01 07:41:29] [INFO ] Invariant cache hit.
[2024-06-01 07:41:29] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/286 variables, 286/286 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/286 variables, 14/300 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 21/321 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
[2024-06-01 07:41:41] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:41:41] [INFO ] Deduced a trap composed of 39 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:41:41] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:41:41] [INFO ] Deduced a trap composed of 43 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:41:41] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:41:50] [INFO ] Deduced a trap composed of 30 places in 235 ms of which 2 ms to minimize.
[2024-06-01 07:41:50] [INFO ] Deduced a trap composed of 30 places in 232 ms of which 2 ms to minimize.
[2024-06-01 07:41:50] [INFO ] Deduced a trap composed of 21 places in 214 ms of which 2 ms to minimize.
[2024-06-01 07:41:51] [INFO ] Deduced a trap composed of 30 places in 255 ms of which 3 ms to minimize.
[2024-06-01 07:41:51] [INFO ] Deduced a trap composed of 30 places in 230 ms of which 1 ms to minimize.
[2024-06-01 07:41:51] [INFO ] Deduced a trap composed of 46 places in 216 ms of which 2 ms to minimize.
[2024-06-01 07:41:51] [INFO ] Deduced a trap composed of 21 places in 229 ms of which 2 ms to minimize.
[2024-06-01 07:41:53] [INFO ] Deduced a trap composed of 49 places in 214 ms of which 1 ms to minimize.
[2024-06-01 07:41:53] [INFO ] Deduced a trap composed of 41 places in 230 ms of which 2 ms to minimize.
[2024-06-01 07:41:55] [INFO ] Deduced a trap composed of 41 places in 228 ms of which 2 ms to minimize.
[2024-06-01 07:41:56] [INFO ] Deduced a trap composed of 41 places in 221 ms of which 2 ms to minimize.
[2024-06-01 07:41:56] [INFO ] Deduced a trap composed of 36 places in 215 ms of which 2 ms to minimize.
[2024-06-01 07:41:56] [INFO ] Deduced a trap composed of 39 places in 216 ms of which 2 ms to minimize.
[2024-06-01 07:41:56] [INFO ] Deduced a trap composed of 57 places in 221 ms of which 2 ms to minimize.
[2024-06-01 07:41:56] [INFO ] Deduced a trap composed of 40 places in 162 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 20/341 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 286/918 variables, and 341 constraints, problems are : Problem set: 0 solved, 1511 unsolved in 30029 ms.
Refiners :[Domain max(s): 286/286 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/286 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1511/1511 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1511 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/286 variables, 286/286 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/286 variables, 14/300 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 21/321 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 20/341 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
[2024-06-01 07:42:15] [INFO ] Deduced a trap composed of 41 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:42:16] [INFO ] Deduced a trap composed of 41 places in 116 ms of which 1 ms to minimize.
[2024-06-01 07:42:16] [INFO ] Deduced a trap composed of 57 places in 111 ms of which 1 ms to minimize.
[2024-06-01 07:42:17] [INFO ] Deduced a trap composed of 57 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:42:22] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 1 ms to minimize.
[2024-06-01 07:42:24] [INFO ] Deduced a trap composed of 60 places in 117 ms of which 1 ms to minimize.
[2024-06-01 07:42:25] [INFO ] Deduced a trap composed of 41 places in 106 ms of which 1 ms to minimize.
[2024-06-01 07:42:25] [INFO ] Deduced a trap composed of 57 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:42:26] [INFO ] Deduced a trap composed of 49 places in 106 ms of which 1 ms to minimize.
[2024-06-01 07:42:31] [INFO ] Deduced a trap composed of 57 places in 104 ms of which 1 ms to minimize.
[2024-06-01 07:42:32] [INFO ] Deduced a trap composed of 41 places in 112 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 286/918 variables, and 352 constraints, problems are : Problem set: 0 solved, 1511 unsolved in 30028 ms.
Refiners :[Domain max(s): 286/286 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/286 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1511 constraints, Known Traps: 31/31 constraints]
After SMT, in 63642ms problems are : Problem set: 0 solved, 1511 unsolved
Search for dead transitions found 0 dead transitions in 63656ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 67282 ms. Remains : 286/286 places, 1521/1521 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 p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X p0), (X (X p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 96 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 59 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
[2024-06-01 07:42:33] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2024-06-01 07:42:33] [INFO ] Invariant cache hit.
[2024-06-01 07:42:34] [INFO ] [Real]Absence check using 14 positive place invariants in 24 ms returned sat
[2024-06-01 07:42:34] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 312 ms returned sat
[2024-06-01 07:42:35] [INFO ] [Real]Absence check using state equation in 867 ms returned sat
[2024-06-01 07:42:35] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:42:35] [INFO ] [Nat]Absence check using 14 positive place invariants in 14 ms returned sat
[2024-06-01 07:42:36] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 138 ms returned sat
[2024-06-01 07:42:36] [INFO ] [Nat]Absence check using state equation in 531 ms returned sat
[2024-06-01 07:42:36] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-01 07:42:36] [INFO ] [Nat]Added 111 Read/Feed constraints in 89 ms returned sat
[2024-06-01 07:42:36] [INFO ] Deduced a trap composed of 60 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:42:36] [INFO ] Deduced a trap composed of 41 places in 135 ms of which 2 ms to minimize.
[2024-06-01 07:42:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 343 ms
[2024-06-01 07:42:37] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 602 transitions) in 65 ms.
[2024-06-01 07:42:37] [INFO ] Added : 0 causal constraints over 0 iterations in 132 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 203 reset in 574 ms.
Product exploration explored 100000 steps with 154 reset in 582 ms.
Support contains 2 out of 286 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 286/286 places, 1521/1521 transitions.
Applied a total of 0 rules in 88 ms. Remains 286 /286 variables (removed 0) and now considering 1521/1521 (removed 0) transitions.
[2024-06-01 07:42:38] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2024-06-01 07:42:38] [INFO ] Invariant cache hit.
[2024-06-01 07:42:39] [INFO ] Implicit Places using invariants in 1178 ms returned []
[2024-06-01 07:42:39] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2024-06-01 07:42:39] [INFO ] Invariant cache hit.
[2024-06-01 07:42:39] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-01 07:42:42] [INFO ] Implicit Places using invariants and state equation in 2482 ms returned []
Implicit Place search using SMT with State Equation took 3661 ms to find 0 implicit places.
[2024-06-01 07:42:42] [INFO ] Redundant transitions in 24 ms returned []
Running 1511 sub problems to find dead transitions.
[2024-06-01 07:42:42] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2024-06-01 07:42:42] [INFO ] Invariant cache hit.
[2024-06-01 07:42:42] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/286 variables, 286/286 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/286 variables, 14/300 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 21/321 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
[2024-06-01 07:42:54] [INFO ] Deduced a trap composed of 36 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:42:54] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:42:54] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:42:54] [INFO ] Deduced a trap composed of 43 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:42:54] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:43:03] [INFO ] Deduced a trap composed of 30 places in 204 ms of which 2 ms to minimize.
[2024-06-01 07:43:03] [INFO ] Deduced a trap composed of 30 places in 197 ms of which 2 ms to minimize.
[2024-06-01 07:43:03] [INFO ] Deduced a trap composed of 21 places in 200 ms of which 2 ms to minimize.
[2024-06-01 07:43:03] [INFO ] Deduced a trap composed of 30 places in 197 ms of which 2 ms to minimize.
[2024-06-01 07:43:03] [INFO ] Deduced a trap composed of 30 places in 199 ms of which 2 ms to minimize.
[2024-06-01 07:43:04] [INFO ] Deduced a trap composed of 46 places in 197 ms of which 2 ms to minimize.
[2024-06-01 07:43:04] [INFO ] Deduced a trap composed of 21 places in 202 ms of which 2 ms to minimize.
[2024-06-01 07:43:05] [INFO ] Deduced a trap composed of 49 places in 196 ms of which 2 ms to minimize.
[2024-06-01 07:43:05] [INFO ] Deduced a trap composed of 41 places in 192 ms of which 1 ms to minimize.
[2024-06-01 07:43:08] [INFO ] Deduced a trap composed of 41 places in 194 ms of which 2 ms to minimize.
[2024-06-01 07:43:08] [INFO ] Deduced a trap composed of 41 places in 197 ms of which 2 ms to minimize.
[2024-06-01 07:43:08] [INFO ] Deduced a trap composed of 36 places in 191 ms of which 2 ms to minimize.
[2024-06-01 07:43:09] [INFO ] Deduced a trap composed of 39 places in 188 ms of which 2 ms to minimize.
[2024-06-01 07:43:09] [INFO ] Deduced a trap composed of 57 places in 185 ms of which 1 ms to minimize.
[2024-06-01 07:43:09] [INFO ] Deduced a trap composed of 40 places in 127 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 20/341 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 286/918 variables, and 341 constraints, problems are : Problem set: 0 solved, 1511 unsolved in 30028 ms.
Refiners :[Domain max(s): 286/286 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/286 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1511/1511 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1511 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/286 variables, 286/286 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/286 variables, 14/300 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 21/321 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 20/341 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
[2024-06-01 07:43:28] [INFO ] Deduced a trap composed of 41 places in 141 ms of which 2 ms to minimize.
[2024-06-01 07:43:28] [INFO ] Deduced a trap composed of 41 places in 138 ms of which 2 ms to minimize.
[2024-06-01 07:43:29] [INFO ] Deduced a trap composed of 57 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:43:29] [INFO ] Deduced a trap composed of 57 places in 118 ms of which 1 ms to minimize.
[2024-06-01 07:43:34] [INFO ] Deduced a trap composed of 41 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:43:36] [INFO ] Deduced a trap composed of 60 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:43:37] [INFO ] Deduced a trap composed of 41 places in 123 ms of which 1 ms to minimize.
[2024-06-01 07:43:38] [INFO ] Deduced a trap composed of 57 places in 114 ms of which 1 ms to minimize.
[2024-06-01 07:43:39] [INFO ] Deduced a trap composed of 49 places in 119 ms of which 1 ms to minimize.
[2024-06-01 07:43:44] [INFO ] Deduced a trap composed of 57 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:43:44] [INFO ] Deduced a trap composed of 41 places in 116 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 286/918 variables, and 352 constraints, problems are : Problem set: 0 solved, 1511 unsolved in 30038 ms.
Refiners :[Domain max(s): 286/286 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/286 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1511 constraints, Known Traps: 31/31 constraints]
After SMT, in 63719ms problems are : Problem set: 0 solved, 1511 unsolved
Search for dead transitions found 0 dead transitions in 63733ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 67514 ms. Remains : 286/286 places, 1521/1521 transitions.
Treatment of property SafeBus-PT-10-LTLFireability-14 finished in 150350 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 U (G(!p0)||p1)) U (G((!p0 U (p1||G(!p0))))||((!p0 U (p1||G(!p0)))&&(!p2||X(X(!p2)))))))))'
Support contains 6 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 9 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-06-01 07:43:46] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 306 cols
[2024-06-01 07:43:46] [INFO ] Computed 45 invariants in 5 ms
[2024-06-01 07:43:47] [INFO ] Implicit Places using invariants in 1406 ms returned [266, 267, 268, 269, 270, 271, 272, 273, 274, 275]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 1408 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 7 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 1426 ms. Remains : 296/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 320 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1) p2), (AND p0 (NOT p1)), (AND p0 (NOT p1) p2), (AND p0 (NOT p1) p2), (AND p0 (NOT p1) p2)]
Running random walk in product with property : SafeBus-PT-10-LTLFireability-15
Product exploration explored 100000 steps with 5 reset in 548 ms.
Stack based approach found an accepted trace after 511 steps with 0 reset with depth 512 and stack size 512 in 3 ms.
FORMULA SafeBus-PT-10-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property SafeBus-PT-10-LTLFireability-15 finished in 2330 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||F(p1)))))'
Found a Lengthening insensitive property : SafeBus-PT-10-LTLFireability-00
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 50 out of 306 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 18 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-06-01 07:43:48] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 07:43:48] [INFO ] Invariant cache hit.
[2024-06-01 07:43:49] [INFO ] Implicit Places using invariants in 1101 ms returned []
[2024-06-01 07:43:49] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 07:43:49] [INFO ] Invariant cache hit.
[2024-06-01 07:43:49] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-01 07:43:52] [INFO ] Implicit Places using invariants and state equation in 2301 ms returned []
Implicit Place search using SMT with State Equation took 3405 ms to find 0 implicit places.
Running 1521 sub problems to find dead transitions.
[2024-06-01 07:43:52] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 07:43:52] [INFO ] Invariant cache hit.
[2024-06-01 07:43:52] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 306/306 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/330 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 21/351 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-06-01 07:44:05] [INFO ] Deduced a trap composed of 40 places in 188 ms of which 2 ms to minimize.
[2024-06-01 07:44:14] [INFO ] Deduced a trap composed of 49 places in 208 ms of which 2 ms to minimize.
[2024-06-01 07:44:14] [INFO ] Deduced a trap composed of 41 places in 218 ms of which 2 ms to minimize.
[2024-06-01 07:44:15] [INFO ] Deduced a trap composed of 41 places in 213 ms of which 2 ms to minimize.
[2024-06-01 07:44:18] [INFO ] Deduced a trap composed of 42 places in 208 ms of which 2 ms to minimize.
[2024-06-01 07:44:18] [INFO ] Deduced a trap composed of 41 places in 205 ms of which 1 ms to minimize.
[2024-06-01 07:44:18] [INFO ] Deduced a trap composed of 39 places in 201 ms of which 2 ms to minimize.
[2024-06-01 07:44:18] [INFO ] Deduced a trap composed of 41 places in 207 ms of which 2 ms to minimize.
[2024-06-01 07:44:18] [INFO ] Deduced a trap composed of 40 places in 199 ms of which 2 ms to minimize.
[2024-06-01 07:44:19] [INFO ] Deduced a trap composed of 41 places in 214 ms of which 2 ms to minimize.
[2024-06-01 07:44:19] [INFO ] Deduced a trap composed of 38 places in 215 ms of which 2 ms to minimize.
[2024-06-01 07:44:19] [INFO ] Deduced a trap composed of 35 places in 274 ms of which 2 ms to minimize.
[2024-06-01 07:44:19] [INFO ] Deduced a trap composed of 57 places in 144 ms of which 1 ms to minimize.
[2024-06-01 07:44:20] [INFO ] Deduced a trap composed of 41 places in 147 ms of which 2 ms to minimize.
[2024-06-01 07:44:20] [INFO ] Deduced a trap composed of 49 places in 116 ms of which 1 ms to minimize.
[2024-06-01 07:44:20] [INFO ] Deduced a trap composed of 49 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:44:20] [INFO ] Deduced a trap composed of 49 places in 96 ms of which 1 ms to minimize.
[2024-06-01 07:44:20] [INFO ] Deduced a trap composed of 51 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:44:20] [INFO ] Deduced a trap composed of 49 places in 104 ms of which 1 ms to minimize.
[2024-06-01 07:44:21] [INFO ] Deduced a trap composed of 34 places in 218 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 20/371 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 371 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30029 ms.
Refiners :[Domain max(s): 306/306 constraints, Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 21/21 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, 306/306 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/330 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 21/351 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 20/371 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-06-01 07:44:40] [INFO ] Deduced a trap composed of 21 places in 217 ms of which 2 ms to minimize.
[2024-06-01 07:44:40] [INFO ] Deduced a trap composed of 21 places in 198 ms of which 2 ms to minimize.
[2024-06-01 07:44:40] [INFO ] Deduced a trap composed of 30 places in 215 ms of which 2 ms to minimize.
[2024-06-01 07:44:40] [INFO ] Deduced a trap composed of 21 places in 201 ms of which 2 ms to minimize.
[2024-06-01 07:44:41] [INFO ] Deduced a trap composed of 31 places in 209 ms of which 2 ms to minimize.
[2024-06-01 07:44:41] [INFO ] Deduced a trap composed of 21 places in 214 ms of which 2 ms to minimize.
[2024-06-01 07:44:41] [INFO ] Deduced a trap composed of 34 places in 217 ms of which 2 ms to minimize.
[2024-06-01 07:44:41] [INFO ] Deduced a trap composed of 21 places in 211 ms of which 1 ms to minimize.
[2024-06-01 07:44:43] [INFO ] Deduced a trap composed of 57 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:44:43] [INFO ] Deduced a trap composed of 49 places in 92 ms of which 1 ms to minimize.
[2024-06-01 07:44:43] [INFO ] Deduced a trap composed of 41 places in 96 ms of which 1 ms to minimize.
[2024-06-01 07:44:44] [INFO ] Deduced a trap composed of 49 places in 140 ms of which 2 ms to minimize.
[2024-06-01 07:44:49] [INFO ] Deduced a trap composed of 35 places in 149 ms of which 2 ms to minimize.
[2024-06-01 07:44:49] [INFO ] Deduced a trap composed of 30 places in 230 ms of which 2 ms to minimize.
[2024-06-01 07:44:50] [INFO ] Deduced a trap composed of 41 places in 154 ms of which 2 ms to minimize.
[2024-06-01 07:44:50] [INFO ] Deduced a trap composed of 49 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:44:50] [INFO ] Deduced a trap composed of 49 places in 137 ms of which 2 ms to minimize.
[2024-06-01 07:44:53] [INFO ] Deduced a trap composed of 75 places in 200 ms of which 2 ms to minimize.
[2024-06-01 07:44:54] [INFO ] Deduced a trap composed of 84 places in 192 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 19/390 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/948 variables, and 390 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30029 ms.
Refiners :[Domain max(s): 306/306 constraints, Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 39/39 constraints]
After SMT, in 63610ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 63625ms
Finished structural reductions in LI_LTL mode , in 1 iterations and 67056 ms. Remains : 306/306 places, 1531/1531 transitions.
Running random walk in product with property : SafeBus-PT-10-LTLFireability-00
Product exploration explored 100000 steps with 842 reset in 1044 ms.
Product exploration explored 100000 steps with 869 reset in 1054 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 p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 167 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 128 steps (0 resets) in 13 ms. (9 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 6 factoid took 235 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 50 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 119 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-06-01 07:44:58] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 07:44:58] [INFO ] Invariant cache hit.
[2024-06-01 07:44:59] [INFO ] Implicit Places using invariants in 1110 ms returned []
[2024-06-01 07:44:59] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 07:44:59] [INFO ] Invariant cache hit.
[2024-06-01 07:44:59] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-01 07:45:01] [INFO ] Implicit Places using invariants and state equation in 2233 ms returned []
Implicit Place search using SMT with State Equation took 3345 ms to find 0 implicit places.
[2024-06-01 07:45:02] [INFO ] Redundant transitions in 26 ms returned []
Running 1521 sub problems to find dead transitions.
[2024-06-01 07:45:02] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 07:45:02] [INFO ] Invariant cache hit.
[2024-06-01 07:45:02] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 306/306 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/330 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 21/351 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-06-01 07:45:15] [INFO ] Deduced a trap composed of 40 places in 209 ms of which 1 ms to minimize.
[2024-06-01 07:45:24] [INFO ] Deduced a trap composed of 49 places in 200 ms of which 2 ms to minimize.
[2024-06-01 07:45:24] [INFO ] Deduced a trap composed of 41 places in 201 ms of which 2 ms to minimize.
[2024-06-01 07:45:25] [INFO ] Deduced a trap composed of 41 places in 215 ms of which 2 ms to minimize.
[2024-06-01 07:45:27] [INFO ] Deduced a trap composed of 42 places in 207 ms of which 2 ms to minimize.
[2024-06-01 07:45:28] [INFO ] Deduced a trap composed of 41 places in 197 ms of which 2 ms to minimize.
[2024-06-01 07:45:28] [INFO ] Deduced a trap composed of 39 places in 198 ms of which 2 ms to minimize.
[2024-06-01 07:45:28] [INFO ] Deduced a trap composed of 41 places in 208 ms of which 2 ms to minimize.
[2024-06-01 07:45:28] [INFO ] Deduced a trap composed of 40 places in 203 ms of which 2 ms to minimize.
[2024-06-01 07:45:28] [INFO ] Deduced a trap composed of 41 places in 214 ms of which 2 ms to minimize.
[2024-06-01 07:45:29] [INFO ] Deduced a trap composed of 38 places in 213 ms of which 2 ms to minimize.
[2024-06-01 07:45:29] [INFO ] Deduced a trap composed of 35 places in 209 ms of which 2 ms to minimize.
[2024-06-01 07:45:29] [INFO ] Deduced a trap composed of 57 places in 142 ms of which 2 ms to minimize.
[2024-06-01 07:45:29] [INFO ] Deduced a trap composed of 41 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:45:29] [INFO ] Deduced a trap composed of 49 places in 117 ms of which 1 ms to minimize.
[2024-06-01 07:45:30] [INFO ] Deduced a trap composed of 49 places in 107 ms of which 1 ms to minimize.
[2024-06-01 07:45:30] [INFO ] Deduced a trap composed of 49 places in 88 ms of which 1 ms to minimize.
[2024-06-01 07:45:30] [INFO ] Deduced a trap composed of 51 places in 117 ms of which 1 ms to minimize.
[2024-06-01 07:45:30] [INFO ] Deduced a trap composed of 49 places in 109 ms of which 1 ms to minimize.
[2024-06-01 07:45:30] [INFO ] Deduced a trap composed of 34 places in 222 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 20/371 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 371 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30036 ms.
Refiners :[Domain max(s): 306/306 constraints, Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 21/21 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, 306/306 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/330 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 21/351 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 20/371 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-06-01 07:45:50] [INFO ] Deduced a trap composed of 21 places in 214 ms of which 2 ms to minimize.
[2024-06-01 07:45:50] [INFO ] Deduced a trap composed of 21 places in 209 ms of which 2 ms to minimize.
[2024-06-01 07:45:50] [INFO ] Deduced a trap composed of 30 places in 208 ms of which 2 ms to minimize.
[2024-06-01 07:45:50] [INFO ] Deduced a trap composed of 21 places in 205 ms of which 2 ms to minimize.
[2024-06-01 07:45:51] [INFO ] Deduced a trap composed of 31 places in 212 ms of which 2 ms to minimize.
[2024-06-01 07:45:51] [INFO ] Deduced a trap composed of 21 places in 214 ms of which 1 ms to minimize.
[2024-06-01 07:45:51] [INFO ] Deduced a trap composed of 34 places in 215 ms of which 2 ms to minimize.
[2024-06-01 07:45:51] [INFO ] Deduced a trap composed of 21 places in 204 ms of which 2 ms to minimize.
[2024-06-01 07:45:53] [INFO ] Deduced a trap composed of 57 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:45:53] [INFO ] Deduced a trap composed of 49 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:45:53] [INFO ] Deduced a trap composed of 41 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:45:54] [INFO ] Deduced a trap composed of 49 places in 137 ms of which 2 ms to minimize.
[2024-06-01 07:45:59] [INFO ] Deduced a trap composed of 35 places in 152 ms of which 1 ms to minimize.
[2024-06-01 07:45:59] [INFO ] Deduced a trap composed of 30 places in 211 ms of which 2 ms to minimize.
[2024-06-01 07:45:59] [INFO ] Deduced a trap composed of 41 places in 146 ms of which 2 ms to minimize.
[2024-06-01 07:46:00] [INFO ] Deduced a trap composed of 49 places in 138 ms of which 2 ms to minimize.
[2024-06-01 07:46:00] [INFO ] Deduced a trap composed of 49 places in 135 ms of which 2 ms to minimize.
[2024-06-01 07:46:03] [INFO ] Deduced a trap composed of 75 places in 183 ms of which 2 ms to minimize.
[2024-06-01 07:46:03] [INFO ] Deduced a trap composed of 84 places in 201 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 19/390 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/948 variables, and 390 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30023 ms.
Refiners :[Domain max(s): 306/306 constraints, Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 39/39 constraints]
After SMT, in 63816ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 63829ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 67327 ms. Remains : 306/306 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 p0 p1), (X p1)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 111 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 355 steps (0 resets) in 10 ms. (32 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1), (X p1)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 200 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 858 reset in 1040 ms.
Product exploration explored 100000 steps with 832 reset in 1043 ms.
Support contains 50 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 118 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-06-01 07:46:08] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 07:46:08] [INFO ] Invariant cache hit.
[2024-06-01 07:46:09] [INFO ] Implicit Places using invariants in 1109 ms returned []
[2024-06-01 07:46:09] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 07:46:09] [INFO ] Invariant cache hit.
[2024-06-01 07:46:09] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-01 07:46:12] [INFO ] Implicit Places using invariants and state equation in 2269 ms returned []
Implicit Place search using SMT with State Equation took 3381 ms to find 0 implicit places.
[2024-06-01 07:46:12] [INFO ] Redundant transitions in 27 ms returned []
Running 1521 sub problems to find dead transitions.
[2024-06-01 07:46:12] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 07:46:12] [INFO ] Invariant cache hit.
[2024-06-01 07:46:12] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 306/306 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/330 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 21/351 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-06-01 07:46:24] [INFO ] Deduced a trap composed of 40 places in 210 ms of which 2 ms to minimize.
[2024-06-01 07:46:34] [INFO ] Deduced a trap composed of 49 places in 236 ms of which 2 ms to minimize.
[2024-06-01 07:46:34] [INFO ] Deduced a trap composed of 41 places in 211 ms of which 2 ms to minimize.
[2024-06-01 07:46:34] [INFO ] Deduced a trap composed of 41 places in 217 ms of which 2 ms to minimize.
[2024-06-01 07:46:37] [INFO ] Deduced a trap composed of 42 places in 219 ms of which 2 ms to minimize.
[2024-06-01 07:46:38] [INFO ] Deduced a trap composed of 41 places in 236 ms of which 2 ms to minimize.
[2024-06-01 07:46:38] [INFO ] Deduced a trap composed of 39 places in 215 ms of which 2 ms to minimize.
[2024-06-01 07:46:38] [INFO ] Deduced a trap composed of 41 places in 227 ms of which 2 ms to minimize.
[2024-06-01 07:46:38] [INFO ] Deduced a trap composed of 40 places in 209 ms of which 2 ms to minimize.
[2024-06-01 07:46:39] [INFO ] Deduced a trap composed of 41 places in 229 ms of which 2 ms to minimize.
[2024-06-01 07:46:39] [INFO ] Deduced a trap composed of 38 places in 210 ms of which 2 ms to minimize.
[2024-06-01 07:46:39] [INFO ] Deduced a trap composed of 35 places in 243 ms of which 5 ms to minimize.
[2024-06-01 07:46:39] [INFO ] Deduced a trap composed of 57 places in 143 ms of which 2 ms to minimize.
[2024-06-01 07:46:39] [INFO ] Deduced a trap composed of 41 places in 130 ms of which 1 ms to minimize.
[2024-06-01 07:46:40] [INFO ] Deduced a trap composed of 49 places in 117 ms of which 1 ms to minimize.
[2024-06-01 07:46:40] [INFO ] Deduced a trap composed of 49 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:46:40] [INFO ] Deduced a trap composed of 49 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:46:40] [INFO ] Deduced a trap composed of 51 places in 123 ms of which 1 ms to minimize.
[2024-06-01 07:46:40] [INFO ] Deduced a trap composed of 49 places in 109 ms of which 1 ms to minimize.
[2024-06-01 07:46:40] [INFO ] Deduced a trap composed of 34 places in 221 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")
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 20/371 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 371 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30028 ms.
Refiners :[Domain max(s): 306/306 constraints, Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 21/21 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, 306/306 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/330 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 21/351 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 20/371 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-06-01 07:47:00] [INFO ] Deduced a trap composed of 21 places in 226 ms of which 2 ms to minimize.
[2024-06-01 07:47:00] [INFO ] Deduced a trap composed of 21 places in 212 ms of which 2 ms to minimize.
[2024-06-01 07:47:00] [INFO ] Deduced a trap composed of 30 places in 209 ms of which 2 ms to minimize.
[2024-06-01 07:47:00] [INFO ] Deduced a trap composed of 21 places in 210 ms of which 2 ms to minimize.
[2024-06-01 07:47:01] [INFO ] Deduced a trap composed of 31 places in 208 ms of which 2 ms to minimize.
[2024-06-01 07:47:01] [INFO ] Deduced a trap composed of 21 places in 218 ms of which 2 ms to minimize.
[2024-06-01 07:47:01] [INFO ] Deduced a trap composed of 34 places in 212 ms of which 2 ms to minimize.
[2024-06-01 07:47:01] [INFO ] Deduced a trap composed of 21 places in 211 ms of which 2 ms to minimize.
[2024-06-01 07:47:03] [INFO ] Deduced a trap composed of 57 places in 97 ms of which 1 ms to minimize.
[2024-06-01 07:47:03] [INFO ] Deduced a trap composed of 49 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:47:03] [INFO ] Deduced a trap composed of 41 places in 92 ms of which 1 ms to minimize.
[2024-06-01 07:47:04] [INFO ] Deduced a trap composed of 49 places in 140 ms of which 2 ms to minimize.
[2024-06-01 07:47:09] [INFO ] Deduced a trap composed of 35 places in 145 ms of which 1 ms to minimize.
[2024-06-01 07:47:09] [INFO ] Deduced a trap composed of 30 places in 221 ms of which 2 ms to minimize.
[2024-06-01 07:47:10] [INFO ] Deduced a trap composed of 41 places in 141 ms of which 1 ms to minimize.
[2024-06-01 07:47:10] [INFO ] Deduced a trap composed of 49 places in 143 ms of which 2 ms to minimize.
[2024-06-01 07:47:10] [INFO ] Deduced a trap composed of 49 places in 138 ms of which 2 ms to minimize.
[2024-06-01 07:47:13] [INFO ] Deduced a trap composed of 75 places in 193 ms of which 2 ms to minimize.
[2024-06-01 07:47:13] [INFO ] Deduced a trap composed of 84 places in 189 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 19/390 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/948 variables, and 390 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30033 ms.
Refiners :[Domain max(s): 306/306 constraints, Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 39/39 constraints]
After SMT, in 63492ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 63506ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 67042 ms. Remains : 306/306 places, 1531/1531 transitions.
Treatment of property SafeBus-PT-10-LTLFireability-00 finished in 207355 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(!p0)&&((!p0||X(!p1)) U (G((!p0||X(!p1)))||((!p0||X(!p1))&&p2))))))'
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)))'
[2024-06-01 07:47:16] [INFO ] Flatten gal took : 100 ms
[2024-06-01 07:47:16] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 12 ms.
[2024-06-01 07:47:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 306 places, 1531 transitions and 10404 arcs took 29 ms.
Total runtime 1063045 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : SafeBus-PT-10-LTLFireability-00
Could not compute solution for formula : SafeBus-PT-10-LTLFireability-12
Could not compute solution for formula : SafeBus-PT-10-LTLFireability-14

BK_STOP 1717228125024

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name SafeBus-PT-10-LTLFireability-00
ltl formula formula --ltl=/tmp/3271/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( 2/ 4): LTL layer: formula: /tmp/3271/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3271/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3271/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.300 real 0.050 user 0.070 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3271/ltl_0_
pnml2lts-mc( 1/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
corrupted size vs. prev_size in fastbins
ltl formula name SafeBus-PT-10-LTLFireability-12
ltl formula formula --ltl=/tmp/3271/ltl_1_
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.310 real 0.070 user 0.040 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3271/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3271/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3271/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3271/ltl_1_
pnml2lts-mc( 0/ 4): There are 307 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 307, there are 1554 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( 3/ 4): ~2306 levels ~10000 states ~59484 transitions
pnml2lts-mc( 3/ 4): ~4571 levels ~20000 states ~125444 transitions
pnml2lts-mc( 3/ 4): ~8930 levels ~40000 states ~265440 transitions
pnml2lts-mc( 3/ 4): ~17515 levels ~80000 states ~559832 transitions
pnml2lts-mc( 3/ 4): ~34021 levels ~160000 states ~1146312 transitions
pnml2lts-mc( 1/ 4): ~66638 levels ~320000 states ~2414732 transitions
pnml2lts-mc( 3/ 4): ~129834 levels ~640000 states ~4968368 transitions
pnml2lts-mc( 3/ 4): ~253437 levels ~1280000 states ~10226820 transitions
pnml2lts-mc( 2/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 31021
pnml2lts-mc( 0/ 4): unique states count: 2006471
pnml2lts-mc( 0/ 4): unique transitions count: 16504145
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 39504
pnml2lts-mc( 0/ 4): - claim found count: 6582527
pnml2lts-mc( 0/ 4): - claim success count: 2006483
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1605387
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2006485 states 16504314 transitions, fanout: 8.225
pnml2lts-mc( 0/ 4): Total exploration time 41.210 sec (40.990 sec minimum, 41.060 sec on average)
pnml2lts-mc( 0/ 4): States per second: 48689, Transitions per second: 400493
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 99.7MB, 22.4 B/state, compr.: 1.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 13.0%/99.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: 99.7MB (~256.0MB paged-in)
ltl formula name SafeBus-PT-10-LTLFireability-14
ltl formula formula --ltl=/tmp/3271/ltl_2_
Warning: program compiled against libxml 210 using older 209
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
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.060 user 0.050 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3271/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3271/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3271/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3271/ltl_2_
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( 1/ 4): ~2378 levels ~10000 states ~32396 transitions
pnml2lts-mc( 2/ 4): ~4250 levels ~20000 states ~66544 transitions
pnml2lts-mc( 2/ 4): ~8723 levels ~40000 states ~141712 transitions
pnml2lts-mc( 2/ 4): ~15555 levels ~80000 states ~274496 transitions
pnml2lts-mc( 2/ 4): ~17700 levels ~160000 states ~395004 transitions
pnml2lts-mc( 2/ 4): ~37668 levels ~320000 states ~868136 transitions
pnml2lts-mc( 2/ 4): ~83881 levels ~640000 states ~1919552 transitions
pnml2lts-mc( 2/ 4): ~151461 levels ~1280000 states ~3722144 transitions
pnml2lts-mc( 0/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 335736
pnml2lts-mc( 0/ 4): unique states count: 2060399
pnml2lts-mc( 0/ 4): unique transitions count: 8500966
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 98055
pnml2lts-mc( 0/ 4): - claim found count: 2929832
pnml2lts-mc( 0/ 4): - claim success count: 2060427
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1442650
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2060430 states 8501140 transitions, fanout: 4.126
pnml2lts-mc( 0/ 4): Total exploration time 41.860 sec (41.810 sec minimum, 41.830 sec on average)
pnml2lts-mc( 0/ 4): States per second: 49222, Transitions per second: 203085
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 99.4MB, 22.5 B/state, compr.: 1.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 13.0%/99.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: 99.4MB (~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-PT-10"
export BK_EXAMINATION="LTLFireability"
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-PT-10, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r524-tall-171679080300428"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SafeBus-PT-10.tgz
mv SafeBus-PT-10 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;