Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r421-tajo-167905975200388.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is SieveSingleMsgMbox-PT-d0m64, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r421-tajo-167905975200388
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 6.0K Feb 26 10:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 26 10:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 26 10:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 10:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Feb 26 10:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 26 10:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 10:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 10:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 17:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 57K Mar 5 18:23 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-d0m64-LTLFireability-00
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-LTLFireability-01
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-LTLFireability-02
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-LTLFireability-03
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-LTLFireability-04
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-LTLFireability-05
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-LTLFireability-06
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-LTLFireability-07
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-LTLFireability-08
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-LTLFireability-09
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-LTLFireability-10
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-LTLFireability-11
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-LTLFireability-12
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-LTLFireability-13
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-LTLFireability-14
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679178229366

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d0m64
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-18 22:23:51] [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]
[2023-03-18 22:23:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 22:23:51] [INFO ] Load time of PNML (sax parser for PT used): 42 ms
[2023-03-18 22:23:51] [INFO ] Transformed 262 places.
[2023-03-18 22:23:51] [INFO ] Transformed 73 transitions.
[2023-03-18 22:23:51] [INFO ] Parsed PT model containing 262 places and 73 transitions and 292 arcs in 140 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 190 places in 1 ms
Reduce places removed 190 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d0m64-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m64-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m64-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 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 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 6 place count 66 transition count 69
Iterating global reduction 1 with 4 rules applied. Total rules applied 10 place count 66 transition count 69
Applied a total of 10 rules in 14 ms. Remains 66 /72 variables (removed 6) and now considering 69/73 (removed 4) transitions.
// Phase 1: matrix 69 rows 66 cols
[2023-03-18 22:23:51] [INFO ] Computed 5 place invariants in 8 ms
[2023-03-18 22:23:51] [INFO ] Implicit Places using invariants in 134 ms returned []
[2023-03-18 22:23:51] [INFO ] Invariant cache hit.
[2023-03-18 22:23:51] [INFO ] State equation strengthened by 28 read => feed constraints.
[2023-03-18 22:23:51] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
[2023-03-18 22:23:51] [INFO ] Invariant cache hit.
[2023-03-18 22:23:52] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 66/72 places, 69/73 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 401 ms. Remains : 66/72 places, 69/73 transitions.
Support contains 32 out of 66 places after structural reductions.
[2023-03-18 22:23:52] [INFO ] Flatten gal took : 32 ms
[2023-03-18 22:23:52] [INFO ] Flatten gal took : 21 ms
[2023-03-18 22:23:52] [INFO ] Input system was already deterministic with 69 transitions.
Support contains 31 out of 66 places (down from 32) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2251 resets, run finished after 315 ms. (steps per millisecond=31 ) properties (out of 28) seen :10
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :2
Incomplete Best-First random walk after 1001 steps, including 103 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 93 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 43 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 39 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 99 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 45 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 113 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 53 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 54 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 102 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 47 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 108 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 16) seen :0
Running SMT prover for 16 properties.
[2023-03-18 22:23:52] [INFO ] Invariant cache hit.
[2023-03-18 22:23:53] [INFO ] [Real]Absence check using 2 positive place invariants in 25 ms returned sat
[2023-03-18 22:23:53] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 15 ms returned sat
[2023-03-18 22:23:53] [INFO ] After 599ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2023-03-18 22:23:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-18 22:23:53] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-18 22:23:53] [INFO ] After 223ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2023-03-18 22:23:53] [INFO ] State equation strengthened by 28 read => feed constraints.
[2023-03-18 22:23:54] [INFO ] After 181ms SMT Verify possible using 28 Read/Feed constraints in natural domain returned unsat :0 sat :16
[2023-03-18 22:23:54] [INFO ] After 411ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :16
Attempting to minimize the solution found.
Minimization took 104 ms.
[2023-03-18 22:23:54] [INFO ] After 882ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
Parikh walk visited 3 properties in 431 ms.
Support contains 18 out of 66 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 69/69 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 64 transition count 67
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 64 transition count 67
Applied a total of 4 rules in 10 ms. Remains 64 /66 variables (removed 2) and now considering 67/69 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 64/66 places, 67/69 transitions.
Incomplete random walk after 10000 steps, including 2205 resets, run finished after 291 ms. (steps per millisecond=34 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 490 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 497 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 1020 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 470 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 475 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 1005 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 468 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 1030 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 490 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 508 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 1023 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 478 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 1013 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 13) seen :0
Finished probabilistic random walk after 1611 steps, run visited all 13 properties in 44 ms. (steps per millisecond=36 )
Probabilistic random walk after 1611 steps, saw 844 distinct states, run finished after 44 ms. (steps per millisecond=36 ) properties seen :13
FORMULA SieveSingleMsgMbox-PT-d0m64-LTLFireability-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 204 edges and 66 vertex of which 65 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!F(p0) U (X((p1 U G(p2))) U p3)))'
Support contains 5 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 69/69 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 61 transition count 64
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 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 15 place count 59 transition count 61
Applied a total of 15 rules in 33 ms. Remains 59 /66 variables (removed 7) and now considering 61/69 (removed 8) transitions.
// Phase 1: matrix 61 rows 59 cols
[2023-03-18 22:23:56] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-18 22:23:57] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-18 22:23:57] [INFO ] Invariant cache hit.
[2023-03-18 22:23:57] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-18 22:23:57] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
[2023-03-18 22:23:57] [INFO ] Invariant cache hit.
[2023-03-18 22:23:57] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 59/66 places, 61/69 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 461 ms. Remains : 59/66 places, 61/69 transitions.
Stuttering acceptance computed with spot in 494 ms :[(NOT p3), (OR (NOT p3) (NOT p2)), (OR (AND p0 (NOT p1) (NOT p2)) (AND p0 (NOT p2) p3)), true, (NOT p2), (NOT p2), p0, (AND p0 (NOT p2)), (AND (NOT p2) p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m64-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND (NOT p3) p2) (AND (NOT p3) p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(AND p3 p1), acceptance={} source=1 dest: 5}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND p3 p0 p1), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 6}, { cond=(AND p3 (NOT p0) p1), acceptance={} source=2 dest: 7}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=2 dest: 8}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p2 p1), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p2) p1), acceptance={0} source=5 dest: 5}], [{ cond=p0, acceptance={} source=6 dest: 3}, { cond=(NOT p0), acceptance={} source=6 dest: 6}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=7 dest: 3}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=7 dest: 4}, { cond=(AND p0 p1), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p0) p1), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=7 dest: 8}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=8 dest: 3}, { cond=(AND p0 p2), acceptance={} source=8 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p0) p2), acceptance={} source=8 dest: 8}]], initial=0, aps=[p3:(AND (GEQ s1 1) (GEQ s56 1)), p0:(AND (GEQ s1 1) (GEQ s47 1)), p2:(AND (GEQ s1 1) (GEQ s54 1)), p1:(AND (GEQ s1 1) (GEQ s22 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 8 steps with 1 reset in 2 ms.
FORMULA SieveSingleMsgMbox-PT-d0m64-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m64-LTLFireability-01 finished in 1061 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&((G(p1) U p0)||G(p2)))))'
Support contains 5 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 69/69 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 62 transition count 65
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 62 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 61 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 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 13 place count 60 transition count 62
Applied a total of 13 rules in 11 ms. Remains 60 /66 variables (removed 6) and now considering 62/69 (removed 7) transitions.
// Phase 1: matrix 62 rows 60 cols
[2023-03-18 22:23:57] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-18 22:23:57] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-18 22:23:57] [INFO ] Invariant cache hit.
[2023-03-18 22:23:57] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-18 22:23:58] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
[2023-03-18 22:23:58] [INFO ] Invariant cache hit.
[2023-03-18 22:23:58] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 60/66 places, 62/69 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 197 ms. Remains : 60/66 places, 62/69 transitions.
Stuttering acceptance computed with spot in 430 ms :[(NOT p0), (OR (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), true, (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m64-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 7}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p2), acceptance={0} source=1 dest: 4}, { cond=(NOT p2), acceptance={0} source=1 dest: 7}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 5}, { cond=(NOT p1), acceptance={0} source=2 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=3 dest: 3}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=3 dest: 4}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=3 dest: 5}, { cond=(AND p0 p1 p2), acceptance={0} source=3 dest: 6}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 7}], [{ cond=p2, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={} source=4 dest: 7}], [{ cond=p1, acceptance={} source=5 dest: 5}, { cond=(NOT p1), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p1) p2), acceptance={} source=6 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(AND p1 p2), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=6 dest: 7}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=true, acceptance={} source=8 dest: 0}]], initial=8, aps=[p0:(AND (GEQ s1 1) (GEQ s21 1)), p1:(AND (GEQ s10 1) (GEQ s19 1)), p2:(AND (GEQ s1 1) (GEQ s57 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, 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-d0m64-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m64-LTLFireability-02 finished in 651 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 69/69 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 62 transition count 65
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 62 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 61 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 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 13 place count 60 transition count 62
Applied a total of 13 rules in 12 ms. Remains 60 /66 variables (removed 6) and now considering 62/69 (removed 7) transitions.
// Phase 1: matrix 62 rows 60 cols
[2023-03-18 22:23:58] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-18 22:23:58] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-18 22:23:58] [INFO ] Invariant cache hit.
[2023-03-18 22:23:58] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-18 22:23:58] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
[2023-03-18 22:23:58] [INFO ] Invariant cache hit.
[2023-03-18 22:23:58] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 60/66 places, 62/69 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 266 ms. Remains : 60/66 places, 62/69 transitions.
Stuttering acceptance computed with spot in 69 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m64-LTLFireability-03 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:(OR (LT s13 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][false, false, false]]
Product exploration explored 100000 steps with 22290 reset in 334 ms.
Product exploration explored 100000 steps with 22507 reset in 175 ms.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 186 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.13 ms
Computed a total of 7 stabilizing places and 10 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 236 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2226 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1032 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1405 steps, run visited all 1 properties in 34 ms. (steps per millisecond=41 )
Probabilistic random walk after 1405 steps, saw 710 distinct states, run finished after 34 ms. (steps per millisecond=41 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 352 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 62/62 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 62/62 (removed 0) transitions.
[2023-03-18 22:24:00] [INFO ] Invariant cache hit.
[2023-03-18 22:24:00] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-18 22:24:00] [INFO ] Invariant cache hit.
[2023-03-18 22:24:00] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-18 22:24:00] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
[2023-03-18 22:24:00] [INFO ] Invariant cache hit.
[2023-03-18 22:24:00] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 391 ms. Remains : 60/60 places, 62/62 transitions.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 186 edges and 60 vertex of which 59 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 : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 348 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2220 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1019 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1405 steps, run visited all 1 properties in 69 ms. (steps per millisecond=20 )
Probabilistic random walk after 1405 steps, saw 710 distinct states, run finished after 69 ms. (steps per millisecond=20 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 259 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 144 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22325 reset in 92 ms.
Product exploration explored 100000 steps with 22398 reset in 210 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p0), (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 7 ms. Remains 60 /60 variables (removed 0) and now considering 62/62 (removed 0) transitions.
[2023-03-18 22:24:02] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 22:24:02] [INFO ] Invariant cache hit.
[2023-03-18 22:24:02] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 67 ms. Remains : 60/60 places, 62/62 transitions.
Built C files in :
/tmp/ltsmin5273171759345018397
[2023-03-18 22:24:02] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5273171759345018397
Running compilation step : cd /tmp/ltsmin5273171759345018397;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 225 ms.
Running link step : cd /tmp/ltsmin5273171759345018397;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin5273171759345018397;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11280498654877957978.hoa' '--buchi-type=spotba'
LTSmin run took 2782 ms.
FORMULA SieveSingleMsgMbox-PT-d0m64-LTLFireability-03 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d0m64-LTLFireability-03 finished in 7365 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(G(p1))||p0))))'
Support contains 2 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 69/69 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 61 transition count 64
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 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 15 place count 59 transition count 61
Applied a total of 15 rules in 14 ms. Remains 59 /66 variables (removed 7) and now considering 61/69 (removed 8) transitions.
// Phase 1: matrix 61 rows 59 cols
[2023-03-18 22:24:05] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-18 22:24:05] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-18 22:24:05] [INFO ] Invariant cache hit.
[2023-03-18 22:24:06] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-18 22:24:06] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
[2023-03-18 22:24:06] [INFO ] Invariant cache hit.
[2023-03-18 22:24:06] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 59/66 places, 61/69 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 193 ms. Remains : 59/66 places, 61/69 transitions.
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m64-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(OR (LT s1 1) (LT s41 1)), 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-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 22424 reset in 170 ms.
Entered a terminal (fully accepting) state of product in 81102 steps with 18175 reset in 164 ms.
FORMULA SieveSingleMsgMbox-PT-d0m64-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m64-LTLFireability-04 finished in 681 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(p0) U p1))))'
Support contains 3 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 69/69 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 61 transition count 64
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 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 15 place count 59 transition count 61
Applied a total of 15 rules in 5 ms. Remains 59 /66 variables (removed 7) and now considering 61/69 (removed 8) transitions.
[2023-03-18 22:24:06] [INFO ] Invariant cache hit.
[2023-03-18 22:24:06] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-18 22:24:06] [INFO ] Invariant cache hit.
[2023-03-18 22:24:06] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-18 22:24:06] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
[2023-03-18 22:24:06] [INFO ] Invariant cache hit.
[2023-03-18 22:24:06] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 59/66 places, 61/69 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 195 ms. Remains : 59/66 places, 61/69 transitions.
Stuttering acceptance computed with spot in 206 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m64-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s38 1)), p0:(OR (NOT (AND (GEQ s1 1) (GEQ s54 1))) (AND (GEQ s1 1) (GEQ s38 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m64-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m64-LTLFireability-05 finished in 430 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(F(p1))))))'
Support contains 4 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 69/69 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 61 transition count 64
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 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 15 place count 59 transition count 61
Applied a total of 15 rules in 4 ms. Remains 59 /66 variables (removed 7) and now considering 61/69 (removed 8) transitions.
[2023-03-18 22:24:07] [INFO ] Invariant cache hit.
[2023-03-18 22:24:07] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-18 22:24:07] [INFO ] Invariant cache hit.
[2023-03-18 22:24:07] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-18 22:24:07] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
[2023-03-18 22:24:07] [INFO ] Invariant cache hit.
[2023-03-18 22:24:07] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 59/66 places, 61/69 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 205 ms. Remains : 59/66 places, 61/69 transitions.
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m64-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s12 1) (GEQ s46 1)), p1:(AND (GEQ s1 1) (GEQ s50 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m64-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m64-LTLFireability-06 finished in 341 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((X(G(p1))||p0))&&F(p2)))'
Support contains 5 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 69/69 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 63 transition count 66
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 63 transition count 66
Applied a total of 6 rules in 3 ms. Remains 63 /66 variables (removed 3) and now considering 66/69 (removed 3) transitions.
// Phase 1: matrix 66 rows 63 cols
[2023-03-18 22:24:07] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-18 22:24:07] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-18 22:24:07] [INFO ] Invariant cache hit.
[2023-03-18 22:24:07] [INFO ] State equation strengthened by 27 read => feed constraints.
[2023-03-18 22:24:07] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
[2023-03-18 22:24:07] [INFO ] Invariant cache hit.
[2023-03-18 22:24:07] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 63/66 places, 66/69 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 205 ms. Remains : 63/66 places, 66/69 transitions.
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (NOT p1), true]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m64-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (GEQ s17 1) (GEQ s20 1)), p0:(OR (LT s1 1) (LT s40 1)), p1:(OR (LT s4 1) (LT 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][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m64-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m64-LTLFireability-07 finished in 388 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(X(p0)) U (F(p1)&&G(p0)))||X(p1)))'
Support contains 4 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 69/69 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 62 transition count 65
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 62 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 61 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 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 13 place count 60 transition count 62
Applied a total of 13 rules in 4 ms. Remains 60 /66 variables (removed 6) and now considering 62/69 (removed 7) transitions.
// Phase 1: matrix 62 rows 60 cols
[2023-03-18 22:24:07] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-18 22:24:07] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-18 22:24:07] [INFO ] Invariant cache hit.
[2023-03-18 22:24:07] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-18 22:24:07] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
[2023-03-18 22:24:07] [INFO ] Invariant cache hit.
[2023-03-18 22:24:07] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 60/66 places, 62/69 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 220 ms. Remains : 60/66 places, 62/69 transitions.
Stuttering acceptance computed with spot in 370 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m64-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=3 dest: 1}, { cond=(OR (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=(AND p1 p0), acceptance={0} source=5 dest: 0}, { cond=(NOT p0), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 5}]], initial=3, aps=[p0:(AND (GEQ s1 1) (GEQ s35 1)), p1:(AND (GEQ s11 1) (GEQ 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, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m64-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m64-LTLFireability-08 finished in 615 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 69/69 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 61 transition count 64
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 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 15 place count 59 transition count 61
Applied a total of 15 rules in 10 ms. Remains 59 /66 variables (removed 7) and now considering 61/69 (removed 8) transitions.
// Phase 1: matrix 61 rows 59 cols
[2023-03-18 22:24:08] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-18 22:24:08] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-18 22:24:08] [INFO ] Invariant cache hit.
[2023-03-18 22:24:08] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-18 22:24:08] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
[2023-03-18 22:24:08] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 22:24:08] [INFO ] Invariant cache hit.
[2023-03-18 22:24:08] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/66 places, 61/69 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 296 ms. Remains : 59/66 places, 61/69 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m64-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s49 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 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m64-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m64-LTLFireability-10 finished in 370 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p1))||p0)))'
Support contains 3 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 69/69 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 61 transition count 64
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 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 15 place count 59 transition count 61
Applied a total of 15 rules in 3 ms. Remains 59 /66 variables (removed 7) and now considering 61/69 (removed 8) transitions.
[2023-03-18 22:24:08] [INFO ] Invariant cache hit.
[2023-03-18 22:24:08] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-18 22:24:08] [INFO ] Invariant cache hit.
[2023-03-18 22:24:08] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-18 22:24:08] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2023-03-18 22:24:08] [INFO ] Invariant cache hit.
[2023-03-18 22:24:08] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 59/66 places, 61/69 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 245 ms. Remains : 59/66 places, 61/69 transitions.
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m64-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(OR (LT s1 1) (LT s48 1)), p1:(AND (GEQ s1 1) (GEQ s56 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 221 ms.
Product exploration explored 100000 steps with 50000 reset in 211 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.1 ms
Computed a total of 7 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d0m64-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d0m64-LTLFireability-11 finished in 932 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0)) U X(p1)))'
Support contains 4 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 69/69 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 61 transition count 64
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 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 15 place count 59 transition count 61
Applied a total of 15 rules in 5 ms. Remains 59 /66 variables (removed 7) and now considering 61/69 (removed 8) transitions.
[2023-03-18 22:24:09] [INFO ] Invariant cache hit.
[2023-03-18 22:24:09] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-18 22:24:09] [INFO ] Invariant cache hit.
[2023-03-18 22:24:09] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-18 22:24:09] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
[2023-03-18 22:24:09] [INFO ] Invariant cache hit.
[2023-03-18 22:24:09] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 59/66 places, 61/69 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 247 ms. Remains : 59/66 places, 61/69 transitions.
Stuttering acceptance computed with spot in 119 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m64-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p1:(AND (GEQ s5 1) (GEQ s27 1)), p0:(AND (GEQ s1 1) (GEQ s51 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]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m64-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m64-LTLFireability-14 finished in 390 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 4 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 69/69 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 62 transition count 65
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 62 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 61 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 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 13 place count 60 transition count 62
Applied a total of 13 rules in 5 ms. Remains 60 /66 variables (removed 6) and now considering 62/69 (removed 7) transitions.
// Phase 1: matrix 62 rows 60 cols
[2023-03-18 22:24:10] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-18 22:24:10] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-18 22:24:10] [INFO ] Invariant cache hit.
[2023-03-18 22:24:10] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-18 22:24:10] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
[2023-03-18 22:24:10] [INFO ] Invariant cache hit.
[2023-03-18 22:24:10] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 60/66 places, 62/69 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 250 ms. Remains : 60/66 places, 62/69 transitions.
Stuttering acceptance computed with spot in 213 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m64-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (LT s4 1) (LT s18 1)) (OR (LT s1 1) (LT s37 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 233 ms.
Product exploration explored 100000 steps with 50000 reset in 188 ms.
Computed a total of 7 stabilizing places and 10 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.1 ms
Computed a total of 7 stabilizing places and 10 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 281 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d0m64-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d0m64-LTLFireability-15 finished in 1189 ms.
All properties solved by simple procedures.
Total runtime 19878 ms.

BK_STOP 1679178251493

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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-d0m64"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is SieveSingleMsgMbox-PT-d0m64, 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 r421-tajo-167905975200388"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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