Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r060-tall-165254772200532.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is DatabaseWithMutex-COL-10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r060-tall-165254772200532
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 256K
-rw-r--r-- 1 mcc users 6.6K Apr 30 05:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Apr 30 05:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 30 05:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 30 05:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 9 07:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 07:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 07:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 07:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_pt
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 5 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 27K May 10 09:33 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 DatabaseWithMutex-COL-10-LTLFireability-00
FORMULA_NAME DatabaseWithMutex-COL-10-LTLFireability-01
FORMULA_NAME DatabaseWithMutex-COL-10-LTLFireability-02
FORMULA_NAME DatabaseWithMutex-COL-10-LTLFireability-03
FORMULA_NAME DatabaseWithMutex-COL-10-LTLFireability-04
FORMULA_NAME DatabaseWithMutex-COL-10-LTLFireability-05
FORMULA_NAME DatabaseWithMutex-COL-10-LTLFireability-06
FORMULA_NAME DatabaseWithMutex-COL-10-LTLFireability-07
FORMULA_NAME DatabaseWithMutex-COL-10-LTLFireability-08
FORMULA_NAME DatabaseWithMutex-COL-10-LTLFireability-09
FORMULA_NAME DatabaseWithMutex-COL-10-LTLFireability-10
FORMULA_NAME DatabaseWithMutex-COL-10-LTLFireability-11
FORMULA_NAME DatabaseWithMutex-COL-10-LTLFireability-12
FORMULA_NAME DatabaseWithMutex-COL-10-LTLFireability-13
FORMULA_NAME DatabaseWithMutex-COL-10-LTLFireability-14
FORMULA_NAME DatabaseWithMutex-COL-10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652614533183

Running Version 202205111006
[2022-05-15 11:35:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 11:35:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 11:35:35] [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.
[2022-05-15 11:35:35] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-15 11:35:35] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 543 ms
[2022-05-15 11:35:35] [INFO ] Imported 11 HL places and 8 HL transitions for a total of 830 PT places and 800.0 transition bindings in 17 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2022-05-15 11:35:35] [INFO ] Built PT skeleton of HLPN with 11 places and 8 transitions 22 arcs in 5 ms.
[2022-05-15 11:35:35] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 3 formulas.
FORMULA DatabaseWithMutex-COL-10-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-COL-10-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-COL-10-LTLFireability-09 FALSE 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
Finished random walk after 189 steps, including 0 resets, run visited all 6 properties in 14 ms. (steps per millisecond=13 )
[2022-05-15 11:35:35] [INFO ] Flatten gal took : 15 ms
[2022-05-15 11:35:35] [INFO ] Flatten gal took : 6 ms
Transition Release forces synchronizations/join behavior on parameter s of sort site
Transition Acquire forces synchronizations/join behavior on parameter f of sort file
[2022-05-15 11:35:35] [INFO ] Unfolded HLPN to a Petri net with 830 places and 800 transitions 3800 arcs in 29 ms.
[2022-05-15 11:35:35] [INFO ] Unfolded 13 HLPN properties in 0 ms.
Initial state reduction rules removed 1 formulas.
[2022-05-15 11:35:35] [INFO ] Reduced 90 identical enabling conditions.
[2022-05-15 11:35:35] [INFO ] Reduced 90 identical enabling conditions.
[2022-05-15 11:35:35] [INFO ] Reduced 90 identical enabling conditions.
[2022-05-15 11:35:35] [INFO ] Reduced 90 identical enabling conditions.
[2022-05-15 11:35:35] [INFO ] Reduced 90 identical enabling conditions.
[2022-05-15 11:35:35] [INFO ] Reduced 90 identical enabling conditions.
[2022-05-15 11:35:35] [INFO ] Reduced 90 identical enabling conditions.
[2022-05-15 11:35:35] [INFO ] Reduced 90 identical enabling conditions.
FORMULA DatabaseWithMutex-COL-10-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 830 out of 830 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Applied a total of 0 rules in 15 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
// Phase 1: matrix 800 rows 830 cols
[2022-05-15 11:35:36] [INFO ] Computed 130 place invariants in 52 ms
[2022-05-15 11:35:36] [INFO ] Implicit Places using invariants in 342 ms returned []
// Phase 1: matrix 800 rows 830 cols
[2022-05-15 11:35:36] [INFO ] Computed 130 place invariants in 26 ms
[2022-05-15 11:35:36] [INFO ] Implicit Places using invariants and state equation in 444 ms returned []
Implicit Place search using SMT with State Equation took 812 ms to find 0 implicit places.
// Phase 1: matrix 800 rows 830 cols
[2022-05-15 11:35:36] [INFO ] Computed 130 place invariants in 29 ms
[2022-05-15 11:35:37] [INFO ] Dead Transitions using invariants and state equation in 611 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 830/830 places, 800/800 transitions.
Support contains 830 out of 830 places after structural reductions.
[2022-05-15 11:35:37] [INFO ] Flatten gal took : 144 ms
[2022-05-15 11:35:37] [INFO ] Flatten gal took : 112 ms
[2022-05-15 11:35:38] [INFO ] Input system was already deterministic with 800 transitions.
Finished random walk after 212 steps, including 0 resets, run visited all 11 properties in 21 ms. (steps per millisecond=10 )
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 110 out of 830 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Applied a total of 0 rules in 70 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
// Phase 1: matrix 800 rows 830 cols
[2022-05-15 11:35:38] [INFO ] Computed 130 place invariants in 9 ms
[2022-05-15 11:35:39] [INFO ] Implicit Places using invariants in 483 ms returned [110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 492 ms to find 100 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 730/830 places, 800/800 transitions.
Applied a total of 0 rules in 22 ms. Remains 730 /730 variables (removed 0) and now considering 800/800 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 730/830 places, 800/800 transitions.
Stuttering acceptance computed with spot in 388 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DatabaseWithMutex-COL-10-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s115 1) (GEQ s695 1)) (AND (GEQ s112 1) (GEQ s722 1)) (AND (GEQ s117 1) (GEQ s727 1)) (AND (GEQ s116 1) (GEQ s656 1)) (AND (GEQ s113 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 993 ms.
Product exploration explored 100000 steps with 50000 reset in 897 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 2 factoid took 110 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA DatabaseWithMutex-COL-10-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DatabaseWithMutex-COL-10-LTLFireability-01 finished in 3105 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(((G(F(p1))&&G(X(p2)))||p0)))'
Support contains 410 out of 830 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Applied a total of 0 rules in 52 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
// Phase 1: matrix 800 rows 830 cols
[2022-05-15 11:35:41] [INFO ] Computed 130 place invariants in 11 ms
[2022-05-15 11:35:42] [INFO ] Implicit Places using invariants in 203 ms returned []
// Phase 1: matrix 800 rows 830 cols
[2022-05-15 11:35:42] [INFO ] Computed 130 place invariants in 10 ms
[2022-05-15 11:35:42] [INFO ] Implicit Places using invariants and state equation in 462 ms returned []
Implicit Place search using SMT with State Equation took 669 ms to find 0 implicit places.
[2022-05-15 11:35:42] [INFO ] Redundant transitions in 45 ms returned []
// Phase 1: matrix 800 rows 830 cols
[2022-05-15 11:35:42] [INFO ] Computed 130 place invariants in 13 ms
[2022-05-15 11:35:42] [INFO ] Dead Transitions using invariants and state equation in 438 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 830/830 places, 800/800 transitions.
Stuttering acceptance computed with spot in 95 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DatabaseWithMutex-COL-10-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(OR (AND (GEQ s202 1) (GEQ s522 1) (GEQ s532 1) (GEQ s542 1) (GEQ s552 1) (GEQ s562 1) (GEQ s572 1) (GEQ s582 1) (GEQ s592 1) (GEQ s602 1)) (AND (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2853 reset in 1666 ms.
Product exploration explored 100000 steps with 2835 reset in 1695 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND p2 (NOT p0)))), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 300 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 531 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Finished random walk after 4974 steps, including 1 resets, run visited all 4 properties in 128 ms. (steps per millisecond=38 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND p2 (NOT p0)))), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p2)), (F (AND (NOT p0) (NOT p1) p2)), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 9 factoid took 450 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 73 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 110 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 800 rows 830 cols
[2022-05-15 11:35:48] [INFO ] Computed 130 place invariants in 8 ms
[2022-05-15 11:35:51] [INFO ] [Real]Absence check using 29 positive place invariants in 54 ms returned sat
[2022-05-15 11:35:52] [INFO ] [Real]Absence check using 29 positive and 101 generalized place invariants in 519 ms returned sat
[2022-05-15 11:35:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 11:36:03] [INFO ] [Real]Absence check using state equation in 11296 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p2))
// Phase 1: matrix 800 rows 830 cols
[2022-05-15 11:36:03] [INFO ] Computed 130 place invariants in 6 ms
[2022-05-15 11:36:05] [INFO ] [Real]Absence check using 29 positive place invariants in 22 ms returned sat
[2022-05-15 11:36:05] [INFO ] [Real]Absence check using 29 positive and 101 generalized place invariants in 198 ms returned sat
[2022-05-15 11:36:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 11:36:07] [INFO ] [Real]Absence check using state equation in 2066 ms returned sat
[2022-05-15 11:36:07] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 11:36:08] [INFO ] [Nat]Absence check using 29 positive place invariants in 24 ms returned sat
[2022-05-15 11:36:08] [INFO ] [Nat]Absence check using 29 positive and 101 generalized place invariants in 193 ms returned sat
[2022-05-15 11:36:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 11:36:10] [INFO ] [Nat]Absence check using state equation in 2195 ms returned sat
[2022-05-15 11:36:11] [INFO ] Computed and/alt/rep : 600/1400/600 causal constraints (skipped 100 transitions) in 41 ms.
[2022-05-15 11:36:14] [INFO ] Added : 300 causal constraints over 60 iterations in 3856 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 410 out of 830 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Applied a total of 0 rules in 37 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
// Phase 1: matrix 800 rows 830 cols
[2022-05-15 11:36:14] [INFO ] Computed 130 place invariants in 8 ms
[2022-05-15 11:36:15] [INFO ] Implicit Places using invariants in 209 ms returned []
// Phase 1: matrix 800 rows 830 cols
[2022-05-15 11:36:15] [INFO ] Computed 130 place invariants in 5 ms
[2022-05-15 11:36:15] [INFO ] Implicit Places using invariants and state equation in 491 ms returned []
Implicit Place search using SMT with State Equation took 703 ms to find 0 implicit places.
[2022-05-15 11:36:15] [INFO ] Redundant transitions in 18 ms returned []
// Phase 1: matrix 800 rows 830 cols
[2022-05-15 11:36:15] [INFO ] Computed 130 place invariants in 13 ms
[2022-05-15 11:36:16] [INFO ] Dead Transitions using invariants and state equation in 422 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 830/830 places, 800/800 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 324 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 75 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Finished random walk after 1747 steps, including 0 resets, run visited all 4 properties in 30 ms. (steps per millisecond=58 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F (AND (NOT p0) p2)), (F (AND (NOT p1) (NOT p0) p2)), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 9 factoid took 373 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 68 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 89 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 800 rows 830 cols
[2022-05-15 11:36:17] [INFO ] Computed 130 place invariants in 12 ms
[2022-05-15 11:36:20] [INFO ] [Real]Absence check using 29 positive place invariants in 38 ms returned sat
[2022-05-15 11:36:21] [INFO ] [Real]Absence check using 29 positive and 101 generalized place invariants in 506 ms returned sat
[2022-05-15 11:36:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 11:36:32] [INFO ] [Real]Absence check using state equation in 11447 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p2))
// Phase 1: matrix 800 rows 830 cols
[2022-05-15 11:36:32] [INFO ] Computed 130 place invariants in 8 ms
[2022-05-15 11:36:33] [INFO ] [Real]Absence check using 29 positive place invariants in 23 ms returned sat
[2022-05-15 11:36:34] [INFO ] [Real]Absence check using 29 positive and 101 generalized place invariants in 199 ms returned sat
[2022-05-15 11:36:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 11:36:36] [INFO ] [Real]Absence check using state equation in 2055 ms returned sat
[2022-05-15 11:36:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 11:36:37] [INFO ] [Nat]Absence check using 29 positive place invariants in 25 ms returned sat
[2022-05-15 11:36:37] [INFO ] [Nat]Absence check using 29 positive and 101 generalized place invariants in 184 ms returned sat
[2022-05-15 11:36:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 11:36:39] [INFO ] [Nat]Absence check using state equation in 2220 ms returned sat
[2022-05-15 11:36:39] [INFO ] Computed and/alt/rep : 600/1400/600 causal constraints (skipped 100 transitions) in 52 ms.
[2022-05-15 11:36:43] [INFO ] Added : 300 causal constraints over 60 iterations in 3940 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 68 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 2870 reset in 1935 ms.
Product exploration explored 100000 steps with 2866 reset in 1941 ms.
Built C files in :
/tmp/ltsmin2645909717613055377
[2022-05-15 11:36:47] [INFO ] Computing symmetric may disable matrix : 800 transitions.
[2022-05-15 11:36:47] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 11:36:47] [INFO ] Computing symmetric may enable matrix : 800 transitions.
[2022-05-15 11:36:47] [INFO ] Computation of Complete enable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 11:36:47] [INFO ] Computing Do-Not-Accords matrix : 800 transitions.
[2022-05-15 11:36:48] [INFO ] Computation of Completed DNA matrix. took 23 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 11:36:48] [INFO ] Built C files in 216ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2645909717613055377
Running compilation step : cd /tmp/ltsmin2645909717613055377;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2374 ms.
Running link step : cd /tmp/ltsmin2645909717613055377;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 63 ms.
Running LTSmin : cd /tmp/ltsmin2645909717613055377;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14828947142262922254.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 410 out of 830 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Applied a total of 0 rules in 28 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
// Phase 1: matrix 800 rows 830 cols
[2022-05-15 11:37:02] [INFO ] Computed 130 place invariants in 4 ms
[2022-05-15 11:37:03] [INFO ] Implicit Places using invariants in 184 ms returned []
// Phase 1: matrix 800 rows 830 cols
[2022-05-15 11:37:03] [INFO ] Computed 130 place invariants in 5 ms
[2022-05-15 11:37:03] [INFO ] Implicit Places using invariants and state equation in 480 ms returned []
Implicit Place search using SMT with State Equation took 669 ms to find 0 implicit places.
[2022-05-15 11:37:03] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 800 rows 830 cols
[2022-05-15 11:37:03] [INFO ] Computed 130 place invariants in 6 ms
[2022-05-15 11:37:04] [INFO ] Dead Transitions using invariants and state equation in 451 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 830/830 places, 800/800 transitions.
Built C files in :
/tmp/ltsmin6906320559334190340
[2022-05-15 11:37:04] [INFO ] Computing symmetric may disable matrix : 800 transitions.
[2022-05-15 11:37:04] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 11:37:04] [INFO ] Computing symmetric may enable matrix : 800 transitions.
[2022-05-15 11:37:04] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 11:37:04] [INFO ] Computing Do-Not-Accords matrix : 800 transitions.
[2022-05-15 11:37:04] [INFO ] Computation of Completed DNA matrix. took 19 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 11:37:04] [INFO ] Built C files in 187ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6906320559334190340
Running compilation step : cd /tmp/ltsmin6906320559334190340;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2336 ms.
Running link step : cd /tmp/ltsmin6906320559334190340;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin6906320559334190340;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11535396049163344866.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-15 11:37:19] [INFO ] Flatten gal took : 60 ms
[2022-05-15 11:37:19] [INFO ] Flatten gal took : 52 ms
[2022-05-15 11:37:19] [INFO ] Time to serialize gal into /tmp/LTL18070069293082533408.gal : 10 ms
[2022-05-15 11:37:19] [INFO ] Time to serialize properties into /tmp/LTL4598018073605716554.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18070069293082533408.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4598018073605716554.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1807006...267
Read 1 LTL properties
Checking formula 0 : !((F(("(((((((MesBuffReply_32>=1)||(MesBuffReply_93>=1))||((MesBuffReply_28>=1)||(MesBuffReply_40>=1)))||(((MesBuffReply_97>=1)||(MesB...28935
Formula 0 simplified : !F("(((((((MesBuffReply_32>=1)||(MesBuffReply_93>=1))||((MesBuffReply_28>=1)||(MesBuffReply_40>=1)))||(((MesBuffReply_97>=1)||(MesBu...28915
Detected timeout of ITS tools.
[2022-05-15 11:37:34] [INFO ] Flatten gal took : 49 ms
[2022-05-15 11:37:34] [INFO ] Applying decomposition
[2022-05-15 11:37:34] [INFO ] Flatten gal took : 47 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph3929561501322826531.txt' '-o' '/tmp/graph3929561501322826531.bin' '-w' '/tmp/graph3929561501322826531.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3929561501322826531.bin' '-l' '-1' '-v' '-w' '/tmp/graph3929561501322826531.weights' '-q' '0' '-e' '0.001'
[2022-05-15 11:37:34] [INFO ] Decomposing Gal with order
[2022-05-15 11:37:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 11:37:34] [INFO ] Removed a total of 1690 redundant transitions.
[2022-05-15 11:37:34] [INFO ] Flatten gal took : 167 ms
[2022-05-15 11:37:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 17 ms.
[2022-05-15 11:37:35] [INFO ] Time to serialize gal into /tmp/LTL6999308215759890265.gal : 13 ms
[2022-05-15 11:37:35] [INFO ] Time to serialize properties into /tmp/LTL12224300868047269415.ltl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6999308215759890265.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12224300868047269415.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6999308...246
Read 1 LTL properties
Checking formula 0 : !((F(("(((((((i20.u130.MesBuffReply_32>=1)||(i27.u214.MesBuffReply_93>=1))||((i25.u181.MesBuffReply_28>=1)||(i21.u186.MesBuffReply_40>...40439
Formula 0 simplified : !F("(((((((i20.u130.MesBuffReply_32>=1)||(i27.u214.MesBuffReply_93>=1))||((i25.u181.MesBuffReply_28>=1)||(i21.u186.MesBuffReply_40>=...40419
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12050523702304348992
[2022-05-15 11:37:50] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12050523702304348992
Running compilation step : cd /tmp/ltsmin12050523702304348992;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1557 ms.
Running link step : cd /tmp/ltsmin12050523702304348992;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin12050523702304348992;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((([](<>((LTLAPp1==true)))&&[](X((LTLAPp2==true))))||(LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DatabaseWithMutex-COL-10-LTLFireability-02 finished in 143459 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((G((G(p1)&&(F(p2)||G(p2))))&&p0))))'
Support contains 210 out of 830 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Applied a total of 0 rules in 9 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
// Phase 1: matrix 800 rows 830 cols
[2022-05-15 11:38:05] [INFO ] Computed 130 place invariants in 7 ms
[2022-05-15 11:38:05] [INFO ] Implicit Places using invariants in 508 ms returned [110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 510 ms to find 100 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 730/830 places, 800/800 transitions.
Applied a total of 0 rules in 7 ms. Remains 730 /730 variables (removed 0) and now considering 800/800 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 730/830 places, 800/800 transitions.
Stuttering acceptance computed with spot in 183 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : DatabaseWithMutex-COL-10-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (OR (LT s1 1) (LT s520 1)) (OR (LT s60 1) (LT s526 1)) (OR (LT s36 1) (LT s523 1)) (OR (LT s74 1) (LT s527 1)) (OR (LT s15 1) (LT s521 1)) (OR (LT...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 530 reset in 641 ms.
Product exploration explored 100000 steps with 611 reset in 633 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (OR (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND p0 p1)), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X p1)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p0 p1))), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 1218 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (OR (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 800 rows 730 cols
[2022-05-15 11:38:09] [INFO ] Computed 30 place invariants in 19 ms
[2022-05-15 11:38:09] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (OR (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND p0 p1)), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X p1)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p0 p1))), (X (X p2)), (G (NOT (AND p0 p1 (NOT p2))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p2)), (F (AND p1 (NOT p2))), (F (OR (NOT p0) (NOT p1))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 11 factoid took 1368 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 4 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 302 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (OR (NOT p1) (NOT p2))]
Support contains 210 out of 730 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 730/730 places, 800/800 transitions.
Applied a total of 0 rules in 8 ms. Remains 730 /730 variables (removed 0) and now considering 800/800 (removed 0) transitions.
// Phase 1: matrix 800 rows 730 cols
[2022-05-15 11:38:11] [INFO ] Computed 30 place invariants in 14 ms
[2022-05-15 11:38:11] [INFO ] Implicit Places using invariants in 305 ms returned []
// Phase 1: matrix 800 rows 730 cols
[2022-05-15 11:38:11] [INFO ] Computed 30 place invariants in 11 ms
[2022-05-15 11:38:13] [INFO ] Implicit Places using invariants and state equation in 2074 ms returned []
Implicit Place search using SMT with State Equation took 2380 ms to find 0 implicit places.
// Phase 1: matrix 800 rows 730 cols
[2022-05-15 11:38:13] [INFO ] Computed 30 place invariants in 11 ms
[2022-05-15 11:38:14] [INFO ] Dead Transitions using invariants and state equation in 459 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 730/730 places, 800/800 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p0 p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 314 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 4 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 415 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (OR (NOT p1) (NOT p2))]
Finished random walk after 41 steps, including 0 resets, run visited all 5 properties in 3 ms. (steps per millisecond=13 )
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p0 p1)))]
False Knowledge obtained : [(F (AND (NOT p2) p1)), (F (NOT p1)), (F (OR (NOT p0) (NOT p1))), (F (NOT p2)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 7 factoid took 620 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 4 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 360 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 245 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (OR (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 441 reset in 618 ms.
Product exploration explored 100000 steps with 432 reset in 640 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 203 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (OR (NOT p1) (NOT p2))]
Support contains 210 out of 730 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 730/730 places, 800/800 transitions.
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 730 transition count 800
Deduced a syphon composed of 100 places in 0 ms
Applied a total of 100 rules in 67 ms. Remains 730 /730 variables (removed 0) and now considering 800/800 (removed 0) transitions.
[2022-05-15 11:38:18] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 800 rows 730 cols
[2022-05-15 11:38:18] [INFO ] Computed 30 place invariants in 16 ms
[2022-05-15 11:38:18] [INFO ] Dead Transitions using invariants and state equation in 458 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 730/730 places, 800/800 transitions.
Finished structural reductions, in 1 iterations. Remains : 730/730 places, 800/800 transitions.
Product exploration explored 100000 steps with 620 reset in 672 ms.
Product exploration explored 100000 steps with 666 reset in 713 ms.
Built C files in :
/tmp/ltsmin16832214624892249786
[2022-05-15 11:38:20] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16832214624892249786
Running compilation step : cd /tmp/ltsmin16832214624892249786;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1444 ms.
Running link step : cd /tmp/ltsmin16832214624892249786;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin16832214624892249786;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8158767519202857905.hoa' '--buchi-type=spotba'
LTSmin run took 460 ms.
FORMULA DatabaseWithMutex-COL-10-LTLFireability-03 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DatabaseWithMutex-COL-10-LTLFireability-03 finished in 16785 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X(G(!(X(F(X(!p0))) U p1))))))'
Support contains 110 out of 830 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Drop transitions removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 830 transition count 700
Reduce places removed 110 places and 0 transitions.
Drop transitions removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 1 with 210 rules applied. Total rules applied 310 place count 720 transition count 600
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 2 with 100 rules applied. Total rules applied 410 place count 620 transition count 600
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 410 place count 620 transition count 500
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 610 place count 520 transition count 500
Applied a total of 610 rules in 45 ms. Remains 520 /830 variables (removed 310) and now considering 500/800 (removed 300) transitions.
// Phase 1: matrix 500 rows 520 cols
[2022-05-15 11:38:22] [INFO ] Computed 120 place invariants in 7 ms
[2022-05-15 11:38:22] [INFO ] Implicit Places using invariants in 142 ms returned []
// Phase 1: matrix 500 rows 520 cols
[2022-05-15 11:38:22] [INFO ] Computed 120 place invariants in 10 ms
[2022-05-15 11:38:22] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 466 ms to find 0 implicit places.
[2022-05-15 11:38:22] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 500 rows 520 cols
[2022-05-15 11:38:22] [INFO ] Computed 120 place invariants in 4 ms
[2022-05-15 11:38:22] [INFO ] Dead Transitions using invariants and state equation in 276 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 520/830 places, 500/800 transitions.
Finished structural reductions, in 1 iterations. Remains : 520/830 places, 500/800 transitions.
Stuttering acceptance computed with spot in 1594 ms :[p1]
Running random walk in product with property : DatabaseWithMutex-COL-10-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(OR (GEQ s1 1) (GEQ s0 1) (GEQ s3 1) (GEQ s2 1) (GEQ s6 1) (GEQ s4 1) (GEQ s7 1) (GEQ s5 1) (GEQ s8 1) (GEQ s9 1) (GEQ s291 1) (GEQ s226 1) (GEQ s287 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 710 ms.
Product exploration explored 100000 steps with 0 reset in 809 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 : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 124 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 41 ms :[p1]
Finished random walk after 68 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=34 )
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 155 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 25 ms :[p1]
Stuttering acceptance computed with spot in 40 ms :[p1]
// Phase 1: matrix 500 rows 520 cols
[2022-05-15 11:38:26] [INFO ] Computed 120 place invariants in 9 ms
[2022-05-15 11:38:27] [INFO ] [Real]Absence check using 19 positive place invariants in 15 ms returned sat
[2022-05-15 11:38:27] [INFO ] [Real]Absence check using 19 positive and 101 generalized place invariants in 264 ms returned sat
[2022-05-15 11:38:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 11:38:27] [INFO ] [Real]Absence check using state equation in 599 ms returned sat
[2022-05-15 11:38:27] [INFO ] Computed and/alt/rep : 300/1100/300 causal constraints (skipped 100 transitions) in 30 ms.
[2022-05-15 11:38:28] [INFO ] Added : 1 causal constraints over 1 iterations in 123 ms. Result :sat
Could not prove EG p1
Support contains 110 out of 520 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 520/520 places, 500/500 transitions.
Applied a total of 0 rules in 9 ms. Remains 520 /520 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 520 cols
[2022-05-15 11:38:28] [INFO ] Computed 120 place invariants in 9 ms
[2022-05-15 11:38:28] [INFO ] Implicit Places using invariants in 150 ms returned []
// Phase 1: matrix 500 rows 520 cols
[2022-05-15 11:38:28] [INFO ] Computed 120 place invariants in 6 ms
[2022-05-15 11:38:28] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 450 ms to find 0 implicit places.
[2022-05-15 11:38:28] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 500 rows 520 cols
[2022-05-15 11:38:28] [INFO ] Computed 120 place invariants in 3 ms
[2022-05-15 11:38:28] [INFO ] Dead Transitions using invariants and state equation in 279 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 520/520 places, 500/500 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 : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 25 ms :[p1]
Finished random walk after 79 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=39 )
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 26 ms :[p1]
Stuttering acceptance computed with spot in 27 ms :[p1]
// Phase 1: matrix 500 rows 520 cols
[2022-05-15 11:38:29] [INFO ] Computed 120 place invariants in 5 ms
[2022-05-15 11:38:29] [INFO ] [Real]Absence check using 19 positive place invariants in 16 ms returned sat
[2022-05-15 11:38:30] [INFO ] [Real]Absence check using 19 positive and 101 generalized place invariants in 271 ms returned sat
[2022-05-15 11:38:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 11:38:30] [INFO ] [Real]Absence check using state equation in 641 ms returned sat
[2022-05-15 11:38:30] [INFO ] Computed and/alt/rep : 300/1100/300 causal constraints (skipped 100 transitions) in 31 ms.
[2022-05-15 11:38:30] [INFO ] Added : 1 causal constraints over 1 iterations in 126 ms. Result :sat
Could not prove EG p1
Stuttering acceptance computed with spot in 45 ms :[p1]
Product exploration explored 100000 steps with 0 reset in 634 ms.
Product exploration explored 100000 steps with 0 reset in 814 ms.
Built C files in :
/tmp/ltsmin12674484734853936377
[2022-05-15 11:38:32] [INFO ] Computing symmetric may disable matrix : 500 transitions.
[2022-05-15 11:38:32] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 11:38:32] [INFO ] Computing symmetric may enable matrix : 500 transitions.
[2022-05-15 11:38:32] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 11:38:32] [INFO ] Computing Do-Not-Accords matrix : 500 transitions.
[2022-05-15 11:38:32] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 11:38:32] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12674484734853936377
Running compilation step : cd /tmp/ltsmin12674484734853936377;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1219 ms.
Running link step : cd /tmp/ltsmin12674484734853936377;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin12674484734853936377;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13453661017004278075.hoa' '--buchi-type=spotba'
LTSmin run took 1209 ms.
FORMULA DatabaseWithMutex-COL-10-LTLFireability-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DatabaseWithMutex-COL-10-LTLFireability-05 finished in 12949 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 100 out of 830 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Drop transitions removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 830 transition count 700
Reduce places removed 110 places and 0 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 1 with 310 rules applied. Total rules applied 410 place count 720 transition count 500
Reduce places removed 200 places and 0 transitions.
Iterating post reduction 2 with 200 rules applied. Total rules applied 610 place count 520 transition count 500
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 610 place count 520 transition count 400
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 810 place count 420 transition count 400
Applied a total of 810 rules in 37 ms. Remains 420 /830 variables (removed 410) and now considering 400/800 (removed 400) transitions.
// Phase 1: matrix 400 rows 420 cols
[2022-05-15 11:38:35] [INFO ] Computed 120 place invariants in 3 ms
[2022-05-15 11:38:35] [INFO ] Implicit Places using invariants in 800 ms returned [10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219]
[2022-05-15 11:38:35] [INFO ] Actually due to overlaps returned [120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 803 ms to find 100 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 320/830 places, 400/800 transitions.
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 320 transition count 300
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 200 place count 220 transition count 300
Applied a total of 200 rules in 8 ms. Remains 220 /320 variables (removed 100) and now considering 300/400 (removed 100) transitions.
// Phase 1: matrix 300 rows 220 cols
[2022-05-15 11:38:35] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-15 11:38:35] [INFO ] Implicit Places using invariants in 78 ms returned []
// Phase 1: matrix 300 rows 220 cols
[2022-05-15 11:38:35] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-15 11:38:36] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 220/830 places, 300/800 transitions.
Finished structural reductions, in 2 iterations. Remains : 220/830 places, 300/800 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : DatabaseWithMutex-COL-10-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s91 1) (GEQ s26 1) (GEQ s87 1) (GEQ s22 1) (GEQ s99 1) (GEQ s34 1) (GEQ s95 1) (GEQ s30 1) (GEQ s107 1) (GEQ s42 1) (GEQ s103 1) (GEQ s38 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 358 ms.
Stack based approach found an accepted trace after 5139 steps with 0 reset with depth 5140 and stack size 5095 in 26 ms.
FORMULA DatabaseWithMutex-COL-10-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property DatabaseWithMutex-COL-10-LTLFireability-06 finished in 1509 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(p1)))'
Support contains 110 out of 830 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Drop transitions removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 830 transition count 700
Reduce places removed 110 places and 0 transitions.
Drop transitions removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 1 with 210 rules applied. Total rules applied 310 place count 720 transition count 600
Reduce places removed 100 places and 0 transitions.
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Iterating post reduction 2 with 200 rules applied. Total rules applied 510 place count 620 transition count 500
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 3 with 100 rules applied. Total rules applied 610 place count 520 transition count 500
Applied a total of 610 rules in 30 ms. Remains 520 /830 variables (removed 310) and now considering 500/800 (removed 300) transitions.
// Phase 1: matrix 500 rows 520 cols
[2022-05-15 11:38:36] [INFO ] Computed 120 place invariants in 11 ms
[2022-05-15 11:38:36] [INFO ] Implicit Places using invariants in 420 ms returned [10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 421 ms to find 100 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 420/830 places, 500/800 transitions.
Applied a total of 0 rules in 10 ms. Remains 420 /420 variables (removed 0) and now considering 500/500 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 420/830 places, 500/800 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DatabaseWithMutex-COL-10-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(OR (GEQ s61 1) (GEQ s57 1) (GEQ s69 1) (GEQ s65 1) (GEQ s77 1) (GEQ s73 1) (GEQ s85 1) (GEQ s81 1) (GEQ s20 1) (GEQ s93 1) (GEQ s24 1) (GEQ s89 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 6463 reset in 744 ms.
Product exploration explored 100000 steps with 6458 reset in 771 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 p1) (NOT p0)), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 676 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 80 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Finished random walk after 45 steps, including 0 resets, run visited all 5 properties in 2 ms. (steps per millisecond=22 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1)), (F p1), (F (AND p0 (NOT p1))), (F p0)]
Knowledge based reduction with 11 factoid took 1178 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 131 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 85 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
// Phase 1: matrix 500 rows 420 cols
[2022-05-15 11:38:40] [INFO ] Computed 20 place invariants in 19 ms
[2022-05-15 11:38:41] [INFO ] [Real]Absence check using 18 positive place invariants in 24 ms returned sat
[2022-05-15 11:38:41] [INFO ] [Real]Absence check using 18 positive and 2 generalized place invariants in 23 ms returned sat
[2022-05-15 11:38:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 11:38:42] [INFO ] [Real]Absence check using state equation in 1452 ms returned sat
[2022-05-15 11:38:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 11:38:42] [INFO ] [Nat]Absence check using 18 positive place invariants in 21 ms returned sat
[2022-05-15 11:38:42] [INFO ] [Nat]Absence check using 18 positive and 2 generalized place invariants in 20 ms returned sat
[2022-05-15 11:38:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 11:38:43] [INFO ] [Nat]Absence check using state equation in 795 ms returned sat
[2022-05-15 11:38:43] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 3 ms to minimize.
[2022-05-15 11:38:43] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 1 ms to minimize.
[2022-05-15 11:38:44] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 2 ms to minimize.
[2022-05-15 11:38:44] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 1 ms to minimize.
[2022-05-15 11:38:44] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 1 ms to minimize.
[2022-05-15 11:38:44] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 3 ms to minimize.
[2022-05-15 11:38:44] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 1 ms to minimize.
[2022-05-15 11:38:44] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2022-05-15 11:38:44] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 0 ms to minimize.
[2022-05-15 11:38:44] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2022-05-15 11:38:45] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 1 ms to minimize.
[2022-05-15 11:38:45] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1372 ms
[2022-05-15 11:38:45] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1372 ms
[2022-05-15 11:38:45] [INFO ] Computed and/alt/rep : 400/2000/400 causal constraints (skipped 0 transitions) in 47 ms.
[2022-05-15 11:38:46] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 0 ms to minimize.
[2022-05-15 11:38:46] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 0 ms to minimize.
[2022-05-15 11:38:46] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 1 ms to minimize.
[2022-05-15 11:38:47] [INFO ] Deduced a trap composed of 15 places in 361 ms of which 1 ms to minimize.
[2022-05-15 11:38:47] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 1 ms to minimize.
[2022-05-15 11:38:47] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 0 ms to minimize.
[2022-05-15 11:38:48] [INFO ] Deduced a trap composed of 15 places in 542 ms of which 0 ms to minimize.
[2022-05-15 11:38:48] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 1 ms to minimize.
[2022-05-15 11:38:48] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 0 ms to minimize.
[2022-05-15 11:38:48] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 1 ms to minimize.
[2022-05-15 11:38:48] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2022-05-15 11:38:48] [INFO ] Trap strengthening procedure interrupted after too many repetitions 2140 ms
[2022-05-15 11:38:48] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2140 ms
[2022-05-15 11:38:48] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
[2022-05-15 11:38:48] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 1 ms to minimize.
[2022-05-15 11:38:49] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 1 ms to minimize.
[2022-05-15 11:38:49] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2022-05-15 11:38:49] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 0 ms to minimize.
[2022-05-15 11:38:49] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 0 ms to minimize.
[2022-05-15 11:38:49] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2022-05-15 11:38:49] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 0 ms to minimize.
[2022-05-15 11:38:49] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2022-05-15 11:38:49] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 0 ms to minimize.
[2022-05-15 11:38:50] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 0 ms to minimize.
[2022-05-15 11:38:50] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1358 ms
[2022-05-15 11:38:50] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1358 ms
[2022-05-15 11:38:50] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 5 ms to minimize.
[2022-05-15 11:38:50] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 1 ms to minimize.
[2022-05-15 11:38:50] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 0 ms to minimize.
[2022-05-15 11:38:50] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
[2022-05-15 11:38:50] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 0 ms to minimize.
[2022-05-15 11:38:50] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 0 ms to minimize.
[2022-05-15 11:38:50] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 0 ms to minimize.
[2022-05-15 11:38:51] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 1 ms to minimize.
[2022-05-15 11:38:51] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 0 ms to minimize.
[2022-05-15 11:38:51] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 0 ms to minimize.
[2022-05-15 11:38:51] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 0 ms to minimize.
[2022-05-15 11:38:51] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1319 ms
[2022-05-15 11:38:51] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1319 ms
[2022-05-15 11:38:51] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 0 ms to minimize.
[2022-05-15 11:38:51] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 0 ms to minimize.
[2022-05-15 11:38:51] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 0 ms to minimize.
[2022-05-15 11:38:51] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 0 ms to minimize.
[2022-05-15 11:38:52] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2022-05-15 11:38:52] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 0 ms to minimize.
[2022-05-15 11:38:52] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2022-05-15 11:38:52] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2022-05-15 11:38:52] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 0 ms to minimize.
[2022-05-15 11:38:52] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 0 ms to minimize.
[2022-05-15 11:38:52] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2022-05-15 11:38:52] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1272 ms
[2022-05-15 11:38:52] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1272 ms
[2022-05-15 11:38:52] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 4 ms to minimize.
[2022-05-15 11:38:53] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 0 ms to minimize.
[2022-05-15 11:38:53] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 0 ms to minimize.
[2022-05-15 11:38:53] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 0 ms to minimize.
[2022-05-15 11:38:53] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2022-05-15 11:38:53] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 0 ms to minimize.
[2022-05-15 11:38:53] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 0 ms to minimize.
[2022-05-15 11:38:53] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 0 ms to minimize.
[2022-05-15 11:38:53] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 0 ms to minimize.
[2022-05-15 11:38:54] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2022-05-15 11:38:54] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2022-05-15 11:38:54] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1331 ms
[2022-05-15 11:38:54] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1331 ms
[2022-05-15 11:38:54] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 0 ms to minimize.
[2022-05-15 11:38:54] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2022-05-15 11:38:54] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 5 ms to minimize.
[2022-05-15 11:38:54] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 0 ms to minimize.
[2022-05-15 11:38:54] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 0 ms to minimize.
[2022-05-15 11:38:54] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 13 ms to minimize.
[2022-05-15 11:38:54] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 0 ms to minimize.
[2022-05-15 11:38:55] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 0 ms to minimize.
[2022-05-15 11:38:55] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 0 ms to minimize.
[2022-05-15 11:38:55] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 0 ms to minimize.
[2022-05-15 11:38:55] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2022-05-15 11:38:55] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1308 ms
[2022-05-15 11:38:55] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1308 ms
[2022-05-15 11:38:55] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2022-05-15 11:38:55] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 1 ms to minimize.
[2022-05-15 11:38:55] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 0 ms to minimize.
[2022-05-15 11:38:55] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2022-05-15 11:38:56] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 0 ms to minimize.
[2022-05-15 11:38:56] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2022-05-15 11:38:56] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 0 ms to minimize.
[2022-05-15 11:38:56] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 0 ms to minimize.
[2022-05-15 11:38:56] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 3 ms to minimize.
[2022-05-15 11:38:56] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 1 ms to minimize.
[2022-05-15 11:38:56] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 0 ms to minimize.
[2022-05-15 11:38:57] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 0 ms to minimize.
[2022-05-15 11:38:57] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2022-05-15 11:38:57] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2022-05-15 11:38:57] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 0 ms to minimize.
[2022-05-15 11:38:57] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 0 ms to minimize.
[2022-05-15 11:38:57] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 0 ms to minimize.
[2022-05-15 11:38:57] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 0 ms to minimize.
[2022-05-15 11:38:57] [INFO ] Trap strengthening procedure interrupted after too many repetitions 2248 ms
[2022-05-15 11:38:57] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2248 ms
[2022-05-15 11:38:57] [INFO ] Deduced a trap composed of 16 places in 199 ms of which 0 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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:521)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:677)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:652)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:348)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:322)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:78)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:686)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-05-15 11:38:57] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
// Phase 1: matrix 500 rows 420 cols
[2022-05-15 11:38:57] [INFO ] Computed 20 place invariants in 14 ms
[2022-05-15 11:38:58] [INFO ] [Real]Absence check using 18 positive place invariants in 28 ms returned sat
[2022-05-15 11:38:58] [INFO ] [Real]Absence check using 18 positive and 2 generalized place invariants in 13 ms returned sat
[2022-05-15 11:38:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 11:38:59] [INFO ] [Real]Absence check using state equation in 1167 ms returned sat
[2022-05-15 11:38:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 11:38:59] [INFO ] [Nat]Absence check using 18 positive place invariants in 37 ms returned sat
[2022-05-15 11:39:00] [INFO ] [Nat]Absence check using 18 positive and 2 generalized place invariants in 275 ms returned sat
[2022-05-15 11:39:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 11:39:01] [INFO ] [Nat]Absence check using state equation in 915 ms returned sat
[2022-05-15 11:39:01] [INFO ] Deduced a trap composed of 15 places in 157 ms of which 1 ms to minimize.
[2022-05-15 11:39:01] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 0 ms to minimize.
[2022-05-15 11:39:01] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 1 ms to minimize.
[2022-05-15 11:39:01] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 0 ms to minimize.
[2022-05-15 11:39:01] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 0 ms to minimize.
[2022-05-15 11:39:01] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 0 ms to minimize.
[2022-05-15 11:39:02] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 1 ms to minimize.
[2022-05-15 11:39:02] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 1 ms to minimize.
[2022-05-15 11:39:02] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 0 ms to minimize.
[2022-05-15 11:39:02] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 1 ms to minimize.
[2022-05-15 11:39:02] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 0 ms to minimize.
[2022-05-15 11:39:02] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1532 ms
[2022-05-15 11:39:02] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1532 ms
[2022-05-15 11:39:02] [INFO ] Computed and/alt/rep : 400/2000/400 causal constraints (skipped 0 transitions) in 25 ms.
[2022-05-15 11:39:05] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 0 ms to minimize.
[2022-05-15 11:39:05] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 0 ms to minimize.
[2022-05-15 11:39:05] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 1 ms to minimize.
[2022-05-15 11:39:06] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 0 ms to minimize.
[2022-05-15 11:39:06] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 0 ms to minimize.
[2022-05-15 11:39:06] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 0 ms to minimize.
[2022-05-15 11:39:07] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 0 ms to minimize.
[2022-05-15 11:39:07] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 1 ms to minimize.
[2022-05-15 11:39:07] [INFO ] Deduced a trap composed of 16 places in 124 ms of which 1 ms to minimize.
[2022-05-15 11:39:07] [INFO ] Deduced a trap composed of 16 places in 126 ms of which 1 ms to minimize.
[2022-05-15 11:39:07] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 1 ms to minimize.
[2022-05-15 11:39:07] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 1 ms to minimize.
[2022-05-15 11:39:08] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 1 ms to minimize.
[2022-05-15 11:39:08] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 0 ms to minimize.
[2022-05-15 11:39:08] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 1 ms to minimize.
[2022-05-15 11:39:08] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 1 ms to minimize.
[2022-05-15 11:39:08] [INFO ] Deduced a trap composed of 16 places in 105 ms of which 0 ms to minimize.
[2022-05-15 11:39:08] [INFO ] Deduced a trap composed of 16 places in 125 ms of which 1 ms to minimize.
[2022-05-15 11:39:08] [INFO ] Trap strengthening procedure interrupted after too many repetitions 3402 ms
[2022-05-15 11:39:08] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 3402 ms
[2022-05-15 11:39:09] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 0 ms to minimize.
[2022-05-15 11:39:09] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2022-05-15 11:39:09] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 0 ms to minimize.
[2022-05-15 11:39:10] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 0 ms to minimize.
[2022-05-15 11:39:10] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2022-05-15 11:39:10] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 0 ms to minimize.
[2022-05-15 11:39:10] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 0 ms to minimize.
[2022-05-15 11:39:10] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 0 ms to minimize.
[2022-05-15 11:39:10] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2022-05-15 11:39:10] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 0 ms to minimize.
[2022-05-15 11:39:11] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 0 ms to minimize.
[2022-05-15 11:39:11] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2022-05-15 11:39:11] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1677 ms
[2022-05-15 11:39:11] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1677 ms
[2022-05-15 11:39:12] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2022-05-15 11:39:12] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 0 ms to minimize.
[2022-05-15 11:39:12] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 0 ms to minimize.
[2022-05-15 11:39:12] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 0 ms to minimize.
[2022-05-15 11:39:13] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 1 ms to minimize.
[2022-05-15 11:39:13] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 0 ms to minimize.
[2022-05-15 11:39:13] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 0 ms to minimize.
[2022-05-15 11:39:13] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 0 ms to minimize.
[2022-05-15 11:39:13] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 0 ms to minimize.
[2022-05-15 11:39:13] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2022-05-15 11:39:13] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2022-05-15 11:39:14] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2022-05-15 11:39:14] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 0 ms to minimize.
[2022-05-15 11:39:14] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 0 ms to minimize.
[2022-05-15 11:39:14] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 0 ms to minimize.
[2022-05-15 11:39:14] [INFO ] Deduced a trap composed of 16 places in 179 ms of which 0 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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:521)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:677)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:652)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:348)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:322)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:78)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:686)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-05-15 11:39:14] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p1)
Could not prove EG (NOT p1)
Support contains 110 out of 420 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 420/420 places, 500/500 transitions.
Applied a total of 0 rules in 23 ms. Remains 420 /420 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 420 cols
[2022-05-15 11:39:14] [INFO ] Computed 20 place invariants in 9 ms
[2022-05-15 11:39:14] [INFO ] Implicit Places using invariants in 238 ms returned []
// Phase 1: matrix 500 rows 420 cols
[2022-05-15 11:39:14] [INFO ] Computed 20 place invariants in 10 ms
[2022-05-15 11:39:15] [INFO ] Implicit Places using invariants and state equation in 702 ms returned []
Implicit Place search using SMT with State Equation took 951 ms to find 0 implicit places.
[2022-05-15 11:39:15] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 500 rows 420 cols
[2022-05-15 11:39:15] [INFO ] Computed 20 place invariants in 8 ms
[2022-05-15 11:39:15] [INFO ] Dead Transitions using invariants and state equation in 280 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 420/420 places, 500/500 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 448 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 87 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Finished random walk after 80 steps, including 0 resets, run visited all 5 properties in 2 ms. (steps per millisecond=40 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1)), (F p1), (F (AND p0 (NOT p1))), (F p0)]
Knowledge based reduction with 11 factoid took 540 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 92 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 94 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
// Phase 1: matrix 500 rows 420 cols
[2022-05-15 11:39:17] [INFO ] Computed 20 place invariants in 11 ms
[2022-05-15 11:39:17] [INFO ] [Real]Absence check using 18 positive place invariants in 23 ms returned sat
[2022-05-15 11:39:17] [INFO ] [Real]Absence check using 18 positive and 2 generalized place invariants in 18 ms returned sat
[2022-05-15 11:39:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 11:39:19] [INFO ] [Real]Absence check using state equation in 1437 ms returned sat
[2022-05-15 11:39:19] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 11:39:19] [INFO ] [Nat]Absence check using 18 positive place invariants in 21 ms returned sat
[2022-05-15 11:39:19] [INFO ] [Nat]Absence check using 18 positive and 2 generalized place invariants in 20 ms returned sat
[2022-05-15 11:39:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 11:39:20] [INFO ] [Nat]Absence check using state equation in 802 ms returned sat
[2022-05-15 11:39:20] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 0 ms to minimize.
[2022-05-15 11:39:20] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2022-05-15 11:39:20] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 1 ms to minimize.
[2022-05-15 11:39:20] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 0 ms to minimize.
[2022-05-15 11:39:20] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 1 ms to minimize.
[2022-05-15 11:39:20] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 0 ms to minimize.
[2022-05-15 11:39:20] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 0 ms to minimize.
[2022-05-15 11:39:21] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 0 ms to minimize.
[2022-05-15 11:39:21] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 0 ms to minimize.
[2022-05-15 11:39:21] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 0 ms to minimize.
[2022-05-15 11:39:21] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2022-05-15 11:39:21] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1194 ms
[2022-05-15 11:39:21] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1195 ms
[2022-05-15 11:39:21] [INFO ] Computed and/alt/rep : 400/2000/400 causal constraints (skipped 0 transitions) in 24 ms.
[2022-05-15 11:39:23] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 1 ms to minimize.
[2022-05-15 11:39:23] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 0 ms to minimize.
[2022-05-15 11:39:23] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 0 ms to minimize.
[2022-05-15 11:39:23] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 0 ms to minimize.
[2022-05-15 11:39:23] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 0 ms to minimize.
[2022-05-15 11:39:23] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 1 ms to minimize.
[2022-05-15 11:39:23] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 1 ms to minimize.
[2022-05-15 11:39:23] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 0 ms to minimize.
[2022-05-15 11:39:23] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 0 ms to minimize.
[2022-05-15 11:39:24] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 0 ms to minimize.
[2022-05-15 11:39:24] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 0 ms to minimize.
[2022-05-15 11:39:24] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1267 ms
[2022-05-15 11:39:24] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1267 ms
[2022-05-15 11:39:24] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 1 ms to minimize.
[2022-05-15 11:39:24] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 1 ms to minimize.
[2022-05-15 11:39:24] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 0 ms to minimize.
[2022-05-15 11:39:24] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 0 ms to minimize.
[2022-05-15 11:39:24] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 0 ms to minimize.
[2022-05-15 11:39:24] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2022-05-15 11:39:25] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 0 ms to minimize.
[2022-05-15 11:39:25] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 0 ms to minimize.
[2022-05-15 11:39:25] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 0 ms to minimize.
[2022-05-15 11:39:25] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 0 ms to minimize.
[2022-05-15 11:39:25] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 1 ms to minimize.
[2022-05-15 11:39:25] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1321 ms
[2022-05-15 11:39:25] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1322 ms
[2022-05-15 11:39:25] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 0 ms to minimize.
[2022-05-15 11:39:25] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 0 ms to minimize.
[2022-05-15 11:39:25] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2022-05-15 11:39:26] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 0 ms to minimize.
[2022-05-15 11:39:26] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2022-05-15 11:39:26] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 0 ms to minimize.
[2022-05-15 11:39:26] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 0 ms to minimize.
[2022-05-15 11:39:26] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 0 ms to minimize.
[2022-05-15 11:39:26] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 1 ms to minimize.
[2022-05-15 11:39:26] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 0 ms to minimize.
[2022-05-15 11:39:26] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 0 ms to minimize.
[2022-05-15 11:39:26] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1300 ms
[2022-05-15 11:39:26] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1301 ms
[2022-05-15 11:39:27] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 1 ms to minimize.
[2022-05-15 11:39:27] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 0 ms to minimize.
[2022-05-15 11:39:27] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2022-05-15 11:39:27] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2022-05-15 11:39:27] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 0 ms to minimize.
[2022-05-15 11:39:27] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 0 ms to minimize.
[2022-05-15 11:39:27] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2022-05-15 11:39:27] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 1 ms to minimize.
[2022-05-15 11:39:28] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 0 ms to minimize.
[2022-05-15 11:39:28] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 0 ms to minimize.
[2022-05-15 11:39:28] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 0 ms to minimize.
[2022-05-15 11:39:28] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1335 ms
[2022-05-15 11:39:28] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1335 ms
[2022-05-15 11:39:28] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2022-05-15 11:39:28] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 0 ms to minimize.
[2022-05-15 11:39:28] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 0 ms to minimize.
[2022-05-15 11:39:28] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 0 ms to minimize.
[2022-05-15 11:39:29] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 0 ms to minimize.
[2022-05-15 11:39:29] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2022-05-15 11:39:29] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2022-05-15 11:39:29] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 0 ms to minimize.
[2022-05-15 11:39:29] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 0 ms to minimize.
[2022-05-15 11:39:29] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 0 ms to minimize.
[2022-05-15 11:39:29] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 0 ms to minimize.
[2022-05-15 11:39:29] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1306 ms
[2022-05-15 11:39:29] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1306 ms
[2022-05-15 11:39:29] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 0 ms to minimize.
[2022-05-15 11:39:29] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 0 ms to minimize.
[2022-05-15 11:39:30] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 0 ms to minimize.
[2022-05-15 11:39:30] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2022-05-15 11:39:30] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 0 ms to minimize.
[2022-05-15 11:39:30] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
[2022-05-15 11:39:30] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 0 ms to minimize.
[2022-05-15 11:39:30] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 0 ms to minimize.
[2022-05-15 11:39:30] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 0 ms to minimize.
[2022-05-15 11:39:30] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 0 ms to minimize.
[2022-05-15 11:39:30] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2022-05-15 11:39:30] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1244 ms
[2022-05-15 11:39:30] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1244 ms
[2022-05-15 11:39:31] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 0 ms to minimize.
[2022-05-15 11:39:31] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 0 ms to minimize.
[2022-05-15 11:39:31] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2022-05-15 11:39:31] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2022-05-15 11:39:31] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 0 ms to minimize.
[2022-05-15 11:39:31] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 0 ms to minimize.
[2022-05-15 11:39:31] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 0 ms to minimize.
[2022-05-15 11:39:32] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 0 ms to minimize.
[2022-05-15 11:39:32] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 0 ms to minimize.
[2022-05-15 11:39:32] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2022-05-15 11:39:32] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
[2022-05-15 11:39:32] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2022-05-15 11:39:32] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2022-05-15 11:39:32] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2022-05-15 11:39:32] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 0 ms to minimize.
[2022-05-15 11:39:32] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2022-05-15 11:39:33] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2022-05-15 11:39:33] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2022-05-15 11:39:33] [INFO ] Trap strengthening procedure interrupted after too many repetitions 2199 ms
[2022-05-15 11:39:33] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2199 ms
[2022-05-15 11:39:33] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 0 ms to minimize.
[2022-05-15 11:39:33] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 0 ms to minimize.
[2022-05-15 11:39:33] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 0 ms to minimize.
[2022-05-15 11:39:33] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2022-05-15 11:39:33] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 0 ms to minimize.
[2022-05-15 11:39:33] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2022-05-15 11:39:33] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2022-05-15 11:39:34] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 3 ms to minimize.
[2022-05-15 11:39:34] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 0 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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:521)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:677)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:652)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:356)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:322)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:78)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:686)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-05-15 11:39:34] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
// Phase 1: matrix 500 rows 420 cols
[2022-05-15 11:39:34] [INFO ] Computed 20 place invariants in 9 ms
[2022-05-15 11:39:34] [INFO ] [Real]Absence check using 18 positive place invariants in 28 ms returned sat
[2022-05-15 11:39:34] [INFO ] [Real]Absence check using 18 positive and 2 generalized place invariants in 12 ms returned sat
[2022-05-15 11:39:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 11:39:35] [INFO ] [Real]Absence check using state equation in 1137 ms returned sat
[2022-05-15 11:39:35] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 11:39:36] [INFO ] [Nat]Absence check using 18 positive place invariants in 29 ms returned sat
[2022-05-15 11:39:36] [INFO ] [Nat]Absence check using 18 positive and 2 generalized place invariants in 276 ms returned sat
[2022-05-15 11:39:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 11:39:37] [INFO ] [Nat]Absence check using state equation in 933 ms returned sat
[2022-05-15 11:39:37] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 1 ms to minimize.
[2022-05-15 11:39:37] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 1 ms to minimize.
[2022-05-15 11:39:37] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 0 ms to minimize.
[2022-05-15 11:39:37] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 1 ms to minimize.
[2022-05-15 11:39:37] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 0 ms to minimize.
[2022-05-15 11:39:38] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 1 ms to minimize.
[2022-05-15 11:39:38] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 1 ms to minimize.
[2022-05-15 11:39:38] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 0 ms to minimize.
[2022-05-15 11:39:38] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 0 ms to minimize.
[2022-05-15 11:39:38] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 0 ms to minimize.
[2022-05-15 11:39:38] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 0 ms to minimize.
[2022-05-15 11:39:38] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1464 ms
[2022-05-15 11:39:38] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1464 ms
[2022-05-15 11:39:38] [INFO ] Computed and/alt/rep : 400/2000/400 causal constraints (skipped 0 transitions) in 23 ms.
[2022-05-15 11:39:41] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 0 ms to minimize.
[2022-05-15 11:39:41] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 1 ms to minimize.
[2022-05-15 11:39:41] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 0 ms to minimize.
[2022-05-15 11:39:42] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 0 ms to minimize.
[2022-05-15 11:39:42] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 0 ms to minimize.
[2022-05-15 11:39:42] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 1 ms to minimize.
[2022-05-15 11:39:42] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 0 ms to minimize.
[2022-05-15 11:39:43] [INFO ] Deduced a trap composed of 16 places in 117 ms of which 0 ms to minimize.
[2022-05-15 11:39:43] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 0 ms to minimize.
[2022-05-15 11:39:43] [INFO ] Deduced a trap composed of 16 places in 120 ms of which 1 ms to minimize.
[2022-05-15 11:39:43] [INFO ] Deduced a trap composed of 16 places in 125 ms of which 1 ms to minimize.
[2022-05-15 11:39:43] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 0 ms to minimize.
[2022-05-15 11:39:43] [INFO ] Deduced a trap composed of 16 places in 120 ms of which 0 ms to minimize.
[2022-05-15 11:39:44] [INFO ] Deduced a trap composed of 16 places in 120 ms of which 0 ms to minimize.
[2022-05-15 11:39:44] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 1 ms to minimize.
[2022-05-15 11:39:44] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 1 ms to minimize.
[2022-05-15 11:39:44] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 0 ms to minimize.
[2022-05-15 11:39:44] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 1 ms to minimize.
[2022-05-15 11:39:44] [INFO ] Trap strengthening procedure interrupted after too many repetitions 3266 ms
[2022-05-15 11:39:44] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 3266 ms
[2022-05-15 11:39:45] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 0 ms to minimize.
[2022-05-15 11:39:45] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 0 ms to minimize.
[2022-05-15 11:39:45] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 0 ms to minimize.
[2022-05-15 11:39:45] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 0 ms to minimize.
[2022-05-15 11:39:46] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 0 ms to minimize.
[2022-05-15 11:39:46] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 1 ms to minimize.
[2022-05-15 11:39:46] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 0 ms to minimize.
[2022-05-15 11:39:46] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 0 ms to minimize.
[2022-05-15 11:39:46] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 0 ms to minimize.
[2022-05-15 11:39:46] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 0 ms to minimize.
[2022-05-15 11:39:46] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 0 ms to minimize.
[2022-05-15 11:39:46] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2022-05-15 11:39:46] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1661 ms
[2022-05-15 11:39:46] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1661 ms
[2022-05-15 11:39:47] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2022-05-15 11:39:47] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2022-05-15 11:39:48] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 0 ms to minimize.
[2022-05-15 11:39:48] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2022-05-15 11:39:48] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 1 ms to minimize.
[2022-05-15 11:39:48] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 1 ms to minimize.
[2022-05-15 11:39:49] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 0 ms to minimize.
[2022-05-15 11:39:49] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 0 ms to minimize.
[2022-05-15 11:39:49] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2022-05-15 11:39:49] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 0 ms to minimize.
[2022-05-15 11:39:49] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 0 ms to minimize.
[2022-05-15 11:39:49] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 0 ms to minimize.
[2022-05-15 11:39:49] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 0 ms to minimize.
[2022-05-15 11:39:49] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 0 ms to minimize.
[2022-05-15 11:39:49] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 0 ms to minimize.
[2022-05-15 11:39:50] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 0 ms to minimize.
[2022-05-15 11:39:50] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 0 ms to minimize.
[2022-05-15 11:39:50] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 0 ms to minimize.
[2022-05-15 11:39:50] [INFO ] Trap strengthening procedure interrupted after too many repetitions 2717 ms
[2022-05-15 11:39:50] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2717 ms
[2022-05-15 11:39:50] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 0 ms to minimize.
[2022-05-15 11:39:50] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 0 ms to minimize.
[2022-05-15 11:39:50] [INFO ] Trap strengthening (SAT) tested/added 2/2 trap constraints in 311 ms
[2022-05-15 11:39:50] [INFO ] Deduced a trap composed of 16 places in 206 ms of which 0 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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:521)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:677)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:652)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:356)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:322)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:78)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:686)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-05-15 11:39:50] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p1)
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 6456 reset in 749 ms.
Product exploration explored 100000 steps with 6458 reset in 754 ms.
Built C files in :
/tmp/ltsmin15996975309013624318
[2022-05-15 11:39:52] [INFO ] Computing symmetric may disable matrix : 500 transitions.
[2022-05-15 11:39:52] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 11:39:52] [INFO ] Computing symmetric may enable matrix : 500 transitions.
[2022-05-15 11:39:52] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 11:39:52] [INFO ] Computing Do-Not-Accords matrix : 500 transitions.
[2022-05-15 11:39:52] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 11:39:52] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15996975309013624318
Running compilation step : cd /tmp/ltsmin15996975309013624318;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1139 ms.
Running link step : cd /tmp/ltsmin15996975309013624318;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin15996975309013624318;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1945527364440484757.hoa' '--buchi-type=spotba'
LTSmin run took 3609 ms.
FORMULA DatabaseWithMutex-COL-10-LTLFireability-08 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DatabaseWithMutex-COL-10-LTLFireability-08 finished in 80964 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((G(X(p0))&&G(p0)))||G(p1)))'
Support contains 210 out of 830 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Applied a total of 0 rules in 7 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
// Phase 1: matrix 800 rows 830 cols
[2022-05-15 11:39:57] [INFO ] Computed 130 place invariants in 4 ms
[2022-05-15 11:39:57] [INFO ] Implicit Places using invariants in 457 ms returned [110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 469 ms to find 100 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 730/830 places, 800/800 transitions.
Applied a total of 0 rules in 20 ms. Remains 730 /730 variables (removed 0) and now considering 800/800 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 730/830 places, 800/800 transitions.
Stuttering acceptance computed with spot in 112 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DatabaseWithMutex-COL-10-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(OR (GEQ s352 1) (GEQ s413 1) (GEQ s348 1) (GEQ s360 1) (GEQ s417 1) (GEQ s356 1) (GEQ s368 1) (GEQ s364 1) (GEQ s376 1) (GEQ s372 1) (GEQ s323 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DatabaseWithMutex-COL-10-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-COL-10-LTLFireability-10 finished in 625 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)||G(p2)))'
Support contains 410 out of 830 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 100 Pre rules applied. Total rules applied 0 place count 830 transition count 700
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 0 with 200 rules applied. Total rules applied 200 place count 730 transition count 700
Applied a total of 200 rules in 22 ms. Remains 730 /830 variables (removed 100) and now considering 700/800 (removed 100) transitions.
// Phase 1: matrix 700 rows 730 cols
[2022-05-15 11:39:58] [INFO ] Computed 130 place invariants in 3 ms
[2022-05-15 11:39:58] [INFO ] Implicit Places using invariants in 264 ms returned []
// Phase 1: matrix 700 rows 730 cols
[2022-05-15 11:39:58] [INFO ] Computed 130 place invariants in 3 ms
[2022-05-15 11:39:58] [INFO ] Implicit Places using invariants and state equation in 440 ms returned []
Implicit Place search using SMT with State Equation took 728 ms to find 0 implicit places.
[2022-05-15 11:39:58] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 700 rows 730 cols
[2022-05-15 11:39:58] [INFO ] Computed 130 place invariants in 4 ms
[2022-05-15 11:39:59] [INFO ] Dead Transitions using invariants and state equation in 390 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 730/830 places, 700/800 transitions.
Finished structural reductions, in 1 iterations. Remains : 730/830 places, 700/800 transitions.
Stuttering acceptance computed with spot in 121 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DatabaseWithMutex-COL-10-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(OR (GEQ s551 1) (GEQ s612 1) (GEQ s555 1) (GEQ s616 1) (GEQ s543 1) (GEQ s604 1) (GEQ s547 1) (GEQ s608 1) (GEQ s567 1) (GEQ s628 1) (GEQ s571 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 6028 reset in 800 ms.
Product exploration explored 100000 steps with 6021 reset in 815 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 p1) (NOT p2) (NOT p0)), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (AND (NOT p1) p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2))))]
Knowledge based reduction with 15 factoid took 761 ms. Reduced automaton from 4 states, 9 edges and 3 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 47 ms :[(NOT p1), (NOT p1)]
Finished random walk after 11 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=11 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (AND (NOT p1) p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (F p1)]
Knowledge based reduction with 15 factoid took 556 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 29 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p1)]
// Phase 1: matrix 700 rows 730 cols
[2022-05-15 11:40:02] [INFO ] Computed 130 place invariants in 4 ms
[2022-05-15 11:40:02] [INFO ] [Real]Absence check using 29 positive place invariants in 22 ms returned sat
[2022-05-15 11:40:03] [INFO ] [Real]Absence check using 29 positive and 101 generalized place invariants in 130 ms returned sat
[2022-05-15 11:40:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 11:40:04] [INFO ] [Real]Absence check using state equation in 1818 ms returned sat
[2022-05-15 11:40:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 11:40:05] [INFO ] [Nat]Absence check using 29 positive place invariants in 19 ms returned sat
[2022-05-15 11:40:05] [INFO ] [Nat]Absence check using 29 positive and 101 generalized place invariants in 148 ms returned sat
[2022-05-15 11:40:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 11:40:08] [INFO ] [Nat]Absence check using state equation in 2616 ms returned sat
[2022-05-15 11:40:08] [INFO ] Computed and/alt/rep : 500/1300/500 causal constraints (skipped 100 transitions) in 33 ms.
[2022-05-15 11:40:13] [INFO ] Added : 450 causal constraints over 90 iterations in 5773 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 100 out of 730 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 730/730 places, 700/700 transitions.
Applied a total of 0 rules in 11 ms. Remains 730 /730 variables (removed 0) and now considering 700/700 (removed 0) transitions.
// Phase 1: matrix 700 rows 730 cols
[2022-05-15 11:40:14] [INFO ] Computed 130 place invariants in 4 ms
[2022-05-15 11:40:14] [INFO ] Implicit Places using invariants in 214 ms returned []
// Phase 1: matrix 700 rows 730 cols
[2022-05-15 11:40:14] [INFO ] Computed 130 place invariants in 4 ms
[2022-05-15 11:40:14] [INFO ] Implicit Places using invariants and state equation in 527 ms returned []
Implicit Place search using SMT with State Equation took 769 ms to find 0 implicit places.
[2022-05-15 11:40:14] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 700 rows 730 cols
[2022-05-15 11:40:14] [INFO ] Computed 130 place invariants in 4 ms
[2022-05-15 11:40:15] [INFO ] Dead Transitions using invariants and state equation in 367 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 730/730 places, 700/700 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 162 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 29 ms :[(NOT p1)]
Finished random walk after 16 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=8 )
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 183 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 24 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p1)]
// Phase 1: matrix 700 rows 730 cols
[2022-05-15 11:40:15] [INFO ] Computed 130 place invariants in 7 ms
[2022-05-15 11:40:16] [INFO ] [Real]Absence check using 29 positive place invariants in 22 ms returned sat
[2022-05-15 11:40:16] [INFO ] [Real]Absence check using 29 positive and 101 generalized place invariants in 129 ms returned sat
[2022-05-15 11:40:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 11:40:18] [INFO ] [Real]Absence check using state equation in 1802 ms returned sat
[2022-05-15 11:40:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 11:40:18] [INFO ] [Nat]Absence check using 29 positive place invariants in 19 ms returned sat
[2022-05-15 11:40:18] [INFO ] [Nat]Absence check using 29 positive and 101 generalized place invariants in 148 ms returned sat
[2022-05-15 11:40:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 11:40:21] [INFO ] [Nat]Absence check using state equation in 2759 ms returned sat
[2022-05-15 11:40:21] [INFO ] Computed and/alt/rep : 500/1300/500 causal constraints (skipped 100 transitions) in 33 ms.
[2022-05-15 11:40:27] [INFO ] Added : 450 causal constraints over 90 iterations in 5890 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 25 ms :[(NOT p1)]
Product exploration explored 100000 steps with 6033 reset in 629 ms.
Product exploration explored 100000 steps with 6030 reset in 647 ms.
Built C files in :
/tmp/ltsmin16825491189054497066
[2022-05-15 11:40:28] [INFO ] Computing symmetric may disable matrix : 700 transitions.
[2022-05-15 11:40:28] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 11:40:28] [INFO ] Computing symmetric may enable matrix : 700 transitions.
[2022-05-15 11:40:28] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 11:40:28] [INFO ] Computing Do-Not-Accords matrix : 700 transitions.
[2022-05-15 11:40:28] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 11:40:28] [INFO ] Built C files in 85ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16825491189054497066
Running compilation step : cd /tmp/ltsmin16825491189054497066;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1809 ms.
Running link step : cd /tmp/ltsmin16825491189054497066;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin16825491189054497066;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15998899241059075493.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 100 out of 730 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 730/730 places, 700/700 transitions.
Drop transitions removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 730 transition count 600
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 200 place count 630 transition count 600
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 200 place count 630 transition count 500
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 400 place count 530 transition count 500
Applied a total of 400 rules in 58 ms. Remains 530 /730 variables (removed 200) and now considering 500/700 (removed 200) transitions.
// Phase 1: matrix 500 rows 530 cols
[2022-05-15 11:40:43] [INFO ] Computed 130 place invariants in 3 ms
[2022-05-15 11:40:44] [INFO ] Implicit Places using invariants in 479 ms returned [10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 490 ms to find 100 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 430/730 places, 500/700 transitions.
Applied a total of 0 rules in 7 ms. Remains 430 /430 variables (removed 0) and now considering 500/500 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 430/730 places, 500/700 transitions.
Built C files in :
/tmp/ltsmin9067157993472997957
[2022-05-15 11:40:44] [INFO ] Computing symmetric may disable matrix : 500 transitions.
[2022-05-15 11:40:44] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 11:40:44] [INFO ] Computing symmetric may enable matrix : 500 transitions.
[2022-05-15 11:40:44] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 11:40:44] [INFO ] Computing Do-Not-Accords matrix : 500 transitions.
[2022-05-15 11:40:44] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 11:40:44] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9067157993472997957
Running compilation step : cd /tmp/ltsmin9067157993472997957;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1138 ms.
Running link step : cd /tmp/ltsmin9067157993472997957;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin9067157993472997957;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2137459363674594900.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-15 11:40:59] [INFO ] Flatten gal took : 89 ms
[2022-05-15 11:40:59] [INFO ] Flatten gal took : 71 ms
[2022-05-15 11:40:59] [INFO ] Time to serialize gal into /tmp/LTL5460028196642572085.gal : 42 ms
[2022-05-15 11:40:59] [INFO ] Time to serialize properties into /tmp/LTL8749498944753755889.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5460028196642572085.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8749498944753755889.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5460028...266
Read 1 LTL properties
Checking formula 0 : !((((G("((((((((((((Active_92>=1)&&(Acknowledge_2>=1))&&((Acknowledge_12>=1)&&(Acknowledge_22>=1)))&&(((Acknowledge_32>=1)&&(Acknowled...28121
Formula 0 simplified : !(G"((((((((((((Active_92>=1)&&(Acknowledge_2>=1))&&((Acknowledge_12>=1)&&(Acknowledge_22>=1)))&&(((Acknowledge_32>=1)&&(Acknowledge...28109
Detected timeout of ITS tools.
[2022-05-15 11:41:14] [INFO ] Flatten gal took : 69 ms
[2022-05-15 11:41:14] [INFO ] Applying decomposition
[2022-05-15 11:41:14] [INFO ] Flatten gal took : 69 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph7512505161616079532.txt' '-o' '/tmp/graph7512505161616079532.bin' '-w' '/tmp/graph7512505161616079532.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7512505161616079532.bin' '-l' '-1' '-v' '-w' '/tmp/graph7512505161616079532.weights' '-q' '0' '-e' '0.001'
[2022-05-15 11:41:14] [INFO ] Decomposing Gal with order
[2022-05-15 11:41:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 11:41:15] [INFO ] Removed a total of 890 redundant transitions.
[2022-05-15 11:41:15] [INFO ] Flatten gal took : 136 ms
[2022-05-15 11:41:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2022-05-15 11:41:15] [INFO ] Time to serialize gal into /tmp/LTL15214165352961999195.gal : 17 ms
[2022-05-15 11:41:15] [INFO ] Time to serialize properties into /tmp/LTL982137380762215705.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15214165352961999195.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL982137380762215705.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1521416...245
Read 1 LTL properties
Checking formula 0 : !((((G("((((((((((((u10.Active_92>=1)&&(i20.u20.Acknowledge_2>=1))&&((i21.u26.Acknowledge_12>=1)&&(i22.u28.Acknowledge_22>=1)))&&(((i1...37492
Formula 0 simplified : !(G"((((((((((((u10.Active_92>=1)&&(i20.u20.Acknowledge_2>=1))&&((i21.u26.Acknowledge_12>=1)&&(i22.u28.Acknowledge_22>=1)))&&(((i14....37480
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8544732620479934514
[2022-05-15 11:41:30] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8544732620479934514
Running compilation step : cd /tmp/ltsmin8544732620479934514;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1344 ms.
Running link step : cd /tmp/ltsmin8544732620479934514;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin8544732620479934514;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((LTLAPp0==true))||<>((LTLAPp1==true))||[]((LTLAPp2==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DatabaseWithMutex-COL-10-LTLFireability-11 finished in 107345 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!(G(p0) U p0)&&!(p0 U G(p1))))))'
Support contains 110 out of 830 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Drop transitions removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 830 transition count 700
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 200 place count 730 transition count 700
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 200 place count 730 transition count 500
Deduced a syphon composed of 200 places in 1 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 600 place count 530 transition count 500
Applied a total of 600 rules in 30 ms. Remains 530 /830 variables (removed 300) and now considering 500/800 (removed 300) transitions.
// Phase 1: matrix 500 rows 530 cols
[2022-05-15 11:41:45] [INFO ] Computed 130 place invariants in 8 ms
[2022-05-15 11:41:45] [INFO ] Implicit Places using invariants in 490 ms returned [10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 501 ms to find 100 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 430/830 places, 500/800 transitions.
Applied a total of 0 rules in 6 ms. Remains 430 /430 variables (removed 0) and now considering 500/500 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 430/830 places, 500/800 transitions.
Stuttering acceptance computed with spot in 105 ms :[(OR p0 p1), (OR p0 p1), p1]
Running random walk in product with property : DatabaseWithMutex-COL-10-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (GEQ s1 1) (GEQ s0 1) (GEQ s3 1) (GEQ s2 1) (GEQ s6 1) (GEQ s4 1) (GEQ s7 1) (GEQ s5 1) (GEQ s8 1) (GEQ s9 1)), p1:(OR (GEQ s251 1) (GEQ s312 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 318 reset in 444 ms.
Product exploration explored 100000 steps with 305 reset in 491 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 241 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 86 ms :[(OR p0 p1), (OR p0 p1), p1]
Finished random walk after 19 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F p1), (F (AND (NOT p0) p1))]
Knowledge based reduction with 7 factoid took 392 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 129 ms :[(OR p0 p1), (OR p0 p1), p1]
Stuttering acceptance computed with spot in 97 ms :[(OR p0 p1), (OR p0 p1), p1]
// Phase 1: matrix 500 rows 430 cols
[2022-05-15 11:41:48] [INFO ] Computed 30 place invariants in 8 ms
[2022-05-15 11:41:48] [INFO ] [Real]Absence check using 28 positive place invariants in 49 ms returned sat
[2022-05-15 11:41:48] [INFO ] [Real]Absence check using 28 positive and 2 generalized place invariants in 11 ms returned sat
[2022-05-15 11:41:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 11:41:49] [INFO ] [Real]Absence check using state equation in 1485 ms returned sat
[2022-05-15 11:41:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 11:41:50] [INFO ] [Nat]Absence check using 28 positive place invariants in 26 ms returned sat
[2022-05-15 11:41:50] [INFO ] [Nat]Absence check using 28 positive and 2 generalized place invariants in 92 ms returned sat
[2022-05-15 11:41:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 11:41:51] [INFO ] [Nat]Absence check using state equation in 896 ms returned sat
[2022-05-15 11:41:51] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 0 ms to minimize.
[2022-05-15 11:41:51] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2022-05-15 11:41:51] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 0 ms to minimize.
[2022-05-15 11:41:51] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 0 ms to minimize.
[2022-05-15 11:41:51] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 0 ms to minimize.
[2022-05-15 11:41:51] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 0 ms to minimize.
[2022-05-15 11:41:51] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2022-05-15 11:41:51] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 0 ms to minimize.
[2022-05-15 11:41:51] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 0 ms to minimize.
[2022-05-15 11:41:51] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 0 ms to minimize.
[2022-05-15 11:41:51] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 1 ms to minimize.
[2022-05-15 11:41:51] [INFO ] Trap strengthening procedure interrupted after too many repetitions 942 ms
[2022-05-15 11:41:51] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 942 ms
[2022-05-15 11:41:52] [INFO ] Computed and/alt/rep : 400/2000/400 causal constraints (skipped 0 transitions) in 22 ms.
[2022-05-15 11:41:53] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2022-05-15 11:41:53] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 0 ms to minimize.
[2022-05-15 11:41:53] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 0 ms to minimize.
[2022-05-15 11:41:53] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 0 ms to minimize.
[2022-05-15 11:41:53] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 0 ms to minimize.
[2022-05-15 11:41:53] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 0 ms to minimize.
[2022-05-15 11:41:53] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
[2022-05-15 11:41:53] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 0 ms to minimize.
[2022-05-15 11:41:53] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2022-05-15 11:41:54] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 0 ms to minimize.
[2022-05-15 11:41:54] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 0 ms to minimize.
[2022-05-15 11:41:54] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1025 ms
[2022-05-15 11:41:54] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1025 ms
[2022-05-15 11:41:54] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 0 ms to minimize.
[2022-05-15 11:41:54] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 0 ms to minimize.
[2022-05-15 11:41:54] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 0 ms to minimize.
[2022-05-15 11:41:54] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 0 ms to minimize.
[2022-05-15 11:41:54] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 0 ms to minimize.
[2022-05-15 11:41:54] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 0 ms to minimize.
[2022-05-15 11:41:54] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
[2022-05-15 11:41:55] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
[2022-05-15 11:41:55] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
[2022-05-15 11:41:55] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 0 ms to minimize.
[2022-05-15 11:41:55] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 0 ms to minimize.
[2022-05-15 11:41:55] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1068 ms
[2022-05-15 11:41:55] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1068 ms
[2022-05-15 11:41:55] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
[2022-05-15 11:41:55] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2022-05-15 11:41:55] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 0 ms to minimize.
[2022-05-15 11:41:55] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2022-05-15 11:41:55] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2022-05-15 11:41:55] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 0 ms to minimize.
[2022-05-15 11:41:56] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 0 ms to minimize.
[2022-05-15 11:41:56] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 0 ms to minimize.
[2022-05-15 11:41:56] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 0 ms to minimize.
[2022-05-15 11:41:56] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 0 ms to minimize.
[2022-05-15 11:41:56] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 0 ms to minimize.
[2022-05-15 11:41:56] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1057 ms
[2022-05-15 11:41:56] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1057 ms
[2022-05-15 11:41:56] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 0 ms to minimize.
[2022-05-15 11:41:56] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 0 ms to minimize.
[2022-05-15 11:41:56] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 0 ms to minimize.
[2022-05-15 11:41:56] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 0 ms to minimize.
[2022-05-15 11:41:57] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 0 ms to minimize.
[2022-05-15 11:41:57] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 0 ms to minimize.
[2022-05-15 11:41:57] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 0 ms to minimize.
[2022-05-15 11:41:57] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 0 ms to minimize.
[2022-05-15 11:41:57] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 0 ms to minimize.
[2022-05-15 11:41:57] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
[2022-05-15 11:41:57] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 0 ms to minimize.
[2022-05-15 11:41:57] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1151 ms
[2022-05-15 11:41:57] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1151 ms
[2022-05-15 11:41:57] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 0 ms to minimize.
[2022-05-15 11:41:57] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 0 ms to minimize.
[2022-05-15 11:41:58] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 0 ms to minimize.
[2022-05-15 11:41:58] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 1 ms to minimize.
[2022-05-15 11:41:58] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 0 ms to minimize.
[2022-05-15 11:41:58] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 0 ms to minimize.
[2022-05-15 11:41:58] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 1 ms to minimize.
[2022-05-15 11:41:58] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 0 ms to minimize.
[2022-05-15 11:41:59] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 0 ms to minimize.
[2022-05-15 11:41:59] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 0 ms to minimize.
[2022-05-15 11:41:59] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 0 ms to minimize.
[2022-05-15 11:41:59] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1522 ms
[2022-05-15 11:41:59] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1522 ms
[2022-05-15 11:42:01] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 0 ms to minimize.
[2022-05-15 11:42:01] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 0 ms to minimize.
[2022-05-15 11:42:01] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 0 ms to minimize.
[2022-05-15 11:42:01] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
[2022-05-15 11:42:02] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 0 ms to minimize.
[2022-05-15 11:42:02] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 0 ms to minimize.
[2022-05-15 11:42:02] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 0 ms to minimize.
[2022-05-15 11:42:02] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 0 ms to minimize.
[2022-05-15 11:42:02] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 0 ms to minimize.
[2022-05-15 11:42:02] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 0 ms to minimize.
[2022-05-15 11:42:02] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 1 ms to minimize.
[2022-05-15 11:42:02] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1236 ms
[2022-05-15 11:42:02] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1236 ms
[2022-05-15 11:42:02] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 0 ms to minimize.
[2022-05-15 11:42:03] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 0 ms to minimize.
[2022-05-15 11:42:03] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 0 ms to minimize.
[2022-05-15 11:42:03] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 0 ms to minimize.
[2022-05-15 11:42:03] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 1 ms to minimize.
[2022-05-15 11:42:03] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 0 ms to minimize.
[2022-05-15 11:42:03] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 0 ms to minimize.
[2022-05-15 11:42:03] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 0 ms to minimize.
[2022-05-15 11:42:03] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 0 ms to minimize.
[2022-05-15 11:42:03] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
[2022-05-15 11:42:04] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 0 ms to minimize.
[2022-05-15 11:42:04] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1187 ms
[2022-05-15 11:42:04] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1187 ms
[2022-05-15 11:42:04] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 0 ms to minimize.
[2022-05-15 11:42:04] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 0 ms to minimize.
[2022-05-15 11:42:04] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 0 ms to minimize.
[2022-05-15 11:42:04] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 0 ms to minimize.
[2022-05-15 11:42:04] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 0 ms to minimize.
[2022-05-15 11:42:04] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 0 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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:521)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:677)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:652)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:348)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:322)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:78)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:686)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-05-15 11:42:04] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG p0
Could not prove EG p0
Support contains 110 out of 430 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 430/430 places, 500/500 transitions.
Applied a total of 0 rules in 6 ms. Remains 430 /430 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 430 cols
[2022-05-15 11:42:04] [INFO ] Computed 30 place invariants in 7 ms
[2022-05-15 11:42:05] [INFO ] Implicit Places using invariants in 459 ms returned []
// Phase 1: matrix 500 rows 430 cols
[2022-05-15 11:42:05] [INFO ] Computed 30 place invariants in 8 ms
[2022-05-15 11:42:06] [INFO ] Implicit Places using invariants and state equation in 960 ms returned []
Implicit Place search using SMT with State Equation took 1444 ms to find 0 implicit places.
[2022-05-15 11:42:06] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 500 rows 430 cols
[2022-05-15 11:42:06] [INFO ] Computed 30 place invariants in 6 ms
[2022-05-15 11:42:06] [INFO ] Dead Transitions using invariants and state equation in 328 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 430/430 places, 500/500 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 234 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 88 ms :[(OR p0 p1), (OR p0 p1), p1]
Finished random walk after 12 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F p1), (F (AND (NOT p0) p1))]
Knowledge based reduction with 7 factoid took 298 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 95 ms :[(OR p0 p1), (OR p0 p1), p1]
Stuttering acceptance computed with spot in 87 ms :[(OR p0 p1), (OR p0 p1), p1]
// Phase 1: matrix 500 rows 430 cols
[2022-05-15 11:42:07] [INFO ] Computed 30 place invariants in 10 ms
[2022-05-15 11:42:07] [INFO ] [Real]Absence check using 28 positive place invariants in 50 ms returned sat
[2022-05-15 11:42:07] [INFO ] [Real]Absence check using 28 positive and 2 generalized place invariants in 18 ms returned sat
[2022-05-15 11:42:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 11:42:09] [INFO ] [Real]Absence check using state equation in 1510 ms returned sat
[2022-05-15 11:42:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 11:42:09] [INFO ] [Nat]Absence check using 28 positive place invariants in 25 ms returned sat
[2022-05-15 11:42:09] [INFO ] [Nat]Absence check using 28 positive and 2 generalized place invariants in 93 ms returned sat
[2022-05-15 11:42:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 11:42:10] [INFO ] [Nat]Absence check using state equation in 896 ms returned sat
[2022-05-15 11:42:10] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 0 ms to minimize.
[2022-05-15 11:42:10] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 0 ms to minimize.
[2022-05-15 11:42:10] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 0 ms to minimize.
[2022-05-15 11:42:10] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 0 ms to minimize.
[2022-05-15 11:42:11] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 1 ms to minimize.
[2022-05-15 11:42:11] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 0 ms to minimize.
[2022-05-15 11:42:11] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 0 ms to minimize.
[2022-05-15 11:42:11] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 0 ms to minimize.
[2022-05-15 11:42:11] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 0 ms to minimize.
[2022-05-15 11:42:11] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 0 ms to minimize.
[2022-05-15 11:42:11] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 0 ms to minimize.
[2022-05-15 11:42:11] [INFO ] Trap strengthening procedure interrupted after too many repetitions 989 ms
[2022-05-15 11:42:11] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 990 ms
[2022-05-15 11:42:11] [INFO ] Computed and/alt/rep : 400/2000/400 causal constraints (skipped 0 transitions) in 36 ms.
[2022-05-15 11:42:12] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 0 ms to minimize.
[2022-05-15 11:42:12] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 0 ms to minimize.
[2022-05-15 11:42:13] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 1 ms to minimize.
[2022-05-15 11:42:13] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 0 ms to minimize.
[2022-05-15 11:42:13] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 0 ms to minimize.
[2022-05-15 11:42:13] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 0 ms to minimize.
[2022-05-15 11:42:13] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 0 ms to minimize.
[2022-05-15 11:42:13] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 0 ms to minimize.
[2022-05-15 11:42:13] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 0 ms to minimize.
[2022-05-15 11:42:13] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 0 ms to minimize.
[2022-05-15 11:42:13] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
[2022-05-15 11:42:13] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1102 ms
[2022-05-15 11:42:13] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1102 ms
[2022-05-15 11:42:14] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 0 ms to minimize.
[2022-05-15 11:42:14] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 0 ms to minimize.
[2022-05-15 11:42:14] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 0 ms to minimize.
[2022-05-15 11:42:14] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 0 ms to minimize.
[2022-05-15 11:42:14] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2022-05-15 11:42:14] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 0 ms to minimize.
[2022-05-15 11:42:14] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 0 ms to minimize.
[2022-05-15 11:42:14] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
[2022-05-15 11:42:14] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 0 ms to minimize.
[2022-05-15 11:42:14] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2022-05-15 11:42:15] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 0 ms to minimize.
[2022-05-15 11:42:15] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1098 ms
[2022-05-15 11:42:15] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1098 ms
[2022-05-15 11:42:15] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2022-05-15 11:42:15] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 0 ms to minimize.
[2022-05-15 11:42:15] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 0 ms to minimize.
[2022-05-15 11:42:15] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 0 ms to minimize.
[2022-05-15 11:42:15] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 0 ms to minimize.
[2022-05-15 11:42:15] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 0 ms to minimize.
[2022-05-15 11:42:15] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 0 ms to minimize.
[2022-05-15 11:42:15] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 0 ms to minimize.
[2022-05-15 11:42:15] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 0 ms to minimize.
[2022-05-15 11:42:16] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 0 ms to minimize.
[2022-05-15 11:42:16] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 1 ms to minimize.
[2022-05-15 11:42:16] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1055 ms
[2022-05-15 11:42:16] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1055 ms
[2022-05-15 11:42:16] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 0 ms to minimize.
[2022-05-15 11:42:16] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 0 ms to minimize.
[2022-05-15 11:42:16] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2022-05-15 11:42:16] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2022-05-15 11:42:16] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 0 ms to minimize.
[2022-05-15 11:42:16] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 1 ms to minimize.
[2022-05-15 11:42:16] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 0 ms to minimize.
[2022-05-15 11:42:17] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 0 ms to minimize.
[2022-05-15 11:42:17] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2022-05-15 11:42:17] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 0 ms to minimize.
[2022-05-15 11:42:17] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 0 ms to minimize.
[2022-05-15 11:42:17] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1155 ms
[2022-05-15 11:42:17] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1155 ms
[2022-05-15 11:42:17] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 0 ms to minimize.
[2022-05-15 11:42:17] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 0 ms to minimize.
[2022-05-15 11:42:18] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 0 ms to minimize.
[2022-05-15 11:42:18] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 0 ms to minimize.
[2022-05-15 11:42:18] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 0 ms to minimize.
[2022-05-15 11:42:18] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
[2022-05-15 11:42:18] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 0 ms to minimize.
[2022-05-15 11:42:18] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 0 ms to minimize.
[2022-05-15 11:42:18] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 1 ms to minimize.
[2022-05-15 11:42:18] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 0 ms to minimize.
[2022-05-15 11:42:19] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2022-05-15 11:42:19] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1524 ms
[2022-05-15 11:42:19] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1524 ms
[2022-05-15 11:42:21] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 0 ms to minimize.
[2022-05-15 11:42:21] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
[2022-05-15 11:42:21] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 0 ms to minimize.
[2022-05-15 11:42:21] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 0 ms to minimize.
[2022-05-15 11:42:21] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 1 ms to minimize.
[2022-05-15 11:42:21] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 0 ms to minimize.
[2022-05-15 11:42:22] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 0 ms to minimize.
[2022-05-15 11:42:22] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 1 ms to minimize.
[2022-05-15 11:42:22] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 0 ms to minimize.
[2022-05-15 11:42:22] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 0 ms to minimize.
[2022-05-15 11:42:22] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 0 ms to minimize.
[2022-05-15 11:42:22] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1240 ms
[2022-05-15 11:42:22] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1240 ms
[2022-05-15 11:42:22] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 0 ms to minimize.
[2022-05-15 11:42:22] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 0 ms to minimize.
[2022-05-15 11:42:22] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 0 ms to minimize.
[2022-05-15 11:42:23] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 0 ms to minimize.
[2022-05-15 11:42:23] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 0 ms to minimize.
[2022-05-15 11:42:23] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 0 ms to minimize.
[2022-05-15 11:42:23] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 0 ms to minimize.
[2022-05-15 11:42:23] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 0 ms to minimize.
[2022-05-15 11:42:23] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 0 ms to minimize.
[2022-05-15 11:42:23] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 0 ms to minimize.
[2022-05-15 11:42:23] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 0 ms to minimize.
[2022-05-15 11:42:23] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1301 ms
[2022-05-15 11:42:23] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1301 ms
[2022-05-15 11:42:24] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 0 ms to minimize.
[2022-05-15 11:42:24] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 0 ms to minimize.
[2022-05-15 11:42:24] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 0 ms to minimize.
[2022-05-15 11:42:24] [INFO ] Trap strengthening (SAT) tested/added 3/3 trap constraints in 331 ms
[2022-05-15 11:42:24] [INFO ] Deduced a trap composed of 7 places in 203 ms of which 0 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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:521)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:677)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:652)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:356)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:322)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:78)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:686)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-05-15 11:42:24] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG p0
Could not prove EG p0
Stuttering acceptance computed with spot in 100 ms :[(OR p0 p1), (OR p0 p1), p1]
Product exploration explored 100000 steps with 357 reset in 450 ms.
Product exploration explored 100000 steps with 322 reset in 488 ms.
Built C files in :
/tmp/ltsmin5133278402308171509
[2022-05-15 11:42:25] [INFO ] Computing symmetric may disable matrix : 500 transitions.
[2022-05-15 11:42:25] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 11:42:25] [INFO ] Computing symmetric may enable matrix : 500 transitions.
[2022-05-15 11:42:25] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 11:42:25] [INFO ] Computing Do-Not-Accords matrix : 500 transitions.
[2022-05-15 11:42:25] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 11:42:25] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5133278402308171509
Running compilation step : cd /tmp/ltsmin5133278402308171509;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1184 ms.
Running link step : cd /tmp/ltsmin5133278402308171509;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin5133278402308171509;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16068995870465185850.hoa' '--buchi-type=spotba'
LTSmin run took 3864 ms.
FORMULA DatabaseWithMutex-COL-10-LTLFireability-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DatabaseWithMutex-COL-10-LTLFireability-12 finished in 45369 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(G(X(p0)))||!(F(p1) U G(p2))||!p1)))'
Support contains 320 out of 830 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Applied a total of 0 rules in 13 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
// Phase 1: matrix 800 rows 830 cols
[2022-05-15 11:42:30] [INFO ] Computed 130 place invariants in 4 ms
[2022-05-15 11:42:31] [INFO ] Implicit Places using invariants in 233 ms returned []
// Phase 1: matrix 800 rows 830 cols
[2022-05-15 11:42:31] [INFO ] Computed 130 place invariants in 5 ms
[2022-05-15 11:42:31] [INFO ] Implicit Places using invariants and state equation in 475 ms returned []
Implicit Place search using SMT with State Equation took 743 ms to find 0 implicit places.
// Phase 1: matrix 800 rows 830 cols
[2022-05-15 11:42:31] [INFO ] Computed 130 place invariants in 5 ms
[2022-05-15 11:42:32] [INFO ] Dead Transitions using invariants and state equation in 551 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 830/830 places, 800/800 transitions.
Stuttering acceptance computed with spot in 240 ms :[(AND p1 p2 (NOT p0)), (AND (NOT p0) p2), (AND p1 (NOT p0) p2), (AND p2 (NOT p0)), (AND (NOT p0) p2), p2, p2, (AND p2 p1)]
Running random walk in product with property : DatabaseWithMutex-COL-10-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={} source=2 dest: 4}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 7}], [{ cond=(AND p2 p0), acceptance={} source=3 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=4 dest: 3}, { cond=(AND p1 p0), acceptance={} source=4 dest: 4}, { cond=(AND p2 (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 7}], [{ cond=p2, acceptance={0} source=5 dest: 5}], [{ cond=p2, acceptance={} source=6 dest: 5}, { cond=p1, acceptance={} source=6 dest: 6}, { cond=(NOT p1), acceptance={} source=6 dest: 7}], [{ cond=(AND p1 p2), acceptance={} source=7 dest: 5}, { cond=p1, acceptance={} source=7 dest: 6}, { cond=(NOT p1), acceptance={} source=7 dest: 7}]], initial=0, aps=[p1:(OR (GEQ s101 1) (GEQ s100 1) (GEQ s103 1) (GEQ s102 1) (GEQ s106 1) (GEQ s104 1) (GEQ s107 1) (GEQ s105 1) (GEQ s108 1) (GEQ s109 1)), p2:(OR (AND (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 298 reset in 502 ms.
Product exploration explored 100000 steps with 311 reset in 552 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) (NOT p0)), (X p1), (X (NOT (AND (NOT p1) p2))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X p1)), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 660 ms. Reduced automaton from 8 states, 25 edges and 3 AP to 4 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 139 ms :[p2, p2, p2, (AND p2 p1)]
Finished random walk after 198 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=66 )
Knowledge obtained : [(AND p1 (NOT p2) (NOT p0)), (X p1), (X (NOT (AND (NOT p1) p2))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X p1)), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F p2), (F (AND p2 p1)), (F (NOT p1))]
Knowledge based reduction with 13 factoid took 458 ms. Reduced automaton from 4 states, 8 edges and 2 AP to 4 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 117 ms :[p2, p2, p2, (AND p2 p1)]
Stuttering acceptance computed with spot in 113 ms :[p2, p2, p2, (AND p2 p1)]
Support contains 120 out of 830 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Applied a total of 0 rules in 9 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
// Phase 1: matrix 800 rows 830 cols
[2022-05-15 11:42:35] [INFO ] Computed 130 place invariants in 4 ms
[2022-05-15 11:42:35] [INFO ] Implicit Places using invariants in 202 ms returned []
// Phase 1: matrix 800 rows 830 cols
[2022-05-15 11:42:35] [INFO ] Computed 130 place invariants in 4 ms
[2022-05-15 11:42:35] [INFO ] Implicit Places using invariants and state equation in 440 ms returned []
Implicit Place search using SMT with State Equation took 668 ms to find 0 implicit places.
// Phase 1: matrix 800 rows 830 cols
[2022-05-15 11:42:35] [INFO ] Computed 130 place invariants in 4 ms
[2022-05-15 11:42:36] [INFO ] Dead Transitions using invariants and state equation in 422 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 830/830 places, 800/800 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p1), (X (NOT p2)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p2 p1)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 226 ms. Reduced automaton from 4 states, 8 edges and 2 AP to 4 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 130 ms :[p2, p2, p2, (AND p2 p1)]
Finished random walk after 19 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=9 )
Knowledge obtained : [(AND (NOT p2) p1), (X (NOT p2)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p2 p1)))), (X (X p1))]
False Knowledge obtained : [(F p2), (F (AND p2 p1)), (F (NOT p1))]
Knowledge based reduction with 6 factoid took 303 ms. Reduced automaton from 4 states, 8 edges and 2 AP to 4 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 120 ms :[p2, p2, p2, (AND p2 p1)]
Stuttering acceptance computed with spot in 117 ms :[p2, p2, p2, (AND p2 p1)]
Stuttering acceptance computed with spot in 106 ms :[p2, p2, p2, (AND p2 p1)]
Product exploration explored 100000 steps with 308 reset in 555 ms.
Product exploration explored 100000 steps with 303 reset in 616 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 205 ms :[p2, p2, p2, (AND p2 p1)]
Support contains 120 out of 830 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 830 transition count 800
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 200 places in 0 ms
Iterating global reduction 1 with 100 rules applied. Total rules applied 200 place count 830 transition count 800
Deduced a syphon composed of 200 places in 0 ms
Applied a total of 200 rules in 39 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
[2022-05-15 11:42:38] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 800 rows 830 cols
[2022-05-15 11:42:38] [INFO ] Computed 130 place invariants in 4 ms
[2022-05-15 11:42:39] [INFO ] Dead Transitions using invariants and state equation in 590 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 830/830 places, 800/800 transitions.
Finished structural reductions, in 1 iterations. Remains : 830/830 places, 800/800 transitions.
Product exploration explored 100000 steps with 479 reset in 606 ms.
Product exploration explored 100000 steps with 475 reset in 611 ms.
Built C files in :
/tmp/ltsmin7858139176785128656
[2022-05-15 11:42:40] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7858139176785128656
Running compilation step : cd /tmp/ltsmin7858139176785128656;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1400 ms.
Running link step : cd /tmp/ltsmin7858139176785128656;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin7858139176785128656;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased321215307689324116.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 120 out of 830 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Applied a total of 0 rules in 12 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
// Phase 1: matrix 800 rows 830 cols
[2022-05-15 11:42:55] [INFO ] Computed 130 place invariants in 9 ms
[2022-05-15 11:42:56] [INFO ] Implicit Places using invariants in 503 ms returned [110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 504 ms to find 100 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 730/830 places, 800/800 transitions.
Applied a total of 0 rules in 6 ms. Remains 730 /730 variables (removed 0) and now considering 800/800 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 730/830 places, 800/800 transitions.
Built C files in :
/tmp/ltsmin16101869351198748947
[2022-05-15 11:42:56] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16101869351198748947
Running compilation step : cd /tmp/ltsmin16101869351198748947;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1423 ms.
Running link step : cd /tmp/ltsmin16101869351198748947;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin16101869351198748947;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15687082687447875618.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-15 11:43:11] [INFO ] Flatten gal took : 36 ms
[2022-05-15 11:43:11] [INFO ] Flatten gal took : 36 ms
[2022-05-15 11:43:11] [INFO ] Time to serialize gal into /tmp/LTL17596607939238423529.gal : 4 ms
[2022-05-15 11:43:11] [INFO ] Time to serialize properties into /tmp/LTL11108561564242268747.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17596607939238423529.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11108561564242268747.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1759660...268
Read 1 LTL properties
Checking formula 0 : !((G(((X(G(X("((((((((((((Active_92>=1)&&(Acknowledge_2>=1))&&((Acknowledge_12>=1)&&(Acknowledge_22>=1)))&&(((Acknowledge_32>=1)&&(Ack...26956
Formula 0 simplified : !G("(((((all_active_1<1)&&(all_active_0<1))&&((all_active_3<1)&&(all_active_2<1)))&&(((all_active_6<1)&&(all_active_4<1))&&((all_act...26936
Detected timeout of ITS tools.
[2022-05-15 11:43:26] [INFO ] Flatten gal took : 43 ms
[2022-05-15 11:43:26] [INFO ] Applying decomposition
[2022-05-15 11:43:26] [INFO ] Flatten gal took : 63 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph12024440423413426720.txt' '-o' '/tmp/graph12024440423413426720.bin' '-w' '/tmp/graph12024440423413426720.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12024440423413426720.bin' '-l' '-1' '-v' '-w' '/tmp/graph12024440423413426720.weights' '-q' '0' '-e' '0.001'
[2022-05-15 11:43:26] [INFO ] Decomposing Gal with order
[2022-05-15 11:43:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 11:43:27] [INFO ] Removed a total of 1689 redundant transitions.
[2022-05-15 11:43:27] [INFO ] Flatten gal took : 142 ms
[2022-05-15 11:43:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 11 ms.
[2022-05-15 11:43:27] [INFO ] Time to serialize gal into /tmp/LTL17350794573511987812.gal : 26 ms
[2022-05-15 11:43:27] [INFO ] Time to serialize properties into /tmp/LTL11913974970007531066.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17350794573511987812.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11913974970007531066.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1735079...247
Read 1 LTL properties
Checking formula 0 : !((G(((X(G(X("((((((((((((i11.u68.Active_92>=1)&&(i26.u173.Acknowledge_2>=1))&&((i19.u179.Acknowledge_12>=1)&&(i20.u132.Acknowledge_22...37661
Formula 0 simplified : !G("(((((u58.all_active_1<1)&&(u57.all_active_0<1))&&((u60.all_active_3<1)&&(u59.all_active_2<1)))&&(((i14.u63.all_active_6<1)&&(u61...37641
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin752649982007212116
[2022-05-15 11:43:42] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin752649982007212116
Running compilation step : cd /tmp/ltsmin752649982007212116;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1581 ms.
Running link step : cd /tmp/ltsmin752649982007212116;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin752649982007212116;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((X([](X((LTLAPp0==true))))||!(<>((LTLAPp1==true)) U []((LTLAPp2==true)))||!(LTLAPp1==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DatabaseWithMutex-COL-10-LTLFireability-13 finished in 86660 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 100 out of 830 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Drop transitions removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 830 transition count 700
Reduce places removed 110 places and 0 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 1 with 310 rules applied. Total rules applied 410 place count 720 transition count 500
Reduce places removed 200 places and 0 transitions.
Iterating post reduction 2 with 200 rules applied. Total rules applied 610 place count 520 transition count 500
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 610 place count 520 transition count 400
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 810 place count 420 transition count 400
Applied a total of 810 rules in 24 ms. Remains 420 /830 variables (removed 410) and now considering 400/800 (removed 400) transitions.
// Phase 1: matrix 400 rows 420 cols
[2022-05-15 11:43:57] [INFO ] Computed 120 place invariants in 6 ms
[2022-05-15 11:43:58] [INFO ] Implicit Places using invariants in 779 ms returned [10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219]
[2022-05-15 11:43:58] [INFO ] Actually due to overlaps returned [120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 794 ms to find 100 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 320/830 places, 400/800 transitions.
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 320 transition count 300
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 200 place count 220 transition count 300
Applied a total of 200 rules in 6 ms. Remains 220 /320 variables (removed 100) and now considering 300/400 (removed 100) transitions.
// Phase 1: matrix 300 rows 220 cols
[2022-05-15 11:43:58] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-15 11:43:58] [INFO ] Implicit Places using invariants in 87 ms returned []
// Phase 1: matrix 300 rows 220 cols
[2022-05-15 11:43:58] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-15 11:43:58] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 220/830 places, 300/800 transitions.
Finished structural reductions, in 2 iterations. Remains : 220/830 places, 300/800 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : DatabaseWithMutex-COL-10-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s91 1) (GEQ s26 1) (GEQ s87 1) (GEQ s22 1) (GEQ s99 1) (GEQ s34 1) (GEQ s95 1) (GEQ s30 1) (GEQ s107 1) (GEQ s42 1) (GEQ s103 1) (GEQ s38 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 371 ms.
Stack based approach found an accepted trace after 2892 steps with 0 reset with depth 2893 and stack size 2867 in 10 ms.
FORMULA DatabaseWithMutex-COL-10-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property DatabaseWithMutex-COL-10-LTLFireability-14 finished in 1494 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&G(X(G(p1)))))'
Support contains 210 out of 830 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Applied a total of 0 rules in 6 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
// Phase 1: matrix 800 rows 830 cols
[2022-05-15 11:43:58] [INFO ] Computed 130 place invariants in 10 ms
[2022-05-15 11:43:59] [INFO ] Implicit Places using invariants in 480 ms returned [110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 487 ms to find 100 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 730/830 places, 800/800 transitions.
Applied a total of 0 rules in 7 ms. Remains 730 /730 variables (removed 0) and now considering 800/800 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 730/830 places, 800/800 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : DatabaseWithMutex-COL-10-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(AND (LT s352 1) (LT s413 1) (LT s348 1) (LT s360 1) (LT s417 1) (LT s356 1) (LT s368 1) (LT s364 1) (LT s376 1) (LT s372 1) (LT s323 1) (LT s384 1) (L...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 37 steps with 0 reset in 1 ms.
FORMULA DatabaseWithMutex-COL-10-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-COL-10-LTLFireability-15 finished in 618 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(((G(F(p1))&&G(X(p2)))||p0)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)||G(p2)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(G(X(p0)))||!(F(p1) U G(p2))||!p1)))'
Found a SL insensitive property : DatabaseWithMutex-COL-10-LTLFireability-13
Stuttering acceptance computed with spot in 297 ms :[(AND p1 p2 (NOT p0)), (AND (NOT p0) p2), (AND p1 (NOT p0) p2), (AND p2 (NOT p0)), (AND (NOT p0) p2), p2, p2, (AND p2 p1)]
Support contains 320 out of 830 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Applied a total of 0 rules in 18 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
// Phase 1: matrix 800 rows 830 cols
[2022-05-15 11:44:00] [INFO ] Computed 130 place invariants in 8 ms
[2022-05-15 11:44:00] [INFO ] Implicit Places using invariants in 195 ms returned []
// Phase 1: matrix 800 rows 830 cols
[2022-05-15 11:44:00] [INFO ] Computed 130 place invariants in 4 ms
[2022-05-15 11:44:00] [INFO ] Implicit Places using invariants and state equation in 465 ms returned []
Implicit Place search using SMT with State Equation took 662 ms to find 0 implicit places.
// Phase 1: matrix 800 rows 830 cols
[2022-05-15 11:44:00] [INFO ] Computed 130 place invariants in 8 ms
[2022-05-15 11:44:01] [INFO ] Dead Transitions using invariants and state equation in 441 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 830/830 places, 800/800 transitions.
Running random walk in product with property : DatabaseWithMutex-COL-10-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={} source=2 dest: 4}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 7}], [{ cond=(AND p2 p0), acceptance={} source=3 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=4 dest: 3}, { cond=(AND p1 p0), acceptance={} source=4 dest: 4}, { cond=(AND p2 (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 7}], [{ cond=p2, acceptance={0} source=5 dest: 5}], [{ cond=p2, acceptance={} source=6 dest: 5}, { cond=p1, acceptance={} source=6 dest: 6}, { cond=(NOT p1), acceptance={} source=6 dest: 7}], [{ cond=(AND p1 p2), acceptance={} source=7 dest: 5}, { cond=p1, acceptance={} source=7 dest: 6}, { cond=(NOT p1), acceptance={} source=7 dest: 7}]], initial=0, aps=[p1:(OR (GEQ s101 1) (GEQ s100 1) (GEQ s103 1) (GEQ s102 1) (GEQ s106 1) (GEQ s104 1) (GEQ s107 1) (GEQ s105 1) (GEQ s108 1) (GEQ s109 1)), p2:(OR (AND (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 306 reset in 518 ms.
Product exploration explored 100000 steps with 300 reset in 570 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) (NOT p0)), (X p1), (X (NOT (AND (NOT p1) p2))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X p1)), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 570 ms. Reduced automaton from 8 states, 25 edges and 3 AP to 4 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 155 ms :[p2, p2, p2, (AND p2 p1)]
Finished random walk after 15 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=5 )
Knowledge obtained : [(AND p1 (NOT p2) (NOT p0)), (X p1), (X (NOT (AND (NOT p1) p2))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X p1)), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F p2), (F (AND p2 p1)), (F (NOT p1))]
Knowledge based reduction with 13 factoid took 484 ms. Reduced automaton from 4 states, 8 edges and 2 AP to 4 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 155 ms :[p2, p2, p2, (AND p2 p1)]
Stuttering acceptance computed with spot in 131 ms :[p2, p2, p2, (AND p2 p1)]
Support contains 120 out of 830 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Applied a total of 0 rules in 9 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
// Phase 1: matrix 800 rows 830 cols
[2022-05-15 11:44:04] [INFO ] Computed 130 place invariants in 7 ms
[2022-05-15 11:44:04] [INFO ] Implicit Places using invariants in 207 ms returned []
// Phase 1: matrix 800 rows 830 cols
[2022-05-15 11:44:04] [INFO ] Computed 130 place invariants in 5 ms
[2022-05-15 11:44:04] [INFO ] Implicit Places using invariants and state equation in 430 ms returned []
Implicit Place search using SMT with State Equation took 649 ms to find 0 implicit places.
// Phase 1: matrix 800 rows 830 cols
[2022-05-15 11:44:04] [INFO ] Computed 130 place invariants in 4 ms
[2022-05-15 11:44:05] [INFO ] Dead Transitions using invariants and state equation in 430 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 830/830 places, 800/800 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p1), (X (NOT p2)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p2 p1)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 175 ms. Reduced automaton from 4 states, 8 edges and 2 AP to 4 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 105 ms :[p2, p2, p2, (AND p2 p1)]
Finished random walk after 179 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=59 )
Knowledge obtained : [(AND (NOT p2) p1), (X (NOT p2)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p2 p1)))), (X (X p1))]
False Knowledge obtained : [(F p2), (F (AND p2 p1)), (F (NOT p1))]
Knowledge based reduction with 6 factoid took 236 ms. Reduced automaton from 4 states, 8 edges and 2 AP to 4 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 132 ms :[p2, p2, p2, (AND p2 p1)]
Stuttering acceptance computed with spot in 135 ms :[p2, p2, p2, (AND p2 p1)]
Stuttering acceptance computed with spot in 139 ms :[p2, p2, p2, (AND p2 p1)]
Product exploration explored 100000 steps with 302 reset in 557 ms.
Product exploration explored 100000 steps with 303 reset in 607 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 294 ms :[p2, p2, p2, (AND p2 p1)]
Support contains 120 out of 830 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 830 transition count 800
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 200 places in 0 ms
Iterating global reduction 1 with 100 rules applied. Total rules applied 200 place count 830 transition count 800
Deduced a syphon composed of 200 places in 0 ms
Applied a total of 200 rules in 50 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
[2022-05-15 11:44:07] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 800 rows 830 cols
[2022-05-15 11:44:07] [INFO ] Computed 130 place invariants in 8 ms
[2022-05-15 11:44:08] [INFO ] Dead Transitions using invariants and state equation in 437 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 830/830 places, 800/800 transitions.
Finished structural reductions, in 1 iterations. Remains : 830/830 places, 800/800 transitions.
Product exploration explored 100000 steps with 475 reset in 575 ms.
Product exploration explored 100000 steps with 484 reset in 605 ms.
Built C files in :
/tmp/ltsmin16248881572463699343
[2022-05-15 11:44:09] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16248881572463699343
Running compilation step : cd /tmp/ltsmin16248881572463699343;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1417 ms.
Running link step : cd /tmp/ltsmin16248881572463699343;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin16248881572463699343;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased18233608378147060608.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 120 out of 830 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Applied a total of 0 rules in 19 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
// Phase 1: matrix 800 rows 830 cols
[2022-05-15 11:44:24] [INFO ] Computed 130 place invariants in 13 ms
[2022-05-15 11:44:25] [INFO ] Implicit Places using invariants in 529 ms returned [110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 530 ms to find 100 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 730/830 places, 800/800 transitions.
Applied a total of 0 rules in 8 ms. Remains 730 /730 variables (removed 0) and now considering 800/800 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 730/830 places, 800/800 transitions.
Built C files in :
/tmp/ltsmin1317327441608413936
[2022-05-15 11:44:25] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1317327441608413936
Running compilation step : cd /tmp/ltsmin1317327441608413936;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1389 ms.
Running link step : cd /tmp/ltsmin1317327441608413936;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin1317327441608413936;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16463118629402902533.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-15 11:44:40] [INFO ] Flatten gal took : 35 ms
[2022-05-15 11:44:40] [INFO ] Flatten gal took : 39 ms
[2022-05-15 11:44:40] [INFO ] Time to serialize gal into /tmp/LTL3945324795374043541.gal : 5 ms
[2022-05-15 11:44:40] [INFO ] Time to serialize properties into /tmp/LTL17683165763966265817.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3945324795374043541.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17683165763966265817.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3945324...267
Read 1 LTL properties
Checking formula 0 : !((G(((X(G(X("((((((((((((Active_92>=1)&&(Acknowledge_2>=1))&&((Acknowledge_12>=1)&&(Acknowledge_22>=1)))&&(((Acknowledge_32>=1)&&(Ack...26956
Formula 0 simplified : !G("(((((all_active_1<1)&&(all_active_0<1))&&((all_active_3<1)&&(all_active_2<1)))&&(((all_active_6<1)&&(all_active_4<1))&&((all_act...26936
Detected timeout of ITS tools.
[2022-05-15 11:44:55] [INFO ] Flatten gal took : 35 ms
[2022-05-15 11:44:55] [INFO ] Applying decomposition
[2022-05-15 11:44:55] [INFO ] Flatten gal took : 33 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph5677822666254296240.txt' '-o' '/tmp/graph5677822666254296240.bin' '-w' '/tmp/graph5677822666254296240.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5677822666254296240.bin' '-l' '-1' '-v' '-w' '/tmp/graph5677822666254296240.weights' '-q' '0' '-e' '0.001'
[2022-05-15 11:44:55] [INFO ] Decomposing Gal with order
[2022-05-15 11:44:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 11:44:55] [INFO ] Removed a total of 1689 redundant transitions.
[2022-05-15 11:44:55] [INFO ] Flatten gal took : 77 ms
[2022-05-15 11:44:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2022-05-15 11:44:55] [INFO ] Time to serialize gal into /tmp/LTL1213940068318516433.gal : 7 ms
[2022-05-15 11:44:55] [INFO ] Time to serialize properties into /tmp/LTL6544889715668135457.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1213940068318516433.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6544889715668135457.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1213940...245
Read 1 LTL properties
Checking formula 0 : !((G(((X(G(X("((((((((((((i10.u54.Active_92>=1)&&(i18.u165.Acknowledge_2>=1))&&((i19.u122.Acknowledge_12>=1)&&(i20.u127.Acknowledge_22...37590
Formula 0 simplified : !G("(((((u46.all_active_1<1)&&(i17.u227.all_active_0<1))&&((u48.all_active_3<1)&&(u47.all_active_2<1)))&&(((u50.all_active_6<1)&&(u4...37570
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17678910051927372291
[2022-05-15 11:45:10] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17678910051927372291
Running compilation step : cd /tmp/ltsmin17678910051927372291;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1564 ms.
Running link step : cd /tmp/ltsmin17678910051927372291;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin17678910051927372291;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((X([](X((LTLAPp0==true))))||!(<>((LTLAPp1==true)) U []((LTLAPp2==true)))||!(LTLAPp1==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DatabaseWithMutex-COL-10-LTLFireability-13 finished in 86122 ms.
[2022-05-15 11:45:25] [INFO ] Flatten gal took : 44 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4508716811116865900
[2022-05-15 11:45:25] [INFO ] Computing symmetric may disable matrix : 800 transitions.
[2022-05-15 11:45:25] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 11:45:25] [INFO ] Computing symmetric may enable matrix : 800 transitions.
[2022-05-15 11:45:25] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 11:45:25] [INFO ] Applying decomposition
[2022-05-15 11:45:26] [INFO ] Flatten gal took : 61 ms
[2022-05-15 11:45:26] [INFO ] Computing Do-Not-Accords matrix : 800 transitions.
[2022-05-15 11:45:26] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph4899211619975161514.txt' '-o' '/tmp/graph4899211619975161514.bin' '-w' '/tmp/graph4899211619975161514.weights'
[2022-05-15 11:45:26] [INFO ] Built C files in 195ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4508716811116865900
Running compilation step : cd /tmp/ltsmin4508716811116865900;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4899211619975161514.bin' '-l' '-1' '-v' '-w' '/tmp/graph4899211619975161514.weights' '-q' '0' '-e' '0.001'
[2022-05-15 11:45:26] [INFO ] Decomposing Gal with order
[2022-05-15 11:45:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 11:45:26] [INFO ] Removed a total of 1690 redundant transitions.
[2022-05-15 11:45:26] [INFO ] Flatten gal took : 102 ms
[2022-05-15 11:45:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2022-05-15 11:45:26] [INFO ] Time to serialize gal into /tmp/LTLFireability2202142302282999052.gal : 7 ms
[2022-05-15 11:45:26] [INFO ] Time to serialize properties into /tmp/LTLFireability13452254288058127987.ltl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability2202142302282999052.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13452254288058127987.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 3 LTL properties
Checking formula 0 : !((F(("(((((((i1.u180.MesBuffReply_32>=1)||(i26.u216.MesBuffReply_93>=1))||((i21.u131.MesBuffReply_28>=1)||(i22.u137.MesBuffReply_40>=...40349
Formula 0 simplified : !F("(((((((i1.u180.MesBuffReply_32>=1)||(i26.u216.MesBuffReply_93>=1))||((i21.u131.MesBuffReply_28>=1)||(i22.u137.MesBuffReply_40>=1...40329
Compilation finished in 2354 ms.
Running link step : cd /tmp/ltsmin4508716811116865900;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin4508716811116865900;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((([](<>((LTLAPp1==true)))&&[](X((LTLAPp2==true))))||(LTLAPp0==true)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 6/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.020: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.020: LTL layer: formula: <>((([](<>((LTLAPp1==true)))&&[](X((LTLAPp2==true))))||(LTLAPp0==true)))
pins2lts-mc-linux64( 5/ 8), 0.021: "<>((([](<>((LTLAPp1==true)))&&[](X((LTLAPp2==true))))||(LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.021: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.051: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.051: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.055: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.058: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.060: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.063: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.065: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.151: There are 807 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.151: State length is 831, there are 807 groups
pins2lts-mc-linux64( 0/ 8), 0.151: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.151: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.151: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.151: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 0.264: [Blue] ~42 levels ~960 states ~9840 transitions
pins2lts-mc-linux64( 2/ 8), 0.339: [Blue] ~57 levels ~1920 states ~12872 transitions
pins2lts-mc-linux64( 2/ 8), 0.467: [Blue] ~83 levels ~3840 states ~17480 transitions
pins2lts-mc-linux64( 2/ 8), 0.602: [Blue] ~88 levels ~7680 states ~21896 transitions
pins2lts-mc-linux64( 2/ 8), 0.898: [Blue] ~88 levels ~15360 states ~31616 transitions
pins2lts-mc-linux64( 2/ 8), 1.431: [Blue] ~88 levels ~30720 states ~51616 transitions
pins2lts-mc-linux64( 2/ 8), 2.477: [Blue] ~88 levels ~61440 states ~93392 transitions
pins2lts-mc-linux64( 2/ 8), 4.485: [Blue] ~88 levels ~122880 states ~179800 transitions
pins2lts-mc-linux64( 2/ 8), 8.337: [Blue] ~88 levels ~245760 states ~358600 transitions
pins2lts-mc-linux64( 6/ 8), 15.714: [Blue] ~99 levels ~491520 states ~728544 transitions
pins2lts-mc-linux64( 0/ 8), 29.787: [Blue] ~110 levels ~983040 states ~1492416 transitions
pins2lts-mc-linux64( 6/ 8), 58.005: [Blue] ~99 levels ~1966080 states ~3053840 transitions
pins2lts-mc-linux64( 4/ 8), 113.805: [Blue] ~88 levels ~3932160 states ~6277216 transitions
pins2lts-mc-linux64( 2/ 8), 242.734: [Blue] ~88 levels ~7864320 states ~12898232 transitions
pins2lts-mc-linux64( 2/ 8), 498.496: [Blue] ~88 levels ~15728640 states ~26500464 transitions
pins2lts-mc-linux64( 4/ 8), 599.385: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 599.768:
pins2lts-mc-linux64( 0/ 8), 599.768: Explored 18799460 states 31942095 transitions, fanout: 1.699
pins2lts-mc-linux64( 0/ 8), 599.768: Total exploration time 599.600 sec (599.280 sec minimum, 599.420 sec on average)
pins2lts-mc-linux64( 0/ 8), 599.768: States per second: 31353, Transitions per second: 53272
pins2lts-mc-linux64( 0/ 8), 599.768:
pins2lts-mc-linux64( 0/ 8), 599.768: State space has 18814941 states, 18798714 are accepting
pins2lts-mc-linux64( 0/ 8), 599.768: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 599.768: blue states: 18799460 (99.92%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 599.768: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 599.768: all-red states: 18798714 (99.91%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 599.768:
pins2lts-mc-linux64( 0/ 8), 599.768: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 599.768:
pins2lts-mc-linux64( 0/ 8), 599.768: Queue width: 8B, total height: 825, memory: 0.01MB
pins2lts-mc-linux64( 0/ 8), 599.768: Tree memory: 399.5MB, 22.3 B/state, compr.: 0.7%
pins2lts-mc-linux64( 0/ 8), 599.768: Tree fill ratio (roots/leafs): 14.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 599.768: Stored 814 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 599.768: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 599.768: Est. total memory use: 399.6MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin4508716811116865900;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((([](<>((LTLAPp1==true)))&&[](X((LTLAPp2==true))))||(LTLAPp0==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin4508716811116865900;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((([](<>((LTLAPp1==true)))&&[](X((LTLAPp2==true))))||(LTLAPp0==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-15 12:08:54] [INFO ] Applying decomposition
[2022-05-15 12:08:55] [INFO ] Flatten gal took : 384 ms
[2022-05-15 12:08:55] [INFO ] Decomposing Gal with order
[2022-05-15 12:08:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 12:08:55] [INFO ] Removed a total of 2140 redundant transitions.
[2022-05-15 12:08:56] [INFO ] Flatten gal took : 534 ms
[2022-05-15 12:08:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 68 ms.
[2022-05-15 12:08:56] [INFO ] Time to serialize gal into /tmp/LTLFireability3028220534823069650.gal : 145 ms
[2022-05-15 12:08:56] [INFO ] Time to serialize properties into /tmp/LTLFireability15263837801236753589.ltl : 35 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability3028220534823069650.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15263837801236753589.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 3 LTL properties
Checking formula 0 : !((F(("(((((((sitefile32.MesBuffReply_32>=1)||(sitefile93.MesBuffReply_93>=1))||((sitefile28.MesBuffReply_28>=1)||(sitefile40.MesBuffR...42615
Formula 0 simplified : !F("(((((((sitefile32.MesBuffReply_32>=1)||(sitefile93.MesBuffReply_93>=1))||((sitefile28.MesBuffReply_28>=1)||(sitefile40.MesBuffRe...42595
Detected timeout of ITS tools.
[2022-05-15 12:32:25] [INFO ] Flatten gal took : 682 ms
[2022-05-15 12:32:26] [INFO ] Input system was already deterministic with 800 transitions.
[2022-05-15 12:32:26] [INFO ] Transformed 830 places.
[2022-05-15 12:32:26] [INFO ] Transformed 800 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-15 12:32:56] [INFO ] Time to serialize gal into /tmp/LTLFireability277572957488620591.gal : 42 ms
[2022-05-15 12:32:56] [INFO ] Time to serialize properties into /tmp/LTLFireability2192354343125688072.ltl : 11 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability277572957488620591.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2192354343125688072.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...332
Read 3 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(("(((((((MesBuffReply_32>=1)||(MesBuffReply_93>=1))||((MesBuffReply_28>=1)||(MesBuffReply_40>=1)))||(((MesBuffReply_97>=1)||(MesB...28935
Formula 0 simplified : !F("(((((((MesBuffReply_32>=1)||(MesBuffReply_93>=1))||((MesBuffReply_28>=1)||(MesBuffReply_40>=1)))||(((MesBuffReply_97>=1)||(MesBu...28915

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="DatabaseWithMutex-COL-10"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is DatabaseWithMutex-COL-10, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r060-tall-165254772200532"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' 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 ;