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.r423-tajo-167905976500267.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 lolaxred
Input is ShieldRVt-PT-010B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r423-tajo-167905976500267
=====================================================================

--------------------
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-LTLCardinality-00
FORMULA_NAME ShieldRVt-PT-010B-LTLCardinality-01
FORMULA_NAME ShieldRVt-PT-010B-LTLCardinality-02
FORMULA_NAME ShieldRVt-PT-010B-LTLCardinality-03
FORMULA_NAME ShieldRVt-PT-010B-LTLCardinality-04
FORMULA_NAME ShieldRVt-PT-010B-LTLCardinality-05
FORMULA_NAME ShieldRVt-PT-010B-LTLCardinality-06
FORMULA_NAME ShieldRVt-PT-010B-LTLCardinality-07
FORMULA_NAME ShieldRVt-PT-010B-LTLCardinality-08
FORMULA_NAME ShieldRVt-PT-010B-LTLCardinality-09
FORMULA_NAME ShieldRVt-PT-010B-LTLCardinality-10
FORMULA_NAME ShieldRVt-PT-010B-LTLCardinality-11
FORMULA_NAME ShieldRVt-PT-010B-LTLCardinality-12
FORMULA_NAME ShieldRVt-PT-010B-LTLCardinality-13
FORMULA_NAME ShieldRVt-PT-010B-LTLCardinality-14
FORMULA_NAME ShieldRVt-PT-010B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679245257398

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=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-010B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 17:01:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-19 17:01:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 17:01:00] [INFO ] Load time of PNML (sax parser for PT used): 102 ms
[2023-03-19 17:01:00] [INFO ] Transformed 503 places.
[2023-03-19 17:01:00] [INFO ] Transformed 503 transitions.
[2023-03-19 17:01:00] [INFO ] Found NUPN structural information;
[2023-03-19 17:01:00] [INFO ] Parsed PT model containing 503 places and 503 transitions and 1186 arcs in 270 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 6 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA ShieldRVt-PT-010B-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-010B-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-010B-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-010B-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 2 formulas.
FORMULA ShieldRVt-PT-010B-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-010B-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-010B-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 503/503 places, 503/503 transitions.
Discarding 101 places :
Symmetric choice reduction at 0 with 101 rule applications. Total rules 101 place count 402 transition count 402
Iterating global reduction 0 with 101 rules applied. Total rules applied 202 place count 402 transition count 402
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 203 place count 401 transition count 401
Iterating global reduction 0 with 1 rules applied. Total rules applied 204 place count 401 transition count 401
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 205 place count 400 transition count 400
Iterating global reduction 0 with 1 rules applied. Total rules applied 206 place count 400 transition count 400
Applied a total of 206 rules in 145 ms. Remains 400 /503 variables (removed 103) and now considering 400/503 (removed 103) transitions.
// Phase 1: matrix 400 rows 400 cols
[2023-03-19 17:01:01] [INFO ] Computed 41 place invariants in 30 ms
[2023-03-19 17:01:01] [INFO ] Implicit Places using invariants in 658 ms returned []
[2023-03-19 17:01:02] [INFO ] Invariant cache hit.
[2023-03-19 17:01:02] [INFO ] Implicit Places using invariants and state equation in 514 ms returned []
Implicit Place search using SMT with State Equation took 1246 ms to find 0 implicit places.
[2023-03-19 17:01:02] [INFO ] Invariant cache hit.
[2023-03-19 17:01:02] [INFO ] Dead Transitions using invariants and state equation in 404 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 400/503 places, 400/503 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1797 ms. Remains : 400/503 places, 400/503 transitions.
Support contains 31 out of 400 places after structural reductions.
[2023-03-19 17:01:03] [INFO ] Flatten gal took : 97 ms
[2023-03-19 17:01:03] [INFO ] Flatten gal took : 36 ms
[2023-03-19 17:01:03] [INFO ] Input system was already deterministic with 400 transitions.
Support contains 27 out of 400 places (down from 31) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 382 ms. (steps per millisecond=26 ) properties (out of 17) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-19 17:01:03] [INFO ] Invariant cache hit.
[2023-03-19 17:01:04] [INFO ] After 256ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 17:01:04] [INFO ] [Nat]Absence check using 41 positive place invariants in 303 ms returned sat
[2023-03-19 17:01:05] [INFO ] After 607ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 17:01:05] [INFO ] Deduced a trap composed of 18 places in 127 ms of which 29 ms to minimize.
[2023-03-19 17:01:05] [INFO ] Deduced a trap composed of 27 places in 126 ms of which 1 ms to minimize.
[2023-03-19 17:01:05] [INFO ] Deduced a trap composed of 20 places in 93 ms of which 1 ms to minimize.
[2023-03-19 17:01:06] [INFO ] Deduced a trap composed of 38 places in 128 ms of which 1 ms to minimize.
[2023-03-19 17:01:06] [INFO ] Deduced a trap composed of 28 places in 336 ms of which 1 ms to minimize.
[2023-03-19 17:01:06] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 1 ms to minimize.
[2023-03-19 17:01:06] [INFO ] Deduced a trap composed of 28 places in 87 ms of which 0 ms to minimize.
[2023-03-19 17:01:06] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1208 ms
[2023-03-19 17:01:06] [INFO ] Deduced a trap composed of 21 places in 91 ms of which 1 ms to minimize.
[2023-03-19 17:01:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 146 ms
[2023-03-19 17:01:07] [INFO ] After 2085ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 57 ms.
[2023-03-19 17:01:07] [INFO ] After 2854ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 51 ms.
Support contains 8 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 400/400 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 400 transition count 292
Reduce places removed 108 places and 0 transitions.
Iterating post reduction 1 with 108 rules applied. Total rules applied 216 place count 292 transition count 292
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 74 Pre rules applied. Total rules applied 216 place count 292 transition count 218
Deduced a syphon composed of 74 places in 1 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 148 rules applied. Total rules applied 364 place count 218 transition count 218
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 370 place count 212 transition count 212
Iterating global reduction 2 with 6 rules applied. Total rules applied 376 place count 212 transition count 212
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 376 place count 212 transition count 210
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 380 place count 210 transition count 210
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 2 with 178 rules applied. Total rules applied 558 place count 121 transition count 121
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 559 place count 121 transition count 120
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 561 place count 120 transition count 119
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 617 place count 92 transition count 145
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 618 place count 92 transition count 144
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 619 place count 91 transition count 143
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 620 place count 90 transition count 143
Applied a total of 620 rules in 125 ms. Remains 90 /400 variables (removed 310) and now considering 143/400 (removed 257) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 125 ms. Remains : 90/400 places, 143/400 transitions.
Finished random walk after 1920 steps, including 0 resets, run visited all 3 properties in 51 ms. (steps per millisecond=37 )
Computed a total of 121 stabilizing places and 121 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) U p1)&&X(F(p2)))))'
Support contains 2 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 400/400 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 392 transition count 392
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 392 transition count 392
Applied a total of 16 rules in 31 ms. Remains 392 /400 variables (removed 8) and now considering 392/400 (removed 8) transitions.
// Phase 1: matrix 392 rows 392 cols
[2023-03-19 17:01:07] [INFO ] Computed 41 place invariants in 3 ms
[2023-03-19 17:01:08] [INFO ] Implicit Places using invariants in 177 ms returned []
[2023-03-19 17:01:08] [INFO ] Invariant cache hit.
[2023-03-19 17:01:09] [INFO ] Implicit Places using invariants and state equation in 1163 ms returned []
Implicit Place search using SMT with State Equation took 1357 ms to find 0 implicit places.
[2023-03-19 17:01:09] [INFO ] Invariant cache hit.
[2023-03-19 17:01:09] [INFO ] Dead Transitions using invariants and state equation in 286 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 392/400 places, 392/400 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1689 ms. Remains : 392/400 places, 392/400 transitions.
Stuttering acceptance computed with spot in 572 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : ShieldRVt-PT-010B-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 4}, { cond=(OR p1 p0), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(EQ s329 1), p0:(EQ s121 1), p2:(EQ s329 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 6 ms.
FORMULA ShieldRVt-PT-010B-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-010B-LTLCardinality-02 finished in 2373 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) U X(X((!p1&&X(p2))))))'
Support contains 5 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 400/400 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 391 transition count 391
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 391 transition count 391
Applied a total of 18 rules in 25 ms. Remains 391 /400 variables (removed 9) and now considering 391/400 (removed 9) transitions.
// Phase 1: matrix 391 rows 391 cols
[2023-03-19 17:01:10] [INFO ] Computed 41 place invariants in 2 ms
[2023-03-19 17:01:10] [INFO ] Implicit Places using invariants in 255 ms returned []
[2023-03-19 17:01:10] [INFO ] Invariant cache hit.
[2023-03-19 17:01:11] [INFO ] Implicit Places using invariants and state equation in 675 ms returned []
Implicit Place search using SMT with State Equation took 936 ms to find 0 implicit places.
[2023-03-19 17:01:11] [INFO ] Invariant cache hit.
[2023-03-19 17:01:11] [INFO ] Dead Transitions using invariants and state equation in 207 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 391/400 places, 391/400 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1177 ms. Remains : 391/400 places, 391/400 transitions.
Stuttering acceptance computed with spot in 642 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1), true, (NOT p2), (OR (NOT p2) p1), (NOT p0), (NOT p2)]
Running random walk in product with property : ShieldRVt-PT-010B-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 6}], [{ cond=p1, acceptance={} source=3 dest: 4}, { cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=6 dest: 5}, { cond=(AND p0 p1), acceptance={0} source=6 dest: 6}, { cond=(AND p0 p1), acceptance={0} source=6 dest: 7}, { cond=(AND p0 (NOT p1)), acceptance={0} source=6 dest: 8}], [{ cond=(NOT p0), acceptance={} source=7 dest: 4}, { cond=p0, acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=8 dest: 4}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=8 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={0} source=8 dest: 7}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p0:(OR (EQ s97 0) (EQ s278 1)), p1:(OR (EQ s124 0) (EQ s97 1)), p2:(OR (EQ s169 0) (EQ s379 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7208 steps with 1 reset in 99 ms.
FORMULA ShieldRVt-PT-010B-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-010B-LTLCardinality-03 finished in 1962 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(F(p0)))'
Support contains 4 out of 400 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 400/400 places, 400/400 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 109 transitions
Trivial Post-agglo rules discarded 109 transitions
Performed 109 trivial Post agglomeration. Transition count delta: 109
Iterating post reduction 0 with 109 rules applied. Total rules applied 109 place count 399 transition count 290
Reduce places removed 109 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 110 rules applied. Total rules applied 219 place count 290 transition count 289
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 220 place count 289 transition count 289
Performed 75 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 75 Pre rules applied. Total rules applied 220 place count 289 transition count 214
Deduced a syphon composed of 75 places in 1 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 3 with 150 rules applied. Total rules applied 370 place count 214 transition count 214
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 377 place count 207 transition count 207
Iterating global reduction 3 with 7 rules applied. Total rules applied 384 place count 207 transition count 207
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 384 place count 207 transition count 204
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 390 place count 204 transition count 204
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 3 with 172 rules applied. Total rules applied 562 place count 118 transition count 118
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 563 place count 118 transition count 117
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 565 place count 117 transition count 116
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 621 place count 89 transition count 142
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 623 place count 87 transition count 140
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 624 place count 86 transition count 140
Applied a total of 624 rules in 122 ms. Remains 86 /400 variables (removed 314) and now considering 140/400 (removed 260) transitions.
// Phase 1: matrix 140 rows 86 cols
[2023-03-19 17:01:12] [INFO ] Computed 40 place invariants in 1 ms
[2023-03-19 17:01:16] [INFO ] Implicit Places using invariants in 4404 ms returned []
[2023-03-19 17:01:16] [INFO ] Invariant cache hit.
[2023-03-19 17:01:16] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-19 17:01:16] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 4570 ms to find 0 implicit places.
[2023-03-19 17:01:16] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-19 17:01:16] [INFO ] Invariant cache hit.
[2023-03-19 17:01:16] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 86/400 places, 140/400 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4790 ms. Remains : 86/400 places, 140/400 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-010B-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s73 0) (EQ s44 1) (EQ s21 0) (EQ s77 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1154 steps with 1 reset in 15 ms.
FORMULA ShieldRVt-PT-010B-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-010B-LTLCardinality-06 finished in 4925 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((p0||G(p1))))))'
Support contains 3 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 400/400 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 393 transition count 393
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 393 transition count 393
Applied a total of 14 rules in 26 ms. Remains 393 /400 variables (removed 7) and now considering 393/400 (removed 7) transitions.
// Phase 1: matrix 393 rows 393 cols
[2023-03-19 17:01:17] [INFO ] Computed 41 place invariants in 2 ms
[2023-03-19 17:01:21] [INFO ] Implicit Places using invariants in 4546 ms returned []
[2023-03-19 17:01:21] [INFO ] Invariant cache hit.
[2023-03-19 17:01:21] [INFO ] Implicit Places using invariants and state equation in 298 ms returned []
Implicit Place search using SMT with State Equation took 4846 ms to find 0 implicit places.
[2023-03-19 17:01:21] [INFO ] Invariant cache hit.
[2023-03-19 17:01:22] [INFO ] Dead Transitions using invariants and state equation in 206 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 393/400 places, 393/400 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5081 ms. Remains : 393/400 places, 393/400 transitions.
Stuttering acceptance computed with spot in 162 ms :[true, (NOT p1), (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-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(OR (EQ s134 0) (EQ s181 1)), p0:(EQ s262 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1003 steps with 0 reset in 4 ms.
FORMULA ShieldRVt-PT-010B-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-010B-LTLCardinality-07 finished in 5276 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0)) U (p0&&G((p1&&X(p2))))))'
Support contains 5 out of 400 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 400/400 places, 400/400 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 110 transitions
Trivial Post-agglo rules discarded 110 transitions
Performed 110 trivial Post agglomeration. Transition count delta: 110
Iterating post reduction 0 with 110 rules applied. Total rules applied 110 place count 399 transition count 289
Reduce places removed 110 places and 0 transitions.
Iterating post reduction 1 with 110 rules applied. Total rules applied 220 place count 289 transition count 289
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 74 Pre rules applied. Total rules applied 220 place count 289 transition count 215
Deduced a syphon composed of 74 places in 1 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 148 rules applied. Total rules applied 368 place count 215 transition count 215
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 372 place count 211 transition count 211
Iterating global reduction 2 with 4 rules applied. Total rules applied 376 place count 211 transition count 211
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 376 place count 211 transition count 208
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 382 place count 208 transition count 208
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 2 with 176 rules applied. Total rules applied 558 place count 120 transition count 120
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 559 place count 120 transition count 119
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 561 place count 119 transition count 118
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 617 place count 91 transition count 144
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 618 place count 91 transition count 144
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 620 place count 89 transition count 142
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 621 place count 88 transition count 142
Applied a total of 621 rules in 60 ms. Remains 88 /400 variables (removed 312) and now considering 142/400 (removed 258) transitions.
// Phase 1: matrix 142 rows 88 cols
[2023-03-19 17:01:22] [INFO ] Computed 40 place invariants in 0 ms
[2023-03-19 17:01:22] [INFO ] Implicit Places using invariants in 100 ms returned []
[2023-03-19 17:01:22] [INFO ] Invariant cache hit.
[2023-03-19 17:01:22] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-19 17:01:22] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
[2023-03-19 17:01:22] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-19 17:01:22] [INFO ] Invariant cache hit.
[2023-03-19 17:01:22] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 88/400 places, 142/400 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 490 ms. Remains : 88/400 places, 142/400 transitions.
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) p1 (NOT p2)) (AND (NOT p1) p2))]
Running random walk in product with property : ShieldRVt-PT-010B-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0} source=1 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p2), acceptance={0} source=2 dest: 0}, { cond=(OR (AND (NOT p0) p1) (AND p1 p2)), acceptance={0} source=2 dest: 1}, { cond=(OR (AND (NOT p0) p1) (AND p1 p2)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s24 0) (EQ s46 1)), p1:(EQ s6 1), p2:(OR (EQ s67 0) (EQ s52 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 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-010B-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-010B-LTLCardinality-09 finished in 703 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 400/400 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 391 transition count 391
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 391 transition count 391
Applied a total of 18 rules in 21 ms. Remains 391 /400 variables (removed 9) and now considering 391/400 (removed 9) transitions.
// Phase 1: matrix 391 rows 391 cols
[2023-03-19 17:01:23] [INFO ] Computed 41 place invariants in 4 ms
[2023-03-19 17:01:23] [INFO ] Implicit Places using invariants in 121 ms returned []
[2023-03-19 17:01:23] [INFO ] Invariant cache hit.
[2023-03-19 17:01:30] [INFO ] Implicit Places using invariants and state equation in 6929 ms returned []
Implicit Place search using SMT with State Equation took 7087 ms to find 0 implicit places.
[2023-03-19 17:01:30] [INFO ] Invariant cache hit.
[2023-03-19 17:01:30] [INFO ] Dead Transitions using invariants and state equation in 213 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 391/400 places, 391/400 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7323 ms. Remains : 391/400 places, 391/400 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-010B-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s140 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 969 reset in 344 ms.
Product exploration explored 100000 steps with 948 reset in 444 ms.
Computed a total of 118 stabilizing places and 118 stable transitions
Computed a total of 118 stabilizing places and 118 stable transitions
Detected a total of 118/391 stabilizing places and 118/391 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 226 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Finished random walk after 86 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=43 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 176 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
[2023-03-19 17:01:31] [INFO ] Invariant cache hit.
[2023-03-19 17:01:31] [INFO ] [Real]Absence check using 41 positive place invariants in 14 ms returned sat
[2023-03-19 17:01:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 17:01:32] [INFO ] [Real]Absence check using state equation in 270 ms returned sat
[2023-03-19 17:01:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 17:01:32] [INFO ] [Nat]Absence check using 41 positive place invariants in 14 ms returned sat
[2023-03-19 17:01:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 17:01:32] [INFO ] [Nat]Absence check using state equation in 301 ms returned sat
[2023-03-19 17:01:32] [INFO ] Computed and/alt/rep : 390/571/390 causal constraints (skipped 0 transitions) in 26 ms.
[2023-03-19 17:01:35] [INFO ] Added : 385 causal constraints over 77 iterations in 2638 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 391 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 391/391 places, 391/391 transitions.
Reduce places removed 1 places and 1 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 390 transition count 282
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 282 transition count 281
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 218 place count 281 transition count 281
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 80 Pre rules applied. Total rules applied 218 place count 281 transition count 201
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 378 place count 201 transition count 201
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 3 with 172 rules applied. Total rules applied 550 place count 115 transition count 115
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 551 place count 115 transition count 114
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 553 place count 114 transition count 113
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 611 place count 85 transition count 141
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 613 place count 83 transition count 139
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 614 place count 82 transition count 139
Applied a total of 614 rules in 27 ms. Remains 82 /391 variables (removed 309) and now considering 139/391 (removed 252) transitions.
// Phase 1: matrix 139 rows 82 cols
[2023-03-19 17:01:35] [INFO ] Computed 40 place invariants in 0 ms
[2023-03-19 17:01:35] [INFO ] Implicit Places using invariants in 97 ms returned []
[2023-03-19 17:01:35] [INFO ] Invariant cache hit.
[2023-03-19 17:01:35] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-19 17:01:35] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
[2023-03-19 17:01:35] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-19 17:01:35] [INFO ] Invariant cache hit.
[2023-03-19 17:01:35] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 82/391 places, 139/391 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 377 ms. Remains : 82/391 places, 139/391 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/82 stabilizing places and 2/139 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 151 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 242 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
[2023-03-19 17:01:36] [INFO ] Invariant cache hit.
[2023-03-19 17:01:36] [INFO ] [Real]Absence check using 40 positive place invariants in 7 ms returned sat
[2023-03-19 17:01:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 17:01:36] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2023-03-19 17:01:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 17:01:36] [INFO ] [Nat]Absence check using 40 positive place invariants in 8 ms returned sat
[2023-03-19 17:01:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 17:01:36] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2023-03-19 17:01:36] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-19 17:01:36] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2023-03-19 17:01:36] [INFO ] Computed and/alt/rep : 134/451/134 causal constraints (skipped 0 transitions) in 10 ms.
[2023-03-19 17:01:36] [INFO ] Added : 102 causal constraints over 21 iterations in 223 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-010B-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-010B-LTLCardinality-10 finished in 13948 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 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 400/400 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 392 transition count 392
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 392 transition count 392
Applied a total of 16 rules in 14 ms. Remains 392 /400 variables (removed 8) and now considering 392/400 (removed 8) transitions.
// Phase 1: matrix 392 rows 392 cols
[2023-03-19 17:01:36] [INFO ] Computed 41 place invariants in 3 ms
[2023-03-19 17:01:37] [INFO ] Implicit Places using invariants in 155 ms returned []
[2023-03-19 17:01:37] [INFO ] Invariant cache hit.
[2023-03-19 17:01:37] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 452 ms to find 0 implicit places.
[2023-03-19 17:01:37] [INFO ] Invariant cache hit.
[2023-03-19 17:01:37] [INFO ] Dead Transitions using invariants and state equation in 216 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 392/400 places, 392/400 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 697 ms. Remains : 392/400 places, 392/400 transitions.
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-010B-LTLCardinality-11 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 (EQ s245 0) (EQ s198 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 60 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-010B-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-010B-LTLCardinality-11 finished in 846 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 1 out of 400 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 400/400 places, 400/400 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 113 transitions
Trivial Post-agglo rules discarded 113 transitions
Performed 113 trivial Post agglomeration. Transition count delta: 113
Iterating post reduction 0 with 113 rules applied. Total rules applied 113 place count 399 transition count 286
Reduce places removed 113 places and 0 transitions.
Iterating post reduction 1 with 113 rules applied. Total rules applied 226 place count 286 transition count 286
Performed 75 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 75 Pre rules applied. Total rules applied 226 place count 286 transition count 211
Deduced a syphon composed of 75 places in 1 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 2 with 150 rules applied. Total rules applied 376 place count 211 transition count 211
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 382 place count 205 transition count 205
Iterating global reduction 2 with 6 rules applied. Total rules applied 388 place count 205 transition count 205
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 388 place count 205 transition count 202
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 394 place count 202 transition count 202
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 2 with 176 rules applied. Total rules applied 570 place count 114 transition count 114
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 571 place count 114 transition count 113
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 573 place count 113 transition count 112
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: -28
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 631 place count 84 transition count 140
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 633 place count 82 transition count 138
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 634 place count 81 transition count 138
Applied a total of 634 rules in 79 ms. Remains 81 /400 variables (removed 319) and now considering 138/400 (removed 262) transitions.
// Phase 1: matrix 138 rows 81 cols
[2023-03-19 17:01:37] [INFO ] Computed 40 place invariants in 1 ms
[2023-03-19 17:01:37] [INFO ] Implicit Places using invariants in 135 ms returned []
[2023-03-19 17:01:37] [INFO ] Invariant cache hit.
[2023-03-19 17:01:38] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
[2023-03-19 17:01:38] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-19 17:01:38] [INFO ] Invariant cache hit.
[2023-03-19 17:01:38] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 81/400 places, 138/400 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 552 ms. Remains : 81/400 places, 138/400 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-010B-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s57 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 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-010B-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-010B-LTLCardinality-14 finished in 624 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0 U p1))))'
Support contains 4 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 400/400 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 392 transition count 392
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 392 transition count 392
Applied a total of 16 rules in 9 ms. Remains 392 /400 variables (removed 8) and now considering 392/400 (removed 8) transitions.
// Phase 1: matrix 392 rows 392 cols
[2023-03-19 17:01:38] [INFO ] Computed 41 place invariants in 3 ms
[2023-03-19 17:01:38] [INFO ] Implicit Places using invariants in 142 ms returned []
[2023-03-19 17:01:38] [INFO ] Invariant cache hit.
[2023-03-19 17:01:38] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 420 ms to find 0 implicit places.
[2023-03-19 17:01:38] [INFO ] Invariant cache hit.
[2023-03-19 17:01:45] [INFO ] Dead Transitions using invariants and state equation in 6739 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 392/400 places, 392/400 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7172 ms. Remains : 392/400 places, 392/400 transitions.
Stuttering acceptance computed with spot in 156 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-010B-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=3, aps=[p1:(OR (EQ s156 0) (EQ s112 1)), p0:(OR (EQ s90 0) (EQ s204 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 33333 reset in 338 ms.
Product exploration explored 100000 steps with 33333 reset in 291 ms.
Computed a total of 118 stabilizing places and 118 stable transitions
Computed a total of 118 stabilizing places and 118 stable transitions
Detected a total of 118/392 stabilizing places and 118/392 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p1) (NOT p0)))))
Knowledge based reduction with 4 factoid took 102 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-010B-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-010B-LTLCardinality-15 finished in 8079 ms.
All properties solved by simple procedures.
Total runtime 45934 ms.
ITS solved all properties within timeout

BK_STOP 1679245306670

--------------------
content from stderr:

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML

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="LTLCardinality"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is ShieldRVt-PT-010B, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r423-tajo-167905976500267"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;