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.r395-smll-171683823800008.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 SieveSingleMsgMbox-PT-d0m06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r395-smll-171683823800008
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Apr 12 19:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Apr 12 19:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 12 19:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Apr 12 19:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 57K 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 SieveSingleMsgMbox-PT-d0m06-LTLFireability-00
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLFireability-01
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLFireability-02
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLFireability-03
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLFireability-04
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLFireability-05
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLFireability-06
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLFireability-07
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLFireability-08
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLFireability-09
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLFireability-10
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLFireability-11
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLFireability-12
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLFireability-13
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLFireability-14
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716910261866

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=SieveSingleMsgMbox-PT-d0m06
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-28 15:31:05] [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-28 15:31:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 15:31:05] [INFO ] Load time of PNML (sax parser for PT used): 112 ms
[2024-05-28 15:31:05] [INFO ] Transformed 262 places.
[2024-05-28 15:31:05] [INFO ] Transformed 73 transitions.
[2024-05-28 15:31:05] [INFO ] Parsed PT model containing 262 places and 73 transitions and 292 arcs in 257 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 190 places in 3 ms
Reduce places removed 190 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 73/73 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 70 transition count 73
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 4 place count 68 transition count 71
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 68 transition count 71
Applied a total of 6 rules in 35 ms. Remains 68 /72 variables (removed 4) and now considering 71/73 (removed 2) transitions.
// Phase 1: matrix 71 rows 68 cols
[2024-05-28 15:31:06] [INFO ] Computed 5 invariants in 12 ms
[2024-05-28 15:31:06] [INFO ] Implicit Places using invariants in 334 ms returned []
[2024-05-28 15:31:06] [INFO ] Invariant cache hit.
[2024-05-28 15:31:06] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-05-28 15:31:06] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 650 ms to find 0 implicit places.
[2024-05-28 15:31:06] [INFO ] Invariant cache hit.
[2024-05-28 15:31:06] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 68/72 places, 71/73 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 837 ms. Remains : 68/72 places, 71/73 transitions.
Support contains 29 out of 68 places after structural reductions.
[2024-05-28 15:31:07] [INFO ] Flatten gal took : 57 ms
[2024-05-28 15:31:07] [INFO ] Flatten gal took : 24 ms
[2024-05-28 15:31:07] [INFO ] Input system was already deterministic with 71 transitions.
Incomplete random walk after 10000 steps, including 2218 resets, run finished after 1085 ms. (steps per millisecond=9 ) properties (out of 24) seen :7
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 34 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 96 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 108 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 96 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 44 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 40 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 114 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 53 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 33 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 92 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 116 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 42 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
[2024-05-28 15:31:08] [INFO ] Invariant cache hit.
[2024-05-28 15:31:08] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-28 15:31:08] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-28 15:31:09] [INFO ] After 418ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:14
[2024-05-28 15:31:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-28 15:31:09] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 12 ms returned sat
[2024-05-28 15:31:09] [INFO ] After 267ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :14
[2024-05-28 15:31:09] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-05-28 15:31:09] [INFO ] After 208ms SMT Verify possible using 29 Read/Feed constraints in natural domain returned unsat :3 sat :14
[2024-05-28 15:31:10] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 8 ms to minimize.
[2024-05-28 15:31:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2024-05-28 15:31:10] [INFO ] After 563ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :14
Attempting to minimize the solution found.
Minimization took 211 ms.
[2024-05-28 15:31:10] [INFO ] After 1269ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :14
Fused 17 Parikh solutions to 14 different solutions.
Parikh walk visited 2 properties in 258 ms.
Support contains 17 out of 68 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 71/71 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 65 transition count 68
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 65 transition count 68
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 64 transition count 67
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 64 transition count 67
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 64 transition count 66
Applied a total of 9 rules in 28 ms. Remains 64 /68 variables (removed 4) and now considering 66/71 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 64/68 places, 66/71 transitions.
Incomplete random walk after 10000 steps, including 2225 resets, run finished after 325 ms. (steps per millisecond=30 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 464 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 322 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 1052 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 476 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 1035 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 490 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10000 steps, including 493 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 1063 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 985 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 496 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 478 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 66 rows 64 cols
[2024-05-28 15:31:12] [INFO ] Computed 5 invariants in 8 ms
[2024-05-28 15:31:12] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 15:31:12] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 10 ms returned sat
[2024-05-28 15:31:12] [INFO ] After 275ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2024-05-28 15:31:12] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 15:31:12] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-28 15:31:12] [INFO ] After 166ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2024-05-28 15:31:12] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-05-28 15:31:13] [INFO ] After 134ms SMT Verify possible using 28 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2024-05-28 15:31:13] [INFO ] After 318ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 142 ms.
[2024-05-28 15:31:13] [INFO ] After 742ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 0 properties in 166 ms.
Support contains 15 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 66/66 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 63 transition count 65
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 63 transition count 65
Applied a total of 2 rules in 19 ms. Remains 63 /64 variables (removed 1) and now considering 65/66 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 63/64 places, 65/66 transitions.
Incomplete random walk after 10000 steps, including 2235 resets, run finished after 421 ms. (steps per millisecond=23 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 467 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 312 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 488 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 1016 resets, run finished after 196 ms. (steps per millisecond=51 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 496 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 480 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 1028 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 1055 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 475 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 476 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 10) seen :0
Probably explored full state space saw : 23713 states, properties seen :9
Probabilistic random walk after 61238 steps, saw 23713 distinct states, run finished after 138 ms. (steps per millisecond=443 ) properties seen :9
Explored full state space saw : 23713 states, properties seen :0
Exhaustive walk after 61238 steps, saw 23713 distinct states, run finished after 67 ms. (steps per millisecond=914 ) properties seen :0
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 4 atomic propositions for a total of 14 simplifications.
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 9 stabilizing places and 12 stable transitions
Graph (complete) has 208 edges and 68 vertex of which 67 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-11 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' '!(F(p0))'
Support contains 2 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 71/71 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 60 transition count 63
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 59 transition count 61
Applied a total of 19 rules in 27 ms. Remains 59 /68 variables (removed 9) and now considering 61/71 (removed 10) transitions.
// Phase 1: matrix 61 rows 59 cols
[2024-05-28 15:31:16] [INFO ] Computed 5 invariants in 2 ms
[2024-05-28 15:31:16] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-28 15:31:16] [INFO ] Invariant cache hit.
[2024-05-28 15:31:16] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-28 15:31:16] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
[2024-05-28 15:31:16] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-28 15:31:16] [INFO ] Invariant cache hit.
[2024-05-28 15:31:16] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/68 places, 61/71 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 329 ms. Remains : 59/68 places, 61/71 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 192 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m06-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s56 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][true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m06-LTLFireability-00 finished in 793 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(X((G(p0) U !p1)))))'
Support contains 3 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 71/71 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 62 transition count 65
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 62 transition count 65
Applied a total of 12 rules in 6 ms. Remains 62 /68 variables (removed 6) and now considering 65/71 (removed 6) transitions.
// Phase 1: matrix 65 rows 62 cols
[2024-05-28 15:31:16] [INFO ] Computed 5 invariants in 2 ms
[2024-05-28 15:31:16] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-28 15:31:16] [INFO ] Invariant cache hit.
[2024-05-28 15:31:16] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-28 15:31:16] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
[2024-05-28 15:31:16] [INFO ] Invariant cache hit.
[2024-05-28 15:31:16] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 62/68 places, 65/71 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 323 ms. Remains : 62/68 places, 65/71 transitions.
Stuttering acceptance computed with spot in 251 ms :[p1, p1, p1, p1, true, (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m06-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 4}, { cond=(AND p1 p0), acceptance={0} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(AND (GEQ s12 1) (GEQ s20 1)), p0:(AND (GEQ s7 1) (GEQ s20 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]]
Product exploration explored 100000 steps with 28574 reset in 572 ms.
Product exploration explored 100000 steps with 28570 reset in 211 ms.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 193 edges and 62 vertex of which 61 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 97 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 249 ms :[p1, p1, p1, p1, true, (NOT p0)]
Incomplete random walk after 10000 steps, including 2215 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 1039 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 1028 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 1062 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Probably explored full state space saw : 19961 states, properties seen :2
Probabilistic random walk after 50793 steps, saw 19961 distinct states, run finished after 215 ms. (steps per millisecond=236 ) properties seen :2
Explored full state space saw : 19961 states, properties seen :0
Exhaustive walk after 50793 steps, saw 19961 distinct states, run finished after 48 ms. (steps per millisecond=1058 ) properties seen :0
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true, (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(F p0), (F (AND (NOT p0) p1))]
Knowledge based reduction with 3 factoid took 126 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[p1, p1, p1, p1, true]
Stuttering acceptance computed with spot in 219 ms :[p1, p1, p1, p1, true]
Support contains 2 out of 62 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 65/65 transitions.
Applied a total of 0 rules in 5 ms. Remains 62 /62 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2024-05-28 15:31:19] [INFO ] Invariant cache hit.
[2024-05-28 15:31:19] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-28 15:31:19] [INFO ] Invariant cache hit.
[2024-05-28 15:31:19] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-28 15:31:19] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
[2024-05-28 15:31:19] [INFO ] Invariant cache hit.
[2024-05-28 15:31:19] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 363 ms. Remains : 62/62 places, 65/65 transitions.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 193 edges and 62 vertex of which 61 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 10 stable transitions
Knowledge obtained : [(NOT p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 95 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[p1, p1, p1, p1, true]
Incomplete random walk after 10000 steps, including 2276 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 984 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 142 steps, run visited all 1 properties in 5 ms. (steps per millisecond=28 )
Probabilistic random walk after 142 steps, saw 84 distinct states, run finished after 6 ms. (steps per millisecond=23 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p1), true]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 2 factoid took 97 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[p1, p1, p1, p1, true]
Stuttering acceptance computed with spot in 222 ms :[p1, p1, p1, p1, true]
Stuttering acceptance computed with spot in 356 ms :[p1, p1, p1, p1, true]
Product exploration explored 100000 steps with 28550 reset in 202 ms.
Product exploration explored 100000 steps with 28578 reset in 458 ms.
Applying partial POR strategy [true, false, false, false, true]
Stuttering acceptance computed with spot in 210 ms :[p1, p1, p1, p1, true]
Support contains 2 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 65/65 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 61 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 60 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 60 transition count 62
Applied a total of 5 rules in 15 ms. Remains 60 /62 variables (removed 2) and now considering 62/65 (removed 3) transitions.
[2024-05-28 15:31:22] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 62 rows 60 cols
[2024-05-28 15:31:22] [INFO ] Computed 5 invariants in 2 ms
[2024-05-28 15:31:23] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/62 places, 62/65 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 105 ms. Remains : 60/62 places, 62/65 transitions.
Built C files in :
/tmp/ltsmin16106873228101786759
[2024-05-28 15:31:23] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16106873228101786759
Running compilation step : cd /tmp/ltsmin16106873228101786759;'/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 1777 ms.
Running link step : cd /tmp/ltsmin16106873228101786759;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 138 ms.
Running LTSmin : cd /tmp/ltsmin16106873228101786759;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15035848059657900025.hoa' '--buchi-type=spotba'
LTSmin run took 275 ms.
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-02 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d0m06-LTLFireability-02 finished in 8674 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&X((G(p1)||X(X(F(p2))))))))'
Support contains 5 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 71/71 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 62 transition count 65
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 62 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 61 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 61 transition count 64
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 61 transition count 63
Applied a total of 15 rules in 11 ms. Remains 61 /68 variables (removed 7) and now considering 63/71 (removed 8) transitions.
// Phase 1: matrix 63 rows 61 cols
[2024-05-28 15:31:25] [INFO ] Computed 5 invariants in 6 ms
[2024-05-28 15:31:25] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-28 15:31:25] [INFO ] Invariant cache hit.
[2024-05-28 15:31:25] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-28 15:31:25] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
[2024-05-28 15:31:25] [INFO ] Invariant cache hit.
[2024-05-28 15:31:25] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 61/68 places, 63/71 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 466 ms. Remains : 61/68 places, 63/71 transitions.
Stuttering acceptance computed with spot in 683 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (OR (NOT p2) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m06-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 5}, { cond=(AND p0 p2), acceptance={0} source=0 dest: 8}], [{ cond=true, acceptance={} source=1 dest: 7}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 6}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}, { cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={} source=4 dest: 5}, { cond=(AND p0 p2), acceptance={} source=4 dest: 8}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=p0, acceptance={} source=6 dest: 0}, { cond=(NOT p0), acceptance={} source=6 dest: 5}], [{ cond=p0, acceptance={} source=7 dest: 2}, { cond=(NOT p0), acceptance={} source=7 dest: 5}], [{ cond=(NOT p0), acceptance={} source=8 dest: 5}, { cond=p0, acceptance={} source=8 dest: 8}]], initial=1, aps=[p0:(AND (GEQ s1 1) (GEQ s50 1)), p2:(OR (LT s1 1) (LT s46 1)), p1:(OR (LT s16 1) (LT s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m06-LTLFireability-03 finished in 1184 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 71/71 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 60 transition count 63
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 59 transition count 61
Applied a total of 19 rules in 11 ms. Remains 59 /68 variables (removed 9) and now considering 61/71 (removed 10) transitions.
// Phase 1: matrix 61 rows 59 cols
[2024-05-28 15:31:26] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 15:31:26] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-28 15:31:26] [INFO ] Invariant cache hit.
[2024-05-28 15:31:26] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-28 15:31:26] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
[2024-05-28 15:31:26] [INFO ] Invariant cache hit.
[2024-05-28 15:31:26] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 59/68 places, 61/71 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 410 ms. Remains : 59/68 places, 61/71 transitions.
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m06-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s1 1) (GEQ s56 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m06-LTLFireability-04 finished in 552 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 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 71/71 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 61 transition count 64
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 60 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 60 transition count 62
Applied a total of 17 rules in 16 ms. Remains 60 /68 variables (removed 8) and now considering 62/71 (removed 9) transitions.
// Phase 1: matrix 62 rows 60 cols
[2024-05-28 15:31:27] [INFO ] Computed 5 invariants in 2 ms
[2024-05-28 15:31:27] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-05-28 15:31:27] [INFO ] Invariant cache hit.
[2024-05-28 15:31:27] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-28 15:31:27] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
[2024-05-28 15:31:27] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-28 15:31:27] [INFO ] Invariant cache hit.
[2024-05-28 15:31:27] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/68 places, 62/71 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 456 ms. Remains : 60/68 places, 62/71 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m06-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s41 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 22214 reset in 286 ms.
Product exploration explored 100000 steps with 22347 reset in 332 ms.
Computed a total of 8 stabilizing places and 11 stable transitions
Graph (complete) has 185 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 8 stabilizing places and 11 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 121 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Finished random walk after 4149 steps, including 911 resets, run visited all 1 properties in 17 ms. (steps per millisecond=244 )
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 129 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 62/62 transitions.
Applied a total of 0 rules in 8 ms. Remains 60 /60 variables (removed 0) and now considering 62/62 (removed 0) transitions.
[2024-05-28 15:31:28] [INFO ] Invariant cache hit.
[2024-05-28 15:31:28] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-28 15:31:28] [INFO ] Invariant cache hit.
[2024-05-28 15:31:28] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-28 15:31:28] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
[2024-05-28 15:31:28] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-28 15:31:28] [INFO ] Invariant cache hit.
[2024-05-28 15:31:28] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 351 ms. Remains : 60/60 places, 62/62 transitions.
Computed a total of 8 stabilizing places and 11 stable transitions
Graph (complete) has 185 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 8 stabilizing places and 11 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2182 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 480 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Finished probabilistic random walk after 144 steps, run visited all 1 properties in 6 ms. (steps per millisecond=24 )
Probabilistic random walk after 144 steps, saw 85 distinct states, run finished after 7 ms. (steps per millisecond=20 ) properties seen :1
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 132 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22362 reset in 214 ms.
Product exploration explored 100000 steps with 22386 reset in 211 ms.
Built C files in :
/tmp/ltsmin14443876400063446500
[2024-05-28 15:31:29] [INFO ] Computing symmetric may disable matrix : 62 transitions.
[2024-05-28 15:31:29] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:31:29] [INFO ] Computing symmetric may enable matrix : 62 transitions.
[2024-05-28 15:31:29] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:31:29] [INFO ] Computing Do-Not-Accords matrix : 62 transitions.
[2024-05-28 15:31:29] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:31:29] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14443876400063446500
Running compilation step : cd /tmp/ltsmin14443876400063446500;'/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 228 ms.
Running link step : cd /tmp/ltsmin14443876400063446500;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin14443876400063446500;'/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/stateBased15982691234512488677.hoa' '--buchi-type=spotba'
LTSmin run took 126 ms.
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d0m06-LTLFireability-05 finished in 3267 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&&X(F(p1)))))))'
Support contains 4 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 71/71 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 61 transition count 64
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 60 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 60 transition count 62
Applied a total of 17 rules in 7 ms. Remains 60 /68 variables (removed 8) and now considering 62/71 (removed 9) transitions.
// Phase 1: matrix 62 rows 60 cols
[2024-05-28 15:31:30] [INFO ] Computed 5 invariants in 2 ms
[2024-05-28 15:31:30] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-28 15:31:30] [INFO ] Invariant cache hit.
[2024-05-28 15:31:30] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-28 15:31:30] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
[2024-05-28 15:31:30] [INFO ] Invariant cache hit.
[2024-05-28 15:31:30] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 60/68 places, 62/71 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 351 ms. Remains : 60/68 places, 62/71 transitions.
Stuttering acceptance computed with spot in 411 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m06-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(AND (GEQ s1 1) (GEQ s41 1)), p0:(OR (LT s10 1) (LT s19 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, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m06-LTLFireability-09 finished in 789 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(p0))))'
Support contains 2 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 71/71 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 60 transition count 63
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 59 transition count 61
Applied a total of 19 rules in 14 ms. Remains 59 /68 variables (removed 9) and now considering 61/71 (removed 10) transitions.
// Phase 1: matrix 61 rows 59 cols
[2024-05-28 15:31:31] [INFO ] Computed 5 invariants in 2 ms
[2024-05-28 15:31:31] [INFO ] Implicit Places using invariants in 141 ms returned []
[2024-05-28 15:31:31] [INFO ] Invariant cache hit.
[2024-05-28 15:31:31] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-28 15:31:31] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
[2024-05-28 15:31:31] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-28 15:31:31] [INFO ] Invariant cache hit.
[2024-05-28 15:31:31] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/68 places, 61/71 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 448 ms. Remains : 59/68 places, 61/71 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m06-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s48 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][true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m06-LTLFireability-10 finished in 532 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U (p1 U p2)))'
Support contains 5 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 71/71 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 61 transition count 64
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 60 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 60 transition count 62
Applied a total of 17 rules in 10 ms. Remains 60 /68 variables (removed 8) and now considering 62/71 (removed 9) transitions.
// Phase 1: matrix 62 rows 60 cols
[2024-05-28 15:31:31] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 15:31:31] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-28 15:31:31] [INFO ] Invariant cache hit.
[2024-05-28 15:31:31] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-28 15:31:31] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
[2024-05-28 15:31:31] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-28 15:31:31] [INFO ] Invariant cache hit.
[2024-05-28 15:31:31] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/68 places, 62/71 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 336 ms. Remains : 60/68 places, 62/71 transitions.
Stuttering acceptance computed with spot in 144 ms :[(NOT p2), (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m06-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(AND (GEQ s4 1) (GEQ s19 1)), p1:(AND (GEQ s13 1) (GEQ s19 1)), p0:(AND (GEQ s12 1) (GEQ s47 1))], nbAcceptance=1, 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 8 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m06-LTLFireability-12 finished in 497 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 4 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 71/71 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 61 transition count 64
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 61 transition count 64
Applied a total of 14 rules in 8 ms. Remains 61 /68 variables (removed 7) and now considering 64/71 (removed 7) transitions.
// Phase 1: matrix 64 rows 61 cols
[2024-05-28 15:31:32] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 15:31:32] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-28 15:31:32] [INFO ] Invariant cache hit.
[2024-05-28 15:31:32] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-28 15:31:32] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
[2024-05-28 15:31:32] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-28 15:31:32] [INFO ] Invariant cache hit.
[2024-05-28 15:31:32] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/68 places, 64/71 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 363 ms. Remains : 61/68 places, 64/71 transitions.
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m06-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s54 1)), p1:(AND (GEQ s7 1) (GEQ s19 1))], nbAcceptance=1, 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 5 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m06-LTLFireability-13 finished in 536 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 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 71/71 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 60 transition count 63
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 59 transition count 61
Applied a total of 19 rules in 12 ms. Remains 59 /68 variables (removed 9) and now considering 61/71 (removed 10) transitions.
// Phase 1: matrix 61 rows 59 cols
[2024-05-28 15:31:32] [INFO ] Computed 5 invariants in 2 ms
[2024-05-28 15:31:32] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-28 15:31:32] [INFO ] Invariant cache hit.
[2024-05-28 15:31:32] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-28 15:31:32] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
[2024-05-28 15:31:32] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-28 15:31:32] [INFO ] Invariant cache hit.
[2024-05-28 15:31:32] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/68 places, 61/71 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 291 ms. Remains : 59/68 places, 61/71 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m06-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 22447 reset in 116 ms.
Product exploration explored 100000 steps with 22410 reset in 282 ms.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 183 edges and 59 vertex of which 58 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 10 stable transitions
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 171 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Support contains 2 out of 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 61/61 transitions.
Applied a total of 0 rules in 6 ms. Remains 59 /59 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2024-05-28 15:31:33] [INFO ] Invariant cache hit.
[2024-05-28 15:31:33] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-28 15:31:33] [INFO ] Invariant cache hit.
[2024-05-28 15:31:34] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-28 15:31:34] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
[2024-05-28 15:31:34] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-28 15:31:34] [INFO ] Invariant cache hit.
[2024-05-28 15:31:34] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 396 ms. Remains : 59/59 places, 61/61 transitions.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 183 edges and 59 vertex of which 58 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 10 stable transitions
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 147 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22310 reset in 302 ms.
Product exploration explored 100000 steps with 22336 reset in 308 ms.
Built C files in :
/tmp/ltsmin12005352025526534071
[2024-05-28 15:31:35] [INFO ] Computing symmetric may disable matrix : 61 transitions.
[2024-05-28 15:31:35] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:31:35] [INFO ] Computing symmetric may enable matrix : 61 transitions.
[2024-05-28 15:31:35] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:31:35] [INFO ] Computing Do-Not-Accords matrix : 61 transitions.
[2024-05-28 15:31:35] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:31:35] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12005352025526534071
Running compilation step : cd /tmp/ltsmin12005352025526534071;'/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 231 ms.
Running link step : cd /tmp/ltsmin12005352025526534071;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin12005352025526534071;'/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/stateBased14081599614578291771.hoa' '--buchi-type=spotba'
LTSmin run took 563 ms.
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-14 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d0m06-LTLFireability-14 finished in 3580 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 71/71 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 60 transition count 63
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 59 transition count 61
Applied a total of 19 rules in 13 ms. Remains 59 /68 variables (removed 9) and now considering 61/71 (removed 10) transitions.
[2024-05-28 15:31:36] [INFO ] Invariant cache hit.
[2024-05-28 15:31:36] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-28 15:31:36] [INFO ] Invariant cache hit.
[2024-05-28 15:31:36] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-28 15:31:36] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
[2024-05-28 15:31:36] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-28 15:31:36] [INFO ] Invariant cache hit.
[2024-05-28 15:31:36] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/68 places, 61/71 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 438 ms. Remains : 59/68 places, 61/71 transitions.
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m06-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s50 1)), p1:(OR (LT s1 1) (LT s26 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 22245 reset in 196 ms.
Product exploration explored 100000 steps with 22394 reset in 224 ms.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 183 edges and 59 vertex of which 58 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 103 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 2217 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 486 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-28 15:31:37] [INFO ] Invariant cache hit.
[2024-05-28 15:31:37] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-28 15:31:37] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-28 15:31:37] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 15:31:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-28 15:31:37] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-28 15:31:37] [INFO ] After 31ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 15:31:37] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-28 15:31:37] [INFO ] After 10ms SMT Verify possible using 25 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-28 15:31:37] [INFO ] After 19ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2024-05-28 15:31:37] [INFO ] After 93ms 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 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 61/61 transitions.
Graph (complete) has 162 edges and 59 vertex of which 58 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 58 transition count 59
Applied a total of 3 rules in 6 ms. Remains 58 /59 variables (removed 1) and now considering 59/61 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 58/59 places, 59/61 transitions.
Incomplete random walk after 10000 steps, including 2194 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 491 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1161 steps, run visited all 1 properties in 6 ms. (steps per millisecond=193 )
Probabilistic random walk after 1161 steps, saw 569 distinct states, run finished after 6 ms. (steps per millisecond=193 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 135 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 3 out of 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 61/61 transitions.
Applied a total of 0 rules in 4 ms. Remains 59 /59 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2024-05-28 15:31:38] [INFO ] Invariant cache hit.
[2024-05-28 15:31:38] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-28 15:31:38] [INFO ] Invariant cache hit.
[2024-05-28 15:31:38] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-28 15:31:38] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2024-05-28 15:31:38] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-28 15:31:38] [INFO ] Invariant cache hit.
[2024-05-28 15:31:38] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 315 ms. Remains : 59/59 places, 61/61 transitions.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 183 edges and 59 vertex of which 58 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 7 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 124 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 2217 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 503 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-28 15:31:38] [INFO ] Invariant cache hit.
[2024-05-28 15:31:38] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-28 15:31:38] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 4 ms returned sat
[2024-05-28 15:31:38] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 15:31:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 15:31:38] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-28 15:31:38] [INFO ] After 51ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 15:31:38] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-28 15:31:38] [INFO ] After 16ms SMT Verify possible using 25 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-28 15:31:38] [INFO ] After 31ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2024-05-28 15:31:38] [INFO ] After 148ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 61/61 transitions.
Graph (complete) has 162 edges and 59 vertex of which 58 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 58 transition count 59
Applied a total of 3 rules in 7 ms. Remains 58 /59 variables (removed 1) and now considering 59/61 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 58/59 places, 59/61 transitions.
Incomplete random walk after 10000 steps, including 2277 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 489 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1161 steps, run visited all 1 properties in 7 ms. (steps per millisecond=165 )
Probabilistic random walk after 1161 steps, saw 569 distinct states, run finished after 7 ms. (steps per millisecond=165 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 182 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 22333 reset in 111 ms.
Product exploration explored 100000 steps with 22409 reset in 126 ms.
Built C files in :
/tmp/ltsmin442362753886192750
[2024-05-28 15:31:39] [INFO ] Computing symmetric may disable matrix : 61 transitions.
[2024-05-28 15:31:39] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:31:39] [INFO ] Computing symmetric may enable matrix : 61 transitions.
[2024-05-28 15:31:39] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:31:39] [INFO ] Computing Do-Not-Accords matrix : 61 transitions.
[2024-05-28 15:31:39] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:31:39] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin442362753886192750
Running compilation step : cd /tmp/ltsmin442362753886192750;'/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 211 ms.
Running link step : cd /tmp/ltsmin442362753886192750;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin442362753886192750;'/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/stateBased9073183509941962549.hoa' '--buchi-type=spotba'
LTSmin run took 374 ms.
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d0m06-LTLFireability-15 finished in 4190 ms.
All properties solved by simple procedures.
Total runtime 34988 ms.

BK_STOP 1716910301810

--------------------
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="SieveSingleMsgMbox-PT-d0m06"
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 SieveSingleMsgMbox-PT-d0m06, 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 r395-smll-171683823800008"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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