Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r307-tajo-171654460800253.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is PolyORBNT-COL-S10J20, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r307-tajo-171654460800253
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 8.2K Apr 12 11:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Apr 12 11:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 12 11:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 12 11:03 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 4.4K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 12 13:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K Apr 12 13:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 12 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 12 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 92K 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 PolyORBNT-COL-S10J20-LTLFireability-00
FORMULA_NAME PolyORBNT-COL-S10J20-LTLFireability-01
FORMULA_NAME PolyORBNT-COL-S10J20-LTLFireability-02
FORMULA_NAME PolyORBNT-COL-S10J20-LTLFireability-03
FORMULA_NAME PolyORBNT-COL-S10J20-LTLFireability-04
FORMULA_NAME PolyORBNT-COL-S10J20-LTLFireability-05
FORMULA_NAME PolyORBNT-COL-S10J20-LTLFireability-06
FORMULA_NAME PolyORBNT-COL-S10J20-LTLFireability-07
FORMULA_NAME PolyORBNT-COL-S10J20-LTLFireability-08
FORMULA_NAME PolyORBNT-COL-S10J20-LTLFireability-09
FORMULA_NAME PolyORBNT-COL-S10J20-LTLFireability-10
FORMULA_NAME PolyORBNT-COL-S10J20-LTLFireability-11
FORMULA_NAME PolyORBNT-COL-S10J20-LTLFireability-12
FORMULA_NAME PolyORBNT-COL-S10J20-LTLFireability-13
FORMULA_NAME PolyORBNT-COL-S10J20-LTLFireability-14
FORMULA_NAME PolyORBNT-COL-S10J20-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717128428073

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-COL-S10J20
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202304061127
[2024-05-31 04:07:09] [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-31 04:07:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 04:07:09] [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-31 04:07:10] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-31 04:07:10] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 468 ms
[2024-05-31 04:07:10] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 494 PT places and 11822.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2024-05-31 04:07:10] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 6 ms.
[2024-05-31 04:07:10] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 5 formulas.
FORMULA PolyORBNT-COL-S10J20-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J20-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J20-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J20-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J20-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 7 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10003 steps, including 572 resets, run finished after 252 ms. (steps per millisecond=39 ) properties (out of 14) seen :2
Incomplete Best-First random walk after 10001 steps, including 196 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 12) seen :9
Incomplete Best-First random walk after 10001 steps, including 193 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 214 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 197 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 38 rows 48 cols
[2024-05-31 04:07:11] [INFO ] Computed 13 invariants in 7 ms
[2024-05-31 04:07:11] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-05-31 04:07:11] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 04:07:11] [INFO ] After 183ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:1
[2024-05-31 04:07:11] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 04:07:11] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 04:07:11] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :1
[2024-05-31 04:07:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:07:11] [INFO ] After 5ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :2 sat :1
[2024-05-31 04:07:11] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 4 ms to minimize.
[2024-05-31 04:07:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2024-05-31 04:07:11] [INFO ] After 50ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2024-05-31 04:07:11] [INFO ] After 113ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :1
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 38/38 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 47 transition count 34
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 43 transition count 34
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 9 place count 43 transition count 31
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 15 place count 40 transition count 31
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 17 place count 38 transition count 29
Iterating global reduction 2 with 2 rules applied. Total rules applied 19 place count 38 transition count 29
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 19 place count 38 transition count 28
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 21 place count 37 transition count 28
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 25 place count 35 transition count 26
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 27 place count 34 transition count 28
Applied a total of 27 rules in 18 ms. Remains 34 /48 variables (removed 14) and now considering 28/38 (removed 10) transitions.
// Phase 1: matrix 28 rows 34 cols
[2024-05-31 04:07:11] [INFO ] Computed 12 invariants in 2 ms
[2024-05-31 04:07:11] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 34/48 places, 28/38 transitions.
Incomplete random walk after 10000 steps, including 739 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 297 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Probably explored full state space saw : 521 states, properties seen :0
Probabilistic random walk after 1393 steps, saw 521 distinct states, run finished after 18 ms. (steps per millisecond=77 ) properties seen :0
Explored full state space saw : 521 states, properties seen :0
Exhaustive walk after 1393 steps, saw 521 distinct states, run finished after 3 ms. (steps per millisecond=464 ) properties seen :0
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 3 atomic propositions for a total of 7 simplifications.
[2024-05-31 04:07:11] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2024-05-31 04:07:11] [INFO ] Flatten gal took : 19 ms
FORMULA PolyORBNT-COL-S10J20-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J20-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-31 04:07:11] [INFO ] Flatten gal took : 6 ms
Transition Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-05-31 04:07:11] [INFO ] Unfolded HLPN to a Petri net with 494 places and 11780 transitions 111159 arcs in 209 ms.
[2024-05-31 04:07:11] [INFO ] Unfolded 9 HLPN properties in 1 ms.
[2024-05-31 04:07:11] [INFO ] Reduced 780 identical enabling conditions.
[2024-05-31 04:07:11] [INFO ] Reduced 780 identical enabling conditions.
[2024-05-31 04:07:11] [INFO ] Reduced 780 identical enabling conditions.
Deduced a syphon composed of 20 places in 22 ms
Reduce places removed 20 places and 20 transitions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Support contains 328 out of 474 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 1650/1650 transitions.
Applied a total of 0 rules in 29 ms. Remains 474 /474 variables (removed 0) and now considering 1650/1650 (removed 0) transitions.
[2024-05-31 04:07:11] [INFO ] Flow matrix only has 1641 transitions (discarded 9 similar events)
// Phase 1: matrix 1641 rows 474 cols
[2024-05-31 04:07:12] [INFO ] Computed 72 invariants in 71 ms
[2024-05-31 04:07:12] [INFO ] Dead Transitions using invariants and state equation in 817 ms found 615 transitions.
Found 615 dead transitions using SMT.
Drop transitions removed 615 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 615 transitions.
[2024-05-31 04:07:12] [INFO ] Flow matrix only has 1026 transitions (discarded 9 similar events)
// Phase 1: matrix 1026 rows 474 cols
[2024-05-31 04:07:12] [INFO ] Computed 72 invariants in 29 ms
[2024-05-31 04:07:12] [INFO ] Implicit Places using invariants in 165 ms returned []
[2024-05-31 04:07:12] [INFO ] Flow matrix only has 1026 transitions (discarded 9 similar events)
[2024-05-31 04:07:12] [INFO ] Invariant cache hit.
[2024-05-31 04:07:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:07:13] [INFO ] Implicit Places using invariants and state equation in 903 ms returned []
Implicit Place search using SMT with State Equation took 1073 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 474/474 places, 1035/1650 transitions.
Applied a total of 0 rules in 22 ms. Remains 474 /474 variables (removed 0) and now considering 1035/1035 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1947 ms. Remains : 474/474 places, 1035/1650 transitions.
Support contains 328 out of 474 places after structural reductions.
[2024-05-31 04:07:14] [INFO ] Flatten gal took : 218 ms
[2024-05-31 04:07:14] [INFO ] Flatten gal took : 144 ms
[2024-05-31 04:07:14] [INFO ] Input system was already deterministic with 1035 transitions.
Support contains 307 out of 474 places (down from 328) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 560 resets, run finished after 588 ms. (steps per millisecond=17 ) properties (out of 19) seen :6
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 120 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 101 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 13) seen :7
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 6) seen :2
Running SMT prover for 4 properties.
[2024-05-31 04:07:16] [INFO ] Flow matrix only has 1026 transitions (discarded 9 similar events)
[2024-05-31 04:07:16] [INFO ] Invariant cache hit.
[2024-05-31 04:07:16] [INFO ] [Real]Absence check using 65 positive place invariants in 18 ms returned sat
[2024-05-31 04:07:16] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 13 ms returned sat
[2024-05-31 04:07:16] [INFO ] After 149ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:2
[2024-05-31 04:07:16] [INFO ] [Nat]Absence check using 65 positive place invariants in 15 ms returned sat
[2024-05-31 04:07:16] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 8 ms returned sat
[2024-05-31 04:07:17] [INFO ] After 494ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :2
[2024-05-31 04:07:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:07:17] [INFO ] After 103ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :2 sat :2
[2024-05-31 04:07:17] [INFO ] Deduced a trap composed of 219 places in 228 ms of which 1 ms to minimize.
[2024-05-31 04:07:17] [INFO ] Deduced a trap composed of 205 places in 245 ms of which 0 ms to minimize.
[2024-05-31 04:07:18] [INFO ] Deduced a trap composed of 209 places in 261 ms of which 0 ms to minimize.
[2024-05-31 04:07:18] [INFO ] Deduced a trap composed of 225 places in 237 ms of which 1 ms to minimize.
[2024-05-31 04:07:18] [INFO ] Deduced a trap composed of 207 places in 237 ms of which 1 ms to minimize.
[2024-05-31 04:07:19] [INFO ] Deduced a trap composed of 215 places in 240 ms of which 2 ms to minimize.
[2024-05-31 04:07:19] [INFO ] Deduced a trap composed of 209 places in 250 ms of which 0 ms to minimize.
[2024-05-31 04:07:19] [INFO ] Deduced a trap composed of 211 places in 274 ms of which 1 ms to minimize.
[2024-05-31 04:07:19] [INFO ] Deduced a trap composed of 211 places in 277 ms of which 1 ms to minimize.
[2024-05-31 04:07:20] [INFO ] Deduced a trap composed of 209 places in 281 ms of which 1 ms to minimize.
[2024-05-31 04:07:20] [INFO ] Deduced a trap composed of 207 places in 301 ms of which 0 ms to minimize.
[2024-05-31 04:07:20] [INFO ] Deduced a trap composed of 213 places in 304 ms of which 0 ms to minimize.
[2024-05-31 04:07:21] [INFO ] Deduced a trap composed of 224 places in 278 ms of which 1 ms to minimize.
[2024-05-31 04:07:21] [INFO ] Deduced a trap composed of 213 places in 325 ms of which 0 ms to minimize.
[2024-05-31 04:07:22] [INFO ] Deduced a trap composed of 211 places in 303 ms of which 1 ms to minimize.
[2024-05-31 04:07:22] [INFO ] Deduced a trap composed of 207 places in 285 ms of which 1 ms to minimize.
[2024-05-31 04:07:22] [INFO ] Deduced a trap composed of 209 places in 307 ms of which 0 ms to minimize.
[2024-05-31 04:07:23] [INFO ] Deduced a trap composed of 217 places in 306 ms of which 1 ms to minimize.
[2024-05-31 04:07:24] [INFO ] Deduced a trap composed of 219 places in 308 ms of which 0 ms to minimize.
[2024-05-31 04:07:24] [INFO ] Deduced a trap composed of 221 places in 277 ms of which 2 ms to minimize.
[2024-05-31 04:07:24] [INFO ] Deduced a trap composed of 217 places in 266 ms of which 0 ms to minimize.
[2024-05-31 04:07:25] [INFO ] Deduced a trap composed of 219 places in 287 ms of which 1 ms to minimize.
[2024-05-31 04:07:25] [INFO ] Deduced a trap composed of 215 places in 285 ms of which 0 ms to minimize.
[2024-05-31 04:07:25] [INFO ] Deduced a trap composed of 215 places in 263 ms of which 1 ms to minimize.
[2024-05-31 04:07:26] [INFO ] Deduced a trap composed of 217 places in 285 ms of which 0 ms to minimize.
[2024-05-31 04:07:26] [INFO ] Deduced a trap composed of 223 places in 303 ms of which 0 ms to minimize.
[2024-05-31 04:07:26] [INFO ] Deduced a trap composed of 223 places in 300 ms of which 1 ms to minimize.
[2024-05-31 04:07:27] [INFO ] Deduced a trap composed of 211 places in 270 ms of which 1 ms to minimize.
[2024-05-31 04:07:27] [INFO ] Deduced a trap composed of 223 places in 317 ms of which 1 ms to minimize.
[2024-05-31 04:07:28] [INFO ] Deduced a trap composed of 229 places in 299 ms of which 1 ms to minimize.
[2024-05-31 04:07:28] [INFO ] Deduced a trap composed of 229 places in 296 ms of which 1 ms to minimize.
[2024-05-31 04:07:28] [INFO ] Deduced a trap composed of 217 places in 306 ms of which 1 ms to minimize.
[2024-05-31 04:07:29] [INFO ] Deduced a trap composed of 215 places in 244 ms of which 0 ms to minimize.
[2024-05-31 04:07:29] [INFO ] Deduced a trap composed of 229 places in 236 ms of which 1 ms to minimize.
[2024-05-31 04:07:29] [INFO ] Deduced a trap composed of 213 places in 293 ms of which 1 ms to minimize.
[2024-05-31 04:07:31] [INFO ] Deduced a trap composed of 225 places in 308 ms of which 0 ms to minimize.
[2024-05-31 04:07:31] [INFO ] Deduced a trap composed of 215 places in 306 ms of which 1 ms to minimize.
[2024-05-31 04:07:31] [INFO ] Deduced a trap composed of 227 places in 237 ms of which 1 ms to minimize.
[2024-05-31 04:07:32] [INFO ] Deduced a trap composed of 213 places in 238 ms of which 0 ms to minimize.
[2024-05-31 04:07:32] [INFO ] Deduced a trap composed of 227 places in 283 ms of which 0 ms to minimize.
[2024-05-31 04:07:32] [INFO ] Deduced a trap composed of 219 places in 246 ms of which 0 ms to minimize.
[2024-05-31 04:07:33] [INFO ] Deduced a trap composed of 225 places in 349 ms of which 1 ms to minimize.
[2024-05-31 04:07:34] [INFO ] Deduced a trap composed of 215 places in 352 ms of which 1 ms to minimize.
[2024-05-31 04:07:34] [INFO ] Deduced a trap composed of 219 places in 312 ms of which 1 ms to minimize.
[2024-05-31 04:07:34] [INFO ] Deduced a trap composed of 227 places in 298 ms of which 0 ms to minimize.
[2024-05-31 04:07:35] [INFO ] Deduced a trap composed of 217 places in 337 ms of which 1 ms to minimize.
[2024-05-31 04:07:35] [INFO ] Deduced a trap composed of 219 places in 266 ms of which 1 ms to minimize.
[2024-05-31 04:07:35] [INFO ] Deduced a trap composed of 217 places in 294 ms of which 0 ms to minimize.
[2024-05-31 04:07:36] [INFO ] Deduced a trap composed of 213 places in 269 ms of which 0 ms to minimize.
[2024-05-31 04:07:36] [INFO ] Deduced a trap composed of 219 places in 369 ms of which 1 ms to minimize.
[2024-05-31 04:07:37] [INFO ] Deduced a trap composed of 221 places in 363 ms of which 1 ms to minimize.
[2024-05-31 04:07:37] [INFO ] Deduced a trap composed of 225 places in 391 ms of which 3 ms to minimize.
[2024-05-31 04:07:38] [INFO ] Deduced a trap composed of 229 places in 350 ms of which 1 ms to minimize.
[2024-05-31 04:07:38] [INFO ] Deduced a trap composed of 225 places in 385 ms of which 1 ms to minimize.
[2024-05-31 04:07:38] [INFO ] Deduced a trap composed of 225 places in 312 ms of which 21 ms to minimize.
[2024-05-31 04:07:39] [INFO ] Deduced a trap composed of 221 places in 277 ms of which 13 ms to minimize.
[2024-05-31 04:07:39] [INFO ] Deduced a trap composed of 231 places in 364 ms of which 1 ms to minimize.
[2024-05-31 04:07:40] [INFO ] Deduced a trap composed of 233 places in 285 ms of which 0 ms to minimize.
[2024-05-31 04:07:40] [INFO ] Deduced a trap composed of 221 places in 340 ms of which 1 ms to minimize.
[2024-05-31 04:07:41] [INFO ] Deduced a trap composed of 231 places in 299 ms of which 1 ms to minimize.
[2024-05-31 04:07:41] [INFO ] Deduced a trap composed of 219 places in 381 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-31 04:07:41] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-31 04:07:41] [INFO ] After 25249ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0 real:2
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 474 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 474/474 places, 1035/1035 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 464 transition count 1009
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 62 place count 438 transition count 1009
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 62 place count 438 transition count 984
Deduced a syphon composed of 25 places in 2 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 112 place count 413 transition count 984
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 113 place count 412 transition count 983
Iterating global reduction 2 with 1 rules applied. Total rules applied 114 place count 412 transition count 983
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 118 place count 410 transition count 981
Applied a total of 118 rules in 165 ms. Remains 410 /474 variables (removed 64) and now considering 981/1035 (removed 54) transitions.
[2024-05-31 04:07:41] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2024-05-31 04:07:42] [INFO ] Computed 62 invariants in 13 ms
[2024-05-31 04:07:42] [INFO ] Dead Transitions using invariants and state equation in 613 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 796 ms. Remains : 410/474 places, 981/1035 transitions.
Incomplete random walk after 10000 steps, including 736 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 89 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-31 04:07:42] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2024-05-31 04:07:42] [INFO ] Invariant cache hit.
[2024-05-31 04:07:42] [INFO ] [Real]Absence check using 55 positive place invariants in 10 ms returned sat
[2024-05-31 04:07:42] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 8 ms returned sat
[2024-05-31 04:07:43] [INFO ] After 229ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-31 04:07:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:07:43] [INFO ] After 98ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 04:07:43] [INFO ] After 442ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 04:07:43] [INFO ] [Nat]Absence check using 55 positive place invariants in 9 ms returned sat
[2024-05-31 04:07:43] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 21 ms returned sat
[2024-05-31 04:07:43] [INFO ] After 270ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 04:07:43] [INFO ] After 103ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 04:07:44] [INFO ] Deduced a trap composed of 160 places in 306 ms of which 1 ms to minimize.
[2024-05-31 04:07:44] [INFO ] Deduced a trap composed of 168 places in 282 ms of which 1 ms to minimize.
[2024-05-31 04:07:44] [INFO ] Deduced a trap composed of 166 places in 261 ms of which 2 ms to minimize.
[2024-05-31 04:07:44] [INFO ] Deduced a trap composed of 160 places in 278 ms of which 0 ms to minimize.
[2024-05-31 04:07:45] [INFO ] Deduced a trap composed of 164 places in 301 ms of which 5 ms to minimize.
[2024-05-31 04:07:45] [INFO ] Deduced a trap composed of 152 places in 251 ms of which 1 ms to minimize.
[2024-05-31 04:07:45] [INFO ] Deduced a trap composed of 162 places in 299 ms of which 0 ms to minimize.
[2024-05-31 04:07:46] [INFO ] Deduced a trap composed of 166 places in 261 ms of which 0 ms to minimize.
[2024-05-31 04:07:46] [INFO ] Deduced a trap composed of 158 places in 216 ms of which 0 ms to minimize.
[2024-05-31 04:07:46] [INFO ] Deduced a trap composed of 158 places in 276 ms of which 1 ms to minimize.
[2024-05-31 04:07:47] [INFO ] Deduced a trap composed of 164 places in 260 ms of which 1 ms to minimize.
[2024-05-31 04:07:47] [INFO ] Deduced a trap composed of 160 places in 260 ms of which 0 ms to minimize.
[2024-05-31 04:07:47] [INFO ] Deduced a trap composed of 154 places in 267 ms of which 1 ms to minimize.
[2024-05-31 04:07:48] [INFO ] Deduced a trap composed of 168 places in 221 ms of which 0 ms to minimize.
[2024-05-31 04:07:48] [INFO ] Deduced a trap composed of 162 places in 220 ms of which 0 ms to minimize.
[2024-05-31 04:07:48] [INFO ] Deduced a trap composed of 160 places in 221 ms of which 1 ms to minimize.
[2024-05-31 04:07:49] [INFO ] Deduced a trap composed of 175 places in 230 ms of which 1 ms to minimize.
[2024-05-31 04:07:49] [INFO ] Deduced a trap composed of 162 places in 261 ms of which 0 ms to minimize.
[2024-05-31 04:07:49] [INFO ] Deduced a trap composed of 160 places in 271 ms of which 0 ms to minimize.
[2024-05-31 04:07:49] [INFO ] Deduced a trap composed of 166 places in 263 ms of which 1 ms to minimize.
[2024-05-31 04:07:50] [INFO ] Deduced a trap composed of 168 places in 280 ms of which 1 ms to minimize.
[2024-05-31 04:07:50] [INFO ] Deduced a trap composed of 160 places in 227 ms of which 0 ms to minimize.
[2024-05-31 04:07:50] [INFO ] Deduced a trap composed of 160 places in 264 ms of which 0 ms to minimize.
[2024-05-31 04:07:51] [INFO ] Deduced a trap composed of 158 places in 215 ms of which 0 ms to minimize.
[2024-05-31 04:07:51] [INFO ] Deduced a trap composed of 166 places in 219 ms of which 1 ms to minimize.
[2024-05-31 04:07:51] [INFO ] Deduced a trap composed of 158 places in 272 ms of which 0 ms to minimize.
[2024-05-31 04:07:52] [INFO ] Deduced a trap composed of 160 places in 288 ms of which 0 ms to minimize.
[2024-05-31 04:07:52] [INFO ] Deduced a trap composed of 158 places in 222 ms of which 1 ms to minimize.
[2024-05-31 04:07:52] [INFO ] Deduced a trap composed of 164 places in 261 ms of which 1 ms to minimize.
[2024-05-31 04:07:53] [INFO ] Deduced a trap composed of 164 places in 252 ms of which 1 ms to minimize.
[2024-05-31 04:07:53] [INFO ] Deduced a trap composed of 164 places in 209 ms of which 1 ms to minimize.
[2024-05-31 04:07:53] [INFO ] Deduced a trap composed of 162 places in 247 ms of which 1 ms to minimize.
[2024-05-31 04:07:53] [INFO ] Deduced a trap composed of 160 places in 270 ms of which 1 ms to minimize.
[2024-05-31 04:07:54] [INFO ] Deduced a trap composed of 162 places in 225 ms of which 1 ms to minimize.
[2024-05-31 04:07:54] [INFO ] Deduced a trap composed of 164 places in 258 ms of which 0 ms to minimize.
[2024-05-31 04:07:54] [INFO ] Deduced a trap composed of 154 places in 247 ms of which 1 ms to minimize.
[2024-05-31 04:07:55] [INFO ] Deduced a trap composed of 164 places in 246 ms of which 0 ms to minimize.
[2024-05-31 04:07:55] [INFO ] Deduced a trap composed of 168 places in 232 ms of which 0 ms to minimize.
[2024-05-31 04:07:55] [INFO ] Deduced a trap composed of 160 places in 237 ms of which 1 ms to minimize.
[2024-05-31 04:07:56] [INFO ] Deduced a trap composed of 162 places in 246 ms of which 0 ms to minimize.
[2024-05-31 04:07:56] [INFO ] Deduced a trap composed of 158 places in 263 ms of which 1 ms to minimize.
[2024-05-31 04:07:56] [INFO ] Deduced a trap composed of 166 places in 249 ms of which 0 ms to minimize.
[2024-05-31 04:07:57] [INFO ] Deduced a trap composed of 166 places in 333 ms of which 1 ms to minimize.
[2024-05-31 04:07:57] [INFO ] Deduced a trap composed of 156 places in 261 ms of which 1 ms to minimize.
[2024-05-31 04:07:57] [INFO ] Deduced a trap composed of 166 places in 281 ms of which 0 ms to minimize.
[2024-05-31 04:07:58] [INFO ] Deduced a trap composed of 164 places in 285 ms of which 1 ms to minimize.
[2024-05-31 04:07:58] [INFO ] Deduced a trap composed of 160 places in 318 ms of which 1 ms to minimize.
[2024-05-31 04:07:59] [INFO ] Deduced a trap composed of 160 places in 319 ms of which 1 ms to minimize.
[2024-05-31 04:07:59] [INFO ] Deduced a trap composed of 162 places in 318 ms of which 0 ms to minimize.
[2024-05-31 04:08:00] [INFO ] Deduced a trap composed of 164 places in 244 ms of which 1 ms to minimize.
[2024-05-31 04:08:00] [INFO ] Deduced a trap composed of 160 places in 300 ms of which 0 ms to minimize.
[2024-05-31 04:08:00] [INFO ] Deduced a trap composed of 158 places in 262 ms of which 0 ms to minimize.
[2024-05-31 04:08:01] [INFO ] Deduced a trap composed of 160 places in 272 ms of which 1 ms to minimize.
[2024-05-31 04:08:01] [INFO ] Deduced a trap composed of 166 places in 266 ms of which 1 ms to minimize.
[2024-05-31 04:08:01] [INFO ] Deduced a trap composed of 162 places in 222 ms of which 1 ms to minimize.
[2024-05-31 04:08:02] [INFO ] Deduced a trap composed of 168 places in 241 ms of which 0 ms to minimize.
[2024-05-31 04:08:02] [INFO ] Deduced a trap composed of 166 places in 233 ms of which 0 ms to minimize.
[2024-05-31 04:08:02] [INFO ] Deduced a trap composed of 160 places in 254 ms of which 0 ms to minimize.
[2024-05-31 04:08:02] [INFO ] Deduced a trap composed of 160 places in 248 ms of which 1 ms to minimize.
[2024-05-31 04:08:03] [INFO ] Deduced a trap composed of 160 places in 291 ms of which 0 ms to minimize.
[2024-05-31 04:08:03] [INFO ] Deduced a trap composed of 175 places in 256 ms of which 0 ms to minimize.
[2024-05-31 04:08:04] [INFO ] Deduced a trap composed of 177 places in 281 ms of which 0 ms to minimize.
[2024-05-31 04:08:04] [INFO ] Deduced a trap composed of 160 places in 326 ms of which 1 ms to minimize.
[2024-05-31 04:08:05] [INFO ] Deduced a trap composed of 164 places in 304 ms of which 1 ms to minimize.
[2024-05-31 04:08:05] [INFO ] Deduced a trap composed of 160 places in 307 ms of which 1 ms to minimize.
[2024-05-31 04:08:06] [INFO ] Deduced a trap composed of 164 places in 347 ms of which 0 ms to minimize.
[2024-05-31 04:08:06] [INFO ] Deduced a trap composed of 162 places in 328 ms of which 0 ms to minimize.
[2024-05-31 04:08:07] [INFO ] Deduced a trap composed of 164 places in 284 ms of which 1 ms to minimize.
[2024-05-31 04:08:07] [INFO ] Deduced a trap composed of 173 places in 316 ms of which 0 ms to minimize.
[2024-05-31 04:08:08] [INFO ] Deduced a trap composed of 156 places in 306 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-31 04:08:08] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-31 04:08:08] [INFO ] After 25071ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 56 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 410/410 places, 981/981 transitions.
Incomplete random walk after 10000 steps, including 737 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 101 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 569448 steps, run timeout after 3001 ms. (steps per millisecond=189 ) properties seen :{}
Probabilistic random walk after 569448 steps, saw 92600 distinct states, run finished after 3005 ms. (steps per millisecond=189 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-31 04:08:11] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2024-05-31 04:08:11] [INFO ] Invariant cache hit.
[2024-05-31 04:08:11] [INFO ] [Real]Absence check using 55 positive place invariants in 13 ms returned sat
[2024-05-31 04:08:11] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 12 ms returned sat
[2024-05-31 04:08:11] [INFO ] After 259ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-31 04:08:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:08:11] [INFO ] After 74ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 04:08:11] [INFO ] After 445ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 04:08:12] [INFO ] [Nat]Absence check using 55 positive place invariants in 15 ms returned sat
[2024-05-31 04:08:12] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 11 ms returned sat
[2024-05-31 04:08:12] [INFO ] After 287ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 04:08:12] [INFO ] After 142ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 04:08:12] [INFO ] Deduced a trap composed of 160 places in 300 ms of which 1 ms to minimize.
[2024-05-31 04:08:13] [INFO ] Deduced a trap composed of 168 places in 293 ms of which 1 ms to minimize.
[2024-05-31 04:08:13] [INFO ] Deduced a trap composed of 166 places in 301 ms of which 0 ms to minimize.
[2024-05-31 04:08:13] [INFO ] Deduced a trap composed of 160 places in 247 ms of which 0 ms to minimize.
[2024-05-31 04:08:14] [INFO ] Deduced a trap composed of 164 places in 275 ms of which 1 ms to minimize.
[2024-05-31 04:08:14] [INFO ] Deduced a trap composed of 152 places in 274 ms of which 1 ms to minimize.
[2024-05-31 04:08:14] [INFO ] Deduced a trap composed of 162 places in 274 ms of which 1 ms to minimize.
[2024-05-31 04:08:15] [INFO ] Deduced a trap composed of 166 places in 276 ms of which 1 ms to minimize.
[2024-05-31 04:08:15] [INFO ] Deduced a trap composed of 158 places in 281 ms of which 1 ms to minimize.
[2024-05-31 04:08:15] [INFO ] Deduced a trap composed of 158 places in 268 ms of which 2 ms to minimize.
[2024-05-31 04:08:16] [INFO ] Deduced a trap composed of 164 places in 266 ms of which 1 ms to minimize.
[2024-05-31 04:08:16] [INFO ] Deduced a trap composed of 160 places in 279 ms of which 1 ms to minimize.
[2024-05-31 04:08:16] [INFO ] Deduced a trap composed of 154 places in 294 ms of which 1 ms to minimize.
[2024-05-31 04:08:17] [INFO ] Deduced a trap composed of 168 places in 263 ms of which 0 ms to minimize.
[2024-05-31 04:08:17] [INFO ] Deduced a trap composed of 162 places in 252 ms of which 0 ms to minimize.
[2024-05-31 04:08:17] [INFO ] Deduced a trap composed of 160 places in 255 ms of which 0 ms to minimize.
[2024-05-31 04:08:18] [INFO ] Deduced a trap composed of 175 places in 297 ms of which 1 ms to minimize.
[2024-05-31 04:08:18] [INFO ] Deduced a trap composed of 162 places in 261 ms of which 0 ms to minimize.
[2024-05-31 04:08:19] [INFO ] Deduced a trap composed of 160 places in 303 ms of which 1 ms to minimize.
[2024-05-31 04:08:19] [INFO ] Deduced a trap composed of 166 places in 274 ms of which 1 ms to minimize.
[2024-05-31 04:08:19] [INFO ] Deduced a trap composed of 168 places in 272 ms of which 1 ms to minimize.
[2024-05-31 04:08:20] [INFO ] Deduced a trap composed of 160 places in 310 ms of which 1 ms to minimize.
[2024-05-31 04:08:20] [INFO ] Deduced a trap composed of 160 places in 315 ms of which 0 ms to minimize.
[2024-05-31 04:08:20] [INFO ] Deduced a trap composed of 158 places in 319 ms of which 0 ms to minimize.
[2024-05-31 04:08:21] [INFO ] Deduced a trap composed of 166 places in 313 ms of which 1 ms to minimize.
[2024-05-31 04:08:21] [INFO ] Deduced a trap composed of 158 places in 296 ms of which 0 ms to minimize.
[2024-05-31 04:08:22] [INFO ] Deduced a trap composed of 160 places in 305 ms of which 1 ms to minimize.
[2024-05-31 04:08:22] [INFO ] Deduced a trap composed of 158 places in 293 ms of which 0 ms to minimize.
[2024-05-31 04:08:22] [INFO ] Deduced a trap composed of 164 places in 285 ms of which 0 ms to minimize.
[2024-05-31 04:08:23] [INFO ] Deduced a trap composed of 164 places in 273 ms of which 0 ms to minimize.
[2024-05-31 04:08:23] [INFO ] Deduced a trap composed of 164 places in 269 ms of which 1 ms to minimize.
[2024-05-31 04:08:23] [INFO ] Deduced a trap composed of 162 places in 282 ms of which 0 ms to minimize.
[2024-05-31 04:08:24] [INFO ] Deduced a trap composed of 160 places in 276 ms of which 1 ms to minimize.
[2024-05-31 04:08:24] [INFO ] Deduced a trap composed of 162 places in 281 ms of which 1 ms to minimize.
[2024-05-31 04:08:24] [INFO ] Deduced a trap composed of 164 places in 252 ms of which 1 ms to minimize.
[2024-05-31 04:08:25] [INFO ] Deduced a trap composed of 154 places in 271 ms of which 1 ms to minimize.
[2024-05-31 04:08:25] [INFO ] Deduced a trap composed of 164 places in 278 ms of which 0 ms to minimize.
[2024-05-31 04:08:25] [INFO ] Deduced a trap composed of 168 places in 325 ms of which 1 ms to minimize.
[2024-05-31 04:08:26] [INFO ] Deduced a trap composed of 160 places in 282 ms of which 1 ms to minimize.
[2024-05-31 04:08:26] [INFO ] Deduced a trap composed of 162 places in 248 ms of which 1 ms to minimize.
[2024-05-31 04:08:27] [INFO ] Deduced a trap composed of 158 places in 242 ms of which 1 ms to minimize.
[2024-05-31 04:08:27] [INFO ] Deduced a trap composed of 166 places in 247 ms of which 1 ms to minimize.
[2024-05-31 04:08:27] [INFO ] Deduced a trap composed of 166 places in 243 ms of which 1 ms to minimize.
[2024-05-31 04:08:27] [INFO ] Deduced a trap composed of 156 places in 227 ms of which 1 ms to minimize.
[2024-05-31 04:08:28] [INFO ] Deduced a trap composed of 166 places in 252 ms of which 1 ms to minimize.
[2024-05-31 04:08:28] [INFO ] Deduced a trap composed of 164 places in 227 ms of which 0 ms to minimize.
[2024-05-31 04:08:29] [INFO ] Deduced a trap composed of 160 places in 270 ms of which 1 ms to minimize.
[2024-05-31 04:08:29] [INFO ] Deduced a trap composed of 160 places in 325 ms of which 1 ms to minimize.
[2024-05-31 04:08:29] [INFO ] Deduced a trap composed of 162 places in 323 ms of which 1 ms to minimize.
[2024-05-31 04:08:30] [INFO ] Deduced a trap composed of 164 places in 322 ms of which 1 ms to minimize.
[2024-05-31 04:08:30] [INFO ] Deduced a trap composed of 160 places in 301 ms of which 1 ms to minimize.
[2024-05-31 04:08:31] [INFO ] Deduced a trap composed of 158 places in 287 ms of which 0 ms to minimize.
[2024-05-31 04:08:31] [INFO ] Deduced a trap composed of 160 places in 253 ms of which 0 ms to minimize.
[2024-05-31 04:08:31] [INFO ] Deduced a trap composed of 166 places in 270 ms of which 0 ms to minimize.
[2024-05-31 04:08:32] [INFO ] Deduced a trap composed of 162 places in 252 ms of which 1 ms to minimize.
[2024-05-31 04:08:32] [INFO ] Deduced a trap composed of 168 places in 251 ms of which 0 ms to minimize.
[2024-05-31 04:08:32] [INFO ] Deduced a trap composed of 166 places in 301 ms of which 1 ms to minimize.
[2024-05-31 04:08:33] [INFO ] Deduced a trap composed of 160 places in 304 ms of which 0 ms to minimize.
[2024-05-31 04:08:33] [INFO ] Deduced a trap composed of 160 places in 282 ms of which 1 ms to minimize.
[2024-05-31 04:08:33] [INFO ] Deduced a trap composed of 160 places in 270 ms of which 1 ms to minimize.
[2024-05-31 04:08:34] [INFO ] Deduced a trap composed of 175 places in 283 ms of which 1 ms to minimize.
[2024-05-31 04:08:34] [INFO ] Deduced a trap composed of 177 places in 311 ms of which 0 ms to minimize.
[2024-05-31 04:08:35] [INFO ] Deduced a trap composed of 160 places in 310 ms of which 0 ms to minimize.
[2024-05-31 04:08:35] [INFO ] Deduced a trap composed of 164 places in 287 ms of which 0 ms to minimize.
[2024-05-31 04:08:36] [INFO ] Deduced a trap composed of 160 places in 309 ms of which 0 ms to minimize.
[2024-05-31 04:08:36] [INFO ] Deduced a trap composed of 164 places in 320 ms of which 1 ms to minimize.
[2024-05-31 04:08:37] [INFO ] Deduced a trap composed of 162 places in 313 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-31 04:08:37] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-31 04:08:37] [INFO ] After 25244ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 34 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 410/410 places, 981/981 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 30 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
[2024-05-31 04:08:37] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2024-05-31 04:08:37] [INFO ] Invariant cache hit.
[2024-05-31 04:08:37] [INFO ] Implicit Places using invariants in 392 ms returned []
[2024-05-31 04:08:37] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2024-05-31 04:08:37] [INFO ] Invariant cache hit.
[2024-05-31 04:08:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:08:39] [INFO ] Implicit Places using invariants and state equation in 2000 ms returned []
Implicit Place search using SMT with State Equation took 2397 ms to find 0 implicit places.
[2024-05-31 04:08:39] [INFO ] Redundant transitions in 92 ms returned []
[2024-05-31 04:08:39] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2024-05-31 04:08:39] [INFO ] Invariant cache hit.
[2024-05-31 04:08:40] [INFO ] Dead Transitions using invariants and state equation in 442 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2973 ms. Remains : 410/410 places, 981/981 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 410 transition count 972
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 9 place count 410 transition count 971
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 409 transition count 971
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 409 transition count 970
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 408 transition count 970
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 408 transition count 960
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 33 place count 398 transition count 960
Applied a total of 33 rules in 136 ms. Remains 398 /410 variables (removed 12) and now considering 960/981 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 960 rows 398 cols
[2024-05-31 04:08:40] [INFO ] Computed 62 invariants in 18 ms
[2024-05-31 04:08:40] [INFO ] [Real]Absence check using 55 positive place invariants in 11 ms returned sat
[2024-05-31 04:08:40] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 8 ms returned sat
[2024-05-31 04:08:40] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 04:08:40] [INFO ] [Nat]Absence check using 55 positive place invariants in 11 ms returned sat
[2024-05-31 04:08:40] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 8 ms returned sat
[2024-05-31 04:08:40] [INFO ] After 225ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 04:08:41] [INFO ] Deduced a trap composed of 160 places in 265 ms of which 0 ms to minimize.
[2024-05-31 04:08:41] [INFO ] Deduced a trap composed of 150 places in 264 ms of which 0 ms to minimize.
[2024-05-31 04:08:41] [INFO ] Deduced a trap composed of 162 places in 225 ms of which 0 ms to minimize.
[2024-05-31 04:08:41] [INFO ] Deduced a trap composed of 158 places in 155 ms of which 1 ms to minimize.
[2024-05-31 04:08:42] [INFO ] Deduced a trap composed of 154 places in 219 ms of which 1 ms to minimize.
[2024-05-31 04:08:42] [INFO ] Deduced a trap composed of 162 places in 232 ms of which 1 ms to minimize.
[2024-05-31 04:08:42] [INFO ] Deduced a trap composed of 156 places in 272 ms of which 1 ms to minimize.
[2024-05-31 04:08:42] [INFO ] Deduced a trap composed of 158 places in 271 ms of which 1 ms to minimize.
[2024-05-31 04:08:43] [INFO ] Deduced a trap composed of 158 places in 284 ms of which 0 ms to minimize.
[2024-05-31 04:08:43] [INFO ] Deduced a trap composed of 162 places in 285 ms of which 1 ms to minimize.
[2024-05-31 04:08:44] [INFO ] Deduced a trap composed of 160 places in 282 ms of which 0 ms to minimize.
[2024-05-31 04:08:44] [INFO ] Deduced a trap composed of 156 places in 282 ms of which 1 ms to minimize.
[2024-05-31 04:08:44] [INFO ] Deduced a trap composed of 154 places in 279 ms of which 1 ms to minimize.
[2024-05-31 04:08:45] [INFO ] Deduced a trap composed of 168 places in 275 ms of which 0 ms to minimize.
[2024-05-31 04:08:45] [INFO ] Deduced a trap composed of 158 places in 251 ms of which 0 ms to minimize.
[2024-05-31 04:08:45] [INFO ] Deduced a trap composed of 152 places in 268 ms of which 1 ms to minimize.
[2024-05-31 04:08:46] [INFO ] Deduced a trap composed of 166 places in 256 ms of which 1 ms to minimize.
[2024-05-31 04:08:46] [INFO ] Deduced a trap composed of 156 places in 260 ms of which 0 ms to minimize.
[2024-05-31 04:08:46] [INFO ] Deduced a trap composed of 156 places in 233 ms of which 1 ms to minimize.
[2024-05-31 04:08:47] [INFO ] Deduced a trap composed of 156 places in 287 ms of which 1 ms to minimize.
[2024-05-31 04:08:47] [INFO ] Deduced a trap composed of 160 places in 241 ms of which 1 ms to minimize.
[2024-05-31 04:08:47] [INFO ] Deduced a trap composed of 156 places in 278 ms of which 1 ms to minimize.
[2024-05-31 04:08:47] [INFO ] Deduced a trap composed of 158 places in 238 ms of which 0 ms to minimize.
[2024-05-31 04:08:48] [INFO ] Deduced a trap composed of 166 places in 256 ms of which 0 ms to minimize.
[2024-05-31 04:08:48] [INFO ] Deduced a trap composed of 160 places in 238 ms of which 0 ms to minimize.
[2024-05-31 04:08:48] [INFO ] Deduced a trap composed of 158 places in 227 ms of which 0 ms to minimize.
[2024-05-31 04:08:49] [INFO ] Deduced a trap composed of 156 places in 214 ms of which 4 ms to minimize.
[2024-05-31 04:08:49] [INFO ] Deduced a trap composed of 156 places in 233 ms of which 0 ms to minimize.
[2024-05-31 04:08:49] [INFO ] Deduced a trap composed of 160 places in 242 ms of which 0 ms to minimize.
[2024-05-31 04:08:49] [INFO ] Deduced a trap composed of 158 places in 240 ms of which 0 ms to minimize.
[2024-05-31 04:08:50] [INFO ] Deduced a trap composed of 156 places in 215 ms of which 0 ms to minimize.
[2024-05-31 04:08:50] [INFO ] Deduced a trap composed of 158 places in 272 ms of which 2 ms to minimize.
[2024-05-31 04:08:50] [INFO ] Deduced a trap composed of 156 places in 260 ms of which 0 ms to minimize.
[2024-05-31 04:08:50] [INFO ] Deduced a trap composed of 156 places in 220 ms of which 1 ms to minimize.
[2024-05-31 04:08:51] [INFO ] Deduced a trap composed of 158 places in 247 ms of which 0 ms to minimize.
[2024-05-31 04:08:51] [INFO ] Deduced a trap composed of 156 places in 226 ms of which 1 ms to minimize.
[2024-05-31 04:08:51] [INFO ] Deduced a trap composed of 158 places in 223 ms of which 1 ms to minimize.
[2024-05-31 04:08:51] [INFO ] Deduced a trap composed of 162 places in 183 ms of which 0 ms to minimize.
[2024-05-31 04:08:52] [INFO ] Deduced a trap composed of 166 places in 220 ms of which 0 ms to minimize.
[2024-05-31 04:08:52] [INFO ] Deduced a trap composed of 166 places in 226 ms of which 0 ms to minimize.
[2024-05-31 04:08:52] [INFO ] Deduced a trap composed of 163 places in 252 ms of which 1 ms to minimize.
[2024-05-31 04:08:53] [INFO ] Deduced a trap composed of 163 places in 228 ms of which 1 ms to minimize.
[2024-05-31 04:08:53] [INFO ] Deduced a trap composed of 166 places in 222 ms of which 0 ms to minimize.
[2024-05-31 04:08:53] [INFO ] Deduced a trap composed of 168 places in 235 ms of which 1 ms to minimize.
[2024-05-31 04:08:53] [INFO ] Deduced a trap composed of 168 places in 231 ms of which 0 ms to minimize.
[2024-05-31 04:08:54] [INFO ] Deduced a trap composed of 158 places in 256 ms of which 1 ms to minimize.
[2024-05-31 04:08:54] [INFO ] Deduced a trap composed of 162 places in 233 ms of which 0 ms to minimize.
[2024-05-31 04:08:54] [INFO ] Deduced a trap composed of 158 places in 240 ms of which 1 ms to minimize.
[2024-05-31 04:08:54] [INFO ] Deduced a trap composed of 158 places in 231 ms of which 14 ms to minimize.
[2024-05-31 04:08:55] [INFO ] Deduced a trap composed of 156 places in 223 ms of which 0 ms to minimize.
[2024-05-31 04:08:55] [INFO ] Deduced a trap composed of 156 places in 208 ms of which 0 ms to minimize.
[2024-05-31 04:08:55] [INFO ] Deduced a trap composed of 168 places in 188 ms of which 0 ms to minimize.
[2024-05-31 04:08:55] [INFO ] Deduced a trap composed of 168 places in 208 ms of which 1 ms to minimize.
[2024-05-31 04:08:56] [INFO ] Deduced a trap composed of 168 places in 204 ms of which 1 ms to minimize.
[2024-05-31 04:08:56] [INFO ] Deduced a trap composed of 168 places in 169 ms of which 1 ms to minimize.
[2024-05-31 04:08:56] [INFO ] Deduced a trap composed of 158 places in 256 ms of which 2 ms to minimize.
[2024-05-31 04:08:57] [INFO ] Deduced a trap composed of 160 places in 281 ms of which 1 ms to minimize.
[2024-05-31 04:08:57] [INFO ] Deduced a trap composed of 160 places in 259 ms of which 1 ms to minimize.
[2024-05-31 04:08:59] [INFO ] Deduced a trap composed of 160 places in 275 ms of which 0 ms to minimize.
[2024-05-31 04:08:59] [INFO ] Deduced a trap composed of 162 places in 244 ms of which 1 ms to minimize.
[2024-05-31 04:08:59] [INFO ] Deduced a trap composed of 160 places in 228 ms of which 1 ms to minimize.
[2024-05-31 04:09:00] [INFO ] Deduced a trap composed of 160 places in 231 ms of which 0 ms to minimize.
[2024-05-31 04:09:00] [INFO ] Deduced a trap composed of 164 places in 221 ms of which 1 ms to minimize.
[2024-05-31 04:09:00] [INFO ] Deduced a trap composed of 162 places in 209 ms of which 1 ms to minimize.
[2024-05-31 04:09:00] [INFO ] Deduced a trap composed of 158 places in 207 ms of which 1 ms to minimize.
[2024-05-31 04:09:01] [INFO ] Deduced a trap composed of 160 places in 236 ms of which 0 ms to minimize.
[2024-05-31 04:09:03] [INFO ] Deduced a trap composed of 160 places in 269 ms of which 0 ms to minimize.
[2024-05-31 04:09:03] [INFO ] Deduced a trap composed of 166 places in 236 ms of which 1 ms to minimize.
[2024-05-31 04:09:04] [INFO ] Deduced a trap composed of 158 places in 230 ms of which 1 ms to minimize.
[2024-05-31 04:09:04] [INFO ] Deduced a trap composed of 160 places in 231 ms of which 1 ms to minimize.
[2024-05-31 04:09:04] [INFO ] Deduced a trap composed of 160 places in 198 ms of which 0 ms to minimize.
[2024-05-31 04:09:04] [INFO ] Deduced a trap composed of 160 places in 175 ms of which 1 ms to minimize.
[2024-05-31 04:09:04] [INFO ] Deduced a trap composed of 166 places in 163 ms of which 1 ms to minimize.
[2024-05-31 04:09:05] [INFO ] Deduced a trap composed of 156 places in 177 ms of which 1 ms to minimize.
[2024-05-31 04:09:05] [INFO ] Deduced a trap composed of 164 places in 153 ms of which 0 ms to minimize.
[2024-05-31 04:09:05] [INFO ] Deduced a trap composed of 164 places in 160 ms of which 0 ms to minimize.
[2024-05-31 04:09:05] [INFO ] Deduced a trap composed of 158 places in 187 ms of which 0 ms to minimize.
[2024-05-31 04:09:05] [INFO ] Deduced a trap composed of 158 places in 171 ms of which 1 ms to minimize.
[2024-05-31 04:09:06] [INFO ] Deduced a trap composed of 158 places in 173 ms of which 0 ms to minimize.
[2024-05-31 04:09:06] [INFO ] Deduced a trap composed of 154 places in 168 ms of which 0 ms to minimize.
[2024-05-31 04:09:06] [INFO ] Deduced a trap composed of 164 places in 214 ms of which 1 ms to minimize.
[2024-05-31 04:09:06] [INFO ] Deduced a trap composed of 156 places in 263 ms of which 0 ms to minimize.
[2024-05-31 04:09:07] [INFO ] Deduced a trap composed of 162 places in 276 ms of which 1 ms to minimize.
[2024-05-31 04:09:07] [INFO ] Deduced a trap composed of 160 places in 236 ms of which 0 ms to minimize.
[2024-05-31 04:09:07] [INFO ] Deduced a trap composed of 160 places in 235 ms of which 0 ms to minimize.
[2024-05-31 04:09:08] [INFO ] Deduced a trap composed of 160 places in 221 ms of which 1 ms to minimize.
[2024-05-31 04:09:08] [INFO ] Deduced a trap composed of 160 places in 214 ms of which 0 ms to minimize.
[2024-05-31 04:09:08] [INFO ] Deduced a trap composed of 162 places in 230 ms of which 1 ms to minimize.
[2024-05-31 04:09:08] [INFO ] Deduced a trap composed of 165 places in 217 ms of which 0 ms to minimize.
[2024-05-31 04:09:09] [INFO ] Deduced a trap composed of 160 places in 260 ms of which 1 ms to minimize.
[2024-05-31 04:09:09] [INFO ] Deduced a trap composed of 160 places in 268 ms of which 1 ms to minimize.
[2024-05-31 04:09:09] [INFO ] Deduced a trap composed of 162 places in 228 ms of which 1 ms to minimize.
[2024-05-31 04:09:10] [INFO ] Deduced a trap composed of 163 places in 230 ms of which 0 ms to minimize.
[2024-05-31 04:09:10] [INFO ] Deduced a trap composed of 162 places in 238 ms of which 0 ms to minimize.
[2024-05-31 04:09:10] [INFO ] Deduced a trap composed of 160 places in 209 ms of which 1 ms to minimize.
[2024-05-31 04:09:10] [INFO ] Deduced a trap composed of 160 places in 237 ms of which 1 ms to minimize.
[2024-05-31 04:09:11] [INFO ] Deduced a trap composed of 162 places in 244 ms of which 0 ms to minimize.
[2024-05-31 04:09:11] [INFO ] Deduced a trap composed of 160 places in 229 ms of which 1 ms to minimize.
[2024-05-31 04:09:11] [INFO ] Deduced a trap composed of 160 places in 264 ms of which 1 ms to minimize.
[2024-05-31 04:09:12] [INFO ] Deduced a trap composed of 156 places in 231 ms of which 0 ms to minimize.
[2024-05-31 04:09:12] [INFO ] Deduced a trap composed of 160 places in 217 ms of which 1 ms to minimize.
[2024-05-31 04:09:12] [INFO ] Deduced a trap composed of 158 places in 240 ms of which 0 ms to minimize.
[2024-05-31 04:09:12] [INFO ] Deduced a trap composed of 156 places in 256 ms of which 1 ms to minimize.
[2024-05-31 04:09:13] [INFO ] Deduced a trap composed of 154 places in 301 ms of which 1 ms to minimize.
[2024-05-31 04:09:13] [INFO ] Deduced a trap composed of 162 places in 325 ms of which 1 ms to minimize.
[2024-05-31 04:09:13] [INFO ] Deduced a trap composed of 154 places in 298 ms of which 1 ms to minimize.
[2024-05-31 04:09:14] [INFO ] Deduced a trap composed of 162 places in 261 ms of which 0 ms to minimize.
[2024-05-31 04:09:14] [INFO ] Deduced a trap composed of 160 places in 241 ms of which 1 ms to minimize.
[2024-05-31 04:09:14] [INFO ] Deduced a trap composed of 160 places in 244 ms of which 1 ms to minimize.
[2024-05-31 04:09:15] [INFO ] Deduced a trap composed of 158 places in 220 ms of which 0 ms to minimize.
[2024-05-31 04:09:15] [INFO ] Deduced a trap composed of 154 places in 221 ms of which 1 ms to minimize.
[2024-05-31 04:09:15] [INFO ] Deduced a trap composed of 156 places in 217 ms of which 0 ms to minimize.
[2024-05-31 04:09:15] [INFO ] Deduced a trap composed of 160 places in 241 ms of which 1 ms to minimize.
[2024-05-31 04:09:16] [INFO ] Deduced a trap composed of 162 places in 212 ms of which 0 ms to minimize.
[2024-05-31 04:09:16] [INFO ] Deduced a trap composed of 164 places in 211 ms of which 0 ms to minimize.
[2024-05-31 04:09:16] [INFO ] Deduced a trap composed of 156 places in 213 ms of which 0 ms to minimize.
[2024-05-31 04:09:17] [INFO ] Deduced a trap composed of 162 places in 238 ms of which 0 ms to minimize.
[2024-05-31 04:09:17] [INFO ] Deduced a trap composed of 170 places in 219 ms of which 0 ms to minimize.
[2024-05-31 04:09:17] [INFO ] Deduced a trap composed of 160 places in 269 ms of which 1 ms to minimize.
[2024-05-31 04:09:18] [INFO ] Deduced a trap composed of 158 places in 250 ms of which 1 ms to minimize.
[2024-05-31 04:09:18] [INFO ] Deduced a trap composed of 158 places in 246 ms of which 1 ms to minimize.
[2024-05-31 04:09:18] [INFO ] Deduced a trap composed of 160 places in 254 ms of which 1 ms to minimize.
[2024-05-31 04:09:19] [INFO ] Deduced a trap composed of 160 places in 257 ms of which 0 ms to minimize.
[2024-05-31 04:09:19] [INFO ] Deduced a trap composed of 158 places in 227 ms of which 1 ms to minimize.
[2024-05-31 04:09:19] [INFO ] Deduced a trap composed of 158 places in 239 ms of which 0 ms to minimize.
[2024-05-31 04:09:20] [INFO ] Deduced a trap composed of 162 places in 256 ms of which 1 ms to minimize.
[2024-05-31 04:09:20] [INFO ] Deduced a trap composed of 156 places in 274 ms of which 1 ms to minimize.
[2024-05-31 04:09:21] [INFO ] Deduced a trap composed of 160 places in 239 ms of which 1 ms to minimize.
[2024-05-31 04:09:21] [INFO ] Deduced a trap composed of 166 places in 247 ms of which 0 ms to minimize.
[2024-05-31 04:09:21] [INFO ] Deduced a trap composed of 160 places in 255 ms of which 1 ms to minimize.
[2024-05-31 04:09:21] [INFO ] Deduced a trap composed of 160 places in 232 ms of which 1 ms to minimize.
[2024-05-31 04:09:22] [INFO ] Deduced a trap composed of 162 places in 230 ms of which 1 ms to minimize.
[2024-05-31 04:09:22] [INFO ] Deduced a trap composed of 158 places in 261 ms of which 1 ms to minimize.
[2024-05-31 04:09:22] [INFO ] Deduced a trap composed of 158 places in 230 ms of which 1 ms to minimize.
[2024-05-31 04:09:23] [INFO ] Deduced a trap composed of 156 places in 247 ms of which 0 ms to minimize.
[2024-05-31 04:09:23] [INFO ] Deduced a trap composed of 154 places in 227 ms of which 1 ms to minimize.
[2024-05-31 04:09:23] [INFO ] Deduced a trap composed of 158 places in 233 ms of which 1 ms to minimize.
[2024-05-31 04:09:23] [INFO ] Deduced a trap composed of 156 places in 235 ms of which 0 ms to minimize.
[2024-05-31 04:09:24] [INFO ] Deduced a trap composed of 154 places in 205 ms of which 0 ms to minimize.
[2024-05-31 04:09:24] [INFO ] Deduced a trap composed of 156 places in 235 ms of which 0 ms to minimize.
[2024-05-31 04:09:24] [INFO ] Deduced a trap composed of 164 places in 215 ms of which 0 ms to minimize.
[2024-05-31 04:09:24] [INFO ] Deduced a trap composed of 156 places in 184 ms of which 0 ms to minimize.
[2024-05-31 04:09:25] [INFO ] Deduced a trap composed of 158 places in 210 ms of which 0 ms to minimize.
[2024-05-31 04:09:25] [INFO ] Deduced a trap composed of 160 places in 219 ms of which 0 ms to minimize.
[2024-05-31 04:09:25] [INFO ] Deduced a trap composed of 156 places in 227 ms of which 1 ms to minimize.
[2024-05-31 04:09:26] [INFO ] Deduced a trap composed of 152 places in 242 ms of which 0 ms to minimize.
[2024-05-31 04:09:26] [INFO ] Deduced a trap composed of 158 places in 215 ms of which 1 ms to minimize.
[2024-05-31 04:09:26] [INFO ] Deduced a trap composed of 158 places in 264 ms of which 0 ms to minimize.
[2024-05-31 04:09:28] [INFO ] Deduced a trap composed of 158 places in 282 ms of which 1 ms to minimize.
[2024-05-31 04:09:28] [INFO ] Deduced a trap composed of 160 places in 236 ms of which 1 ms to minimize.
[2024-05-31 04:09:29] [INFO ] Deduced a trap composed of 156 places in 230 ms of which 1 ms to minimize.
[2024-05-31 04:09:38] [INFO ] Trap strengthening (SAT) tested/added 151/151 trap constraints in 57427 ms
[2024-05-31 04:09:38] [INFO ] After 58024ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2024-05-31 04:09:38] [INFO ] After 58109ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
FORMULA PolyORBNT-COL-S10J20-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 8 simplifications.
FORMULA PolyORBNT-COL-S10J20-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)||(p0&&F(G(p1)))))))'
Support contains 2 out of 474 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 1035/1035 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 464 transition count 1035
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 463 transition count 1034
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 463 transition count 1034
Applied a total of 12 rules in 41 ms. Remains 463 /474 variables (removed 11) and now considering 1034/1035 (removed 1) transitions.
[2024-05-31 04:09:39] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 463 cols
[2024-05-31 04:09:39] [INFO ] Computed 62 invariants in 15 ms
[2024-05-31 04:09:40] [INFO ] Dead Transitions using invariants and state equation in 815 ms found 0 transitions.
[2024-05-31 04:09:40] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
[2024-05-31 04:09:40] [INFO ] Invariant cache hit.
[2024-05-31 04:09:40] [INFO ] Implicit Places using invariants in 353 ms returned []
[2024-05-31 04:09:40] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
[2024-05-31 04:09:40] [INFO ] Invariant cache hit.
[2024-05-31 04:09:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:09:42] [INFO ] Implicit Places using invariants and state equation in 2279 ms returned []
Implicit Place search using SMT with State Equation took 2641 ms to find 0 implicit places.
[2024-05-31 04:09:42] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
[2024-05-31 04:09:42] [INFO ] Invariant cache hit.
[2024-05-31 04:09:43] [INFO ] Dead Transitions using invariants and state equation in 556 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 463/474 places, 1034/1035 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4070 ms. Remains : 463/474 places, 1034/1035 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 379 ms :[(NOT p0), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : PolyORBNT-COL-S10J20-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=p1, acceptance={} source=5 dest: 5}, { cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(LT s410 1), p1:(GEQ s140 2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 2 ms.
FORMULA PolyORBNT-COL-S10J20-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J20-LTLFireability-02 finished in 4567 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 474 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 1035/1035 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 464 transition count 1035
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 463 transition count 1034
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 463 transition count 1034
Applied a total of 12 rules in 15 ms. Remains 463 /474 variables (removed 11) and now considering 1034/1035 (removed 1) transitions.
[2024-05-31 04:09:43] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
[2024-05-31 04:09:43] [INFO ] Invariant cache hit.
[2024-05-31 04:09:44] [INFO ] Dead Transitions using invariants and state equation in 620 ms found 0 transitions.
[2024-05-31 04:09:44] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
[2024-05-31 04:09:44] [INFO ] Invariant cache hit.
[2024-05-31 04:09:44] [INFO ] Implicit Places using invariants in 336 ms returned []
[2024-05-31 04:09:44] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
[2024-05-31 04:09:44] [INFO ] Invariant cache hit.
[2024-05-31 04:09:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:09:46] [INFO ] Implicit Places using invariants and state equation in 1601 ms returned []
Implicit Place search using SMT with State Equation took 1986 ms to find 0 implicit places.
[2024-05-31 04:09:46] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
[2024-05-31 04:09:46] [INFO ] Invariant cache hit.
[2024-05-31 04:09:46] [INFO ] Dead Transitions using invariants and state equation in 532 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 463/474 places, 1034/1035 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3156 ms. Remains : 463/474 places, 1034/1035 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S10J20-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(LT s414 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 32835 reset in 781 ms.
Product exploration explored 100000 steps with 32797 reset in 590 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]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 152 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 11 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=11 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 144 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 463 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 463/463 places, 1034/1034 transitions.
Applied a total of 0 rules in 8 ms. Remains 463 /463 variables (removed 0) and now considering 1034/1034 (removed 0) transitions.
[2024-05-31 04:09:48] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
[2024-05-31 04:09:48] [INFO ] Invariant cache hit.
[2024-05-31 04:09:49] [INFO ] Dead Transitions using invariants and state equation in 566 ms found 0 transitions.
[2024-05-31 04:09:49] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
[2024-05-31 04:09:49] [INFO ] Invariant cache hit.
[2024-05-31 04:09:49] [INFO ] Implicit Places using invariants in 346 ms returned []
[2024-05-31 04:09:49] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
[2024-05-31 04:09:49] [INFO ] Invariant cache hit.
[2024-05-31 04:09:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:09:51] [INFO ] Implicit Places using invariants and state equation in 2035 ms returned []
Implicit Place search using SMT with State Equation took 2387 ms to find 0 implicit places.
[2024-05-31 04:09:51] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
[2024-05-31 04:09:51] [INFO ] Invariant cache hit.
[2024-05-31 04:09:52] [INFO ] Dead Transitions using invariants and state equation in 481 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3456 ms. Remains : 463/463 places, 1034/1034 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]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 183 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 12 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=12 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 165 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 32871 reset in 645 ms.
Product exploration explored 100000 steps with 32775 reset in 511 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 463 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 463/463 places, 1034/1034 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 463 transition count 1034
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 24 place count 463 transition count 1035
Deduced a syphon composed of 25 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 463 transition count 1035
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 52 places in 0 ms
Iterating global reduction 1 with 27 rules applied. Total rules applied 52 place count 463 transition count 1035
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 76 place count 439 transition count 1011
Deduced a syphon composed of 28 places in 1 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 100 place count 439 transition count 1011
Deduced a syphon composed of 28 places in 0 ms
Applied a total of 100 rules in 139 ms. Remains 439 /463 variables (removed 24) and now considering 1011/1034 (removed 23) transitions.
[2024-05-31 04:09:54] [INFO ] Flow matrix only has 1002 transitions (discarded 9 similar events)
// Phase 1: matrix 1002 rows 439 cols
[2024-05-31 04:09:54] [INFO ] Computed 62 invariants in 26 ms
[2024-05-31 04:09:55] [INFO ] Dead Transitions using invariants and state equation in 778 ms found 0 transitions.
[2024-05-31 04:09:55] [INFO ] Redundant transitions in 12 ms returned []
[2024-05-31 04:09:55] [INFO ] Flow matrix only has 1002 transitions (discarded 9 similar events)
[2024-05-31 04:09:55] [INFO ] Invariant cache hit.
[2024-05-31 04:09:56] [INFO ] Dead Transitions using invariants and state equation in 629 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 439/463 places, 1011/1034 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1567 ms. Remains : 439/463 places, 1011/1034 transitions.
Built C files in :
/tmp/ltsmin17685137278564879542
[2024-05-31 04:09:56] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17685137278564879542
Running compilation step : cd /tmp/ltsmin17685137278564879542;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2365 ms.
Running link step : cd /tmp/ltsmin17685137278564879542;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 69 ms.
Running LTSmin : cd /tmp/ltsmin17685137278564879542;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2846558482245378535.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 463 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 463/463 places, 1034/1034 transitions.
Applied a total of 0 rules in 13 ms. Remains 463 /463 variables (removed 0) and now considering 1034/1034 (removed 0) transitions.
[2024-05-31 04:10:11] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 463 cols
[2024-05-31 04:10:11] [INFO ] Computed 62 invariants in 15 ms
[2024-05-31 04:10:11] [INFO ] Dead Transitions using invariants and state equation in 445 ms found 0 transitions.
[2024-05-31 04:10:11] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
[2024-05-31 04:10:11] [INFO ] Invariant cache hit.
[2024-05-31 04:10:12] [INFO ] Implicit Places using invariants in 380 ms returned []
[2024-05-31 04:10:12] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
[2024-05-31 04:10:12] [INFO ] Invariant cache hit.
[2024-05-31 04:10:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:10:13] [INFO ] Implicit Places using invariants and state equation in 1665 ms returned []
Implicit Place search using SMT with State Equation took 2047 ms to find 0 implicit places.
[2024-05-31 04:10:13] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
[2024-05-31 04:10:13] [INFO ] Invariant cache hit.
[2024-05-31 04:10:14] [INFO ] Dead Transitions using invariants and state equation in 676 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3190 ms. Remains : 463/463 places, 1034/1034 transitions.
Built C files in :
/tmp/ltsmin4424740067623248597
[2024-05-31 04:10:14] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4424740067623248597
Running compilation step : cd /tmp/ltsmin4424740067623248597;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1840 ms.
Running link step : cd /tmp/ltsmin4424740067623248597;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 71 ms.
Running LTSmin : cd /tmp/ltsmin4424740067623248597;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3271709495115412617.hoa' '--buchi-type=spotba'
LTSmin run took 1035 ms.
FORMULA PolyORBNT-COL-S10J20-LTLFireability-03 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property PolyORBNT-COL-S10J20-LTLFireability-03 finished in 33942 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 243 out of 474 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 474/474 places, 1035/1035 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 464 transition count 1031
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 460 transition count 1031
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 8 place count 460 transition count 1007
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 56 place count 436 transition count 1007
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 57 place count 435 transition count 1006
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 435 transition count 1006
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 62 place count 433 transition count 1004
Applied a total of 62 rules in 56 ms. Remains 433 /474 variables (removed 41) and now considering 1004/1035 (removed 31) transitions.
[2024-05-31 04:10:17] [INFO ] Flow matrix only has 995 transitions (discarded 9 similar events)
// Phase 1: matrix 995 rows 433 cols
[2024-05-31 04:10:17] [INFO ] Computed 62 invariants in 13 ms
[2024-05-31 04:10:18] [INFO ] Dead Transitions using invariants and state equation in 551 ms found 0 transitions.
[2024-05-31 04:10:18] [INFO ] Flow matrix only has 995 transitions (discarded 9 similar events)
[2024-05-31 04:10:18] [INFO ] Invariant cache hit.
[2024-05-31 04:10:18] [INFO ] Implicit Places using invariants in 201 ms returned []
[2024-05-31 04:10:18] [INFO ] Flow matrix only has 995 transitions (discarded 9 similar events)
[2024-05-31 04:10:18] [INFO ] Invariant cache hit.
[2024-05-31 04:10:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:10:20] [INFO ] Implicit Places using invariants and state equation in 1630 ms returned []
Implicit Place search using SMT with State Equation took 1836 ms to find 0 implicit places.
[2024-05-31 04:10:20] [INFO ] Redundant transitions in 20 ms returned []
[2024-05-31 04:10:20] [INFO ] Flow matrix only has 995 transitions (discarded 9 similar events)
[2024-05-31 04:10:20] [INFO ] Invariant cache hit.
[2024-05-31 04:10:20] [INFO ] Dead Transitions using invariants and state equation in 621 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 433/474 places, 1004/1035 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3103 ms. Remains : 433/474 places, 1004/1035 transitions.
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : PolyORBNT-COL-S10J20-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (OR (LT s139 1) (LT s140 1) (LT s150 9)) (OR (LT s139 1) (LT s145 1) (LT s150 9)) (OR (LT s139 1) (LT s146 1) (LT s150 9)) (OR (LT s139 1) (LT s14...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-COL-S10J20-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J20-LTLFireability-07 finished in 3303 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(G(p1))))'
Support contains 253 out of 474 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 1035/1035 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 473 transition count 1034
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 473 transition count 1034
Applied a total of 2 rules in 14 ms. Remains 473 /474 variables (removed 1) and now considering 1034/1035 (removed 1) transitions.
[2024-05-31 04:10:20] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 473 cols
[2024-05-31 04:10:20] [INFO ] Computed 72 invariants in 26 ms
[2024-05-31 04:10:21] [INFO ] Dead Transitions using invariants and state equation in 625 ms found 0 transitions.
[2024-05-31 04:10:21] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
[2024-05-31 04:10:21] [INFO ] Invariant cache hit.
[2024-05-31 04:10:21] [INFO ] Implicit Places using invariants in 319 ms returned []
[2024-05-31 04:10:21] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
[2024-05-31 04:10:21] [INFO ] Invariant cache hit.
[2024-05-31 04:10:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:10:23] [INFO ] Implicit Places using invariants and state equation in 1688 ms returned []
Implicit Place search using SMT with State Equation took 2010 ms to find 0 implicit places.
[2024-05-31 04:10:23] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
[2024-05-31 04:10:23] [INFO ] Invariant cache hit.
[2024-05-31 04:10:24] [INFO ] Dead Transitions using invariants and state equation in 670 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 473/474 places, 1034/1035 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3322 ms. Remains : 473/474 places, 1034/1035 transitions.
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBNT-COL-S10J20-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (GEQ s261 1) (GEQ s436 1)) (AND (GEQ s202 1) (GEQ s430 1)) (AND (GEQ s320 1) (GEQ s442 1)) (AND (GEQ s205 1) (GEQ s431 1)) (AND (GEQ s306 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 16 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-COL-S10J20-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J20-LTLFireability-10 finished in 3499 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((p0||((!p1&&F(!p2)) U p3))&&(((!p1&&F(!p2)) U p3)||G(!p2))))))'
Support contains 34 out of 474 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 474/474 places, 1035/1035 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 464 transition count 1011
Reduce places removed 24 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 25 rules applied. Total rules applied 49 place count 440 transition count 1010
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 439 transition count 1010
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 50 place count 439 transition count 985
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 100 place count 414 transition count 985
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 102 place count 413 transition count 984
Applied a total of 102 rules in 82 ms. Remains 413 /474 variables (removed 61) and now considering 984/1035 (removed 51) transitions.
[2024-05-31 04:10:24] [INFO ] Flow matrix only has 975 transitions (discarded 9 similar events)
// Phase 1: matrix 975 rows 413 cols
[2024-05-31 04:10:24] [INFO ] Computed 62 invariants in 22 ms
[2024-05-31 04:10:25] [INFO ] Dead Transitions using invariants and state equation in 570 ms found 0 transitions.
[2024-05-31 04:10:25] [INFO ] Flow matrix only has 975 transitions (discarded 9 similar events)
[2024-05-31 04:10:25] [INFO ] Invariant cache hit.
[2024-05-31 04:10:25] [INFO ] Implicit Places using invariants in 372 ms returned []
[2024-05-31 04:10:25] [INFO ] Flow matrix only has 975 transitions (discarded 9 similar events)
[2024-05-31 04:10:25] [INFO ] Invariant cache hit.
[2024-05-31 04:10:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:10:26] [INFO ] Implicit Places using invariants and state equation in 1448 ms returned []
Implicit Place search using SMT with State Equation took 1826 ms to find 0 implicit places.
[2024-05-31 04:10:26] [INFO ] Redundant transitions in 20 ms returned []
[2024-05-31 04:10:26] [INFO ] Flow matrix only has 975 transitions (discarded 9 similar events)
[2024-05-31 04:10:26] [INFO ] Invariant cache hit.
[2024-05-31 04:10:27] [INFO ] Dead Transitions using invariants and state equation in 456 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 413/474 places, 984/1035 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2973 ms. Remains : 413/474 places, 984/1035 transitions.
Stuttering acceptance computed with spot in 367 ms :[(OR (AND (NOT p0) (NOT p3)) (AND p2 (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND p2 (NOT p3))), (AND (NOT p3) p2), (AND p2 (NOT p3)), (AND p2 (NOT p3))]
Running random walk in product with property : PolyORBNT-COL-S10J20-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(OR p3 (NOT p1) (AND p0 (NOT p2))), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p3) p1 (NOT p0)) (AND (NOT p3) p1 p2)), acceptance={0, 1} source=0 dest: 0}, { cond=(OR (AND (NOT p3) (NOT p1) (NOT p0)) (AND (NOT p3) (NOT p1) p2)), acceptance={0, 1} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p1) p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) (NOT p1) p0 (NOT p2)), acceptance={1} source=0 dest: 3}, { cond=(AND (NOT p3) p1 p0 (NOT p2)), acceptance={1} source=0 dest: 4}], [{ cond=(AND (NOT p3) p1 p0 (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(OR (AND (NOT p3) p1 (NOT p0)) (AND (NOT p3) p1 p2)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND (NOT p3) (NOT p1) p0 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(OR (AND (NOT p3) (NOT p1) (NOT p0)) (AND (NOT p3) (NOT p1) p2)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p1) p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p3) (NOT p1) p0 (NOT p2)), acceptance={1} source=1 dest: 3}, { cond=(AND (NOT p3) p1 p0 (NOT p2)), acceptance={1} source=1 dest: 4}], [{ cond=(AND p3 p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={0, 1} source=2 dest: 2}], [{ cond=(AND (NOT p3) p1 p2), acceptance={0, 1} source=3 dest: 0}, { cond=(AND (NOT p3) (NOT p1) p2), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p3) (NOT p1) p2), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p3) (NOT p1) (NOT p2)), acceptance={1} source=3 dest: 3}, { cond=(AND (NOT p3) p1 (NOT p2)), acceptance={1} source=3 dest: 4}], [{ cond=(OR (AND p3 p2) (AND (NOT p1) p2)), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p3) p1 p2), acceptance={0, 1} source=4 dest: 0}, { cond=(AND (NOT p3) (NOT p1) p2), acceptance={0, 1} source=4 dest: 1}, { cond=(AND (NOT p3) (NOT p1) p2), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p3) (NOT p1) (NOT p2)), acceptance={1} source=4 dest: 3}, { cond=(OR (AND p3 (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p3) p1 (NOT p2)), acceptance={1} source=4 dest: 4}]], initial=0, aps=[p3:(OR (AND (GEQ s362 1) (GEQ s387 1)) (AND (GEQ s366 1) (GEQ s378 1)) (AND (GEQ s367 1) (GEQ s392 1)) (AND (GEQ s362 1) (GEQ s395 1)) (AND (GEQ s371 1) (...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 32 steps with 0 reset in 15 ms.
FORMULA PolyORBNT-COL-S10J20-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J20-LTLFireability-11 finished in 3402 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 474 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 474/474 places, 1035/1035 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 464 transition count 1011
Reduce places removed 24 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 25 rules applied. Total rules applied 49 place count 440 transition count 1010
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 439 transition count 1010
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 50 place count 439 transition count 985
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 100 place count 414 transition count 985
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 104 place count 412 transition count 983
Applied a total of 104 rules in 82 ms. Remains 412 /474 variables (removed 62) and now considering 983/1035 (removed 52) transitions.
[2024-05-31 04:10:27] [INFO ] Flow matrix only has 974 transitions (discarded 9 similar events)
// Phase 1: matrix 974 rows 412 cols
[2024-05-31 04:10:27] [INFO ] Computed 62 invariants in 20 ms
[2024-05-31 04:10:28] [INFO ] Dead Transitions using invariants and state equation in 575 ms found 0 transitions.
[2024-05-31 04:10:28] [INFO ] Flow matrix only has 974 transitions (discarded 9 similar events)
[2024-05-31 04:10:28] [INFO ] Invariant cache hit.
[2024-05-31 04:10:28] [INFO ] Implicit Places using invariants in 389 ms returned []
[2024-05-31 04:10:28] [INFO ] Flow matrix only has 974 transitions (discarded 9 similar events)
[2024-05-31 04:10:28] [INFO ] Invariant cache hit.
[2024-05-31 04:10:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:10:30] [INFO ] Implicit Places using invariants and state equation in 1914 ms returned []
Implicit Place search using SMT with State Equation took 2307 ms to find 0 implicit places.
[2024-05-31 04:10:30] [INFO ] Redundant transitions in 21 ms returned []
[2024-05-31 04:10:30] [INFO ] Flow matrix only has 974 transitions (discarded 9 similar events)
[2024-05-31 04:10:30] [INFO ] Invariant cache hit.
[2024-05-31 04:10:31] [INFO ] Dead Transitions using invariants and state equation in 454 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 412/474 places, 983/1035 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3462 ms. Remains : 412/474 places, 983/1035 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S10J20-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s135 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-COL-S10J20-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J20-LTLFireability-12 finished in 3542 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F((p0&&X(p0)))) U (p1 U (G(p1)||(p1&&G(!p2))))))'
Support contains 244 out of 474 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 1035/1035 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 464 transition count 1035
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 463 transition count 1034
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 463 transition count 1034
Applied a total of 12 rules in 13 ms. Remains 463 /474 variables (removed 11) and now considering 1034/1035 (removed 1) transitions.
[2024-05-31 04:10:31] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 463 cols
[2024-05-31 04:10:31] [INFO ] Computed 62 invariants in 11 ms
[2024-05-31 04:10:31] [INFO ] Dead Transitions using invariants and state equation in 491 ms found 0 transitions.
[2024-05-31 04:10:31] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
[2024-05-31 04:10:31] [INFO ] Invariant cache hit.
[2024-05-31 04:10:32] [INFO ] Implicit Places using invariants in 158 ms returned []
[2024-05-31 04:10:32] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
[2024-05-31 04:10:32] [INFO ] Invariant cache hit.
[2024-05-31 04:10:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:10:33] [INFO ] Implicit Places using invariants and state equation in 1662 ms returned []
Implicit Place search using SMT with State Equation took 1847 ms to find 0 implicit places.
[2024-05-31 04:10:33] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
[2024-05-31 04:10:33] [INFO ] Invariant cache hit.
[2024-05-31 04:10:34] [INFO ] Dead Transitions using invariants and state equation in 466 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 463/474 places, 1034/1035 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2850 ms. Remains : 463/474 places, 1034/1035 transitions.
Stuttering acceptance computed with spot in 244 ms :[(NOT p1), (NOT p0), (AND (NOT p1) p2), (NOT p0), (AND (NOT p0) p2 p1), (AND (NOT p0) p2 p1)]
Running random walk in product with property : PolyORBNT-COL-S10J20-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND p2 p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={0, 1} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}, { cond=p0, acceptance={0, 1} source=1 dest: 3}], [{ cond=(AND p2 p1), acceptance={0} source=2 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0, 1} source=3 dest: 1}], [{ cond=(AND p2 p1 (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND p2 p0), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={} source=4 dest: 5}], [{ cond=(AND p2 p1 (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=5 dest: 4}]], initial=0, aps=[p2:(OR (AND (GEQ s261 1) (GEQ s426 1)) (AND (GEQ s202 1) (GEQ s420 1)) (AND (GEQ s320 1) (GEQ s432 1)) (AND (GEQ s205 1) (GEQ s421 1)) (AND (GEQ s306 1) (...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 11141 reset in 3882 ms.
Product exploration explored 100000 steps with 11128 reset in 4092 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) p1 (NOT p0)), (X (NOT (AND p2 (NOT p1)))), (X (NOT p0)), (X (NOT (AND p2 p1))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p0))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT (AND p2 p1))))]
False Knowledge obtained : [(X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p1))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p1)), (X p1), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0)))))]
Knowledge based reduction with 10 factoid took 846 ms. Reduced automaton from 6 states, 19 edges and 3 AP (stutter sensitive) to 6 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 270 ms :[(NOT p1), (NOT p0), (AND (NOT p1) p2), (NOT p0), (AND (NOT p0) p1 p2), (AND (NOT p0) p1 p2)]
Incomplete random walk after 10000 steps, including 560 resets, run finished after 1015 ms. (steps per millisecond=9 ) properties (out of 10) seen :4
Incomplete Best-First random walk after 10001 steps, including 120 resets, run finished after 300 ms. (steps per millisecond=33 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 325 ms. (steps per millisecond=30 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 120 resets, run finished after 379 ms. (steps per millisecond=26 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 472 ms. (steps per millisecond=21 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-31 04:10:46] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
[2024-05-31 04:10:46] [INFO ] Invariant cache hit.
[2024-05-31 04:10:48] [INFO ] [Real]Absence check using 56 positive place invariants in 21 ms returned sat
[2024-05-31 04:10:48] [INFO ] [Real]Absence check using 56 positive and 6 generalized place invariants in 19 ms returned sat
[2024-05-31 04:10:48] [INFO ] After 178ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:1
[2024-05-31 04:10:48] [INFO ] [Nat]Absence check using 56 positive place invariants in 16 ms returned sat
[2024-05-31 04:10:48] [INFO ] [Nat]Absence check using 56 positive and 6 generalized place invariants in 13 ms returned sat
[2024-05-31 04:10:48] [INFO ] After 150ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT (AND p2 (NOT p1)))), (X (NOT p0)), (X (NOT (AND p2 p1))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p0))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT (AND p2 p1)))), (G (NOT (AND p1 (NOT p0) p2))), (G (NOT (AND p1 p2))), (G (NOT (AND p0 p2)))]
False Knowledge obtained : [(X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p1))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p1)), (X p1), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (F (AND (NOT p1) p2)), (F p0), (F (AND (NOT p1) (NOT p2))), (F (NOT (AND p1 (NOT p2)))), (F (NOT p1)), (F (NOT (AND p1 (NOT p0) (NOT p2)))), (F (AND p0 (NOT p2)))]
Knowledge based reduction with 13 factoid took 1107 ms. Reduced automaton from 6 states, 19 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p1) p2), (NOT p0), p2, (NOT p0)]
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p1) p2), (NOT p0), p2, (NOT p0)]
Support contains 244 out of 463 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 463/463 places, 1034/1034 transitions.
Applied a total of 0 rules in 4 ms. Remains 463 /463 variables (removed 0) and now considering 1034/1034 (removed 0) transitions.
[2024-05-31 04:10:49] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
[2024-05-31 04:10:49] [INFO ] Invariant cache hit.
[2024-05-31 04:10:50] [INFO ] Dead Transitions using invariants and state equation in 652 ms found 0 transitions.
[2024-05-31 04:10:50] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
[2024-05-31 04:10:50] [INFO ] Invariant cache hit.
[2024-05-31 04:10:50] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-05-31 04:10:50] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
[2024-05-31 04:10:50] [INFO ] Invariant cache hit.
[2024-05-31 04:10:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:10:52] [INFO ] Implicit Places using invariants and state equation in 1688 ms returned []
Implicit Place search using SMT with State Equation took 1847 ms to find 0 implicit places.
[2024-05-31 04:10:52] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
[2024-05-31 04:10:52] [INFO ] Invariant cache hit.
[2024-05-31 04:10:53] [INFO ] Dead Transitions using invariants and state equation in 623 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3128 ms. Remains : 463/463 places, 1034/1034 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) (NOT p2)), (X (NOT p2)), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 5 factoid took 209 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p1) p2), (NOT p0), p2, (NOT p0)]
Incomplete random walk after 10000 steps, including 560 resets, run finished after 380 ms. (steps per millisecond=26 ) properties (out of 3) seen :1
Finished Best-First random walk after 326 steps, including 0 resets, run visited all 2 properties in 11 ms. (steps per millisecond=29 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F (NOT p1)), (F p2), (F p0)]
Knowledge based reduction with 5 factoid took 236 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 229 ms :[(OR (NOT p1) p2), (NOT p0), p2, (NOT p0)]
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p1) p2), (NOT p0), p2, (NOT p0)]
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p1) p2), (NOT p0), p2, (NOT p0)]
Stuttering criterion allowed to conclude after 36434 steps with 2038 reset in 897 ms.
FORMULA PolyORBNT-COL-S10J20-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J20-LTLFireability-14 finished in 24267 ms.
All properties solved by simple procedures.
Total runtime 225833 ms.

BK_STOP 1717128656185

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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="PolyORBNT-COL-S10J20"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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 gold2023"
echo " Input is PolyORBNT-COL-S10J20, 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 r307-tajo-171654460800253"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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