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-171679101500028.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-d0m080, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r351-tall-171679101500028
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 23:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 139K Apr 12 23:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Apr 12 23:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Apr 12 23:46 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-d0m080-LTLFireability-00
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-LTLFireability-01
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-LTLFireability-02
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-LTLFireability-03
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-LTLFireability-04
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-LTLFireability-05
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-LTLFireability-06
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-LTLFireability-07
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-LTLFireability-08
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-LTLFireability-09
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-LTLFireability-10
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-LTLFireability-11
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-LTLFireability-12
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-LTLFireability-13
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-LTLFireability-14
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716840034268

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-d0m080
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-27 20:00:35] [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:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 20:00:36] [INFO ] Load time of PNML (sax parser for PT used): 49 ms
[2024-05-27 20:00:36] [INFO ] Transformed 385 places.
[2024-05-27 20:00:36] [INFO ] Transformed 59 transitions.
[2024-05-27 20:00:36] [INFO ] Parsed PT model containing 385 places and 59 transitions and 236 arcs in 330 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 3 formulas.
Deduced a syphon composed of 329 places in 0 ms
Reduce places removed 329 places and 0 transitions.
FORMULA RingSingleMessageInMbox-PT-d0m080-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m080-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m080-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 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 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 53 transition count 58
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 53 transition count 58
Applied a total of 4 rules in 12 ms. Remains 53 /56 variables (removed 3) and now considering 58/59 (removed 1) transitions.
// Phase 1: matrix 58 rows 53 cols
[2024-05-27 20:00:36] [INFO ] Computed 3 invariants in 5 ms
[2024-05-27 20:00:36] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-05-27 20:00:36] [INFO ] Invariant cache hit.
[2024-05-27 20:00:36] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-27 20:00:36] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
[2024-05-27 20:00:36] [INFO ] Invariant cache hit.
[2024-05-27 20:00:36] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 53/56 places, 58/59 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 319 ms. Remains : 53/56 places, 58/59 transitions.
Support contains 30 out of 53 places after structural reductions.
[2024-05-27 20:00:36] [INFO ] Flatten gal took : 20 ms
[2024-05-27 20:00:36] [INFO ] Flatten gal took : 11 ms
[2024-05-27 20:00:36] [INFO ] Input system was already deterministic with 58 transitions.
Incomplete random walk after 10000 steps, including 2170 resets, run finished after 496 ms. (steps per millisecond=20 ) properties (out of 29) seen :13
Incomplete Best-First random walk after 1001 steps, including 86 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 96 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 87 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 44 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 44 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 200 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000 steps, including 98 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 78 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000 steps, including 97 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000 steps, including 46 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 14) seen :6
Running SMT prover for 8 properties.
[2024-05-27 20:00:37] [INFO ] Invariant cache hit.
[2024-05-27 20:00:37] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-27 20:00:37] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-27 20:00:37] [INFO ] After 142ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:7
[2024-05-27 20:00:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-27 20:00:37] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-27 20:00:37] [INFO ] After 49ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :7
[2024-05-27 20:00:37] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-27 20:00:37] [INFO ] After 46ms SMT Verify possible using 27 Read/Feed constraints in natural domain returned unsat :1 sat :7
[2024-05-27 20:00:37] [INFO ] Deduced a trap composed of 29 places in 159 ms of which 4 ms to minimize.
[2024-05-27 20:00:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 164 ms
[2024-05-27 20:00:38] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 0 ms to minimize.
[2024-05-27 20:00:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2024-05-27 20:00:38] [INFO ] After 308ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :6
Attempting to minimize the solution found.
Minimization took 36 ms.
[2024-05-27 20:00:38] [INFO ] After 447ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :6
Fused 8 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 30 ms.
Support contains 10 out of 53 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 53/53 places, 58/58 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 50 transition count 53
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 50 transition count 53
Applied a total of 6 rules in 13 ms. Remains 50 /53 variables (removed 3) and now considering 53/58 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 50/53 places, 53/58 transitions.
Incomplete random walk after 10000 steps, including 2198 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 488 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2000 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 507 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 1013 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 493 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 944 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 53 rows 50 cols
[2024-05-27 20:00:38] [INFO ] Computed 3 invariants in 1 ms
[2024-05-27 20:00:38] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-27 20:00:38] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-27 20:00:38] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-27 20:00:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-27 20:00:38] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-27 20:00:38] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-27 20:00:38] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-27 20:00:38] [INFO ] After 28ms SMT Verify possible using 23 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-27 20:00:38] [INFO ] After 54ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 23 ms.
[2024-05-27 20:00:38] [INFO ] After 139ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 21 ms.
Support contains 9 out of 50 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50/50 places, 53/53 transitions.
Applied a total of 0 rules in 3 ms. Remains 50 /50 variables (removed 0) and now considering 53/53 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 50/50 places, 53/53 transitions.
Incomplete random walk after 10000 steps, including 2166 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 482 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 492 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 943 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 506 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-27 20:00:39] [INFO ] Invariant cache hit.
[2024-05-27 20:00:39] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-27 20:00:39] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 4 ms returned sat
[2024-05-27 20:00:39] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-27 20:00:39] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-27 20:00:39] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-27 20:00:39] [INFO ] After 22ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-27 20:00:39] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-27 20:00:39] [INFO ] After 13ms SMT Verify possible using 23 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-27 20:00:39] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 1 ms to minimize.
[2024-05-27 20:00:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2024-05-27 20:00:39] [INFO ] After 68ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 11 ms.
[2024-05-27 20:00:39] [INFO ] After 131ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 9 ms.
Support contains 6 out of 50 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50/50 places, 53/53 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 50
Applied a total of 4 rules in 11 ms. Remains 49 /50 variables (removed 1) and now considering 50/53 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 49/50 places, 50/53 transitions.
Incomplete random walk after 10000 steps, including 2181 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 506 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 925 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 508 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 3224136 steps, run timeout after 3001 ms. (steps per millisecond=1074 ) properties seen :{0=1, 1=1}
Probabilistic random walk after 3224136 steps, saw 1231429 distinct states, run finished after 3001 ms. (steps per millisecond=1074 ) properties seen :2
Running SMT prover for 1 properties.
// Phase 1: matrix 50 rows 49 cols
[2024-05-27 20:00:42] [INFO ] Computed 4 invariants in 1 ms
[2024-05-27 20:00:42] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-27 20:00:42] [INFO ] [Real]Absence check using 1 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 20:00:42] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 20:00:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-27 20:00:42] [INFO ] [Nat]Absence check using 1 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 20:00:42] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-27 20:00:42] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-27 20:00:42] [INFO ] After 4ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-27 20:00:42] [INFO ] After 9ms 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:00:42] [INFO ] After 62ms 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 49 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 50/50 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 47 transition count 48
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 47 transition count 48
Applied a total of 4 rules in 4 ms. Remains 47 /49 variables (removed 2) and now considering 48/50 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 47/49 places, 48/50 transitions.
Incomplete random walk after 10000 steps, including 2148 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 480 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3363842 steps, run timeout after 3001 ms. (steps per millisecond=1120 ) properties seen :{}
Probabilistic random walk after 3363842 steps, saw 1282278 distinct states, run finished after 3001 ms. (steps per millisecond=1120 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 48 rows 47 cols
[2024-05-27 20:00:45] [INFO ] Computed 4 invariants in 3 ms
[2024-05-27 20:00:45] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-27 20:00:45] [INFO ] [Real]Absence check using 1 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 20:00:45] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 20:00:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-27 20:00:45] [INFO ] [Nat]Absence check using 1 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 20:00:45] [INFO ] After 27ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-27 20:00:45] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-27 20:00:45] [INFO ] After 5ms SMT Verify possible using 19 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-27 20:00:45] [INFO ] After 10ms 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:00:45] [INFO ] After 86ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 47 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 47/47 places, 48/48 transitions.
Applied a total of 0 rules in 3 ms. Remains 47 /47 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 47/47 places, 48/48 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 47/47 places, 48/48 transitions.
Applied a total of 0 rules in 2 ms. Remains 47 /47 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2024-05-27 20:00:45] [INFO ] Invariant cache hit.
[2024-05-27 20:00:45] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-27 20:00:45] [INFO ] Invariant cache hit.
[2024-05-27 20:00:45] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-27 20:00:46] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
[2024-05-27 20:00:46] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-27 20:00:46] [INFO ] Invariant cache hit.
[2024-05-27 20:00:46] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 205 ms. Remains : 47/47 places, 48/48 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 47 transition count 46
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 46 transition count 46
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 3 place count 46 transition count 39
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 17 place count 39 transition count 39
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 25 place count 35 transition count 35
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 27 place count 34 transition count 35
Applied a total of 27 rules in 12 ms. Remains 34 /47 variables (removed 13) and now considering 35/48 (removed 13) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 35 rows 34 cols
[2024-05-27 20:00:46] [INFO ] Computed 5 invariants in 2 ms
[2024-05-27 20:00:46] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-27 20:00:46] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-27 20:00:46] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 20:00:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-27 20:00:46] [INFO ] [Nat]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-27 20:00:46] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-27 20:00:46] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-05-27 20:00:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2024-05-27 20:00:46] [INFO ] After 46ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :0
[2024-05-27 20:00:46] [INFO ] After 72ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Successfully simplified 3 atomic propositions for a total of 13 simplifications.
FORMULA RingSingleMessageInMbox-PT-d0m080-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m080-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 6 stabilizing places and 12 stable transitions
Graph (complete) has 161 edges and 53 vertex of which 52 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
FORMULA RingSingleMessageInMbox-PT-d0m080-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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(((p1&&F((G(F((p2 U (p3||G(p2)))))||(!p4&&F((p2 U (p3||G(p2))))))))||p0)))'
Support contains 9 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 58/58 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 48 transition count 51
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 48 transition count 51
Applied a total of 10 rules in 2 ms. Remains 48 /53 variables (removed 5) and now considering 51/58 (removed 7) transitions.
// Phase 1: matrix 51 rows 48 cols
[2024-05-27 20:00:46] [INFO ] Computed 3 invariants in 1 ms
[2024-05-27 20:00:46] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-27 20:00:46] [INFO ] Invariant cache hit.
[2024-05-27 20:00:46] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-27 20:00:46] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
[2024-05-27 20:00:46] [INFO ] Invariant cache hit.
[2024-05-27 20:00:46] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 48/53 places, 51/58 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 224 ms. Remains : 48/53 places, 51/58 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 368 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), true, (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2))]
Running random walk in product with property : RingSingleMessageInMbox-PT-d0m080-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1 p4), acceptance={} source=1 dest: 3}, { cond=(OR (AND (NOT p0) p1 (NOT p3) (NOT p2)) (AND (NOT p0) p1 (NOT p3) (NOT p4))), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p4, acceptance={} source=3 dest: 3}, { cond=(OR (AND (NOT p3) (NOT p2)) (AND (NOT p3) (NOT p4))), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p3) p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (LT s7 1) (LT s15 1)), p1:(OR (LT s1 1) (LT s43 1) (LT s42 1)), p4:(AND (GEQ s2 1) (GEQ s21 1)), p3:(AND (NOT (AND (GEQ s1 1) (GEQ s42 1))) (GEQ s9...], 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]]
Product exploration explored 100000 steps with 50000 reset in 278 ms.
Product exploration explored 100000 steps with 50000 reset in 190 ms.
Computed a total of 4 stabilizing places and 8 stable transitions
Graph (complete) has 147 edges and 48 vertex of which 47 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 (NOT p4) (NOT p3) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1 p4))), (X (NOT (OR (AND (NOT p0) p1 (NOT p3) (NOT p2)) (AND (NOT p0) p1 (NOT p3) (NOT p4))))), true, (X (X (NOT p4))), (X (X (OR (AND (NOT p3) (NOT p2)) (AND (NOT p3) (NOT p4))))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (AND (NOT p3) (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 86 ms. Reduced automaton from 5 states, 9 edges and 5 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RingSingleMessageInMbox-PT-d0m080-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RingSingleMessageInMbox-PT-d0m080-LTLFireability-01 finished in 1249 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(p0)))||(G(p1)&&X(G(p2)))))'
Support contains 5 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 58/58 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 47 transition count 50
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 47 transition count 50
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 46 transition count 49
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 46 transition count 49
Applied a total of 14 rules in 3 ms. Remains 46 /53 variables (removed 7) and now considering 49/58 (removed 9) transitions.
// Phase 1: matrix 49 rows 46 cols
[2024-05-27 20:00:47] [INFO ] Computed 3 invariants in 0 ms
[2024-05-27 20:00:47] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-27 20:00:47] [INFO ] Invariant cache hit.
[2024-05-27 20:00:48] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-27 20:00:48] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
[2024-05-27 20:00:48] [INFO ] Invariant cache hit.
[2024-05-27 20:00:48] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 46/53 places, 49/58 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 180 ms. Remains : 46/53 places, 49/58 transitions.
Stuttering acceptance computed with spot in 342 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d0m080-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={} source=1 dest: 0}, { cond=(AND p1 p2 p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p1) p0) (AND (NOT p2) p0)), acceptance={} source=1 dest: 6}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p2), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=p1, acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={} source=4 dest: 6}], [{ cond=(AND p1 p2), acceptance={} source=5 dest: 1}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={} source=6 dest: 0}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=3, aps=[p1:(OR (LT s1 1) (LT s26 1)), p0:(OR (LT s10 1) (LT s20 1)), p2:(OR (LT s1 1) (LT s19 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, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2750 steps with 585 reset in 19 ms.
FORMULA RingSingleMessageInMbox-PT-d0m080-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d0m080-LTLFireability-02 finished in 558 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(!p0) U (X(G(!p0))||(!p1&&X((!p0&&G(!p2)))))))'
Support contains 5 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 58/58 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 47 transition count 50
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 47 transition count 50
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 46 transition count 49
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 46 transition count 49
Applied a total of 14 rules in 2 ms. Remains 46 /53 variables (removed 7) and now considering 49/58 (removed 9) transitions.
[2024-05-27 20:00:48] [INFO ] Invariant cache hit.
[2024-05-27 20:00:48] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-27 20:00:48] [INFO ] Invariant cache hit.
[2024-05-27 20:00:48] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-27 20:00:48] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
[2024-05-27 20:00:48] [INFO ] Invariant cache hit.
[2024-05-27 20:00:48] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 46/53 places, 49/58 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 172 ms. Remains : 46/53 places, 49/58 transitions.
Stuttering acceptance computed with spot in 206 ms :[true, p0, p2, (AND p0 p2), p0, p0]
Running random walk in product with property : RingSingleMessageInMbox-PT-d0m080-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 4}, { cond=p1, acceptance={} source=1 dest: 5}], [{ cond=p2, acceptance={} source=2 dest: 0}, { cond=(NOT p2), acceptance={} source=2 dest: 2}], [{ cond=(AND p0 p2), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=3 dest: 5}], [{ cond=p0, acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=4 dest: 4}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=4 dest: 5}], [{ cond=p0, acceptance={} source=5 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 5}]], initial=1, aps=[p1:(AND (GEQ s2 1) (GEQ s30 1)), p2:(AND (GEQ s1 1) (GEQ s38 1)), p0:(AND (GEQ s1 1) (GEQ s15 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, 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-d0m080-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d0m080-LTLFireability-04 finished in 396 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 58/58 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 47 transition count 50
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 47 transition count 50
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 46 transition count 49
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 46 transition count 49
Applied a total of 14 rules in 8 ms. Remains 46 /53 variables (removed 7) and now considering 49/58 (removed 9) transitions.
[2024-05-27 20:00:48] [INFO ] Invariant cache hit.
[2024-05-27 20:00:48] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-27 20:00:48] [INFO ] Invariant cache hit.
[2024-05-27 20:00:48] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-27 20:00:48] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2024-05-27 20:00:48] [INFO ] Invariant cache hit.
[2024-05-27 20:00:48] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 46/53 places, 49/58 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 138 ms. Remains : 46/53 places, 49/58 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d0m080-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (GEQ s8 1) (GEQ s28 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d0m080-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d0m080-LTLFireability-05 finished in 246 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||(p1 U X(p0))||(!p2&&F(p2)))))'
Support contains 3 out of 53 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 : 53/53 places, 58/58 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 48 transition count 53
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 48 transition count 53
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 47 transition count 52
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 47 transition count 52
Applied a total of 12 rules in 9 ms. Remains 47 /53 variables (removed 6) and now considering 52/58 (removed 6) transitions.
// Phase 1: matrix 52 rows 47 cols
[2024-05-27 20:00:49] [INFO ] Computed 3 invariants in 0 ms
[2024-05-27 20:00:49] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-27 20:00:49] [INFO ] Invariant cache hit.
[2024-05-27 20:00:49] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-27 20:00:49] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
[2024-05-27 20:00:49] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-27 20:00:49] [INFO ] Invariant cache hit.
[2024-05-27 20:00:49] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 47/53 places, 52/58 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 172 ms. Remains : 47/53 places, 52/58 transitions.
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d0m080-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p0:(AND (GEQ s1 1) (GEQ s16 1)), p2:(AND (GEQ s1 1) (GEQ s21 1))], 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][true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d0m080-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d0m080-LTLFireability-07 finished in 252 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 U p1)||(F(!p2) U p1)))'
Support contains 5 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 58/58 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 48 transition count 51
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 48 transition count 51
Applied a total of 10 rules in 5 ms. Remains 48 /53 variables (removed 5) and now considering 51/58 (removed 7) transitions.
// Phase 1: matrix 51 rows 48 cols
[2024-05-27 20:00:49] [INFO ] Computed 3 invariants in 0 ms
[2024-05-27 20:00:49] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-27 20:00:49] [INFO ] Invariant cache hit.
[2024-05-27 20:00:49] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-27 20:00:49] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
[2024-05-27 20:00:49] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-27 20:00:49] [INFO ] Invariant cache hit.
[2024-05-27 20:00:49] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 48/53 places, 51/58 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 192 ms. Remains : 48/53 places, 51/58 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p1), p2, (NOT p1)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d0m080-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=p2, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s7 1) (GEQ s16 1)), p0:(AND (GEQ s1 1) (GEQ s37 1)), p2:(AND (GEQ s13 1) (GEQ s16 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d0m080-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d0m080-LTLFireability-09 finished in 331 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(!p0))&&F((G(p2)&&p1))))'
Support contains 6 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 58/58 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 48 transition count 51
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 48 transition count 51
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 47 transition count 50
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 47 transition count 50
Applied a total of 12 rules in 3 ms. Remains 47 /53 variables (removed 6) and now considering 50/58 (removed 8) transitions.
// Phase 1: matrix 50 rows 47 cols
[2024-05-27 20:00:49] [INFO ] Computed 3 invariants in 1 ms
[2024-05-27 20:00:49] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-27 20:00:49] [INFO ] Invariant cache hit.
[2024-05-27 20:00:49] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-27 20:00:49] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
[2024-05-27 20:00:49] [INFO ] Invariant cache hit.
[2024-05-27 20:00:49] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 47/53 places, 50/58 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 185 ms. Remains : 47/53 places, 50/58 transitions.
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p2) (NOT p1) p0), p0, (OR (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d0m080-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND p1 p2), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (OR (LT s2 1) (LT s31 1)) (GEQ s1 1) (GEQ s39 1)), p2:(OR (LT s10 1) (LT s15 1)), p0:(AND (GEQ s1 1) (GEQ s39 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 4 steps with 1 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d0m080-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d0m080-LTLFireability-11 finished in 352 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 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 58/58 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 47 transition count 50
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 47 transition count 50
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 46 transition count 49
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 46 transition count 49
Applied a total of 14 rules in 6 ms. Remains 46 /53 variables (removed 7) and now considering 49/58 (removed 9) transitions.
// Phase 1: matrix 49 rows 46 cols
[2024-05-27 20:00:50] [INFO ] Computed 3 invariants in 1 ms
[2024-05-27 20:00:50] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-27 20:00:50] [INFO ] Invariant cache hit.
[2024-05-27 20:00:50] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-27 20:00:50] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
[2024-05-27 20:00:50] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-27 20:00:50] [INFO ] Invariant cache hit.
[2024-05-27 20:00:50] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/53 places, 49/58 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 203 ms. Remains : 46/53 places, 49/58 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d0m080-LTLFireability-13 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 s39 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 3 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d0m080-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d0m080-LTLFireability-13 finished in 254 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(((G(p1)&&F(G(p2)))||p0))))'
Support contains 6 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 58/58 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 48 transition count 51
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 48 transition count 51
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 47 transition count 50
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 47 transition count 50
Applied a total of 12 rules in 8 ms. Remains 47 /53 variables (removed 6) and now considering 50/58 (removed 8) transitions.
// Phase 1: matrix 50 rows 47 cols
[2024-05-27 20:00:50] [INFO ] Computed 3 invariants in 0 ms
[2024-05-27 20:00:50] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-27 20:00:50] [INFO ] Invariant cache hit.
[2024-05-27 20:00:50] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-27 20:00:50] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[2024-05-27 20:00:50] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-27 20:00:50] [INFO ] Invariant cache hit.
[2024-05-27 20:00:50] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 47/53 places, 50/58 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 180 ms. Remains : 47/53 places, 50/58 transitions.
Stuttering acceptance computed with spot in 133 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : RingSingleMessageInMbox-PT-d0m080-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s46 1)), p0:(OR (LT s10 1) (LT s15 1)), p2:(AND (GEQ s14 1) (GEQ s31 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 21521 reset in 162 ms.
Product exploration explored 100000 steps with 21486 reset in 147 ms.
Computed a total of 4 stabilizing places and 8 stable transitions
Graph (complete) has 145 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 (NOT p1) p0 (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 164 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 119 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2165 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 951 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 470 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 510 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 906 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-27 20:00:51] [INFO ] Invariant cache hit.
[2024-05-27 20:00:51] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-27 20:00:51] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-27 20:00:51] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (G (NOT (AND (NOT p0) p2))), (G (NOT (AND (NOT p0) p1))), (G (NOT (AND (NOT p0) p1 (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 14 factoid took 245 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 47 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 : 47/47 places, 50/50 transitions.
Applied a total of 0 rules in 2 ms. Remains 47 /47 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2024-05-27 20:00:51] [INFO ] Invariant cache hit.
[2024-05-27 20:00:51] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-27 20:00:51] [INFO ] Invariant cache hit.
[2024-05-27 20:00:51] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-27 20:00:51] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2024-05-27 20:00:51] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-27 20:00:51] [INFO ] Invariant cache hit.
[2024-05-27 20:00:51] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 137 ms. Remains : 47/47 places, 50/50 transitions.
Computed a total of 4 stabilizing places and 8 stable transitions
Graph (complete) has 145 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 64 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Finished random walk after 5031 steps, including 1073 resets, run visited all 1 properties in 6 ms. (steps per millisecond=838 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 139 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 21619 reset in 66 ms.
Product exploration explored 100000 steps with 21592 reset in 103 ms.
Built C files in :
/tmp/ltsmin3062589157235389229
[2024-05-27 20:00:52] [INFO ] Computing symmetric may disable matrix : 50 transitions.
[2024-05-27 20:00:52] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:00:52] [INFO ] Computing symmetric may enable matrix : 50 transitions.
[2024-05-27 20:00:52] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:00:52] [INFO ] Computing Do-Not-Accords matrix : 50 transitions.
[2024-05-27 20:00:52] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:00:52] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3062589157235389229
Running compilation step : cd /tmp/ltsmin3062589157235389229;'/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 225 ms.
Running link step : cd /tmp/ltsmin3062589157235389229;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin3062589157235389229;'/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/stateBased4611407953941994965.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 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 10 ms. Remains 47 /47 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2024-05-27 20:01:07] [INFO ] Invariant cache hit.
[2024-05-27 20:01:07] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-27 20:01:07] [INFO ] Invariant cache hit.
[2024-05-27 20:01:07] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-27 20:01:07] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
[2024-05-27 20:01:07] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-27 20:01:07] [INFO ] Invariant cache hit.
[2024-05-27 20:01:07] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 171 ms. Remains : 47/47 places, 50/50 transitions.
Built C files in :
/tmp/ltsmin12588588432658560532
[2024-05-27 20:01:07] [INFO ] Computing symmetric may disable matrix : 50 transitions.
[2024-05-27 20:01:07] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:01:07] [INFO ] Computing symmetric may enable matrix : 50 transitions.
[2024-05-27 20:01:07] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:01:07] [INFO ] Computing Do-Not-Accords matrix : 50 transitions.
[2024-05-27 20:01:07] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:01:07] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12588588432658560532
Running compilation step : cd /tmp/ltsmin12588588432658560532;'/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 123 ms.
Running link step : cd /tmp/ltsmin12588588432658560532;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 23 ms.
Running LTSmin : cd /tmp/ltsmin12588588432658560532;'/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/stateBased8472218547619772115.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-27 20:01:23] [INFO ] Flatten gal took : 5 ms
[2024-05-27 20:01:23] [INFO ] Flatten gal took : 4 ms
[2024-05-27 20:01:23] [INFO ] Time to serialize gal into /tmp/LTL14530325784192957135.gal : 2 ms
[2024-05-27 20:01:23] [INFO ] Time to serialize properties into /tmp/LTL17633924447101629862.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/LTL14530325784192957135.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2608387945705384779.hoa' '-atoms' '/tmp/LTL17633924447101629862.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...319
Loading property file /tmp/LTL17633924447101629862.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2608387945705384779.hoa
Reverse transition relation is NOT exact ! Due to transitions t1, t9, t10, t13, t41, t42, t43, t44, t45, t46, t47, t48, t51, t52, t55, Intersection with r...233
Computing Next relation with stutter on 1.21276e+07 deadlock states
Detected timeout of ITS tools.
[2024-05-27 20:01:38] [INFO ] Flatten gal took : 5 ms
[2024-05-27 20:01:38] [INFO ] Flatten gal took : 4 ms
[2024-05-27 20:01:38] [INFO ] Time to serialize gal into /tmp/LTL15809876140573254161.gal : 2 ms
[2024-05-27 20:01:38] [INFO ] Time to serialize properties into /tmp/LTL286766584765729064.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/LTL15809876140573254161.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL286766584765729064.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...275
Read 1 LTL properties
Checking formula 0 : !((G(F(("((p12<1)||(l0<1))")||((G("((s1>=1)&&(l364>=1))"))&&(F(G("((p17>=1)&&(l285>=1))"))))))))
Formula 0 simplified : G(F(!"((s1>=1)&&(l364>=1))" | GF!"((p17>=1)&&(l285>=1))") & FG!"((p12<1)||(l0<1))")
Reverse transition relation is NOT exact ! Due to transitions t1, t9, t10, t13, t41, t42, t43, t44, t45, t46, t47, t48, t51, t52, t55, Intersection with r...233
Computing Next relation with stutter on 1.21276e+07 deadlock states
Detected timeout of ITS tools.
[2024-05-27 20:01:53] [INFO ] Flatten gal took : 4 ms
[2024-05-27 20:01:53] [INFO ] Applying decomposition
[2024-05-27 20:01:53] [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/graph18103147676737799322.txt' '-o' '/tmp/graph18103147676737799322.bin' '-w' '/tmp/graph18103147676737799322.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph18103147676737799322.bin' '-l' '-1' '-v' '-w' '/tmp/graph18103147676737799322.weights' '-q' '0' '-e' '0.001'
[2024-05-27 20:01:53] [INFO ] Decomposing Gal with order
[2024-05-27 20:01:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 20:01:53] [INFO ] Removed a total of 45 redundant transitions.
[2024-05-27 20:01:53] [INFO ] Flatten gal took : 41 ms
[2024-05-27 20:01:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 25 labels/synchronizations in 4 ms.
[2024-05-27 20:01:53] [INFO ] Time to serialize gal into /tmp/LTL16173047129892352692.gal : 2 ms
[2024-05-27 20:01:53] [INFO ] Time to serialize properties into /tmp/LTL1916564662745982377.ltl : 13 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/LTL16173047129892352692.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1916564662745982377.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 : !((G(F(("((i3.u6.p12<1)||(i0.u0.l0<1))")||((G("((i0.u0.s1>=1)&&(i0.u11.l364>=1))"))&&(F(G("((i0.u11.p17>=1)&&(i0.u10.l285>=1))")))))))...156
Formula 0 simplified : G(F(!"((i0.u0.s1>=1)&&(i0.u11.l364>=1))" | GF!"((i0.u11.p17>=1)&&(i0.u10.l285>=1))") & FG!"((i3.u6.p12<1)||(i0.u0.l0<1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5242937517389407421
[2024-05-27 20:02:08] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5242937517389407421
Running compilation step : cd /tmp/ltsmin5242937517389407421;'/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 117 ms.
Running link step : cd /tmp/ltsmin5242937517389407421;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin5242937517389407421;'/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' '[](<>((([]((LTLAPp1==true))&&<>([]((LTLAPp2==true))))||(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property RingSingleMessageInMbox-PT-d0m080-LTLFireability-14 finished in 93341 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((F(p0)&&(p1 U !p2))))))'
Support contains 5 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 58/58 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 50 transition count 55
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 50 transition count 55
Applied a total of 6 rules in 3 ms. Remains 50 /53 variables (removed 3) and now considering 55/58 (removed 3) transitions.
// Phase 1: matrix 55 rows 50 cols
[2024-05-27 20:02:23] [INFO ] Computed 3 invariants in 2 ms
[2024-05-27 20:02:23] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-27 20:02:23] [INFO ] Invariant cache hit.
[2024-05-27 20:02:23] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-27 20:02:23] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
[2024-05-27 20:02:23] [INFO ] Invariant cache hit.
[2024-05-27 20:02:23] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 50/53 places, 55/58 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 168 ms. Remains : 50/53 places, 55/58 transitions.
Stuttering acceptance computed with spot in 247 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), true, (NOT p0), p2]
Running random walk in product with property : RingSingleMessageInMbox-PT-d0m080-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), acceptance={} source=2 dest: 4}, { cond=(AND p2 p1), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=5 dest: 3}, { cond=(AND p2 p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(OR (LT s11 1) (LT s16 1)), p1:(OR (AND (GEQ s1 1) (GEQ s29 1)) (AND (GEQ s1 1) (GEQ s23 1))), p0:(AND (GEQ s1 1) (GEQ s23 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, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA RingSingleMessageInMbox-PT-d0m080-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d0m080-LTLFireability-15 finished in 441 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(((G(p1)&&F(G(p2)))||p0))))'
[2024-05-27 20:02:24] [INFO ] Flatten gal took : 8 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11218350264530428337
[2024-05-27 20:02:24] [INFO ] Computing symmetric may disable matrix : 58 transitions.
[2024-05-27 20:02:24] [INFO ] Applying decomposition
[2024-05-27 20:02:24] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:02:24] [INFO ] Computing symmetric may enable matrix : 58 transitions.
[2024-05-27 20:02:24] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:02:24] [INFO ] Flatten gal took : 4 ms
[2024-05-27 20:02:24] [INFO ] Computing Do-Not-Accords matrix : 58 transitions.
[2024-05-27 20:02:24] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:02:24] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11218350264530428337
Running compilation step : cd /tmp/ltsmin11218350264530428337;'/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/graph7868558000319304794.txt' '-o' '/tmp/graph7868558000319304794.bin' '-w' '/tmp/graph7868558000319304794.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7868558000319304794.bin' '-l' '-1' '-v' '-w' '/tmp/graph7868558000319304794.weights' '-q' '0' '-e' '0.001'
[2024-05-27 20:02:24] [INFO ] Decomposing Gal with order
[2024-05-27 20:02:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 20:02:24] [INFO ] Removed a total of 46 redundant transitions.
[2024-05-27 20:02:24] [INFO ] Flatten gal took : 7 ms
[2024-05-27 20:02:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 2 ms.
[2024-05-27 20:02:24] [INFO ] Time to serialize gal into /tmp/LTLFireability9617041526641712274.gal : 2 ms
[2024-05-27 20:02:24] [INFO ] Time to serialize properties into /tmp/LTLFireability7350706785537765912.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/LTLFireability9617041526641712274.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7350706785537765912.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...276
Read 1 LTL properties
Checking formula 0 : !((G(F(("((i4.u6.p12<1)||(i0.u0.l0<1))")||((G("((i0.u0.s1>=1)&&(i6.u10.l364>=1))"))&&(F(G("((i6.u9.p17>=1)&&(i6.u9.l285>=1))"))))))))
Formula 0 simplified : G(F(!"((i0.u0.s1>=1)&&(i6.u10.l364>=1))" | GF!"((i6.u9.p17>=1)&&(i6.u9.l285>=1))") & FG!"((i4.u6.p12<1)||(i0.u0.l0<1))")
Compilation finished in 137 ms.
Running link step : cd /tmp/ltsmin11218350264530428337;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 23 ms.
Running LTSmin : cd /tmp/ltsmin11218350264530428337;'/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' '[](<>((([]((LTLAPp1==true))&&<>([]((LTLAPp2==true))))||(LTLAPp0==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.005: LTL layer: formula: [](<>((([]((LTLAPp1==true))&&<>([]((LTLAPp2==true))))||(LTLAPp0==true))))
pins2lts-mc-linux64( 1/ 8), 0.005: "[](<>((([]((LTLAPp1==true))&&<>([]((LTLAPp2==true))))||(LTLAPp0==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.005: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.010: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.011: Initializing POR dependencies: labels 61, guards 58
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.015: 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.019: 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.028: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.031: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.031: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.032: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.036: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.036: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.036: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.049: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.055: There are 62 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.055: State length is 54, there are 71 groups
pins2lts-mc-linux64( 0/ 8), 0.055: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.055: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.055: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.055: Visible groups: 0 / 71, labels: 3 / 62
pins2lts-mc-linux64( 0/ 8), 0.055: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.055: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.065: [Blue] ~41 levels ~960 states ~1864 transitions
pins2lts-mc-linux64( 0/ 8), 0.069: [Blue] ~75 levels ~1920 states ~3752 transitions
pins2lts-mc-linux64( 0/ 8), 0.090: [Blue] ~141 levels ~3840 states ~7464 transitions
pins2lts-mc-linux64( 1/ 8), 0.131: [Blue] ~50 levels ~7680 states ~14992 transitions
pins2lts-mc-linux64( 1/ 8), 0.160: [Blue] ~67 levels ~15360 states ~29752 transitions
pins2lts-mc-linux64( 1/ 8), 0.216: [Blue] ~90 levels ~30720 states ~58720 transitions
pins2lts-mc-linux64( 1/ 8), 0.383: [Blue] ~122 levels ~61440 states ~116992 transitions
pins2lts-mc-linux64( 1/ 8), 0.855: [Blue] ~170 levels ~122880 states ~232768 transitions
pins2lts-mc-linux64( 1/ 8), 1.457: [Blue] ~230 levels ~245760 states ~464488 transitions
pins2lts-mc-linux64( 1/ 8), 2.474: [Blue] ~325 levels ~491520 states ~926248 transitions
pins2lts-mc-linux64( 1/ 8), 4.339: [Blue] ~14779 levels ~983040 states ~2213176 transitions
pins2lts-mc-linux64( 5/ 8), 6.871: [Blue] ~3193 levels ~1966080 states ~4452928 transitions
pins2lts-mc-linux64( 5/ 8), 11.423: [Blue] ~4397 levels ~3932160 states ~9026784 transitions
pins2lts-mc-linux64( 5/ 8), 20.581: [Blue] ~6552 levels ~7864320 states ~18144640 transitions
pins2lts-mc-linux64( 5/ 8), 39.950: [Blue] ~10730 levels ~15728640 states ~36394392 transitions
pins2lts-mc-linux64( 5/ 8), 77.929: [Blue] ~16763 levels ~31457280 states ~73271216 transitions
pins2lts-mc-linux64( 5/ 8), 162.987: [Blue] ~26351 levels ~62914560 states ~147056136 transitions
pins2lts-mc-linux64( 5/ 8), 374.963: [Blue] ~42084 levels ~125829120 states ~294862688 transitions
pins2lts-mc-linux64( 0/ 8), 720.538: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 720.596:
pins2lts-mc-linux64( 0/ 8), 720.596: Explored 173308848 states 537893205 transitions, fanout: 3.104
pins2lts-mc-linux64( 0/ 8), 720.596: Total exploration time 720.500 sec (720.480 sec minimum, 720.487 sec on average)
pins2lts-mc-linux64( 0/ 8), 720.596: States per second: 240540, Transitions per second: 746555
pins2lts-mc-linux64( 0/ 8), 720.596:
pins2lts-mc-linux64( 0/ 8), 720.596: State space has 134217253 states, 1277286 are accepting
pins2lts-mc-linux64( 0/ 8), 720.596: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 720.596: blue states: 173308848 (129.13%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 720.596: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 720.596: all-red states: 1277286 (0.95%), bogus 389 (0.00%)
pins2lts-mc-linux64( 0/ 8), 720.596:
pins2lts-mc-linux64( 0/ 8), 720.596: Total memory used for local state coloring: 12.4MB
pins2lts-mc-linux64( 0/ 8), 720.596:
pins2lts-mc-linux64( 0/ 8), 720.596: Queue width: 8B, total height: 810585, memory: 6.18MB
pins2lts-mc-linux64( 0/ 8), 720.596: Tree memory: 1227.3MB, 9.6 B/state, compr.: 4.4%
pins2lts-mc-linux64( 0/ 8), 720.596: Tree fill ratio (roots/leafs): 99.0%/79.0%
pins2lts-mc-linux64( 0/ 8), 720.596: Stored 58 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 720.596: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 720.596: Est. total memory use: 1233.5MB (~1030.2MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin11218350264530428337;'/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' '[](<>((([]((LTLAPp1==true))&&<>([]((LTLAPp2==true))))||(LTLAPp0==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin11218350264530428337;'/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' '[](<>((([]((LTLAPp1==true))&&<>([]((LTLAPp2==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:00] [INFO ] Flatten gal took : 8 ms
[2024-05-27 20:23:00] [INFO ] Time to serialize gal into /tmp/LTLFireability11641538068866010639.gal : 1 ms
[2024-05-27 20:23:00] [INFO ] Time to serialize properties into /tmp/LTLFireability1572050852298057139.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/LTLFireability11641538068866010639.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1572050852298057139.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 : !((G(F(("((p12<1)||(l0<1))")||((G("((s1>=1)&&(l364>=1))"))&&(F(G("((p17>=1)&&(l285>=1))"))))))))
Formula 0 simplified : G(F(!"((s1>=1)&&(l364>=1))" | GF!"((p17>=1)&&(l285>=1))") & FG!"((p12<1)||(l0<1))")
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t7, t8, t9, t10, t13, t25, t26, t27, t34, t41, t42, t43, t44, t45, t47, t48, t51, t52...265
Computing Next relation with stutter on 2.01175e+08 deadlock states
400 unique states visited
0 strongly connected components in search stack
798 transitions explored
400 items max in DFS search stack
9703 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,97.0487,1171232,1,0,911,5.22166e+06,149,1248,2109,5.97103e+06,4117
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA RingSingleMessageInMbox-PT-d0m080-LTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Total runtime 1451901 ms.

BK_STOP 1716841488556

--------------------
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-d0m080"
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-d0m080, 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-171679101500028"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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