Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r393-oct2-167903716800219.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is ShieldIIPt-PT-003B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r393-oct2-167903716800219
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 5.8K Feb 25 16:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Feb 25 16:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 16:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 25 16:59 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 16:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 17:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Feb 25 17:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 17:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Feb 25 17:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:56 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 50K 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 ShieldIIPt-PT-003B-LTLCardinality-00
FORMULA_NAME ShieldIIPt-PT-003B-LTLCardinality-01
FORMULA_NAME ShieldIIPt-PT-003B-LTLCardinality-02
FORMULA_NAME ShieldIIPt-PT-003B-LTLCardinality-03
FORMULA_NAME ShieldIIPt-PT-003B-LTLCardinality-04
FORMULA_NAME ShieldIIPt-PT-003B-LTLCardinality-05
FORMULA_NAME ShieldIIPt-PT-003B-LTLCardinality-06
FORMULA_NAME ShieldIIPt-PT-003B-LTLCardinality-07
FORMULA_NAME ShieldIIPt-PT-003B-LTLCardinality-08
FORMULA_NAME ShieldIIPt-PT-003B-LTLCardinality-09
FORMULA_NAME ShieldIIPt-PT-003B-LTLCardinality-10
FORMULA_NAME ShieldIIPt-PT-003B-LTLCardinality-11
FORMULA_NAME ShieldIIPt-PT-003B-LTLCardinality-12
FORMULA_NAME ShieldIIPt-PT-003B-LTLCardinality-13
FORMULA_NAME ShieldIIPt-PT-003B-LTLCardinality-14
FORMULA_NAME ShieldIIPt-PT-003B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679432665429

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=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-003B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-21 21:04:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-21 21:04:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 21:04:28] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2023-03-21 21:04:28] [INFO ] Transformed 213 places.
[2023-03-21 21:04:28] [INFO ] Transformed 198 transitions.
[2023-03-21 21:04:28] [INFO ] Found NUPN structural information;
[2023-03-21 21:04:28] [INFO ] Parsed PT model containing 213 places and 198 transitions and 492 arcs in 138 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Initial state reduction rules removed 2 formulas.
FORMULA ShieldIIPt-PT-003B-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-003B-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-003B-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-003B-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-003B-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-003B-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-003B-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-003B-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-003B-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-003B-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 16 out of 213 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 198/198 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 184 transition count 169
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 184 transition count 169
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 183 transition count 168
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 183 transition count 168
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 182 transition count 167
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 182 transition count 167
Applied a total of 62 rules in 97 ms. Remains 182 /213 variables (removed 31) and now considering 167/198 (removed 31) transitions.
// Phase 1: matrix 167 rows 182 cols
[2023-03-21 21:04:28] [INFO ] Computed 28 place invariants in 11 ms
[2023-03-21 21:04:29] [INFO ] Implicit Places using invariants in 563 ms returned []
[2023-03-21 21:04:29] [INFO ] Invariant cache hit.
[2023-03-21 21:04:29] [INFO ] Implicit Places using invariants and state equation in 474 ms returned []
Implicit Place search using SMT with State Equation took 1067 ms to find 0 implicit places.
[2023-03-21 21:04:29] [INFO ] Invariant cache hit.
[2023-03-21 21:04:29] [INFO ] Dead Transitions using invariants and state equation in 188 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 182/213 places, 167/198 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1353 ms. Remains : 182/213 places, 167/198 transitions.
Support contains 16 out of 182 places after structural reductions.
[2023-03-21 21:04:30] [INFO ] Flatten gal took : 43 ms
[2023-03-21 21:04:30] [INFO ] Flatten gal took : 13 ms
[2023-03-21 21:04:30] [INFO ] Input system was already deterministic with 167 transitions.
Finished random walk after 383 steps, including 0 resets, run visited all 10 properties in 48 ms. (steps per millisecond=7 )
Computed a total of 46 stabilizing places and 46 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(p0))'
Support contains 2 out of 182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 167/167 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 180 transition count 165
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 180 transition count 165
Applied a total of 4 rules in 7 ms. Remains 180 /182 variables (removed 2) and now considering 165/167 (removed 2) transitions.
// Phase 1: matrix 165 rows 180 cols
[2023-03-21 21:04:30] [INFO ] Computed 28 place invariants in 5 ms
[2023-03-21 21:04:30] [INFO ] Implicit Places using invariants in 328 ms returned []
[2023-03-21 21:04:30] [INFO ] Invariant cache hit.
[2023-03-21 21:04:31] [INFO ] Implicit Places using invariants and state equation in 576 ms returned []
Implicit Place search using SMT with State Equation took 909 ms to find 0 implicit places.
[2023-03-21 21:04:31] [INFO ] Invariant cache hit.
[2023-03-21 21:04:31] [INFO ] Dead Transitions using invariants and state equation in 132 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 180/182 places, 165/167 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1050 ms. Remains : 180/182 places, 165/167 transitions.
Stuttering acceptance computed with spot in 334 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : ShieldIIPt-PT-003B-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s155 0) (EQ s48 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, 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 1 ms.
FORMULA ShieldIIPt-PT-003B-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-003B-LTLCardinality-02 finished in 1455 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(G(p0))&&F(p1))))'
Support contains 3 out of 182 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 182/182 places, 167/167 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 181 transition count 132
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 147 transition count 132
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 68 place count 147 transition count 110
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 112 place count 125 transition count 110
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 113 place count 124 transition count 109
Iterating global reduction 2 with 1 rules applied. Total rules applied 114 place count 124 transition count 109
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 114 place count 124 transition count 108
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 116 place count 123 transition count 108
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: 52
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 220 place count 71 transition count 56
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 221 place count 71 transition count 55
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 223 place count 70 transition count 54
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 239 place count 62 transition count 58
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 241 place count 60 transition count 56
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 243 place count 58 transition count 56
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 243 place count 58 transition count 55
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 245 place count 57 transition count 55
Applied a total of 245 rules in 76 ms. Remains 57 /182 variables (removed 125) and now considering 55/167 (removed 112) transitions.
// Phase 1: matrix 55 rows 57 cols
[2023-03-21 21:04:32] [INFO ] Computed 26 place invariants in 0 ms
[2023-03-21 21:04:32] [INFO ] Implicit Places using invariants in 69 ms returned [44]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 74 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 56/182 places, 55/167 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 55 transition count 54
Applied a total of 2 rules in 5 ms. Remains 55 /56 variables (removed 1) and now considering 54/55 (removed 1) transitions.
// Phase 1: matrix 54 rows 55 cols
[2023-03-21 21:04:32] [INFO ] Computed 25 place invariants in 0 ms
[2023-03-21 21:04:32] [INFO ] Implicit Places using invariants in 101 ms returned []
[2023-03-21 21:04:32] [INFO ] Invariant cache hit.
[2023-03-21 21:04:32] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 55/182 places, 54/167 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 427 ms. Remains : 55/182 places, 54/167 transitions.
Stuttering acceptance computed with spot in 255 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-003B-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s48 0) (EQ s15 1)), p1:(EQ s51 0)], 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 171 steps with 4 reset in 2 ms.
FORMULA ShieldIIPt-PT-003B-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-003B-LTLCardinality-07 finished in 739 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 2 out of 182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 167/167 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 179 transition count 164
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 179 transition count 164
Applied a total of 6 rules in 5 ms. Remains 179 /182 variables (removed 3) and now considering 164/167 (removed 3) transitions.
// Phase 1: matrix 164 rows 179 cols
[2023-03-21 21:04:32] [INFO ] Computed 28 place invariants in 4 ms
[2023-03-21 21:04:32] [INFO ] Implicit Places using invariants in 87 ms returned []
[2023-03-21 21:04:32] [INFO ] Invariant cache hit.
[2023-03-21 21:04:32] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
[2023-03-21 21:04:32] [INFO ] Invariant cache hit.
[2023-03-21 21:04:33] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 179/182 places, 164/167 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 307 ms. Remains : 179/182 places, 164/167 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-003B-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s172 0) (EQ s39 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]]
Stuttering criterion allowed to conclude after 50532 steps with 28 reset in 173 ms.
FORMULA ShieldIIPt-PT-003B-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-003B-LTLCardinality-08 finished in 612 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 2 out of 182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 167/167 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 178 transition count 163
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 178 transition count 163
Applied a total of 8 rules in 4 ms. Remains 178 /182 variables (removed 4) and now considering 163/167 (removed 4) transitions.
// Phase 1: matrix 163 rows 178 cols
[2023-03-21 21:04:33] [INFO ] Computed 28 place invariants in 1 ms
[2023-03-21 21:04:33] [INFO ] Implicit Places using invariants in 103 ms returned []
[2023-03-21 21:04:33] [INFO ] Invariant cache hit.
[2023-03-21 21:04:33] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
[2023-03-21 21:04:33] [INFO ] Invariant cache hit.
[2023-03-21 21:04:33] [INFO ] Dead Transitions using invariants and state equation in 198 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 178/182 places, 163/167 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 480 ms. Remains : 178/182 places, 163/167 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-003B-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s170 0) (EQ s26 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 324 reset in 270 ms.
Stack based approach found an accepted trace after 574 steps with 2 reset with depth 72 and stack size 72 in 1 ms.
FORMULA ShieldIIPt-PT-003B-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-003B-LTLCardinality-09 finished in 905 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 2 out of 182 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 182/182 places, 167/167 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 181 transition count 132
Reduce places removed 34 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 35 rules applied. Total rules applied 69 place count 147 transition count 131
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 70 place count 146 transition count 131
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 70 place count 146 transition count 108
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 116 place count 123 transition count 108
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 118 place count 121 transition count 106
Iterating global reduction 3 with 2 rules applied. Total rules applied 120 place count 121 transition count 106
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 120 place count 121 transition count 104
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 124 place count 119 transition count 104
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 220 place count 71 transition count 56
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 221 place count 71 transition count 55
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 223 place count 70 transition count 54
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 239 place count 62 transition count 59
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 241 place count 60 transition count 57
Applied a total of 241 rules in 23 ms. Remains 60 /182 variables (removed 122) and now considering 57/167 (removed 110) transitions.
// Phase 1: matrix 57 rows 60 cols
[2023-03-21 21:04:34] [INFO ] Computed 28 place invariants in 0 ms
[2023-03-21 21:04:34] [INFO ] Implicit Places using invariants in 55 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 57 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/182 places, 57/167 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 59 transition count 56
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 58 transition count 56
Applied a total of 2 rules in 3 ms. Remains 58 /59 variables (removed 1) and now considering 56/57 (removed 1) transitions.
// Phase 1: matrix 56 rows 58 cols
[2023-03-21 21:04:34] [INFO ] Computed 27 place invariants in 1 ms
[2023-03-21 21:04:34] [INFO ] Implicit Places using invariants in 57 ms returned [45]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 61 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 57/182 places, 56/167 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 56 transition count 55
Applied a total of 2 rules in 4 ms. Remains 56 /57 variables (removed 1) and now considering 55/56 (removed 1) transitions.
// Phase 1: matrix 55 rows 56 cols
[2023-03-21 21:04:34] [INFO ] Computed 26 place invariants in 1 ms
[2023-03-21 21:04:34] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-21 21:04:34] [INFO ] Invariant cache hit.
[2023-03-21 21:04:34] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-21 21:04:34] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 56/182 places, 55/167 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 348 ms. Remains : 56/182 places, 55/167 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-003B-LTLCardinality-12 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 s12 0) (EQ s49 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 35 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-003B-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-003B-LTLCardinality-12 finished in 477 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)||G((p1 U X(p2)))||G(p3))))'
Support contains 5 out of 182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 167/167 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 178 transition count 163
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 178 transition count 163
Applied a total of 8 rules in 4 ms. Remains 178 /182 variables (removed 4) and now considering 163/167 (removed 4) transitions.
// Phase 1: matrix 163 rows 178 cols
[2023-03-21 21:04:34] [INFO ] Computed 28 place invariants in 1 ms
[2023-03-21 21:04:34] [INFO ] Implicit Places using invariants in 101 ms returned []
[2023-03-21 21:04:34] [INFO ] Invariant cache hit.
[2023-03-21 21:04:35] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
[2023-03-21 21:04:35] [INFO ] Invariant cache hit.
[2023-03-21 21:04:35] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 178/182 places, 163/167 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 431 ms. Remains : 178/182 places, 163/167 transitions.
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Running random walk in product with property : ShieldIIPt-PT-003B-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(AND p0 p3), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p3), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p3)), acceptance={2} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p3)), acceptance={0, 2} source=0 dest: 0}, { cond=(AND p0 p3 (NOT p1)), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p0) p3 (NOT p1)), acceptance={0, 1} source=0 dest: 1}, { cond=(AND p0 (NOT p3) (NOT p1)), acceptance={1, 2} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p3) (NOT p1)), acceptance={0, 1, 2} source=0 dest: 1}, { cond=(AND p0 p3 p1), acceptance={1} source=0 dest: 2}, { cond=(AND (NOT p0) p3 p1), acceptance={0, 1} source=0 dest: 2}, { cond=(AND p0 (NOT p3) p1), acceptance={1, 2} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p3) p1), acceptance={0, 1, 2} source=0 dest: 2}], [{ cond=(AND p0 p3 (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p3 (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={2} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={0, 2} source=1 dest: 0}, { cond=(AND p0 p3 (NOT p1) (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) p3 (NOT p1) (NOT p2)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 (NOT p3) (NOT p1) (NOT p2)), acceptance={1, 2} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), acceptance={0, 1, 2} source=1 dest: 1}, { cond=(AND p0 p3 p1 (NOT p2)), acceptance={1} source=1 dest: 2}, { cond=(AND (NOT p0) p3 p1 (NOT p2)), acceptance={0, 1} source=1 dest: 2}, { cond=(AND p0 (NOT p3) p1 (NOT p2)), acceptance={1, 2} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p3) p1 (NOT p2)), acceptance={0, 1, 2} source=1 dest: 2}], [{ cond=(AND p0 p3 (NOT p1) (NOT p2)), acceptance={1} source=2 dest: 1}, { cond=(AND (NOT p0) p3 (NOT p1) (NOT p2)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p0 (NOT p3) (NOT p1) (NOT p2)), acceptance={1, 2} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), acceptance={0, 1, 2} source=2 dest: 1}, { cond=(AND p0 p3 p1 (NOT p2)), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p0) p3 p1 (NOT p2)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p0 (NOT p3) p1 (NOT p2)), acceptance={1, 2} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p3) p1 (NOT p2)), acceptance={0, 1, 2} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s70 0), p3:(AND (EQ s30 0) (EQ s130 1)), p1:(OR (EQ s37 0) (EQ s55 1)), p2:(OR (EQ s130 0) (EQ s30 1))], nbAcceptance=3, 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 33231 reset in 275 ms.
Product exploration explored 100000 steps with 33211 reset in 300 ms.
Computed a total of 46 stabilizing places and 46 stable transitions
Computed a total of 46 stabilizing places and 46 stable transitions
Detected a total of 46/178 stabilizing places and 46/163 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p3) p1 p2), (X (NOT (AND p0 (NOT p3) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p1)))), (X (NOT (AND p0 p3 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p3 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3) p1))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p3))), (X (NOT (AND p0 p3 p1 (NOT p2)))), (X (NOT (AND p0 p3))), (X (NOT (AND p0 p3 p1))), (X (NOT (AND p0 p3 (NOT p1)))), (X (NOT (AND (NOT p0) p3 (NOT p1)))), (X (NOT (AND (NOT p0) p3 p1))), (X (NOT (AND (NOT p0) p3 p1 (NOT p2)))), (X (AND p0 (NOT p3))), (X (AND p0 (NOT p3) p1)), (X (NOT (AND p0 p3 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (X (NOT (AND p0 (NOT p3) (NOT p1)))), (X (NOT (AND p0 (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) p3 (NOT p2)))), (X (NOT (AND p0 (NOT p3) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3) p1 (NOT p2)))), (X (X (NOT (AND p0 (NOT p3) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1))))), (X (X (NOT (AND p0 p3 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p3 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND p0 p3 p1 (NOT p2))))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND p0 p3 p1)))), (X (X (NOT (AND p0 p3 (NOT p1))))), (X (X (NOT (AND (NOT p0) p3 (NOT p1))))), (X (X (NOT (AND (NOT p0) p3 p1)))), (X (X (NOT (AND (NOT p0) p3 p1 (NOT p2))))), (X (X (AND p0 (NOT p3)))), (X (X (AND p0 (NOT p3) p1))), (X (X (NOT (AND p0 p3 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 (NOT p3) (NOT p1))))), (X (X (NOT (AND p0 (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) p3 (NOT p2))))), (X (X (NOT (AND p0 (NOT p3) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) p1 (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 50 factoid took 4470 ms. Reduced automaton from 3 states, 32 edges and 4 AP (stutter sensitive) to 3 states, 32 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 292 ms. (steps per millisecond=34 ) properties (out of 24) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-21 21:04:41] [INFO ] Invariant cache hit.
[2023-03-21 21:04:41] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-21 21:04:41] [INFO ] [Nat]Absence check using 28 positive place invariants in 5 ms returned sat
[2023-03-21 21:04:41] [INFO ] After 166ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :0
Fused 6 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 6 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p3) p1 p2), (X (NOT (AND p0 (NOT p3) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p1)))), (X (NOT (AND p0 p3 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p3 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3) p1))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p3))), (X (NOT (AND p0 p3 p1 (NOT p2)))), (X (NOT (AND p0 p3))), (X (NOT (AND p0 p3 p1))), (X (NOT (AND p0 p3 (NOT p1)))), (X (NOT (AND (NOT p0) p3 (NOT p1)))), (X (NOT (AND (NOT p0) p3 p1))), (X (NOT (AND (NOT p0) p3 p1 (NOT p2)))), (X (AND p0 (NOT p3))), (X (AND p0 (NOT p3) p1)), (X (NOT (AND p0 p3 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (X (NOT (AND p0 (NOT p3) (NOT p1)))), (X (NOT (AND p0 (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) p3 (NOT p2)))), (X (NOT (AND p0 (NOT p3) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3) p1 (NOT p2)))), (X (X (NOT (AND p0 (NOT p3) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1))))), (X (X (NOT (AND p0 p3 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p3 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND p0 p3 p1 (NOT p2))))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND p0 p3 p1)))), (X (X (NOT (AND p0 p3 (NOT p1))))), (X (X (NOT (AND (NOT p0) p3 (NOT p1))))), (X (X (NOT (AND (NOT p0) p3 p1)))), (X (X (NOT (AND (NOT p0) p3 p1 (NOT p2))))), (X (X (AND p0 (NOT p3)))), (X (X (AND p0 (NOT p3) p1))), (X (X (NOT (AND p0 p3 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 (NOT p3) (NOT p1))))), (X (X (NOT (AND p0 (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) p3 (NOT p2))))), (X (X (NOT (AND p0 (NOT p3) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) p1 (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p3) (NOT p0) p1 (NOT p2)))), (G (NOT (AND (NOT p3) p0 p1 (NOT p2)))), (G (NOT (AND (NOT p3) (NOT p0) (NOT p2)))), (G (NOT (AND (NOT p3) p0 (NOT p2)))), (G (NOT (AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)))), (G (NOT (AND (NOT p3) p0 (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (AND p3 p0 (NOT p1))), (F (AND (NOT p3) (NOT p0))), (F (AND (NOT p3) p0 (NOT p1))), (F (AND p3 (NOT p0) (NOT p1))), (F (AND p3 p0)), (F (NOT (AND (NOT p3) p0))), (F (AND p3 (NOT p0))), (F (AND p3 (NOT p0) p1 (NOT p2))), (F (AND p3 p0 p1 (NOT p2))), (F (AND p3 p0 p1)), (F (AND (NOT p3) (NOT p0) (NOT p1))), (F (AND p3 (NOT p0) p1)), (F (AND p3 (NOT p0) (NOT p2))), (F (AND p3 p0 (NOT p2))), (F (AND p3 (NOT p0) (NOT p1) (NOT p2))), (F (AND p3 p0 (NOT p1) (NOT p2))), (F (AND (NOT p3) (NOT p0) p1)), (F (NOT (AND (NOT p3) p0 p1)))]
Knowledge based reduction with 56 factoid took 5456 ms. Reduced automaton from 3 states, 32 edges and 4 AP (stutter sensitive) to 3 states, 22 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2))]
Support contains 5 out of 178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 163/163 transitions.
Applied a total of 0 rules in 1 ms. Remains 178 /178 variables (removed 0) and now considering 163/163 (removed 0) transitions.
[2023-03-21 21:04:47] [INFO ] Invariant cache hit.
[2023-03-21 21:04:47] [INFO ] Implicit Places using invariants in 235 ms returned []
[2023-03-21 21:04:47] [INFO ] Invariant cache hit.
[2023-03-21 21:04:47] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 506 ms to find 0 implicit places.
[2023-03-21 21:04:47] [INFO ] Invariant cache hit.
[2023-03-21 21:04:48] [INFO ] Dead Transitions using invariants and state equation in 194 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 718 ms. Remains : 178/178 places, 163/163 transitions.
Computed a total of 46 stabilizing places and 46 stable transitions
Computed a total of 46 stabilizing places and 46 stable transitions
Detected a total of 46/178 stabilizing places and 46/163 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p3) p1 p2), (X (NOT (AND p1 (NOT p0) p3))), (X (NOT (AND p1 (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) p3))), (X (NOT (AND p0 p3))), (X (NOT (AND (NOT p1) p0 (NOT p3)))), (X (NOT (AND p1 p0 p3))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3)))), (X (AND p0 (NOT p3))), (X (AND p1 p0 (NOT p3))), (X (NOT (AND (NOT p1) (NOT p0) p3))), (X (NOT (AND (NOT p1) p0 p3))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) p3)))), (X (X (NOT (AND p1 (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (NOT (AND p1 p0 p3)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X (AND p0 (NOT p3)))), (X (X (AND p1 p0 (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p0) p3)))), (X (X (NOT (AND (NOT p1) p0 p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 38 factoid took 2930 ms. Reduced automaton from 3 states, 22 edges and 4 AP (stutter sensitive) to 3 states, 22 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 193 ms :[(AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 18) seen :15
Finished Best-First random walk after 1375 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=458 )
Knowledge obtained : [(AND p0 (NOT p3) p1 p2), (X (NOT (AND p1 (NOT p0) p3))), (X (NOT (AND p1 (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) p3))), (X (NOT (AND p0 p3))), (X (NOT (AND (NOT p1) p0 (NOT p3)))), (X (NOT (AND p1 p0 p3))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3)))), (X (AND p0 (NOT p3))), (X (AND p1 p0 (NOT p3))), (X (NOT (AND (NOT p1) (NOT p0) p3))), (X (NOT (AND (NOT p1) p0 p3))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) p3)))), (X (X (NOT (AND p1 (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (NOT (AND p1 p0 p3)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X (AND p0 (NOT p3)))), (X (X (AND p1 p0 (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p0) p3)))), (X (X (NOT (AND (NOT p1) p0 p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p3 p0 p1)), (F (AND (NOT p3) (NOT p0) (NOT p1))), (F (AND p3 (NOT p0) p1)), (F (AND p3 p0 (NOT p1))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p3) (NOT p0))), (F (AND (NOT p0) (NOT p2))), (F (AND (NOT p3) p0 (NOT p1))), (F (AND p0 (NOT p2))), (F (AND p3 (NOT p0) (NOT p1))), (F (AND p3 p0)), (F (AND (NOT p0) p1 (NOT p2))), (F (NOT (AND (NOT p3) p0))), (F (AND p0 p1 (NOT p2))), (F (AND p3 (NOT p0))), (F (AND (NOT p3) (NOT p0) p1)), (F (NOT (AND (NOT p3) p0 p1)))]
Knowledge based reduction with 38 factoid took 3476 ms. Reduced automaton from 3 states, 22 edges and 4 AP (stutter sensitive) to 3 states, 22 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 227 ms :[(AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 206 ms :[(AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 33308 reset in 240 ms.
Product exploration explored 100000 steps with 33311 reset in 274 ms.
Support contains 5 out of 178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 163/163 transitions.
Applied a total of 0 rules in 1 ms. Remains 178 /178 variables (removed 0) and now considering 163/163 (removed 0) transitions.
[2023-03-21 21:04:56] [INFO ] Invariant cache hit.
[2023-03-21 21:04:56] [INFO ] Implicit Places using invariants in 133 ms returned []
[2023-03-21 21:04:56] [INFO ] Invariant cache hit.
[2023-03-21 21:04:56] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 438 ms to find 0 implicit places.
[2023-03-21 21:04:56] [INFO ] Invariant cache hit.
[2023-03-21 21:04:56] [INFO ] Dead Transitions using invariants and state equation in 193 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 633 ms. Remains : 178/178 places, 163/163 transitions.
Treatment of property ShieldIIPt-PT-003B-LTLCardinality-13 finished in 22151 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)||G((p1 U X(p2)))||G(p3))))'
Found a Lengthening insensitive property : ShieldIIPt-PT-003B-LTLCardinality-13
Stuttering acceptance computed with spot in 260 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Support contains 5 out of 182 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 182/182 places, 167/167 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 181 transition count 133
Reduce places removed 33 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 34 rules applied. Total rules applied 67 place count 148 transition count 132
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 147 transition count 132
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 68 place count 147 transition count 110
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 112 place count 125 transition count 110
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 114 place count 123 transition count 108
Iterating global reduction 3 with 2 rules applied. Total rules applied 116 place count 123 transition count 108
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 116 place count 123 transition count 106
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 120 place count 121 transition count 106
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 208 place count 77 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 209 place count 77 transition count 61
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 211 place count 76 transition count 60
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 227 place count 68 transition count 65
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 229 place count 66 transition count 63
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 231 place count 64 transition count 63
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 231 place count 64 transition count 62
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 233 place count 63 transition count 62
Applied a total of 233 rules in 45 ms. Remains 63 /182 variables (removed 119) and now considering 62/167 (removed 105) transitions.
// Phase 1: matrix 62 rows 63 cols
[2023-03-21 21:04:57] [INFO ] Computed 26 place invariants in 2 ms
[2023-03-21 21:04:57] [INFO ] Implicit Places using invariants in 171 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 172 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 62/182 places, 62/167 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 61 transition count 61
Applied a total of 2 rules in 21 ms. Remains 61 /62 variables (removed 1) and now considering 61/62 (removed 1) transitions.
// Phase 1: matrix 61 rows 61 cols
[2023-03-21 21:04:57] [INFO ] Computed 25 place invariants in 13 ms
[2023-03-21 21:04:57] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-21 21:04:57] [INFO ] Invariant cache hit.
[2023-03-21 21:04:57] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-21 21:04:57] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 61/182 places, 61/167 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 445 ms. Remains : 61/182 places, 61/167 transitions.
Running random walk in product with property : ShieldIIPt-PT-003B-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(AND p0 p3), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p3), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p3)), acceptance={2} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p3)), acceptance={0, 2} source=0 dest: 0}, { cond=(AND p0 p3 (NOT p1)), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p0) p3 (NOT p1)), acceptance={0, 1} source=0 dest: 1}, { cond=(AND p0 (NOT p3) (NOT p1)), acceptance={1, 2} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p3) (NOT p1)), acceptance={0, 1, 2} source=0 dest: 1}, { cond=(AND p0 p3 p1), acceptance={1} source=0 dest: 2}, { cond=(AND (NOT p0) p3 p1), acceptance={0, 1} source=0 dest: 2}, { cond=(AND p0 (NOT p3) p1), acceptance={1, 2} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p3) p1), acceptance={0, 1, 2} source=0 dest: 2}], [{ cond=(AND p0 p3 (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p3 (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={2} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={0, 2} source=1 dest: 0}, { cond=(AND p0 p3 (NOT p1) (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) p3 (NOT p1) (NOT p2)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 (NOT p3) (NOT p1) (NOT p2)), acceptance={1, 2} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), acceptance={0, 1, 2} source=1 dest: 1}, { cond=(AND p0 p3 p1 (NOT p2)), acceptance={1} source=1 dest: 2}, { cond=(AND (NOT p0) p3 p1 (NOT p2)), acceptance={0, 1} source=1 dest: 2}, { cond=(AND p0 (NOT p3) p1 (NOT p2)), acceptance={1, 2} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p3) p1 (NOT p2)), acceptance={0, 1, 2} source=1 dest: 2}], [{ cond=(AND p0 p3 (NOT p1) (NOT p2)), acceptance={1} source=2 dest: 1}, { cond=(AND (NOT p0) p3 (NOT p1) (NOT p2)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p0 (NOT p3) (NOT p1) (NOT p2)), acceptance={1, 2} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), acceptance={0, 1, 2} source=2 dest: 1}, { cond=(AND p0 p3 p1 (NOT p2)), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p0) p3 p1 (NOT p2)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p0 (NOT p3) p1 (NOT p2)), acceptance={1, 2} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p3) p1 (NOT p2)), acceptance={0, 1, 2} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s27 0), p3:(AND (EQ s14 0) (EQ s48 1)), p1:(OR (EQ s17 0) (EQ s23 1)), p2:(OR (EQ s48 0) (EQ s14 1))], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 27304 reset in 332 ms.
Product exploration explored 100000 steps with 27330 reset in 290 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Computed a total of 7 stabilizing places and 7 stable transitions
Detected a total of 7/61 stabilizing places and 7/61 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p3) p1 p2), (X (NOT (AND p0 (NOT p3) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p1)))), (X (NOT (AND p0 p3 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p3 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p3))), (X (NOT (AND p0 p3 (NOT p1)))), (X (NOT (AND (NOT p0) p3 (NOT p1)))), (X (NOT (AND (NOT p0) p3 p1))), (X (NOT (AND (NOT p0) p3 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (X (NOT (AND p0 (NOT p3) (NOT p1)))), (X (NOT (AND p0 (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) p3 (NOT p2)))), (X (NOT (AND p0 (NOT p3) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3) p1 (NOT p2)))), (X (X (NOT (AND p0 (NOT p3) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1))))), (X (X (NOT (AND p0 p3 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p3 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p3 (NOT p1))))), (X (X (NOT (AND (NOT p0) p3 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 (NOT p3) (NOT p1))))), (X (X (NOT (AND p0 (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 (NOT p3) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) p1 (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p3) p1)), (X (NOT (AND (NOT p0) (NOT p3) p1))), (X (AND p0 p3 p1 (NOT p2))), (X (NOT (AND p0 p3 p1 (NOT p2)))), (X (AND p0 p3)), (X (NOT (AND p0 p3))), (X (AND p0 p3 p1)), (X (NOT (AND p0 p3 p1))), (X (AND p0 (NOT p3))), (X (NOT (AND p0 (NOT p3)))), (X (AND p0 (NOT p3) p1)), (X (NOT (AND p0 (NOT p3) p1))), (X (AND p0 p3 (NOT p2))), (X (NOT (AND p0 p3 (NOT p2)))), (X (AND (NOT p0) (NOT p3))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (X (AND (NOT p0) (NOT p3) p1))), (X (X (NOT (AND (NOT p0) (NOT p3) p1)))), (X (X (AND (NOT p0) p3))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (AND p0 p3 p1 (NOT p2)))), (X (X (NOT (AND p0 p3 p1 (NOT p2))))), (X (X (AND p0 p3))), (X (X (NOT (AND p0 p3)))), (X (X (AND p0 p3 p1))), (X (X (NOT (AND p0 p3 p1)))), (X (X (AND (NOT p0) p3 p1))), (X (X (NOT (AND (NOT p0) p3 p1)))), (X (X (AND (NOT p0) p3 p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p3 p1 (NOT p2))))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (AND p0 (NOT p3) p1))), (X (X (NOT (AND p0 (NOT p3) p1)))), (X (X (AND p0 p3 (NOT p2)))), (X (X (NOT (AND p0 p3 (NOT p2))))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (AND (NOT p0) p3 (NOT p2)))), (X (X (NOT (AND (NOT p0) p3 (NOT p2)))))]
Knowledge based reduction with 30 factoid took 3701 ms. Reduced automaton from 3 states, 32 edges and 4 AP (stutter sensitive) to 3 states, 32 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 24) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 9) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-21 21:05:02] [INFO ] Invariant cache hit.
[2023-03-21 21:05:02] [INFO ] After 197ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-21 21:05:03] [INFO ] [Nat]Absence check using 25 positive place invariants in 156 ms returned sat
[2023-03-21 21:05:03] [INFO ] After 271ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :0
Fused 6 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 6 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p3) p1 p2), (X (NOT (AND p0 (NOT p3) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p1)))), (X (NOT (AND p0 p3 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p3 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p3))), (X (NOT (AND p0 p3 (NOT p1)))), (X (NOT (AND (NOT p0) p3 (NOT p1)))), (X (NOT (AND (NOT p0) p3 p1))), (X (NOT (AND (NOT p0) p3 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (X (NOT (AND p0 (NOT p3) (NOT p1)))), (X (NOT (AND p0 (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) p3 (NOT p2)))), (X (NOT (AND p0 (NOT p3) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3) p1 (NOT p2)))), (X (X (NOT (AND p0 (NOT p3) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1))))), (X (X (NOT (AND p0 p3 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p3 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p3 (NOT p1))))), (X (X (NOT (AND (NOT p0) p3 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 (NOT p3) (NOT p1))))), (X (X (NOT (AND p0 (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 (NOT p3) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) p1 (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p3) (NOT p0) p1 (NOT p2)))), (G (NOT (AND (NOT p3) p0 p1 (NOT p2)))), (G (NOT (AND (NOT p3) (NOT p0) (NOT p2)))), (G (NOT (AND (NOT p3) p0 (NOT p2)))), (G (NOT (AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)))), (G (NOT (AND (NOT p3) p0 (NOT p1) (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p3) p1)), (X (NOT (AND (NOT p0) (NOT p3) p1))), (X (AND p0 p3 p1 (NOT p2))), (X (NOT (AND p0 p3 p1 (NOT p2)))), (X (AND p0 p3)), (X (NOT (AND p0 p3))), (X (AND p0 p3 p1)), (X (NOT (AND p0 p3 p1))), (X (AND p0 (NOT p3))), (X (NOT (AND p0 (NOT p3)))), (X (AND p0 (NOT p3) p1)), (X (NOT (AND p0 (NOT p3) p1))), (X (AND p0 p3 (NOT p2))), (X (NOT (AND p0 p3 (NOT p2)))), (X (AND (NOT p0) (NOT p3))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (X (AND (NOT p0) (NOT p3) p1))), (X (X (NOT (AND (NOT p0) (NOT p3) p1)))), (X (X (AND (NOT p0) p3))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (AND p0 p3 p1 (NOT p2)))), (X (X (NOT (AND p0 p3 p1 (NOT p2))))), (X (X (AND p0 p3))), (X (X (NOT (AND p0 p3)))), (X (X (AND p0 p3 p1))), (X (X (NOT (AND p0 p3 p1)))), (X (X (AND (NOT p0) p3 p1))), (X (X (NOT (AND (NOT p0) p3 p1)))), (X (X (AND (NOT p0) p3 p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p3 p1 (NOT p2))))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (AND p0 (NOT p3) p1))), (X (X (NOT (AND p0 (NOT p3) p1)))), (X (X (AND p0 p3 (NOT p2)))), (X (X (NOT (AND p0 p3 (NOT p2))))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (AND (NOT p0) p3 (NOT p2)))), (X (X (NOT (AND (NOT p0) p3 (NOT p2))))), (F (AND p3 p0 (NOT p1))), (F (AND (NOT p3) (NOT p0))), (F (AND (NOT p3) p0 (NOT p1))), (F (AND p3 (NOT p0) (NOT p1))), (F (AND p3 p0)), (F (NOT (AND (NOT p3) p0))), (F (AND p3 (NOT p0))), (F (AND p3 (NOT p0) p1 (NOT p2))), (F (AND p3 p0 p1 (NOT p2))), (F (AND p3 p0 p1)), (F (AND (NOT p3) (NOT p0) (NOT p1))), (F (AND p3 (NOT p0) p1)), (F (AND p3 (NOT p0) (NOT p2))), (F (AND p3 p0 (NOT p2))), (F (AND p3 (NOT p0) (NOT p1) (NOT p2))), (F (AND p3 p0 (NOT p1) (NOT p2))), (F (AND (NOT p3) (NOT p0) p1)), (F (NOT (AND (NOT p3) p0 p1)))]
Knowledge based reduction with 36 factoid took 4442 ms. Reduced automaton from 3 states, 32 edges and 4 AP (stutter sensitive) to 3 states, 22 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2))]
Support contains 5 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 61/61 transitions.
Applied a total of 0 rules in 1 ms. Remains 61 /61 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2023-03-21 21:05:07] [INFO ] Invariant cache hit.
[2023-03-21 21:05:08] [INFO ] Implicit Places using invariants in 226 ms returned []
[2023-03-21 21:05:08] [INFO ] Invariant cache hit.
[2023-03-21 21:05:08] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-21 21:05:08] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
[2023-03-21 21:05:08] [INFO ] Invariant cache hit.
[2023-03-21 21:05:08] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 415 ms. Remains : 61/61 places, 61/61 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Computed a total of 7 stabilizing places and 7 stable transitions
Detected a total of 7/61 stabilizing places and 7/61 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p3) p1 p2), (X (NOT (AND p1 (NOT p0) p3))), (X (NOT (AND (NOT p0) p3))), (X (NOT (AND (NOT p1) p0 (NOT p3)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p0) p3))), (X (NOT (AND (NOT p1) p0 p3))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0) p3)))), (X (X (NOT (AND (NOT p1) p0 p3)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p1 (NOT p0) (NOT p3))), (X (NOT (AND p1 (NOT p0) (NOT p3)))), (X (AND p0 p3)), (X (NOT (AND p0 p3))), (X (AND p1 p0 p3)), (X (NOT (AND p1 p0 p3))), (X (AND p1 p0 (NOT p2))), (X (NOT (AND p1 p0 (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 (NOT p3))), (X (NOT (AND p0 (NOT p3)))), (X (AND p1 p0 (NOT p3))), (X (NOT (AND p1 p0 (NOT p3)))), (X (AND (NOT p0) (NOT p3))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (X (AND p1 (NOT p0) p3))), (X (X (NOT (AND p1 (NOT p0) p3)))), (X (X (AND p1 (NOT p0) (NOT p3)))), (X (X (NOT (AND p1 (NOT p0) (NOT p3))))), (X (X (AND (NOT p0) p3))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (AND p0 p3))), (X (X (NOT (AND p0 p3)))), (X (X (AND p1 p0 p3))), (X (X (NOT (AND p1 p0 p3)))), (X (X (AND p1 p0 (NOT p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (AND p1 p0 (NOT p3)))), (X (X (NOT (AND p1 p0 (NOT p3))))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3)))))]
Knowledge based reduction with 18 factoid took 2398 ms. Reduced automaton from 3 states, 22 edges and 4 AP (stutter sensitive) to 3 states, 22 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 18) seen :16
Finished Best-First random walk after 16 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=16 )
Knowledge obtained : [(AND p0 (NOT p3) p1 p2), (X (NOT (AND p1 (NOT p0) p3))), (X (NOT (AND (NOT p0) p3))), (X (NOT (AND (NOT p1) p0 (NOT p3)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p0) p3))), (X (NOT (AND (NOT p1) p0 p3))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0) p3)))), (X (X (NOT (AND (NOT p1) p0 p3)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p1 (NOT p0) (NOT p3))), (X (NOT (AND p1 (NOT p0) (NOT p3)))), (X (AND p0 p3)), (X (NOT (AND p0 p3))), (X (AND p1 p0 p3)), (X (NOT (AND p1 p0 p3))), (X (AND p1 p0 (NOT p2))), (X (NOT (AND p1 p0 (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 (NOT p3))), (X (NOT (AND p0 (NOT p3)))), (X (AND p1 p0 (NOT p3))), (X (NOT (AND p1 p0 (NOT p3)))), (X (AND (NOT p0) (NOT p3))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (X (AND p1 (NOT p0) p3))), (X (X (NOT (AND p1 (NOT p0) p3)))), (X (X (AND p1 (NOT p0) (NOT p3)))), (X (X (NOT (AND p1 (NOT p0) (NOT p3))))), (X (X (AND (NOT p0) p3))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (AND p0 p3))), (X (X (NOT (AND p0 p3)))), (X (X (AND p1 p0 p3))), (X (X (NOT (AND p1 p0 p3)))), (X (X (AND p1 p0 (NOT p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (AND p1 p0 (NOT p3)))), (X (X (NOT (AND p1 p0 (NOT p3))))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (F (AND p3 p0 p1)), (F (AND (NOT p3) (NOT p0) (NOT p1))), (F (AND p3 (NOT p0) p1)), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p3 p0 (NOT p1))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p3) (NOT p0))), (F (AND (NOT p0) (NOT p2))), (F (AND (NOT p3) p0 (NOT p1))), (F (AND p0 (NOT p2))), (F (AND p3 (NOT p0) (NOT p1))), (F (AND p3 p0)), (F (NOT (AND (NOT p3) p0))), (F (AND (NOT p0) p1 (NOT p2))), (F (AND p0 p1 (NOT p2))), (F (AND p3 (NOT p0))), (F (AND (NOT p3) (NOT p0) p1)), (F (NOT (AND (NOT p3) p0 p1)))]
Knowledge based reduction with 18 factoid took 3272 ms. Reduced automaton from 3 states, 22 edges and 4 AP (stutter sensitive) to 3 states, 22 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 205 ms :[(AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 27316 reset in 232 ms.
Product exploration explored 100000 steps with 27060 reset in 227 ms.
Support contains 5 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 61/61 transitions.
Applied a total of 0 rules in 0 ms. Remains 61 /61 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2023-03-21 21:05:15] [INFO ] Invariant cache hit.
[2023-03-21 21:05:15] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-21 21:05:15] [INFO ] Invariant cache hit.
[2023-03-21 21:05:15] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-21 21:05:15] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
[2023-03-21 21:05:15] [INFO ] Invariant cache hit.
[2023-03-21 21:05:15] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 235 ms. Remains : 61/61 places, 61/61 transitions.
Treatment of property ShieldIIPt-PT-003B-LTLCardinality-13 finished in 18753 ms.
[2023-03-21 21:05:15] [INFO ] Flatten gal took : 9 ms
[2023-03-21 21:05:15] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-21 21:05:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 182 places, 167 transitions and 430 arcs took 1 ms.
Total runtime 47427 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2224/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ShieldIIPt-PT-003B-LTLCardinality-13

BK_STOP 1679432716375

--------------------
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
mcc2023
ltl formula name ShieldIIPt-PT-003B-LTLCardinality-13
ltl formula formula --ltl=/tmp/2224/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 182 places, 167 transitions and 430 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2224/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2224/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2224/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.020 user 0.020 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2224/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 10 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
corrupted size vs. prev_size in fastbins

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="ShieldIIPt-PT-003B"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is ShieldIIPt-PT-003B, 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 r393-oct2-167903716800219"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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