About the Execution of ITS-Tools for SafeBus-COL-10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16204.483 | 3600000.00 | 8618054.00 | 7206.50 | ?TFFFFFFFF?FFT?? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r334-tall-171679080200372.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-COL-10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r334-tall-171679080200372
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 8.0K Apr 12 15:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Apr 12 15:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Apr 12 15:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 12 15:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 23 07:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 23 07:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 15:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Apr 12 15:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 12 15:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 12 15:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 42K May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME SafeBus-COL-10-LTLFireability-00
FORMULA_NAME SafeBus-COL-10-LTLFireability-01
FORMULA_NAME SafeBus-COL-10-LTLFireability-02
FORMULA_NAME SafeBus-COL-10-LTLFireability-03
FORMULA_NAME SafeBus-COL-10-LTLFireability-04
FORMULA_NAME SafeBus-COL-10-LTLFireability-05
FORMULA_NAME SafeBus-COL-10-LTLFireability-06
FORMULA_NAME SafeBus-COL-10-LTLFireability-07
FORMULA_NAME SafeBus-COL-10-LTLFireability-08
FORMULA_NAME SafeBus-COL-10-LTLFireability-09
FORMULA_NAME SafeBus-COL-10-LTLFireability-10
FORMULA_NAME SafeBus-COL-10-LTLFireability-11
FORMULA_NAME SafeBus-COL-10-LTLFireability-12
FORMULA_NAME SafeBus-COL-10-LTLFireability-13
FORMULA_NAME SafeBus-COL-10-LTLFireability-14
FORMULA_NAME SafeBus-COL-10-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716822926181
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SafeBus-COL-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202405141337
[2024-05-27 15:15:27] [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 15:15:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 15:15:27] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-27 15:15:27] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-27 15:15:27] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 544 ms
[2024-05-27 15:15:27] [INFO ] Detected 1 constant HL places corresponding to 10 PT places.
[2024-05-27 15:15:27] [INFO ] Imported 20 HL places and 14 HL transitions for a total of 326 PT places and 12821.0 transition bindings in 21 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2024-05-27 15:15:28] [INFO ] Built PT skeleton of HLPN with 20 places and 14 transitions 68 arcs in 5 ms.
[2024-05-27 15:15:28] [INFO ] Skeletonized 13 HLPN properties in 1 ms. Removed 3 properties that had guard overlaps.
Initial state reduction rules removed 2 formulas.
FORMULA SafeBus-COL-10-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-COL-10-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3 stabilizing places and 0 stable transitions
Remains 10 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Reduction of identical properties reduced properties to check from 12 to 11
RANDOM walk for 279 steps (0 resets) in 26 ms. (10 steps per ms) remains 0/11 properties
[2024-05-27 15:15:28] [INFO ] Flatten gal took : 16 ms
[2024-05-27 15:15:28] [INFO ] Flatten gal took : 4 ms
Domain [It(10), It(10)] of place AMC breaks symmetries in sort It
[2024-05-27 15:15:28] [INFO ] Unfolded HLPN to a Petri net with 326 places and 1651 transitions 11294 arcs in 51 ms.
[2024-05-27 15:15:28] [INFO ] Unfolded 14 HLPN properties in 19 ms.
Initial state reduction rules removed 1 formulas.
[2024-05-27 15:15:28] [INFO ] Reduced 80 identical enabling conditions.
[2024-05-27 15:15:28] [INFO ] Reduced 80 identical enabling conditions.
[2024-05-27 15:15:28] [INFO ] Reduced 80 identical enabling conditions.
[2024-05-27 15:15:28] [INFO ] Reduced 80 identical enabling conditions.
Deduced a syphon composed of 10 places in 4 ms
Reduce places removed 20 places and 20 transitions.
FORMULA SafeBus-COL-10-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 215 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 25 ms. Remains 306 /306 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
[2024-05-27 15:15:28] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
// Phase 1: matrix 642 rows 306 cols
[2024-05-27 15:15:28] [INFO ] Computed 45 invariants in 56 ms
[2024-05-27 15:15:29] [INFO ] Implicit Places using invariants in 329 ms returned []
[2024-05-27 15:15:29] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2024-05-27 15:15:29] [INFO ] Invariant cache hit.
[2024-05-27 15:15:29] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 15:15:29] [INFO ] Implicit Places using invariants and state equation in 497 ms returned []
Implicit Place search using SMT with State Equation took 853 ms to find 0 implicit places.
Running 1621 sub problems to find dead transitions.
[2024-05-27 15:15:29] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2024-05-27 15:15:29] [INFO ] Invariant cache hit.
[2024-05-27 15:15:29] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1621 unsolved
Problem TDEAD91 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD902 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD935 is UNSAT
Problem TDEAD946 is UNSAT
Problem TDEAD957 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD1002 is UNSAT
Problem TDEAD1013 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1046 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1068 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1090 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
[2024-05-27 15:15:43] [INFO ] Deduced a trap composed of 39 places in 252 ms of which 30 ms to minimize.
[2024-05-27 15:15:43] [INFO ] Deduced a trap composed of 52 places in 283 ms of which 8 ms to minimize.
[2024-05-27 15:15:43] [INFO ] Deduced a trap composed of 58 places in 220 ms of which 3 ms to minimize.
[2024-05-27 15:15:43] [INFO ] Deduced a trap composed of 53 places in 150 ms of which 2 ms to minimize.
[2024-05-27 15:15:43] [INFO ] Deduced a trap composed of 59 places in 132 ms of which 2 ms to minimize.
[2024-05-27 15:15:44] [INFO ] Deduced a trap composed of 58 places in 121 ms of which 2 ms to minimize.
[2024-05-27 15:15:44] [INFO ] Deduced a trap composed of 47 places in 126 ms of which 2 ms to minimize.
[2024-05-27 15:15:44] [INFO ] Deduced a trap composed of 36 places in 112 ms of which 2 ms to minimize.
[2024-05-27 15:15:44] [INFO ] Deduced a trap composed of 40 places in 140 ms of which 2 ms to minimize.
[2024-05-27 15:15:44] [INFO ] Deduced a trap composed of 37 places in 155 ms of which 2 ms to minimize.
[2024-05-27 15:15:53] [INFO ] Deduced a trap composed of 30 places in 222 ms of which 2 ms to minimize.
[2024-05-27 15:15:53] [INFO ] Deduced a trap composed of 34 places in 214 ms of which 2 ms to minimize.
[2024-05-27 15:15:53] [INFO ] Deduced a trap composed of 34 places in 290 ms of which 2 ms to minimize.
[2024-05-27 15:15:54] [INFO ] Deduced a trap composed of 32 places in 270 ms of which 2 ms to minimize.
[2024-05-27 15:15:54] [INFO ] Deduced a trap composed of 34 places in 217 ms of which 2 ms to minimize.
[2024-05-27 15:15:54] [INFO ] Deduced a trap composed of 30 places in 216 ms of which 2 ms to minimize.
[2024-05-27 15:15:54] [INFO ] Deduced a trap composed of 26 places in 207 ms of which 2 ms to minimize.
[2024-05-27 15:15:55] [INFO ] Deduced a trap composed of 30 places in 216 ms of which 2 ms to minimize.
[2024-05-27 15:15:55] [INFO ] Deduced a trap composed of 30 places in 208 ms of which 2 ms to minimize.
[2024-05-27 15:15:56] [INFO ] Deduced a trap composed of 41 places in 203 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/948 variables, and 65 constraints, problems are : Problem set: 100 solved, 1521 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1621/1621 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 100 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
[2024-05-27 15:16:15] [INFO ] Deduced a trap composed of 49 places in 125 ms of which 1 ms to minimize.
[2024-05-27 15:16:15] [INFO ] Deduced a trap composed of 41 places in 121 ms of which 3 ms to minimize.
[2024-05-27 15:16:16] [INFO ] Deduced a trap composed of 49 places in 122 ms of which 2 ms to minimize.
[2024-05-27 15:16:16] [INFO ] Deduced a trap composed of 58 places in 128 ms of which 2 ms to minimize.
[2024-05-27 15:16:16] [INFO ] Deduced a trap composed of 49 places in 122 ms of which 2 ms to minimize.
[2024-05-27 15:16:16] [INFO ] Deduced a trap composed of 49 places in 123 ms of which 2 ms to minimize.
[2024-05-27 15:16:16] [INFO ] Deduced a trap composed of 49 places in 137 ms of which 2 ms to minimize.
[2024-05-27 15:16:16] [INFO ] Deduced a trap composed of 49 places in 202 ms of which 2 ms to minimize.
[2024-05-27 15:16:17] [INFO ] Deduced a trap composed of 41 places in 205 ms of which 2 ms to minimize.
[2024-05-27 15:16:17] [INFO ] Deduced a trap composed of 41 places in 209 ms of which 1 ms to minimize.
[2024-05-27 15:16:20] [INFO ] Deduced a trap composed of 47 places in 218 ms of which 2 ms to minimize.
[2024-05-27 15:16:20] [INFO ] Deduced a trap composed of 45 places in 217 ms of which 2 ms to minimize.
[2024-05-27 15:16:20] [INFO ] Deduced a trap composed of 42 places in 213 ms of which 2 ms to minimize.
[2024-05-27 15:16:20] [INFO ] Deduced a trap composed of 42 places in 213 ms of which 2 ms to minimize.
[2024-05-27 15:16:20] [INFO ] Deduced a trap composed of 48 places in 227 ms of which 14 ms to minimize.
[2024-05-27 15:16:21] [INFO ] Deduced a trap composed of 47 places in 224 ms of which 2 ms to minimize.
[2024-05-27 15:16:21] [INFO ] Deduced a trap composed of 44 places in 215 ms of which 2 ms to minimize.
[2024-05-27 15:16:21] [INFO ] Deduced a trap composed of 46 places in 223 ms of which 2 ms to minimize.
[2024-05-27 15:16:22] [INFO ] Deduced a trap composed of 59 places in 150 ms of which 1 ms to minimize.
[2024-05-27 15:16:22] [INFO ] Deduced a trap composed of 51 places in 145 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 20/85 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
[2024-05-27 15:16:31] [INFO ] Deduced a trap composed of 21 places in 209 ms of which 2 ms to minimize.
[2024-05-27 15:16:32] [INFO ] Deduced a trap composed of 30 places in 211 ms of which 1 ms to minimize.
[2024-05-27 15:16:32] [INFO ] Deduced a trap composed of 30 places in 205 ms of which 2 ms to minimize.
[2024-05-27 15:16:33] [INFO ] Deduced a trap composed of 57 places in 140 ms of which 2 ms to minimize.
[2024-05-27 15:16:33] [INFO ] Deduced a trap composed of 49 places in 130 ms of which 2 ms to minimize.
[2024-05-27 15:16:33] [INFO ] Deduced a trap composed of 49 places in 220 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/948 variables, and 91 constraints, problems are : Problem set: 100 solved, 1521 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1621 constraints, Known Traps: 46/46 constraints]
After SMT, in 64598ms problems are : Problem set: 100 solved, 1521 unsolved
Search for dead transitions found 100 dead transitions in 64631ms
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 9 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 65546 ms. Remains : 306/306 places, 1531/1631 transitions.
Support contains 215 out of 306 places after structural reductions.
[2024-05-27 15:16:34] [INFO ] Flatten gal took : 214 ms
[2024-05-27 15:16:35] [INFO ] Flatten gal took : 182 ms
[2024-05-27 15:16:36] [INFO ] Input system was already deterministic with 1531 transitions.
Reduction of identical properties reduced properties to check from 14 to 13
RANDOM walk for 167 steps (0 resets) in 62 ms. (2 steps per ms) remains 0/13 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 23 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-27 15:16:36] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 15:16:36] [INFO ] Invariant cache hit.
[2024-05-27 15:16:37] [INFO ] Implicit Places using invariants in 361 ms returned []
[2024-05-27 15:16:37] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 15:16:37] [INFO ] Invariant cache hit.
[2024-05-27 15:16:37] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 15:16:38] [INFO ] Implicit Places using invariants and state equation in 1512 ms returned []
Implicit Place search using SMT with State Equation took 1875 ms to find 0 implicit places.
Running 1521 sub problems to find dead transitions.
[2024-05-27 15:16:38] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 15:16:38] [INFO ] Invariant cache hit.
[2024-05-27 15:16:38] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-27 15:16:51] [INFO ] Deduced a trap composed of 35 places in 204 ms of which 2 ms to minimize.
[2024-05-27 15:16:51] [INFO ] Deduced a trap composed of 59 places in 206 ms of which 2 ms to minimize.
[2024-05-27 15:16:51] [INFO ] Deduced a trap composed of 42 places in 199 ms of which 2 ms to minimize.
[2024-05-27 15:16:51] [INFO ] Deduced a trap composed of 56 places in 140 ms of which 2 ms to minimize.
[2024-05-27 15:16:52] [INFO ] Deduced a trap composed of 40 places in 132 ms of which 3 ms to minimize.
[2024-05-27 15:16:52] [INFO ] Deduced a trap composed of 50 places in 141 ms of which 1 ms to minimize.
[2024-05-27 15:16:52] [INFO ] Deduced a trap composed of 49 places in 130 ms of which 2 ms to minimize.
[2024-05-27 15:16:52] [INFO ] Deduced a trap composed of 48 places in 115 ms of which 2 ms to minimize.
[2024-05-27 15:17:01] [INFO ] Deduced a trap composed of 31 places in 223 ms of which 2 ms to minimize.
[2024-05-27 15:17:01] [INFO ] Deduced a trap composed of 30 places in 222 ms of which 2 ms to minimize.
[2024-05-27 15:17:01] [INFO ] Deduced a trap composed of 30 places in 227 ms of which 2 ms to minimize.
[2024-05-27 15:17:01] [INFO ] Deduced a trap composed of 21 places in 227 ms of which 2 ms to minimize.
[2024-05-27 15:17:02] [INFO ] Deduced a trap composed of 30 places in 227 ms of which 2 ms to minimize.
[2024-05-27 15:17:02] [INFO ] Deduced a trap composed of 30 places in 226 ms of which 2 ms to minimize.
[2024-05-27 15:17:02] [INFO ] Deduced a trap composed of 21 places in 220 ms of which 2 ms to minimize.
[2024-05-27 15:17:02] [INFO ] Deduced a trap composed of 30 places in 221 ms of which 2 ms to minimize.
[2024-05-27 15:17:03] [INFO ] Deduced a trap composed of 30 places in 227 ms of which 2 ms to minimize.
[2024-05-27 15:17:04] [INFO ] Deduced a trap composed of 65 places in 227 ms of which 3 ms to minimize.
[2024-05-27 15:17:04] [INFO ] Deduced a trap composed of 49 places in 202 ms of which 2 ms to minimize.
[2024-05-27 15:17:04] [INFO ] Deduced a trap composed of 49 places in 200 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 timeout
0.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/948 variables, and 65 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-27 15:17:24] [INFO ] Deduced a trap composed of 65 places in 128 ms of which 2 ms to minimize.
[2024-05-27 15:17:24] [INFO ] Deduced a trap composed of 65 places in 124 ms of which 2 ms to minimize.
[2024-05-27 15:17:24] [INFO ] Deduced a trap composed of 65 places in 121 ms of which 2 ms to minimize.
[2024-05-27 15:17:24] [INFO ] Deduced a trap composed of 57 places in 136 ms of which 2 ms to minimize.
[2024-05-27 15:17:24] [INFO ] Deduced a trap composed of 50 places in 139 ms of which 1 ms to minimize.
[2024-05-27 15:17:24] [INFO ] Deduced a trap composed of 44 places in 139 ms of which 4 ms to minimize.
[2024-05-27 15:17:25] [INFO ] Deduced a trap composed of 65 places in 201 ms of which 2 ms to minimize.
[2024-05-27 15:17:25] [INFO ] Deduced a trap composed of 57 places in 196 ms of which 2 ms to minimize.
[2024-05-27 15:17:28] [INFO ] Deduced a trap composed of 44 places in 224 ms of which 2 ms to minimize.
[2024-05-27 15:17:28] [INFO ] Deduced a trap composed of 41 places in 226 ms of which 3 ms to minimize.
[2024-05-27 15:17:28] [INFO ] Deduced a trap composed of 53 places in 222 ms of which 3 ms to minimize.
[2024-05-27 15:17:28] [INFO ] Deduced a trap composed of 41 places in 222 ms of which 2 ms to minimize.
[2024-05-27 15:17:29] [INFO ] Deduced a trap composed of 40 places in 225 ms of which 2 ms to minimize.
[2024-05-27 15:17:29] [INFO ] Deduced a trap composed of 59 places in 151 ms of which 2 ms to minimize.
[2024-05-27 15:17:29] [INFO ] Deduced a trap composed of 49 places in 139 ms of which 2 ms to minimize.
[2024-05-27 15:17:29] [INFO ] Deduced a trap composed of 49 places in 133 ms of which 1 ms to minimize.
[2024-05-27 15:17:29] [INFO ] Deduced a trap composed of 57 places in 114 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 17/82 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-27 15:17:41] [INFO ] Deduced a trap composed of 49 places in 148 ms of which 2 ms to minimize.
[2024-05-27 15:17:41] [INFO ] Deduced a trap composed of 49 places in 142 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/948 variables, and 84 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 39/39 constraints]
After SMT, in 64315ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 64335ms
Finished structural reductions in LTL mode , in 1 iterations and 66239 ms. Remains : 306/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 325 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : SafeBus-COL-10-LTLFireability-00
Product exploration explored 100000 steps with 840 reset in 944 ms.
Product exploration explored 100000 steps with 842 reset in 804 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 126 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 116 steps (0 resets) in 17 ms. (6 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 170 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 81 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 75 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 229 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-27 15:17:46] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 15:17:46] [INFO ] Invariant cache hit.
[2024-05-27 15:17:46] [INFO ] Implicit Places using invariants in 402 ms returned []
[2024-05-27 15:17:46] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 15:17:46] [INFO ] Invariant cache hit.
[2024-05-27 15:17:46] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 15:17:48] [INFO ] Implicit Places using invariants and state equation in 1569 ms returned []
Implicit Place search using SMT with State Equation took 1974 ms to find 0 implicit places.
[2024-05-27 15:17:48] [INFO ] Redundant transitions in 94 ms returned []
Running 1521 sub problems to find dead transitions.
[2024-05-27 15:17:48] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 15:17:48] [INFO ] Invariant cache hit.
[2024-05-27 15:17:48] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-27 15:18:00] [INFO ] Deduced a trap composed of 35 places in 202 ms of which 2 ms to minimize.
[2024-05-27 15:18:00] [INFO ] Deduced a trap composed of 59 places in 199 ms of which 2 ms to minimize.
[2024-05-27 15:18:00] [INFO ] Deduced a trap composed of 42 places in 200 ms of which 2 ms to minimize.
[2024-05-27 15:18:00] [INFO ] Deduced a trap composed of 56 places in 152 ms of which 2 ms to minimize.
[2024-05-27 15:18:00] [INFO ] Deduced a trap composed of 40 places in 127 ms of which 2 ms to minimize.
[2024-05-27 15:18:01] [INFO ] Deduced a trap composed of 50 places in 136 ms of which 2 ms to minimize.
[2024-05-27 15:18:01] [INFO ] Deduced a trap composed of 49 places in 127 ms of which 2 ms to minimize.
[2024-05-27 15:18:01] [INFO ] Deduced a trap composed of 48 places in 119 ms of which 2 ms to minimize.
[2024-05-27 15:18:09] [INFO ] Deduced a trap composed of 31 places in 219 ms of which 1 ms to minimize.
[2024-05-27 15:18:09] [INFO ] Deduced a trap composed of 30 places in 202 ms of which 2 ms to minimize.
[2024-05-27 15:18:10] [INFO ] Deduced a trap composed of 30 places in 203 ms of which 2 ms to minimize.
[2024-05-27 15:18:10] [INFO ] Deduced a trap composed of 21 places in 201 ms of which 2 ms to minimize.
[2024-05-27 15:18:10] [INFO ] Deduced a trap composed of 30 places in 202 ms of which 2 ms to minimize.
[2024-05-27 15:18:10] [INFO ] Deduced a trap composed of 30 places in 201 ms of which 2 ms to minimize.
[2024-05-27 15:18:11] [INFO ] Deduced a trap composed of 21 places in 203 ms of which 2 ms to minimize.
[2024-05-27 15:18:11] [INFO ] Deduced a trap composed of 30 places in 208 ms of which 2 ms to minimize.
[2024-05-27 15:18:11] [INFO ] Deduced a trap composed of 30 places in 197 ms of which 1 ms to minimize.
[2024-05-27 15:18:12] [INFO ] Deduced a trap composed of 65 places in 199 ms of which 2 ms to minimize.
[2024-05-27 15:18:12] [INFO ] Deduced a trap composed of 49 places in 206 ms of which 2 ms to minimize.
[2024-05-27 15:18:12] [INFO ] Deduced a trap composed of 49 places in 205 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/948 variables, and 65 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-27 15:18:32] [INFO ] Deduced a trap composed of 65 places in 123 ms of which 2 ms to minimize.
[2024-05-27 15:18:32] [INFO ] Deduced a trap composed of 65 places in 120 ms of which 1 ms to minimize.
[2024-05-27 15:18:32] [INFO ] Deduced a trap composed of 65 places in 113 ms of which 1 ms to minimize.
[2024-05-27 15:18:32] [INFO ] Deduced a trap composed of 57 places in 136 ms of which 2 ms to minimize.
[2024-05-27 15:18:33] [INFO ] Deduced a trap composed of 50 places in 136 ms of which 1 ms to minimize.
[2024-05-27 15:18:33] [INFO ] Deduced a trap composed of 44 places in 133 ms of which 2 ms to minimize.
[2024-05-27 15:18:33] [INFO ] Deduced a trap composed of 65 places in 202 ms of which 2 ms to minimize.
[2024-05-27 15:18:33] [INFO ] Deduced a trap composed of 57 places in 197 ms of which 2 ms to minimize.
[2024-05-27 15:18:36] [INFO ] Deduced a trap composed of 44 places in 209 ms of which 2 ms to minimize.
[2024-05-27 15:18:36] [INFO ] Deduced a trap composed of 41 places in 202 ms of which 2 ms to minimize.
[2024-05-27 15:18:36] [INFO ] Deduced a trap composed of 53 places in 208 ms of which 2 ms to minimize.
[2024-05-27 15:18:36] [INFO ] Deduced a trap composed of 41 places in 212 ms of which 2 ms to minimize.
[2024-05-27 15:18:37] [INFO ] Deduced a trap composed of 40 places in 210 ms of which 1 ms to minimize.
[2024-05-27 15:18:37] [INFO ] Deduced a trap composed of 59 places in 146 ms of which 2 ms to minimize.
[2024-05-27 15:18:37] [INFO ] Deduced a trap composed of 49 places in 125 ms of which 1 ms to minimize.
[2024-05-27 15:18:37] [INFO ] Deduced a trap composed of 49 places in 121 ms of which 1 ms to minimize.
[2024-05-27 15:18:37] [INFO ] Deduced a trap composed of 57 places in 109 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 17/82 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-27 15:18:48] [INFO ] Deduced a trap composed of 49 places in 136 ms of which 2 ms to minimize.
[2024-05-27 15:18:48] [INFO ] Deduced a trap composed of 49 places in 141 ms of which 1 ms to minimize.
[2024-05-27 15:18:51] [INFO ] Deduced a trap composed of 41 places in 129 ms of which 2 ms to minimize.
[2024-05-27 15:18:51] [INFO ] Deduced a trap composed of 49 places in 107 ms of which 2 ms to minimize.
[2024-05-27 15:18:51] [INFO ] Deduced a trap composed of 51 places in 110 ms of which 2 ms to minimize.
SMT process timed out in 63784ms, After SMT, problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 63800ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 66111 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 108 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 64 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 169 steps (0 resets) in 9 ms. (16 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 147 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 56 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 888 reset in 745 ms.
Product exploration explored 100000 steps with 845 reset in 757 ms.
Built C files in :
/tmp/ltsmin4087369439913271825
[2024-05-27 15:18:54] [INFO ] Too many transitions (1531) to apply POR reductions. Disabling POR matrices.
[2024-05-27 15:18:54] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4087369439913271825
Running compilation step : cd /tmp/ltsmin4087369439913271825;'/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/ltsmin4087369439913271825;'/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/ltsmin4087369439913271825;'/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 131 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-27 15:18:57] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 15:18:57] [INFO ] Invariant cache hit.
[2024-05-27 15:18:57] [INFO ] Implicit Places using invariants in 365 ms returned []
[2024-05-27 15:18:57] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 15:18:57] [INFO ] Invariant cache hit.
[2024-05-27 15:18:57] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 15:18:59] [INFO ] Implicit Places using invariants and state equation in 1556 ms returned []
Implicit Place search using SMT with State Equation took 1923 ms to find 0 implicit places.
[2024-05-27 15:18:59] [INFO ] Redundant transitions in 27 ms returned []
Running 1521 sub problems to find dead transitions.
[2024-05-27 15:18:59] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 15:18:59] [INFO ] Invariant cache hit.
[2024-05-27 15:18:59] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-27 15:19:11] [INFO ] Deduced a trap composed of 35 places in 233 ms of which 2 ms to minimize.
[2024-05-27 15:19:11] [INFO ] Deduced a trap composed of 59 places in 202 ms of which 1 ms to minimize.
[2024-05-27 15:19:11] [INFO ] Deduced a trap composed of 42 places in 196 ms of which 2 ms to minimize.
[2024-05-27 15:19:11] [INFO ] Deduced a trap composed of 56 places in 140 ms of which 2 ms to minimize.
[2024-05-27 15:19:11] [INFO ] Deduced a trap composed of 40 places in 127 ms of which 2 ms to minimize.
[2024-05-27 15:19:11] [INFO ] Deduced a trap composed of 50 places in 138 ms of which 2 ms to minimize.
[2024-05-27 15:19:12] [INFO ] Deduced a trap composed of 49 places in 129 ms of which 2 ms to minimize.
[2024-05-27 15:19:12] [INFO ] Deduced a trap composed of 48 places in 134 ms of which 2 ms to minimize.
[2024-05-27 15:19:20] [INFO ] Deduced a trap composed of 31 places in 208 ms of which 2 ms to minimize.
[2024-05-27 15:19:20] [INFO ] Deduced a trap composed of 30 places in 204 ms of which 2 ms to minimize.
[2024-05-27 15:19:20] [INFO ] Deduced a trap composed of 30 places in 225 ms of which 2 ms to minimize.
[2024-05-27 15:19:21] [INFO ] Deduced a trap composed of 21 places in 225 ms of which 2 ms to minimize.
[2024-05-27 15:19:21] [INFO ] Deduced a trap composed of 30 places in 208 ms of which 2 ms to minimize.
[2024-05-27 15:19:21] [INFO ] Deduced a trap composed of 30 places in 202 ms of which 2 ms to minimize.
[2024-05-27 15:19:21] [INFO ] Deduced a trap composed of 21 places in 230 ms of which 2 ms to minimize.
[2024-05-27 15:19:22] [INFO ] Deduced a trap composed of 30 places in 230 ms of which 3 ms to minimize.
[2024-05-27 15:19:22] [INFO ] Deduced a trap composed of 30 places in 205 ms of which 2 ms to minimize.
[2024-05-27 15:19:23] [INFO ] Deduced a trap composed of 65 places in 221 ms of which 2 ms to minimize.
[2024-05-27 15:19:23] [INFO ] Deduced a trap composed of 49 places in 228 ms of which 2 ms to minimize.
[2024-05-27 15:19:23] [INFO ] Deduced a trap composed of 49 places in 211 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/948 variables, and 65 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-27 15:19:43] [INFO ] Deduced a trap composed of 65 places in 114 ms of which 2 ms to minimize.
[2024-05-27 15:19:43] [INFO ] Deduced a trap composed of 65 places in 119 ms of which 2 ms to minimize.
[2024-05-27 15:19:43] [INFO ] Deduced a trap composed of 65 places in 118 ms of which 2 ms to minimize.
[2024-05-27 15:19:43] [INFO ] Deduced a trap composed of 57 places in 133 ms of which 2 ms to minimize.
[2024-05-27 15:19:44] [INFO ] Deduced a trap composed of 50 places in 140 ms of which 2 ms to minimize.
[2024-05-27 15:19:44] [INFO ] Deduced a trap composed of 44 places in 134 ms of which 2 ms to minimize.
[2024-05-27 15:19:44] [INFO ] Deduced a trap composed of 65 places in 198 ms of which 2 ms to minimize.
[2024-05-27 15:19:44] [INFO ] Deduced a trap composed of 57 places in 196 ms of which 2 ms to minimize.
[2024-05-27 15:19:47] [INFO ] Deduced a trap composed of 44 places in 215 ms of which 2 ms to minimize.
[2024-05-27 15:19:47] [INFO ] Deduced a trap composed of 41 places in 207 ms of which 1 ms to minimize.
[2024-05-27 15:19:47] [INFO ] Deduced a trap composed of 53 places in 235 ms of which 2 ms to minimize.
[2024-05-27 15:19:47] [INFO ] Deduced a trap composed of 41 places in 229 ms of which 2 ms to minimize.
[2024-05-27 15:19:48] [INFO ] Deduced a trap composed of 40 places in 235 ms of which 2 ms to minimize.
[2024-05-27 15:19:48] [INFO ] Deduced a trap composed of 59 places in 147 ms of which 1 ms to minimize.
[2024-05-27 15:19:48] [INFO ] Deduced a trap composed of 49 places in 134 ms of which 2 ms to minimize.
[2024-05-27 15:19:48] [INFO ] Deduced a trap composed of 49 places in 142 ms of which 2 ms to minimize.
[2024-05-27 15:19:49] [INFO ] Deduced a trap composed of 57 places in 118 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 17/82 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-27 15:20:00] [INFO ] Deduced a trap composed of 49 places in 140 ms of which 1 ms to minimize.
[2024-05-27 15:20:00] [INFO ] Deduced a trap composed of 49 places in 143 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/948 variables, and 84 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 39/39 constraints]
After SMT, in 63765ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 63780ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 65871 ms. Remains : 306/306 places, 1531/1531 transitions.
Built C files in :
/tmp/ltsmin16914282805493469450
[2024-05-27 15:20:02] [INFO ] Too many transitions (1531) to apply POR reductions. Disabling POR matrices.
[2024-05-27 15:20:02] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16914282805493469450
Running compilation step : cd /tmp/ltsmin16914282805493469450;'/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/ltsmin16914282805493469450;'/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/ltsmin16914282805493469450;'/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 15:20:06] [INFO ] Flatten gal took : 78 ms
[2024-05-27 15:20:06] [INFO ] Flatten gal took : 81 ms
[2024-05-27 15:20:06] [INFO ] Time to serialize gal into /tmp/LTL14351962722345558224.gal : 28 ms
[2024-05-27 15:20:06] [INFO ] Time to serialize properties into /tmp/LTL3890284319286203033.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/LTL14351962722345558224.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5441727425726162610.hoa' '-atoms' '/tmp/LTL3890284319286203033.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/LTL3890284319286203033.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5441727425726162610.hoa
Detected timeout of ITS tools.
[2024-05-27 15:20:21] [INFO ] Flatten gal took : 60 ms
[2024-05-27 15:20:21] [INFO ] Flatten gal took : 60 ms
[2024-05-27 15:20:21] [INFO ] Time to serialize gal into /tmp/LTL11928732817381114863.gal : 12 ms
[2024-05-27 15:20:21] [INFO ] Time to serialize properties into /tmp/LTL10191622140322308006.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/LTL11928732817381114863.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10191622140322308006.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 : !((X(G((F("((((((wait_cable_5<1)||(PMC_5<1))&&((wait_cable_6<1)||(PMC_6<1)))&&(((wait_cable_7<1)||(PMC_7<1))&&((wait_cable_8<1)||(PMC_...3797
Formula 0 simplified : XF(!"(((((((((wait_cable_0<1)||(RMC_0<1))&&((wait_cable_4<1)||(RMC_4<1)))&&(((wait_cable_8<1)||(RMC_8<1))&&((wait_cable_1<1)||(RMC_1...3789
Detected timeout of ITS tools.
[2024-05-27 15:20:36] [INFO ] Flatten gal took : 58 ms
[2024-05-27 15:20:36] [INFO ] Applying decomposition
[2024-05-27 15:20:36] [INFO ] Flatten gal took : 57 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/graph15412100774664902915.txt' '-o' '/tmp/graph15412100774664902915.bin' '-w' '/tmp/graph15412100774664902915.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15412100774664902915.bin' '-l' '-1' '-v' '-w' '/tmp/graph15412100774664902915.weights' '-q' '0' '-e' '0.001'
[2024-05-27 15:20:37] [INFO ] Decomposing Gal with order
[2024-05-27 15:20:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 15:20:37] [INFO ] Removed a total of 2033 redundant transitions.
[2024-05-27 15:20:37] [INFO ] Flatten gal took : 428 ms
[2024-05-27 15:20:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 1083 labels/synchronizations in 61 ms.
[2024-05-27 15:20:37] [INFO ] Time to serialize gal into /tmp/LTL1165930252241771538.gal : 11 ms
[2024-05-27 15:20:37] [INFO ] Time to serialize properties into /tmp/LTL7551762267831189875.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/LTL1165930252241771538.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7551762267831189875.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("((((((i3.i0.u15.wait_cable_5<1)||(i3.i1.u10.PMC_5<1))&&((i3.i0.u16.wait_cable_6<1)||(i3.i1.u10.PMC_6<1)))&&(((i3.i0.u7.wait...6051
Formula 0 simplified : XF(!"(((((((((i3.i0.u13.wait_cable_0<1)||(i0.u12.RMC_0<1))&&((i3.i1.u10.wait_cable_4<1)||(i0.u12.RMC_4<1)))&&(((i3.i1.u10.wait_cable...6043
Detected timeout of ITS tools.
Treatment of property SafeBus-COL-10-LTLFireability-00 finished in 256010 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 (X(G(!p1))||(!p2&&X(!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 9 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-27 15:20:52] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 15:20:52] [INFO ] Invariant cache hit.
[2024-05-27 15:20:53] [INFO ] Implicit Places using invariants in 460 ms returned [231, 232, 233, 234, 235, 236, 237, 238, 239, 240]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 469 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 484 ms. Remains : 296/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 236 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-COL-10-LTLFireability-01
Product exploration explored 100000 steps with 33333 reset in 335 ms.
Product exploration explored 100000 steps with 33333 reset in 326 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 p1)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2)))), (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 11 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-COL-10-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SafeBus-COL-10-LTLFireability-01 finished in 1429 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 6 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-27 15:20:54] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 15:20:54] [INFO ] Invariant cache hit.
[2024-05-27 15:20:54] [INFO ] Implicit Places using invariants in 407 ms returned []
[2024-05-27 15:20:54] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 15:20:54] [INFO ] Invariant cache hit.
[2024-05-27 15:20:54] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 15:20:56] [INFO ] Implicit Places using invariants and state equation in 1855 ms returned []
Implicit Place search using SMT with State Equation took 2266 ms to find 0 implicit places.
Running 1521 sub problems to find dead transitions.
[2024-05-27 15:20:56] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 15:20:56] [INFO ] Invariant cache hit.
[2024-05-27 15:20:56] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-27 15:21:08] [INFO ] Deduced a trap composed of 35 places in 205 ms of which 3 ms to minimize.
[2024-05-27 15:21:08] [INFO ] Deduced a trap composed of 59 places in 200 ms of which 2 ms to minimize.
[2024-05-27 15:21:09] [INFO ] Deduced a trap composed of 42 places in 209 ms of which 2 ms to minimize.
[2024-05-27 15:21:09] [INFO ] Deduced a trap composed of 56 places in 138 ms of which 2 ms to minimize.
[2024-05-27 15:21:09] [INFO ] Deduced a trap composed of 40 places in 125 ms of which 2 ms to minimize.
[2024-05-27 15:21:09] [INFO ] Deduced a trap composed of 50 places in 136 ms of which 1 ms to minimize.
[2024-05-27 15:21:09] [INFO ] Deduced a trap composed of 49 places in 123 ms of which 1 ms to minimize.
[2024-05-27 15:21:09] [INFO ] Deduced a trap composed of 48 places in 122 ms of which 1 ms to minimize.
[2024-05-27 15:21:17] [INFO ] Deduced a trap composed of 31 places in 206 ms of which 2 ms to minimize.
[2024-05-27 15:21:18] [INFO ] Deduced a trap composed of 30 places in 207 ms of which 2 ms to minimize.
[2024-05-27 15:21:18] [INFO ] Deduced a trap composed of 30 places in 207 ms of which 2 ms to minimize.
[2024-05-27 15:21:18] [INFO ] Deduced a trap composed of 21 places in 200 ms of which 2 ms to minimize.
[2024-05-27 15:21:18] [INFO ] Deduced a trap composed of 30 places in 203 ms of which 1 ms to minimize.
[2024-05-27 15:21:19] [INFO ] Deduced a trap composed of 30 places in 208 ms of which 2 ms to minimize.
[2024-05-27 15:21:19] [INFO ] Deduced a trap composed of 21 places in 199 ms of which 2 ms to minimize.
[2024-05-27 15:21:19] [INFO ] Deduced a trap composed of 30 places in 210 ms of which 2 ms to minimize.
[2024-05-27 15:21:19] [INFO ] Deduced a trap composed of 30 places in 202 ms of which 2 ms to minimize.
[2024-05-27 15:21:20] [INFO ] Deduced a trap composed of 65 places in 205 ms of which 1 ms to minimize.
[2024-05-27 15:21:20] [INFO ] Deduced a trap composed of 49 places in 214 ms of which 2 ms to minimize.
[2024-05-27 15:21:21] [INFO ] Deduced a trap composed of 49 places in 207 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/948 variables, and 65 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-27 15:21:40] [INFO ] Deduced a trap composed of 65 places in 125 ms of which 1 ms to minimize.
[2024-05-27 15:21:41] [INFO ] Deduced a trap composed of 65 places in 143 ms of which 1 ms to minimize.
[2024-05-27 15:21:41] [INFO ] Deduced a trap composed of 65 places in 119 ms of which 1 ms to minimize.
[2024-05-27 15:21:41] [INFO ] Deduced a trap composed of 57 places in 136 ms of which 2 ms to minimize.
[2024-05-27 15:21:41] [INFO ] Deduced a trap composed of 50 places in 142 ms of which 2 ms to minimize.
[2024-05-27 15:21:41] [INFO ] Deduced a trap composed of 44 places in 133 ms of which 2 ms to minimize.
[2024-05-27 15:21:41] [INFO ] Deduced a trap composed of 65 places in 199 ms of which 2 ms to minimize.
[2024-05-27 15:21:42] [INFO ] Deduced a trap composed of 57 places in 194 ms of which 2 ms to minimize.
[2024-05-27 15:21:44] [INFO ] Deduced a trap composed of 44 places in 203 ms of which 1 ms to minimize.
[2024-05-27 15:21:44] [INFO ] Deduced a trap composed of 41 places in 201 ms of which 2 ms to minimize.
[2024-05-27 15:21:45] [INFO ] Deduced a trap composed of 53 places in 223 ms of which 2 ms to minimize.
[2024-05-27 15:21:45] [INFO ] Deduced a trap composed of 41 places in 208 ms of which 2 ms to minimize.
[2024-05-27 15:21:45] [INFO ] Deduced a trap composed of 40 places in 213 ms of which 2 ms to minimize.
[2024-05-27 15:21:45] [INFO ] Deduced a trap composed of 59 places in 146 ms of which 2 ms to minimize.
[2024-05-27 15:21:46] [INFO ] Deduced a trap composed of 49 places in 132 ms of which 1 ms to minimize.
[2024-05-27 15:21:46] [INFO ] Deduced a trap composed of 49 places in 127 ms of which 1 ms to minimize.
[2024-05-27 15:21:46] [INFO ] Deduced a trap composed of 57 places in 107 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 17/82 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-27 15:21:57] [INFO ] Deduced a trap composed of 49 places in 133 ms of which 2 ms to minimize.
[2024-05-27 15:21:57] [INFO ] Deduced a trap composed of 49 places in 139 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/948 variables, and 84 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 39/39 constraints]
After SMT, in 63761ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 63780ms
Finished structural reductions in LTL mode , in 1 iterations and 66058 ms. Remains : 306/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SafeBus-COL-10-LTLFireability-02
Entered a terminal (fully accepting) state of product in 15 steps with 0 reset in 1 ms.
FORMULA SafeBus-COL-10-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SafeBus-COL-10-LTLFireability-02 finished in 66145 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 6 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-27 15:22:00] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 15:22:00] [INFO ] Invariant cache hit.
[2024-05-27 15:22:00] [INFO ] Implicit Places using invariants in 335 ms returned []
[2024-05-27 15:22:00] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 15:22:00] [INFO ] Invariant cache hit.
[2024-05-27 15:22:00] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 15:22:02] [INFO ] Implicit Places using invariants and state equation in 1422 ms returned []
Implicit Place search using SMT with State Equation took 1763 ms to find 0 implicit places.
Running 1521 sub problems to find dead transitions.
[2024-05-27 15:22:02] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 15:22:02] [INFO ] Invariant cache hit.
[2024-05-27 15:22:02] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-27 15:22:14] [INFO ] Deduced a trap composed of 35 places in 228 ms of which 2 ms to minimize.
[2024-05-27 15:22:15] [INFO ] Deduced a trap composed of 59 places in 226 ms of which 2 ms to minimize.
[2024-05-27 15:22:15] [INFO ] Deduced a trap composed of 42 places in 229 ms of which 2 ms to minimize.
[2024-05-27 15:22:15] [INFO ] Deduced a trap composed of 56 places in 150 ms of which 2 ms to minimize.
[2024-05-27 15:22:15] [INFO ] Deduced a trap composed of 40 places in 140 ms of which 2 ms to minimize.
[2024-05-27 15:22:15] [INFO ] Deduced a trap composed of 50 places in 154 ms of which 2 ms to minimize.
[2024-05-27 15:22:16] [INFO ] Deduced a trap composed of 49 places in 146 ms of which 2 ms to minimize.
[2024-05-27 15:22:16] [INFO ] Deduced a trap composed of 48 places in 134 ms of which 2 ms to minimize.
[2024-05-27 15:22:25] [INFO ] Deduced a trap composed of 31 places in 209 ms of which 2 ms to minimize.
[2024-05-27 15:22:25] [INFO ] Deduced a trap composed of 30 places in 208 ms of which 2 ms to minimize.
[2024-05-27 15:22:25] [INFO ] Deduced a trap composed of 30 places in 205 ms of which 2 ms to minimize.
[2024-05-27 15:22:25] [INFO ] Deduced a trap composed of 21 places in 207 ms of which 2 ms to minimize.
[2024-05-27 15:22:26] [INFO ] Deduced a trap composed of 30 places in 200 ms of which 2 ms to minimize.
[2024-05-27 15:22:26] [INFO ] Deduced a trap composed of 30 places in 204 ms of which 2 ms to minimize.
[2024-05-27 15:22:26] [INFO ] Deduced a trap composed of 21 places in 204 ms of which 2 ms to minimize.
[2024-05-27 15:22:26] [INFO ] Deduced a trap composed of 30 places in 209 ms of which 2 ms to minimize.
[2024-05-27 15:22:26] [INFO ] Deduced a trap composed of 30 places in 207 ms of which 2 ms to minimize.
[2024-05-27 15:22:27] [INFO ] Deduced a trap composed of 65 places in 207 ms of which 2 ms to minimize.
[2024-05-27 15:22:28] [INFO ] Deduced a trap composed of 49 places in 232 ms of which 2 ms to minimize.
[2024-05-27 15:22:28] [INFO ] Deduced a trap composed of 49 places in 228 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/948 variables, and 65 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-27 15:22:48] [INFO ] Deduced a trap composed of 65 places in 136 ms of which 2 ms to minimize.
[2024-05-27 15:22:48] [INFO ] Deduced a trap composed of 65 places in 121 ms of which 1 ms to minimize.
[2024-05-27 15:22:48] [INFO ] Deduced a trap composed of 65 places in 124 ms of which 2 ms to minimize.
[2024-05-27 15:22:48] [INFO ] Deduced a trap composed of 57 places in 153 ms of which 2 ms to minimize.
[2024-05-27 15:22:48] [INFO ] Deduced a trap composed of 50 places in 143 ms of which 2 ms to minimize.
[2024-05-27 15:22:48] [INFO ] Deduced a trap composed of 44 places in 136 ms of which 2 ms to minimize.
[2024-05-27 15:22:49] [INFO ] Deduced a trap composed of 65 places in 201 ms of which 2 ms to minimize.
[2024-05-27 15:22:49] [INFO ] Deduced a trap composed of 57 places in 220 ms of which 2 ms to minimize.
[2024-05-27 15:22:52] [INFO ] Deduced a trap composed of 44 places in 257 ms of which 2 ms to minimize.
[2024-05-27 15:22:52] [INFO ] Deduced a trap composed of 41 places in 210 ms of which 2 ms to minimize.
[2024-05-27 15:22:52] [INFO ] Deduced a trap composed of 53 places in 208 ms of which 2 ms to minimize.
[2024-05-27 15:22:52] [INFO ] Deduced a trap composed of 41 places in 218 ms of which 2 ms to minimize.
[2024-05-27 15:22:53] [INFO ] Deduced a trap composed of 40 places in 207 ms of which 2 ms to minimize.
[2024-05-27 15:22:53] [INFO ] Deduced a trap composed of 59 places in 146 ms of which 2 ms to minimize.
[2024-05-27 15:22:53] [INFO ] Deduced a trap composed of 49 places in 135 ms of which 2 ms to minimize.
[2024-05-27 15:22:53] [INFO ] Deduced a trap composed of 49 places in 125 ms of which 2 ms to minimize.
[2024-05-27 15:22:53] [INFO ] Deduced a trap composed of 57 places in 118 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 17/82 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-27 15:23:05] [INFO ] Deduced a trap composed of 49 places in 141 ms of which 1 ms to minimize.
[2024-05-27 15:23:05] [INFO ] Deduced a trap composed of 49 places in 134 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/948 variables, and 84 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 39/39 constraints]
After SMT, in 64204ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 64221ms
Finished structural reductions in LTL mode , in 1 iterations and 65994 ms. Remains : 306/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 173 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : SafeBus-COL-10-LTLFireability-03
Product exploration explored 100000 steps with 0 reset in 540 ms.
Stack based approach found an accepted trace after 748 steps with 0 reset with depth 749 and stack size 749 in 16 ms.
FORMULA SafeBus-COL-10-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property SafeBus-COL-10-LTLFireability-03 finished in 66767 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 8 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-27 15:23:07] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 15:23:07] [INFO ] Invariant cache hit.
[2024-05-27 15:23:07] [INFO ] Implicit Places using invariants in 211 ms returned []
[2024-05-27 15:23:07] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 15:23:07] [INFO ] Invariant cache hit.
[2024-05-27 15:23:07] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 15:23:08] [INFO ] Implicit Places using invariants and state equation in 1126 ms returned []
Implicit Place search using SMT with State Equation took 1352 ms to find 0 implicit places.
Running 1521 sub problems to find dead transitions.
[2024-05-27 15:23:08] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 15:23:08] [INFO ] Invariant cache hit.
[2024-05-27 15:23:08] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-27 15:23:21] [INFO ] Deduced a trap composed of 35 places in 208 ms of which 2 ms to minimize.
[2024-05-27 15:23:21] [INFO ] Deduced a trap composed of 59 places in 196 ms of which 2 ms to minimize.
[2024-05-27 15:23:21] [INFO ] Deduced a trap composed of 42 places in 223 ms of which 3 ms to minimize.
[2024-05-27 15:23:22] [INFO ] Deduced a trap composed of 56 places in 136 ms of which 2 ms to minimize.
[2024-05-27 15:23:22] [INFO ] Deduced a trap composed of 40 places in 127 ms of which 1 ms to minimize.
[2024-05-27 15:23:22] [INFO ] Deduced a trap composed of 50 places in 143 ms of which 1 ms to minimize.
[2024-05-27 15:23:22] [INFO ] Deduced a trap composed of 49 places in 127 ms of which 2 ms to minimize.
[2024-05-27 15:23:22] [INFO ] Deduced a trap composed of 48 places in 120 ms of which 2 ms to minimize.
[2024-05-27 15:23:31] [INFO ] Deduced a trap composed of 31 places in 204 ms of which 2 ms to minimize.
[2024-05-27 15:23:32] [INFO ] Deduced a trap composed of 30 places in 207 ms of which 2 ms to minimize.
[2024-05-27 15:23:32] [INFO ] Deduced a trap composed of 30 places in 213 ms of which 2 ms to minimize.
[2024-05-27 15:23:32] [INFO ] Deduced a trap composed of 21 places in 204 ms of which 6 ms to minimize.
[2024-05-27 15:23:32] [INFO ] Deduced a trap composed of 30 places in 200 ms of which 2 ms to minimize.
[2024-05-27 15:23:32] [INFO ] Deduced a trap composed of 30 places in 197 ms of which 2 ms to minimize.
[2024-05-27 15:23:33] [INFO ] Deduced a trap composed of 21 places in 201 ms of which 2 ms to minimize.
[2024-05-27 15:23:33] [INFO ] Deduced a trap composed of 30 places in 201 ms of which 1 ms to minimize.
[2024-05-27 15:23:33] [INFO ] Deduced a trap composed of 30 places in 200 ms of which 1 ms to minimize.
[2024-05-27 15:23:34] [INFO ] Deduced a trap composed of 65 places in 207 ms of which 2 ms to minimize.
[2024-05-27 15:23:34] [INFO ] Deduced a trap composed of 49 places in 205 ms of which 2 ms to minimize.
[2024-05-27 15:23:35] [INFO ] Deduced a trap composed of 49 places in 204 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/948 variables, and 65 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-27 15:23:54] [INFO ] Deduced a trap composed of 65 places in 125 ms of which 2 ms to minimize.
[2024-05-27 15:23:54] [INFO ] Deduced a trap composed of 65 places in 121 ms of which 1 ms to minimize.
[2024-05-27 15:23:54] [INFO ] Deduced a trap composed of 65 places in 119 ms of which 2 ms to minimize.
[2024-05-27 15:23:55] [INFO ] Deduced a trap composed of 57 places in 135 ms of which 2 ms to minimize.
[2024-05-27 15:23:55] [INFO ] Deduced a trap composed of 50 places in 136 ms of which 2 ms to minimize.
[2024-05-27 15:23:55] [INFO ] Deduced a trap composed of 44 places in 136 ms of which 1 ms to minimize.
[2024-05-27 15:23:55] [INFO ] Deduced a trap composed of 65 places in 202 ms of which 2 ms to minimize.
[2024-05-27 15:23:55] [INFO ] Deduced a trap composed of 57 places in 191 ms of which 2 ms to minimize.
[2024-05-27 15:23:58] [INFO ] Deduced a trap composed of 44 places in 221 ms of which 2 ms to minimize.
[2024-05-27 15:23:58] [INFO ] Deduced a trap composed of 41 places in 211 ms of which 2 ms to minimize.
[2024-05-27 15:23:59] [INFO ] Deduced a trap composed of 53 places in 208 ms of which 2 ms to minimize.
[2024-05-27 15:23:59] [INFO ] Deduced a trap composed of 41 places in 210 ms of which 2 ms to minimize.
[2024-05-27 15:23:59] [INFO ] Deduced a trap composed of 40 places in 214 ms of which 2 ms to minimize.
[2024-05-27 15:23:59] [INFO ] Deduced a trap composed of 59 places in 141 ms of which 2 ms to minimize.
[2024-05-27 15:23:59] [INFO ] Deduced a trap composed of 49 places in 131 ms of which 1 ms to minimize.
[2024-05-27 15:24:00] [INFO ] Deduced a trap composed of 49 places in 122 ms of which 1 ms to minimize.
[2024-05-27 15:24:00] [INFO ] Deduced a trap composed of 57 places in 112 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 17/82 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-27 15:24:12] [INFO ] Deduced a trap composed of 49 places in 136 ms of which 2 ms to minimize.
[2024-05-27 15:24:12] [INFO ] Deduced a trap composed of 49 places in 140 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/948 variables, and 84 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 39/39 constraints]
After SMT, in 64590ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 64605ms
Finished structural reductions in LTL mode , in 1 iterations and 65970 ms. Remains : 306/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 233 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0), (NOT p1), (AND p1 (NOT p2)), (NOT p1)]
Running random walk in product with property : SafeBus-COL-10-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA SafeBus-COL-10-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SafeBus-COL-10-LTLFireability-04 finished in 66232 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 121 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 4 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-27 15:24:13] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 15:24:13] [INFO ] Invariant cache hit.
[2024-05-27 15:24:13] [INFO ] Implicit Places using invariants in 176 ms returned [231, 232, 233, 234, 235, 236, 237, 238, 239, 240]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 178 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 3 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 186 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-COL-10-LTLFireability-06
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 2 ms.
FORMULA SafeBus-COL-10-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SafeBus-COL-10-LTLFireability-06 finished in 281 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 10 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-27 15:24:13] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 15:24:13] [INFO ] Invariant cache hit.
[2024-05-27 15:24:13] [INFO ] Implicit Places using invariants in 142 ms returned []
[2024-05-27 15:24:13] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 15:24:13] [INFO ] Invariant cache hit.
[2024-05-27 15:24:14] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 15:24:14] [INFO ] Implicit Places using invariants and state equation in 864 ms returned []
Implicit Place search using SMT with State Equation took 1012 ms to find 0 implicit places.
Running 1521 sub problems to find dead transitions.
[2024-05-27 15:24:14] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 15:24:14] [INFO ] Invariant cache hit.
[2024-05-27 15:24:14] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-27 15:24:27] [INFO ] Deduced a trap composed of 35 places in 252 ms of which 2 ms to minimize.
[2024-05-27 15:24:27] [INFO ] Deduced a trap composed of 59 places in 219 ms of which 2 ms to minimize.
[2024-05-27 15:24:27] [INFO ] Deduced a trap composed of 42 places in 206 ms of which 2 ms to minimize.
[2024-05-27 15:24:27] [INFO ] Deduced a trap composed of 56 places in 146 ms of which 2 ms to minimize.
[2024-05-27 15:24:28] [INFO ] Deduced a trap composed of 40 places in 133 ms of which 1 ms to minimize.
[2024-05-27 15:24:28] [INFO ] Deduced a trap composed of 50 places in 140 ms of which 2 ms to minimize.
[2024-05-27 15:24:28] [INFO ] Deduced a trap composed of 49 places in 138 ms of which 2 ms to minimize.
[2024-05-27 15:24:28] [INFO ] Deduced a trap composed of 48 places in 122 ms of which 1 ms to minimize.
[2024-05-27 15:24:37] [INFO ] Deduced a trap composed of 31 places in 199 ms of which 1 ms to minimize.
[2024-05-27 15:24:38] [INFO ] Deduced a trap composed of 30 places in 206 ms of which 1 ms to minimize.
[2024-05-27 15:24:38] [INFO ] Deduced a trap composed of 30 places in 218 ms of which 2 ms to minimize.
[2024-05-27 15:24:38] [INFO ] Deduced a trap composed of 21 places in 206 ms of which 2 ms to minimize.
[2024-05-27 15:24:38] [INFO ] Deduced a trap composed of 30 places in 202 ms of which 2 ms to minimize.
[2024-05-27 15:24:38] [INFO ] Deduced a trap composed of 30 places in 198 ms of which 2 ms to minimize.
[2024-05-27 15:24:39] [INFO ] Deduced a trap composed of 21 places in 211 ms of which 2 ms to minimize.
[2024-05-27 15:24:39] [INFO ] Deduced a trap composed of 30 places in 204 ms of which 2 ms to minimize.
[2024-05-27 15:24:39] [INFO ] Deduced a trap composed of 30 places in 210 ms of which 2 ms to minimize.
[2024-05-27 15:24:40] [INFO ] Deduced a trap composed of 65 places in 207 ms of which 1 ms to minimize.
[2024-05-27 15:24:40] [INFO ] Deduced a trap composed of 49 places in 222 ms of which 2 ms to minimize.
[2024-05-27 15:24:41] [INFO ] Deduced a trap composed of 49 places in 210 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/948 variables, and 65 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-27 15:25:00] [INFO ] Deduced a trap composed of 65 places in 125 ms of which 2 ms to minimize.
[2024-05-27 15:25:01] [INFO ] Deduced a trap composed of 65 places in 119 ms of which 2 ms to minimize.
[2024-05-27 15:25:01] [INFO ] Deduced a trap composed of 65 places in 121 ms of which 1 ms to minimize.
[2024-05-27 15:25:01] [INFO ] Deduced a trap composed of 57 places in 137 ms of which 2 ms to minimize.
[2024-05-27 15:25:01] [INFO ] Deduced a trap composed of 50 places in 140 ms of which 2 ms to minimize.
[2024-05-27 15:25:01] [INFO ] Deduced a trap composed of 44 places in 132 ms of which 1 ms to minimize.
[2024-05-27 15:25:01] [INFO ] Deduced a trap composed of 65 places in 198 ms of which 2 ms to minimize.
[2024-05-27 15:25:02] [INFO ] Deduced a trap composed of 57 places in 194 ms of which 2 ms to minimize.
[2024-05-27 15:25:04] [INFO ] Deduced a trap composed of 44 places in 220 ms of which 2 ms to minimize.
[2024-05-27 15:25:05] [INFO ] Deduced a trap composed of 41 places in 209 ms of which 2 ms to minimize.
[2024-05-27 15:25:05] [INFO ] Deduced a trap composed of 53 places in 211 ms of which 3 ms to minimize.
[2024-05-27 15:25:05] [INFO ] Deduced a trap composed of 41 places in 205 ms of which 2 ms to minimize.
[2024-05-27 15:25:05] [INFO ] Deduced a trap composed of 40 places in 209 ms of which 2 ms to minimize.
[2024-05-27 15:25:06] [INFO ] Deduced a trap composed of 59 places in 148 ms of which 2 ms to minimize.
[2024-05-27 15:25:06] [INFO ] Deduced a trap composed of 49 places in 132 ms of which 1 ms to minimize.
[2024-05-27 15:25:06] [INFO ] Deduced a trap composed of 49 places in 125 ms of which 1 ms to minimize.
[2024-05-27 15:25:06] [INFO ] Deduced a trap composed of 57 places in 129 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 17/82 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 82 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 37/37 constraints]
After SMT, in 64318ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 64335ms
Finished structural reductions in LTL mode , in 1 iterations and 65365 ms. Remains : 306/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 236 ms :[p1, (AND p0 p1), true, (OR p0 p1), p0, p0, p0]
Running random walk in product with property : SafeBus-COL-10-LTLFireability-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SafeBus-COL-10-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SafeBus-COL-10-LTLFireability-07 finished in 65632 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(p1))))'
Support contains 31 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 4 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-27 15:25:19] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 15:25:19] [INFO ] Invariant cache hit.
[2024-05-27 15:25:19] [INFO ] Implicit Places using invariants in 410 ms returned [231, 232, 233, 234, 235, 236, 237, 238, 239, 240]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 412 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 422 ms. Remains : 296/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 79 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : SafeBus-COL-10-LTLFireability-09
Product exploration explored 100000 steps with 0 reset in 504 ms.
Stack based approach found an accepted trace after 467 steps with 0 reset with depth 468 and stack size 468 in 3 ms.
FORMULA SafeBus-COL-10-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property SafeBus-COL-10-LTLFireability-09 finished in 1027 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(!p0)))'
Support contains 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 15:25:20] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 15:25:20] [INFO ] Invariant cache hit.
[2024-05-27 15:25:20] [INFO ] Implicit Places using invariants in 174 ms returned [231, 232, 233, 234, 235, 236, 237, 238, 239, 240]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 176 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 3 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 184 ms. Remains : 296/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 61 ms :[p0, p0]
Running random walk in product with property : SafeBus-COL-10-LTLFireability-10
Product exploration explored 100000 steps with 13070 reset in 3416 ms.
Product exploration explored 100000 steps with 13029 reset in 3447 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[p0, p0]
RANDOM walk for 30 steps (0 resets) in 9 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 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 64 ms :[p0, p0]
Stuttering acceptance computed with spot in 76 ms :[p0, p0]
[2024-05-27 15:25:27] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 296 cols
[2024-05-27 15:25:28] [INFO ] Computed 35 invariants in 29 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:828)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:584)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:619)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:581)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:252)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:958)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-27 15:25:46] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression EG p0
Could not prove EG p0
Support contains 121 out of 296 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 296/296 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 147 ms. Remains 286 /296 variables (removed 10) and now considering 1521/1531 (removed 10) transitions.
[2024-05-27 15:25:46] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
// Phase 1: matrix 632 rows 286 cols
[2024-05-27 15:25:46] [INFO ] Computed 35 invariants in 9 ms
[2024-05-27 15:25:46] [INFO ] Implicit Places using invariants in 252 ms returned []
[2024-05-27 15:25:46] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2024-05-27 15:25:46] [INFO ] Invariant cache hit.
[2024-05-27 15:25:47] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 15:25:47] [INFO ] Implicit Places using invariants and state equation in 693 ms returned []
Implicit Place search using SMT with State Equation took 961 ms to find 0 implicit places.
[2024-05-27 15:25:47] [INFO ] Redundant transitions in 20 ms returned []
Running 1511 sub problems to find dead transitions.
[2024-05-27 15:25:47] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2024-05-27 15:25:47] [INFO ] Invariant cache hit.
[2024-05-27 15:25:47] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/286 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/286 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
[2024-05-27 15:25:59] [INFO ] Deduced a trap composed of 46 places in 64 ms of which 1 ms to minimize.
[2024-05-27 15:25:59] [INFO ] Deduced a trap composed of 42 places in 73 ms of which 2 ms to minimize.
[2024-05-27 15:26:06] [INFO ] Deduced a trap composed of 30 places in 215 ms of which 2 ms to minimize.
[2024-05-27 15:26:07] [INFO ] Deduced a trap composed of 30 places in 204 ms of which 2 ms to minimize.
[2024-05-27 15:26:07] [INFO ] Deduced a trap composed of 21 places in 207 ms of which 2 ms to minimize.
[2024-05-27 15:26:07] [INFO ] Deduced a trap composed of 30 places in 209 ms of which 1 ms to minimize.
[2024-05-27 15:26:07] [INFO ] Deduced a trap composed of 60 places in 206 ms of which 1 ms to minimize.
[2024-05-27 15:26:08] [INFO ] Deduced a trap composed of 30 places in 199 ms of which 1 ms to minimize.
[2024-05-27 15:26:08] [INFO ] Deduced a trap composed of 49 places in 209 ms of which 2 ms to minimize.
[2024-05-27 15:26:09] [INFO ] Deduced a trap composed of 41 places in 199 ms of which 2 ms to minimize.
[2024-05-27 15:26:09] [INFO ] Deduced a trap composed of 41 places in 202 ms of which 2 ms to minimize.
[2024-05-27 15:26:09] [INFO ] Deduced a trap composed of 65 places in 202 ms of which 2 ms to minimize.
[2024-05-27 15:26:12] [INFO ] Deduced a trap composed of 32 places in 207 ms of which 2 ms to minimize.
[2024-05-27 15:26:12] [INFO ] Deduced a trap composed of 32 places in 202 ms of which 2 ms to minimize.
[2024-05-27 15:26:13] [INFO ] Deduced a trap composed of 32 places in 211 ms of which 2 ms to minimize.
[2024-05-27 15:26:13] [INFO ] Deduced a trap composed of 32 places in 203 ms of which 1 ms to minimize.
[2024-05-27 15:26:13] [INFO ] Deduced a trap composed of 32 places in 202 ms of which 2 ms to minimize.
[2024-05-27 15:26:14] [INFO ] Deduced a trap composed of 90 places in 214 ms of which 2 ms to minimize.
[2024-05-27 15:26:14] [INFO ] Deduced a trap composed of 30 places in 206 ms of which 2 ms to minimize.
[2024-05-27 15:26:14] [INFO ] Deduced a trap composed of 86 places in 200 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 286/918 variables, and 55 constraints, problems are : Problem set: 0 solved, 1511 unsolved in 30026 ms.
Refiners :[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, 14/14 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/286 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
[2024-05-27 15:26:32] [INFO ] Deduced a trap composed of 21 places in 202 ms of which 2 ms to minimize.
[2024-05-27 15:26:32] [INFO ] Deduced a trap composed of 31 places in 206 ms of which 2 ms to minimize.
[2024-05-27 15:26:32] [INFO ] Deduced a trap composed of 30 places in 212 ms of which 2 ms to minimize.
[2024-05-27 15:26:32] [INFO ] Deduced a trap composed of 52 places in 206 ms of which 1 ms to minimize.
[2024-05-27 15:26:34] [INFO ] Deduced a trap composed of 65 places in 196 ms of which 2 ms to minimize.
[2024-05-27 15:26:34] [INFO ] Deduced a trap composed of 49 places in 201 ms of which 1 ms to minimize.
[2024-05-27 15:26:34] [INFO ] Deduced a trap composed of 49 places in 194 ms of which 2 ms to minimize.
[2024-05-27 15:26:34] [INFO ] Deduced a trap composed of 41 places in 195 ms of which 1 ms to minimize.
[2024-05-27 15:26:34] [INFO ] Deduced a trap composed of 49 places in 194 ms of which 2 ms to minimize.
[2024-05-27 15:26:35] [INFO ] Deduced a trap composed of 41 places in 196 ms of which 2 ms to minimize.
[2024-05-27 15:26:35] [INFO ] Deduced a trap composed of 49 places in 199 ms of which 2 ms to minimize.
[2024-05-27 15:26:35] [INFO ] Deduced a trap composed of 49 places in 197 ms of which 2 ms to minimize.
[2024-05-27 15:26:35] [INFO ] Deduced a trap composed of 41 places in 197 ms of which 2 ms to minimize.
[2024-05-27 15:26:36] [INFO ] Deduced a trap composed of 49 places in 201 ms of which 2 ms to minimize.
[2024-05-27 15:26:36] [INFO ] Deduced a trap composed of 49 places in 195 ms of which 1 ms to minimize.
[2024-05-27 15:26:36] [INFO ] Deduced a trap composed of 41 places in 197 ms of which 1 ms to minimize.
[2024-05-27 15:26:36] [INFO ] Deduced a trap composed of 57 places in 188 ms of which 2 ms to minimize.
[2024-05-27 15:26:39] [INFO ] Deduced a trap composed of 42 places in 200 ms of which 1 ms to minimize.
[2024-05-27 15:26:39] [INFO ] Deduced a trap composed of 42 places in 203 ms of which 2 ms to minimize.
[2024-05-27 15:26:39] [INFO ] Deduced a trap composed of 21 places in 201 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
[2024-05-27 15:26:42] [INFO ] Deduced a trap composed of 57 places in 133 ms of which 2 ms to minimize.
[2024-05-27 15:26:42] [INFO ] Deduced a trap composed of 41 places in 139 ms of which 2 ms to minimize.
[2024-05-27 15:26:43] [INFO ] Deduced a trap composed of 41 places in 128 ms of which 1 ms to minimize.
[2024-05-27 15:26:43] [INFO ] Deduced a trap composed of 49 places in 139 ms of which 2 ms to minimize.
[2024-05-27 15:26:43] [INFO ] Deduced a trap composed of 57 places in 133 ms of which 2 ms to minimize.
[2024-05-27 15:26:43] [INFO ] Deduced a trap composed of 49 places in 131 ms of which 2 ms to minimize.
[2024-05-27 15:26:43] [INFO ] Deduced a trap composed of 49 places in 131 ms of which 2 ms to minimize.
[2024-05-27 15:26:50] [INFO ] Deduced a trap composed of 21 places in 203 ms of which 1 ms to minimize.
[2024-05-27 15:26:51] [INFO ] Deduced a trap composed of 41 places in 197 ms of which 2 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 286/918 variables, and 84 constraints, problems are : Problem set: 0 solved, 1511 unsolved in 30023 ms.
Refiners :[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: 49/49 constraints]
After SMT, in 64440ms problems are : Problem set: 0 solved, 1511 unsolved
Search for dead transitions found 0 dead transitions in 64456ms
Starting structural reductions in SI_LTL mode, iteration 1 : 286/296 places, 1521/1531 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 65593 ms. Remains : 286/296 places, 1521/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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 68 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[p0, p0]
RANDOM walk for 30 steps (0 resets) in 6 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[p0, p0]
Stuttering acceptance computed with spot in 78 ms :[p0, p0]
[2024-05-27 15:26:52] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2024-05-27 15:26:53] [INFO ] Invariant cache hit.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:828)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:584)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:619)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:581)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:262)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:958)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-27 15:27:10] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression EG p0
Could not prove EG p0
Stuttering acceptance computed with spot in 87 ms :[p0, p0]
Product exploration explored 100000 steps with 13030 reset in 4438 ms.
Product exploration explored 100000 steps with 13004 reset in 4445 ms.
Built C files in :
/tmp/ltsmin9567905557074419787
[2024-05-27 15:27:19] [INFO ] Too many transitions (1521) to apply POR reductions. Disabling POR matrices.
[2024-05-27 15:27:19] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9567905557074419787
Running compilation step : cd /tmp/ltsmin9567905557074419787;'/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/ltsmin9567905557074419787;'/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/ltsmin9567905557074419787;'/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 121 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 99 ms. Remains 286 /286 variables (removed 0) and now considering 1521/1521 (removed 0) transitions.
[2024-05-27 15:27:22] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2024-05-27 15:27:22] [INFO ] Invariant cache hit.
[2024-05-27 15:27:22] [INFO ] Implicit Places using invariants in 142 ms returned []
[2024-05-27 15:27:22] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2024-05-27 15:27:22] [INFO ] Invariant cache hit.
[2024-05-27 15:27:23] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 15:27:23] [INFO ] Implicit Places using invariants and state equation in 685 ms returned []
Implicit Place search using SMT with State Equation took 828 ms to find 0 implicit places.
[2024-05-27 15:27:23] [INFO ] Redundant transitions in 25 ms returned []
Running 1511 sub problems to find dead transitions.
[2024-05-27 15:27:23] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2024-05-27 15:27:23] [INFO ] Invariant cache hit.
[2024-05-27 15:27:23] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/286 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/286 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
[2024-05-27 15:27:35] [INFO ] Deduced a trap composed of 46 places in 76 ms of which 1 ms to minimize.
[2024-05-27 15:27:35] [INFO ] Deduced a trap composed of 42 places in 69 ms of which 1 ms to minimize.
[2024-05-27 15:27:42] [INFO ] Deduced a trap composed of 30 places in 207 ms of which 2 ms to minimize.
[2024-05-27 15:27:43] [INFO ] Deduced a trap composed of 30 places in 202 ms of which 2 ms to minimize.
[2024-05-27 15:27:43] [INFO ] Deduced a trap composed of 21 places in 205 ms of which 2 ms to minimize.
[2024-05-27 15:27:43] [INFO ] Deduced a trap composed of 30 places in 196 ms of which 2 ms to minimize.
[2024-05-27 15:27:43] [INFO ] Deduced a trap composed of 60 places in 202 ms of which 2 ms to minimize.
[2024-05-27 15:27:44] [INFO ] Deduced a trap composed of 30 places in 201 ms of which 1 ms to minimize.
[2024-05-27 15:27:44] [INFO ] Deduced a trap composed of 49 places in 195 ms of which 2 ms to minimize.
[2024-05-27 15:27:45] [INFO ] Deduced a trap composed of 41 places in 197 ms of which 2 ms to minimize.
[2024-05-27 15:27:45] [INFO ] Deduced a trap composed of 41 places in 193 ms of which 2 ms to minimize.
[2024-05-27 15:27:45] [INFO ] Deduced a trap composed of 65 places in 207 ms of which 2 ms to minimize.
[2024-05-27 15:27:48] [INFO ] Deduced a trap composed of 32 places in 198 ms of which 2 ms to minimize.
[2024-05-27 15:27:49] [INFO ] Deduced a trap composed of 32 places in 192 ms of which 1 ms to minimize.
[2024-05-27 15:27:49] [INFO ] Deduced a trap composed of 32 places in 194 ms of which 2 ms to minimize.
[2024-05-27 15:27:49] [INFO ] Deduced a trap composed of 32 places in 198 ms of which 2 ms to minimize.
[2024-05-27 15:27:49] [INFO ] Deduced a trap composed of 32 places in 192 ms of which 2 ms to minimize.
[2024-05-27 15:27:50] [INFO ] Deduced a trap composed of 90 places in 204 ms of which 2 ms to minimize.
[2024-05-27 15:27:50] [INFO ] Deduced a trap composed of 30 places in 214 ms of which 2 ms to minimize.
[2024-05-27 15:27:50] [INFO ] Deduced a trap composed of 86 places in 200 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 20/55 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 55 constraints, problems are : Problem set: 0 solved, 1511 unsolved in 30029 ms.
Refiners :[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, 14/14 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/286 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
[2024-05-27 15:28:08] [INFO ] Deduced a trap composed of 21 places in 216 ms of which 2 ms to minimize.
[2024-05-27 15:28:08] [INFO ] Deduced a trap composed of 31 places in 204 ms of which 2 ms to minimize.
[2024-05-27 15:28:08] [INFO ] Deduced a trap composed of 30 places in 201 ms of which 2 ms to minimize.
[2024-05-27 15:28:09] [INFO ] Deduced a trap composed of 52 places in 214 ms of which 1 ms to minimize.
[2024-05-27 15:28:10] [INFO ] Deduced a trap composed of 65 places in 200 ms of which 2 ms to minimize.
[2024-05-27 15:28:10] [INFO ] Deduced a trap composed of 49 places in 197 ms of which 2 ms to minimize.
[2024-05-27 15:28:10] [INFO ] Deduced a trap composed of 49 places in 196 ms of which 1 ms to minimize.
[2024-05-27 15:28:10] [INFO ] Deduced a trap composed of 41 places in 204 ms of which 2 ms to minimize.
[2024-05-27 15:28:11] [INFO ] Deduced a trap composed of 49 places in 199 ms of which 2 ms to minimize.
[2024-05-27 15:28:11] [INFO ] Deduced a trap composed of 41 places in 203 ms of which 2 ms to minimize.
[2024-05-27 15:28:11] [INFO ] Deduced a trap composed of 49 places in 204 ms of which 2 ms to minimize.
[2024-05-27 15:28:11] [INFO ] Deduced a trap composed of 49 places in 195 ms of which 1 ms to minimize.
[2024-05-27 15:28:11] [INFO ] Deduced a trap composed of 41 places in 196 ms of which 1 ms to minimize.
[2024-05-27 15:28:12] [INFO ] Deduced a trap composed of 49 places in 194 ms of which 2 ms to minimize.
[2024-05-27 15:28:12] [INFO ] Deduced a trap composed of 49 places in 198 ms of which 1 ms to minimize.
[2024-05-27 15:28:12] [INFO ] Deduced a trap composed of 41 places in 199 ms of which 2 ms to minimize.
[2024-05-27 15:28:12] [INFO ] Deduced a trap composed of 57 places in 209 ms of which 2 ms to minimize.
[2024-05-27 15:28:15] [INFO ] Deduced a trap composed of 42 places in 209 ms of which 2 ms to minimize.
[2024-05-27 15:28:15] [INFO ] Deduced a trap composed of 42 places in 201 ms of which 2 ms to minimize.
[2024-05-27 15:28:15] [INFO ] Deduced a trap composed of 21 places in 206 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
[2024-05-27 15:28:18] [INFO ] Deduced a trap composed of 57 places in 146 ms of which 1 ms to minimize.
[2024-05-27 15:28:18] [INFO ] Deduced a trap composed of 41 places in 143 ms of which 1 ms to minimize.
[2024-05-27 15:28:18] [INFO ] Deduced a trap composed of 41 places in 144 ms of which 1 ms to minimize.
[2024-05-27 15:28:19] [INFO ] Deduced a trap composed of 49 places in 155 ms of which 2 ms to minimize.
[2024-05-27 15:28:19] [INFO ] Deduced a trap composed of 57 places in 156 ms of which 1 ms to minimize.
[2024-05-27 15:28:19] [INFO ] Deduced a trap composed of 49 places in 155 ms of which 2 ms to minimize.
[2024-05-27 15:28:19] [INFO ] Deduced a trap composed of 49 places in 154 ms of which 1 ms to minimize.
[2024-05-27 15:28:26] [INFO ] Deduced a trap composed of 21 places in 203 ms of which 2 ms to minimize.
[2024-05-27 15:28:27] [INFO ] Deduced a trap composed of 41 places in 196 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 286/918 variables, and 84 constraints, problems are : Problem set: 0 solved, 1511 unsolved in 30027 ms.
Refiners :[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: 49/49 constraints]
After SMT, in 64354ms problems are : Problem set: 0 solved, 1511 unsolved
Search for dead transitions found 0 dead transitions in 64369ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 65330 ms. Remains : 286/286 places, 1521/1521 transitions.
Built C files in :
/tmp/ltsmin16266970001810465956
[2024-05-27 15:28:27] [INFO ] Too many transitions (1521) to apply POR reductions. Disabling POR matrices.
[2024-05-27 15:28:27] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16266970001810465956
Running compilation step : cd /tmp/ltsmin16266970001810465956;'/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/ltsmin16266970001810465956;'/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/ltsmin16266970001810465956;'/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 15:28:31] [INFO ] Flatten gal took : 61 ms
[2024-05-27 15:28:31] [INFO ] Flatten gal took : 60 ms
[2024-05-27 15:28:31] [INFO ] Time to serialize gal into /tmp/LTL14391692077640861607.gal : 8 ms
[2024-05-27 15:28:31] [INFO ] Time to serialize properties into /tmp/LTL14088228462512788332.prop : 7 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/LTL14391692077640861607.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16911832307828025965.hoa' '-atoms' '/tmp/LTL14088228462512788332.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...320
Loading property file /tmp/LTL14088228462512788332.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16911832307828025965.hoa
Detected timeout of ITS tools.
[2024-05-27 15:28:46] [INFO ] Flatten gal took : 64 ms
[2024-05-27 15:28:46] [INFO ] Flatten gal took : 66 ms
[2024-05-27 15:28:46] [INFO ] Time to serialize gal into /tmp/LTL1806596256781929962.gal : 10 ms
[2024-05-27 15:28:46] [INFO ] Time to serialize properties into /tmp/LTL3084474211479074161.ltl : 8 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/LTL1806596256781929962.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3084474211479074161.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(F("(((((((((((((Cpt2_8>=1)&&(cable_used_9>=1))&&((AMC_28>=1)&&(FMCb>=1)))||(((Cpt2_8>=1)&&(cable_used_5>=1))&&((AMC_98>=1)&&(FMCb...63930
Formula 0 simplified : XG!"(((((((((((((Cpt2_8>=1)&&(cable_used_9>=1))&&((AMC_28>=1)&&(FMCb>=1)))||(((Cpt2_8>=1)&&(cable_used_5>=1))&&((AMC_98>=1)&&(FMCb>=...63924
Detected timeout of ITS tools.
[2024-05-27 15:29:01] [INFO ] Flatten gal took : 63 ms
[2024-05-27 15:29:01] [INFO ] Applying decomposition
[2024-05-27 15:29:01] [INFO ] Flatten gal took : 62 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/graph11782862342120048083.txt' '-o' '/tmp/graph11782862342120048083.bin' '-w' '/tmp/graph11782862342120048083.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11782862342120048083.bin' '-l' '-1' '-v' '-w' '/tmp/graph11782862342120048083.weights' '-q' '0' '-e' '0.001'
[2024-05-27 15:29:01] [INFO ] Decomposing Gal with order
[2024-05-27 15:29:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 15:29:02] [INFO ] Removed a total of 1875 redundant transitions.
[2024-05-27 15:29:02] [INFO ] Flatten gal took : 201 ms
[2024-05-27 15:29:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 569 labels/synchronizations in 40 ms.
[2024-05-27 15:29:02] [INFO ] Time to serialize gal into /tmp/LTL14108255236061113127.gal : 9 ms
[2024-05-27 15:29:02] [INFO ] Time to serialize properties into /tmp/LTL7046600808194047677.ltl : 8 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/LTL14108255236061113127.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7046600808194047677.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(F("(((((((((((((u15.Cpt2_8>=1)&&(u15.cable_used_9>=1))&&((u15.AMC_28>=1)&&(u15.FMCb>=1)))||(((u15.Cpt2_8>=1)&&(u15.cable_used_5>=...80670
Formula 0 simplified : XG!"(((((((((((((u15.Cpt2_8>=1)&&(u15.cable_used_9>=1))&&((u15.AMC_28>=1)&&(u15.FMCb>=1)))||(((u15.Cpt2_8>=1)&&(u15.cable_used_5>=1)...80664
Detected timeout of ITS tools.
Treatment of property SafeBus-COL-10-LTLFireability-10 finished in 236904 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 132 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 102 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-27 15:29:17] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 306 cols
[2024-05-27 15:29:17] [INFO ] Computed 45 invariants in 13 ms
[2024-05-27 15:29:17] [INFO ] Implicit Places using invariants in 200 ms returned [231, 232, 233, 234, 235, 236, 237, 238, 239, 240]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 202 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 296/306 places, 1531/1531 transitions.
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 0 place count 296 transition count 1521
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 286 transition count 1521
Applied a total of 20 rules in 100 ms. Remains 286 /296 variables (removed 10) and now considering 1521/1531 (removed 10) transitions.
[2024-05-27 15:29:17] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
// Phase 1: matrix 632 rows 286 cols
[2024-05-27 15:29:17] [INFO ] Computed 35 invariants in 6 ms
[2024-05-27 15:29:17] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-05-27 15:29:17] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2024-05-27 15:29:17] [INFO ] Invariant cache hit.
[2024-05-27 15:29:18] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 15:29:18] [INFO ] Implicit Places using invariants and state equation in 661 ms returned []
Implicit Place search using SMT with State Equation took 797 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 1203 ms. Remains : 286/306 places, 1521/1531 transitions.
Stuttering acceptance computed with spot in 30 ms :[(AND (NOT p0) p1)]
Running random walk in product with property : SafeBus-COL-10-LTLFireability-11
Product exploration timeout after 65290 steps with 0 reset in 10001 ms.
Stack based approach found an accepted trace after 772 steps with 0 reset with depth 773 and stack size 773 in 118 ms.
FORMULA SafeBus-COL-10-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property SafeBus-COL-10-LTLFireability-11 finished in 11391 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(((p1&&X(X(p2)))||p0)))'
Support contains 161 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 15:29:28] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 306 cols
[2024-05-27 15:29:28] [INFO ] Computed 45 invariants in 7 ms
[2024-05-27 15:29:28] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-05-27 15:29:28] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 15:29:28] [INFO ] Invariant cache hit.
[2024-05-27 15:29:29] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 15:29:29] [INFO ] Implicit Places using invariants and state equation in 689 ms returned []
Implicit Place search using SMT with State Equation took 822 ms to find 0 implicit places.
Running 1521 sub problems to find dead transitions.
[2024-05-27 15:29:29] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 15:29:29] [INFO ] Invariant cache hit.
[2024-05-27 15:29:29] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-27 15:29:41] [INFO ] Deduced a trap composed of 35 places in 207 ms of which 2 ms to minimize.
[2024-05-27 15:29:42] [INFO ] Deduced a trap composed of 59 places in 206 ms of which 2 ms to minimize.
[2024-05-27 15:29:42] [INFO ] Deduced a trap composed of 42 places in 204 ms of which 2 ms to minimize.
[2024-05-27 15:29:42] [INFO ] Deduced a trap composed of 56 places in 140 ms of which 2 ms to minimize.
[2024-05-27 15:29:42] [INFO ] Deduced a trap composed of 40 places in 203 ms of which 2 ms to minimize.
[2024-05-27 15:29:42] [INFO ] Deduced a trap composed of 50 places in 150 ms of which 2 ms to minimize.
[2024-05-27 15:29:43] [INFO ] Deduced a trap composed of 49 places in 141 ms of which 2 ms to minimize.
[2024-05-27 15:29:43] [INFO ] Deduced a trap composed of 48 places in 143 ms of which 1 ms to minimize.
[2024-05-27 15:29:51] [INFO ] Deduced a trap composed of 31 places in 201 ms of which 2 ms to minimize.
[2024-05-27 15:29:52] [INFO ] Deduced a trap composed of 30 places in 201 ms of which 2 ms to minimize.
[2024-05-27 15:29:52] [INFO ] Deduced a trap composed of 30 places in 197 ms of which 2 ms to minimize.
[2024-05-27 15:29:52] [INFO ] Deduced a trap composed of 21 places in 211 ms of which 2 ms to minimize.
[2024-05-27 15:29:52] [INFO ] Deduced a trap composed of 30 places in 205 ms of which 2 ms to minimize.
[2024-05-27 15:29:53] [INFO ] Deduced a trap composed of 30 places in 202 ms of which 2 ms to minimize.
[2024-05-27 15:29:53] [INFO ] Deduced a trap composed of 21 places in 210 ms of which 2 ms to minimize.
[2024-05-27 15:29:53] [INFO ] Deduced a trap composed of 30 places in 200 ms of which 2 ms to minimize.
[2024-05-27 15:29:53] [INFO ] Deduced a trap composed of 30 places in 239 ms of which 2 ms to minimize.
[2024-05-27 15:29:54] [INFO ] Deduced a trap composed of 65 places in 236 ms of which 1 ms to minimize.
[2024-05-27 15:29:55] [INFO ] Deduced a trap composed of 49 places in 212 ms of which 1 ms to minimize.
[2024-05-27 15:29:55] [INFO ] Deduced a trap composed of 49 places in 215 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/948 variables, and 65 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-27 15:30:15] [INFO ] Deduced a trap composed of 65 places in 127 ms of which 1 ms to minimize.
[2024-05-27 15:30:15] [INFO ] Deduced a trap composed of 65 places in 118 ms of which 2 ms to minimize.
[2024-05-27 15:30:15] [INFO ] Deduced a trap composed of 65 places in 121 ms of which 2 ms to minimize.
[2024-05-27 15:30:16] [INFO ] Deduced a trap composed of 57 places in 141 ms of which 2 ms to minimize.
[2024-05-27 15:30:16] [INFO ] Deduced a trap composed of 50 places in 136 ms of which 1 ms to minimize.
[2024-05-27 15:30:16] [INFO ] Deduced a trap composed of 44 places in 132 ms of which 2 ms to minimize.
[2024-05-27 15:30:16] [INFO ] Deduced a trap composed of 65 places in 193 ms of which 1 ms to minimize.
[2024-05-27 15:30:16] [INFO ] Deduced a trap composed of 57 places in 206 ms of which 2 ms to minimize.
[2024-05-27 15:30:19] [INFO ] Deduced a trap composed of 44 places in 201 ms of which 1 ms to minimize.
[2024-05-27 15:30:19] [INFO ] Deduced a trap composed of 41 places in 199 ms of which 2 ms to minimize.
[2024-05-27 15:30:20] [INFO ] Deduced a trap composed of 53 places in 202 ms of which 2 ms to minimize.
[2024-05-27 15:30:20] [INFO ] Deduced a trap composed of 41 places in 205 ms of which 2 ms to minimize.
[2024-05-27 15:30:20] [INFO ] Deduced a trap composed of 40 places in 215 ms of which 2 ms to minimize.
[2024-05-27 15:30:20] [INFO ] Deduced a trap composed of 59 places in 144 ms of which 1 ms to minimize.
[2024-05-27 15:30:20] [INFO ] Deduced a trap composed of 49 places in 129 ms of which 2 ms to minimize.
[2024-05-27 15:30:21] [INFO ] Deduced a trap composed of 49 places in 120 ms of which 2 ms to minimize.
[2024-05-27 15:30:21] [INFO ] Deduced a trap composed of 57 places in 107 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 17/82 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-27 15:30:33] [INFO ] Deduced a trap composed of 49 places in 137 ms of which 2 ms to minimize.
[2024-05-27 15:30:33] [INFO ] Deduced a trap composed of 49 places in 145 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/948 variables, and 84 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 39/39 constraints]
After SMT, in 64403ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 64419ms
Finished structural reductions in LTL mode , in 1 iterations and 65252 ms. Remains : 306/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : SafeBus-COL-10-LTLFireability-13
Product exploration explored 100000 steps with 32235 reset in 6866 ms.
Product exploration explored 100000 steps with 32261 reset in 6856 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), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
Knowledge based reduction with 10 factoid took 235 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 158 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 357 steps (0 resets) in 48 ms. (7 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (F (NOT (OR p0 p1 p2))), (F (NOT (AND (NOT p0) p1))), (F (NOT p1)), (F p0), (F (NOT p2)), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 10 factoid took 523 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 158 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 161 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 4 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-27 15:30:49] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 15:30:49] [INFO ] Invariant cache hit.
[2024-05-27 15:30:49] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-05-27 15:30:49] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 15:30:49] [INFO ] Invariant cache hit.
[2024-05-27 15:30:49] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 15:30:49] [INFO ] Implicit Places using invariants and state equation in 684 ms returned []
Implicit Place search using SMT with State Equation took 817 ms to find 0 implicit places.
Running 1521 sub problems to find dead transitions.
[2024-05-27 15:30:50] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 15:30:50] [INFO ] Invariant cache hit.
[2024-05-27 15:30:50] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-27 15:31:02] [INFO ] Deduced a trap composed of 35 places in 210 ms of which 2 ms to minimize.
[2024-05-27 15:31:02] [INFO ] Deduced a trap composed of 59 places in 204 ms of which 2 ms to minimize.
[2024-05-27 15:31:02] [INFO ] Deduced a trap composed of 42 places in 204 ms of which 2 ms to minimize.
[2024-05-27 15:31:03] [INFO ] Deduced a trap composed of 56 places in 138 ms of which 2 ms to minimize.
[2024-05-27 15:31:03] [INFO ] Deduced a trap composed of 40 places in 126 ms of which 3 ms to minimize.
[2024-05-27 15:31:03] [INFO ] Deduced a trap composed of 50 places in 140 ms of which 2 ms to minimize.
[2024-05-27 15:31:03] [INFO ] Deduced a trap composed of 49 places in 130 ms of which 1 ms to minimize.
[2024-05-27 15:31:03] [INFO ] Deduced a trap composed of 48 places in 117 ms of which 1 ms to minimize.
[2024-05-27 15:31:13] [INFO ] Deduced a trap composed of 31 places in 219 ms of which 2 ms to minimize.
[2024-05-27 15:31:13] [INFO ] Deduced a trap composed of 30 places in 202 ms of which 1 ms to minimize.
[2024-05-27 15:31:13] [INFO ] Deduced a trap composed of 30 places in 210 ms of which 2 ms to minimize.
[2024-05-27 15:31:13] [INFO ] Deduced a trap composed of 21 places in 206 ms of which 2 ms to minimize.
[2024-05-27 15:31:14] [INFO ] Deduced a trap composed of 30 places in 207 ms of which 2 ms to minimize.
[2024-05-27 15:31:14] [INFO ] Deduced a trap composed of 30 places in 206 ms of which 1 ms to minimize.
[2024-05-27 15:31:14] [INFO ] Deduced a trap composed of 21 places in 207 ms of which 2 ms to minimize.
[2024-05-27 15:31:14] [INFO ] Deduced a trap composed of 30 places in 199 ms of which 2 ms to minimize.
[2024-05-27 15:31:15] [INFO ] Deduced a trap composed of 30 places in 205 ms of which 2 ms to minimize.
[2024-05-27 15:31:16] [INFO ] Deduced a trap composed of 65 places in 209 ms of which 2 ms to minimize.
[2024-05-27 15:31:16] [INFO ] Deduced a trap composed of 49 places in 234 ms of which 2 ms to minimize.
[2024-05-27 15:31:16] [INFO ] Deduced a trap composed of 49 places in 209 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/948 variables, and 65 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-27 15:31:36] [INFO ] Deduced a trap composed of 65 places in 133 ms of which 2 ms to minimize.
[2024-05-27 15:31:36] [INFO ] Deduced a trap composed of 65 places in 124 ms of which 2 ms to minimize.
[2024-05-27 15:31:36] [INFO ] Deduced a trap composed of 65 places in 126 ms of which 2 ms to minimize.
[2024-05-27 15:31:36] [INFO ] Deduced a trap composed of 57 places in 143 ms of which 1 ms to minimize.
[2024-05-27 15:31:36] [INFO ] Deduced a trap composed of 50 places in 146 ms of which 2 ms to minimize.
[2024-05-27 15:31:37] [INFO ] Deduced a trap composed of 44 places in 140 ms of which 1 ms to minimize.
[2024-05-27 15:31:37] [INFO ] Deduced a trap composed of 65 places in 213 ms of which 2 ms to minimize.
[2024-05-27 15:31:37] [INFO ] Deduced a trap composed of 57 places in 209 ms of which 2 ms to minimize.
[2024-05-27 15:31:40] [INFO ] Deduced a trap composed of 44 places in 228 ms of which 2 ms to minimize.
[2024-05-27 15:31:40] [INFO ] Deduced a trap composed of 41 places in 210 ms of which 1 ms to minimize.
[2024-05-27 15:31:40] [INFO ] Deduced a trap composed of 53 places in 211 ms of which 2 ms to minimize.
[2024-05-27 15:31:41] [INFO ] Deduced a trap composed of 41 places in 212 ms of which 2 ms to minimize.
[2024-05-27 15:31:41] [INFO ] Deduced a trap composed of 40 places in 213 ms of which 4 ms to minimize.
[2024-05-27 15:31:41] [INFO ] Deduced a trap composed of 59 places in 150 ms of which 2 ms to minimize.
[2024-05-27 15:31:41] [INFO ] Deduced a trap composed of 49 places in 134 ms of which 2 ms to minimize.
[2024-05-27 15:31:41] [INFO ] Deduced a trap composed of 49 places in 126 ms of which 1 ms to minimize.
[2024-05-27 15:31:42] [INFO ] Deduced a trap composed of 57 places in 108 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 17/82 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-27 15:31:54] [INFO ] Deduced a trap composed of 49 places in 132 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/948 variables, and 83 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 38/38 constraints]
After SMT, in 64186ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 64201ms
Finished structural reductions in LTL mode , in 1 iterations and 65029 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 (NOT p0) p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
Knowledge based reduction with 10 factoid took 251 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 168 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 351 steps (0 resets) in 53 ms. (6 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (F (NOT (OR p0 p1 p2))), (F (NOT (AND (NOT p0) p1))), (F (NOT p1)), (F p0), (F (NOT p2)), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 10 factoid took 422 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 156 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 32256 reset in 6846 ms.
Product exploration explored 100000 steps with 32235 reset in 6855 ms.
Built C files in :
/tmp/ltsmin10575314660330865816
[2024-05-27 15:32:09] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10575314660330865816
Running compilation step : cd /tmp/ltsmin10575314660330865816;'/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/ltsmin10575314660330865816;'/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/ltsmin10575314660330865816;'/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 161 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 2 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-27 15:32:12] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 15:32:12] [INFO ] Invariant cache hit.
[2024-05-27 15:32:12] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-05-27 15:32:12] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 15:32:12] [INFO ] Invariant cache hit.
[2024-05-27 15:32:12] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 15:32:13] [INFO ] Implicit Places using invariants and state equation in 717 ms returned []
Implicit Place search using SMT with State Equation took 840 ms to find 0 implicit places.
Running 1521 sub problems to find dead transitions.
[2024-05-27 15:32:13] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 15:32:13] [INFO ] Invariant cache hit.
[2024-05-27 15:32:13] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-27 15:32:26] [INFO ] Deduced a trap composed of 35 places in 206 ms of which 2 ms to minimize.
[2024-05-27 15:32:26] [INFO ] Deduced a trap composed of 59 places in 205 ms of which 2 ms to minimize.
[2024-05-27 15:32:27] [INFO ] Deduced a trap composed of 42 places in 240 ms of which 2 ms to minimize.
[2024-05-27 15:32:27] [INFO ] Deduced a trap composed of 56 places in 134 ms of which 2 ms to minimize.
[2024-05-27 15:32:27] [INFO ] Deduced a trap composed of 40 places in 136 ms of which 3 ms to minimize.
[2024-05-27 15:32:27] [INFO ] Deduced a trap composed of 50 places in 143 ms of which 1 ms to minimize.
[2024-05-27 15:32:27] [INFO ] Deduced a trap composed of 49 places in 160 ms of which 2 ms to minimize.
[2024-05-27 15:32:27] [INFO ] Deduced a trap composed of 48 places in 117 ms of which 1 ms to minimize.
[2024-05-27 15:32:37] [INFO ] Deduced a trap composed of 31 places in 204 ms of which 2 ms to minimize.
[2024-05-27 15:32:37] [INFO ] Deduced a trap composed of 30 places in 201 ms of which 1 ms to minimize.
[2024-05-27 15:32:37] [INFO ] Deduced a trap composed of 30 places in 207 ms of which 1 ms to minimize.
[2024-05-27 15:32:37] [INFO ] Deduced a trap composed of 21 places in 202 ms of which 2 ms to minimize.
[2024-05-27 15:32:38] [INFO ] Deduced a trap composed of 30 places in 204 ms of which 1 ms to minimize.
[2024-05-27 15:32:38] [INFO ] Deduced a trap composed of 30 places in 211 ms of which 2 ms to minimize.
[2024-05-27 15:32:38] [INFO ] Deduced a trap composed of 21 places in 205 ms of which 2 ms to minimize.
[2024-05-27 15:32:38] [INFO ] Deduced a trap composed of 30 places in 205 ms of which 2 ms to minimize.
[2024-05-27 15:32:39] [INFO ] Deduced a trap composed of 30 places in 201 ms of which 6 ms to minimize.
[2024-05-27 15:32:39] [INFO ] Deduced a trap composed of 65 places in 199 ms of which 1 ms to minimize.
[2024-05-27 15:32:40] [INFO ] Deduced a trap composed of 49 places in 218 ms of which 2 ms to minimize.
[2024-05-27 15:32:40] [INFO ] Deduced a trap composed of 49 places in 216 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/948 variables, and 65 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-27 15:32:59] [INFO ] Deduced a trap composed of 65 places in 116 ms of which 1 ms to minimize.
[2024-05-27 15:32:59] [INFO ] Deduced a trap composed of 65 places in 114 ms of which 1 ms to minimize.
[2024-05-27 15:33:00] [INFO ] Deduced a trap composed of 65 places in 120 ms of which 2 ms to minimize.
[2024-05-27 15:33:00] [INFO ] Deduced a trap composed of 57 places in 137 ms of which 2 ms to minimize.
[2024-05-27 15:33:00] [INFO ] Deduced a trap composed of 50 places in 135 ms of which 1 ms to minimize.
[2024-05-27 15:33:00] [INFO ] Deduced a trap composed of 44 places in 138 ms of which 1 ms to minimize.
[2024-05-27 15:33:00] [INFO ] Deduced a trap composed of 65 places in 194 ms of which 2 ms to minimize.
[2024-05-27 15:33:00] [INFO ] Deduced a trap composed of 57 places in 197 ms of which 1 ms to minimize.
[2024-05-27 15:33:03] [INFO ] Deduced a trap composed of 44 places in 214 ms of which 2 ms to minimize.
[2024-05-27 15:33:03] [INFO ] Deduced a trap composed of 41 places in 212 ms of which 2 ms to minimize.
[2024-05-27 15:33:04] [INFO ] Deduced a trap composed of 53 places in 219 ms of which 2 ms to minimize.
[2024-05-27 15:33:04] [INFO ] Deduced a trap composed of 41 places in 217 ms of which 2 ms to minimize.
[2024-05-27 15:33:04] [INFO ] Deduced a trap composed of 40 places in 202 ms of which 2 ms to minimize.
[2024-05-27 15:33:04] [INFO ] Deduced a trap composed of 59 places in 139 ms of which 2 ms to minimize.
[2024-05-27 15:33:05] [INFO ] Deduced a trap composed of 49 places in 132 ms of which 1 ms to minimize.
[2024-05-27 15:33:05] [INFO ] Deduced a trap composed of 49 places in 123 ms of which 1 ms to minimize.
[2024-05-27 15:33:05] [INFO ] Deduced a trap composed of 57 places in 110 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 17/82 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-27 15:33:17] [INFO ] Deduced a trap composed of 49 places in 131 ms of which 2 ms to minimize.
[2024-05-27 15:33:17] [INFO ] Deduced a trap composed of 49 places in 131 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 1)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 1)
(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 1)
(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 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 1)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 1)
(s233 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/948 variables, and 84 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 39/39 constraints]
After SMT, in 64579ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 64596ms
Finished structural reductions in LTL mode , in 1 iterations and 65444 ms. Remains : 306/306 places, 1531/1531 transitions.
Built C files in :
/tmp/ltsmin8323079247002747582
[2024-05-27 15:33:18] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8323079247002747582
Running compilation step : cd /tmp/ltsmin8323079247002747582;'/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/ltsmin8323079247002747582;'/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/ltsmin8323079247002747582;'/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 15:33:21] [INFO ] Flatten gal took : 69 ms
[2024-05-27 15:33:21] [INFO ] Flatten gal took : 55 ms
[2024-05-27 15:33:21] [INFO ] Time to serialize gal into /tmp/LTL13794485610847827789.gal : 9 ms
[2024-05-27 15:33:21] [INFO ] Time to serialize properties into /tmp/LTL16686805654576191658.prop : 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/LTL13794485610847827789.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8348929796554873491.hoa' '-atoms' '/tmp/LTL16686805654576191658.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/LTL16686805654576191658.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8348929796554873491.hoa
Detected timeout of ITS tools.
[2024-05-27 15:33:36] [INFO ] Flatten gal took : 66 ms
[2024-05-27 15:33:36] [INFO ] Flatten gal took : 66 ms
[2024-05-27 15:33:36] [INFO ] Time to serialize gal into /tmp/LTL6115209669637414580.gal : 7 ms
[2024-05-27 15:33:36] [INFO ] Time to serialize properties into /tmp/LTL5246861845491405927.ltl : 9 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/LTL6115209669637414580.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5246861845491405927.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 : !((F(("((((((((((((Cpt2_8>=1)&&(cable_used_9>=1))&&((AMC_28>=1)&&(FMCb>=1)))||(((Cpt2_8>=1)&&(cable_used_5>=1))&&((AMC_98>=1)&&(FMCb>=...67491
Formula 0 simplified : G(!"((((((((((((Cpt2_8>=1)&&(cable_used_9>=1))&&((AMC_28>=1)&&(FMCb>=1)))||(((Cpt2_8>=1)&&(cable_used_5>=1))&&((AMC_98>=1)&&(FMCb>=1...67473
Detected timeout of ITS tools.
[2024-05-27 15:33:51] [INFO ] Flatten gal took : 65 ms
[2024-05-27 15:33:51] [INFO ] Applying decomposition
[2024-05-27 15:33:51] [INFO ] Flatten gal took : 67 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/graph4454375853493698668.txt' '-o' '/tmp/graph4454375853493698668.bin' '-w' '/tmp/graph4454375853493698668.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4454375853493698668.bin' '-l' '-1' '-v' '-w' '/tmp/graph4454375853493698668.weights' '-q' '0' '-e' '0.001'
[2024-05-27 15:33:51] [INFO ] Decomposing Gal with order
[2024-05-27 15:33:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 15:33:52] [INFO ] Removed a total of 3550 redundant transitions.
[2024-05-27 15:33:52] [INFO ] Flatten gal took : 164 ms
[2024-05-27 15:33:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 574 labels/synchronizations in 22 ms.
[2024-05-27 15:33:52] [INFO ] Time to serialize gal into /tmp/LTL2676592441751652417.gal : 5 ms
[2024-05-27 15:33:52] [INFO ] Time to serialize properties into /tmp/LTL11515964052879017379.ltl : 10 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/LTL2676592441751652417.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11515964052879017379.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(("((((((((((((i2.u4.Cpt2_8>=1)&&(i2.u18.cable_used_9>=1))&&((i2.u4.AMC_28>=1)&&(i2.u18.FMCb>=1)))||(((i2.u4.Cpt2_8>=1)&&(i2.u18.c...95280
Formula 0 simplified : G(!"((((((((((((i2.u4.Cpt2_8>=1)&&(i2.u18.cable_used_9>=1))&&((i2.u4.AMC_28>=1)&&(i2.u18.FMCb>=1)))||(((i2.u4.Cpt2_8>=1)&&(i2.u18.ca...95262
Detected timeout of ITS tools.
Treatment of property SafeBus-COL-10-LTLFireability-13 finished in 278572 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 !p1))'
Support contains 22 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 15:34:07] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 15:34:07] [INFO ] Invariant cache hit.
[2024-05-27 15:34:07] [INFO ] Implicit Places using invariants in 398 ms returned []
[2024-05-27 15:34:07] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 15:34:07] [INFO ] Invariant cache hit.
[2024-05-27 15:34:07] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 15:34:09] [INFO ] Implicit Places using invariants and state equation in 1854 ms returned []
Implicit Place search using SMT with State Equation took 2254 ms to find 0 implicit places.
[2024-05-27 15:34:09] [INFO ] Redundant transitions in 24 ms returned []
Running 1521 sub problems to find dead transitions.
[2024-05-27 15:34:09] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 15:34:09] [INFO ] Invariant cache hit.
[2024-05-27 15:34:09] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-27 15:34:22] [INFO ] Deduced a trap composed of 35 places in 209 ms of which 2 ms to minimize.
[2024-05-27 15:34:22] [INFO ] Deduced a trap composed of 59 places in 207 ms of which 4 ms to minimize.
[2024-05-27 15:34:22] [INFO ] Deduced a trap composed of 42 places in 224 ms of which 2 ms to minimize.
[2024-05-27 15:34:22] [INFO ] Deduced a trap composed of 56 places in 152 ms of which 2 ms to minimize.
[2024-05-27 15:34:22] [INFO ] Deduced a trap composed of 40 places in 132 ms of which 2 ms to minimize.
[2024-05-27 15:34:22] [INFO ] Deduced a trap composed of 50 places in 141 ms of which 2 ms to minimize.
[2024-05-27 15:34:23] [INFO ] Deduced a trap composed of 49 places in 129 ms of which 2 ms to minimize.
[2024-05-27 15:34:23] [INFO ] Deduced a trap composed of 48 places in 115 ms of which 1 ms to minimize.
[2024-05-27 15:34:32] [INFO ] Deduced a trap composed of 31 places in 234 ms of which 2 ms to minimize.
[2024-05-27 15:34:32] [INFO ] Deduced a trap composed of 30 places in 201 ms of which 2 ms to minimize.
[2024-05-27 15:34:32] [INFO ] Deduced a trap composed of 30 places in 205 ms of which 1 ms to minimize.
[2024-05-27 15:34:33] [INFO ] Deduced a trap composed of 21 places in 203 ms of which 2 ms to minimize.
[2024-05-27 15:34:33] [INFO ] Deduced a trap composed of 30 places in 225 ms of which 1 ms to minimize.
[2024-05-27 15:34:33] [INFO ] Deduced a trap composed of 30 places in 207 ms of which 2 ms to minimize.
[2024-05-27 15:34:33] [INFO ] Deduced a trap composed of 21 places in 202 ms of which 2 ms to minimize.
[2024-05-27 15:34:34] [INFO ] Deduced a trap composed of 30 places in 199 ms of which 2 ms to minimize.
[2024-05-27 15:34:34] [INFO ] Deduced a trap composed of 30 places in 199 ms of which 2 ms to minimize.
[2024-05-27 15:34:35] [INFO ] Deduced a trap composed of 65 places in 224 ms of which 2 ms to minimize.
[2024-05-27 15:34:35] [INFO ] Deduced a trap composed of 49 places in 208 ms of which 2 ms to minimize.
[2024-05-27 15:34:35] [INFO ] Deduced a trap composed of 49 places in 203 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/948 variables, and 65 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-27 15:34:54] [INFO ] Deduced a trap composed of 65 places in 132 ms of which 2 ms to minimize.
[2024-05-27 15:34:54] [INFO ] Deduced a trap composed of 65 places in 131 ms of which 1 ms to minimize.
[2024-05-27 15:34:54] [INFO ] Deduced a trap composed of 65 places in 131 ms of which 2 ms to minimize.
[2024-05-27 15:34:54] [INFO ] Deduced a trap composed of 57 places in 152 ms of which 2 ms to minimize.
[2024-05-27 15:34:55] [INFO ] Deduced a trap composed of 50 places in 152 ms of which 1 ms to minimize.
[2024-05-27 15:34:55] [INFO ] Deduced a trap composed of 44 places in 149 ms of which 2 ms to minimize.
[2024-05-27 15:34:55] [INFO ] Deduced a trap composed of 65 places in 219 ms of which 2 ms to minimize.
[2024-05-27 15:34:55] [INFO ] Deduced a trap composed of 57 places in 203 ms of which 2 ms to minimize.
[2024-05-27 15:34:58] [INFO ] Deduced a trap composed of 44 places in 205 ms of which 2 ms to minimize.
[2024-05-27 15:34:58] [INFO ] Deduced a trap composed of 41 places in 228 ms of which 1 ms to minimize.
[2024-05-27 15:34:58] [INFO ] Deduced a trap composed of 53 places in 209 ms of which 1 ms to minimize.
[2024-05-27 15:34:59] [INFO ] Deduced a trap composed of 41 places in 209 ms of which 1 ms to minimize.
[2024-05-27 15:34:59] [INFO ] Deduced a trap composed of 40 places in 213 ms of which 2 ms to minimize.
[2024-05-27 15:34:59] [INFO ] Deduced a trap composed of 59 places in 155 ms of which 2 ms to minimize.
[2024-05-27 15:34:59] [INFO ] Deduced a trap composed of 49 places in 136 ms of which 2 ms to minimize.
[2024-05-27 15:34:59] [INFO ] Deduced a trap composed of 49 places in 125 ms of which 2 ms to minimize.
[2024-05-27 15:35:00] [INFO ] Deduced a trap composed of 57 places in 106 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 17/82 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-27 15:35:11] [INFO ] Deduced a trap composed of 49 places in 134 ms of which 1 ms to minimize.
[2024-05-27 15:35:12] [INFO ] Deduced a trap composed of 49 places in 136 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/948 variables, and 84 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 39/39 constraints]
After SMT, in 64126ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 64140ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 66541 ms. Remains : 306/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 116 ms :[p1, p0, p0]
Running random walk in product with property : SafeBus-COL-10-LTLFireability-14
Product exploration explored 100000 steps with 1090 reset in 454 ms.
Product exploration explored 100000 steps with 1114 reset in 465 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT p0)), (X p1), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 85 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[p1, p0, p0]
RANDOM walk for 209 steps (0 resets) in 13 ms. (14 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT p0)), (X p1), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 7 factoid took 186 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 118 ms :[p1, p0, p0]
Stuttering acceptance computed with spot in 99 ms :[p1, p0, p0]
[2024-05-27 15:35:15] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 15:35:15] [INFO ] Invariant cache hit.
[2024-05-27 15:35:16] [INFO ] [Real]Absence check using 21 positive place invariants in 16 ms returned sat
[2024-05-27 15:35:16] [INFO ] [Real]Absence check using 21 positive and 24 generalized place invariants in 26 ms returned sat
[2024-05-27 15:35:16] [INFO ] [Real]Absence check using state equation in 479 ms returned sat
[2024-05-27 15:35:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 15:35:17] [INFO ] [Nat]Absence check using 21 positive place invariants in 11 ms returned sat
[2024-05-27 15:35:17] [INFO ] [Nat]Absence check using 21 positive and 24 generalized place invariants in 31 ms returned sat
[2024-05-27 15:35:17] [INFO ] [Nat]Absence check using state equation in 418 ms returned sat
[2024-05-27 15:35:17] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 15:35:17] [INFO ] [Nat]Added 111 Read/Feed constraints in 54 ms returned sat
[2024-05-27 15:35:17] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 94 ms.
[2024-05-27 15:35:17] [INFO ] Added : 0 causal constraints over 0 iterations in 150 ms. Result :sat
Could not prove EG p1
Support contains 22 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 121 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-27 15:35:17] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 15:35:17] [INFO ] Invariant cache hit.
[2024-05-27 15:35:18] [INFO ] Implicit Places using invariants in 392 ms returned []
[2024-05-27 15:35:18] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 15:35:18] [INFO ] Invariant cache hit.
[2024-05-27 15:35:18] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 15:35:20] [INFO ] Implicit Places using invariants and state equation in 1819 ms returned []
Implicit Place search using SMT with State Equation took 2219 ms to find 0 implicit places.
[2024-05-27 15:35:20] [INFO ] Redundant transitions in 27 ms returned []
Running 1521 sub problems to find dead transitions.
[2024-05-27 15:35:20] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 15:35:20] [INFO ] Invariant cache hit.
[2024-05-27 15:35:20] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-27 15:35:32] [INFO ] Deduced a trap composed of 35 places in 227 ms of which 2 ms to minimize.
[2024-05-27 15:35:32] [INFO ] Deduced a trap composed of 59 places in 205 ms of which 2 ms to minimize.
[2024-05-27 15:35:33] [INFO ] Deduced a trap composed of 42 places in 220 ms of which 2 ms to minimize.
[2024-05-27 15:35:33] [INFO ] Deduced a trap composed of 56 places in 137 ms of which 1 ms to minimize.
[2024-05-27 15:35:33] [INFO ] Deduced a trap composed of 40 places in 142 ms of which 1 ms to minimize.
[2024-05-27 15:35:33] [INFO ] Deduced a trap composed of 50 places in 136 ms of which 1 ms to minimize.
[2024-05-27 15:35:33] [INFO ] Deduced a trap composed of 49 places in 126 ms of which 2 ms to minimize.
[2024-05-27 15:35:33] [INFO ] Deduced a trap composed of 48 places in 116 ms of which 2 ms to minimize.
[2024-05-27 15:35:42] [INFO ] Deduced a trap composed of 31 places in 211 ms of which 2 ms to minimize.
[2024-05-27 15:35:42] [INFO ] Deduced a trap composed of 30 places in 228 ms of which 2 ms to minimize.
[2024-05-27 15:35:42] [INFO ] Deduced a trap composed of 30 places in 210 ms of which 2 ms to minimize.
[2024-05-27 15:35:42] [INFO ] Deduced a trap composed of 21 places in 211 ms of which 2 ms to minimize.
[2024-05-27 15:35:43] [INFO ] Deduced a trap composed of 30 places in 209 ms of which 2 ms to minimize.
[2024-05-27 15:35:43] [INFO ] Deduced a trap composed of 30 places in 203 ms of which 2 ms to minimize.
[2024-05-27 15:35:43] [INFO ] Deduced a trap composed of 21 places in 201 ms of which 2 ms to minimize.
[2024-05-27 15:35:43] [INFO ] Deduced a trap composed of 30 places in 208 ms of which 2 ms to minimize.
[2024-05-27 15:35:43] [INFO ] Deduced a trap composed of 30 places in 205 ms of which 1 ms to minimize.
[2024-05-27 15:35:44] [INFO ] Deduced a trap composed of 65 places in 232 ms of which 2 ms to minimize.
[2024-05-27 15:35:45] [INFO ] Deduced a trap composed of 49 places in 236 ms of which 2 ms to minimize.
[2024-05-27 15:35:45] [INFO ] Deduced a trap composed of 49 places in 218 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/948 variables, and 65 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-27 15:36:05] [INFO ] Deduced a trap composed of 65 places in 117 ms of which 2 ms to minimize.
[2024-05-27 15:36:06] [INFO ] Deduced a trap composed of 65 places in 118 ms of which 2 ms to minimize.
[2024-05-27 15:36:06] [INFO ] Deduced a trap composed of 65 places in 114 ms of which 1 ms to minimize.
[2024-05-27 15:36:06] [INFO ] Deduced a trap composed of 57 places in 139 ms of which 1 ms to minimize.
[2024-05-27 15:36:06] [INFO ] Deduced a trap composed of 50 places in 141 ms of which 2 ms to minimize.
[2024-05-27 15:36:06] [INFO ] Deduced a trap composed of 44 places in 136 ms of which 1 ms to minimize.
[2024-05-27 15:36:06] [INFO ] Deduced a trap composed of 65 places in 190 ms of which 2 ms to minimize.
[2024-05-27 15:36:07] [INFO ] Deduced a trap composed of 57 places in 196 ms of which 2 ms to minimize.
[2024-05-27 15:36:09] [INFO ] Deduced a trap composed of 44 places in 208 ms of which 2 ms to minimize.
[2024-05-27 15:36:10] [INFO ] Deduced a trap composed of 41 places in 202 ms of which 2 ms to minimize.
[2024-05-27 15:36:10] [INFO ] Deduced a trap composed of 53 places in 200 ms of which 2 ms to minimize.
[2024-05-27 15:36:10] [INFO ] Deduced a trap composed of 41 places in 206 ms of which 1 ms to minimize.
[2024-05-27 15:36:10] [INFO ] Deduced a trap composed of 40 places in 216 ms of which 2 ms to minimize.
[2024-05-27 15:36:10] [INFO ] Deduced a trap composed of 59 places in 144 ms of which 2 ms to minimize.
[2024-05-27 15:36:11] [INFO ] Deduced a trap composed of 49 places in 135 ms of which 2 ms to minimize.
[2024-05-27 15:36:11] [INFO ] Deduced a trap composed of 49 places in 128 ms of which 3 ms to minimize.
[2024-05-27 15:36:11] [INFO ] Deduced a trap composed of 57 places in 115 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 17/82 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-27 15:36:22] [INFO ] Deduced a trap composed of 49 places in 134 ms of which 1 ms to minimize.
[2024-05-27 15:36:22] [INFO ] Deduced a trap composed of 49 places in 133 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/948 variables, and 84 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 39/39 constraints]
After SMT, in 64061ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 64079ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 66460 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 p1 (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 86 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[p1, p0, p0]
RANDOM walk for 332 steps (0 resets) in 10 ms. (30 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 7 factoid took 164 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 121 ms :[p1, p0, p0]
Stuttering acceptance computed with spot in 110 ms :[p1, p0, p0]
[2024-05-27 15:36:24] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 15:36:24] [INFO ] Invariant cache hit.
[2024-05-27 15:36:25] [INFO ] [Real]Absence check using 21 positive place invariants in 15 ms returned sat
[2024-05-27 15:36:25] [INFO ] [Real]Absence check using 21 positive and 24 generalized place invariants in 23 ms returned sat
[2024-05-27 15:36:26] [INFO ] [Real]Absence check using state equation in 501 ms returned sat
[2024-05-27 15:36:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 15:36:26] [INFO ] [Nat]Absence check using 21 positive place invariants in 9 ms returned sat
[2024-05-27 15:36:26] [INFO ] [Nat]Absence check using 21 positive and 24 generalized place invariants in 27 ms returned sat
[2024-05-27 15:36:27] [INFO ] [Nat]Absence check using state equation in 404 ms returned sat
[2024-05-27 15:36:27] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 15:36:27] [INFO ] [Nat]Added 111 Read/Feed constraints in 50 ms returned sat
[2024-05-27 15:36:27] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 80 ms.
[2024-05-27 15:36:27] [INFO ] Added : 0 causal constraints over 0 iterations in 148 ms. Result :sat
Could not prove EG p1
Stuttering acceptance computed with spot in 117 ms :[p1, p0, p0]
Product exploration explored 100000 steps with 1100 reset in 457 ms.
Product exploration explored 100000 steps with 1065 reset in 435 ms.
Built C files in :
/tmp/ltsmin15400138306327560511
[2024-05-27 15:36:28] [INFO ] Too many transitions (1531) to apply POR reductions. Disabling POR matrices.
[2024-05-27 15:36:28] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15400138306327560511
Running compilation step : cd /tmp/ltsmin15400138306327560511;'/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/ltsmin15400138306327560511;'/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/ltsmin15400138306327560511;'/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 22 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 109 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-27 15:36:31] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 15:36:31] [INFO ] Invariant cache hit.
[2024-05-27 15:36:31] [INFO ] Implicit Places using invariants in 369 ms returned []
[2024-05-27 15:36:31] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 15:36:31] [INFO ] Invariant cache hit.
[2024-05-27 15:36:32] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 15:36:33] [INFO ] Implicit Places using invariants and state equation in 1736 ms returned []
Implicit Place search using SMT with State Equation took 2106 ms to find 0 implicit places.
[2024-05-27 15:36:33] [INFO ] Redundant transitions in 28 ms returned []
Running 1521 sub problems to find dead transitions.
[2024-05-27 15:36:33] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 15:36:33] [INFO ] Invariant cache hit.
[2024-05-27 15:36:33] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-27 15:36:46] [INFO ] Deduced a trap composed of 35 places in 205 ms of which 2 ms to minimize.
[2024-05-27 15:36:46] [INFO ] Deduced a trap composed of 59 places in 258 ms of which 2 ms to minimize.
[2024-05-27 15:36:46] [INFO ] Deduced a trap composed of 42 places in 212 ms of which 2 ms to minimize.
[2024-05-27 15:36:47] [INFO ] Deduced a trap composed of 56 places in 150 ms of which 2 ms to minimize.
[2024-05-27 15:36:47] [INFO ] Deduced a trap composed of 40 places in 135 ms of which 2 ms to minimize.
[2024-05-27 15:36:47] [INFO ] Deduced a trap composed of 50 places in 150 ms of which 1 ms to minimize.
[2024-05-27 15:36:47] [INFO ] Deduced a trap composed of 49 places in 137 ms of which 2 ms to minimize.
[2024-05-27 15:36:47] [INFO ] Deduced a trap composed of 48 places in 133 ms of which 1 ms to minimize.
[2024-05-27 15:36:56] [INFO ] Deduced a trap composed of 31 places in 211 ms of which 2 ms to minimize.
[2024-05-27 15:36:56] [INFO ] Deduced a trap composed of 30 places in 197 ms of which 2 ms to minimize.
[2024-05-27 15:36:56] [INFO ] Deduced a trap composed of 30 places in 199 ms of which 1 ms to minimize.
[2024-05-27 15:36:56] [INFO ] Deduced a trap composed of 21 places in 196 ms of which 2 ms to minimize.
[2024-05-27 15:36:57] [INFO ] Deduced a trap composed of 30 places in 210 ms of which 2 ms to minimize.
[2024-05-27 15:36:57] [INFO ] Deduced a trap composed of 30 places in 211 ms of which 2 ms to minimize.
[2024-05-27 15:36:57] [INFO ] Deduced a trap composed of 21 places in 200 ms of which 2 ms to minimize.
[2024-05-27 15:36:57] [INFO ] Deduced a trap composed of 30 places in 206 ms of which 2 ms to minimize.
[2024-05-27 15:36:57] [INFO ] Deduced a trap composed of 30 places in 192 ms of which 2 ms to minimize.
[2024-05-27 15:36:58] [INFO ] Deduced a trap composed of 65 places in 198 ms of which 2 ms to minimize.
[2024-05-27 15:36:59] [INFO ] Deduced a trap composed of 49 places in 208 ms of which 2 ms to minimize.
[2024-05-27 15:36:59] [INFO ] Deduced a trap composed of 49 places in 204 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/948 variables, and 65 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-27 15:37:19] [INFO ] Deduced a trap composed of 65 places in 116 ms of which 2 ms to minimize.
[2024-05-27 15:37:19] [INFO ] Deduced a trap composed of 65 places in 118 ms of which 1 ms to minimize.
[2024-05-27 15:37:20] [INFO ] Deduced a trap composed of 65 places in 121 ms of which 1 ms to minimize.
[2024-05-27 15:37:20] [INFO ] Deduced a trap composed of 57 places in 132 ms of which 1 ms to minimize.
[2024-05-27 15:37:20] [INFO ] Deduced a trap composed of 50 places in 146 ms of which 2 ms to minimize.
[2024-05-27 15:37:20] [INFO ] Deduced a trap composed of 44 places in 135 ms of which 2 ms to minimize.
[2024-05-27 15:37:20] [INFO ] Deduced a trap composed of 65 places in 197 ms of which 2 ms to minimize.
[2024-05-27 15:37:20] [INFO ] Deduced a trap composed of 57 places in 212 ms of which 1 ms to minimize.
[2024-05-27 15:37:23] [INFO ] Deduced a trap composed of 44 places in 204 ms of which 2 ms to minimize.
[2024-05-27 15:37:23] [INFO ] Deduced a trap composed of 41 places in 204 ms of which 2 ms to minimize.
[2024-05-27 15:37:24] [INFO ] Deduced a trap composed of 53 places in 200 ms of which 2 ms to minimize.
[2024-05-27 15:37:24] [INFO ] Deduced a trap composed of 41 places in 205 ms of which 1 ms to minimize.
[2024-05-27 15:37:24] [INFO ] Deduced a trap composed of 40 places in 203 ms of which 2 ms to minimize.
[2024-05-27 15:37:24] [INFO ] Deduced a trap composed of 59 places in 147 ms of which 2 ms to minimize.
[2024-05-27 15:37:24] [INFO ] Deduced a trap composed of 49 places in 125 ms of which 1 ms to minimize.
[2024-05-27 15:37:25] [INFO ] Deduced a trap composed of 49 places in 120 ms of which 2 ms to minimize.
[2024-05-27 15:37:25] [INFO ] Deduced a trap composed of 57 places in 107 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 17/82 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-27 15:37:36] [INFO ] Deduced a trap composed of 49 places in 144 ms of which 2 ms to minimize.
[2024-05-27 15:37:36] [INFO ] Deduced a trap composed of 49 places in 167 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/948 variables, and 84 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 39/39 constraints]
After SMT, in 64410ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 64425ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 66676 ms. Remains : 306/306 places, 1531/1531 transitions.
Built C files in :
/tmp/ltsmin10111269338388260518
[2024-05-27 15:37:38] [INFO ] Too many transitions (1531) to apply POR reductions. Disabling POR matrices.
[2024-05-27 15:37:38] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10111269338388260518
Running compilation step : cd /tmp/ltsmin10111269338388260518;'/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/ltsmin10111269338388260518;'/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/ltsmin10111269338388260518;'/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 15:37:41] [INFO ] Flatten gal took : 51 ms
[2024-05-27 15:37:41] [INFO ] Flatten gal took : 62 ms
[2024-05-27 15:37:41] [INFO ] Time to serialize gal into /tmp/LTL13648022521455668310.gal : 8 ms
[2024-05-27 15:37:41] [INFO ] Time to serialize properties into /tmp/LTL10331650368245549863.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/LTL13648022521455668310.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9270263605506234584.hoa' '-atoms' '/tmp/LTL10331650368245549863.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/LTL10331650368245549863.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9270263605506234584.hoa
Detected timeout of ITS tools.
[2024-05-27 15:37:56] [INFO ] Flatten gal took : 51 ms
[2024-05-27 15:37:56] [INFO ] Flatten gal took : 50 ms
[2024-05-27 15:37:56] [INFO ] Time to serialize gal into /tmp/LTL464147340676497406.gal : 7 ms
[2024-05-27 15:37:56] [INFO ] Time to serialize properties into /tmp/LTL393630025508770479.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/LTL464147340676497406.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL393630025508770479.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...273
Read 1 LTL properties
Checking formula 0 : !(((G(F(!("((ACK>=1)&&(R_tout>=1))"))))U(!("((((((wait_cable_0<1)||(RMC_0<1))&&((wait_cable_4<1)||(RMC_4<1)))&&(((wait_cable_8<1)||(RM...396
Formula 0 simplified : FG"((ACK>=1)&&(R_tout>=1))" R "((((((wait_cable_0<1)||(RMC_0<1))&&((wait_cable_4<1)||(RMC_4<1)))&&(((wait_cable_8<1)||(RMC_8<1))&&((...381
Detected timeout of ITS tools.
[2024-05-27 15:38:11] [INFO ] Flatten gal took : 51 ms
[2024-05-27 15:38:11] [INFO ] Applying decomposition
[2024-05-27 15:38:11] [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/graph2347971845718191005.txt' '-o' '/tmp/graph2347971845718191005.bin' '-w' '/tmp/graph2347971845718191005.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2347971845718191005.bin' '-l' '-1' '-v' '-w' '/tmp/graph2347971845718191005.weights' '-q' '0' '-e' '0.001'
[2024-05-27 15:38:11] [INFO ] Decomposing Gal with order
[2024-05-27 15:38:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 15:38:12] [INFO ] Removed a total of 3706 redundant transitions.
[2024-05-27 15:38:12] [INFO ] Flatten gal took : 135 ms
[2024-05-27 15:38:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 553 labels/synchronizations in 21 ms.
[2024-05-27 15:38:12] [INFO ] Time to serialize gal into /tmp/LTL10596724060027340844.gal : 6 ms
[2024-05-27 15:38:12] [INFO ] Time to serialize properties into /tmp/LTL7784849989101714414.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/LTL10596724060027340844.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7784849989101714414.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 : !(((G(F(!("((i4.u14.ACK>=1)&&(i4.u16.R_tout>=1))"))))U(!("((((((i1.u18.wait_cable_0<1)||(i0.u17.RMC_0<1))&&((i4.u15.wait_cable_4<1)||(...545
Formula 0 simplified : FG"((i4.u14.ACK>=1)&&(i4.u16.R_tout>=1))" R "((((((i1.u18.wait_cable_0<1)||(i0.u17.RMC_0<1))&&((i4.u15.wait_cable_4<1)||(i0.u17.RMC_...530
Detected timeout of ITS tools.
Treatment of property SafeBus-COL-10-LTLFireability-14 finished in 259912 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 (p1||G(!p0))))))'
Support contains 114 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 98 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-27 15:38:27] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 15:38:27] [INFO ] Invariant cache hit.
[2024-05-27 15:38:27] [INFO ] Implicit Places using invariants in 251 ms returned [231, 232, 233, 234, 235, 236, 237, 238, 239, 240]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 252 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 296/306 places, 1531/1531 transitions.
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 0 place count 296 transition count 1521
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 286 transition count 1521
Applied a total of 20 rules in 101 ms. Remains 286 /296 variables (removed 10) and now considering 1521/1531 (removed 10) transitions.
[2024-05-27 15:38:27] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
// Phase 1: matrix 632 rows 286 cols
[2024-05-27 15:38:27] [INFO ] Computed 35 invariants in 7 ms
[2024-05-27 15:38:27] [INFO ] Implicit Places using invariants in 185 ms returned []
[2024-05-27 15:38:27] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2024-05-27 15:38:27] [INFO ] Invariant cache hit.
[2024-05-27 15:38:27] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 15:38:28] [INFO ] Implicit Places using invariants and state equation in 934 ms returned []
Implicit Place search using SMT with State Equation took 1121 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 1573 ms. Remains : 286/306 places, 1521/1531 transitions.
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : SafeBus-COL-10-LTLFireability-15
Product exploration explored 100000 steps with 1332 reset in 795 ms.
Product exploration explored 100000 steps with 1319 reset in 776 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 7 factoid took 181 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 181 steps (0 resets) in 6 ms. (25 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 7 factoid took 257 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 79 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 114 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 96 ms. Remains 286 /286 variables (removed 0) and now considering 1521/1521 (removed 0) transitions.
[2024-05-27 15:38:31] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2024-05-27 15:38:31] [INFO ] Invariant cache hit.
[2024-05-27 15:38:31] [INFO ] Implicit Places using invariants in 187 ms returned []
[2024-05-27 15:38:31] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2024-05-27 15:38:31] [INFO ] Invariant cache hit.
[2024-05-27 15:38:31] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 15:38:32] [INFO ] Implicit Places using invariants and state equation in 897 ms returned []
Implicit Place search using SMT with State Equation took 1087 ms to find 0 implicit places.
[2024-05-27 15:38:32] [INFO ] Redundant transitions in 27 ms returned []
Running 1511 sub problems to find dead transitions.
[2024-05-27 15:38:32] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2024-05-27 15:38:32] [INFO ] Invariant cache hit.
[2024-05-27 15:38:32] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/286 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/286 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
[2024-05-27 15:38:43] [INFO ] Deduced a trap composed of 46 places in 82 ms of which 1 ms to minimize.
[2024-05-27 15:38:43] [INFO ] Deduced a trap composed of 42 places in 67 ms of which 1 ms to minimize.
[2024-05-27 15:38:51] [INFO ] Deduced a trap composed of 30 places in 213 ms of which 2 ms to minimize.
[2024-05-27 15:38:52] [INFO ] Deduced a trap composed of 30 places in 227 ms of which 2 ms to minimize.
[2024-05-27 15:38:52] [INFO ] Deduced a trap composed of 21 places in 223 ms of which 2 ms to minimize.
[2024-05-27 15:38:52] [INFO ] Deduced a trap composed of 30 places in 225 ms of which 2 ms to minimize.
[2024-05-27 15:38:52] [INFO ] Deduced a trap composed of 60 places in 222 ms of which 2 ms to minimize.
[2024-05-27 15:38:53] [INFO ] Deduced a trap composed of 30 places in 221 ms of which 2 ms to minimize.
[2024-05-27 15:38:53] [INFO ] Deduced a trap composed of 49 places in 194 ms of which 2 ms to minimize.
[2024-05-27 15:38:54] [INFO ] Deduced a trap composed of 41 places in 189 ms of which 1 ms to minimize.
[2024-05-27 15:38:54] [INFO ] Deduced a trap composed of 41 places in 191 ms of which 2 ms to minimize.
[2024-05-27 15:38:54] [INFO ] Deduced a trap composed of 65 places in 192 ms of which 2 ms to minimize.
[2024-05-27 15:38:57] [INFO ] Deduced a trap composed of 32 places in 207 ms of which 1 ms to minimize.
[2024-05-27 15:38:57] [INFO ] Deduced a trap composed of 32 places in 197 ms of which 2 ms to minimize.
[2024-05-27 15:38:57] [INFO ] Deduced a trap composed of 32 places in 189 ms of which 2 ms to minimize.
[2024-05-27 15:38:57] [INFO ] Deduced a trap composed of 32 places in 203 ms of which 2 ms to minimize.
[2024-05-27 15:38:58] [INFO ] Deduced a trap composed of 32 places in 203 ms of which 2 ms to minimize.
[2024-05-27 15:38:58] [INFO ] Deduced a trap composed of 90 places in 202 ms of which 2 ms to minimize.
[2024-05-27 15:38:58] [INFO ] Deduced a trap composed of 30 places in 203 ms of which 2 ms to minimize.
[2024-05-27 15:38:58] [INFO ] Deduced a trap composed of 86 places in 204 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 20/55 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 55 constraints, problems are : Problem set: 0 solved, 1511 unsolved in 30022 ms.
Refiners :[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, 14/14 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/286 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
[2024-05-27 15:39:15] [INFO ] Deduced a trap composed of 21 places in 206 ms of which 2 ms to minimize.
[2024-05-27 15:39:15] [INFO ] Deduced a trap composed of 31 places in 198 ms of which 1 ms to minimize.
[2024-05-27 15:39:16] [INFO ] Deduced a trap composed of 30 places in 206 ms of which 1 ms to minimize.
[2024-05-27 15:39:16] [INFO ] Deduced a trap composed of 52 places in 209 ms of which 1 ms to minimize.
[2024-05-27 15:39:17] [INFO ] Deduced a trap composed of 65 places in 186 ms of which 1 ms to minimize.
[2024-05-27 15:39:17] [INFO ] Deduced a trap composed of 49 places in 192 ms of which 1 ms to minimize.
[2024-05-27 15:39:17] [INFO ] Deduced a trap composed of 49 places in 196 ms of which 2 ms to minimize.
[2024-05-27 15:39:18] [INFO ] Deduced a trap composed of 41 places in 194 ms of which 2 ms to minimize.
[2024-05-27 15:39:18] [INFO ] Deduced a trap composed of 49 places in 189 ms of which 2 ms to minimize.
[2024-05-27 15:39:18] [INFO ] Deduced a trap composed of 41 places in 196 ms of which 2 ms to minimize.
[2024-05-27 15:39:18] [INFO ] Deduced a trap composed of 49 places in 196 ms of which 1 ms to minimize.
[2024-05-27 15:39:18] [INFO ] Deduced a trap composed of 49 places in 223 ms of which 2 ms to minimize.
[2024-05-27 15:39:19] [INFO ] Deduced a trap composed of 41 places in 208 ms of which 2 ms to minimize.
[2024-05-27 15:39:19] [INFO ] Deduced a trap composed of 49 places in 223 ms of which 17 ms to minimize.
[2024-05-27 15:39:19] [INFO ] Deduced a trap composed of 49 places in 198 ms of which 1 ms to minimize.
[2024-05-27 15:39:19] [INFO ] Deduced a trap composed of 41 places in 204 ms of which 2 ms to minimize.
[2024-05-27 15:39:20] [INFO ] Deduced a trap composed of 57 places in 210 ms of which 2 ms to minimize.
[2024-05-27 15:39:22] [INFO ] Deduced a trap composed of 42 places in 195 ms of which 1 ms to minimize.
[2024-05-27 15:39:22] [INFO ] Deduced a trap composed of 42 places in 202 ms of which 2 ms to minimize.
[2024-05-27 15:39:23] [INFO ] Deduced a trap composed of 21 places in 223 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
[2024-05-27 15:39:25] [INFO ] Deduced a trap composed of 57 places in 139 ms of which 2 ms to minimize.
[2024-05-27 15:39:25] [INFO ] Deduced a trap composed of 41 places in 134 ms of which 2 ms to minimize.
[2024-05-27 15:39:25] [INFO ] Deduced a trap composed of 41 places in 131 ms of which 1 ms to minimize.
[2024-05-27 15:39:26] [INFO ] Deduced a trap composed of 49 places in 131 ms of which 1 ms to minimize.
[2024-05-27 15:39:26] [INFO ] Deduced a trap composed of 57 places in 141 ms of which 2 ms to minimize.
[2024-05-27 15:39:26] [INFO ] Deduced a trap composed of 49 places in 138 ms of which 1 ms to minimize.
[2024-05-27 15:39:26] [INFO ] Deduced a trap composed of 49 places in 130 ms of which 2 ms to minimize.
[2024-05-27 15:39:33] [INFO ] Deduced a trap composed of 21 places in 208 ms of which 2 ms to minimize.
[2024-05-27 15:39:34] [INFO ] Deduced a trap composed of 41 places in 200 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 286/918 variables, and 84 constraints, problems are : Problem set: 0 solved, 1511 unsolved in 30023 ms.
Refiners :[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: 49/49 constraints]
After SMT, in 63982ms problems are : Problem set: 0 solved, 1511 unsolved
Search for dead transitions found 0 dead transitions in 63996ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 65214 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 : [(AND (NOT p0) p1), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 7 factoid took 168 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 155 steps (0 resets) in 8 ms. (17 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 7 factoid took 317 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 62 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 75 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 1308 reset in 437 ms.
Product exploration explored 100000 steps with 1313 reset in 442 ms.
Built C files in :
/tmp/ltsmin12179680504370125152
[2024-05-27 15:39:38] [INFO ] Too many transitions (1521) to apply POR reductions. Disabling POR matrices.
[2024-05-27 15:39:38] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12179680504370125152
Running compilation step : cd /tmp/ltsmin12179680504370125152;'/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/ltsmin12179680504370125152;'/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/ltsmin12179680504370125152;'/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 114 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 97 ms. Remains 286 /286 variables (removed 0) and now considering 1521/1521 (removed 0) transitions.
[2024-05-27 15:39:41] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2024-05-27 15:39:41] [INFO ] Invariant cache hit.
[2024-05-27 15:39:41] [INFO ] Implicit Places using invariants in 181 ms returned []
[2024-05-27 15:39:41] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2024-05-27 15:39:41] [INFO ] Invariant cache hit.
[2024-05-27 15:39:41] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 15:39:42] [INFO ] Implicit Places using invariants and state equation in 856 ms returned []
Implicit Place search using SMT with State Equation took 1038 ms to find 0 implicit places.
[2024-05-27 15:39:42] [INFO ] Redundant transitions in 26 ms returned []
Running 1511 sub problems to find dead transitions.
[2024-05-27 15:39:42] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2024-05-27 15:39:42] [INFO ] Invariant cache hit.
[2024-05-27 15:39:42] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/286 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/286 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
[2024-05-27 15:39:54] [INFO ] Deduced a trap composed of 46 places in 65 ms of which 1 ms to minimize.
[2024-05-27 15:39:54] [INFO ] Deduced a trap composed of 42 places in 68 ms of which 1 ms to minimize.
[2024-05-27 15:40:01] [INFO ] Deduced a trap composed of 30 places in 204 ms of which 2 ms to minimize.
[2024-05-27 15:40:01] [INFO ] Deduced a trap composed of 30 places in 208 ms of which 2 ms to minimize.
[2024-05-27 15:40:01] [INFO ] Deduced a trap composed of 21 places in 204 ms of which 2 ms to minimize.
[2024-05-27 15:40:01] [INFO ] Deduced a trap composed of 30 places in 198 ms of which 2 ms to minimize.
[2024-05-27 15:40:02] [INFO ] Deduced a trap composed of 60 places in 203 ms of which 2 ms to minimize.
[2024-05-27 15:40:02] [INFO ] Deduced a trap composed of 30 places in 200 ms of which 2 ms to minimize.
[2024-05-27 15:40:03] [INFO ] Deduced a trap composed of 49 places in 192 ms of which 2 ms to minimize.
[2024-05-27 15:40:03] [INFO ] Deduced a trap composed of 41 places in 192 ms of which 2 ms to minimize.
[2024-05-27 15:40:03] [INFO ] Deduced a trap composed of 41 places in 192 ms of which 2 ms to minimize.
[2024-05-27 15:40:03] [INFO ] Deduced a trap composed of 65 places in 192 ms of which 2 ms to minimize.
[2024-05-27 15:40:06] [INFO ] Deduced a trap composed of 32 places in 205 ms of which 2 ms to minimize.
[2024-05-27 15:40:06] [INFO ] Deduced a trap composed of 32 places in 191 ms of which 2 ms to minimize.
[2024-05-27 15:40:06] [INFO ] Deduced a trap composed of 32 places in 200 ms of which 2 ms to minimize.
[2024-05-27 15:40:07] [INFO ] Deduced a trap composed of 32 places in 203 ms of which 2 ms to minimize.
[2024-05-27 15:40:07] [INFO ] Deduced a trap composed of 32 places in 219 ms of which 1 ms to minimize.
[2024-05-27 15:40:07] [INFO ] Deduced a trap composed of 90 places in 206 ms of which 2 ms to minimize.
[2024-05-27 15:40:08] [INFO ] Deduced a trap composed of 30 places in 204 ms of which 2 ms to minimize.
[2024-05-27 15:40:08] [INFO ] Deduced a trap composed of 86 places in 208 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 20/55 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 55 constraints, problems are : Problem set: 0 solved, 1511 unsolved in 30026 ms.
Refiners :[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, 14/14 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/286 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
[2024-05-27 15:40:25] [INFO ] Deduced a trap composed of 21 places in 208 ms of which 1 ms to minimize.
[2024-05-27 15:40:25] [INFO ] Deduced a trap composed of 31 places in 198 ms of which 2 ms to minimize.
[2024-05-27 15:40:25] [INFO ] Deduced a trap composed of 30 places in 204 ms of which 2 ms to minimize.
[2024-05-27 15:40:26] [INFO ] Deduced a trap composed of 52 places in 198 ms of which 2 ms to minimize.
[2024-05-27 15:40:27] [INFO ] Deduced a trap composed of 65 places in 196 ms of which 2 ms to minimize.
[2024-05-27 15:40:27] [INFO ] Deduced a trap composed of 49 places in 197 ms of which 2 ms to minimize.
[2024-05-27 15:40:27] [INFO ] Deduced a trap composed of 49 places in 199 ms of which 2 ms to minimize.
[2024-05-27 15:40:27] [INFO ] Deduced a trap composed of 41 places in 190 ms of which 1 ms to minimize.
[2024-05-27 15:40:28] [INFO ] Deduced a trap composed of 49 places in 192 ms of which 2 ms to minimize.
[2024-05-27 15:40:28] [INFO ] Deduced a trap composed of 41 places in 189 ms of which 1 ms to minimize.
[2024-05-27 15:40:28] [INFO ] Deduced a trap composed of 49 places in 203 ms of which 2 ms to minimize.
[2024-05-27 15:40:28] [INFO ] Deduced a trap composed of 49 places in 195 ms of which 1 ms to minimize.
[2024-05-27 15:40:28] [INFO ] Deduced a trap composed of 41 places in 193 ms of which 2 ms to minimize.
[2024-05-27 15:40:29] [INFO ] Deduced a trap composed of 49 places in 188 ms of which 1 ms to minimize.
[2024-05-27 15:40:29] [INFO ] Deduced a trap composed of 49 places in 197 ms of which 1 ms to minimize.
[2024-05-27 15:40:29] [INFO ] Deduced a trap composed of 41 places in 189 ms of which 2 ms to minimize.
[2024-05-27 15:40:29] [INFO ] Deduced a trap composed of 57 places in 190 ms of which 2 ms to minimize.
[2024-05-27 15:40:32] [INFO ] Deduced a trap composed of 42 places in 198 ms of which 2 ms to minimize.
[2024-05-27 15:40:32] [INFO ] Deduced a trap composed of 42 places in 200 ms of which 2 ms to minimize.
[2024-05-27 15:40:32] [INFO ] Deduced a trap composed of 21 places in 202 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
[2024-05-27 15:40:35] [INFO ] Deduced a trap composed of 57 places in 135 ms of which 2 ms to minimize.
[2024-05-27 15:40:35] [INFO ] Deduced a trap composed of 41 places in 132 ms of which 2 ms to minimize.
[2024-05-27 15:40:35] [INFO ] Deduced a trap composed of 41 places in 136 ms of which 1 ms to minimize.
[2024-05-27 15:40:35] [INFO ] Deduced a trap composed of 49 places in 131 ms of which 2 ms to minimize.
[2024-05-27 15:40:35] [INFO ] Deduced a trap composed of 57 places in 131 ms of which 2 ms to minimize.
[2024-05-27 15:40:35] [INFO ] Deduced a trap composed of 49 places in 127 ms of which 1 ms to minimize.
[2024-05-27 15:40:36] [INFO ] Deduced a trap composed of 49 places in 128 ms of which 1 ms to minimize.
[2024-05-27 15:40:43] [INFO ] Deduced a trap composed of 21 places in 191 ms of which 2 ms to minimize.
[2024-05-27 15:40:44] [INFO ] Deduced a trap composed of 41 places in 201 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 286/918 variables, and 84 constraints, problems are : Problem set: 0 solved, 1511 unsolved in 30025 ms.
Refiners :[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: 49/49 constraints]
After SMT, in 64037ms problems are : Problem set: 0 solved, 1511 unsolved
Search for dead transitions found 0 dead transitions in 64052ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 65226 ms. Remains : 286/286 places, 1521/1521 transitions.
Built C files in :
/tmp/ltsmin8863433407554337391
[2024-05-27 15:40:46] [INFO ] Too many transitions (1521) to apply POR reductions. Disabling POR matrices.
[2024-05-27 15:40:46] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8863433407554337391
Running compilation step : cd /tmp/ltsmin8863433407554337391;'/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/ltsmin8863433407554337391;'/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/ltsmin8863433407554337391;'/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 15:40:49] [INFO ] Flatten gal took : 49 ms
[2024-05-27 15:40:49] [INFO ] Flatten gal took : 48 ms
[2024-05-27 15:40:49] [INFO ] Time to serialize gal into /tmp/LTL17043990327054676630.gal : 7 ms
[2024-05-27 15:40:49] [INFO ] Time to serialize properties into /tmp/LTL15178090989726786441.prop : 10 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/LTL17043990327054676630.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15737575644319700301.hoa' '-atoms' '/tmp/LTL15178090989726786441.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...320
Loading property file /tmp/LTL15178090989726786441.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15737575644319700301.hoa
Detected timeout of ITS tools.
[2024-05-27 15:41:04] [INFO ] Flatten gal took : 48 ms
[2024-05-27 15:41:04] [INFO ] Flatten gal took : 50 ms
[2024-05-27 15:41:04] [INFO ] Time to serialize gal into /tmp/LTL15697202488281308994.gal : 10 ms
[2024-05-27 15:41:04] [INFO ] Time to serialize properties into /tmp/LTL7310108298614933247.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/LTL15697202488281308994.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7310108298614933247.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 : !((G(F((!("((ACK>=1)&&(R_tout>=1))"))U((G(!("((ACK>=1)&&(R_tout>=1))")))||("((!((ACK>=1)&&(R_tout>=1)))&&(!((((((((((Cpt2_0>=1)&&(cabl...6323
Formula 0 simplified : FG("((ACK>=1)&&(R_tout>=1))" M !"((!((ACK>=1)&&(R_tout>=1)))&&(!((((((((((Cpt2_0>=1)&&(cable_free>=1))&&((AMC_0>=1)&&(FMCb>=1)))||((...6277
Detected timeout of ITS tools.
[2024-05-27 15:41:19] [INFO ] Flatten gal took : 49 ms
[2024-05-27 15:41:19] [INFO ] Applying decomposition
[2024-05-27 15:41:19] [INFO ] Flatten gal took : 48 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/graph16008752601847500176.txt' '-o' '/tmp/graph16008752601847500176.bin' '-w' '/tmp/graph16008752601847500176.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16008752601847500176.bin' '-l' '-1' '-v' '-w' '/tmp/graph16008752601847500176.weights' '-q' '0' '-e' '0.001'
[2024-05-27 15:41:19] [INFO ] Decomposing Gal with order
[2024-05-27 15:41:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 15:41:20] [INFO ] Removed a total of 2088 redundant transitions.
[2024-05-27 15:41:20] [INFO ] Flatten gal took : 148 ms
[2024-05-27 15:41:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 864 labels/synchronizations in 26 ms.
[2024-05-27 15:41:20] [INFO ] Time to serialize gal into /tmp/LTL9997839713987819522.gal : 7 ms
[2024-05-27 15:41:20] [INFO ] Time to serialize properties into /tmp/LTL12654932201192610744.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/LTL9997839713987819522.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12654932201192610744.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 : !((G(F((!("((i5.u7.ACK>=1)&&(i5.u15.R_tout>=1))"))U((G(!("((i5.u7.ACK>=1)&&(i5.u15.R_tout>=1))")))||("((!((i5.u7.ACK>=1)&&(i5.u15.R_to...8516
Formula 0 simplified : FG("((i5.u7.ACK>=1)&&(i5.u15.R_tout>=1))" M !"((!((i5.u7.ACK>=1)&&(i5.u15.R_tout>=1)))&&(!((((((((((i0.u0.Cpt2_0>=1)&&(i0.u3.cable_f...8457
Detected timeout of ITS tools.
Treatment of property SafeBus-COL-10-LTLFireability-15 finished in 188157 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-COL-10-LTLFireability-00
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 50 out of 306 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 18 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-27 15:41:35] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 306 cols
[2024-05-27 15:41:35] [INFO ] Computed 45 invariants in 6 ms
[2024-05-27 15:41:35] [INFO ] Implicit Places using invariants in 361 ms returned []
[2024-05-27 15:41:35] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 15:41:35] [INFO ] Invariant cache hit.
[2024-05-27 15:41:36] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 15:41:37] [INFO ] Implicit Places using invariants and state equation in 1575 ms returned []
Implicit Place search using SMT with State Equation took 1938 ms to find 0 implicit places.
Running 1521 sub problems to find dead transitions.
[2024-05-27 15:41:37] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 15:41:37] [INFO ] Invariant cache hit.
[2024-05-27 15:41:37] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-27 15:41:50] [INFO ] Deduced a trap composed of 35 places in 209 ms of which 2 ms to minimize.
[2024-05-27 15:41:50] [INFO ] Deduced a trap composed of 59 places in 202 ms of which 2 ms to minimize.
[2024-05-27 15:41:50] [INFO ] Deduced a trap composed of 42 places in 206 ms of which 2 ms to minimize.
[2024-05-27 15:41:50] [INFO ] Deduced a trap composed of 56 places in 133 ms of which 1 ms to minimize.
[2024-05-27 15:41:50] [INFO ] Deduced a trap composed of 40 places in 129 ms of which 1 ms to minimize.
[2024-05-27 15:41:51] [INFO ] Deduced a trap composed of 50 places in 139 ms of which 1 ms to minimize.
[2024-05-27 15:41:51] [INFO ] Deduced a trap composed of 49 places in 124 ms of which 2 ms to minimize.
[2024-05-27 15:41:51] [INFO ] Deduced a trap composed of 48 places in 116 ms of which 1 ms to minimize.
[2024-05-27 15:41:59] [INFO ] Deduced a trap composed of 31 places in 213 ms of which 2 ms to minimize.
[2024-05-27 15:42:00] [INFO ] Deduced a trap composed of 30 places in 207 ms of which 1 ms to minimize.
[2024-05-27 15:42:00] [INFO ] Deduced a trap composed of 30 places in 215 ms of which 2 ms to minimize.
[2024-05-27 15:42:00] [INFO ] Deduced a trap composed of 21 places in 205 ms of which 2 ms to minimize.
[2024-05-27 15:42:00] [INFO ] Deduced a trap composed of 30 places in 206 ms of which 2 ms to minimize.
[2024-05-27 15:42:01] [INFO ] Deduced a trap composed of 30 places in 202 ms of which 1 ms to minimize.
[2024-05-27 15:42:01] [INFO ] Deduced a trap composed of 21 places in 205 ms of which 1 ms to minimize.
[2024-05-27 15:42:01] [INFO ] Deduced a trap composed of 30 places in 200 ms of which 2 ms to minimize.
[2024-05-27 15:42:01] [INFO ] Deduced a trap composed of 30 places in 212 ms of which 2 ms to minimize.
[2024-05-27 15:42:02] [INFO ] Deduced a trap composed of 65 places in 202 ms of which 2 ms to minimize.
[2024-05-27 15:42:02] [INFO ] Deduced a trap composed of 49 places in 204 ms of which 2 ms to minimize.
[2024-05-27 15:42:03] [INFO ] Deduced a trap composed of 49 places in 206 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/948 variables, and 65 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-27 15:42:23] [INFO ] Deduced a trap composed of 65 places in 118 ms of which 2 ms to minimize.
[2024-05-27 15:42:23] [INFO ] Deduced a trap composed of 65 places in 116 ms of which 1 ms to minimize.
[2024-05-27 15:42:23] [INFO ] Deduced a trap composed of 65 places in 116 ms of which 2 ms to minimize.
[2024-05-27 15:42:23] [INFO ] Deduced a trap composed of 57 places in 137 ms of which 1 ms to minimize.
[2024-05-27 15:42:24] [INFO ] Deduced a trap composed of 50 places in 143 ms of which 2 ms to minimize.
[2024-05-27 15:42:24] [INFO ] Deduced a trap composed of 44 places in 134 ms of which 2 ms to minimize.
[2024-05-27 15:42:24] [INFO ] Deduced a trap composed of 65 places in 205 ms of which 2 ms to minimize.
[2024-05-27 15:42:24] [INFO ] Deduced a trap composed of 57 places in 196 ms of which 1 ms to minimize.
[2024-05-27 15:42:27] [INFO ] Deduced a trap composed of 44 places in 212 ms of which 2 ms to minimize.
[2024-05-27 15:42:27] [INFO ] Deduced a trap composed of 41 places in 209 ms of which 2 ms to minimize.
[2024-05-27 15:42:27] [INFO ] Deduced a trap composed of 53 places in 208 ms of which 2 ms to minimize.
[2024-05-27 15:42:27] [INFO ] Deduced a trap composed of 41 places in 212 ms of which 1 ms to minimize.
[2024-05-27 15:42:28] [INFO ] Deduced a trap composed of 40 places in 214 ms of which 2 ms to minimize.
[2024-05-27 15:42:28] [INFO ] Deduced a trap composed of 59 places in 142 ms of which 1 ms to minimize.
[2024-05-27 15:42:28] [INFO ] Deduced a trap composed of 49 places in 130 ms of which 1 ms to minimize.
[2024-05-27 15:42:28] [INFO ] Deduced a trap composed of 49 places in 127 ms of which 1 ms to minimize.
[2024-05-27 15:42:28] [INFO ] Deduced a trap composed of 57 places in 109 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 17/82 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-27 15:42:39] [INFO ] Deduced a trap composed of 49 places in 133 ms of which 2 ms to minimize.
[2024-05-27 15:42:40] [INFO ] Deduced a trap composed of 49 places in 141 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/948 variables, and 84 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 39/39 constraints]
After SMT, in 64309ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 64327ms
Finished structural reductions in LI_LTL mode , in 1 iterations and 66288 ms. Remains : 306/306 places, 1531/1531 transitions.
Running random walk in product with property : SafeBus-COL-10-LTLFireability-00
Product exploration explored 100000 steps with 845 reset in 765 ms.
Product exploration explored 100000 steps with 894 reset in 772 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 121 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 62 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 155 steps (0 resets) in 9 ms. (15 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 219 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 81 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 81 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 136 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-27 15:42:44] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 15:42:44] [INFO ] Invariant cache hit.
[2024-05-27 15:42:44] [INFO ] Implicit Places using invariants in 371 ms returned []
[2024-05-27 15:42:44] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 15:42:44] [INFO ] Invariant cache hit.
[2024-05-27 15:42:44] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 15:42:46] [INFO ] Implicit Places using invariants and state equation in 1622 ms returned []
Implicit Place search using SMT with State Equation took 1995 ms to find 0 implicit places.
[2024-05-27 15:42:46] [INFO ] Redundant transitions in 28 ms returned []
Running 1521 sub problems to find dead transitions.
[2024-05-27 15:42:46] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 15:42:46] [INFO ] Invariant cache hit.
[2024-05-27 15:42:46] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-27 15:42:58] [INFO ] Deduced a trap composed of 35 places in 198 ms of which 2 ms to minimize.
[2024-05-27 15:42:58] [INFO ] Deduced a trap composed of 59 places in 206 ms of which 2 ms to minimize.
[2024-05-27 15:42:59] [INFO ] Deduced a trap composed of 42 places in 207 ms of which 2 ms to minimize.
[2024-05-27 15:42:59] [INFO ] Deduced a trap composed of 56 places in 134 ms of which 1 ms to minimize.
[2024-05-27 15:42:59] [INFO ] Deduced a trap composed of 40 places in 131 ms of which 2 ms to minimize.
[2024-05-27 15:42:59] [INFO ] Deduced a trap composed of 50 places in 141 ms of which 2 ms to minimize.
[2024-05-27 15:42:59] [INFO ] Deduced a trap composed of 49 places in 126 ms of which 1 ms to minimize.
[2024-05-27 15:42:59] [INFO ] Deduced a trap composed of 48 places in 118 ms of which 1 ms to minimize.
[2024-05-27 15:43:08] [INFO ] Deduced a trap composed of 31 places in 215 ms of which 1 ms to minimize.
[2024-05-27 15:43:08] [INFO ] Deduced a trap composed of 30 places in 210 ms of which 2 ms to minimize.
[2024-05-27 15:43:08] [INFO ] Deduced a trap composed of 30 places in 205 ms of which 2 ms to minimize.
[2024-05-27 15:43:09] [INFO ] Deduced a trap composed of 21 places in 211 ms of which 1 ms to minimize.
[2024-05-27 15:43:09] [INFO ] Deduced a trap composed of 30 places in 204 ms of which 2 ms to minimize.
[2024-05-27 15:43:09] [INFO ] Deduced a trap composed of 30 places in 210 ms of which 1 ms to minimize.
[2024-05-27 15:43:09] [INFO ] Deduced a trap composed of 21 places in 207 ms of which 2 ms to minimize.
[2024-05-27 15:43:09] [INFO ] Deduced a trap composed of 30 places in 203 ms of which 1 ms to minimize.
[2024-05-27 15:43:10] [INFO ] Deduced a trap composed of 30 places in 208 ms of which 2 ms to minimize.
[2024-05-27 15:43:11] [INFO ] Deduced a trap composed of 65 places in 204 ms of which 2 ms to minimize.
[2024-05-27 15:43:11] [INFO ] Deduced a trap composed of 49 places in 212 ms of which 2 ms to minimize.
[2024-05-27 15:43:11] [INFO ] Deduced a trap composed of 49 places in 211 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 timeout
1.0)
(s120 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/948 variables, and 65 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-27 15:43:31] [INFO ] Deduced a trap composed of 65 places in 118 ms of which 2 ms to minimize.
[2024-05-27 15:43:31] [INFO ] Deduced a trap composed of 65 places in 138 ms of which 2 ms to minimize.
[2024-05-27 15:43:31] [INFO ] Deduced a trap composed of 65 places in 137 ms of which 2 ms to minimize.
[2024-05-27 15:43:32] [INFO ] Deduced a trap composed of 57 places in 151 ms of which 1 ms to minimize.
[2024-05-27 15:43:32] [INFO ] Deduced a trap composed of 50 places in 156 ms of which 1 ms to minimize.
[2024-05-27 15:43:32] [INFO ] Deduced a trap composed of 44 places in 141 ms of which 1 ms to minimize.
[2024-05-27 15:43:32] [INFO ] Deduced a trap composed of 65 places in 205 ms of which 1 ms to minimize.
[2024-05-27 15:43:32] [INFO ] Deduced a trap composed of 57 places in 227 ms of which 2 ms to minimize.
[2024-05-27 15:43:35] [INFO ] Deduced a trap composed of 44 places in 211 ms of which 2 ms to minimize.
[2024-05-27 15:43:35] [INFO ] Deduced a trap composed of 41 places in 204 ms of which 1 ms to minimize.
[2024-05-27 15:43:35] [INFO ] Deduced a trap composed of 53 places in 209 ms of which 2 ms to minimize.
[2024-05-27 15:43:36] [INFO ] Deduced a trap composed of 41 places in 205 ms of which 2 ms to minimize.
[2024-05-27 15:43:36] [INFO ] Deduced a trap composed of 40 places in 216 ms of which 2 ms to minimize.
[2024-05-27 15:43:36] [INFO ] Deduced a trap composed of 59 places in 159 ms of which 1 ms to minimize.
[2024-05-27 15:43:36] [INFO ] Deduced a trap composed of 49 places in 138 ms of which 2 ms to minimize.
[2024-05-27 15:43:37] [INFO ] Deduced a trap composed of 49 places in 126 ms of which 1 ms to minimize.
[2024-05-27 15:43:37] [INFO ] Deduced a trap composed of 57 places in 105 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 17/82 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-27 15:43:49] [INFO ] Deduced a trap composed of 49 places in 129 ms of which 2 ms to minimize.
[2024-05-27 15:43:49] [INFO ] Deduced a trap composed of 49 places in 141 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/948 variables, and 84 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 39/39 constraints]
After SMT, in 64117ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 64132ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 66299 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 153 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 70 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 243 steps (0 resets) in 8 ms. (27 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 189 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 76 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 826 reset in 778 ms.
Product exploration explored 100000 steps with 841 reset in 787 ms.
Built C files in :
/tmp/ltsmin15549942779721330127
[2024-05-27 15:43:52] [INFO ] Too many transitions (1531) to apply POR reductions. Disabling POR matrices.
[2024-05-27 15:43:52] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15549942779721330127
Running compilation step : cd /tmp/ltsmin15549942779721330127;'/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/ltsmin15549942779721330127;'/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/ltsmin15549942779721330127;'/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 110 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-27 15:43:55] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 15:43:55] [INFO ] Invariant cache hit.
[2024-05-27 15:43:55] [INFO ] Implicit Places using invariants in 367 ms returned []
[2024-05-27 15:43:55] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 15:43:55] [INFO ] Invariant cache hit.
[2024-05-27 15:43:56] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 15:43:57] [INFO ] Implicit Places using invariants and state equation in 1555 ms returned []
Implicit Place search using SMT with State Equation took 1926 ms to find 0 implicit places.
[2024-05-27 15:43:57] [INFO ] Redundant transitions in 26 ms returned []
Running 1521 sub problems to find dead transitions.
[2024-05-27 15:43:57] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 15:43:57] [INFO ] Invariant cache hit.
[2024-05-27 15:43:57] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-27 15:44:09] [INFO ] Deduced a trap composed of 35 places in 206 ms of which 1 ms to minimize.
[2024-05-27 15:44:09] [INFO ] Deduced a trap composed of 59 places in 214 ms of which 2 ms to minimize.
[2024-05-27 15:44:09] [INFO ] Deduced a trap composed of 42 places in 500 ms of which 2 ms to minimize.
[2024-05-27 15:44:10] [INFO ] Deduced a trap composed of 56 places in 142 ms of which 2 ms to minimize.
[2024-05-27 15:44:10] [INFO ] Deduced a trap composed of 40 places in 127 ms of which 1 ms to minimize.
[2024-05-27 15:44:10] [INFO ] Deduced a trap composed of 50 places in 133 ms of which 2 ms to minimize.
[2024-05-27 15:44:10] [INFO ] Deduced a trap composed of 49 places in 132 ms of which 1 ms to minimize.
[2024-05-27 15:44:10] [INFO ] Deduced a trap composed of 48 places in 117 ms of which 1 ms to minimize.
[2024-05-27 15:44:19] [INFO ] Deduced a trap composed of 31 places in 205 ms of which 1 ms to minimize.
[2024-05-27 15:44:19] [INFO ] Deduced a trap composed of 30 places in 200 ms of which 2 ms to minimize.
[2024-05-27 15:44:19] [INFO ] Deduced a trap composed of 30 places in 223 ms of which 2 ms to minimize.
[2024-05-27 15:44:19] [INFO ] Deduced a trap composed of 21 places in 225 ms of which 2 ms to minimize.
[2024-05-27 15:44:20] [INFO ] Deduced a trap composed of 30 places in 232 ms of which 2 ms to minimize.
[2024-05-27 15:44:20] [INFO ] Deduced a trap composed of 30 places in 226 ms of which 2 ms to minimize.
[2024-05-27 15:44:20] [INFO ] Deduced a trap composed of 21 places in 231 ms of which 2 ms to minimize.
[2024-05-27 15:44:20] [INFO ] Deduced a trap composed of 30 places in 226 ms of which 2 ms to minimize.
[2024-05-27 15:44:21] [INFO ] Deduced a trap composed of 30 places in 228 ms of which 2 ms to minimize.
[2024-05-27 15:44:21] [INFO ] Deduced a trap composed of 65 places in 211 ms of which 2 ms to minimize.
[2024-05-27 15:44:22] [INFO ] Deduced a trap composed of 49 places in 211 ms of which 2 ms to minimize.
[2024-05-27 15:44:22] [INFO ] Deduced a trap composed of 49 places in 210 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/948 variables, and 65 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-27 15:44:42] [INFO ] Deduced a trap composed of 65 places in 124 ms of which 2 ms to minimize.
[2024-05-27 15:44:42] [INFO ] Deduced a trap composed of 65 places in 121 ms of which 2 ms to minimize.
[2024-05-27 15:44:42] [INFO ] Deduced a trap composed of 65 places in 123 ms of which 2 ms to minimize.
[2024-05-27 15:44:42] [INFO ] Deduced a trap composed of 57 places in 143 ms of which 2 ms to minimize.
[2024-05-27 15:44:43] [INFO ] Deduced a trap composed of 50 places in 146 ms of which 2 ms to minimize.
[2024-05-27 15:44:43] [INFO ] Deduced a trap composed of 44 places in 138 ms of which 2 ms to minimize.
[2024-05-27 15:44:43] [INFO ] Deduced a trap composed of 65 places in 208 ms of which 2 ms to minimize.
[2024-05-27 15:44:43] [INFO ] Deduced a trap composed of 57 places in 210 ms of which 2 ms to minimize.
[2024-05-27 15:44:46] [INFO ] Deduced a trap composed of 44 places in 215 ms of which 2 ms to minimize.
[2024-05-27 15:44:46] [INFO ] Deduced a trap composed of 41 places in 211 ms of which 2 ms to minimize.
[2024-05-27 15:44:46] [INFO ] Deduced a trap composed of 53 places in 214 ms of which 2 ms to minimize.
[2024-05-27 15:44:47] [INFO ] Deduced a trap composed of 41 places in 210 ms of which 2 ms to minimize.
[2024-05-27 15:44:47] [INFO ] Deduced a trap composed of 40 places in 210 ms of which 2 ms to minimize.
[2024-05-27 15:44:47] [INFO ] Deduced a trap composed of 59 places in 156 ms of which 2 ms to minimize.
[2024-05-27 15:44:47] [INFO ] Deduced a trap composed of 49 places in 145 ms of which 1 ms to minimize.
[2024-05-27 15:44:48] [INFO ] Deduced a trap composed of 49 places in 135 ms of which 2 ms to minimize.
[2024-05-27 15:44:48] [INFO ] Deduced a trap composed of 57 places in 116 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 17/82 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-27 15:44:59] [INFO ] Deduced a trap composed of 49 places in 138 ms of which 2 ms to minimize.
[2024-05-27 15:44:59] [INFO ] Deduced a trap composed of 49 places in 136 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/948 variables, and 84 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 39/39 constraints]
After SMT, in 63630ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 63645ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 65718 ms. Remains : 306/306 places, 1531/1531 transitions.
Built C files in :
/tmp/ltsmin10649030710994187044
[2024-05-27 15:45:01] [INFO ] Too many transitions (1531) to apply POR reductions. Disabling POR matrices.
[2024-05-27 15:45:01] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10649030710994187044
Running compilation step : cd /tmp/ltsmin10649030710994187044;'/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/ltsmin10649030710994187044;'/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/ltsmin10649030710994187044;'/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 15:45:04] [INFO ] Flatten gal took : 59 ms
[2024-05-27 15:45:04] [INFO ] Flatten gal took : 59 ms
[2024-05-27 15:45:04] [INFO ] Time to serialize gal into /tmp/LTL1772940937840785344.gal : 9 ms
[2024-05-27 15:45:04] [INFO ] Time to serialize properties into /tmp/LTL7420948244633964492.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/LTL1772940937840785344.gal' '-t' 'CGAL' '-hoa' '/tmp/aut769367707231427175.hoa' '-atoms' '/tmp/LTL7420948244633964492.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...316
Loading property file /tmp/LTL7420948244633964492.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut769367707231427175.hoa
Detected timeout of ITS tools.
[2024-05-27 15:45:19] [INFO ] Flatten gal took : 53 ms
[2024-05-27 15:45:19] [INFO ] Flatten gal took : 52 ms
[2024-05-27 15:45:19] [INFO ] Time to serialize gal into /tmp/LTL5115352805202724901.gal : 8 ms
[2024-05-27 15:45:19] [INFO ] Time to serialize properties into /tmp/LTL838924641440392543.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/LTL5115352805202724901.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL838924641440392543.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...274
Read 1 LTL properties
Checking formula 0 : !((X(G((F("((((((wait_cable_5<1)||(PMC_5<1))&&((wait_cable_6<1)||(PMC_6<1)))&&(((wait_cable_7<1)||(PMC_7<1))&&((wait_cable_8<1)||(PMC_...3797
Formula 0 simplified : XF(!"(((((((((wait_cable_0<1)||(RMC_0<1))&&((wait_cable_4<1)||(RMC_4<1)))&&(((wait_cable_8<1)||(RMC_8<1))&&((wait_cable_1<1)||(RMC_1...3789
Detected timeout of ITS tools.
[2024-05-27 15:45:34] [INFO ] Flatten gal took : 49 ms
[2024-05-27 15:45:34] [INFO ] Applying decomposition
[2024-05-27 15:45:34] [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/graph13571469433221552519.txt' '-o' '/tmp/graph13571469433221552519.bin' '-w' '/tmp/graph13571469433221552519.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13571469433221552519.bin' '-l' '-1' '-v' '-w' '/tmp/graph13571469433221552519.weights' '-q' '0' '-e' '0.001'
[2024-05-27 15:45:34] [INFO ] Decomposing Gal with order
[2024-05-27 15:45:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 15:45:35] [INFO ] Removed a total of 3775 redundant transitions.
[2024-05-27 15:45:35] [INFO ] Flatten gal took : 132 ms
[2024-05-27 15:45:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 730 labels/synchronizations in 25 ms.
[2024-05-27 15:45:35] [INFO ] Time to serialize gal into /tmp/LTL2006239851819244398.gal : 7 ms
[2024-05-27 15:45:35] [INFO ] Time to serialize properties into /tmp/LTL17187075308683438227.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/LTL2006239851819244398.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17187075308683438227.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("((((((i2.i1.u18.wait_cable_5<1)||(i2.i1.u18.PMC_5<1))&&((i2.i1.u18.wait_cable_6<1)||(i2.i1.u18.PMC_6<1)))&&(((i2.i1.u18.wai...5964
Formula 0 simplified : XF(!"(((((((((i2.i0.u20.wait_cable_0<1)||(i3.i0.u13.RMC_0<1))&&((i2.i1.u18.wait_cable_4<1)||(u14.RMC_4<1)))&&(((i2.i0.u11.wait_cable...5956
Detected timeout of ITS tools.
Treatment of property SafeBus-COL-10-LTLFireability-00 finished in 254989 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(!p0)))'
Found a Shortening insensitive property : SafeBus-COL-10-LTLFireability-10
Stuttering acceptance computed with spot in 76 ms :[p0, p0]
Support contains 121 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 10 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-27 15:45:50] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 15:45:50] [INFO ] Invariant cache hit.
[2024-05-27 15:45:50] [INFO ] Implicit Places using invariants in 175 ms returned [231, 232, 233, 234, 235, 236, 237, 238, 239, 240]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 178 ms to find 10 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 296/306 places, 1531/1531 transitions.
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 0 place count 296 transition count 1521
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 286 transition count 1521
Applied a total of 20 rules in 17 ms. Remains 286 /296 variables (removed 10) and now considering 1521/1531 (removed 10) transitions.
[2024-05-27 15:45:50] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
// Phase 1: matrix 632 rows 286 cols
[2024-05-27 15:45:50] [INFO ] Computed 35 invariants in 6 ms
[2024-05-27 15:45:50] [INFO ] Implicit Places using invariants in 152 ms returned []
[2024-05-27 15:45:50] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2024-05-27 15:45:50] [INFO ] Invariant cache hit.
[2024-05-27 15:45:50] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 15:45:51] [INFO ] Implicit Places using invariants and state equation in 742 ms returned []
Implicit Place search using SMT with State Equation took 907 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 286/306 places, 1521/1531 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1112 ms. Remains : 286/306 places, 1521/1531 transitions.
Running random walk in product with property : SafeBus-COL-10-LTLFireability-10
Product exploration explored 100000 steps with 13049 reset in 3445 ms.
Product exploration explored 100000 steps with 13013 reset in 3450 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[p0, p0]
RANDOM walk for 25 steps (0 resets) in 6 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[p0, p0]
Stuttering acceptance computed with spot in 75 ms :[p0, p0]
[2024-05-27 15:45:58] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2024-05-27 15:45:59] [INFO ] Invariant cache hit.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:828)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:584)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:619)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:581)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:252)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:960)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-27 15:46:17] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression EG p0
Could not prove EG p0
Support contains 121 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 108 ms. Remains 286 /286 variables (removed 0) and now considering 1521/1521 (removed 0) transitions.
[2024-05-27 15:46:17] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2024-05-27 15:46:17] [INFO ] Invariant cache hit.
[2024-05-27 15:46:17] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-05-27 15:46:17] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2024-05-27 15:46:17] [INFO ] Invariant cache hit.
[2024-05-27 15:46:17] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 15:46:18] [INFO ] Implicit Places using invariants and state equation in 815 ms returned []
Implicit Place search using SMT with State Equation took 952 ms to find 0 implicit places.
[2024-05-27 15:46:18] [INFO ] Redundant transitions in 21 ms returned []
Running 1511 sub problems to find dead transitions.
[2024-05-27 15:46:18] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2024-05-27 15:46:18] [INFO ] Invariant cache hit.
[2024-05-27 15:46:18] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/286 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/286 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
[2024-05-27 15:46:29] [INFO ] Deduced a trap composed of 46 places in 81 ms of which 1 ms to minimize.
[2024-05-27 15:46:29] [INFO ] Deduced a trap composed of 42 places in 77 ms of which 2 ms to minimize.
[2024-05-27 15:46:36] [INFO ] Deduced a trap composed of 30 places in 231 ms of which 2 ms to minimize.
[2024-05-27 15:46:36] [INFO ] Deduced a trap composed of 30 places in 229 ms of which 2 ms to minimize.
[2024-05-27 15:46:37] [INFO ] Deduced a trap composed of 21 places in 206 ms of which 2 ms to minimize.
[2024-05-27 15:46:37] [INFO ] Deduced a trap composed of 30 places in 226 ms of which 2 ms to minimize.
[2024-05-27 15:46:37] [INFO ] Deduced a trap composed of 60 places in 230 ms of which 2 ms to minimize.
[2024-05-27 15:46:37] [INFO ] Deduced a trap composed of 30 places in 212 ms of which 2 ms to minimize.
[2024-05-27 15:46:38] [INFO ] Deduced a trap composed of 49 places in 193 ms of which 2 ms to minimize.
[2024-05-27 15:46:39] [INFO ] Deduced a trap composed of 41 places in 191 ms of which 1 ms to minimize.
[2024-05-27 15:46:39] [INFO ] Deduced a trap composed of 41 places in 208 ms of which 2 ms to minimize.
[2024-05-27 15:46:39] [INFO ] Deduced a trap composed of 65 places in 203 ms of which 2 ms to minimize.
[2024-05-27 15:46:42] [INFO ] Deduced a trap composed of 32 places in 202 ms of which 1 ms to minimize.
[2024-05-27 15:46:42] [INFO ] Deduced a trap composed of 32 places in 202 ms of which 1 ms to minimize.
[2024-05-27 15:46:42] [INFO ] Deduced a trap composed of 32 places in 198 ms of which 2 ms to minimize.
[2024-05-27 15:46:42] [INFO ] Deduced a trap composed of 32 places in 205 ms of which 2 ms to minimize.
[2024-05-27 15:46:42] [INFO ] Deduced a trap composed of 32 places in 199 ms of which 2 ms to minimize.
[2024-05-27 15:46:43] [INFO ] Deduced a trap composed of 90 places in 221 ms of which 2 ms to minimize.
[2024-05-27 15:46:43] [INFO ] Deduced a trap composed of 30 places in 207 ms of which 1 ms to minimize.
[2024-05-27 15:46:43] [INFO ] Deduced a trap composed of 86 places in 200 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
[2024-05-27 15:46:52] [INFO ] Deduced a trap composed of 31 places in 207 ms of which 2 ms to minimize.
[2024-05-27 15:46:52] [INFO ] Deduced a trap composed of 21 places in 228 ms of which 5 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 (/ 3.0 10.0))
(s45 0.0)
(s46 (/ 7.0 10.0))
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 (/ 1.0 5.0))
(s54 0.0)
(s55 (/ 4.0 5.0))
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 (/ 4.0 5.0))
(s63 0.0)
(s64 (/ 1.0 5.0))
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 (/ 1.0 5.0))
(s77 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 286/918 variables, and 57 constraints, problems are : Problem set: 0 solved, 1511 unsolved in 30028 ms.
Refiners :[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: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1511 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/286 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/286 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 22/57 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
[2024-05-27 15:47:01] [INFO ] Deduced a trap composed of 31 places in 205 ms of which 2 ms to minimize.
[2024-05-27 15:47:02] [INFO ] Deduced a trap composed of 30 places in 201 ms of which 1 ms to minimize.
[2024-05-27 15:47:03] [INFO ] Deduced a trap composed of 58 places in 197 ms of which 2 ms to minimize.
[2024-05-27 15:47:03] [INFO ] Deduced a trap composed of 41 places in 193 ms of which 2 ms to minimize.
[2024-05-27 15:47:03] [INFO ] Deduced a trap composed of 49 places in 196 ms of which 2 ms to minimize.
[2024-05-27 15:47:03] [INFO ] Deduced a trap composed of 57 places in 190 ms of which 1 ms to minimize.
[2024-05-27 15:47:04] [INFO ] Deduced a trap composed of 49 places in 188 ms of which 2 ms to minimize.
[2024-05-27 15:47:04] [INFO ] Deduced a trap composed of 41 places in 197 ms of which 2 ms to minimize.
[2024-05-27 15:47:04] [INFO ] Deduced a trap composed of 41 places in 199 ms of which 1 ms to minimize.
[2024-05-27 15:47:04] [INFO ] Deduced a trap composed of 57 places in 198 ms of which 2 ms to minimize.
[2024-05-27 15:47:07] [INFO ] Deduced a trap composed of 30 places in 203 ms of which 2 ms to minimize.
[2024-05-27 15:47:07] [INFO ] Deduced a trap composed of 44 places in 186 ms of which 2 ms to minimize.
[2024-05-27 15:47:08] [INFO ] Deduced a trap composed of 29 places in 206 ms of which 2 ms to minimize.
[2024-05-27 15:47:08] [INFO ] Deduced a trap composed of 30 places in 197 ms of which 2 ms to minimize.
[2024-05-27 15:47:08] [INFO ] Deduced a trap composed of 87 places in 184 ms of which 2 ms to minimize.
[2024-05-27 15:47:09] [INFO ] Deduced a trap composed of 40 places in 118 ms of which 1 ms to minimize.
[2024-05-27 15:47:09] [INFO ] Deduced a trap composed of 41 places in 96 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 17/74 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
[2024-05-27 15:47:19] [INFO ] Deduced a trap composed of 41 places in 202 ms of which 2 ms to minimize.
[2024-05-27 15:47:19] [INFO ] Deduced a trap composed of 49 places in 199 ms of which 2 ms to minimize.
[2024-05-27 15:47:19] [INFO ] Deduced a trap composed of 49 places in 202 ms of which 2 ms to minimize.
[2024-05-27 15:47:19] [INFO ] Deduced a trap composed of 41 places in 204 ms of which 1 ms to minimize.
[2024-05-27 15:47:22] [INFO ] Deduced a trap composed of 43 places in 203 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 286/918 variables, and 79 constraints, problems are : Problem set: 0 solved, 1511 unsolved in 30023 ms.
Refiners :[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: 44/44 constraints]
After SMT, in 64180ms problems are : Problem set: 0 solved, 1511 unsolved
Search for dead transitions found 0 dead transitions in 64194ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 65283 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[p0, p0]
RANDOM walk for 28 steps (0 resets) in 6 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[p0, p0]
Stuttering acceptance computed with spot in 57 ms :[p0, p0]
[2024-05-27 15:47:23] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2024-05-27 15:47:23] [INFO ] Invariant cache hit.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:828)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:584)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:619)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:581)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:262)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:960)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-27 15:47:42] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression EG p0
Could not prove EG p0
Stuttering acceptance computed with spot in 65 ms :[p0, p0]
Product exploration explored 100000 steps with 13059 reset in 4458 ms.
Product exploration explored 100000 steps with 12999 reset in 4484 ms.
Built C files in :
/tmp/ltsmin10008852579220830572
[2024-05-27 15:47:51] [INFO ] Too many transitions (1521) to apply POR reductions. Disabling POR matrices.
[2024-05-27 15:47:51] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10008852579220830572
Running compilation step : cd /tmp/ltsmin10008852579220830572;'/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/ltsmin10008852579220830572;'/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/ltsmin10008852579220830572;'/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 121 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 111 ms. Remains 286 /286 variables (removed 0) and now considering 1521/1521 (removed 0) transitions.
[2024-05-27 15:47:54] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2024-05-27 15:47:54] [INFO ] Invariant cache hit.
[2024-05-27 15:47:54] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-05-27 15:47:54] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2024-05-27 15:47:54] [INFO ] Invariant cache hit.
[2024-05-27 15:47:54] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 15:47:55] [INFO ] Implicit Places using invariants and state equation in 666 ms returned []
Implicit Place search using SMT with State Equation took 803 ms to find 0 implicit places.
[2024-05-27 15:47:55] [INFO ] Redundant transitions in 24 ms returned []
Running 1511 sub problems to find dead transitions.
[2024-05-27 15:47:55] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2024-05-27 15:47:55] [INFO ] Invariant cache hit.
[2024-05-27 15:47:55] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/286 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/286 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
[2024-05-27 15:48:06] [INFO ] Deduced a trap composed of 46 places in 70 ms of which 1 ms to minimize.
[2024-05-27 15:48:06] [INFO ] Deduced a trap composed of 42 places in 64 ms of which 1 ms to minimize.
[2024-05-27 15:48:14] [INFO ] Deduced a trap composed of 30 places in 226 ms of which 2 ms to minimize.
[2024-05-27 15:48:14] [INFO ] Deduced a trap composed of 30 places in 218 ms of which 2 ms to minimize.
[2024-05-27 15:48:15] [INFO ] Deduced a trap composed of 21 places in 216 ms of which 2 ms to minimize.
[2024-05-27 15:48:15] [INFO ] Deduced a trap composed of 30 places in 226 ms of which 2 ms to minimize.
[2024-05-27 15:48:15] [INFO ] Deduced a trap composed of 60 places in 202 ms of which 2 ms to minimize.
[2024-05-27 15:48:15] [INFO ] Deduced a trap composed of 30 places in 227 ms of which 2 ms to minimize.
[2024-05-27 15:48:16] [INFO ] Deduced a trap composed of 49 places in 200 ms of which 2 ms to minimize.
[2024-05-27 15:48:16] [INFO ] Deduced a trap composed of 41 places in 188 ms of which 2 ms to minimize.
[2024-05-27 15:48:17] [INFO ] Deduced a trap composed of 41 places in 197 ms of which 2 ms to minimize.
[2024-05-27 15:48:17] [INFO ] Deduced a trap composed of 65 places in 230 ms of which 2 ms to minimize.
[2024-05-27 15:48:19] [INFO ] Deduced a trap composed of 32 places in 222 ms of which 2 ms to minimize.
[2024-05-27 15:48:20] [INFO ] Deduced a trap composed of 32 places in 214 ms of which 2 ms to minimize.
[2024-05-27 15:48:20] [INFO ] Deduced a trap composed of 32 places in 212 ms of which 2 ms to minimize.
[2024-05-27 15:48:20] [INFO ] Deduced a trap composed of 32 places in 210 ms of which 2 ms to minimize.
[2024-05-27 15:48:20] [INFO ] Deduced a trap composed of 32 places in 216 ms of which 2 ms to minimize.
[2024-05-27 15:48:21] [INFO ] Deduced a trap composed of 90 places in 229 ms of which 2 ms to minimize.
[2024-05-27 15:48:21] [INFO ] Deduced a trap composed of 30 places in 225 ms of which 2 ms to minimize.
[2024-05-27 15:48:21] [INFO ] Deduced a trap composed of 86 places in 221 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 20/55 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 55 constraints, problems are : Problem set: 0 solved, 1511 unsolved in 30021 ms.
Refiners :[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, 14/14 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/286 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
[2024-05-27 15:48:38] [INFO ] Deduced a trap composed of 21 places in 205 ms of which 2 ms to minimize.
[2024-05-27 15:48:38] [INFO ] Deduced a trap composed of 31 places in 227 ms of which 2 ms to minimize.
[2024-05-27 15:48:38] [INFO ] Deduced a trap composed of 30 places in 204 ms of which 1 ms to minimize.
[2024-05-27 15:48:38] [INFO ] Deduced a trap composed of 52 places in 225 ms of which 2 ms to minimize.
[2024-05-27 15:48:40] [INFO ] Deduced a trap composed of 65 places in 215 ms of which 2 ms to minimize.
[2024-05-27 15:48:40] [INFO ] Deduced a trap composed of 49 places in 217 ms of which 2 ms to minimize.
[2024-05-27 15:48:40] [INFO ] Deduced a trap composed of 49 places in 216 ms of which 2 ms to minimize.
[2024-05-27 15:48:40] [INFO ] Deduced a trap composed of 41 places in 215 ms of which 2 ms to minimize.
[2024-05-27 15:48:40] [INFO ] Deduced a trap composed of 49 places in 195 ms of which 2 ms to minimize.
[2024-05-27 15:48:41] [INFO ] Deduced a trap composed of 41 places in 214 ms of which 2 ms to minimize.
[2024-05-27 15:48:41] [INFO ] Deduced a trap composed of 49 places in 189 ms of which 2 ms to minimize.
[2024-05-27 15:48:41] [INFO ] Deduced a trap composed of 49 places in 215 ms of which 2 ms to minimize.
[2024-05-27 15:48:41] [INFO ] Deduced a trap composed of 41 places in 213 ms of which 2 ms to minimize.
[2024-05-27 15:48:42] [INFO ] Deduced a trap composed of 49 places in 205 ms of which 2 ms to minimize.
[2024-05-27 15:48:42] [INFO ] Deduced a trap composed of 49 places in 212 ms of which 2 ms to minimize.
[2024-05-27 15:48:42] [INFO ] Deduced a trap composed of 41 places in 209 ms of which 2 ms to minimize.
[2024-05-27 15:48:42] [INFO ] Deduced a trap composed of 57 places in 210 ms of which 2 ms to minimize.
[2024-05-27 15:48:45] [INFO ] Deduced a trap composed of 42 places in 221 ms of which 2 ms to minimize.
[2024-05-27 15:48:45] [INFO ] Deduced a trap composed of 42 places in 216 ms of which 2 ms to minimize.
[2024-05-27 15:48:45] [INFO ] Deduced a trap composed of 21 places in 219 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
[2024-05-27 15:48:48] [INFO ] Deduced a trap composed of 57 places in 146 ms of which 1 ms to minimize.
[2024-05-27 15:48:48] [INFO ] Deduced a trap composed of 41 places in 143 ms of which 1 ms to minimize.
[2024-05-27 15:48:48] [INFO ] Deduced a trap composed of 41 places in 137 ms of which 2 ms to minimize.
[2024-05-27 15:48:48] [INFO ] Deduced a trap composed of 49 places in 145 ms of which 2 ms to minimize.
[2024-05-27 15:48:48] [INFO ] Deduced a trap composed of 57 places in 143 ms of which 1 ms to minimize.
[2024-05-27 15:48:48] [INFO ] Deduced a trap composed of 49 places in 133 ms of which 1 ms to minimize.
[2024-05-27 15:48:49] [INFO ] Deduced a trap composed of 49 places in 147 ms of which 2 ms to minimize.
[2024-05-27 15:48:55] [INFO ] Deduced a trap composed of 21 places in 200 ms of which 2 ms to minimize.
[2024-05-27 15:48:56] [INFO ] Deduced a trap composed of 41 places in 203 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 1)
(s10 0)
(s11 1)
(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 1)
(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 1)
(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 1)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 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 84 constraints, problems are : Problem set: 0 solved, 1511 unsolved in 30028 ms.
Refiners :[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: 49/49 constraints]
After SMT, in 63750ms problems are : Problem set: 0 solved, 1511 unsolved
Search for dead transitions found 0 dead transitions in 63766ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 64713 ms. Remains : 286/286 places, 1521/1521 transitions.
Built C files in :
/tmp/ltsmin10421399993670081202
[2024-05-27 15:48:58] [INFO ] Too many transitions (1521) to apply POR reductions. Disabling POR matrices.
[2024-05-27 15:48:58] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10421399993670081202
Running compilation step : cd /tmp/ltsmin10421399993670081202;'/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/ltsmin10421399993670081202;'/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/ltsmin10421399993670081202;'/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 15:49:02] [INFO ] Flatten gal took : 52 ms
[2024-05-27 15:49:02] [INFO ] Flatten gal took : 53 ms
[2024-05-27 15:49:02] [INFO ] Time to serialize gal into /tmp/LTL78211741661166321.gal : 7 ms
[2024-05-27 15:49:02] [INFO ] Time to serialize properties into /tmp/LTL13794549672935083987.prop : 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/LTL78211741661166321.gal' '-t' 'CGAL' '-hoa' '/tmp/aut422941188098128301.hoa' '-atoms' '/tmp/LTL13794549672935083987.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...315
Loading property file /tmp/LTL13794549672935083987.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut422941188098128301.hoa
Detected timeout of ITS tools.
[2024-05-27 15:49:17] [INFO ] Flatten gal took : 59 ms
[2024-05-27 15:49:17] [INFO ] Flatten gal took : 59 ms
[2024-05-27 15:49:17] [INFO ] Time to serialize gal into /tmp/LTL17545367627080857895.gal : 7 ms
[2024-05-27 15:49:17] [INFO ] Time to serialize properties into /tmp/LTL16843870256635901481.ltl : 5 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/LTL17545367627080857895.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16843870256635901481.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 : !((X(F("(((((((((((((Cpt2_8>=1)&&(cable_used_9>=1))&&((AMC_28>=1)&&(FMCb>=1)))||(((Cpt2_8>=1)&&(cable_used_5>=1))&&((AMC_98>=1)&&(FMCb...63930
Formula 0 simplified : XG!"(((((((((((((Cpt2_8>=1)&&(cable_used_9>=1))&&((AMC_28>=1)&&(FMCb>=1)))||(((Cpt2_8>=1)&&(cable_used_5>=1))&&((AMC_98>=1)&&(FMCb>=...63924
Detected timeout of ITS tools.
[2024-05-27 15:49:32] [INFO ] Flatten gal took : 62 ms
[2024-05-27 15:49:32] [INFO ] Applying decomposition
[2024-05-27 15:49:32] [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/graph15634594931637443667.txt' '-o' '/tmp/graph15634594931637443667.bin' '-w' '/tmp/graph15634594931637443667.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15634594931637443667.bin' '-l' '-1' '-v' '-w' '/tmp/graph15634594931637443667.weights' '-q' '0' '-e' '0.001'
[2024-05-27 15:49:32] [INFO ] Decomposing Gal with order
[2024-05-27 15:49:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 15:49:32] [INFO ] Removed a total of 3013 redundant transitions.
[2024-05-27 15:49:32] [INFO ] Flatten gal took : 154 ms
[2024-05-27 15:49:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 545 labels/synchronizations in 15 ms.
[2024-05-27 15:49:32] [INFO ] Time to serialize gal into /tmp/LTL7856590000607905140.gal : 5 ms
[2024-05-27 15:49:32] [INFO ] Time to serialize properties into /tmp/LTL1168847370700210761.ltl : 6 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/LTL7856590000607905140.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1168847370700210761.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(F("(((((((((((((i4.u4.Cpt2_8>=1)&&(i4.u16.cable_used_9>=1))&&((i4.u0.AMC_28>=1)&&(i4.u16.FMCb>=1)))||(((i4.u4.Cpt2_8>=1)&&(i4.u16...87650
Formula 0 simplified : XG!"(((((((((((((i4.u4.Cpt2_8>=1)&&(i4.u16.cable_used_9>=1))&&((i4.u0.AMC_28>=1)&&(i4.u16.FMCb>=1)))||(((i4.u4.Cpt2_8>=1)&&(i4.u16.c...87644
Detected timeout of ITS tools.
Treatment of property SafeBus-COL-10-LTLFireability-10 finished in 237668 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(((p1&&X(X(p2)))||p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(!p0)) U !p1))'
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 (p1||G(!p0))))))'
[2024-05-27 15:49:48] [INFO ] Flatten gal took : 79 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12032789472841605345
[2024-05-27 15:49:48] [INFO ] Too many transitions (1531) to apply POR reductions. Disabling POR matrices.
[2024-05-27 15:49:48] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12032789472841605345
Running compilation step : cd /tmp/ltsmin12032789472841605345;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '144' '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 15:49:48] [INFO ] Applying decomposition
[2024-05-27 15:49:48] [INFO ] Flatten gal took : 82 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/graph573941574359761923.txt' '-o' '/tmp/graph573941574359761923.bin' '-w' '/tmp/graph573941574359761923.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph573941574359761923.bin' '-l' '-1' '-v' '-w' '/tmp/graph573941574359761923.weights' '-q' '0' '-e' '0.001'
[2024-05-27 15:49:48] [INFO ] Decomposing Gal with order
[2024-05-27 15:49:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 15:49:48] [INFO ] Removed a total of 2521 redundant transitions.
[2024-05-27 15:49:48] [INFO ] Flatten gal took : 221 ms
[2024-05-27 15:49:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 1065 labels/synchronizations in 22 ms.
[2024-05-27 15:49:49] [INFO ] Time to serialize gal into /tmp/LTLFireability6773144835030041166.gal : 6 ms
[2024-05-27 15:49:49] [INFO ] Time to serialize properties into /tmp/LTLFireability14237145434569657245.ltl : 16 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/LTLFireability6773144835030041166.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14237145434569657245.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 5 LTL properties
Checking formula 0 : !((X(G(("(((((((((i2.i0.u8.wait_cable_0<1)||(i3.u17.RMC_0<1))&&((i2.i0.u10.wait_cable_4<1)||(i3.u17.RMC_4<1)))&&(((i2.i0.u12.wait_cabl...6040
Formula 0 simplified : XF(!"(((((((((i2.i0.u8.wait_cable_0<1)||(i3.u17.RMC_0<1))&&((i2.i0.u10.wait_cable_4<1)||(i3.u17.RMC_4<1)))&&(((i2.i0.u12.wait_cable_...6032
Compilation finished in 5100 ms.
Running link step : cd /tmp/ltsmin12032789472841605345;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin12032789472841605345;'/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 (>144 s) on command cd /tmp/ltsmin12032789472841605345;'/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/ltsmin12032789472841605345;'/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)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin12032789472841605345;'/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)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin12032789472841605345;'/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' '<>((((LTLAPp4==true)&&X(X((LTLAPp1==true))))||(LTLAPp3==true)))' '--buchi-type=spotba'
LTSmin run took 400 ms.
FORMULA SafeBus-COL-10-LTLFireability-13 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin12032789472841605345;'/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))) U !(LTLAPp6==true))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin12032789472841605345;'/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))) U !(LTLAPp6==true))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin12032789472841605345;'/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) U ((LTLAPp7==true)||[](!(LTLAPp5==true))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin12032789472841605345;'/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) U ((LTLAPp7==true)||[](!(LTLAPp5==true))))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 5760 s
Running LTSmin : cd /tmp/ltsmin12032789472841605345;'/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 16:09:37] [INFO ] Applying decomposition
[2024-05-27 16:09:37] [INFO ] Flatten gal took : 140 ms
[2024-05-27 16:09:37] [INFO ] Decomposing Gal with order
[2024-05-27 16:09:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 16:09:37] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.lang.RuntimeException: Could not find partition element corresponding to cable_free in partition [AMC_0],[AMC_1, wait_ack_1],[AMC_2, wait_ack_2],[AMC_3, wait_ack_3],[AMC_4, wait_ack_4],[AMC_5, wait_ack_5],[AMC_6, wait_ack_6],[AMC_7, wait_ack_7],[AMC_8, wait_ack_8],[AMC_9, wait_ack_9],[AMC_10, wait_ack_10],[AMC_11],[AMC_12, wait_ack_12],[AMC_13, wait_ack_13],[AMC_14, wait_ack_14],[AMC_15, wait_ack_15],[AMC_16, wait_ack_16],[AMC_17, wait_ack_17],[AMC_18, wait_ack_18],[AMC_19, wait_ack_19],[AMC_20, wait_ack_20],[AMC_21, wait_ack_21],[AMC_22],[AMC_23, wait_ack_23],[AMC_24, wait_ack_24],[AMC_25, wait_ack_25],[AMC_26, wait_ack_26],[AMC_27, wait_ack_27],[AMC_28, wait_ack_28],[AMC_29, wait_ack_29],[AMC_30, wait_ack_30],[AMC_31, wait_ack_31],[AMC_32, wait_ack_32],[AMC_33],[AMC_34, wait_ack_34],[AMC_35, wait_ack_35],[AMC_36, wait_ack_36],[AMC_37, wait_ack_37],[AMC_38, wait_ack_38],[AMC_39, wait_ack_39],[AMC_40, wait_ack_40],[AMC_41, wait_ack_41],[AMC_42, wait_ack_42],[AMC_43, wait_ack_43],[AMC_44],[AMC_45, wait_ack_45],[AMC_46, wait_ack_46],[AMC_47, wait_ack_47],[AMC_48, wait_ack_48],[AMC_49, wait_ack_49],[AMC_50, wait_ack_50],[AMC_51, wait_ack_51],[AMC_52, wait_ack_52],[AMC_53, wait_ack_53],[AMC_54, wait_ack_54],[AMC_55],[AMC_56, wait_ack_56],[AMC_57, wait_ack_57],[AMC_58, wait_ack_58],[AMC_59, wait_ack_59],[AMC_60, wait_ack_60],[AMC_61, wait_ack_61],[AMC_62, wait_ack_62],[AMC_63, wait_ack_63],[AMC_64, wait_ack_64],[AMC_65, wait_ack_65],[AMC_66],[AMC_67, wait_ack_67],[AMC_68, wait_ack_68],[AMC_69, wait_ack_69],[AMC_70, wait_ack_70],[AMC_71, wait_ack_71],[AMC_72, wait_ack_72],[AMC_73, wait_ack_73],[AMC_74, wait_ack_74],[AMC_75, wait_ack_75],[AMC_76, wait_ack_76],[AMC_77],[AMC_78, wait_ack_78],[AMC_79, wait_ack_79],[AMC_80, wait_ack_80],[AMC_81, wait_ack_81],[AMC_82, wait_ack_82],[AMC_83, wait_ack_83],[AMC_84, wait_ack_84],[AMC_85, wait_ack_85],[AMC_86, wait_ack_86],[AMC_87, wait_ack_87],[AMC_88],[AMC_89, wait_ack_89],[AMC_90, wait_ack_90],[AMC_91, wait_ack_91],[AMC_92, wait_ack_92],[AMC_93, wait_ack_93],[AMC_94, wait_ack_94],[AMC_95, wait_ack_95],[AMC_96, wait_ack_96],[AMC_97, wait_ack_97],[AMC_98, wait_ack_98],[AMC_99],[Cpt2_0, Cpt1_0, cable_used_0, FMC_0, wait_cable_0, listen_0, RMC_0, PMC_0, MSG_0, wait_msg_0, loop_em_0],[Cpt2_1, Cpt1_1, cable_used_1, FMC_1, wait_cable_1, listen_1, RMC_1, PMC_1, MSG_1, wait_msg_1, loop_em_1],[Cpt2_2, Cpt1_2, cable_used_2, FMC_2, wait_cable_2, listen_2, RMC_2, PMC_2, MSG_2, wait_msg_2, loop_em_2],[Cpt2_3, Cpt1_3, cable_used_3, FMC_3, wait_cable_3, listen_3, RMC_3, PMC_3, MSG_3, wait_msg_3, loop_em_3],[Cpt2_4, Cpt1_4, cable_used_4, FMC_4, wait_cable_4, listen_4, RMC_4, PMC_4, MSG_4, wait_msg_4, loop_em_4],[Cpt2_5, Cpt1_5, cable_used_5, FMC_5, wait_cable_5, listen_5, RMC_5, PMC_5, MSG_5, wait_msg_5, loop_em_5],[Cpt2_6, Cpt1_6, cable_used_6, FMC_6, wait_cable_6, listen_6, RMC_6, PMC_6, MSG_6, wait_msg_6, loop_em_6],[Cpt2_7, Cpt1_7, cable_used_7, FMC_7, wait_cable_7, listen_7, RMC_7, PMC_7, MSG_7, wait_msg_7, loop_em_7],[Cpt2_8, Cpt1_8, cable_used_8, FMC_8, wait_cable_8, listen_8, RMC_8, PMC_8, MSG_8, wait_msg_8, loop_em_8],[Cpt2_9, Cpt1_9, cable_used_9, FMC_9, wait_cable_9, listen_9, RMC_9, PMC_9, MSG_9, wait_msg_9, loop_em_9],
at fr.lip6.move.gal.instantiate.CompositeBuilder$Partition.getIndex(CompositeBuilder.java:1421)
at fr.lip6.move.gal.instantiate.CompositeBuilder.galToCompositeWithPartition(CompositeBuilder.java:556)
at fr.lip6.move.gal.instantiate.CompositeBuilder.decomposeWithOrder(CompositeBuilder.java:147)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:133)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:230)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:124)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:1011)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-27 16:09:37] [INFO ] Flatten gal took : 184 ms
[2024-05-27 16:09:37] [INFO ] Time to serialize gal into /tmp/LTLFireability3632913826137699647.gal : 12 ms
[2024-05-27 16:09:37] [INFO ] Time to serialize properties into /tmp/LTLFireability14778265592172131735.ltl : 14 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/LTLFireability3632913826137699647.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14778265592172131735.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...298
Read 4 LTL properties
Checking formula 0 : !((X(G(("(((((((((wait_cable_0<1)||(RMC_0<1))&&((wait_cable_4<1)||(RMC_4<1)))&&(((wait_cable_8<1)||(RMC_8<1))&&((wait_cable_1<1)||(RMC...3797
Formula 0 simplified : XF(!"(((((((((wait_cable_0<1)||(RMC_0<1))&&((wait_cable_4<1)||(RMC_4<1)))&&(((wait_cable_8<1)||(RMC_8<1))&&((wait_cable_1<1)||(RMC_1...3789
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-COL-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-COL-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-171679080200372"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SafeBus-COL-10.tgz
mv SafeBus-COL-10 execution
cd execution
if [ "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 '
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 ;