Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r351-tall-171679101500033.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is RingSingleMessageInMbox-PT-d0m160, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r351-tall-171679101500033
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 23 07:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 12 23:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 179K Apr 12 23:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 23:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Apr 12 23:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 64K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-LTLFireability-00
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-LTLFireability-01
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-LTLFireability-02
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-LTLFireability-03
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-LTLFireability-04
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-LTLFireability-05
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-LTLFireability-06
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-LTLFireability-07
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-LTLFireability-08
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-LTLFireability-09
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-LTLFireability-10
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-LTLFireability-11
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-LTLFireability-12
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-LTLFireability-13
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-LTLFireability-14
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716840052594

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RingSingleMessageInMbox-PT-d0m160
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-27 20:00:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-27 20:00:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 20:00:54] [INFO ] Load time of PNML (sax parser for PT used): 48 ms
[2024-05-27 20:00:54] [INFO ] Transformed 385 places.
[2024-05-27 20:00:54] [INFO ] Transformed 59 transitions.
[2024-05-27 20:00:54] [INFO ] Parsed PT model containing 385 places and 59 transitions and 236 arcs in 108 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Deduced a syphon composed of 329 places in 1 ms
Reduce places removed 329 places and 0 transitions.
FORMULA RingSingleMessageInMbox-PT-d0m160-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m160-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m160-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m160-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m160-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 56 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 59/59 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 54 transition count 59
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 5 place count 51 transition count 56
Iterating global reduction 1 with 3 rules applied. Total rules applied 8 place count 51 transition count 56
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 50 transition count 55
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 50 transition count 55
Applied a total of 10 rules in 13 ms. Remains 50 /56 variables (removed 6) and now considering 55/59 (removed 4) transitions.
// Phase 1: matrix 55 rows 50 cols
[2024-05-27 20:00:54] [INFO ] Computed 3 invariants in 11 ms
[2024-05-27 20:00:54] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-05-27 20:00:54] [INFO ] Invariant cache hit.
[2024-05-27 20:00:54] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-27 20:00:54] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
[2024-05-27 20:00:54] [INFO ] Invariant cache hit.
[2024-05-27 20:00:54] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 50/56 places, 55/59 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 324 ms. Remains : 50/56 places, 55/59 transitions.
Support contains 27 out of 50 places after structural reductions.
[2024-05-27 20:00:54] [INFO ] Flatten gal took : 34 ms
[2024-05-27 20:00:55] [INFO ] Flatten gal took : 8 ms
[2024-05-27 20:00:55] [INFO ] Input system was already deterministic with 55 transitions.
Support contains 26 out of 50 places (down from 27) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2130 resets, run finished after 326 ms. (steps per millisecond=30 ) properties (out of 22) seen :12
Incomplete Best-First random walk after 10001 steps, including 922 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 471 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 481 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 924 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 976 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 486 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 960 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 477 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 10000 steps, including 896 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 960 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2024-05-27 20:00:56] [INFO ] Invariant cache hit.
[2024-05-27 20:00:56] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-27 20:00:56] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-27 20:00:56] [INFO ] After 41ms SMT Verify possible using state equation in real domain returned unsat :2 sat :2 real:3
[2024-05-27 20:00:56] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-27 20:00:56] [INFO ] After 17ms SMT Verify possible using 25 Read/Feed constraints in real domain returned unsat :2 sat :0 real:5
[2024-05-27 20:00:56] [INFO ] After 126ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:5
[2024-05-27 20:00:56] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-27 20:00:56] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-27 20:00:56] [INFO ] After 38ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :5
[2024-05-27 20:00:56] [INFO ] After 25ms SMT Verify possible using 25 Read/Feed constraints in natural domain returned unsat :2 sat :5
[2024-05-27 20:00:56] [INFO ] After 85ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :5
Attempting to minimize the solution found.
Minimization took 32 ms.
[2024-05-27 20:00:56] [INFO ] After 202ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :5
Fused 7 Parikh solutions to 5 different solutions.
Parikh walk visited 2 properties in 69 ms.
Support contains 5 out of 50 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50/50 places, 55/55 transitions.
Graph (complete) has 132 edges and 50 vertex of which 49 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 49 transition count 52
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 7 place count 46 transition count 47
Iterating global reduction 1 with 3 rules applied. Total rules applied 10 place count 46 transition count 47
Applied a total of 10 rules in 17 ms. Remains 46 /50 variables (removed 4) and now considering 47/55 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 46/50 places, 47/55 transitions.
Incomplete random walk after 10000 steps, including 2164 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 502 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 478 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 949 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Finished probabilistic random walk after 374 steps, run visited all 3 properties in 16 ms. (steps per millisecond=23 )
Probabilistic random walk after 374 steps, saw 199 distinct states, run finished after 16 ms. (steps per millisecond=23 ) properties seen :3
Parikh walk visited 0 properties in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d0m160-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 10 simplifications.
FORMULA RingSingleMessageInMbox-PT-d0m160-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 5 stabilizing places and 11 stable transitions
Graph (complete) has 153 edges and 50 vertex of which 49 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||X(p1)) U p2))'
Support contains 6 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 55/55 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 46 transition count 49
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 46 transition count 49
Applied a total of 8 rules in 2 ms. Remains 46 /50 variables (removed 4) and now considering 49/55 (removed 6) transitions.
// Phase 1: matrix 49 rows 46 cols
[2024-05-27 20:00:57] [INFO ] Computed 3 invariants in 2 ms
[2024-05-27 20:00:57] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-27 20:00:57] [INFO ] Invariant cache hit.
[2024-05-27 20:00:57] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-27 20:00:57] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2024-05-27 20:00:57] [INFO ] Invariant cache hit.
[2024-05-27 20:00:57] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 46/50 places, 49/55 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 164 ms. Remains : 46/50 places, 49/55 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 228 ms :[true, (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : RingSingleMessageInMbox-PT-d0m160-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p2:(AND (GEQ s1 1) (GEQ s45 1)), p0:(AND (GEQ s0 1) (GEQ s14 1)), p1:(AND (GEQ s13 1) (GEQ s30 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA RingSingleMessageInMbox-PT-d0m160-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d0m160-LTLFireability-00 finished in 460 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((!p0 U (G(!p0)||p1)) U (G((!p0 U (p1||G(!p0))))||(G(!p2)&&(!p0 U (p1||G(!p0))))))))'
Support contains 5 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 55/55 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 46 transition count 49
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 46 transition count 49
Applied a total of 8 rules in 6 ms. Remains 46 /50 variables (removed 4) and now considering 49/55 (removed 6) transitions.
[2024-05-27 20:00:57] [INFO ] Invariant cache hit.
[2024-05-27 20:00:57] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-27 20:00:57] [INFO ] Invariant cache hit.
[2024-05-27 20:00:57] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-27 20:00:57] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2024-05-27 20:00:57] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-27 20:00:57] [INFO ] Invariant cache hit.
[2024-05-27 20:00:57] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/50 places, 49/55 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 166 ms. Remains : 46/50 places, 49/55 transitions.
Stuttering acceptance computed with spot in 119 ms :[(AND p0 (NOT p1)), (AND p0 p2 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : RingSingleMessageInMbox-PT-d0m160-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p0) p2) (AND p1 p2)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 2}], [{ cond=(OR (AND (NOT p0) p2) (AND p1 p2)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={0, 1} source=1 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s32 1)), p2:(AND (GEQ s1 1) (GEQ s24 1)), p1:(AND (NOT (AND (GEQ s3 1) (GEQ s14 1))) (NOT (AND (GEQ s1 1) (GEQ s32 1))))], nbAcceptance=2, 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 21609 reset in 247 ms.
Product exploration explored 100000 steps with 21535 reset in 188 ms.
Computed a total of 4 stabilizing places and 8 stable transitions
Graph (complete) has 142 edges and 46 vertex of which 45 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 4 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 177 ms. Reduced automaton from 3 states, 10 edges and 3 AP (stutter insensitive) to 3 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 125 ms :[(AND p0 (NOT p1)), (AND p0 p2 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2128 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10000 steps, including 482 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 581 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 552 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2024-05-27 20:00:58] [INFO ] Invariant cache hit.
[2024-05-27 20:00:58] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-27 20:00:58] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-27 20:00:58] [INFO ] After 64ms 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 (NOT p0) (NOT p2) p1), (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (G (NOT (AND p0 p2 (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2) (NOT p1))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p2) (NOT p1))), (F (OR (AND (NOT p0) p2) (AND p2 p1))), (F (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 16 factoid took 455 ms. Reduced automaton from 3 states, 10 edges and 3 AP (stutter insensitive) to 3 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 124 ms :[(AND p0 (NOT p1)), (AND p0 p2 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 127 ms :[(AND p0 (NOT p1)), (AND p0 p2 (NOT p1)), (AND p0 (NOT p1))]
Support contains 5 out of 46 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 49/49 transitions.
Applied a total of 0 rules in 3 ms. Remains 46 /46 variables (removed 0) and now considering 49/49 (removed 0) transitions.
[2024-05-27 20:00:59] [INFO ] Invariant cache hit.
[2024-05-27 20:00:59] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-27 20:00:59] [INFO ] Invariant cache hit.
[2024-05-27 20:00:59] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-27 20:00:59] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2024-05-27 20:00:59] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-27 20:00:59] [INFO ] Invariant cache hit.
[2024-05-27 20:00:59] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 152 ms. Remains : 46/46 places, 49/49 transitions.
Computed a total of 4 stabilizing places and 8 stable transitions
Graph (complete) has 142 edges and 46 vertex of which 45 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 4 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1))), (X (NOT (OR (AND (NOT p0) p2) (AND p2 p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p2 p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 152 ms. Reduced automaton from 3 states, 10 edges and 3 AP (stutter insensitive) to 3 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 129 ms :[(AND p0 (NOT p1)), (AND p0 p2 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2139 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 7) seen :6
Incomplete Best-First random walk after 10000 steps, including 557 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-27 20:01:00] [INFO ] Invariant cache hit.
[2024-05-27 20:01:00] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-27 20:01:00] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-27 20:01:00] [INFO ] After 35ms 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 (NOT p0) (NOT p2) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1))), (X (NOT (OR (AND (NOT p0) p2) (AND p2 p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p2 p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (G (NOT (AND p0 p2 (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2) (NOT p1))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p2) (NOT p1))), (F (OR (AND (NOT p0) p2) (AND p2 p1))), (F (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 16 factoid took 470 ms. Reduced automaton from 3 states, 10 edges and 3 AP (stutter insensitive) to 3 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[(AND p0 (NOT p1)), (AND p0 p2 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 379 ms :[(AND p0 (NOT p1)), (AND p0 p2 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 109 ms :[(AND p0 (NOT p1)), (AND p0 p2 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 21566 reset in 126 ms.
Product exploration explored 100000 steps with 21512 reset in 130 ms.
Built C files in :
/tmp/ltsmin11073519548090271875
[2024-05-27 20:01:01] [INFO ] Computing symmetric may disable matrix : 49 transitions.
[2024-05-27 20:01:01] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:01:01] [INFO ] Computing symmetric may enable matrix : 49 transitions.
[2024-05-27 20:01:01] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:01:01] [INFO ] Computing Do-Not-Accords matrix : 49 transitions.
[2024-05-27 20:01:01] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:01:01] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11073519548090271875
Running compilation step : cd /tmp/ltsmin11073519548090271875;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 223 ms.
Running link step : cd /tmp/ltsmin11073519548090271875;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin11073519548090271875;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14888273541899234438.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 46 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 49/49 transitions.
Applied a total of 0 rules in 7 ms. Remains 46 /46 variables (removed 0) and now considering 49/49 (removed 0) transitions.
[2024-05-27 20:01:16] [INFO ] Invariant cache hit.
[2024-05-27 20:01:16] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-27 20:01:16] [INFO ] Invariant cache hit.
[2024-05-27 20:01:16] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-27 20:01:16] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2024-05-27 20:01:16] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-27 20:01:16] [INFO ] Invariant cache hit.
[2024-05-27 20:01:16] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 148 ms. Remains : 46/46 places, 49/49 transitions.
Built C files in :
/tmp/ltsmin18351591501447682108
[2024-05-27 20:01:16] [INFO ] Computing symmetric may disable matrix : 49 transitions.
[2024-05-27 20:01:16] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:01:16] [INFO ] Computing symmetric may enable matrix : 49 transitions.
[2024-05-27 20:01:16] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:01:16] [INFO ] Computing Do-Not-Accords matrix : 49 transitions.
[2024-05-27 20:01:16] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:01:16] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18351591501447682108
Running compilation step : cd /tmp/ltsmin18351591501447682108;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 131 ms.
Running link step : cd /tmp/ltsmin18351591501447682108;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin18351591501447682108;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13806726844860531609.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-27 20:01:31] [INFO ] Flatten gal took : 5 ms
[2024-05-27 20:01:31] [INFO ] Flatten gal took : 4 ms
[2024-05-27 20:01:31] [INFO ] Time to serialize gal into /tmp/LTL5241042531638335056.gal : 2 ms
[2024-05-27 20:01:31] [INFO ] Time to serialize properties into /tmp/LTL6688346321914958801.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5241042531638335056.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8201873459414363633.hoa' '-atoms' '/tmp/LTL6688346321914958801.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL6688346321914958801.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8201873459414363633.hoa
Detected timeout of ITS tools.
[2024-05-27 20:01:47] [INFO ] Flatten gal took : 5 ms
[2024-05-27 20:01:47] [INFO ] Flatten gal took : 4 ms
[2024-05-27 20:01:47] [INFO ] Time to serialize gal into /tmp/LTL4086958753366043082.gal : 1 ms
[2024-05-27 20:01:47] [INFO ] Time to serialize properties into /tmp/LTL16795733423768513427.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4086958753366043082.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16795733423768513427.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(((!("((s1>=1)&&(l287>=1))"))U((G(!("((s1>=1)&&(l287>=1))")))||("((!((s3>=1)&&(l0>=1)))&&(!((s1>=1)&&(l287>=1))))")))U((G((!("((s1...419
Formula 0 simplified : G(F(!"((!((s3>=1)&&(l0>=1)))&&(!((s1>=1)&&(l287>=1))))" & "((s1>=1)&&(l287>=1))") & (F"((s1>=1)&&(l255>=1))" | ("((s1>=1)&&(l287>=1)...214
Detected timeout of ITS tools.
[2024-05-27 20:02:02] [INFO ] Flatten gal took : 9 ms
[2024-05-27 20:02:02] [INFO ] Applying decomposition
[2024-05-27 20:02:02] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph17991774495891423348.txt' '-o' '/tmp/graph17991774495891423348.bin' '-w' '/tmp/graph17991774495891423348.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph17991774495891423348.bin' '-l' '-1' '-v' '-w' '/tmp/graph17991774495891423348.weights' '-q' '0' '-e' '0.001'
[2024-05-27 20:02:02] [INFO ] Decomposing Gal with order
[2024-05-27 20:02:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 20:02:02] [INFO ] Removed a total of 44 redundant transitions.
[2024-05-27 20:02:02] [INFO ] Flatten gal took : 35 ms
[2024-05-27 20:02:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 4 ms.
[2024-05-27 20:02:02] [INFO ] Time to serialize gal into /tmp/LTL10304332453718146927.gal : 2 ms
[2024-05-27 20:02:02] [INFO ] Time to serialize properties into /tmp/LTL4247340586300449885.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10304332453718146927.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4247340586300449885.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(((!("((i3.u0.s1>=1)&&(i5.u7.l287>=1))"))U((G(!("((i3.u0.s1>=1)&&(i5.u7.l287>=1))")))||("((!((i2.u1.s3>=1)&&(i3.u0.l0>=1)))&&(!((i...575
Formula 0 simplified : G(F(!"((!((i2.u1.s3>=1)&&(i3.u0.l0>=1)))&&(!((i3.u0.s1>=1)&&(i5.u7.l287>=1))))" & "((i3.u0.s1>=1)&&(i5.u7.l287>=1))") & (F"((i3.u0.s...298
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1181750912793566376
[2024-05-27 20:02:17] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1181750912793566376
Running compilation step : cd /tmp/ltsmin1181750912793566376;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 120 ms.
Running link step : cd /tmp/ltsmin1181750912793566376;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin1181750912793566376;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(((!(LTLAPp0==true) U ([](!(LTLAPp0==true))||(LTLAPp1==true))) U ([]((!(LTLAPp0==true) U ((LTLAPp1==true)||[](!(LTLAPp0==true)))))||([](!(LTLAPp2==true))&&(!(LTLAPp0==true) U ((LTLAPp1==true)||[](!(LTLAPp0==true))))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property RingSingleMessageInMbox-PT-d0m160-LTLFireability-01 finished in 94912 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 55/55 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 46 transition count 49
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 46 transition count 49
Applied a total of 8 rules in 10 ms. Remains 46 /50 variables (removed 4) and now considering 49/55 (removed 6) transitions.
[2024-05-27 20:02:32] [INFO ] Invariant cache hit.
[2024-05-27 20:02:32] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-27 20:02:32] [INFO ] Invariant cache hit.
[2024-05-27 20:02:32] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-27 20:02:32] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2024-05-27 20:02:32] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-27 20:02:32] [INFO ] Invariant cache hit.
[2024-05-27 20:02:32] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/50 places, 49/55 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 162 ms. Remains : 46/50 places, 49/55 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d0m160-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s43 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d0m160-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d0m160-LTLFireability-03 finished in 212 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0 U (p1||G(p2))))))'
Support contains 5 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 55/55 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 47 transition count 50
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 47 transition count 50
Applied a total of 6 rules in 5 ms. Remains 47 /50 variables (removed 3) and now considering 50/55 (removed 5) transitions.
// Phase 1: matrix 50 rows 47 cols
[2024-05-27 20:02:32] [INFO ] Computed 3 invariants in 3 ms
[2024-05-27 20:02:32] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-27 20:02:32] [INFO ] Invariant cache hit.
[2024-05-27 20:02:32] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-27 20:02:32] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2024-05-27 20:02:32] [INFO ] Invariant cache hit.
[2024-05-27 20:02:32] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 47/50 places, 50/55 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 130 ms. Remains : 47/50 places, 50/55 transitions.
Stuttering acceptance computed with spot in 293 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true, (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : RingSingleMessageInMbox-PT-d0m160-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s12 1) (GEQ s15 1)), p0:(AND (GEQ s1 1) (GEQ s43 1)), p2:(AND (GEQ s1 1) (GEQ s23 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], 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 RingSingleMessageInMbox-PT-d0m160-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d0m160-LTLFireability-09 finished in 439 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 55/55 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 47 transition count 50
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 47 transition count 50
Applied a total of 6 rules in 9 ms. Remains 47 /50 variables (removed 3) and now considering 50/55 (removed 5) transitions.
// Phase 1: matrix 50 rows 47 cols
[2024-05-27 20:02:32] [INFO ] Computed 3 invariants in 1 ms
[2024-05-27 20:02:33] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-27 20:02:33] [INFO ] Invariant cache hit.
[2024-05-27 20:02:33] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-27 20:02:33] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2024-05-27 20:02:33] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-27 20:02:33] [INFO ] Invariant cache hit.
[2024-05-27 20:02:33] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 47/50 places, 50/55 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 156 ms. Remains : 47/50 places, 50/55 transitions.
Stuttering acceptance computed with spot in 98 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d0m160-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s37 1)), p1:(OR (LT s1 1) (LT s35 1))], 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 21695 reset in 131 ms.
Product exploration explored 100000 steps with 21721 reset in 125 ms.
Computed a total of 4 stabilizing places and 8 stable transitions
Graph (complete) has 144 edges and 47 vertex of which 46 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 4 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 72 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 2168 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 499 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-27 20:02:33] [INFO ] Invariant cache hit.
[2024-05-27 20:02:33] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-27 20:02:33] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-27 20:02:33] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 20:02:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-27 20:02:33] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-27 20:02:33] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-27 20:02:33] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-27 20:02:33] [INFO ] After 5ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-27 20:02:33] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2024-05-27 20:02:33] [INFO ] After 63ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 47 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 47/47 places, 50/50 transitions.
Graph (complete) has 124 edges and 47 vertex of which 46 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 46 transition count 47
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 45 transition count 46
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 45 transition count 46
Applied a total of 6 rules in 6 ms. Remains 45 /47 variables (removed 2) and now considering 46/50 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 45/47 places, 46/50 transitions.
Incomplete random walk after 10000 steps, including 2159 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Finished Best-First random walk after 7782 steps, including 395 resets, run visited all 1 properties in 4 ms. (steps per millisecond=1945 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 150 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 99 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 3 out of 47 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 places, 50/50 transitions.
Applied a total of 0 rules in 8 ms. Remains 47 /47 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2024-05-27 20:02:34] [INFO ] Invariant cache hit.
[2024-05-27 20:02:34] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-27 20:02:34] [INFO ] Invariant cache hit.
[2024-05-27 20:02:34] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-27 20:02:34] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2024-05-27 20:02:34] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-27 20:02:34] [INFO ] Invariant cache hit.
[2024-05-27 20:02:34] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 150 ms. Remains : 47/47 places, 50/50 transitions.
Computed a total of 4 stabilizing places and 8 stable transitions
Graph (complete) has 144 edges and 47 vertex of which 46 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 4 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 91 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 2169 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 510 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-27 20:02:34] [INFO ] Invariant cache hit.
[2024-05-27 20:02:34] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-27 20:02:34] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-27 20:02:34] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 20:02:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-27 20:02:34] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-27 20:02:34] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-27 20:02:34] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-27 20:02:34] [INFO ] After 8ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-27 20:02:34] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2024-05-27 20:02:34] [INFO ] After 54ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 47 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 47/47 places, 50/50 transitions.
Graph (complete) has 124 edges and 47 vertex of which 46 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 46 transition count 47
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 45 transition count 46
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 45 transition count 46
Applied a total of 6 rules in 5 ms. Remains 45 /47 variables (removed 2) and now considering 46/50 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 45/47 places, 46/50 transitions.
Incomplete random walk after 10000 steps, including 2157 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 519 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 102 steps, run visited all 1 properties in 8 ms. (steps per millisecond=12 )
Probabilistic random walk after 102 steps, saw 62 distinct states, run finished after 8 ms. (steps per millisecond=12 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 132 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 21818 reset in 88 ms.
Product exploration explored 100000 steps with 21801 reset in 92 ms.
Built C files in :
/tmp/ltsmin10002118423711188479
[2024-05-27 20:02:35] [INFO ] Computing symmetric may disable matrix : 50 transitions.
[2024-05-27 20:02:35] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:02:35] [INFO ] Computing symmetric may enable matrix : 50 transitions.
[2024-05-27 20:02:35] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:02:35] [INFO ] Computing Do-Not-Accords matrix : 50 transitions.
[2024-05-27 20:02:35] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:02:35] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10002118423711188479
Running compilation step : cd /tmp/ltsmin10002118423711188479;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 146 ms.
Running link step : cd /tmp/ltsmin10002118423711188479;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin10002118423711188479;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1125203206305759226.hoa' '--buchi-type=spotba'
LTSmin run took 80 ms.
FORMULA RingSingleMessageInMbox-PT-d0m160-LTLFireability-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property RingSingleMessageInMbox-PT-d0m160-LTLFireability-10 finished in 2755 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 55/55 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 46 transition count 49
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 46 transition count 49
Applied a total of 8 rules in 4 ms. Remains 46 /50 variables (removed 4) and now considering 49/55 (removed 6) transitions.
// Phase 1: matrix 49 rows 46 cols
[2024-05-27 20:02:35] [INFO ] Computed 3 invariants in 1 ms
[2024-05-27 20:02:35] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-27 20:02:35] [INFO ] Invariant cache hit.
[2024-05-27 20:02:35] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-27 20:02:35] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2024-05-27 20:02:35] [INFO ] Invariant cache hit.
[2024-05-27 20:02:35] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 46/50 places, 49/55 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 124 ms. Remains : 46/50 places, 49/55 transitions.
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d0m160-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s1 1) (GEQ s14 1))], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d0m160-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d0m160-LTLFireability-12 finished in 219 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(!p0)))'
Support contains 2 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 55/55 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 46 transition count 49
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 46 transition count 49
Applied a total of 8 rules in 4 ms. Remains 46 /50 variables (removed 4) and now considering 49/55 (removed 6) transitions.
[2024-05-27 20:02:35] [INFO ] Invariant cache hit.
[2024-05-27 20:02:35] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-27 20:02:35] [INFO ] Invariant cache hit.
[2024-05-27 20:02:36] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-27 20:02:36] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2024-05-27 20:02:36] [INFO ] Invariant cache hit.
[2024-05-27 20:02:36] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 46/50 places, 49/55 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 132 ms. Remains : 46/50 places, 49/55 transitions.
Stuttering acceptance computed with spot in 78 ms :[true, p0, p0]
Running random walk in product with property : RingSingleMessageInMbox-PT-d0m160-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s4 1) (GEQ s14 1))], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 59 steps with 13 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d0m160-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d0m160-LTLFireability-13 finished in 227 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((X(F(p1))||p0)))))'
Support contains 5 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 55/55 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 47 transition count 52
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 47 transition count 52
Applied a total of 6 rules in 6 ms. Remains 47 /50 variables (removed 3) and now considering 52/55 (removed 3) transitions.
// Phase 1: matrix 52 rows 47 cols
[2024-05-27 20:02:36] [INFO ] Computed 3 invariants in 6 ms
[2024-05-27 20:02:36] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-27 20:02:36] [INFO ] Invariant cache hit.
[2024-05-27 20:02:36] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-27 20:02:36] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
[2024-05-27 20:02:36] [INFO ] Invariant cache hit.
[2024-05-27 20:02:36] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 47/50 places, 52/55 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 140 ms. Remains : 47/50 places, 52/55 transitions.
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d0m160-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (GEQ s2 1) (GEQ s28 1)) (AND (GEQ s1 1) (GEQ s37 1))), p1:(AND (GEQ s1 1) (GEQ s24 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d0m160-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d0m160-LTLFireability-14 finished in 318 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((!p0&&X(F(!p1)))) U p2))'
Support contains 5 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 55/55 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 48 transition count 53
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 48 transition count 53
Applied a total of 4 rules in 4 ms. Remains 48 /50 variables (removed 2) and now considering 53/55 (removed 2) transitions.
// Phase 1: matrix 53 rows 48 cols
[2024-05-27 20:02:36] [INFO ] Computed 3 invariants in 0 ms
[2024-05-27 20:02:36] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-27 20:02:36] [INFO ] Invariant cache hit.
[2024-05-27 20:02:36] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-27 20:02:36] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2024-05-27 20:02:36] [INFO ] Invariant cache hit.
[2024-05-27 20:02:36] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 48/50 places, 53/55 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 130 ms. Remains : 48/50 places, 53/55 transitions.
Stuttering acceptance computed with spot in 115 ms :[(NOT p2), (OR p1 p0), p1]
Running random walk in product with property : RingSingleMessageInMbox-PT-d0m160-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s22 1)), p0:(AND (GEQ s13 1) (GEQ s15 1)), p1:(AND (GEQ s1 1) (GEQ s40 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 24 steps with 9 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d0m160-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d0m160-LTLFireability-15 finished in 268 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((!p0 U (G(!p0)||p1)) U (G((!p0 U (p1||G(!p0))))||(G(!p2)&&(!p0 U (p1||G(!p0))))))))'
[2024-05-27 20:02:36] [INFO ] Flatten gal took : 10 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9842645793240849025
[2024-05-27 20:02:36] [INFO ] Computing symmetric may disable matrix : 55 transitions.
[2024-05-27 20:02:36] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:02:36] [INFO ] Applying decomposition
[2024-05-27 20:02:36] [INFO ] Computing symmetric may enable matrix : 55 transitions.
[2024-05-27 20:02:36] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:02:36] [INFO ] Flatten gal took : 4 ms
[2024-05-27 20:02:36] [INFO ] Computing Do-Not-Accords matrix : 55 transitions.
[2024-05-27 20:02:36] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:02:36] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9842645793240849025
Running compilation step : cd /tmp/ltsmin9842645793240849025;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph5004243622736086726.txt' '-o' '/tmp/graph5004243622736086726.bin' '-w' '/tmp/graph5004243622736086726.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5004243622736086726.bin' '-l' '-1' '-v' '-w' '/tmp/graph5004243622736086726.weights' '-q' '0' '-e' '0.001'
[2024-05-27 20:02:36] [INFO ] Decomposing Gal with order
[2024-05-27 20:02:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 20:02:36] [INFO ] Removed a total of 51 redundant transitions.
[2024-05-27 20:02:36] [INFO ] Flatten gal took : 8 ms
[2024-05-27 20:02:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 6 ms.
[2024-05-27 20:02:36] [INFO ] Time to serialize gal into /tmp/LTLFireability12370757712329399667.gal : 2 ms
[2024-05-27 20:02:36] [INFO ] Time to serialize properties into /tmp/LTLFireability13738711663031616869.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability12370757712329399667.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13738711663031616869.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((F(((!("((i0.u0.s1>=1)&&(i0.u6.l287>=1))"))U((G(!("((i0.u0.s1>=1)&&(i0.u6.l287>=1))")))||("((!((u1.s3>=1)&&(i0.u0.l0>=1)))&&(!((i0.u...566
Formula 0 simplified : G(F(!"((!((u1.s3>=1)&&(i0.u0.l0>=1)))&&(!((i0.u0.s1>=1)&&(i0.u6.l287>=1))))" & "((i0.u0.s1>=1)&&(i0.u6.l287>=1))") & (F"((i0.u0.s1>=...292
Compilation finished in 133 ms.
Running link step : cd /tmp/ltsmin9842645793240849025;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 22 ms.
Running LTSmin : cd /tmp/ltsmin9842645793240849025;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(((!(LTLAPp0==true) U ([](!(LTLAPp0==true))||(LTLAPp1==true))) U ([]((!(LTLAPp0==true) U ((LTLAPp1==true)||[](!(LTLAPp0==true)))))||([](!(LTLAPp2==true))&&(!(LTLAPp0==true) U ((LTLAPp1==true)||[](!(LTLAPp0==true))))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.006: LTL layer: formula: <>(((!(LTLAPp0==true) U ([](!(LTLAPp0==true))||(LTLAPp1==true))) U ([]((!(LTLAPp0==true) U ((LTLAPp1==true)||[](!(LTLAPp0==true)))))||([](!(LTLAPp2==true))&&(!(LTLAPp0==true) U ((LTLAPp1==true)||[](!(LTLAPp0==true))))))))
pins2lts-mc-linux64( 1/ 8), 0.006: "<>(((!(LTLAPp0==true) U ([](!(LTLAPp0==true))||(LTLAPp1==true))) U ([]((!(LTLAPp0==true) U ((LTLAPp1==true)||[](!(LTLAPp0==true)))))||([](!(LTLAPp2==true))&&(!(LTLAPp0==true) U ((LTLAPp1==true)||[](!(LTLAPp0==true))))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.006: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.013: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.014: Initializing POR dependencies: labels 58, guards 55
pins2lts-mc-linux64( 4/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.019: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.019: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.020: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.023: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.023: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.023: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.027: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.027: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.027: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.030: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.030: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.031: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.034: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.034: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.034: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.042: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.052: There are 59 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.052: State length is 51, there are 83 groups
pins2lts-mc-linux64( 0/ 8), 0.052: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.052: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.052: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.052: Visible groups: 0 / 83, labels: 3 / 59
pins2lts-mc-linux64( 0/ 8), 0.052: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.052: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.064: [Blue] ~41 levels ~960 states ~3832 transitions
pins2lts-mc-linux64( 0/ 8), 0.069: [Blue] ~75 levels ~1920 states ~7832 transitions
pins2lts-mc-linux64( 3/ 8), 0.082: [Blue] ~73 levels ~3840 states ~8912 transitions
pins2lts-mc-linux64( 3/ 8), 0.153: [Blue] ~122 levels ~7680 states ~18200 transitions
pins2lts-mc-linux64( 7/ 8), 0.240: [Blue] ~168 levels ~15360 states ~46256 transitions
pins2lts-mc-linux64( 3/ 8), 0.341: [Blue] ~232 levels ~30720 states ~76520 transitions
pins2lts-mc-linux64( 3/ 8), 0.552: [Blue] ~316 levels ~61440 states ~153808 transitions
pins2lts-mc-linux64( 7/ 8), 0.957: [Blue] ~311 levels ~122880 states ~414024 transitions
pins2lts-mc-linux64( 1/ 8), 1.521: [Blue] ~172 levels ~245760 states ~868256 transitions
pins2lts-mc-linux64( 1/ 8), 2.426: [Blue] ~217 levels ~491520 states ~1742992 transitions
pins2lts-mc-linux64( 1/ 8), 3.711: [Blue] ~267 levels ~983040 states ~3493696 transitions
pins2lts-mc-linux64( 1/ 8), 5.775: [Blue] ~337 levels ~1966080 states ~7005216 transitions
pins2lts-mc-linux64( 1/ 8), 9.470: [Blue] ~427 levels ~3932160 states ~14041488 transitions
pins2lts-mc-linux64( 1/ 8), 17.389: [Blue] ~532 levels ~7864320 states ~28123424 transitions
pins2lts-mc-linux64( 1/ 8), 32.453: [Blue] ~672 levels ~15728640 states ~56323376 transitions
pins2lts-mc-linux64( 1/ 8), 68.752: [Blue] ~207196 levels ~31457280 states ~110736672 transitions
pins2lts-mc-linux64( 2/ 8), 149.198: [Blue] ~38455 levels ~62914560 states ~167295680 transitions
pins2lts-mc-linux64( 2/ 8), 303.570: [Blue] ~61597 levels ~125829120 states ~336424792 transitions
pins2lts-mc-linux64( 3/ 8), 452.112: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 452.149:
pins2lts-mc-linux64( 0/ 8), 452.149: Explored 149908850 states 490158683 transitions, fanout: 3.270
pins2lts-mc-linux64( 0/ 8), 452.150: Total exploration time 452.080 sec (452.020 sec minimum, 452.044 sec on average)
pins2lts-mc-linux64( 0/ 8), 452.150: States per second: 331598, Transitions per second: 1084230
pins2lts-mc-linux64( 0/ 8), 452.150:
pins2lts-mc-linux64( 0/ 8), 452.150: State space has 134217354 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 452.150: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 452.150: blue states: 149908850 (111.69%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 452.150: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 452.150: all-red states: 51416 (0.04%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 452.150:
pins2lts-mc-linux64( 0/ 8), 452.150: Total memory used for local state coloring: 25.7MB
pins2lts-mc-linux64( 0/ 8), 452.150:
pins2lts-mc-linux64( 0/ 8), 452.150: Queue width: 8B, total height: 1683308, memory: 12.84MB
pins2lts-mc-linux64( 0/ 8), 452.150: Tree memory: 1202.4MB, 9.4 B/state, compr.: 4.6%
pins2lts-mc-linux64( 0/ 8), 452.150: Tree fill ratio (roots/leafs): 99.0%/69.0%
pins2lts-mc-linux64( 0/ 8), 452.150: Stored 55 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 452.150: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 452.150: Est. total memory use: 1215.2MB (~1036.8MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9842645793240849025;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(((!(LTLAPp0==true) U ([](!(LTLAPp0==true))||(LTLAPp1==true))) U ([]((!(LTLAPp0==true) U ((LTLAPp1==true)||[](!(LTLAPp0==true)))))||([](!(LTLAPp2==true))&&(!(LTLAPp0==true) U ((LTLAPp1==true)||[](!(LTLAPp0==true))))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9842645793240849025;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(((!(LTLAPp0==true) U ([](!(LTLAPp0==true))||(LTLAPp1==true))) U ([]((!(LTLAPp0==true) U ((LTLAPp1==true)||[](!(LTLAPp0==true)))))||([](!(LTLAPp2==true))&&(!(LTLAPp0==true) U ((LTLAPp1==true)||[](!(LTLAPp0==true))))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-27 20:23:11] [INFO ] Flatten gal took : 6 ms
[2024-05-27 20:23:11] [INFO ] Time to serialize gal into /tmp/LTLFireability11748812188605429391.gal : 1 ms
[2024-05-27 20:23:11] [INFO ] Time to serialize properties into /tmp/LTLFireability8520714548521600095.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability11748812188605429391.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8520714548521600095.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !((F(((!("((s1>=1)&&(l287>=1))"))U((G(!("((s1>=1)&&(l287>=1))")))||("((!((s3>=1)&&(l0>=1)))&&(!((s1>=1)&&(l287>=1))))")))U((G((!("((s1...419
Formula 0 simplified : G(F(!"((!((s3>=1)&&(l0>=1)))&&(!((s1>=1)&&(l287>=1))))" & "((s1>=1)&&(l287>=1))") & (F"((s1>=1)&&(l255>=1))" | ("((s1>=1)&&(l287>=1)...214
Reverse transition relation is NOT exact ! Due to transitions t1, t7, t8, t9, t12, t23, t24, t25, t32, t39, t40, t41, t42, t43, t44, t45, t46, t49, t52, t5...256
Computing Next relation with stutter on 3.29756e+09 deadlock states
Detected timeout of ITS tools.
[2024-05-27 20:43:45] [INFO ] Flatten gal took : 5 ms
[2024-05-27 20:43:45] [INFO ] Input system was already deterministic with 55 transitions.
[2024-05-27 20:43:45] [INFO ] Transformed 50 places.
[2024-05-27 20:43:45] [INFO ] Transformed 55 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/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
[2024-05-27 20:43:45] [INFO ] Time to serialize gal into /tmp/LTLFireability14780982402319292418.gal : 2 ms
[2024-05-27 20:43:45] [INFO ] Time to serialize properties into /tmp/LTLFireability9154768542539016058.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability14780982402319292418.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9154768542539016058.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(((!("((s1>=1)&&(l287>=1))"))U((G(!("((s1>=1)&&(l287>=1))")))||("((!((s3>=1)&&(l0>=1)))&&(!((s1>=1)&&(l287>=1))))")))U((G((!("((s1...419
Formula 0 simplified : G(F(!"((!((s3>=1)&&(l0>=1)))&&(!((s1>=1)&&(l287>=1))))" & "((s1>=1)&&(l287>=1))") & (F"((s1>=1)&&(l255>=1))" | ("((s1>=1)&&(l287>=1)...214
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 11723144 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16040588 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is RingSingleMessageInMbox-PT-d0m160, 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 r351-tall-171679101500033"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/RingSingleMessageInMbox-PT-d0m160.tgz
mv RingSingleMessageInMbox-PT-d0m160 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 ;