About the Execution of ITS-Tools for ShieldRVt-PT-010B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 882.567 | 113294.00 | 235874.00 | 309.50 | FFTFFFFFFFFFTTTF | 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-167905975000268.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 ShieldRVt-PT-010B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r421-tajo-167905975000268
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 6.2K Feb 25 22:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 25 22:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 22:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 22:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 17:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 22:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Feb 25 22:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 25 22:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 22:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 119K 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 ShieldRVt-PT-010B-LTLFireability-00
FORMULA_NAME ShieldRVt-PT-010B-LTLFireability-01
FORMULA_NAME ShieldRVt-PT-010B-LTLFireability-02
FORMULA_NAME ShieldRVt-PT-010B-LTLFireability-03
FORMULA_NAME ShieldRVt-PT-010B-LTLFireability-04
FORMULA_NAME ShieldRVt-PT-010B-LTLFireability-05
FORMULA_NAME ShieldRVt-PT-010B-LTLFireability-06
FORMULA_NAME ShieldRVt-PT-010B-LTLFireability-07
FORMULA_NAME ShieldRVt-PT-010B-LTLFireability-08
FORMULA_NAME ShieldRVt-PT-010B-LTLFireability-09
FORMULA_NAME ShieldRVt-PT-010B-LTLFireability-10
FORMULA_NAME ShieldRVt-PT-010B-LTLFireability-11
FORMULA_NAME ShieldRVt-PT-010B-LTLFireability-12
FORMULA_NAME ShieldRVt-PT-010B-LTLFireability-13
FORMULA_NAME ShieldRVt-PT-010B-LTLFireability-14
FORMULA_NAME ShieldRVt-PT-010B-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1679171090436
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=ShieldRVt-PT-010B
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-18 20:24:52] [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 20:24:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 20:24:53] [INFO ] Load time of PNML (sax parser for PT used): 100 ms
[2023-03-18 20:24:53] [INFO ] Transformed 503 places.
[2023-03-18 20:24:53] [INFO ] Transformed 503 transitions.
[2023-03-18 20:24:53] [INFO ] Found NUPN structural information;
[2023-03-18 20:24:53] [INFO ] Parsed PT model containing 503 places and 503 transitions and 1186 arcs in 232 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ShieldRVt-PT-010B-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-010B-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-010B-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-010B-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 503/503 places, 503/503 transitions.
Discarding 99 places :
Symmetric choice reduction at 0 with 99 rule applications. Total rules 99 place count 404 transition count 404
Iterating global reduction 0 with 99 rules applied. Total rules applied 198 place count 404 transition count 404
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 199 place count 403 transition count 403
Iterating global reduction 0 with 1 rules applied. Total rules applied 200 place count 403 transition count 403
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 201 place count 402 transition count 402
Iterating global reduction 0 with 1 rules applied. Total rules applied 202 place count 402 transition count 402
Applied a total of 202 rules in 129 ms. Remains 402 /503 variables (removed 101) and now considering 402/503 (removed 101) transitions.
// Phase 1: matrix 402 rows 402 cols
[2023-03-18 20:24:53] [INFO ] Computed 41 place invariants in 16 ms
[2023-03-18 20:24:54] [INFO ] Implicit Places using invariants in 496 ms returned []
[2023-03-18 20:24:54] [INFO ] Invariant cache hit.
[2023-03-18 20:24:56] [INFO ] Implicit Places using invariants and state equation in 1935 ms returned []
Implicit Place search using SMT with State Equation took 2471 ms to find 0 implicit places.
[2023-03-18 20:24:56] [INFO ] Invariant cache hit.
[2023-03-18 20:24:56] [INFO ] Dead Transitions using invariants and state equation in 310 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 402/503 places, 402/503 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2928 ms. Remains : 402/503 places, 402/503 transitions.
Support contains 36 out of 402 places after structural reductions.
[2023-03-18 20:24:56] [INFO ] Flatten gal took : 126 ms
[2023-03-18 20:24:56] [INFO ] Flatten gal took : 35 ms
[2023-03-18 20:24:56] [INFO ] Input system was already deterministic with 402 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 547 ms. (steps per millisecond=18 ) properties (out of 32) seen :27
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-18 20:24:57] [INFO ] Invariant cache hit.
[2023-03-18 20:24:57] [INFO ] After 194ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-18 20:24:58] [INFO ] [Nat]Absence check using 41 positive place invariants in 277 ms returned sat
[2023-03-18 20:25:02] [INFO ] After 3536ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-18 20:25:02] [INFO ] Deduced a trap composed of 22 places in 130 ms of which 5 ms to minimize.
[2023-03-18 20:25:02] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 1 ms to minimize.
[2023-03-18 20:25:05] [INFO ] Deduced a trap composed of 21 places in 3000 ms of which 27 ms to minimize.
[2023-03-18 20:25:05] [INFO ] Deduced a trap composed of 30 places in 113 ms of which 11 ms to minimize.
[2023-03-18 20:25:07] [INFO ] Deduced a trap composed of 24 places in 1471 ms of which 2 ms to minimize.
[2023-03-18 20:25:07] [INFO ] Deduced a trap composed of 18 places in 111 ms of which 0 ms to minimize.
[2023-03-18 20:25:07] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 5062 ms
[2023-03-18 20:25:07] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 1 ms to minimize.
[2023-03-18 20:25:07] [INFO ] Deduced a trap composed of 30 places in 99 ms of which 1 ms to minimize.
[2023-03-18 20:25:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 238 ms
[2023-03-18 20:25:07] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 0 ms to minimize.
[2023-03-18 20:25:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 137 ms
[2023-03-18 20:25:07] [INFO ] After 9081ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 63 ms.
[2023-03-18 20:25:08] [INFO ] After 10115ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 85 ms.
Support contains 7 out of 402 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 402/402 places, 402/402 transitions.
Drop transitions removed 108 transitions
Trivial Post-agglo rules discarded 108 transitions
Performed 108 trivial Post agglomeration. Transition count delta: 108
Iterating post reduction 0 with 108 rules applied. Total rules applied 108 place count 402 transition count 294
Reduce places removed 108 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 109 rules applied. Total rules applied 217 place count 294 transition count 293
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 218 place count 293 transition count 293
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 73 Pre rules applied. Total rules applied 218 place count 293 transition count 220
Deduced a syphon composed of 73 places in 1 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 3 with 146 rules applied. Total rules applied 364 place count 220 transition count 220
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 372 place count 212 transition count 212
Iterating global reduction 3 with 8 rules applied. Total rules applied 380 place count 212 transition count 212
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 380 place count 212 transition count 207
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 390 place count 207 transition count 207
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 88
Deduced a syphon composed of 88 places in 0 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 566 place count 119 transition count 119
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 567 place count 119 transition count 118
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 569 place count 118 transition count 117
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 54 rules applied. Total rules applied 623 place count 91 transition count 140
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 624 place count 91 transition count 139
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 625 place count 90 transition count 138
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 626 place count 89 transition count 138
Applied a total of 626 rules in 80 ms. Remains 89 /402 variables (removed 313) and now considering 138/402 (removed 264) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 89/402 places, 138/402 transitions.
Finished random walk after 498 steps, including 0 resets, run visited all 5 properties in 32 ms. (steps per millisecond=15 )
FORMULA ShieldRVt-PT-010B-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 123 stabilizing places and 123 stable transitions
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&&(p1 U (p2||G(p1)))))))'
Support contains 3 out of 402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 402/402 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 391 transition count 391
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 391 transition count 391
Applied a total of 22 rules in 15 ms. Remains 391 /402 variables (removed 11) and now considering 391/402 (removed 11) transitions.
// Phase 1: matrix 391 rows 391 cols
[2023-03-18 20:25:08] [INFO ] Computed 41 place invariants in 2 ms
[2023-03-18 20:25:13] [INFO ] Implicit Places using invariants in 4654 ms returned []
[2023-03-18 20:25:13] [INFO ] Invariant cache hit.
[2023-03-18 20:25:13] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 4933 ms to find 0 implicit places.
[2023-03-18 20:25:13] [INFO ] Invariant cache hit.
[2023-03-18 20:25:14] [INFO ] Dead Transitions using invariants and state equation in 320 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 391/402 places, 391/402 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5270 ms. Remains : 391/402 places, 391/402 transitions.
Stuttering acceptance computed with spot in 302 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ShieldRVt-PT-010B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=2 dest: 0}, { cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s183 1), p2:(AND (NEQ s291 1) (NEQ s98 1)), p1:(NEQ s98 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 4 ms.
FORMULA ShieldRVt-PT-010B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-010B-LTLFireability-01 finished in 5653 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((F(p1)||G(!p2)))&&p0)))'
Support contains 2 out of 402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 402/402 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 392 transition count 392
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 392 transition count 392
Applied a total of 20 rules in 36 ms. Remains 392 /402 variables (removed 10) and now considering 392/402 (removed 10) transitions.
// Phase 1: matrix 392 rows 392 cols
[2023-03-18 20:25:14] [INFO ] Computed 41 place invariants in 5 ms
[2023-03-18 20:25:14] [INFO ] Implicit Places using invariants in 137 ms returned []
[2023-03-18 20:25:14] [INFO ] Invariant cache hit.
[2023-03-18 20:25:15] [INFO ] Implicit Places using invariants and state equation in 332 ms returned []
Implicit Place search using SMT with State Equation took 473 ms to find 0 implicit places.
[2023-03-18 20:25:15] [INFO ] Invariant cache hit.
[2023-03-18 20:25:15] [INFO ] Dead Transitions using invariants and state equation in 220 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 392/402 places, 392/402 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 732 ms. Remains : 392/402 places, 392/402 transitions.
Stuttering acceptance computed with spot in 190 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (AND (NOT p1) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2))]
Running random walk in product with property : ShieldRVt-PT-010B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (NEQ s109 1) (NEQ s163 1)), p1:(NEQ s109 1), p2:(OR (EQ s109 1) (EQ s163 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 607 ms.
Product exploration explored 100000 steps with 50000 reset in 356 ms.
Computed a total of 119 stabilizing places and 119 stable transitions
Computed a total of 119 stabilizing places and 119 stable transitions
Detected a total of 119/392 stabilizing places and 119/392 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X p0), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p0 p1 (NOT p2))
Knowledge based reduction with 12 factoid took 582 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-010B-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-010B-LTLFireability-02 finished in 2533 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 (!p0 U X(p1)))&&X(p2))))'
Support contains 3 out of 402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 402/402 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 392 transition count 392
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 392 transition count 392
Applied a total of 20 rules in 18 ms. Remains 392 /402 variables (removed 10) and now considering 392/402 (removed 10) transitions.
// Phase 1: matrix 392 rows 392 cols
[2023-03-18 20:25:17] [INFO ] Computed 41 place invariants in 4 ms
[2023-03-18 20:25:17] [INFO ] Implicit Places using invariants in 166 ms returned []
[2023-03-18 20:25:17] [INFO ] Invariant cache hit.
[2023-03-18 20:25:17] [INFO ] Implicit Places using invariants and state equation in 335 ms returned []
Implicit Place search using SMT with State Equation took 504 ms to find 0 implicit places.
[2023-03-18 20:25:17] [INFO ] Invariant cache hit.
[2023-03-18 20:25:17] [INFO ] Dead Transitions using invariants and state equation in 231 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 392/402 places, 392/402 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 755 ms. Remains : 392/402 places, 392/402 transitions.
Stuttering acceptance computed with spot in 372 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldRVt-PT-010B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 2}]], initial=0, aps=[p0:(NEQ s337 1), p1:(EQ s207 1), p2:(EQ s329 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 91083 steps with 475 reset in 312 ms.
FORMULA ShieldRVt-PT-010B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-010B-LTLFireability-03 finished in 1467 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(X(F(p0)))))'
Support contains 1 out of 402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 402/402 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 392 transition count 392
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 392 transition count 392
Applied a total of 20 rules in 13 ms. Remains 392 /402 variables (removed 10) and now considering 392/402 (removed 10) transitions.
// Phase 1: matrix 392 rows 392 cols
[2023-03-18 20:25:18] [INFO ] Computed 41 place invariants in 5 ms
[2023-03-18 20:25:18] [INFO ] Implicit Places using invariants in 176 ms returned []
[2023-03-18 20:25:18] [INFO ] Invariant cache hit.
[2023-03-18 20:25:19] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 456 ms to find 0 implicit places.
[2023-03-18 20:25:19] [INFO ] Invariant cache hit.
[2023-03-18 20:25:19] [INFO ] Dead Transitions using invariants and state equation in 245 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 392/402 places, 392/402 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 717 ms. Remains : 392/402 places, 392/402 transitions.
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-010B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(EQ s329 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]]
Product exploration explored 100000 steps with 1472 reset in 240 ms.
Product exploration explored 100000 steps with 1485 reset in 304 ms.
Computed a total of 119 stabilizing places and 119 stable transitions
Computed a total of 119 stabilizing places and 119 stable transitions
Detected a total of 119/392 stabilizing places and 119/392 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 180 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 101 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=50 )
Knowledge obtained : [(NOT p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 152 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2023-03-18 20:25:20] [INFO ] Invariant cache hit.
[2023-03-18 20:25:20] [INFO ] [Real]Absence check using 41 positive place invariants in 11 ms returned sat
[2023-03-18 20:25:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 20:25:21] [INFO ] [Real]Absence check using state equation in 215 ms returned sat
[2023-03-18 20:25:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 20:25:21] [INFO ] [Nat]Absence check using 41 positive place invariants in 14 ms returned sat
[2023-03-18 20:25:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 20:25:21] [INFO ] [Nat]Absence check using state equation in 290 ms returned sat
[2023-03-18 20:25:21] [INFO ] Computed and/alt/rep : 391/573/391 causal constraints (skipped 0 transitions) in 72 ms.
[2023-03-18 20:25:23] [INFO ] Added : 389 causal constraints over 78 iterations in 1979 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 392 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 392/392 places, 392/392 transitions.
Applied a total of 0 rules in 8 ms. Remains 392 /392 variables (removed 0) and now considering 392/392 (removed 0) transitions.
[2023-03-18 20:25:23] [INFO ] Invariant cache hit.
[2023-03-18 20:25:23] [INFO ] Implicit Places using invariants in 109 ms returned []
[2023-03-18 20:25:23] [INFO ] Invariant cache hit.
[2023-03-18 20:25:23] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 354 ms to find 0 implicit places.
[2023-03-18 20:25:24] [INFO ] Invariant cache hit.
[2023-03-18 20:25:24] [INFO ] Dead Transitions using invariants and state equation in 200 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 577 ms. Remains : 392/392 places, 392/392 transitions.
Computed a total of 119 stabilizing places and 119 stable transitions
Computed a total of 119 stabilizing places and 119 stable transitions
Detected a total of 119/392 stabilizing places and 119/392 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 237 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 226 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 28 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=28 )
Knowledge obtained : [(NOT p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 244 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 253 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 235 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2023-03-18 20:25:25] [INFO ] Invariant cache hit.
[2023-03-18 20:25:25] [INFO ] [Real]Absence check using 41 positive place invariants in 14 ms returned sat
[2023-03-18 20:25:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 20:25:25] [INFO ] [Real]Absence check using state equation in 279 ms returned sat
[2023-03-18 20:25:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 20:25:26] [INFO ] [Nat]Absence check using 41 positive place invariants in 16 ms returned sat
[2023-03-18 20:25:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 20:25:26] [INFO ] [Nat]Absence check using state equation in 257 ms returned sat
[2023-03-18 20:25:26] [INFO ] Computed and/alt/rep : 391/573/391 causal constraints (skipped 0 transitions) in 23 ms.
[2023-03-18 20:25:28] [INFO ] Added : 389 causal constraints over 78 iterations in 1897 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 226 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1518 reset in 202 ms.
Product exploration explored 100000 steps with 1542 reset in 254 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 191 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 392 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 392/392 places, 392/392 transitions.
Performed 108 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 108 rules applied. Total rules applied 108 place count 392 transition count 392
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 41 Pre rules applied. Total rules applied 108 place count 392 transition count 432
Deduced a syphon composed of 149 places in 0 ms
Iterating global reduction 1 with 41 rules applied. Total rules applied 149 place count 392 transition count 432
Performed 119 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 268 places in 0 ms
Iterating global reduction 1 with 119 rules applied. Total rules applied 268 place count 392 transition count 432
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 269 place count 392 transition count 431
Discarding 78 places :
Symmetric choice reduction at 2 with 78 rule applications. Total rules 347 place count 314 transition count 353
Deduced a syphon composed of 190 places in 0 ms
Iterating global reduction 2 with 78 rules applied. Total rules applied 425 place count 314 transition count 353
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 191 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 426 place count 314 transition count 353
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 428 place count 312 transition count 351
Deduced a syphon composed of 189 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 430 place count 312 transition count 351
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: -277
Deduced a syphon composed of 228 places in 0 ms
Iterating global reduction 2 with 39 rules applied. Total rules applied 469 place count 312 transition count 628
Discarding 39 places :
Symmetric choice reduction at 2 with 39 rule applications. Total rules 508 place count 273 transition count 550
Deduced a syphon composed of 189 places in 0 ms
Iterating global reduction 2 with 39 rules applied. Total rules applied 547 place count 273 transition count 550
Deduced a syphon composed of 189 places in 1 ms
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 550 place count 273 transition count 547
Deduced a syphon composed of 189 places in 0 ms
Applied a total of 550 rules in 151 ms. Remains 273 /392 variables (removed 119) and now considering 547/392 (removed -155) transitions.
[2023-03-18 20:25:29] [INFO ] Redundant transitions in 32 ms returned []
// Phase 1: matrix 547 rows 273 cols
[2023-03-18 20:25:29] [INFO ] Computed 41 place invariants in 15 ms
[2023-03-18 20:25:30] [INFO ] Dead Transitions using invariants and state equation in 363 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 273/392 places, 547/392 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 582 ms. Remains : 273/392 places, 547/392 transitions.
Built C files in :
/tmp/ltsmin1981041499314115030
[2023-03-18 20:25:30] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1981041499314115030
Running compilation step : cd /tmp/ltsmin1981041499314115030;'/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 684 ms.
Running link step : cd /tmp/ltsmin1981041499314115030;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 73 ms.
Running LTSmin : cd /tmp/ltsmin1981041499314115030;'/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/stateBased14538918227090627940.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 392 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 392/392 places, 392/392 transitions.
Applied a total of 0 rules in 26 ms. Remains 392 /392 variables (removed 0) and now considering 392/392 (removed 0) transitions.
// Phase 1: matrix 392 rows 392 cols
[2023-03-18 20:25:45] [INFO ] Computed 41 place invariants in 2 ms
[2023-03-18 20:25:45] [INFO ] Implicit Places using invariants in 204 ms returned []
[2023-03-18 20:25:45] [INFO ] Invariant cache hit.
[2023-03-18 20:25:45] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 508 ms to find 0 implicit places.
[2023-03-18 20:25:45] [INFO ] Invariant cache hit.
[2023-03-18 20:25:45] [INFO ] Dead Transitions using invariants and state equation in 254 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 790 ms. Remains : 392/392 places, 392/392 transitions.
Built C files in :
/tmp/ltsmin16246673769177005499
[2023-03-18 20:25:45] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16246673769177005499
Running compilation step : cd /tmp/ltsmin16246673769177005499;'/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 527 ms.
Running link step : cd /tmp/ltsmin16246673769177005499;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin16246673769177005499;'/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/stateBased12486464562428294474.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-18 20:26:01] [INFO ] Flatten gal took : 28 ms
[2023-03-18 20:26:01] [INFO ] Flatten gal took : 26 ms
[2023-03-18 20:26:01] [INFO ] Time to serialize gal into /tmp/LTL11691767544652855773.gal : 4 ms
[2023-03-18 20:26:01] [INFO ] Time to serialize properties into /tmp/LTL738106815363738687.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11691767544652855773.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4233749918298813831.hoa' '-atoms' '/tmp/LTL738106815363738687.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL738106815363738687.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4233749918298813831.hoa
Detected timeout of ITS tools.
[2023-03-18 20:26:16] [INFO ] Flatten gal took : 30 ms
[2023-03-18 20:26:16] [INFO ] Flatten gal took : 38 ms
[2023-03-18 20:26:16] [INFO ] Time to serialize gal into /tmp/LTL13478381927155613903.gal : 7 ms
[2023-03-18 20:26:16] [INFO ] Time to serialize properties into /tmp/LTL373385528478466491.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13478381927155613903.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL373385528478466491.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F("(p419==1)"))))))
Formula 0 simplified : XXXG!"(p419==1)"
Detected timeout of ITS tools.
[2023-03-18 20:26:31] [INFO ] Flatten gal took : 30 ms
[2023-03-18 20:26:31] [INFO ] Applying decomposition
[2023-03-18 20:26:31] [INFO ] Flatten gal took : 29 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph10427422404118807231.txt' '-o' '/tmp/graph10427422404118807231.bin' '-w' '/tmp/graph10427422404118807231.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph10427422404118807231.bin' '-l' '-1' '-v' '-w' '/tmp/graph10427422404118807231.weights' '-q' '0' '-e' '0.001'
[2023-03-18 20:26:31] [INFO ] Decomposing Gal with order
[2023-03-18 20:26:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 20:26:32] [INFO ] Removed a total of 103 redundant transitions.
[2023-03-18 20:26:32] [INFO ] Flatten gal took : 79 ms
[2023-03-18 20:26:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2023-03-18 20:26:32] [INFO ] Time to serialize gal into /tmp/LTL16894171817456818129.gal : 13 ms
[2023-03-18 20:26:32] [INFO ] Time to serialize properties into /tmp/LTL18371274297670898114.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16894171817456818129.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18371274297670898114.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F("(i15.u132.p419==1)"))))))
Formula 0 simplified : XXXG!"(i15.u132.p419==1)"
Reverse transition relation is NOT exact ! Due to transitions t363, t365, t367, t369, t372, t374, t376, t378, i0.t60, i0.t55, i0.t46, i0.t41, i0.u139.t50, ...1164
Computing Next relation with stutter on 1.6593e+07 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
351 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.55806,96764,1,0,178527,524,5128,369414,191,1887,256185
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldRVt-PT-010B-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property ShieldRVt-PT-010B-LTLFireability-04 finished in 77742 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((F(G(p0)) U p1)))))'
Support contains 2 out of 402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 402/402 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 392 transition count 392
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 392 transition count 392
Applied a total of 20 rules in 27 ms. Remains 392 /402 variables (removed 10) and now considering 392/402 (removed 10) transitions.
// Phase 1: matrix 392 rows 392 cols
[2023-03-18 20:26:36] [INFO ] Computed 41 place invariants in 2 ms
[2023-03-18 20:26:36] [INFO ] Implicit Places using invariants in 205 ms returned []
[2023-03-18 20:26:36] [INFO ] Invariant cache hit.
[2023-03-18 20:26:36] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 425 ms to find 0 implicit places.
[2023-03-18 20:26:36] [INFO ] Invariant cache hit.
[2023-03-18 20:26:37] [INFO ] Dead Transitions using invariants and state equation in 492 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 392/402 places, 392/402 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 964 ms. Remains : 392/402 places, 392/402 transitions.
Stuttering acceptance computed with spot in 320 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-010B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s71 1), p0:(EQ s271 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 222 ms.
Stack based approach found an accepted trace after 887 steps with 0 reset with depth 888 and stack size 888 in 2 ms.
FORMULA ShieldRVt-PT-010B-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-010B-LTLFireability-05 finished in 1571 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(X((p0&&G((F(p1)&&F(G(p2)))))))))'
Support contains 3 out of 402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 402/402 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 391 transition count 391
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 391 transition count 391
Applied a total of 22 rules in 10 ms. Remains 391 /402 variables (removed 11) and now considering 391/402 (removed 11) transitions.
// Phase 1: matrix 391 rows 391 cols
[2023-03-18 20:26:37] [INFO ] Computed 41 place invariants in 3 ms
[2023-03-18 20:26:38] [INFO ] Implicit Places using invariants in 169 ms returned []
[2023-03-18 20:26:38] [INFO ] Invariant cache hit.
[2023-03-18 20:26:38] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 444 ms to find 0 implicit places.
[2023-03-18 20:26:38] [INFO ] Invariant cache hit.
[2023-03-18 20:26:38] [INFO ] Dead Transitions using invariants and state equation in 229 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 391/402 places, 391/402 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 686 ms. Remains : 391/402 places, 391/402 transitions.
Stuttering acceptance computed with spot in 300 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldRVt-PT-010B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 6}, { cond=p0, acceptance={} source=3 dest: 7}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}], [{ cond=p2, acceptance={} source=6 dest: 6}, { cond=(NOT p2), acceptance={0} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={} source=7 dest: 5}, { cond=(NOT p2), acceptance={} source=7 dest: 6}, { cond=true, acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(EQ s254 0), p1:(EQ s86 0), p2:(EQ s99 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 5 reset in 306 ms.
Stack based approach found an accepted trace after 28488 steps with 8 reset with depth 3528 and stack size 3417 in 74 ms.
FORMULA ShieldRVt-PT-010B-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-010B-LTLFireability-06 finished in 1405 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))'
Support contains 4 out of 402 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 402/402 places, 402/402 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 111 transitions
Trivial Post-agglo rules discarded 111 transitions
Performed 111 trivial Post agglomeration. Transition count delta: 111
Iterating post reduction 0 with 111 rules applied. Total rules applied 111 place count 401 transition count 290
Reduce places removed 111 places and 0 transitions.
Iterating post reduction 1 with 111 rules applied. Total rules applied 222 place count 290 transition count 290
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 74 Pre rules applied. Total rules applied 222 place count 290 transition count 216
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 148 rules applied. Total rules applied 370 place count 216 transition count 216
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 378 place count 208 transition count 208
Iterating global reduction 2 with 8 rules applied. Total rules applied 386 place count 208 transition count 208
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 386 place count 208 transition count 203
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 396 place count 203 transition count 203
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 0 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 2 with 172 rules applied. Total rules applied 568 place count 117 transition count 117
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 569 place count 117 transition count 116
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 571 place count 116 transition count 115
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 629 place count 87 transition count 142
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 631 place count 85 transition count 140
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 632 place count 84 transition count 140
Applied a total of 632 rules in 38 ms. Remains 84 /402 variables (removed 318) and now considering 140/402 (removed 262) transitions.
// Phase 1: matrix 140 rows 84 cols
[2023-03-18 20:26:39] [INFO ] Computed 40 place invariants in 1 ms
[2023-03-18 20:26:39] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-18 20:26:39] [INFO ] Invariant cache hit.
[2023-03-18 20:26:39] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
[2023-03-18 20:26:39] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 20:26:39] [INFO ] Invariant cache hit.
[2023-03-18 20:26:39] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 84/402 places, 140/402 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 303 ms. Remains : 84/402 places, 140/402 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-010B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s45 1) (EQ s47 1) (EQ s51 1)), p0:(EQ s30 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 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-010B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-010B-LTLFireability-07 finished in 434 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))||(p1&&X(F(p2))))))'
Support contains 7 out of 402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 402/402 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 392 transition count 392
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 392 transition count 392
Applied a total of 20 rules in 8 ms. Remains 392 /402 variables (removed 10) and now considering 392/402 (removed 10) transitions.
// Phase 1: matrix 392 rows 392 cols
[2023-03-18 20:26:39] [INFO ] Computed 41 place invariants in 2 ms
[2023-03-18 20:26:39] [INFO ] Implicit Places using invariants in 106 ms returned []
[2023-03-18 20:26:39] [INFO ] Invariant cache hit.
[2023-03-18 20:26:40] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
[2023-03-18 20:26:40] [INFO ] Invariant cache hit.
[2023-03-18 20:26:40] [INFO ] Dead Transitions using invariants and state equation in 158 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 392/402 places, 392/402 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 508 ms. Remains : 392/402 places, 392/402 transitions.
Stuttering acceptance computed with spot in 233 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldRVt-PT-010B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s62 1) (EQ s66 1) (EQ s79 1)), p1:(EQ s101 1), p2:(AND (EQ s194 1) (EQ s203 1) (EQ s228 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 28247 steps with 7 reset in 64 ms.
FORMULA ShieldRVt-PT-010B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-010B-LTLFireability-08 finished in 822 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((F(G((X(p0) U p1)))&&G(G(p2)))))'
Support contains 2 out of 402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 402/402 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 392 transition count 392
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 392 transition count 392
Applied a total of 20 rules in 9 ms. Remains 392 /402 variables (removed 10) and now considering 392/402 (removed 10) transitions.
// Phase 1: matrix 392 rows 392 cols
[2023-03-18 20:26:40] [INFO ] Computed 41 place invariants in 2 ms
[2023-03-18 20:26:40] [INFO ] Implicit Places using invariants in 117 ms returned []
[2023-03-18 20:26:40] [INFO ] Invariant cache hit.
[2023-03-18 20:26:40] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 335 ms to find 0 implicit places.
[2023-03-18 20:26:40] [INFO ] Invariant cache hit.
[2023-03-18 20:26:41] [INFO ] Dead Transitions using invariants and state equation in 193 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 392/402 places, 392/402 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 539 ms. Remains : 392/402 places, 392/402 transitions.
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-010B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(EQ s367 0), p1:(NEQ s85 1), p0:(EQ s367 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 4 reset in 189 ms.
Stack based approach found an accepted trace after 643 steps with 0 reset with depth 644 and stack size 643 in 2 ms.
FORMULA ShieldRVt-PT-010B-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-010B-LTLFireability-09 finished in 865 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(X(F((p0||G((p1&&(p1 U (p2||G(p1)))))))))))'
Support contains 2 out of 402 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 402/402 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 393 transition count 393
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 393 transition count 393
Applied a total of 18 rules in 8 ms. Remains 393 /402 variables (removed 9) and now considering 393/402 (removed 9) transitions.
// Phase 1: matrix 393 rows 393 cols
[2023-03-18 20:26:41] [INFO ] Computed 41 place invariants in 3 ms
[2023-03-18 20:26:41] [INFO ] Implicit Places using invariants in 151 ms returned []
[2023-03-18 20:26:41] [INFO ] Invariant cache hit.
[2023-03-18 20:26:41] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 414 ms to find 0 implicit places.
[2023-03-18 20:26:41] [INFO ] Invariant cache hit.
[2023-03-18 20:26:42] [INFO ] Dead Transitions using invariants and state equation in 217 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 393/402 places, 393/402 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 639 ms. Remains : 393/402 places, 393/402 transitions.
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-010B-LTLFireability-10 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=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(EQ s264 1), p0:(EQ s115 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 54384 steps with 39 reset in 137 ms.
FORMULA ShieldRVt-PT-010B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-010B-LTLFireability-10 finished in 946 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' '!((G(p0)||((p1&&X(X(p2))) U X(X(p3)))))'
Support contains 4 out of 402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 402/402 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 392 transition count 392
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 392 transition count 392
Applied a total of 20 rules in 21 ms. Remains 392 /402 variables (removed 10) and now considering 392/402 (removed 10) transitions.
// Phase 1: matrix 392 rows 392 cols
[2023-03-18 20:26:42] [INFO ] Computed 41 place invariants in 3 ms
[2023-03-18 20:26:42] [INFO ] Implicit Places using invariants in 141 ms returned []
[2023-03-18 20:26:42] [INFO ] Invariant cache hit.
[2023-03-18 20:26:42] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 452 ms to find 0 implicit places.
[2023-03-18 20:26:42] [INFO ] Invariant cache hit.
[2023-03-18 20:26:42] [INFO ] Dead Transitions using invariants and state equation in 192 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 392/402 places, 392/402 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 669 ms. Remains : 392/402 places, 392/402 transitions.
Stuttering acceptance computed with spot in 518 ms :[(AND (NOT p0) (NOT p3)), true, (NOT p3), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p3) (NOT p0)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-010B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p3)), acceptance={} source=0 dest: 12}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p3), acceptance={} source=2 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 8}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 9}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 6}, { cond=(AND p0 p1), acceptance={} source=4 dest: 7}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 10}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 11}], [{ cond=p0, acceptance={} source=5 dest: 0}, { cond=(NOT p0), acceptance={} source=5 dest: 2}], [{ cond=(AND p0 (NOT p3) p2), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=6 dest: 2}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={} source=6 dest: 12}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=7 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p3) p2), acceptance={} source=7 dest: 6}, { cond=(AND p0 p1 (NOT p3) p2), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p0) p1 (NOT p3) p2), acceptance={} source=7 dest: 10}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) p2), acceptance={} source=7 dest: 11}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={} source=7 dest: 12}], [{ cond=p1, acceptance={} source=8 dest: 10}, { cond=(NOT p1), acceptance={} source=8 dest: 11}], [{ cond=true, acceptance={} source=9 dest: 2}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=10 dest: 1}, { cond=(AND p1 (NOT p3) p2), acceptance={0} source=10 dest: 10}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={0} source=10 dest: 11}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=11 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={} source=11 dest: 2}], [{ cond=(NOT p0), acceptance={} source=12 dest: 1}, { cond=p0, acceptance={} source=12 dest: 12}]], initial=3, aps=[p0:(EQ s311 1), p3:(EQ s203 1), p1:(EQ s152 1), p2:(NEQ s259 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, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-010B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-010B-LTLFireability-15 finished in 1231 ms.
All properties solved by simple procedures.
Total runtime 110599 ms.
BK_STOP 1679171203730
--------------------
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="ShieldRVt-PT-010B"
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 ShieldRVt-PT-010B, 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-167905975000268"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-010B.tgz
mv ShieldRVt-PT-010B 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 ;