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.r334-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 itstools
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 r334-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 1716830778206

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SafeBus-PT-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-27 17:26:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-27 17:26:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 17:26:19] [INFO ] Load time of PNML (sax parser for PT used): 164 ms
[2024-05-27 17:26:19] [INFO ] Transformed 316 places.
[2024-05-27 17:26:19] [INFO ] Transformed 1631 transitions.
[2024-05-27 17:26:19] [INFO ] Found NUPN structural information;
[2024-05-27 17:26:19] [INFO ] Parsed PT model containing 316 places and 1631 transitions and 11384 arcs in 287 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 29 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 28 ms. Remains 306 /306 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
[2024-05-27 17:26:20] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
// Phase 1: matrix 642 rows 306 cols
[2024-05-27 17:26:20] [INFO ] Computed 45 invariants in 38 ms
[2024-05-27 17:26:20] [INFO ] Implicit Places using invariants in 349 ms returned []
[2024-05-27 17:26:20] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2024-05-27 17:26:20] [INFO ] Invariant cache hit.
[2024-05-27 17:26:20] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 17:26:21] [INFO ] Implicit Places using invariants and state equation in 514 ms returned []
Implicit Place search using SMT with State Equation took 891 ms to find 0 implicit places.
Running 1621 sub problems to find dead transitions.
[2024-05-27 17:26:21] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2024-05-27 17:26:21] [INFO ] Invariant cache hit.
[2024-05-27 17:26:21] [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-05-27 17:26:35] [INFO ] Deduced a trap composed of 41 places in 290 ms of which 35 ms to minimize.
[2024-05-27 17:26:45] [INFO ] Deduced a trap composed of 21 places in 251 ms of which 2 ms to minimize.
[2024-05-27 17:26:45] [INFO ] Deduced a trap composed of 21 places in 217 ms of which 2 ms to minimize.
[2024-05-27 17:26:45] [INFO ] Deduced a trap composed of 21 places in 232 ms of which 5 ms to minimize.
[2024-05-27 17:26:45] [INFO ] Deduced a trap composed of 21 places in 280 ms of which 2 ms to minimize.
[2024-05-27 17:26:46] [INFO ] Deduced a trap composed of 30 places in 229 ms of which 2 ms to minimize.
[2024-05-27 17:26:46] [INFO ] Deduced a trap composed of 30 places in 225 ms of which 2 ms to minimize.
[2024-05-27 17:26:46] [INFO ] Deduced a trap composed of 31 places in 222 ms of which 3 ms to minimize.
[2024-05-27 17:26:46] [INFO ] Deduced a trap composed of 30 places in 221 ms of which 2 ms to minimize.
[2024-05-27 17:26:47] [INFO ] Deduced a trap composed of 21 places in 212 ms of which 2 ms to minimize.
[2024-05-27 17:26:48] [INFO ] Deduced a trap composed of 49 places in 222 ms of which 2 ms to minimize.
[2024-05-27 17:26:48] [INFO ] Deduced a trap composed of 41 places in 224 ms of which 2 ms to minimize.
[2024-05-27 17:26:48] [INFO ] Deduced a trap composed of 49 places in 214 ms of which 2 ms to minimize.
[2024-05-27 17:26:49] [INFO ] Deduced a trap composed of 49 places in 210 ms of which 2 ms to minimize.
[2024-05-27 17:26:49] [INFO ] Deduced a trap composed of 49 places in 243 ms of which 2 ms to minimize.
[2024-05-27 17:26:52] [INFO ] Deduced a trap composed of 38 places in 217 ms of which 2 ms to minimize.
[2024-05-27 17:26:52] [INFO ] Deduced a trap composed of 51 places in 229 ms of which 2 ms to minimize.
[2024-05-27 17:26:52] [INFO ] Deduced a trap composed of 37 places in 211 ms of which 2 ms to minimize.
[2024-05-27 17:26:52] [INFO ] Deduced a trap composed of 39 places in 229 ms of which 2 ms to minimize.
[2024-05-27 17:26:53] [INFO ] Deduced a trap composed of 38 places in 217 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 30047 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-05-27 17:27:08] [INFO ] Deduced a trap composed of 49 places in 124 ms of which 2 ms to minimize.
[2024-05-27 17:27:08] [INFO ] Deduced a trap composed of 41 places in 117 ms of which 2 ms to minimize.
[2024-05-27 17:27:09] [INFO ] Deduced a trap composed of 49 places in 128 ms of which 1 ms to minimize.
[2024-05-27 17:27:09] [INFO ] Deduced a trap composed of 49 places in 130 ms of which 2 ms to minimize.
[2024-05-27 17:27:09] [INFO ] Deduced a trap composed of 53 places in 158 ms of which 2 ms to minimize.
[2024-05-27 17:27:12] [INFO ] Deduced a trap composed of 37 places in 219 ms of which 2 ms to minimize.
[2024-05-27 17:27:12] [INFO ] Deduced a trap composed of 37 places in 217 ms of which 2 ms to minimize.
[2024-05-27 17:27:13] [INFO ] Deduced a trap composed of 44 places in 227 ms of which 3 ms to minimize.
[2024-05-27 17:27:13] [INFO ] Deduced a trap composed of 37 places in 211 ms of which 2 ms to minimize.
[2024-05-27 17:27:13] [INFO ] Deduced a trap composed of 35 places in 227 ms of which 2 ms to minimize.
[2024-05-27 17:27:13] [INFO ] Deduced a trap composed of 57 places in 128 ms of which 1 ms to minimize.
[2024-05-27 17:27:13] [INFO ] Deduced a trap composed of 49 places in 147 ms of which 2 ms to minimize.
[2024-05-27 17:27:14] [INFO ] Deduced a trap composed of 41 places in 134 ms of which 1 ms to minimize.
[2024-05-27 17:27:14] [INFO ] Deduced a trap composed of 49 places in 116 ms of which 2 ms to minimize.
[2024-05-27 17:27:14] [INFO ] Deduced a trap composed of 49 places in 89 ms of which 2 ms to minimize.
[2024-05-27 17:27:14] [INFO ] Deduced a trap composed of 49 places in 73 ms of which 1 ms to minimize.
[2024-05-27 17:27:14] [INFO ] Deduced a trap composed of 49 places in 72 ms of which 1 ms to minimize.
[2024-05-27 17:27:14] [INFO ] Deduced a trap composed of 70 places in 153 ms of which 2 ms to minimize.
[2024-05-27 17:27:14] [INFO ] Deduced a trap composed of 41 places in 140 ms of which 1 ms to minimize.
[2024-05-27 17:27:15] [INFO ] Deduced a trap composed of 69 places in 193 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 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: 0/1621 constraints, Known Traps: 40/40 constraints]
After SMT, in 64304ms problems are : Problem set: 100 solved, 1521 unsolved
Search for dead transitions found 100 dead transitions in 64339ms
Found 100 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 100 transitions
Dead transitions reduction (with SMT) removed 100 transitions
Starting structural reductions in LTL mode, iteration 1 : 306/306 places, 1531/1631 transitions.
Applied a total of 0 rules in 8 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 65294 ms. Remains : 306/306 places, 1531/1631 transitions.
Support contains 203 out of 306 places after structural reductions.
[2024-05-27 17:27:25] [INFO ] Flatten gal took : 236 ms
[2024-05-27 17:27:26] [INFO ] Flatten gal took : 214 ms
[2024-05-27 17:27:27] [INFO ] Input system was already deterministic with 1531 transitions.
Reduction of identical properties reduced properties to check from 30 to 25
RANDOM walk for 29424 steps (5 resets) in 1714 ms. (17 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 25 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-27 17:27:28] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 306 cols
[2024-05-27 17:27:28] [INFO ] Computed 45 invariants in 10 ms
[2024-05-27 17:27:29] [INFO ] Implicit Places using invariants in 1250 ms returned []
[2024-05-27 17:27:29] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 17:27:29] [INFO ] Invariant cache hit.
[2024-05-27 17:27:29] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 17:27:31] [INFO ] Implicit Places using invariants and state equation in 2246 ms returned []
Implicit Place search using SMT with State Equation took 3507 ms to find 0 implicit places.
Running 1521 sub problems to find dead transitions.
[2024-05-27 17:27:32] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 17:27:32] [INFO ] Invariant cache hit.
[2024-05-27 17:27:32] [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-05-27 17:27:45] [INFO ] Deduced a trap composed of 40 places in 197 ms of which 2 ms to minimize.
[2024-05-27 17:27:54] [INFO ] Deduced a trap composed of 49 places in 211 ms of which 2 ms to minimize.
[2024-05-27 17:27:54] [INFO ] Deduced a trap composed of 41 places in 221 ms of which 2 ms to minimize.
[2024-05-27 17:27:54] [INFO ] Deduced a trap composed of 41 places in 209 ms of which 2 ms to minimize.
[2024-05-27 17:27:57] [INFO ] Deduced a trap composed of 42 places in 224 ms of which 3 ms to minimize.
[2024-05-27 17:27:57] [INFO ] Deduced a trap composed of 41 places in 223 ms of which 2 ms to minimize.
[2024-05-27 17:27:57] [INFO ] Deduced a trap composed of 39 places in 205 ms of which 2 ms to minimize.
[2024-05-27 17:27:58] [INFO ] Deduced a trap composed of 41 places in 208 ms of which 2 ms to minimize.
[2024-05-27 17:27:58] [INFO ] Deduced a trap composed of 40 places in 200 ms of which 2 ms to minimize.
[2024-05-27 17:27:58] [INFO ] Deduced a trap composed of 41 places in 199 ms of which 2 ms to minimize.
[2024-05-27 17:27:58] [INFO ] Deduced a trap composed of 38 places in 200 ms of which 2 ms to minimize.
[2024-05-27 17:27:58] [INFO ] Deduced a trap composed of 35 places in 201 ms of which 2 ms to minimize.
[2024-05-27 17:27:59] [INFO ] Deduced a trap composed of 57 places in 137 ms of which 1 ms to minimize.
[2024-05-27 17:27:59] [INFO ] Deduced a trap composed of 41 places in 131 ms of which 2 ms to minimize.
[2024-05-27 17:27:59] [INFO ] Deduced a trap composed of 49 places in 117 ms of which 2 ms to minimize.
[2024-05-27 17:27:59] [INFO ] Deduced a trap composed of 49 places in 112 ms of which 4 ms to minimize.
[2024-05-27 17:27:59] [INFO ] Deduced a trap composed of 49 places in 104 ms of which 2 ms to minimize.
[2024-05-27 17:28:00] [INFO ] Deduced a trap composed of 51 places in 119 ms of which 1 ms to minimize.
[2024-05-27 17:28:00] [INFO ] Deduced a trap composed of 49 places in 109 ms of which 1 ms to minimize.
[2024-05-27 17:28:00] [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 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: 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-05-27 17:28:20] [INFO ] Deduced a trap composed of 21 places in 201 ms of which 2 ms to minimize.
[2024-05-27 17:28:20] [INFO ] Deduced a trap composed of 21 places in 210 ms of which 2 ms to minimize.
[2024-05-27 17:28:20] [INFO ] Deduced a trap composed of 30 places in 211 ms of which 2 ms to minimize.
[2024-05-27 17:28:20] [INFO ] Deduced a trap composed of 21 places in 207 ms of which 2 ms to minimize.
[2024-05-27 17:28:21] [INFO ] Deduced a trap composed of 31 places in 229 ms of which 2 ms to minimize.
[2024-05-27 17:28:21] [INFO ] Deduced a trap composed of 21 places in 223 ms of which 2 ms to minimize.
[2024-05-27 17:28:21] [INFO ] Deduced a trap composed of 34 places in 203 ms of which 2 ms to minimize.
[2024-05-27 17:28:21] [INFO ] Deduced a trap composed of 21 places in 206 ms of which 2 ms to minimize.
[2024-05-27 17:28:23] [INFO ] Deduced a trap composed of 57 places in 101 ms of which 1 ms to minimize.
[2024-05-27 17:28:23] [INFO ] Deduced a trap composed of 49 places in 100 ms of which 1 ms to minimize.
[2024-05-27 17:28:23] [INFO ] Deduced a trap composed of 41 places in 98 ms of which 1 ms to minimize.
[2024-05-27 17:28:24] [INFO ] Deduced a trap composed of 49 places in 146 ms of which 1 ms to minimize.
[2024-05-27 17:28:29] [INFO ] Deduced a trap composed of 35 places in 150 ms of which 1 ms to minimize.
[2024-05-27 17:28:29] [INFO ] Deduced a trap composed of 30 places in 216 ms of which 2 ms to minimize.
[2024-05-27 17:28:30] [INFO ] Deduced a trap composed of 41 places in 145 ms of which 2 ms to minimize.
[2024-05-27 17:28:30] [INFO ] Deduced a trap composed of 49 places in 146 ms of which 2 ms to minimize.
[2024-05-27 17:28:30] [INFO ] Deduced a trap composed of 49 places in 139 ms of which 2 ms to minimize.
[2024-05-27 17:28:33] [INFO ] Deduced a trap composed of 75 places in 209 ms of which 2 ms to minimize.
[2024-05-27 17:28:33] [INFO ] Deduced a trap composed of 84 places in 202 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 30048 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 63854ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 63870ms
Finished structural reductions in LTL mode , in 1 iterations and 67407 ms. Remains : 306/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 256 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 843 reset in 1162 ms.
Product exploration explored 100000 steps with 856 reset in 1048 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 141 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 87 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 484 steps (0 resets) in 15 ms. (30 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 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 69 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 94 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 215 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-27 17:28:39] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 17:28:39] [INFO ] Invariant cache hit.
[2024-05-27 17:28:40] [INFO ] Implicit Places using invariants in 1080 ms returned []
[2024-05-27 17:28:40] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 17:28:40] [INFO ] Invariant cache hit.
[2024-05-27 17:28:40] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 17:28:42] [INFO ] Implicit Places using invariants and state equation in 2239 ms returned []
Implicit Place search using SMT with State Equation took 3324 ms to find 0 implicit places.
[2024-05-27 17:28:42] [INFO ] Redundant transitions in 100 ms returned []
Running 1521 sub problems to find dead transitions.
[2024-05-27 17:28:42] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 17:28:42] [INFO ] Invariant cache hit.
[2024-05-27 17:28:42] [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-05-27 17:28:56] [INFO ] Deduced a trap composed of 40 places in 200 ms of which 2 ms to minimize.
[2024-05-27 17:29:05] [INFO ] Deduced a trap composed of 49 places in 215 ms of which 2 ms to minimize.
[2024-05-27 17:29:05] [INFO ] Deduced a trap composed of 41 places in 205 ms of which 2 ms to minimize.
[2024-05-27 17:29:06] [INFO ] Deduced a trap composed of 41 places in 224 ms of which 2 ms to minimize.
[2024-05-27 17:29:09] [INFO ] Deduced a trap composed of 42 places in 211 ms of which 2 ms to minimize.
[2024-05-27 17:29:09] [INFO ] Deduced a trap composed of 41 places in 208 ms of which 2 ms to minimize.
[2024-05-27 17:29:09] [INFO ] Deduced a trap composed of 39 places in 213 ms of which 2 ms to minimize.
[2024-05-27 17:29:09] [INFO ] Deduced a trap composed of 41 places in 208 ms of which 2 ms to minimize.
[2024-05-27 17:29:10] [INFO ] Deduced a trap composed of 40 places in 211 ms of which 2 ms to minimize.
[2024-05-27 17:29:10] [INFO ] Deduced a trap composed of 41 places in 206 ms of which 2 ms to minimize.
[2024-05-27 17:29:10] [INFO ] Deduced a trap composed of 38 places in 215 ms of which 1 ms to minimize.
[2024-05-27 17:29:10] [INFO ] Deduced a trap composed of 35 places in 228 ms of which 2 ms to minimize.
[2024-05-27 17:29:11] [INFO ] Deduced a trap composed of 57 places in 146 ms of which 1 ms to minimize.
[2024-05-27 17:29:11] [INFO ] Deduced a trap composed of 41 places in 141 ms of which 1 ms to minimize.
[2024-05-27 17:29:11] [INFO ] Deduced a trap composed of 49 places in 129 ms of which 1 ms to minimize.
[2024-05-27 17:29:11] [INFO ] Deduced a trap composed of 49 places in 109 ms of which 1 ms to minimize.
[2024-05-27 17:29:11] [INFO ] Deduced a trap composed of 49 places in 94 ms of which 1 ms to minimize.
[2024-05-27 17:29:11] [INFO ] Deduced a trap composed of 51 places in 112 ms of which 1 ms to minimize.
[2024-05-27 17:29:11] [INFO ] Deduced a trap composed of 49 places in 125 ms of which 1 ms to minimize.
[2024-05-27 17:29:12] [INFO ] Deduced a trap composed of 34 places in 220 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 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: 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-05-27 17:29:31] [INFO ] Deduced a trap composed of 21 places in 229 ms of which 5 ms to minimize.
[2024-05-27 17:29:31] [INFO ] Deduced a trap composed of 21 places in 203 ms of which 2 ms to minimize.
[2024-05-27 17:29:32] [INFO ] Deduced a trap composed of 30 places in 208 ms of which 2 ms to minimize.
[2024-05-27 17:29:32] [INFO ] Deduced a trap composed of 21 places in 212 ms of which 3 ms to minimize.
[2024-05-27 17:29:32] [INFO ] Deduced a trap composed of 31 places in 208 ms of which 2 ms to minimize.
[2024-05-27 17:29:32] [INFO ] Deduced a trap composed of 21 places in 204 ms of which 2 ms to minimize.
[2024-05-27 17:29:32] [INFO ] Deduced a trap composed of 34 places in 203 ms of which 2 ms to minimize.
[2024-05-27 17:29:33] [INFO ] Deduced a trap composed of 21 places in 205 ms of which 2 ms to minimize.
[2024-05-27 17:29:34] [INFO ] Deduced a trap composed of 57 places in 86 ms of which 2 ms to minimize.
[2024-05-27 17:29:34] [INFO ] Deduced a trap composed of 49 places in 84 ms of which 2 ms to minimize.
[2024-05-27 17:29:35] [INFO ] Deduced a trap composed of 41 places in 90 ms of which 1 ms to minimize.
[2024-05-27 17:29:35] [INFO ] Deduced a trap composed of 49 places in 142 ms of which 2 ms to minimize.
[2024-05-27 17:29:40] [INFO ] Deduced a trap composed of 35 places in 144 ms of which 2 ms to minimize.
[2024-05-27 17:29:40] [INFO ] Deduced a trap composed of 30 places in 218 ms of which 2 ms to minimize.
[2024-05-27 17:29:41] [INFO ] Deduced a trap composed of 41 places in 154 ms of which 2 ms to minimize.
[2024-05-27 17:29:41] [INFO ] Deduced a trap composed of 49 places in 125 ms of which 1 ms to minimize.
[2024-05-27 17:29:41] [INFO ] Deduced a trap composed of 49 places in 128 ms of which 2 ms to minimize.
[2024-05-27 17:29:44] [INFO ] Deduced a trap composed of 75 places in 192 ms of which 2 ms to minimize.
[2024-05-27 17:29:44] [INFO ] Deduced a trap composed of 84 places in 180 ms of which 1 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 30041 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 64076ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 64093ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 67748 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 122 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 282 steps (0 resets) in 12 ms. (21 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 173 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 62 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 861 reset in 931 ms.
Product exploration explored 100000 steps with 866 reset in 967 ms.
Built C files in :
/tmp/ltsmin15555502751895980774
[2024-05-27 17:29:49] [INFO ] Too many transitions (1531) to apply POR reductions. Disabling POR matrices.
[2024-05-27 17:29:49] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15555502751895980774
Running compilation step : cd /tmp/ltsmin15555502751895980774;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15555502751895980774;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15555502751895980774;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 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 130 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-27 17:29:52] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 17:29:52] [INFO ] Invariant cache hit.
[2024-05-27 17:29:53] [INFO ] Implicit Places using invariants in 1011 ms returned []
[2024-05-27 17:29:53] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 17:29:53] [INFO ] Invariant cache hit.
[2024-05-27 17:29:53] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 17:29:55] [INFO ] Implicit Places using invariants and state equation in 2277 ms returned []
Implicit Place search using SMT with State Equation took 3289 ms to find 0 implicit places.
[2024-05-27 17:29:55] [INFO ] Redundant transitions in 27 ms returned []
Running 1521 sub problems to find dead transitions.
[2024-05-27 17:29:55] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 17:29:55] [INFO ] Invariant cache hit.
[2024-05-27 17:29:55] [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-05-27 17:30:08] [INFO ] Deduced a trap composed of 40 places in 203 ms of which 2 ms to minimize.
[2024-05-27 17:30:18] [INFO ] Deduced a trap composed of 49 places in 203 ms of which 2 ms to minimize.
[2024-05-27 17:30:19] [INFO ] Deduced a trap composed of 41 places in 207 ms of which 2 ms to minimize.
[2024-05-27 17:30:19] [INFO ] Deduced a trap composed of 41 places in 209 ms of which 2 ms to minimize.
[2024-05-27 17:30:22] [INFO ] Deduced a trap composed of 42 places in 232 ms of which 3 ms to minimize.
[2024-05-27 17:30:22] [INFO ] Deduced a trap composed of 41 places in 206 ms of which 2 ms to minimize.
[2024-05-27 17:30:22] [INFO ] Deduced a trap composed of 39 places in 204 ms of which 2 ms to minimize.
[2024-05-27 17:30:22] [INFO ] Deduced a trap composed of 41 places in 205 ms of which 2 ms to minimize.
[2024-05-27 17:30:23] [INFO ] Deduced a trap composed of 40 places in 204 ms of which 1 ms to minimize.
[2024-05-27 17:30:23] [INFO ] Deduced a trap composed of 41 places in 219 ms of which 2 ms to minimize.
[2024-05-27 17:30:23] [INFO ] Deduced a trap composed of 38 places in 207 ms of which 2 ms to minimize.
[2024-05-27 17:30:23] [INFO ] Deduced a trap composed of 35 places in 204 ms of which 2 ms to minimize.
[2024-05-27 17:30:24] [INFO ] Deduced a trap composed of 57 places in 131 ms of which 1 ms to minimize.
[2024-05-27 17:30:24] [INFO ] Deduced a trap composed of 41 places in 135 ms of which 1 ms to minimize.
[2024-05-27 17:30:24] [INFO ] Deduced a trap composed of 49 places in 116 ms of which 1 ms to minimize.
[2024-05-27 17:30:24] [INFO ] Deduced a trap composed of 49 places in 111 ms of which 2 ms to minimize.
[2024-05-27 17:30:24] [INFO ] Deduced a trap composed of 49 places in 92 ms of which 2 ms to minimize.
[2024-05-27 17:30:24] [INFO ] Deduced a trap composed of 51 places in 116 ms of which 1 ms to minimize.
[2024-05-27 17:30:24] [INFO ] Deduced a trap composed of 49 places in 109 ms of which 2 ms to minimize.
[2024-05-27 17:30:25] [INFO ] Deduced a trap composed of 34 places in 225 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 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: 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-05-27 17:30:44] [INFO ] Deduced a trap composed of 21 places in 206 ms of which 2 ms to minimize.
[2024-05-27 17:30:44] [INFO ] Deduced a trap composed of 21 places in 207 ms of which 2 ms to minimize.
[2024-05-27 17:30:44] [INFO ] Deduced a trap composed of 30 places in 204 ms of which 2 ms to minimize.
[2024-05-27 17:30:44] [INFO ] Deduced a trap composed of 21 places in 224 ms of which 2 ms to minimize.
[2024-05-27 17:30:45] [INFO ] Deduced a trap composed of 31 places in 234 ms of which 4 ms to minimize.
[2024-05-27 17:30:45] [INFO ] Deduced a trap composed of 21 places in 221 ms of which 2 ms to minimize.
[2024-05-27 17:30:45] [INFO ] Deduced a trap composed of 34 places in 224 ms of which 1 ms to minimize.
[2024-05-27 17:30:45] [INFO ] Deduced a trap composed of 21 places in 223 ms of which 1 ms to minimize.
[2024-05-27 17:30:47] [INFO ] Deduced a trap composed of 57 places in 99 ms of which 1 ms to minimize.
[2024-05-27 17:30:47] [INFO ] Deduced a trap composed of 49 places in 96 ms of which 1 ms to minimize.
[2024-05-27 17:30:47] [INFO ] Deduced a trap composed of 41 places in 90 ms of which 1 ms to minimize.
[2024-05-27 17:30:48] [INFO ] Deduced a trap composed of 49 places in 135 ms of which 1 ms to minimize.
[2024-05-27 17:30:53] [INFO ] Deduced a trap composed of 35 places in 163 ms of which 2 ms to minimize.
[2024-05-27 17:30:53] [INFO ] Deduced a trap composed of 30 places in 216 ms of which 2 ms to minimize.
[2024-05-27 17:30:54] [INFO ] Deduced a trap composed of 41 places in 147 ms of which 2 ms to minimize.
[2024-05-27 17:30:54] [INFO ] Deduced a trap composed of 49 places in 143 ms of which 2 ms to minimize.
[2024-05-27 17:30:54] [INFO ] Deduced a trap composed of 49 places in 140 ms of which 2 ms to minimize.
[2024-05-27 17:30:57] [INFO ] Deduced a trap composed of 75 places in 196 ms of which 2 ms to minimize.
[2024-05-27 17:30:57] [INFO ] Deduced a trap composed of 84 places in 191 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 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: 0/1521 constraints, Known Traps: 39/39 constraints]
After SMT, in 63379ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 63395ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 66851 ms. Remains : 306/306 places, 1531/1531 transitions.
Built C files in :
/tmp/ltsmin703249192833462166
[2024-05-27 17:30:59] [INFO ] Too many transitions (1531) to apply POR reductions. Disabling POR matrices.
[2024-05-27 17:30:59] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin703249192833462166
Running compilation step : cd /tmp/ltsmin703249192833462166;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin703249192833462166;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin703249192833462166;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-27 17:31:02] [INFO ] Flatten gal took : 83 ms
[2024-05-27 17:31:02] [INFO ] Flatten gal took : 78 ms
[2024-05-27 17:31:02] [INFO ] Time to serialize gal into /tmp/LTL16371019612088833632.gal : 19 ms
[2024-05-27 17:31:02] [INFO ] Time to serialize properties into /tmp/LTL3596867955211923469.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16371019612088833632.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14001729470303097586.hoa' '-atoms' '/tmp/LTL3596867955211923469.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL3596867955211923469.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14001729470303097586.hoa
Detected timeout of ITS tools.
[2024-05-27 17:31:18] [INFO ] Flatten gal took : 65 ms
[2024-05-27 17:31:18] [INFO ] Flatten gal took : 64 ms
[2024-05-27 17:31:18] [INFO ] Time to serialize gal into /tmp/LTL6944220746375792461.gal : 15 ms
[2024-05-27 17:31:18] [INFO ] Time to serialize properties into /tmp/LTL5633074011008523499.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6944220746375792461.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5633074011008523499.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(G((F("(((((((((PMC_7==0)||(wait_cable_7==0))&&((PMC_10==0)||(wait_cable_10==0)))&&(((PMC_1==0)||(wait_cable_1==0))&&((PMC_8==0)||...6700
Formula 0 simplified : XF(!"(((((((((RMC_3==0)||(wait_cable_3==0))&&((RMC_7==0)||(wait_cable_7==0)))&&(((RMC_1==0)||(wait_cable_1==0))&&((RMC_5==0)||(wait_...6692
Detected timeout of ITS tools.
[2024-05-27 17:31:33] [INFO ] Flatten gal took : 58 ms
[2024-05-27 17:31:33] [INFO ] Applying decomposition
[2024-05-27 17:31:33] [INFO ] Flatten gal took : 59 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17456466907529363538.txt' '-o' '/tmp/graph17456466907529363538.bin' '-w' '/tmp/graph17456466907529363538.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17456466907529363538.bin' '-l' '-1' '-v' '-w' '/tmp/graph17456466907529363538.weights' '-q' '0' '-e' '0.001'
[2024-05-27 17:31:33] [INFO ] Decomposing Gal with order
[2024-05-27 17:31:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 17:31:33] [INFO ] Removed a total of 2413 redundant transitions.
[2024-05-27 17:31:34] [INFO ] Flatten gal took : 496 ms
[2024-05-27 17:31:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 992 labels/synchronizations in 62 ms.
[2024-05-27 17:31:34] [INFO ] Time to serialize gal into /tmp/LTL876202033974331563.gal : 11 ms
[2024-05-27 17:31:34] [INFO ] Time to serialize properties into /tmp/LTL11420204542620663147.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL876202033974331563.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11420204542620663147.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(G((F("(((((((((i0.i0.u1.PMC_7==0)||(i0.i1.u8.wait_cable_7==0))&&((i0.i0.u1.PMC_10==0)||(i0.i0.u1.wait_cable_10==0)))&&(((i0.i0.u1...10339
Formula 0 simplified : XF(!"(((((((((i3.u6.RMC_3==0)||(i0.i1.u15.wait_cable_3==0))&&((i3.u6.RMC_7==0)||(i0.i1.u8.wait_cable_7==0)))&&(((i3.u6.RMC_1==0)||(i...10331
Detected timeout of ITS tools.
Treatment of property SafeBus-PT-10-LTLFireability-00 finished in 260827 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 13 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-27 17:31:49] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 17:31:49] [INFO ] Invariant cache hit.
[2024-05-27 17:31:50] [INFO ] Implicit Places using invariants in 763 ms returned [266, 267, 268, 269, 270, 271, 272, 273, 274, 275]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 769 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 9 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 791 ms. Remains : 296/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 268 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 404 ms.
Product exploration explored 100000 steps with 33333 reset in 390 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 18 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 1906 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 15 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-27 17:31:51] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 17:31:51] [INFO ] Invariant cache hit.
[2024-05-27 17:31:52] [INFO ] Implicit Places using invariants in 1154 ms returned []
[2024-05-27 17:31:52] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 17:31:52] [INFO ] Invariant cache hit.
[2024-05-27 17:31:52] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 17:31:54] [INFO ] Implicit Places using invariants and state equation in 2534 ms returned []
Implicit Place search using SMT with State Equation took 3692 ms to find 0 implicit places.
Running 1521 sub problems to find dead transitions.
[2024-05-27 17:31:54] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 17:31:54] [INFO ] Invariant cache hit.
[2024-05-27 17:31:54] [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-05-27 17:32:08] [INFO ] Deduced a trap composed of 40 places in 221 ms of which 3 ms to minimize.
[2024-05-27 17:32:17] [INFO ] Deduced a trap composed of 49 places in 203 ms of which 2 ms to minimize.
[2024-05-27 17:32:17] [INFO ] Deduced a trap composed of 41 places in 196 ms of which 2 ms to minimize.
[2024-05-27 17:32:18] [INFO ] Deduced a trap composed of 41 places in 196 ms of which 2 ms to minimize.
[2024-05-27 17:32:20] [INFO ] Deduced a trap composed of 42 places in 212 ms of which 2 ms to minimize.
[2024-05-27 17:32:21] [INFO ] Deduced a trap composed of 41 places in 202 ms of which 2 ms to minimize.
[2024-05-27 17:32:21] [INFO ] Deduced a trap composed of 39 places in 205 ms of which 2 ms to minimize.
[2024-05-27 17:32:21] [INFO ] Deduced a trap composed of 41 places in 208 ms of which 2 ms to minimize.
[2024-05-27 17:32:21] [INFO ] Deduced a trap composed of 40 places in 208 ms of which 2 ms to minimize.
[2024-05-27 17:32:22] [INFO ] Deduced a trap composed of 41 places in 206 ms of which 2 ms to minimize.
[2024-05-27 17:32:22] [INFO ] Deduced a trap composed of 38 places in 217 ms of which 3 ms to minimize.
[2024-05-27 17:32:22] [INFO ] Deduced a trap composed of 35 places in 202 ms of which 2 ms to minimize.
[2024-05-27 17:32:22] [INFO ] Deduced a trap composed of 57 places in 136 ms of which 2 ms to minimize.
[2024-05-27 17:32:22] [INFO ] Deduced a trap composed of 41 places in 133 ms of which 1 ms to minimize.
[2024-05-27 17:32:23] [INFO ] Deduced a trap composed of 49 places in 115 ms of which 1 ms to minimize.
[2024-05-27 17:32:23] [INFO ] Deduced a trap composed of 49 places in 107 ms of which 1 ms to minimize.
[2024-05-27 17:32:23] [INFO ] Deduced a trap composed of 49 places in 92 ms of which 1 ms to minimize.
[2024-05-27 17:32:23] [INFO ] Deduced a trap composed of 51 places in 103 ms of which 2 ms to minimize.
[2024-05-27 17:32:23] [INFO ] Deduced a trap composed of 49 places in 106 ms of which 2 ms to minimize.
[2024-05-27 17:32:23] [INFO ] Deduced a trap composed of 34 places in 215 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-05-27 17:32:43] [INFO ] Deduced a trap composed of 21 places in 210 ms of which 2 ms to minimize.
[2024-05-27 17:32:43] [INFO ] Deduced a trap composed of 21 places in 220 ms of which 2 ms to minimize.
[2024-05-27 17:32:43] [INFO ] Deduced a trap composed of 30 places in 215 ms of which 2 ms to minimize.
[2024-05-27 17:32:44] [INFO ] Deduced a trap composed of 21 places in 204 ms of which 2 ms to minimize.
[2024-05-27 17:32:44] [INFO ] Deduced a trap composed of 31 places in 203 ms of which 2 ms to minimize.
[2024-05-27 17:32:44] [INFO ] Deduced a trap composed of 21 places in 213 ms of which 2 ms to minimize.
[2024-05-27 17:32:44] [INFO ] Deduced a trap composed of 34 places in 215 ms of which 2 ms to minimize.
[2024-05-27 17:32:45] [INFO ] Deduced a trap composed of 21 places in 222 ms of which 2 ms to minimize.
[2024-05-27 17:32:46] [INFO ] Deduced a trap composed of 57 places in 86 ms of which 1 ms to minimize.
[2024-05-27 17:32:47] [INFO ] Deduced a trap composed of 49 places in 92 ms of which 1 ms to minimize.
[2024-05-27 17:32:47] [INFO ] Deduced a trap composed of 41 places in 89 ms of which 1 ms to minimize.
[2024-05-27 17:32:47] [INFO ] Deduced a trap composed of 49 places in 138 ms of which 2 ms to minimize.
[2024-05-27 17:32:52] [INFO ] Deduced a trap composed of 35 places in 145 ms of which 2 ms to minimize.
[2024-05-27 17:32:53] [INFO ] Deduced a trap composed of 30 places in 217 ms of which 2 ms to minimize.
[2024-05-27 17:32:53] [INFO ] Deduced a trap composed of 41 places in 156 ms of which 2 ms to minimize.
[2024-05-27 17:32:53] [INFO ] Deduced a trap composed of 49 places in 130 ms of which 2 ms to minimize.
[2024-05-27 17:32:53] [INFO ] Deduced a trap composed of 49 places in 123 ms of which 2 ms to minimize.
[2024-05-27 17:32:56] [INFO ] Deduced a trap composed of 75 places in 193 ms of which 2 ms to minimize.
[2024-05-27 17:32:57] [INFO ] Deduced a trap composed of 84 places in 199 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 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: 0/1521 constraints, Known Traps: 39/39 constraints]
After SMT, in 64012ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 64030ms
Finished structural reductions in LTL mode , in 1 iterations and 67745 ms. Remains : 306/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 89 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 9 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 67852 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 9 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-27 17:32:59] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 17:32:59] [INFO ] Invariant cache hit.
[2024-05-27 17:32:59] [INFO ] Implicit Places using invariants in 809 ms returned []
[2024-05-27 17:32:59] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 17:32:59] [INFO ] Invariant cache hit.
[2024-05-27 17:33:00] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 17:33:01] [INFO ] Implicit Places using invariants and state equation in 2042 ms returned []
Implicit Place search using SMT with State Equation took 2857 ms to find 0 implicit places.
Running 1521 sub problems to find dead transitions.
[2024-05-27 17:33:01] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 17:33:01] [INFO ] Invariant cache hit.
[2024-05-27 17:33:01] [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-05-27 17:33:15] [INFO ] Deduced a trap composed of 40 places in 319 ms of which 2 ms to minimize.
[2024-05-27 17:33:26] [INFO ] Deduced a trap composed of 49 places in 197 ms of which 2 ms to minimize.
[2024-05-27 17:33:26] [INFO ] Deduced a trap composed of 41 places in 208 ms of which 2 ms to minimize.
[2024-05-27 17:33:26] [INFO ] Deduced a trap composed of 41 places in 205 ms of which 2 ms to minimize.
[2024-05-27 17:33:29] [INFO ] Deduced a trap composed of 42 places in 212 ms of which 2 ms to minimize.
[2024-05-27 17:33:29] [INFO ] Deduced a trap composed of 41 places in 208 ms of which 2 ms to minimize.
[2024-05-27 17:33:30] [INFO ] Deduced a trap composed of 39 places in 216 ms of which 2 ms to minimize.
[2024-05-27 17:33:30] [INFO ] Deduced a trap composed of 41 places in 208 ms of which 2 ms to minimize.
[2024-05-27 17:33:30] [INFO ] Deduced a trap composed of 40 places in 210 ms of which 2 ms to minimize.
[2024-05-27 17:33:30] [INFO ] Deduced a trap composed of 41 places in 215 ms of which 2 ms to minimize.
[2024-05-27 17:33:31] [INFO ] Deduced a trap composed of 38 places in 204 ms of which 2 ms to minimize.
[2024-05-27 17:33:31] [INFO ] Deduced a trap composed of 35 places in 198 ms of which 2 ms to minimize.
[2024-05-27 17:33:31] [INFO ] Deduced a trap composed of 57 places in 138 ms of which 2 ms to minimize.
[2024-05-27 17:33:31] [INFO ] Deduced a trap composed of 41 places in 136 ms of which 2 ms to minimize.
[2024-05-27 17:33:31] [INFO ] Deduced a trap composed of 49 places in 117 ms of which 2 ms to minimize.
[2024-05-27 17:33:31] [INFO ] Deduced a trap composed of 49 places in 109 ms of which 1 ms to minimize.
[2024-05-27 17:33:32] [INFO ] Deduced a trap composed of 49 places in 91 ms of which 1 ms to minimize.
[2024-05-27 17:33:32] [INFO ] Deduced a trap composed of 51 places in 109 ms of which 1 ms to minimize.
[2024-05-27 17:33:32] [INFO ] Deduced a trap composed of 49 places in 101 ms of which 2 ms to minimize.
[2024-05-27 17:33:32] [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 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: 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-05-27 17:33:51] [INFO ] Deduced a trap composed of 21 places in 217 ms of which 2 ms to minimize.
[2024-05-27 17:33:51] [INFO ] Deduced a trap composed of 21 places in 214 ms of which 2 ms to minimize.
[2024-05-27 17:33:51] [INFO ] Deduced a trap composed of 30 places in 211 ms of which 2 ms to minimize.
[2024-05-27 17:33:52] [INFO ] Deduced a trap composed of 21 places in 227 ms of which 2 ms to minimize.
[2024-05-27 17:33:52] [INFO ] Deduced a trap composed of 31 places in 209 ms of which 2 ms to minimize.
[2024-05-27 17:33:52] [INFO ] Deduced a trap composed of 21 places in 205 ms of which 2 ms to minimize.
[2024-05-27 17:33:52] [INFO ] Deduced a trap composed of 34 places in 201 ms of which 2 ms to minimize.
[2024-05-27 17:33:53] [INFO ] Deduced a trap composed of 21 places in 209 ms of which 2 ms to minimize.
[2024-05-27 17:33:54] [INFO ] Deduced a trap composed of 57 places in 93 ms of which 2 ms to minimize.
[2024-05-27 17:33:54] [INFO ] Deduced a trap composed of 49 places in 93 ms of which 1 ms to minimize.
[2024-05-27 17:33:55] [INFO ] Deduced a trap composed of 41 places in 94 ms of which 1 ms to minimize.
[2024-05-27 17:33:55] [INFO ] Deduced a trap composed of 49 places in 137 ms of which 1 ms to minimize.
[2024-05-27 17:34:00] [INFO ] Deduced a trap composed of 35 places in 149 ms of which 2 ms to minimize.
[2024-05-27 17:34:01] [INFO ] Deduced a trap composed of 30 places in 214 ms of which 3 ms to minimize.
[2024-05-27 17:34:01] [INFO ] Deduced a trap composed of 41 places in 144 ms of which 2 ms to minimize.
[2024-05-27 17:34:01] [INFO ] Deduced a trap composed of 49 places in 137 ms of which 1 ms to minimize.
[2024-05-27 17:34:01] [INFO ] Deduced a trap composed of 49 places in 123 ms of which 2 ms to minimize.
[2024-05-27 17:34:04] [INFO ] Deduced a trap composed of 75 places in 195 ms of which 2 ms to minimize.
[2024-05-27 17:34:05] [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 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: 0/1521 constraints, Known Traps: 39/39 constraints]
After SMT, in 64286ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 64301ms
Finished structural reductions in LTL mode , in 1 iterations and 67171 ms. Remains : 306/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 147 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 571 ms.
Stack based approach found an accepted trace after 820 steps with 0 reset with depth 821 and stack size 821 in 15 ms.
FORMULA SafeBus-PT-10-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property SafeBus-PT-10-LTLFireability-03 finished in 67936 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 7 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-27 17:34:06] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 17:34:06] [INFO ] Invariant cache hit.
[2024-05-27 17:34:07] [INFO ] Implicit Places using invariants in 628 ms returned []
[2024-05-27 17:34:07] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 17:34:07] [INFO ] Invariant cache hit.
[2024-05-27 17:34:07] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 17:34:09] [INFO ] Implicit Places using invariants and state equation in 1489 ms returned []
Implicit Place search using SMT with State Equation took 2119 ms to find 0 implicit places.
Running 1521 sub problems to find dead transitions.
[2024-05-27 17:34:09] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 17:34:09] [INFO ] Invariant cache hit.
[2024-05-27 17:34:09] [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-05-27 17:34:22] [INFO ] Deduced a trap composed of 40 places in 199 ms of which 1 ms to minimize.
[2024-05-27 17:34:32] [INFO ] Deduced a trap composed of 49 places in 199 ms of which 2 ms to minimize.
[2024-05-27 17:34:32] [INFO ] Deduced a trap composed of 41 places in 216 ms of which 2 ms to minimize.
[2024-05-27 17:34:32] [INFO ] Deduced a trap composed of 41 places in 208 ms of which 2 ms to minimize.
[2024-05-27 17:34:35] [INFO ] Deduced a trap composed of 42 places in 197 ms of which 2 ms to minimize.
[2024-05-27 17:34:35] [INFO ] Deduced a trap composed of 41 places in 206 ms of which 2 ms to minimize.
[2024-05-27 17:34:35] [INFO ] Deduced a trap composed of 39 places in 202 ms of which 2 ms to minimize.
[2024-05-27 17:34:36] [INFO ] Deduced a trap composed of 41 places in 204 ms of which 2 ms to minimize.
[2024-05-27 17:34:36] [INFO ] Deduced a trap composed of 40 places in 207 ms of which 2 ms to minimize.
[2024-05-27 17:34:36] [INFO ] Deduced a trap composed of 41 places in 208 ms of which 2 ms to minimize.
[2024-05-27 17:34:36] [INFO ] Deduced a trap composed of 38 places in 205 ms of which 2 ms to minimize.
[2024-05-27 17:34:36] [INFO ] Deduced a trap composed of 35 places in 202 ms of which 2 ms to minimize.
[2024-05-27 17:34:37] [INFO ] Deduced a trap composed of 57 places in 143 ms of which 2 ms to minimize.
[2024-05-27 17:34:37] [INFO ] Deduced a trap composed of 41 places in 133 ms of which 1 ms to minimize.
[2024-05-27 17:34:37] [INFO ] Deduced a trap composed of 49 places in 119 ms of which 1 ms to minimize.
[2024-05-27 17:34:37] [INFO ] Deduced a trap composed of 49 places in 113 ms of which 1 ms to minimize.
[2024-05-27 17:34:37] [INFO ] Deduced a trap composed of 49 places in 93 ms of which 1 ms to minimize.
[2024-05-27 17:34:38] [INFO ] Deduced a trap composed of 51 places in 118 ms of which 1 ms to minimize.
[2024-05-27 17:34:38] [INFO ] Deduced a trap composed of 49 places in 105 ms of which 1 ms to minimize.
[2024-05-27 17:34:38] [INFO ] Deduced a trap composed of 34 places in 216 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 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-05-27 17:34:57] [INFO ] Deduced a trap composed of 21 places in 217 ms of which 4 ms to minimize.
[2024-05-27 17:34:58] [INFO ] Deduced a trap composed of 21 places in 204 ms of which 2 ms to minimize.
[2024-05-27 17:34:58] [INFO ] Deduced a trap composed of 30 places in 221 ms of which 2 ms to minimize.
[2024-05-27 17:34:58] [INFO ] Deduced a trap composed of 21 places in 198 ms of which 2 ms to minimize.
[2024-05-27 17:34:58] [INFO ] Deduced a trap composed of 31 places in 209 ms of which 2 ms to minimize.
[2024-05-27 17:34:59] [INFO ] Deduced a trap composed of 21 places in 214 ms of which 2 ms to minimize.
[2024-05-27 17:34:59] [INFO ] Deduced a trap composed of 34 places in 208 ms of which 2 ms to minimize.
[2024-05-27 17:34:59] [INFO ] Deduced a trap composed of 21 places in 204 ms of which 2 ms to minimize.
[2024-05-27 17:35:01] [INFO ] Deduced a trap composed of 57 places in 88 ms of which 1 ms to minimize.
[2024-05-27 17:35:01] [INFO ] Deduced a trap composed of 49 places in 89 ms of which 2 ms to minimize.
[2024-05-27 17:35:01] [INFO ] Deduced a trap composed of 41 places in 101 ms of which 1 ms to minimize.
[2024-05-27 17:35:01] [INFO ] Deduced a trap composed of 49 places in 134 ms of which 2 ms to minimize.
[2024-05-27 17:35:06] [INFO ] Deduced a trap composed of 35 places in 146 ms of which 1 ms to minimize.
[2024-05-27 17:35:07] [INFO ] Deduced a trap composed of 30 places in 211 ms of which 1 ms to minimize.
[2024-05-27 17:35:07] [INFO ] Deduced a trap composed of 41 places in 148 ms of which 2 ms to minimize.
[2024-05-27 17:35:07] [INFO ] Deduced a trap composed of 49 places in 120 ms of which 2 ms to minimize.
[2024-05-27 17:35:07] [INFO ] Deduced a trap composed of 49 places in 122 ms of which 1 ms to minimize.
[2024-05-27 17:35:10] [INFO ] Deduced a trap composed of 75 places in 200 ms of which 1 ms to minimize.
[2024-05-27 17:35:11] [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 30040 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 64019ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 64036ms
Finished structural reductions in LTL mode , in 1 iterations and 66169 ms. Remains : 306/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 231 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 66428 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 5 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-27 17:35:13] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 17:35:13] [INFO ] Invariant cache hit.
[2024-05-27 17:35:13] [INFO ] Implicit Places using invariants in 245 ms returned [266, 267, 268, 269, 270, 271, 272, 273, 274, 275]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 247 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 258 ms. Remains : 296/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 69 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 8 steps with 0 reset in 2 ms.
FORMULA SafeBus-PT-10-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SafeBus-PT-10-LTLFireability-06 finished in 357 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 7 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-27 17:35:13] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 17:35:13] [INFO ] Invariant cache hit.
[2024-05-27 17:35:13] [INFO ] Implicit Places using invariants in 220 ms returned []
[2024-05-27 17:35:13] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 17:35:13] [INFO ] Invariant cache hit.
[2024-05-27 17:35:14] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 17:35:14] [INFO ] Implicit Places using invariants and state equation in 980 ms returned []
Implicit Place search using SMT with State Equation took 1202 ms to find 0 implicit places.
Running 1521 sub problems to find dead transitions.
[2024-05-27 17:35:14] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 17:35:14] [INFO ] Invariant cache hit.
[2024-05-27 17:35:14] [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-05-27 17:35:28] [INFO ] Deduced a trap composed of 40 places in 206 ms of which 2 ms to minimize.
[2024-05-27 17:35:37] [INFO ] Deduced a trap composed of 49 places in 216 ms of which 2 ms to minimize.
[2024-05-27 17:35:37] [INFO ] Deduced a trap composed of 41 places in 228 ms of which 2 ms to minimize.
[2024-05-27 17:35:38] [INFO ] Deduced a trap composed of 41 places in 229 ms of which 2 ms to minimize.
[2024-05-27 17:35:41] [INFO ] Deduced a trap composed of 42 places in 234 ms of which 2 ms to minimize.
[2024-05-27 17:35:41] [INFO ] Deduced a trap composed of 41 places in 206 ms of which 2 ms to minimize.
[2024-05-27 17:35:41] [INFO ] Deduced a trap composed of 39 places in 232 ms of which 2 ms to minimize.
[2024-05-27 17:35:42] [INFO ] Deduced a trap composed of 41 places in 230 ms of which 2 ms to minimize.
[2024-05-27 17:35:42] [INFO ] Deduced a trap composed of 40 places in 229 ms of which 2 ms to minimize.
[2024-05-27 17:35:42] [INFO ] Deduced a trap composed of 41 places in 233 ms of which 2 ms to minimize.
[2024-05-27 17:35:42] [INFO ] Deduced a trap composed of 38 places in 235 ms of which 2 ms to minimize.
[2024-05-27 17:35:43] [INFO ] Deduced a trap composed of 35 places in 230 ms of which 2 ms to minimize.
[2024-05-27 17:35:43] [INFO ] Deduced a trap composed of 57 places in 148 ms of which 2 ms to minimize.
[2024-05-27 17:35:43] [INFO ] Deduced a trap composed of 41 places in 150 ms of which 2 ms to minimize.
[2024-05-27 17:35:43] [INFO ] Deduced a trap composed of 49 places in 120 ms of which 2 ms to minimize.
[2024-05-27 17:35:43] [INFO ] Deduced a trap composed of 49 places in 107 ms of which 1 ms to minimize.
[2024-05-27 17:35:44] [INFO ] Deduced a trap composed of 49 places in 94 ms of which 2 ms to minimize.
[2024-05-27 17:35:44] [INFO ] Deduced a trap composed of 51 places in 131 ms of which 1 ms to minimize.
[2024-05-27 17:35:44] [INFO ] Deduced a trap composed of 49 places in 121 ms of which 2 ms to minimize.
[2024-05-27 17:35:44] [INFO ] Deduced a trap composed of 34 places in 242 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-05-27 17:36:03] [INFO ] Deduced a trap composed of 21 places in 212 ms of which 2 ms to minimize.
[2024-05-27 17:36:04] [INFO ] Deduced a trap composed of 21 places in 213 ms of which 2 ms to minimize.
[2024-05-27 17:36:04] [INFO ] Deduced a trap composed of 30 places in 204 ms of which 2 ms to minimize.
[2024-05-27 17:36:04] [INFO ] Deduced a trap composed of 21 places in 204 ms of which 2 ms to minimize.
[2024-05-27 17:36:04] [INFO ] Deduced a trap composed of 31 places in 210 ms of which 2 ms to minimize.
[2024-05-27 17:36:05] [INFO ] Deduced a trap composed of 21 places in 208 ms of which 2 ms to minimize.
[2024-05-27 17:36:05] [INFO ] Deduced a trap composed of 34 places in 203 ms of which 2 ms to minimize.
[2024-05-27 17:36:05] [INFO ] Deduced a trap composed of 21 places in 206 ms of which 2 ms to minimize.
[2024-05-27 17:36:07] [INFO ] Deduced a trap composed of 57 places in 94 ms of which 1 ms to minimize.
[2024-05-27 17:36:07] [INFO ] Deduced a trap composed of 49 places in 89 ms of which 1 ms to minimize.
[2024-05-27 17:36:07] [INFO ] Deduced a trap composed of 41 places in 94 ms of which 1 ms to minimize.
[2024-05-27 17:36:07] [INFO ] Deduced a trap composed of 49 places in 130 ms of which 2 ms to minimize.
[2024-05-27 17:36:13] [INFO ] Deduced a trap composed of 35 places in 152 ms of which 2 ms to minimize.
[2024-05-27 17:36:13] [INFO ] Deduced a trap composed of 30 places in 202 ms of which 2 ms to minimize.
[2024-05-27 17:36:13] [INFO ] Deduced a trap composed of 41 places in 148 ms of which 1 ms to minimize.
[2024-05-27 17:36:13] [INFO ] Deduced a trap composed of 49 places in 129 ms of which 2 ms to minimize.
[2024-05-27 17:36:14] [INFO ] Deduced a trap composed of 49 places in 127 ms of which 2 ms to minimize.
[2024-05-27 17:36:16] [INFO ] Deduced a trap composed of 75 places in 193 ms of which 2 ms to minimize.
[2024-05-27 17:36:17] [INFO ] Deduced a trap composed of 84 places in 253 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 30041 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 63979ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 63996ms
Finished structural reductions in LTL mode , in 1 iterations and 65211 ms. Remains : 306/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 235 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 1 ms.
FORMULA SafeBus-PT-10-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SafeBus-PT-10-LTLFireability-07 finished in 65486 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 13 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-27 17:36:19] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 17:36:19] [INFO ] Invariant cache hit.
[2024-05-27 17:36:20] [INFO ] Implicit Places using invariants in 1065 ms returned [266, 267, 268, 269, 270, 271, 272, 273, 274, 275]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 1066 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 1086 ms. Remains : 296/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 243 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 1346 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 144 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-27 17:36:20] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 17:36:20] [INFO ] Invariant cache hit.
[2024-05-27 17:36:21] [INFO ] Implicit Places using invariants in 1208 ms returned [266, 267, 268, 270, 271, 272, 273, 274, 275]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 1212 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 0 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 163 ms. Remains 288 /297 variables (removed 9) and now considering 1522/1531 (removed 9) transitions.
[2024-05-27 17:36:22] [INFO ] Flow matrix only has 633 transitions (discarded 889 similar events)
// Phase 1: matrix 633 rows 288 cols
[2024-05-27 17:36:22] [INFO ] Computed 36 invariants in 12 ms
[2024-05-27 17:36:23] [INFO ] Implicit Places using invariants in 1120 ms returned []
[2024-05-27 17:36:23] [INFO ] Flow matrix only has 633 transitions (discarded 889 similar events)
[2024-05-27 17:36:23] [INFO ] Invariant cache hit.
[2024-05-27 17:36:23] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 17:36:25] [INFO ] Implicit Places using invariants and state equation in 2006 ms returned []
Implicit Place search using SMT with State Equation took 3133 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 4653 ms. Remains : 288/306 places, 1522/1531 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : SafeBus-PT-10-LTLFireability-09
Product exploration explored 100000 steps with 555 reset in 491 ms.
Stack based approach found an accepted trace after 170 steps with 0 reset with depth 171 and stack size 171 in 1 ms.
FORMULA SafeBus-PT-10-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property SafeBus-PT-10-LTLFireability-09 finished in 5200 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 22 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-27 17:36:25] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 306 cols
[2024-05-27 17:36:25] [INFO ] Computed 45 invariants in 9 ms
[2024-05-27 17:36:26] [INFO ] Implicit Places using invariants in 1195 ms returned [267, 268, 269, 270, 271, 272, 273, 274, 275]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 1198 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 13 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 1235 ms. Remains : 297/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 145 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 1400 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 97 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-27 17:36:27] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 17:36:27] [INFO ] Invariant cache hit.
[2024-05-27 17:36:28] [INFO ] Implicit Places using invariants in 1296 ms returned [266, 267, 268, 269, 270, 271, 272, 273, 274, 275]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 1297 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 2 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 92 ms. Remains 286 /296 variables (removed 10) and now considering 1521/1531 (removed 10) transitions.
[2024-05-27 17:36:28] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
// Phase 1: matrix 632 rows 286 cols
[2024-05-27 17:36:28] [INFO ] Computed 35 invariants in 6 ms
[2024-05-27 17:36:29] [INFO ] Implicit Places using invariants in 1039 ms returned []
[2024-05-27 17:36:29] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2024-05-27 17:36:29] [INFO ] Invariant cache hit.
[2024-05-27 17:36:29] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 17:36:31] [INFO ] Implicit Places using invariants and state equation in 2224 ms returned []
Implicit Place search using SMT with State Equation took 3267 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 4756 ms. Remains : 286/306 places, 1521/1531 transitions.
Stuttering acceptance computed with spot in 77 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 512 ms.
Stack based approach found an accepted trace after 810 steps with 0 reset with depth 811 and stack size 810 in 5 ms.
FORMULA SafeBus-PT-10-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property SafeBus-PT-10-LTLFireability-11 finished in 5367 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 9 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-27 17:36:32] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 306 cols
[2024-05-27 17:36:32] [INFO ] Computed 45 invariants in 10 ms
[2024-05-27 17:36:33] [INFO ] Implicit Places using invariants in 1083 ms returned [266, 267, 268, 269, 270, 271, 272, 273, 274, 275]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 1085 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 1100 ms. Remains : 296/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 156 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 467 ms.
Product exploration explored 100000 steps with 366 reset in 476 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 128 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 146 ms :[(AND p0 p1), p0, (AND p0 p1), (AND p0 p1)]
RANDOM walk for 40000 steps (8 resets) in 527 ms. (75 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 1/1 properties
[2024-05-27 17:36:35] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 296 cols
[2024-05-27 17:36:35] [INFO ] Computed 35 invariants in 21 ms
[2024-05-27 17:36:35] [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 459 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 103 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 624ms 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 405 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 148 ms :[(AND p0 p1), p0, (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 167 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 5 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-27 17:36:36] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 17:36:36] [INFO ] Invariant cache hit.
[2024-05-27 17:36:37] [INFO ] Implicit Places using invariants in 927 ms returned []
[2024-05-27 17:36:37] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 17:36:37] [INFO ] Invariant cache hit.
[2024-05-27 17:36:37] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 17:36:39] [INFO ] Implicit Places using invariants and state equation in 2155 ms returned []
Implicit Place search using SMT with State Equation took 3092 ms to find 0 implicit places.
Running 1521 sub problems to find dead transitions.
[2024-05-27 17:36:39] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 17:36:39] [INFO ] Invariant cache hit.
[2024-05-27 17:36:39] [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-05-27 17:36:52] [INFO ] Deduced a trap composed of 40 places in 196 ms of which 2 ms to minimize.
[2024-05-27 17:36:53] [INFO ] Deduced a trap composed of 36 places in 198 ms of which 1 ms to minimize.
[2024-05-27 17:36:53] [INFO ] Deduced a trap composed of 36 places in 195 ms of which 2 ms to minimize.
[2024-05-27 17:36:53] [INFO ] Deduced a trap composed of 74 places in 193 ms of which 2 ms to minimize.
[2024-05-27 17:36:53] [INFO ] Deduced a trap composed of 38 places in 133 ms of which 2 ms to minimize.
[2024-05-27 17:37:02] [INFO ] Deduced a trap composed of 35 places in 215 ms of which 2 ms to minimize.
[2024-05-27 17:37:02] [INFO ] Deduced a trap composed of 33 places in 204 ms of which 2 ms to minimize.
[2024-05-27 17:37:03] [INFO ] Deduced a trap composed of 30 places in 202 ms of which 2 ms to minimize.
[2024-05-27 17:37:03] [INFO ] Deduced a trap composed of 21 places in 211 ms of which 2 ms to minimize.
[2024-05-27 17:37:04] [INFO ] Deduced a trap composed of 57 places in 197 ms of which 2 ms to minimize.
[2024-05-27 17:37:04] [INFO ] Deduced a trap composed of 41 places in 185 ms of which 2 ms to minimize.
[2024-05-27 17:37:04] [INFO ] Deduced a trap composed of 49 places in 204 ms of which 2 ms to minimize.
[2024-05-27 17:37:04] [INFO ] Deduced a trap composed of 49 places in 191 ms of which 2 ms to minimize.
[2024-05-27 17:37:05] [INFO ] Deduced a trap composed of 41 places in 193 ms of which 1 ms to minimize.
[2024-05-27 17:37:05] [INFO ] Deduced a trap composed of 41 places in 203 ms of which 2 ms to minimize.
[2024-05-27 17:37:08] [INFO ] Deduced a trap composed of 38 places in 208 ms of which 2 ms to minimize.
[2024-05-27 17:37:08] [INFO ] Deduced a trap composed of 44 places in 202 ms of which 2 ms to minimize.
[2024-05-27 17:37:08] [INFO ] Deduced a trap composed of 42 places in 203 ms of which 2 ms to minimize.
[2024-05-27 17:37:08] [INFO ] Deduced a trap composed of 46 places in 132 ms of which 2 ms to minimize.
[2024-05-27 17:37:09] [INFO ] Deduced a trap composed of 57 places in 143 ms of which 1 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 30037 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-05-27 17:37:44] [INFO ] Deduced a trap composed of 32 places in 202 ms of which 1 ms to minimize.
SMT process timed out in 64269ms, After SMT, problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 64293ms
Finished structural reductions in LTL mode , in 1 iterations and 67399 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 81 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 148 ms :[(AND p0 p1), p0, (AND p0 p1), (AND p0 p1)]
RANDOM walk for 12671 steps (2 resets) in 119 ms. (105 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 215 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 141 ms :[(AND p0 p1), p0, (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 149 ms :[(AND p0 p1), p0, (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 176 ms :[(AND p0 p1), p0, (AND p0 p1), (AND p0 p1)]
Product exploration explored 100000 steps with 178 reset in 484 ms.
Product exploration explored 100000 steps with 180 reset in 480 ms.
Built C files in :
/tmp/ltsmin3641964392467996097
[2024-05-27 17:37:46] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3641964392467996097
Running compilation step : cd /tmp/ltsmin3641964392467996097;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3641964392467996097;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3641964392467996097;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 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 5 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-27 17:37:49] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 17:37:49] [INFO ] Invariant cache hit.
[2024-05-27 17:37:50] [INFO ] Implicit Places using invariants in 939 ms returned []
[2024-05-27 17:37:50] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 17:37:50] [INFO ] Invariant cache hit.
[2024-05-27 17:37:50] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 17:37:52] [INFO ] Implicit Places using invariants and state equation in 2107 ms returned []
Implicit Place search using SMT with State Equation took 3048 ms to find 0 implicit places.
Running 1521 sub problems to find dead transitions.
[2024-05-27 17:37:52] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 17:37:52] [INFO ] Invariant cache hit.
[2024-05-27 17:37:52] [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-05-27 17:38:04] [INFO ] Deduced a trap composed of 40 places in 201 ms of which 2 ms to minimize.
[2024-05-27 17:38:04] [INFO ] Deduced a trap composed of 36 places in 193 ms of which 1 ms to minimize.
[2024-05-27 17:38:05] [INFO ] Deduced a trap composed of 36 places in 189 ms of which 1 ms to minimize.
[2024-05-27 17:38:05] [INFO ] Deduced a trap composed of 74 places in 198 ms of which 2 ms to minimize.
[2024-05-27 17:38:05] [INFO ] Deduced a trap composed of 38 places in 130 ms of which 2 ms to minimize.
[2024-05-27 17:38:14] [INFO ] Deduced a trap composed of 35 places in 212 ms of which 2 ms to minimize.
[2024-05-27 17:38:14] [INFO ] Deduced a trap composed of 33 places in 218 ms of which 2 ms to minimize.
[2024-05-27 17:38:14] [INFO ] Deduced a trap composed of 30 places in 223 ms of which 2 ms to minimize.
[2024-05-27 17:38:15] [INFO ] Deduced a trap composed of 21 places in 213 ms of which 2 ms to minimize.
[2024-05-27 17:38:16] [INFO ] Deduced a trap composed of 57 places in 195 ms of which 2 ms to minimize.
[2024-05-27 17:38:16] [INFO ] Deduced a trap composed of 41 places in 185 ms of which 2 ms to minimize.
[2024-05-27 17:38:16] [INFO ] Deduced a trap composed of 49 places in 189 ms of which 2 ms to minimize.
[2024-05-27 17:38:17] [INFO ] Deduced a trap composed of 49 places in 190 ms of which 2 ms to minimize.
[2024-05-27 17:38:17] [INFO ] Deduced a trap composed of 41 places in 194 ms of which 2 ms to minimize.
[2024-05-27 17:38:17] [INFO ] Deduced a trap composed of 41 places in 203 ms of which 2 ms to minimize.
[2024-05-27 17:38:20] [INFO ] Deduced a trap composed of 38 places in 208 ms of which 2 ms to minimize.
[2024-05-27 17:38:20] [INFO ] Deduced a trap composed of 44 places in 203 ms of which 1 ms to minimize.
[2024-05-27 17:38:20] [INFO ] Deduced a trap composed of 42 places in 198 ms of which 2 ms to minimize.
[2024-05-27 17:38:20] [INFO ] Deduced a trap composed of 46 places in 135 ms of which 2 ms to minimize.
[2024-05-27 17:38:21] [INFO ] Deduced a trap composed of 57 places in 136 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
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 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: 0/1521 constraints, Known Traps: 20/20 constraints]
After SMT, in 64151ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 64167ms
Finished structural reductions in LTL mode , in 1 iterations and 67223 ms. Remains : 296/296 places, 1531/1531 transitions.
Built C files in :
/tmp/ltsmin6575251784861123387
[2024-05-27 17:38:56] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6575251784861123387
Running compilation step : cd /tmp/ltsmin6575251784861123387;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6575251784861123387;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6575251784861123387;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-27 17:38:59] [INFO ] Flatten gal took : 53 ms
[2024-05-27 17:38:59] [INFO ] Flatten gal took : 52 ms
[2024-05-27 17:38:59] [INFO ] Time to serialize gal into /tmp/LTL8088794702347957396.gal : 8 ms
[2024-05-27 17:38:59] [INFO ] Time to serialize properties into /tmp/LTL10116728292387347795.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8088794702347957396.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16063041532503427856.hoa' '-atoms' '/tmp/LTL10116728292387347795.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL10116728292387347795.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16063041532503427856.hoa
Detected timeout of ITS tools.
[2024-05-27 17:39:14] [INFO ] Flatten gal took : 50 ms
[2024-05-27 17:39:14] [INFO ] Flatten gal took : 50 ms
[2024-05-27 17:39:14] [INFO ] Time to serialize gal into /tmp/LTL14802962787693554170.gal : 7 ms
[2024-05-27 17:39:14] [INFO ] Time to serialize properties into /tmp/LTL11754268776987715628.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14802962787693554170.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11754268776987715628.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F((X("((T_out==0)||(wait_ack_3_6==0))"))&&(((!("((T_out==1)&&(wait_ack_3_6==1))"))||(X(!("((T_out==1)&&(wait_ack_6_9==1))"))))U((G(...365
Formula 0 simplified : G(X!"((T_out==0)||(wait_ack_3_6==0))" | (!"((Cpt1_5==1)&&(loop_em_9==1))" U ("((T_out==1)&&(wait_ack_3_6==1))" & X"((T_out==1)&&(wai...173
Detected timeout of ITS tools.
[2024-05-27 17:39:30] [INFO ] Flatten gal took : 49 ms
[2024-05-27 17:39:30] [INFO ] Applying decomposition
[2024-05-27 17:39:30] [INFO ] Flatten gal took : 49 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7234239762290258082.txt' '-o' '/tmp/graph7234239762290258082.bin' '-w' '/tmp/graph7234239762290258082.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7234239762290258082.bin' '-l' '-1' '-v' '-w' '/tmp/graph7234239762290258082.weights' '-q' '0' '-e' '0.001'
[2024-05-27 17:39:30] [INFO ] Decomposing Gal with order
[2024-05-27 17:39:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 17:39:30] [INFO ] Removed a total of 2103 redundant transitions.
[2024-05-27 17:39:30] [INFO ] Flatten gal took : 158 ms
[2024-05-27 17:39:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 661 labels/synchronizations in 36 ms.
[2024-05-27 17:39:30] [INFO ] Time to serialize gal into /tmp/LTL15811665205931844635.gal : 8 ms
[2024-05-27 17:39:30] [INFO ] Time to serialize properties into /tmp/LTL7183815221053524485.ltl : 73 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15811665205931844635.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7183815221053524485.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F((X("((i0.u2.T_out==0)||(i0.u12.wait_ack_3_6==0))"))&&(((!("((i0.u2.T_out==1)&&(i0.u12.wait_ack_3_6==1))"))||(X(!("((i0.u2.T_out==...467
Formula 0 simplified : G(X!"((i0.u2.T_out==0)||(i0.u12.wait_ack_3_6==0))" | (!"((i6.u17.Cpt1_5==1)&&(u10.loop_em_9==1))" U ("((i0.u2.T_out==1)&&(i0.u12.wai...223
Detected timeout of ITS tools.
Treatment of property SafeBus-PT-10-LTLFireability-12 finished in 193059 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-05-27 17:39:45] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 306 cols
[2024-05-27 17:39:45] [INFO ] Computed 45 invariants in 7 ms
[2024-05-27 17:39:46] [INFO ] Implicit Places using invariants in 1122 ms returned [266, 267, 268, 269, 270, 271, 272, 273, 274, 275]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 1123 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 1141 ms. Remains : 296/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 216 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 243 ms.
Product exploration explored 100000 steps with 50000 reset in 251 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 16 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 1888 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 85 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-27 17:39:47] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 17:39:47] [INFO ] Invariant cache hit.
[2024-05-27 17:39:48] [INFO ] Implicit Places using invariants in 1208 ms returned [266, 267, 268, 269, 270, 271, 272, 273, 274, 275]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 1211 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 88 ms. Remains 286 /296 variables (removed 10) and now considering 1521/1531 (removed 10) transitions.
[2024-05-27 17:39:48] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
// Phase 1: matrix 632 rows 286 cols
[2024-05-27 17:39:48] [INFO ] Computed 35 invariants in 12 ms
[2024-05-27 17:39:49] [INFO ] Implicit Places using invariants in 1001 ms returned []
[2024-05-27 17:39:49] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2024-05-27 17:39:49] [INFO ] Invariant cache hit.
[2024-05-27 17:39:50] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 17:39:52] [INFO ] Implicit Places using invariants and state equation in 2401 ms returned []
Implicit Place search using SMT with State Equation took 3404 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 4790 ms. Remains : 286/306 places, 1521/1531 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SafeBus-PT-10-LTLFireability-14
Product exploration explored 100000 steps with 213 reset in 504 ms.
Product exploration explored 100000 steps with 192 reset in 566 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 61 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 5 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 73 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
[2024-05-27 17:39:53] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2024-05-27 17:39:53] [INFO ] Invariant cache hit.
[2024-05-27 17:39:54] [INFO ] [Real]Absence check using 14 positive place invariants in 23 ms returned sat
[2024-05-27 17:39:54] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 295 ms returned sat
[2024-05-27 17:39:55] [INFO ] [Real]Absence check using state equation in 789 ms returned sat
[2024-05-27 17:39:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 17:39:56] [INFO ] [Nat]Absence check using 14 positive place invariants in 13 ms returned sat
[2024-05-27 17:39:56] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 125 ms returned sat
[2024-05-27 17:39:56] [INFO ] [Nat]Absence check using state equation in 471 ms returned sat
[2024-05-27 17:39:56] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 17:39:56] [INFO ] [Nat]Added 111 Read/Feed constraints in 86 ms returned sat
[2024-05-27 17:39:56] [INFO ] Deduced a trap composed of 60 places in 141 ms of which 2 ms to minimize.
[2024-05-27 17:39:57] [INFO ] Deduced a trap composed of 41 places in 132 ms of which 2 ms to minimize.
[2024-05-27 17:39:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 351 ms
[2024-05-27 17:39:57] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 602 transitions) in 88 ms.
[2024-05-27 17:39:57] [INFO ] Added : 0 causal constraints over 0 iterations in 144 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 80 ms. Remains 286 /286 variables (removed 0) and now considering 1521/1521 (removed 0) transitions.
[2024-05-27 17:39:57] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2024-05-27 17:39:57] [INFO ] Invariant cache hit.
[2024-05-27 17:39:58] [INFO ] Implicit Places using invariants in 1116 ms returned []
[2024-05-27 17:39:58] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2024-05-27 17:39:58] [INFO ] Invariant cache hit.
[2024-05-27 17:39:58] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 17:40:00] [INFO ] Implicit Places using invariants and state equation in 2369 ms returned []
Implicit Place search using SMT with State Equation took 3488 ms to find 0 implicit places.
[2024-05-27 17:40:00] [INFO ] Redundant transitions in 24 ms returned []
Running 1511 sub problems to find dead transitions.
[2024-05-27 17:40:00] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2024-05-27 17:40:00] [INFO ] Invariant cache hit.
[2024-05-27 17:40:00] [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-05-27 17:40:13] [INFO ] Deduced a trap composed of 36 places in 73 ms of which 1 ms to minimize.
[2024-05-27 17:40:13] [INFO ] Deduced a trap composed of 39 places in 67 ms of which 1 ms to minimize.
[2024-05-27 17:40:13] [INFO ] Deduced a trap composed of 39 places in 72 ms of which 1 ms to minimize.
[2024-05-27 17:40:13] [INFO ] Deduced a trap composed of 43 places in 72 ms of which 2 ms to minimize.
[2024-05-27 17:40:13] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 1 ms to minimize.
[2024-05-27 17:40:21] [INFO ] Deduced a trap composed of 30 places in 205 ms of which 2 ms to minimize.
[2024-05-27 17:40:22] [INFO ] Deduced a trap composed of 30 places in 202 ms of which 2 ms to minimize.
[2024-05-27 17:40:22] [INFO ] Deduced a trap composed of 21 places in 193 ms of which 1 ms to minimize.
[2024-05-27 17:40:22] [INFO ] Deduced a trap composed of 30 places in 206 ms of which 2 ms to minimize.
[2024-05-27 17:40:22] [INFO ] Deduced a trap composed of 30 places in 206 ms of which 2 ms to minimize.
[2024-05-27 17:40:22] [INFO ] Deduced a trap composed of 46 places in 214 ms of which 2 ms to minimize.
[2024-05-27 17:40:23] [INFO ] Deduced a trap composed of 21 places in 200 ms of which 2 ms to minimize.
[2024-05-27 17:40:24] [INFO ] Deduced a trap composed of 49 places in 206 ms of which 2 ms to minimize.
[2024-05-27 17:40:24] [INFO ] Deduced a trap composed of 41 places in 191 ms of which 2 ms to minimize.
[2024-05-27 17:40:26] [INFO ] Deduced a trap composed of 41 places in 212 ms of which 2 ms to minimize.
[2024-05-27 17:40:27] [INFO ] Deduced a trap composed of 41 places in 201 ms of which 1 ms to minimize.
[2024-05-27 17:40:27] [INFO ] Deduced a trap composed of 36 places in 193 ms of which 3 ms to minimize.
[2024-05-27 17:40:27] [INFO ] Deduced a trap composed of 39 places in 191 ms of which 2 ms to minimize.
[2024-05-27 17:40:27] [INFO ] Deduced a trap composed of 57 places in 196 ms of which 2 ms to minimize.
[2024-05-27 17:40:27] [INFO ] Deduced a trap composed of 40 places in 128 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 30025 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-05-27 17:40:47] [INFO ] Deduced a trap composed of 41 places in 114 ms of which 1 ms to minimize.
[2024-05-27 17:40:47] [INFO ] Deduced a trap composed of 41 places in 109 ms of which 1 ms to minimize.
[2024-05-27 17:40:48] [INFO ] Deduced a trap composed of 57 places in 113 ms of which 2 ms to minimize.
[2024-05-27 17:40:49] [INFO ] Deduced a trap composed of 57 places in 104 ms of which 1 ms to minimize.
[2024-05-27 17:40:53] [INFO ] Deduced a trap composed of 41 places in 105 ms of which 2 ms to minimize.
[2024-05-27 17:40:55] [INFO ] Deduced a trap composed of 60 places in 117 ms of which 1 ms to minimize.
[2024-05-27 17:40:56] [INFO ] Deduced a trap composed of 41 places in 108 ms of which 1 ms to minimize.
[2024-05-27 17:40:57] [INFO ] Deduced a trap composed of 57 places in 95 ms of which 1 ms to minimize.
[2024-05-27 17:40:58] [INFO ] Deduced a trap composed of 49 places in 104 ms of which 1 ms to minimize.
[2024-05-27 17:41:03] [INFO ] Deduced a trap composed of 57 places in 96 ms of which 2 ms to minimize.
[2024-05-27 17:41:03] [INFO ] Deduced a trap composed of 41 places in 102 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 30023 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 64181ms problems are : Problem set: 0 solved, 1511 unsolved
Search for dead transitions found 0 dead transitions in 64197ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 67802 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 71 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 91 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 65 ms :[(NOT p0), (NOT p0)]
[2024-05-27 17:41:05] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2024-05-27 17:41:05] [INFO ] Invariant cache hit.
[2024-05-27 17:41:05] [INFO ] [Real]Absence check using 14 positive place invariants in 23 ms returned sat
[2024-05-27 17:41:06] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 296 ms returned sat
[2024-05-27 17:41:07] [INFO ] [Real]Absence check using state equation in 803 ms returned sat
[2024-05-27 17:41:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 17:41:07] [INFO ] [Nat]Absence check using 14 positive place invariants in 12 ms returned sat
[2024-05-27 17:41:07] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 127 ms returned sat
[2024-05-27 17:41:08] [INFO ] [Nat]Absence check using state equation in 494 ms returned sat
[2024-05-27 17:41:08] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 17:41:08] [INFO ] [Nat]Added 111 Read/Feed constraints in 87 ms returned sat
[2024-05-27 17:41:08] [INFO ] Deduced a trap composed of 60 places in 129 ms of which 1 ms to minimize.
[2024-05-27 17:41:08] [INFO ] Deduced a trap composed of 41 places in 127 ms of which 1 ms to minimize.
[2024-05-27 17:41:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 336 ms
[2024-05-27 17:41:08] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 602 transitions) in 61 ms.
[2024-05-27 17:41:08] [INFO ] Added : 0 causal constraints over 0 iterations in 119 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 181 reset in 492 ms.
Product exploration explored 100000 steps with 166 reset in 506 ms.
Built C files in :
/tmp/ltsmin16531484938292952706
[2024-05-27 17:41:09] [INFO ] Too many transitions (1521) to apply POR reductions. Disabling POR matrices.
[2024-05-27 17:41:09] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16531484938292952706
Running compilation step : cd /tmp/ltsmin16531484938292952706;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16531484938292952706;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16531484938292952706;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 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 82 ms. Remains 286 /286 variables (removed 0) and now considering 1521/1521 (removed 0) transitions.
[2024-05-27 17:41:12] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2024-05-27 17:41:12] [INFO ] Invariant cache hit.
[2024-05-27 17:41:14] [INFO ] Implicit Places using invariants in 1093 ms returned []
[2024-05-27 17:41:14] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2024-05-27 17:41:14] [INFO ] Invariant cache hit.
[2024-05-27 17:41:14] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 17:41:16] [INFO ] Implicit Places using invariants and state equation in 2364 ms returned []
Implicit Place search using SMT with State Equation took 3459 ms to find 0 implicit places.
[2024-05-27 17:41:16] [INFO ] Redundant transitions in 26 ms returned []
Running 1511 sub problems to find dead transitions.
[2024-05-27 17:41:16] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2024-05-27 17:41:16] [INFO ] Invariant cache hit.
[2024-05-27 17:41:16] [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-05-27 17:41:28] [INFO ] Deduced a trap composed of 36 places in 71 ms of which 2 ms to minimize.
[2024-05-27 17:41:28] [INFO ] Deduced a trap composed of 39 places in 72 ms of which 1 ms to minimize.
[2024-05-27 17:41:28] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 1 ms to minimize.
[2024-05-27 17:41:28] [INFO ] Deduced a trap composed of 43 places in 65 ms of which 1 ms to minimize.
[2024-05-27 17:41:28] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 1 ms to minimize.
[2024-05-27 17:41:37] [INFO ] Deduced a trap composed of 30 places in 203 ms of which 2 ms to minimize.
[2024-05-27 17:41:37] [INFO ] Deduced a trap composed of 30 places in 224 ms of which 2 ms to minimize.
[2024-05-27 17:41:37] [INFO ] Deduced a trap composed of 21 places in 226 ms of which 2 ms to minimize.
[2024-05-27 17:41:37] [INFO ] Deduced a trap composed of 30 places in 233 ms of which 3 ms to minimize.
[2024-05-27 17:41:38] [INFO ] Deduced a trap composed of 30 places in 208 ms of which 2 ms to minimize.
[2024-05-27 17:41:38] [INFO ] Deduced a trap composed of 46 places in 208 ms of which 1 ms to minimize.
[2024-05-27 17:41:38] [INFO ] Deduced a trap composed of 21 places in 225 ms of which 2 ms to minimize.
[2024-05-27 17:41:39] [INFO ] Deduced a trap composed of 49 places in 205 ms of which 2 ms to minimize.
[2024-05-27 17:41:39] [INFO ] Deduced a trap composed of 41 places in 197 ms of which 2 ms to minimize.
[2024-05-27 17:41:42] [INFO ] Deduced a trap composed of 41 places in 217 ms of which 2 ms to minimize.
[2024-05-27 17:41:42] [INFO ] Deduced a trap composed of 41 places in 218 ms of which 2 ms to minimize.
[2024-05-27 17:41:42] [INFO ] Deduced a trap composed of 36 places in 220 ms of which 1 ms to minimize.
[2024-05-27 17:41:43] [INFO ] Deduced a trap composed of 39 places in 216 ms of which 2 ms to minimize.
[2024-05-27 17:41:43] [INFO ] Deduced a trap composed of 57 places in 218 ms of which 2 ms to minimize.
[2024-05-27 17:41:43] [INFO ] Deduced a trap composed of 40 places in 144 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 30023 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-05-27 17:42:02] [INFO ] Deduced a trap composed of 41 places in 126 ms of which 2 ms to minimize.
[2024-05-27 17:42:02] [INFO ] Deduced a trap composed of 41 places in 120 ms of which 2 ms to minimize.
[2024-05-27 17:42:03] [INFO ] Deduced a trap composed of 57 places in 107 ms of which 1 ms to minimize.
[2024-05-27 17:42:04] [INFO ] Deduced a trap composed of 57 places in 100 ms of which 1 ms to minimize.
[2024-05-27 17:42:09] [INFO ] Deduced a trap composed of 41 places in 104 ms of which 1 ms to minimize.
[2024-05-27 17:42:11] [INFO ] Deduced a trap composed of 60 places in 120 ms of which 1 ms to minimize.
[2024-05-27 17:42:12] [INFO ] Deduced a trap composed of 41 places in 103 ms of which 1 ms to minimize.
[2024-05-27 17:42:12] [INFO ] Deduced a trap composed of 57 places in 100 ms of which 2 ms to minimize.
[2024-05-27 17:42:13] [INFO ] Deduced a trap composed of 49 places in 142 ms of which 1 ms to minimize.
[2024-05-27 17:42:18] [INFO ] Deduced a trap composed of 57 places in 103 ms of which 1 ms to minimize.
[2024-05-27 17:42:19] [INFO ] Deduced a trap composed of 41 places in 104 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 1)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 1)
(s113 0)
(s114 0)
(s115 0)
(s116 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
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 30033 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 63860ms problems are : Problem set: 0 solved, 1511 unsolved
Search for dead transitions found 0 dead transitions in 63874ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 67453 ms. Remains : 286/286 places, 1521/1521 transitions.
Built C files in :
/tmp/ltsmin9181968807809162849
[2024-05-27 17:42:20] [INFO ] Too many transitions (1521) to apply POR reductions. Disabling POR matrices.
[2024-05-27 17:42:20] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9181968807809162849
Running compilation step : cd /tmp/ltsmin9181968807809162849;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9181968807809162849;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9181968807809162849;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-27 17:42:23] [INFO ] Flatten gal took : 49 ms
[2024-05-27 17:42:23] [INFO ] Flatten gal took : 50 ms
[2024-05-27 17:42:23] [INFO ] Time to serialize gal into /tmp/LTL12423242749201131734.gal : 8 ms
[2024-05-27 17:42:23] [INFO ] Time to serialize properties into /tmp/LTL16193073688282071252.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12423242749201131734.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3679406347723294522.hoa' '-atoms' '/tmp/LTL16193073688282071252.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL16193073688282071252.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3679406347723294522.hoa
Detected timeout of ITS tools.
[2024-05-27 17:42:38] [INFO ] Flatten gal took : 48 ms
[2024-05-27 17:42:38] [INFO ] Flatten gal took : 48 ms
[2024-05-27 17:42:38] [INFO ] Time to serialize gal into /tmp/LTL4503769379326357072.gal : 7 ms
[2024-05-27 17:42:38] [INFO ] Time to serialize properties into /tmp/LTL6536411079176201250.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4503769379326357072.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6536411079176201250.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F("((listen_1==0)||(Cpt1_1==0))"))))
Formula 0 simplified : FG!"((listen_1==0)||(Cpt1_1==0))"
Detected timeout of ITS tools.
[2024-05-27 17:42:53] [INFO ] Flatten gal took : 50 ms
[2024-05-27 17:42:53] [INFO ] Applying decomposition
[2024-05-27 17:42:53] [INFO ] Flatten gal took : 50 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1766220140357352585.txt' '-o' '/tmp/graph1766220140357352585.bin' '-w' '/tmp/graph1766220140357352585.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1766220140357352585.bin' '-l' '-1' '-v' '-w' '/tmp/graph1766220140357352585.weights' '-q' '0' '-e' '0.001'
[2024-05-27 17:42:54] [INFO ] Decomposing Gal with order
[2024-05-27 17:42:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 17:42:54] [INFO ] Removed a total of 2913 redundant transitions.
[2024-05-27 17:42:54] [INFO ] Flatten gal took : 149 ms
[2024-05-27 17:42:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 590 labels/synchronizations in 33 ms.
[2024-05-27 17:42:54] [INFO ] Time to serialize gal into /tmp/LTL7512618098473261502.gal : 11 ms
[2024-05-27 17:42:54] [INFO ] Time to serialize properties into /tmp/LTL9219275284529146260.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7512618098473261502.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9219275284529146260.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F("((i1.u0.listen_1==0)||(i0.u15.Cpt1_1==0))"))))
Formula 0 simplified : FG!"((i1.u0.listen_1==0)||(i0.u15.Cpt1_1==0))"
Detected timeout of ITS tools.
Treatment of property SafeBus-PT-10-LTLFireability-14 finished in 201890 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-05-27 17:43:09] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 306 cols
[2024-05-27 17:43:09] [INFO ] Computed 45 invariants in 5 ms
[2024-05-27 17:43:10] [INFO ] Implicit Places using invariants in 1317 ms returned [266, 267, 268, 269, 270, 271, 272, 273, 274, 275]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 1319 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 1335 ms. Remains : 296/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 288 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 19 reset in 491 ms.
Stack based approach found an accepted trace after 1548 steps with 1 reset with depth 1089 and stack size 1083 in 9 ms.
FORMULA SafeBus-PT-10-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property SafeBus-PT-10-LTLFireability-15 finished in 2157 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 100 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 17 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-27 17:43:11] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 17:43:11] [INFO ] Invariant cache hit.
[2024-05-27 17:43:12] [INFO ] Implicit Places using invariants in 1054 ms returned []
[2024-05-27 17:43:12] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 17:43:12] [INFO ] Invariant cache hit.
[2024-05-27 17:43:13] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 17:43:15] [INFO ] Implicit Places using invariants and state equation in 2242 ms returned []
Implicit Place search using SMT with State Equation took 3298 ms to find 0 implicit places.
Running 1521 sub problems to find dead transitions.
[2024-05-27 17:43:15] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 17:43:15] [INFO ] Invariant cache hit.
[2024-05-27 17:43:15] [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-05-27 17:43:28] [INFO ] Deduced a trap composed of 40 places in 208 ms of which 2 ms to minimize.
[2024-05-27 17:43:37] [INFO ] Deduced a trap composed of 49 places in 206 ms of which 2 ms to minimize.
[2024-05-27 17:43:37] [INFO ] Deduced a trap composed of 41 places in 198 ms of which 2 ms to minimize.
[2024-05-27 17:43:38] [INFO ] Deduced a trap composed of 41 places in 201 ms of which 2 ms to minimize.
[2024-05-27 17:43:40] [INFO ] Deduced a trap composed of 42 places in 217 ms of which 2 ms to minimize.
[2024-05-27 17:43:41] [INFO ] Deduced a trap composed of 41 places in 198 ms of which 2 ms to minimize.
[2024-05-27 17:43:41] [INFO ] Deduced a trap composed of 39 places in 212 ms of which 2 ms to minimize.
[2024-05-27 17:43:41] [INFO ] Deduced a trap composed of 41 places in 210 ms of which 2 ms to minimize.
[2024-05-27 17:43:41] [INFO ] Deduced a trap composed of 40 places in 203 ms of which 2 ms to minimize.
[2024-05-27 17:43:41] [INFO ] Deduced a trap composed of 41 places in 210 ms of which 2 ms to minimize.
[2024-05-27 17:43:42] [INFO ] Deduced a trap composed of 38 places in 213 ms of which 2 ms to minimize.
[2024-05-27 17:43:42] [INFO ] Deduced a trap composed of 35 places in 236 ms of which 2 ms to minimize.
[2024-05-27 17:43:42] [INFO ] Deduced a trap composed of 57 places in 131 ms of which 1 ms to minimize.
[2024-05-27 17:43:42] [INFO ] Deduced a trap composed of 41 places in 128 ms of which 2 ms to minimize.
[2024-05-27 17:43:43] [INFO ] Deduced a trap composed of 49 places in 116 ms of which 1 ms to minimize.
[2024-05-27 17:43:43] [INFO ] Deduced a trap composed of 49 places in 108 ms of which 1 ms to minimize.
[2024-05-27 17:43:43] [INFO ] Deduced a trap composed of 49 places in 88 ms of which 1 ms to minimize.
[2024-05-27 17:43:43] [INFO ] Deduced a trap composed of 51 places in 112 ms of which 1 ms to minimize.
[2024-05-27 17:43:43] [INFO ] Deduced a trap composed of 49 places in 101 ms of which 1 ms to minimize.
[2024-05-27 17:43:43] [INFO ] Deduced a trap composed of 34 places in 219 ms of which 1 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 30026 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-05-27 17:44:03] [INFO ] Deduced a trap composed of 21 places in 204 ms of which 2 ms to minimize.
[2024-05-27 17:44:04] [INFO ] Deduced a trap composed of 21 places in 225 ms of which 1 ms to minimize.
[2024-05-27 17:44:04] [INFO ] Deduced a trap composed of 30 places in 209 ms of which 2 ms to minimize.
[2024-05-27 17:44:04] [INFO ] Deduced a trap composed of 21 places in 212 ms of which 1 ms to minimize.
[2024-05-27 17:44:04] [INFO ] Deduced a trap composed of 31 places in 213 ms of which 1 ms to minimize.
[2024-05-27 17:44:05] [INFO ] Deduced a trap composed of 21 places in 210 ms of which 2 ms to minimize.
[2024-05-27 17:44:05] [INFO ] Deduced a trap composed of 34 places in 199 ms of which 2 ms to minimize.
[2024-05-27 17:44:05] [INFO ] Deduced a trap composed of 21 places in 217 ms of which 2 ms to minimize.
[2024-05-27 17:44:07] [INFO ] Deduced a trap composed of 57 places in 88 ms of which 1 ms to minimize.
[2024-05-27 17:44:07] [INFO ] Deduced a trap composed of 49 places in 98 ms of which 2 ms to minimize.
[2024-05-27 17:44:07] [INFO ] Deduced a trap composed of 41 places in 95 ms of which 2 ms to minimize.
[2024-05-27 17:44:07] [INFO ] Deduced a trap composed of 49 places in 135 ms of which 2 ms to minimize.
[2024-05-27 17:44:13] [INFO ] Deduced a trap composed of 35 places in 144 ms of which 2 ms to minimize.
[2024-05-27 17:44:13] [INFO ] Deduced a trap composed of 30 places in 211 ms of which 2 ms to minimize.
[2024-05-27 17:44:14] [INFO ] Deduced a trap composed of 41 places in 206 ms of which 2 ms to minimize.
[2024-05-27 17:44:14] [INFO ] Deduced a trap composed of 49 places in 127 ms of which 2 ms to minimize.
[2024-05-27 17:44:14] [INFO ] Deduced a trap composed of 49 places in 122 ms of which 1 ms to minimize.
[2024-05-27 17:44:17] [INFO ] Deduced a trap composed of 75 places in 185 ms of which 1 ms to minimize.
[2024-05-27 17:44:17] [INFO ] Deduced a trap composed of 84 places in 187 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 64113ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 64130ms
Finished structural reductions in LI_LTL mode , in 1 iterations and 67452 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 866 reset in 997 ms.
Product exploration explored 100000 steps with 823 reset in 1013 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 74 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 341 steps (0 resets) in 12 ms. (26 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 221 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 80 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 116 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-27 17:44:21] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 17:44:21] [INFO ] Invariant cache hit.
[2024-05-27 17:44:23] [INFO ] Implicit Places using invariants in 1092 ms returned []
[2024-05-27 17:44:23] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 17:44:23] [INFO ] Invariant cache hit.
[2024-05-27 17:44:23] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 17:44:25] [INFO ] Implicit Places using invariants and state equation in 2119 ms returned []
Implicit Place search using SMT with State Equation took 3213 ms to find 0 implicit places.
[2024-05-27 17:44:25] [INFO ] Redundant transitions in 25 ms returned []
Running 1521 sub problems to find dead transitions.
[2024-05-27 17:44:25] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 17:44:25] [INFO ] Invariant cache hit.
[2024-05-27 17:44:25] [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-05-27 17:44:38] [INFO ] Deduced a trap composed of 40 places in 197 ms of which 2 ms to minimize.
[2024-05-27 17:44:48] [INFO ] Deduced a trap composed of 49 places in 201 ms of which 2 ms to minimize.
[2024-05-27 17:44:48] [INFO ] Deduced a trap composed of 41 places in 203 ms of which 1 ms to minimize.
[2024-05-27 17:44:48] [INFO ] Deduced a trap composed of 41 places in 196 ms of which 2 ms to minimize.
[2024-05-27 17:44:51] [INFO ] Deduced a trap composed of 42 places in 213 ms of which 2 ms to minimize.
[2024-05-27 17:44:51] [INFO ] Deduced a trap composed of 41 places in 198 ms of which 2 ms to minimize.
[2024-05-27 17:44:51] [INFO ] Deduced a trap composed of 39 places in 199 ms of which 2 ms to minimize.
[2024-05-27 17:44:52] [INFO ] Deduced a trap composed of 41 places in 204 ms of which 2 ms to minimize.
[2024-05-27 17:44:52] [INFO ] Deduced a trap composed of 40 places in 201 ms of which 2 ms to minimize.
[2024-05-27 17:44:52] [INFO ] Deduced a trap composed of 41 places in 203 ms of which 2 ms to minimize.
[2024-05-27 17:44:52] [INFO ] Deduced a trap composed of 38 places in 205 ms of which 2 ms to minimize.
[2024-05-27 17:44:52] [INFO ] Deduced a trap composed of 35 places in 197 ms of which 1 ms to minimize.
[2024-05-27 17:44:53] [INFO ] Deduced a trap composed of 57 places in 129 ms of which 2 ms to minimize.
[2024-05-27 17:44:53] [INFO ] Deduced a trap composed of 41 places in 135 ms of which 2 ms to minimize.
[2024-05-27 17:44:53] [INFO ] Deduced a trap composed of 49 places in 112 ms of which 1 ms to minimize.
[2024-05-27 17:44:53] [INFO ] Deduced a trap composed of 49 places in 104 ms of which 1 ms to minimize.
[2024-05-27 17:44:53] [INFO ] Deduced a trap composed of 49 places in 94 ms of which 2 ms to minimize.
[2024-05-27 17:44:53] [INFO ] Deduced a trap composed of 51 places in 107 ms of which 2 ms to minimize.
[2024-05-27 17:44:54] [INFO ] Deduced a trap composed of 49 places in 107 ms of which 1 ms to minimize.
[2024-05-27 17:44:54] [INFO ] Deduced a trap composed of 34 places in 217 ms of which 5 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 30026 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-05-27 17:45:13] [INFO ] Deduced a trap composed of 21 places in 206 ms of which 1 ms to minimize.
[2024-05-27 17:45:13] [INFO ] Deduced a trap composed of 21 places in 207 ms of which 2 ms to minimize.
[2024-05-27 17:45:14] [INFO ] Deduced a trap composed of 30 places in 212 ms of which 2 ms to minimize.
[2024-05-27 17:45:14] [INFO ] Deduced a trap composed of 21 places in 208 ms of which 2 ms to minimize.
[2024-05-27 17:45:14] [INFO ] Deduced a trap composed of 31 places in 205 ms of which 2 ms to minimize.
[2024-05-27 17:45:14] [INFO ] Deduced a trap composed of 21 places in 203 ms of which 1 ms to minimize.
[2024-05-27 17:45:15] [INFO ] Deduced a trap composed of 34 places in 208 ms of which 2 ms to minimize.
[2024-05-27 17:45:15] [INFO ] Deduced a trap composed of 21 places in 207 ms of which 2 ms to minimize.
[2024-05-27 17:45:17] [INFO ] Deduced a trap composed of 57 places in 95 ms of which 1 ms to minimize.
[2024-05-27 17:45:17] [INFO ] Deduced a trap composed of 49 places in 90 ms of which 1 ms to minimize.
[2024-05-27 17:45:17] [INFO ] Deduced a trap composed of 41 places in 90 ms of which 1 ms to minimize.
[2024-05-27 17:45:17] [INFO ] Deduced a trap composed of 49 places in 129 ms of which 2 ms to minimize.
[2024-05-27 17:45:22] [INFO ] Deduced a trap composed of 35 places in 138 ms of which 2 ms to minimize.
[2024-05-27 17:45:22] [INFO ] Deduced a trap composed of 30 places in 202 ms of which 2 ms to minimize.
[2024-05-27 17:45:23] [INFO ] Deduced a trap composed of 41 places in 140 ms of which 2 ms to minimize.
[2024-05-27 17:45:23] [INFO ] Deduced a trap composed of 49 places in 137 ms of which 1 ms to minimize.
[2024-05-27 17:45:23] [INFO ] Deduced a trap composed of 49 places in 126 ms of which 1 ms to minimize.
[2024-05-27 17:45:26] [INFO ] Deduced a trap composed of 75 places in 183 ms of which 2 ms to minimize.
[2024-05-27 17:45:26] [INFO ] Deduced a trap composed of 84 places in 188 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 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: 0/1521 constraints, Known Traps: 39/39 constraints]
After SMT, in 63971ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 63986ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 67353 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 91 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 362 steps (0 resets) in 15 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 177 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)]
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 816 reset in 1003 ms.
Product exploration explored 100000 steps with 895 reset in 1008 ms.
Built C files in :
/tmp/ltsmin12490827815205556893
[2024-05-27 17:45:31] [INFO ] Too many transitions (1531) to apply POR reductions. Disabling POR matrices.
[2024-05-27 17:45:31] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12490827815205556893
Running compilation step : cd /tmp/ltsmin12490827815205556893;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12490827815205556893;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12490827815205556893;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 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 115 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-27 17:45:34] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 17:45:34] [INFO ] Invariant cache hit.
[2024-05-27 17:45:36] [INFO ] Implicit Places using invariants in 1099 ms returned []
[2024-05-27 17:45:36] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 17:45:36] [INFO ] Invariant cache hit.
[2024-05-27 17:45:36] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 17:45:38] [INFO ] Implicit Places using invariants and state equation in 2252 ms returned []
Implicit Place search using SMT with State Equation took 3352 ms to find 0 implicit places.
[2024-05-27 17:45:38] [INFO ] Redundant transitions in 22 ms returned []
Running 1521 sub problems to find dead transitions.
[2024-05-27 17:45:38] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 17:45:38] [INFO ] Invariant cache hit.
[2024-05-27 17:45:38] [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-05-27 17:45:51] [INFO ] Deduced a trap composed of 40 places in 190 ms of which 2 ms to minimize.
[2024-05-27 17:46:01] [INFO ] Deduced a trap composed of 49 places in 207 ms of which 2 ms to minimize.
[2024-05-27 17:46:01] [INFO ] Deduced a trap composed of 41 places in 197 ms of which 2 ms to minimize.
[2024-05-27 17:46:01] [INFO ] Deduced a trap composed of 41 places in 300 ms of which 2 ms to minimize.
[2024-05-27 17:46:04] [INFO ] Deduced a trap composed of 42 places in 198 ms of which 2 ms to minimize.
[2024-05-27 17:46:04] [INFO ] Deduced a trap composed of 41 places in 206 ms of which 2 ms to minimize.
[2024-05-27 17:46:05] [INFO ] Deduced a trap composed of 39 places in 211 ms of which 2 ms to minimize.
[2024-05-27 17:46:05] [INFO ] Deduced a trap composed of 41 places in 201 ms of which 2 ms to minimize.
[2024-05-27 17:46:05] [INFO ] Deduced a trap composed of 40 places in 209 ms of which 2 ms to minimize.
[2024-05-27 17:46:05] [INFO ] Deduced a trap composed of 41 places in 209 ms of which 2 ms to minimize.
[2024-05-27 17:46:06] [INFO ] Deduced a trap composed of 38 places in 209 ms of which 2 ms to minimize.
[2024-05-27 17:46:06] [INFO ] Deduced a trap composed of 35 places in 200 ms of which 2 ms to minimize.
[2024-05-27 17:46:06] [INFO ] Deduced a trap composed of 57 places in 139 ms of which 1 ms to minimize.
[2024-05-27 17:46:06] [INFO ] Deduced a trap composed of 41 places in 146 ms of which 2 ms to minimize.
[2024-05-27 17:46:06] [INFO ] Deduced a trap composed of 49 places in 115 ms of which 2 ms to minimize.
[2024-05-27 17:46:07] [INFO ] Deduced a trap composed of 49 places in 104 ms of which 1 ms to minimize.
[2024-05-27 17:46:07] [INFO ] Deduced a trap composed of 49 places in 88 ms of which 1 ms to minimize.
[2024-05-27 17:46:07] [INFO ] Deduced a trap composed of 51 places in 102 ms of which 1 ms to minimize.
[2024-05-27 17:46:07] [INFO ] Deduced a trap composed of 49 places in 101 ms of which 1 ms to minimize.
[2024-05-27 17:46:07] [INFO ] Deduced a trap composed of 34 places in 211 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 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: 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-05-27 17:46:27] [INFO ] Deduced a trap composed of 21 places in 211 ms of which 2 ms to minimize.
[2024-05-27 17:46:27] [INFO ] Deduced a trap composed of 21 places in 205 ms of which 2 ms to minimize.
[2024-05-27 17:46:27] [INFO ] Deduced a trap composed of 30 places in 205 ms of which 1 ms to minimize.
[2024-05-27 17:46:27] [INFO ] Deduced a trap composed of 21 places in 202 ms of which 2 ms to minimize.
[2024-05-27 17:46:28] [INFO ] Deduced a trap composed of 31 places in 214 ms of which 2 ms to minimize.
[2024-05-27 17:46:28] [INFO ] Deduced a trap composed of 21 places in 209 ms of which 2 ms to minimize.
[2024-05-27 17:46:28] [INFO ] Deduced a trap composed of 34 places in 207 ms of which 2 ms to minimize.
[2024-05-27 17:46:28] [INFO ] Deduced a trap composed of 21 places in 202 ms of which 2 ms to minimize.
[2024-05-27 17:46:30] [INFO ] Deduced a trap composed of 57 places in 86 ms of which 2 ms to minimize.
[2024-05-27 17:46:30] [INFO ] Deduced a trap composed of 49 places in 91 ms of which 2 ms to minimize.
[2024-05-27 17:46:30] [INFO ] Deduced a trap composed of 41 places in 91 ms of which 2 ms to minimize.
[2024-05-27 17:46:31] [INFO ] Deduced a trap composed of 49 places in 140 ms of which 2 ms to minimize.
[2024-05-27 17:46:36] [INFO ] Deduced a trap composed of 35 places in 143 ms of which 2 ms to minimize.
[2024-05-27 17:46:37] [INFO ] Deduced a trap composed of 30 places in 202 ms of which 2 ms to minimize.
[2024-05-27 17:46:37] [INFO ] Deduced a trap composed of 41 places in 139 ms of which 1 ms to minimize.
[2024-05-27 17:46:37] [INFO ] Deduced a trap composed of 49 places in 126 ms of which 2 ms to minimize.
[2024-05-27 17:46:38] [INFO ] Deduced a trap composed of 49 places in 132 ms of which 1 ms to minimize.
[2024-05-27 17:46:40] [INFO ] Deduced a trap composed of 75 places in 195 ms of which 2 ms to minimize.
[2024-05-27 17:46:41] [INFO ] Deduced a trap composed of 84 places in 187 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 64123ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 64138ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 67639 ms. Remains : 306/306 places, 1531/1531 transitions.
Built C files in :
/tmp/ltsmin6088078991084683821
[2024-05-27 17:46:42] [INFO ] Too many transitions (1531) to apply POR reductions. Disabling POR matrices.
[2024-05-27 17:46:42] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6088078991084683821
Running compilation step : cd /tmp/ltsmin6088078991084683821;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6088078991084683821;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6088078991084683821;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-27 17:46:45] [INFO ] Flatten gal took : 50 ms
[2024-05-27 17:46:45] [INFO ] Flatten gal took : 50 ms
[2024-05-27 17:46:45] [INFO ] Time to serialize gal into /tmp/LTL8987069753197015508.gal : 7 ms
[2024-05-27 17:46:45] [INFO ] Time to serialize properties into /tmp/LTL8206494140887779546.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8987069753197015508.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11402441979843783717.hoa' '-atoms' '/tmp/LTL8206494140887779546.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL8206494140887779546.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11402441979843783717.hoa
Detected timeout of ITS tools.
[2024-05-27 17:47:00] [INFO ] Flatten gal took : 51 ms
[2024-05-27 17:47:00] [INFO ] Flatten gal took : 52 ms
[2024-05-27 17:47:00] [INFO ] Time to serialize gal into /tmp/LTL14171814403851687711.gal : 8 ms
[2024-05-27 17:47:00] [INFO ] Time to serialize properties into /tmp/LTL3022755832425665007.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14171814403851687711.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3022755832425665007.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G((F("(((((((((PMC_7==0)||(wait_cable_7==0))&&((PMC_10==0)||(wait_cable_10==0)))&&(((PMC_1==0)||(wait_cable_1==0))&&((PMC_8==0)||...6700
Formula 0 simplified : XF(!"(((((((((RMC_3==0)||(wait_cable_3==0))&&((RMC_7==0)||(wait_cable_7==0)))&&(((RMC_1==0)||(wait_cable_1==0))&&((RMC_5==0)||(wait_...6692
Detected timeout of ITS tools.
[2024-05-27 17:47:15] [INFO ] Flatten gal took : 51 ms
[2024-05-27 17:47:15] [INFO ] Applying decomposition
[2024-05-27 17:47:16] [INFO ] Flatten gal took : 51 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14729276416910497870.txt' '-o' '/tmp/graph14729276416910497870.bin' '-w' '/tmp/graph14729276416910497870.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14729276416910497870.bin' '-l' '-1' '-v' '-w' '/tmp/graph14729276416910497870.weights' '-q' '0' '-e' '0.001'
[2024-05-27 17:47:16] [INFO ] Decomposing Gal with order
[2024-05-27 17:47:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 17:47:16] [INFO ] Removed a total of 2575 redundant transitions.
[2024-05-27 17:47:16] [INFO ] Flatten gal took : 163 ms
[2024-05-27 17:47:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 902 labels/synchronizations in 33 ms.
[2024-05-27 17:47:16] [INFO ] Time to serialize gal into /tmp/LTL2281833319074925521.gal : 22 ms
[2024-05-27 17:47:16] [INFO ] Time to serialize properties into /tmp/LTL17234054008339209612.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2281833319074925521.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17234054008339209612.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(G((F("(((((((((i0.i0.u2.PMC_7==0)||(i0.i0.u2.wait_cable_7==0))&&((i0.i0.u2.PMC_10==0)||(i0.i1.u17.wait_cable_10==0)))&&(((i0.i0.u...10296
Formula 0 simplified : XF(!"(((((((((i2.u7.RMC_3==0)||(i0.i0.u2.wait_cable_3==0))&&((i2.u7.RMC_7==0)||(i0.i0.u2.wait_cable_7==0)))&&(((i2.u7.RMC_1==0)||(i0...10288
Detected timeout of ITS tools.
Treatment of property SafeBus-PT-10-LTLFireability-00 finished in 259961 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-05-27 17:47:31] [INFO ] Flatten gal took : 51 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12826196975547979517
[2024-05-27 17:47:31] [INFO ] Too many transitions (1531) to apply POR reductions. Disabling POR matrices.
[2024-05-27 17:47:31] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12826196975547979517
Running compilation step : cd /tmp/ltsmin12826196975547979517;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-27 17:47:31] [INFO ] Applying decomposition
[2024-05-27 17:47:31] [INFO ] Flatten gal took : 52 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11899789617205699510.txt' '-o' '/tmp/graph11899789617205699510.bin' '-w' '/tmp/graph11899789617205699510.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11899789617205699510.bin' '-l' '-1' '-v' '-w' '/tmp/graph11899789617205699510.weights' '-q' '0' '-e' '0.001'
[2024-05-27 17:47:31] [INFO ] Decomposing Gal with order
[2024-05-27 17:47:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 17:47:32] [INFO ] Removed a total of 2423 redundant transitions.
[2024-05-27 17:47:32] [INFO ] Flatten gal took : 156 ms
[2024-05-27 17:47:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 965 labels/synchronizations in 20 ms.
[2024-05-27 17:47:32] [INFO ] Time to serialize gal into /tmp/LTLFireability1949538973123706428.gal : 6 ms
[2024-05-27 17:47:32] [INFO ] Time to serialize properties into /tmp/LTLFireability3964022138807376403.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability1949538973123706428.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3964022138807376403.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 3 LTL properties
Checking formula 0 : !((X(G(("(((((((((i1.u6.RMC_3==0)||(i0.i0.u2.wait_cable_3==0))&&((i1.u6.RMC_7==0)||(i0.i0.u2.wait_cable_7==0)))&&(((i1.u6.RMC_1==0)||(...10319
Formula 0 simplified : XF(!"(((((((((i1.u6.RMC_3==0)||(i0.i0.u2.wait_cable_3==0))&&((i1.u6.RMC_7==0)||(i0.i0.u2.wait_cable_7==0)))&&(((i1.u6.RMC_1==0)||(i0...10311
Compilation finished in 3928 ms.
Running link step : cd /tmp/ltsmin12826196975547979517;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin12826196975547979517;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](((LTLAPp0==true)||<>((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin12826196975547979517;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](((LTLAPp0==true)||<>((LTLAPp1==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin12826196975547979517;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((X(!(LTLAPp2==true))&&((!(LTLAPp2==true)||X(!(LTLAPp3==true))) U ([]((!(LTLAPp2==true)||X(!(LTLAPp3==true))))||((!(LTLAPp2==true)||X(!(LTLAPp3==true)))&&(LTLAPp4==true))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin12826196975547979517;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((X(!(LTLAPp2==true))&&((!(LTLAPp2==true)||X(!(LTLAPp3==true))) U ([]((!(LTLAPp2==true)||X(!(LTLAPp3==true))))||((!(LTLAPp2==true)||X(!(LTLAPp3==true)))&&(LTLAPp4==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin12826196975547979517;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp5==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin12826196975547979517;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp5==true)))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 9600 s
Running LTSmin : cd /tmp/ltsmin12826196975547979517;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](((LTLAPp0==true)||<>((LTLAPp1==true)))))' '--buchi-type=spotba'
ITS-tools command line returned an error code 137
[2024-05-27 18:13:06] [INFO ] Applying decomposition
[2024-05-27 18:13:06] [INFO ] Flatten gal took : 157 ms
[2024-05-27 18:13:06] [INFO ] Decomposing Gal with order
[2024-05-27 18:13:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 18:13:07] [INFO ] Removed a total of 4785 redundant transitions.
[2024-05-27 18:13:07] [INFO ] Flatten gal took : 361 ms
[2024-05-27 18:13:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 421 labels/synchronizations in 86 ms.
[2024-05-27 18:13:07] [INFO ] Time to serialize gal into /tmp/LTLFireability3432193030801447717.gal : 17 ms
[2024-05-27 18:13:07] [INFO ] Time to serialize properties into /tmp/LTLFireability11447323114268688127.ltl : 11 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability3432193030801447717.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11447323114268688127.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 3 LTL properties
Checking formula 0 : !((X(G(("(((((((((u2.RMC_3==0)||(u30.wait_cable_3==0))&&((u9.RMC_7==0)||(u34.wait_cable_7==0)))&&(((u3.RMC_1==0)||(u28.wait_cable_1==0...8087
Formula 0 simplified : XF(!"(((((((((u2.RMC_3==0)||(u30.wait_cable_3==0))&&((u9.RMC_7==0)||(u34.wait_cable_7==0)))&&(((u3.RMC_1==0)||(u28.wait_cable_1==0))...8079

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is 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 r334-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 ;