About the Execution of ITS-Tools for SieveSingleMsgMbox-PT-d0m06
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
353.355 | 13802.00 | 26881.00 | 73.50 | TFFFFFFTFFFFFFFT | normal |
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-167905975100364.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-d0m06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r421-tajo-167905975100364
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 8.9K Feb 26 10:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 104K Feb 26 10:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 26 10:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 10:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 17:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Feb 25 17:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K 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 12K Feb 26 10:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Feb 26 10:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 10:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Feb 26 10:26 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-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 1679176732594
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-d0m06
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-18 21:58:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-18 21:58:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 21:58:54] [INFO ] Load time of PNML (sax parser for PT used): 42 ms
[2023-03-18 21:58:54] [INFO ] Transformed 262 places.
[2023-03-18 21:58:54] [INFO ] Transformed 73 transitions.
[2023-03-18 21:58:54] [INFO ] Parsed PT model containing 262 places and 73 transitions and 292 arcs in 101 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 4 formulas.
Deduced a syphon composed of 190 places in 1 ms
Reduce places removed 190 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 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 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 64 transition count 67
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 64 transition count 67
Applied a total of 14 rules in 33 ms. Remains 64 /72 variables (removed 8) and now considering 67/73 (removed 6) transitions.
// Phase 1: matrix 67 rows 64 cols
[2023-03-18 21:58:54] [INFO ] Computed 5 place invariants in 9 ms
[2023-03-18 21:58:54] [INFO ] Implicit Places using invariants in 189 ms returned []
[2023-03-18 21:58:54] [INFO ] Invariant cache hit.
[2023-03-18 21:58:54] [INFO ] State equation strengthened by 27 read => feed constraints.
[2023-03-18 21:58:54] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
[2023-03-18 21:58:54] [INFO ] Invariant cache hit.
[2023-03-18 21:58:54] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 64/72 places, 67/73 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 422 ms. Remains : 64/72 places, 67/73 transitions.
Support contains 26 out of 64 places after structural reductions.
[2023-03-18 21:58:55] [INFO ] Flatten gal took : 22 ms
[2023-03-18 21:58:55] [INFO ] Flatten gal took : 9 ms
[2023-03-18 21:58:55] [INFO ] Input system was already deterministic with 67 transitions.
Incomplete random walk after 10000 steps, including 2220 resets, run finished after 403 ms. (steps per millisecond=24 ) properties (out of 20) seen :5
Incomplete Best-First random walk after 1000 steps, including 115 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 101 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 90 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 94 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 98 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 47 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 44 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 1000 steps, including 113 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 57 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2023-03-18 21:58:55] [INFO ] Invariant cache hit.
[2023-03-18 21:58:55] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 21:58:55] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2023-03-18 21:58:55] [INFO ] After 75ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1 real:11
[2023-03-18 21:58:55] [INFO ] State equation strengthened by 27 read => feed constraints.
[2023-03-18 21:58:55] [INFO ] After 7ms SMT Verify possible using 27 Read/Feed constraints in real domain returned unsat :1 sat :0 real:12
[2023-03-18 21:58:55] [INFO ] After 162ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:12
[2023-03-18 21:58:55] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 21:58:55] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-18 21:58:55] [INFO ] After 62ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :12
[2023-03-18 21:58:55] [INFO ] After 72ms SMT Verify possible using 27 Read/Feed constraints in natural domain returned unsat :1 sat :12
[2023-03-18 21:58:56] [INFO ] After 178ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :12
Attempting to minimize the solution found.
Minimization took 60 ms.
[2023-03-18 21:58:56] [INFO ] After 373ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :12
Fused 13 Parikh solutions to 12 different solutions.
Parikh walk visited 1 properties in 61 ms.
Support contains 15 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 67/67 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 62 transition count 65
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 62 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 61 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 61 transition count 64
Applied a total of 6 rules in 11 ms. Remains 61 /64 variables (removed 3) and now considering 64/67 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 61/64 places, 64/67 transitions.
Incomplete random walk after 10000 steps, including 2240 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 1040 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 463 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 1021 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 488 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 492 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 501 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 496 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 481 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 1063 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 512 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 494 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 11) seen :0
Finished probabilistic random walk after 1300 steps, run visited all 11 properties in 23 ms. (steps per millisecond=56 )
Probabilistic random walk after 1300 steps, saw 656 distinct states, run finished after 23 ms. (steps per millisecond=56 ) properties seen :11
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 199 edges and 64 vertex of which 63 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((X(X(p0))||(G(p2)&&p1))) U X(G(p3))))'
Support contains 5 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 67/67 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 61 transition count 64
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 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 11 place count 59 transition count 61
Applied a total of 11 rules in 9 ms. Remains 59 /64 variables (removed 5) and now considering 61/67 (removed 6) transitions.
// Phase 1: matrix 61 rows 59 cols
[2023-03-18 21:58:57] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-18 21:58:57] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-18 21:58:57] [INFO ] Invariant cache hit.
[2023-03-18 21:58:57] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-18 21:58:57] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
[2023-03-18 21:58:57] [INFO ] Invariant cache hit.
[2023-03-18 21:58:57] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 59/64 places, 61/67 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 200 ms. Remains : 59/64 places, 61/67 transitions.
Stuttering acceptance computed with spot in 355 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (NOT p3), (AND (NOT p0) (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m06-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), acceptance={} source=0 dest: 3}, { cond=(AND p1 p2 (NOT p3)), acceptance={} source=0 dest: 4}, { cond=(AND p1 p2 p3), acceptance={} source=0 dest: 5}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=p3, acceptance={} source=1 dest: 1}, { cond=(NOT p3), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=2 dest: 3}, { cond=(AND p2 (NOT p3)), acceptance={} source=2 dest: 4}, { cond=(AND p2 p3), acceptance={} source=2 dest: 5}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={0} source=3 dest: 3}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND p2 (NOT p3) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND p2 p3 (NOT p0)), acceptance={} source=5 dest: 5}]], initial=1, aps=[p1:(AND (GEQ s1 1) (GEQ s34 1)), p3:(AND (GEQ s8 1) (GEQ s39 1)), p2:(AND (GEQ s1 1) (GEQ s34 1)), p0:(AND (GEQ s1 1) (GEQ s57 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 2 ms.
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m06-LTLFireability-02 finished in 621 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 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 67/67 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 61 transition count 64
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 60 transition count 63
Applied a total of 8 rules in 9 ms. Remains 60 /64 variables (removed 4) and now considering 63/67 (removed 4) transitions.
// Phase 1: matrix 63 rows 60 cols
[2023-03-18 21:58:58] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-18 21:58:58] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-18 21:58:58] [INFO ] Invariant cache hit.
[2023-03-18 21:58:58] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-18 21:58:58] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
[2023-03-18 21:58:58] [INFO ] Invariant cache hit.
[2023-03-18 21:58:58] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 60/64 places, 63/67 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 217 ms. Remains : 60/64 places, 63/67 transitions.
Stuttering acceptance computed with spot in 99 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m06-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 s1 1) (LT s29 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 22633 reset in 338 ms.
Product exploration explored 100000 steps with 22430 reset in 190 ms.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 187 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 160 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 84 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2244 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 496 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 294 steps, run visited all 1 properties in 12 ms. (steps per millisecond=24 )
Probabilistic random walk after 294 steps, saw 158 distinct states, run finished after 12 ms. (steps per millisecond=24 ) 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 138 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 70 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 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, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-03-18 21:58:59] [INFO ] Invariant cache hit.
[2023-03-18 21:58:59] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-18 21:58:59] [INFO ] Invariant cache hit.
[2023-03-18 21:58:59] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-18 21:58:59] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
[2023-03-18 21:58:59] [INFO ] Invariant cache hit.
[2023-03-18 21:58:59] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 198 ms. Remains : 60/60 places, 63/63 transitions.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 187 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 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 127 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 68 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2227 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 484 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 294 steps, run visited all 1 properties in 14 ms. (steps per millisecond=21 )
Probabilistic random walk after 294 steps, saw 158 distinct states, run finished after 14 ms. (steps per millisecond=21 ) 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 149 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 67 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22369 reset in 89 ms.
Product exploration explored 100000 steps with 22437 reset in 116 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 73 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, 63/63 transitions.
Applied a total of 0 rules in 4 ms. Remains 60 /60 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-03-18 21:59:00] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 21:59:00] [INFO ] Invariant cache hit.
[2023-03-18 21:59:00] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 57 ms. Remains : 60/60 places, 63/63 transitions.
Built C files in :
/tmp/ltsmin4652327612094449061
[2023-03-18 21:59:00] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4652327612094449061
Running compilation step : cd /tmp/ltsmin4652327612094449061;'/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 288 ms.
Running link step : cd /tmp/ltsmin4652327612094449061;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin4652327612094449061;'/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/stateBased8883281439374047728.hoa' '--buchi-type=spotba'
LTSmin run took 176 ms.
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-03 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d0m06-LTLFireability-03 finished in 3362 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)&&X((G(!p0)&&X((p1||G(p2)))))))'
Support contains 5 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 67/67 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 61 transition count 64
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 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 11 place count 59 transition count 61
Applied a total of 11 rules in 5 ms. Remains 59 /64 variables (removed 5) and now considering 61/67 (removed 6) transitions.
// Phase 1: matrix 61 rows 59 cols
[2023-03-18 21:59:01] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-18 21:59:01] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-18 21:59:01] [INFO ] Invariant cache hit.
[2023-03-18 21:59:01] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-18 21:59:01] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
[2023-03-18 21:59:01] [INFO ] Invariant cache hit.
[2023-03-18 21:59:01] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 59/64 places, 61/67 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 188 ms. Remains : 59/64 places, 61/67 transitions.
Stuttering acceptance computed with spot in 168 ms :[true, (OR p0 (AND (NOT p1) (NOT p2))), (OR (NOT p2) p0), (OR p0 (AND (NOT p1) (NOT p2))), p0, true]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m06-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 3}, { cond=(NOT p0), acceptance={} source=0 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 4}, { cond=(OR p0 (AND (NOT p1) (NOT p2))), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 2}, { cond=(OR p0 (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 4}, { cond=p0, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s38 1)), p1:(AND (GEQ s1 1) (GEQ s30 1)), p2:(AND (GEQ s8 1) (GEQ s39 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][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 0 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m06-LTLFireability-06 finished in 375 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 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 67/67 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 61 transition count 64
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 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 11 place count 59 transition count 61
Applied a total of 11 rules in 15 ms. Remains 59 /64 variables (removed 5) and now considering 61/67 (removed 6) transitions.
[2023-03-18 21:59:01] [INFO ] Invariant cache hit.
[2023-03-18 21:59:01] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-18 21:59:01] [INFO ] Invariant cache hit.
[2023-03-18 21:59:01] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-18 21:59:01] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
[2023-03-18 21:59:01] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 21:59:01] [INFO ] Invariant cache hit.
[2023-03-18 21:59:02] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/64 places, 61/67 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 221 ms. Remains : 59/64 places, 61/67 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m06-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s19 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]]
Product exploration explored 100000 steps with 50000 reset in 219 ms.
Product exploration explored 100000 steps with 50000 reset in 245 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 : [(NOT p0), (X p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d0m06-LTLFireability-07 finished in 831 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((G((p0 U p1))||G(F(p2)))))'
Support contains 5 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 67/67 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 62 transition count 65
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 62 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 61 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 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 9 place count 60 transition count 62
Applied a total of 9 rules in 17 ms. Remains 60 /64 variables (removed 4) and now considering 62/67 (removed 5) transitions.
// Phase 1: matrix 62 rows 60 cols
[2023-03-18 21:59:02] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-18 21:59:02] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-18 21:59:02] [INFO ] Invariant cache hit.
[2023-03-18 21:59:02] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-18 21:59:02] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
[2023-03-18 21:59:02] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 21:59:02] [INFO ] Invariant cache hit.
[2023-03-18 21:59:02] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/64 places, 62/67 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 256 ms. Remains : 60/64 places, 62/67 transitions.
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m06-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(AND (GEQ s11 1) (GEQ s19 1)), p1:(AND (GEQ s10 1) (GEQ s19 1)), p0:(OR (AND (GEQ s12 1) (GEQ s34 1)) (AND (GEQ s10 1) (GEQ s19 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m06-LTLFireability-08 finished in 408 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 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 67/67 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 61 transition count 64
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 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 11 place count 59 transition count 61
Applied a total of 11 rules in 11 ms. Remains 59 /64 variables (removed 5) and now considering 61/67 (removed 6) transitions.
// Phase 1: matrix 61 rows 59 cols
[2023-03-18 21:59:03] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-18 21:59:03] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-18 21:59:03] [INFO ] Invariant cache hit.
[2023-03-18 21:59:03] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-18 21:59:03] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
[2023-03-18 21:59:03] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 21:59:03] [INFO ] Invariant cache hit.
[2023-03-18 21:59:03] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/64 places, 61/67 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 236 ms. Remains : 59/64 places, 61/67 transitions.
Stuttering acceptance computed with spot in 47 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 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 3 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m06-LTLFireability-10 finished in 306 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||X(X(F(p0))))))'
Support contains 2 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 67/67 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 61 transition count 64
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 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 11 place count 59 transition count 61
Applied a total of 11 rules in 14 ms. Remains 59 /64 variables (removed 5) and now considering 61/67 (removed 6) transitions.
[2023-03-18 21:59:03] [INFO ] Invariant cache hit.
[2023-03-18 21:59:03] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-18 21:59:03] [INFO ] Invariant cache hit.
[2023-03-18 21:59:03] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-18 21:59:03] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
[2023-03-18 21:59:03] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 21:59:03] [INFO ] Invariant cache hit.
[2023-03-18 21:59:03] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/64 places, 61/67 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 227 ms. Remains : 59/64 places, 61/67 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m06-LTLFireability-11 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 3 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m06-LTLFireability-11 finished in 283 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||G((F(p2)&&p1)))))'
Support contains 5 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 67/67 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 62 transition count 65
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 62 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 61 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 61 transition count 64
Applied a total of 6 rules in 6 ms. Remains 61 /64 variables (removed 3) and now considering 64/67 (removed 3) transitions.
// Phase 1: matrix 64 rows 61 cols
[2023-03-18 21:59:03] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-18 21:59:03] [INFO ] Implicit Places using invariants in 121 ms returned []
[2023-03-18 21:59:03] [INFO ] Invariant cache hit.
[2023-03-18 21:59:03] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-18 21:59:03] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
[2023-03-18 21:59:03] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 21:59:03] [INFO ] Invariant cache hit.
[2023-03-18 21:59:03] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/64 places, 64/67 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 324 ms. Remains : 61/64 places, 64/67 transitions.
Stuttering acceptance computed with spot in 109 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m06-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s14 1) (GEQ s19 1)), p0:(AND (GEQ s1 1) (GEQ s29 1)), p2:(AND (GEQ s1 1) (GEQ s31 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m06-LTLFireability-13 finished in 456 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(G(p0)))'
Support contains 2 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 67/67 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 61 transition count 64
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 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 11 place count 59 transition count 61
Applied a total of 11 rules in 10 ms. Remains 59 /64 variables (removed 5) and now considering 61/67 (removed 6) transitions.
// Phase 1: matrix 61 rows 59 cols
[2023-03-18 21:59:04] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-18 21:59:04] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-18 21:59:04] [INFO ] Invariant cache hit.
[2023-03-18 21:59:04] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-18 21:59:04] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
[2023-03-18 21:59:04] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 21:59:04] [INFO ] Invariant cache hit.
[2023-03-18 21:59:04] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/64 places, 61/67 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 205 ms. Remains : 59/64 places, 61/67 transitions.
Stuttering acceptance computed with spot in 39 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 s45 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 22485 reset in 109 ms.
Product exploration explored 100000 steps with 22369 reset in 262 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 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 38 ms :[(NOT p0)]
Finished random walk after 170 steps, including 43 resets, run visited all 1 properties in 1 ms. (steps per millisecond=170 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 105 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 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 22 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 3 ms. Remains 59 /59 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2023-03-18 21:59:05] [INFO ] Invariant cache hit.
[2023-03-18 21:59:05] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-18 21:59:05] [INFO ] Invariant cache hit.
[2023-03-18 21:59:05] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-18 21:59:05] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
[2023-03-18 21:59:05] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 21:59:05] [INFO ] Invariant cache hit.
[2023-03-18 21:59:05] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 193 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.1 ms
Computed a total of 7 stabilizing places and 10 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 90 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 22 ms :[(NOT p0)]
Finished random walk after 13 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=13 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
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 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22360 reset in 95 ms.
Product exploration explored 100000 steps with 22250 reset in 108 ms.
Built C files in :
/tmp/ltsmin4470460659636438239
[2023-03-18 21:59:05] [INFO ] Computing symmetric may disable matrix : 61 transitions.
[2023-03-18 21:59:05] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 21:59:05] [INFO ] Computing symmetric may enable matrix : 61 transitions.
[2023-03-18 21:59:05] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 21:59:05] [INFO ] Computing Do-Not-Accords matrix : 61 transitions.
[2023-03-18 21:59:05] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 21:59:05] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4470460659636438239
Running compilation step : cd /tmp/ltsmin4470460659636438239;'/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 213 ms.
Running link step : cd /tmp/ltsmin4470460659636438239;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin4470460659636438239;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4799225684664542070.hoa' '--buchi-type=spotba'
LTSmin run took 106 ms.
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d0m06-LTLFireability-14 finished in 2090 ms.
All properties solved by simple procedures.
Total runtime 11961 ms.
BK_STOP 1679176746396
--------------------
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-d0m06"
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-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 r421-tajo-167905975100364"
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 '
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 ;