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-167903717200571.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 ShieldPPPt-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-167903717200571
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 412K
-rw-r--r-- 1 mcc users 4.9K Feb 25 21:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 44K Feb 25 21:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 21:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 21:06 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.9K Feb 25 17:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 17:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.5K Feb 25 21:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 25 21:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 25 21:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 25 21:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:00 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 56K 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 ShieldPPPt-PT-003B-LTLCardinality-00
FORMULA_NAME ShieldPPPt-PT-003B-LTLCardinality-01
FORMULA_NAME ShieldPPPt-PT-003B-LTLCardinality-02
FORMULA_NAME ShieldPPPt-PT-003B-LTLCardinality-03
FORMULA_NAME ShieldPPPt-PT-003B-LTLCardinality-04
FORMULA_NAME ShieldPPPt-PT-003B-LTLCardinality-05
FORMULA_NAME ShieldPPPt-PT-003B-LTLCardinality-06
FORMULA_NAME ShieldPPPt-PT-003B-LTLCardinality-07
FORMULA_NAME ShieldPPPt-PT-003B-LTLCardinality-08
FORMULA_NAME ShieldPPPt-PT-003B-LTLCardinality-09
FORMULA_NAME ShieldPPPt-PT-003B-LTLCardinality-10
FORMULA_NAME ShieldPPPt-PT-003B-LTLCardinality-11
FORMULA_NAME ShieldPPPt-PT-003B-LTLCardinality-12
FORMULA_NAME ShieldPPPt-PT-003B-LTLCardinality-13
FORMULA_NAME ShieldPPPt-PT-003B-LTLCardinality-14
FORMULA_NAME ShieldPPPt-PT-003B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679460006623

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=ShieldPPPt-PT-003B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 04:40:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 04:40:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 04:40:10] [INFO ] Load time of PNML (sax parser for PT used): 53 ms
[2023-03-22 04:40:10] [INFO ] Transformed 237 places.
[2023-03-22 04:40:10] [INFO ] Transformed 216 transitions.
[2023-03-22 04:40:10] [INFO ] Found NUPN structural information;
[2023-03-22 04:40:10] [INFO ] Parsed PT model containing 237 places and 216 transitions and 540 arcs in 238 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 3 formulas.
FORMULA ShieldPPPt-PT-003B-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-003B-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-003B-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-003B-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-003B-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-003B-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-003B-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 237 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 216/216 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 215 transition count 194
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 215 transition count 194
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 214 transition count 193
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 214 transition count 193
Applied a total of 46 rules in 69 ms. Remains 214 /237 variables (removed 23) and now considering 193/216 (removed 23) transitions.
// Phase 1: matrix 193 rows 214 cols
[2023-03-22 04:40:10] [INFO ] Computed 34 place invariants in 7 ms
[2023-03-22 04:40:11] [INFO ] Implicit Places using invariants in 913 ms returned []
[2023-03-22 04:40:11] [INFO ] Invariant cache hit.
[2023-03-22 04:40:12] [INFO ] Implicit Places using invariants and state equation in 374 ms returned []
Implicit Place search using SMT with State Equation took 1344 ms to find 0 implicit places.
[2023-03-22 04:40:12] [INFO ] Invariant cache hit.
[2023-03-22 04:40:12] [INFO ] Dead Transitions using invariants and state equation in 476 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 214/237 places, 193/216 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1904 ms. Remains : 214/237 places, 193/216 transitions.
Support contains 32 out of 214 places after structural reductions.
[2023-03-22 04:40:13] [INFO ] Flatten gal took : 68 ms
[2023-03-22 04:40:13] [INFO ] Flatten gal took : 15 ms
[2023-03-22 04:40:13] [INFO ] Input system was already deterministic with 193 transitions.
Support contains 26 out of 214 places (down from 32) after GAL structural reductions.
Finished random walk after 3115 steps, including 0 resets, run visited all 15 properties in 118 ms. (steps per millisecond=26 )
FORMULA ShieldPPPt-PT-003B-LTLCardinality-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 50 stabilizing places and 50 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' '!(G((F((G(F(!p1))||(G(!p2)&&X(!p1))))||p0)))'
Support contains 4 out of 214 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 193/193 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 203 transition count 182
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 203 transition count 182
Applied a total of 22 rules in 8 ms. Remains 203 /214 variables (removed 11) and now considering 182/193 (removed 11) transitions.
// Phase 1: matrix 182 rows 203 cols
[2023-03-22 04:40:13] [INFO ] Computed 34 place invariants in 3 ms
[2023-03-22 04:40:14] [INFO ] Implicit Places using invariants in 318 ms returned []
[2023-03-22 04:40:14] [INFO ] Invariant cache hit.
[2023-03-22 04:40:14] [INFO ] Implicit Places using invariants and state equation in 464 ms returned []
Implicit Place search using SMT with State Equation took 783 ms to find 0 implicit places.
[2023-03-22 04:40:14] [INFO ] Invariant cache hit.
[2023-03-22 04:40:14] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 203/214 places, 182/193 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 890 ms. Remains : 203/214 places, 182/193 transitions.
Stuttering acceptance computed with spot in 575 ms :[(AND (NOT p0) p1), (AND p0 p1), (AND p0 p2 p1), (AND p1 p0 (NOT p2)), p1]
Running random walk in product with property : ShieldPPPt-PT-003B-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 4}], [{ cond=(AND p0 p2), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}], [{ cond=(AND p0 p2), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1 p2), acceptance={} source=2 dest: 4}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s174 0) (EQ s28 1)), p2:(OR (EQ s93 0) (EQ s51 1)), p1:(OR (EQ s174 0) (EQ s28 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 231 reset in 486 ms.
Stack based approach found an accepted trace after 36277 steps with 86 reset with depth 388 and stack size 381 in 204 ms.
FORMULA ShieldPPPt-PT-003B-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-003B-LTLCardinality-02 finished in 2439 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)&&F(G(p1)))))'
Support contains 4 out of 214 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 214/214 places, 193/193 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 213 transition count 147
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 90 place count 168 transition count 147
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 90 place count 168 transition count 129
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 126 place count 150 transition count 129
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 132 place count 144 transition count 123
Iterating global reduction 2 with 6 rules applied. Total rules applied 138 place count 144 transition count 123
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 138 place count 144 transition count 120
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 144 place count 141 transition count 120
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 244 place count 91 transition count 70
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 245 place count 91 transition count 69
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 247 place count 90 transition count 68
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 261 place count 83 transition count 68
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 262 place count 83 transition count 68
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 264 place count 81 transition count 66
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 265 place count 80 transition count 66
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 265 place count 80 transition count 64
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 269 place count 78 transition count 64
Applied a total of 269 rules in 78 ms. Remains 78 /214 variables (removed 136) and now considering 64/193 (removed 129) transitions.
// Phase 1: matrix 64 rows 78 cols
[2023-03-22 04:40:16] [INFO ] Computed 33 place invariants in 0 ms
[2023-03-22 04:40:16] [INFO ] Implicit Places using invariants in 59 ms returned [60, 64]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 63 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 76/214 places, 64/193 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 74 transition count 62
Applied a total of 4 rules in 3 ms. Remains 74 /76 variables (removed 2) and now considering 62/64 (removed 2) transitions.
// Phase 1: matrix 62 rows 74 cols
[2023-03-22 04:40:16] [INFO ] Computed 31 place invariants in 0 ms
[2023-03-22 04:40:16] [INFO ] Implicit Places using invariants in 318 ms returned []
[2023-03-22 04:40:16] [INFO ] Invariant cache hit.
[2023-03-22 04:40:16] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 569 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 74/214 places, 62/193 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 714 ms. Remains : 74/214 places, 62/193 transitions.
Stuttering acceptance computed with spot in 168 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-003B-LTLCardinality-03 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=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s37 0) (EQ s69 1)), p1:(AND (OR (EQ s37 0) (EQ s69 1)) (OR (EQ s50 0) (EQ s20 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1 reset in 283 ms.
Stack based approach found an accepted trace after 211 steps with 0 reset with depth 212 and stack size 209 in 1 ms.
FORMULA ShieldPPPt-PT-003B-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-003B-LTLCardinality-03 finished in 1210 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' '!((!p0 U X((p1&&X(p0)))))'
Support contains 4 out of 214 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 193/193 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 203 transition count 182
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 203 transition count 182
Applied a total of 22 rules in 4 ms. Remains 203 /214 variables (removed 11) and now considering 182/193 (removed 11) transitions.
// Phase 1: matrix 182 rows 203 cols
[2023-03-22 04:40:17] [INFO ] Computed 34 place invariants in 12 ms
[2023-03-22 04:40:17] [INFO ] Implicit Places using invariants in 248 ms returned []
[2023-03-22 04:40:17] [INFO ] Invariant cache hit.
[2023-03-22 04:40:18] [INFO ] Implicit Places using invariants and state equation in 889 ms returned []
Implicit Place search using SMT with State Equation took 1155 ms to find 0 implicit places.
[2023-03-22 04:40:18] [INFO ] Invariant cache hit.
[2023-03-22 04:40:19] [INFO ] Dead Transitions using invariants and state equation in 614 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 203/214 places, 182/193 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1777 ms. Remains : 203/214 places, 182/193 transitions.
Stuttering acceptance computed with spot in 423 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-003B-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 6}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 5}, { cond=(NOT p0), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 0}, { cond=(NOT p1), acceptance={} source=5 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=6 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=6 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=6 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=6 dest: 6}]], initial=3, aps=[p0:(OR (EQ s34 0) (EQ s72 1)), p1:(OR (EQ s46 0) (EQ s201 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 219 ms.
Product exploration explored 100000 steps with 33333 reset in 216 ms.
Computed a total of 47 stabilizing places and 47 stable transitions
Computed a total of 47 stabilizing places and 47 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (AND p0 p1))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (AND p0 p1)))
Knowledge based reduction with 13 factoid took 443 ms. Reduced automaton from 7 states, 14 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-003B-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-003B-LTLCardinality-06 finished in 3141 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(p1)||p0))))'
Support contains 5 out of 214 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 214/214 places, 193/193 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 41 place count 213 transition count 151
Reduce places removed 41 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 42 rules applied. Total rules applied 83 place count 172 transition count 150
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 84 place count 171 transition count 150
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 84 place count 171 transition count 131
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 122 place count 152 transition count 131
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 128 place count 146 transition count 125
Iterating global reduction 3 with 6 rules applied. Total rules applied 134 place count 146 transition count 125
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 134 place count 146 transition count 121
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 142 place count 142 transition count 121
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 240 place count 93 transition count 72
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 241 place count 93 transition count 71
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 4 with 2 rules applied. Total rules applied 243 place count 92 transition count 70
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
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 259 place count 84 transition count 70
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 260 place count 84 transition count 70
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 262 place count 82 transition count 68
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 263 place count 81 transition count 68
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 263 place count 81 transition count 66
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 267 place count 79 transition count 66
Applied a total of 267 rules in 85 ms. Remains 79 /214 variables (removed 135) and now considering 66/193 (removed 127) transitions.
// Phase 1: matrix 66 rows 79 cols
[2023-03-22 04:40:20] [INFO ] Computed 33 place invariants in 0 ms
[2023-03-22 04:40:20] [INFO ] Implicit Places using invariants in 60 ms returned [59, 63]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 77 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 77/214 places, 66/193 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 75 transition count 64
Applied a total of 4 rules in 4 ms. Remains 75 /77 variables (removed 2) and now considering 64/66 (removed 2) transitions.
// Phase 1: matrix 64 rows 75 cols
[2023-03-22 04:40:20] [INFO ] Computed 31 place invariants in 1 ms
[2023-03-22 04:40:20] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-22 04:40:20] [INFO ] Invariant cache hit.
[2023-03-22 04:40:20] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-22 04:40:20] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 75/214 places, 64/193 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 437 ms. Remains : 75/214 places, 64/193 transitions.
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-003B-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s72 1), p0:(OR (EQ s48 0) (EQ s63 1) (EQ s11 0) (EQ s24 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 212 reset in 204 ms.
Product exploration explored 100000 steps with 196 reset in 230 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/75 stabilizing places and 4/64 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 390 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 205 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 04:40:22] [INFO ] Invariant cache hit.
[2023-03-22 04:40:22] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 04:40:22] [INFO ] [Nat]Absence check using 31 positive place invariants in 4 ms returned sat
[2023-03-22 04:40:22] [INFO ] After 24ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 04:40:22] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-22 04:40:22] [INFO ] After 8ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 04:40:22] [INFO ] After 16ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-22 04:40:22] [INFO ] After 138ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 5 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 75 /75 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 75/75 places, 64/64 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1468911 steps, run timeout after 3001 ms. (steps per millisecond=489 ) properties seen :{}
Probabilistic random walk after 1468911 steps, saw 872841 distinct states, run finished after 3014 ms. (steps per millisecond=487 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 04:40:25] [INFO ] Invariant cache hit.
[2023-03-22 04:40:25] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 04:40:25] [INFO ] [Nat]Absence check using 31 positive place invariants in 6 ms returned sat
[2023-03-22 04:40:25] [INFO ] After 38ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 04:40:25] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-22 04:40:25] [INFO ] After 4ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 04:40:25] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-22 04:40:25] [INFO ] After 180ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 64/64 transitions.
Applied a total of 0 rules in 11 ms. Remains 75 /75 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 75/75 places, 64/64 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 75 /75 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2023-03-22 04:40:25] [INFO ] Invariant cache hit.
[2023-03-22 04:40:26] [INFO ] Implicit Places using invariants in 381 ms returned []
[2023-03-22 04:40:26] [INFO ] Invariant cache hit.
[2023-03-22 04:40:26] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-22 04:40:26] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 550 ms to find 0 implicit places.
[2023-03-22 04:40:26] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 04:40:26] [INFO ] Invariant cache hit.
[2023-03-22 04:40:26] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 628 ms. Remains : 75/75 places, 64/64 transitions.
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 75 transition count 64
Applied a total of 12 rules in 3 ms. Remains 75 /75 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 64 rows 75 cols
[2023-03-22 04:40:26] [INFO ] Computed 31 place invariants in 1 ms
[2023-03-22 04:40:26] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 04:40:26] [INFO ] [Nat]Absence check using 31 positive place invariants in 5 ms returned sat
[2023-03-22 04:40:26] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 04:40:26] [INFO ] After 37ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-22 04:40:26] [INFO ] After 141ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 6 factoid took 411 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 75 /75 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 75 cols
[2023-03-22 04:40:27] [INFO ] Computed 31 place invariants in 2 ms
[2023-03-22 04:40:27] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-03-22 04:40:27] [INFO ] Invariant cache hit.
[2023-03-22 04:40:27] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-22 04:40:27] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
[2023-03-22 04:40:27] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 04:40:27] [INFO ] Invariant cache hit.
[2023-03-22 04:40:27] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 317 ms. Remains : 75/75 places, 64/64 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/75 stabilizing places and 4/64 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 432 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 04:40:28] [INFO ] Invariant cache hit.
[2023-03-22 04:40:28] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 04:40:28] [INFO ] [Nat]Absence check using 31 positive place invariants in 18 ms returned sat
[2023-03-22 04:40:28] [INFO ] After 26ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 04:40:28] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-22 04:40:28] [INFO ] After 4ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 04:40:28] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 38 ms.
[2023-03-22 04:40:28] [INFO ] After 219ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 75 /75 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 75/75 places, 64/64 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1536580 steps, run timeout after 3001 ms. (steps per millisecond=512 ) properties seen :{}
Probabilistic random walk after 1536580 steps, saw 912980 distinct states, run finished after 3001 ms. (steps per millisecond=512 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 04:40:31] [INFO ] Invariant cache hit.
[2023-03-22 04:40:31] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 04:40:31] [INFO ] [Nat]Absence check using 31 positive place invariants in 6 ms returned sat
[2023-03-22 04:40:31] [INFO ] After 77ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 04:40:31] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-22 04:40:31] [INFO ] After 5ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 04:40:31] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-22 04:40:31] [INFO ] After 198ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 75 /75 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 75/75 places, 64/64 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 75 /75 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2023-03-22 04:40:31] [INFO ] Invariant cache hit.
[2023-03-22 04:40:31] [INFO ] Implicit Places using invariants in 88 ms returned []
[2023-03-22 04:40:31] [INFO ] Invariant cache hit.
[2023-03-22 04:40:32] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-22 04:40:32] [INFO ] Implicit Places using invariants and state equation in 355 ms returned []
Implicit Place search using SMT with State Equation took 445 ms to find 0 implicit places.
[2023-03-22 04:40:32] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-22 04:40:32] [INFO ] Invariant cache hit.
[2023-03-22 04:40:32] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 600 ms. Remains : 75/75 places, 64/64 transitions.
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 75 transition count 64
Applied a total of 12 rules in 4 ms. Remains 75 /75 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 64 rows 75 cols
[2023-03-22 04:40:32] [INFO ] Computed 31 place invariants in 0 ms
[2023-03-22 04:40:32] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 04:40:32] [INFO ] [Nat]Absence check using 31 positive place invariants in 6 ms returned sat
[2023-03-22 04:40:32] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 04:40:32] [INFO ] After 38ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-22 04:40:32] [INFO ] After 112ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 6 factoid took 399 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 225 reset in 185 ms.
Product exploration explored 100000 steps with 200 reset in 203 ms.
Support contains 5 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 75 /75 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 75 cols
[2023-03-22 04:40:33] [INFO ] Computed 31 place invariants in 1 ms
[2023-03-22 04:40:33] [INFO ] Implicit Places using invariants in 194 ms returned []
[2023-03-22 04:40:33] [INFO ] Invariant cache hit.
[2023-03-22 04:40:34] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-22 04:40:34] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
[2023-03-22 04:40:34] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 04:40:34] [INFO ] Invariant cache hit.
[2023-03-22 04:40:34] [INFO ] Dead Transitions using invariants and state equation in 230 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 574 ms. Remains : 75/75 places, 64/64 transitions.
Treatment of property ShieldPPPt-PT-003B-LTLCardinality-07 finished in 13969 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 214 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 193/193 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 204 transition count 183
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 204 transition count 183
Applied a total of 20 rules in 4 ms. Remains 204 /214 variables (removed 10) and now considering 183/193 (removed 10) transitions.
// Phase 1: matrix 183 rows 204 cols
[2023-03-22 04:40:34] [INFO ] Computed 34 place invariants in 2 ms
[2023-03-22 04:40:34] [INFO ] Implicit Places using invariants in 143 ms returned []
[2023-03-22 04:40:34] [INFO ] Invariant cache hit.
[2023-03-22 04:40:34] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
[2023-03-22 04:40:34] [INFO ] Invariant cache hit.
[2023-03-22 04:40:35] [INFO ] Dead Transitions using invariants and state equation in 329 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 204/214 places, 183/193 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 647 ms. Remains : 204/214 places, 183/193 transitions.
Stuttering acceptance computed with spot in 139 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-003B-LTLCardinality-10 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 s172 0) (EQ s112 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 110 steps with 0 reset in 1 ms.
FORMULA ShieldPPPt-PT-003B-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-003B-LTLCardinality-10 finished in 810 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 214 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 193/193 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 202 transition count 181
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 202 transition count 181
Applied a total of 24 rules in 15 ms. Remains 202 /214 variables (removed 12) and now considering 181/193 (removed 12) transitions.
// Phase 1: matrix 181 rows 202 cols
[2023-03-22 04:40:35] [INFO ] Computed 34 place invariants in 1 ms
[2023-03-22 04:40:35] [INFO ] Implicit Places using invariants in 122 ms returned []
[2023-03-22 04:40:35] [INFO ] Invariant cache hit.
[2023-03-22 04:40:35] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
[2023-03-22 04:40:35] [INFO ] Invariant cache hit.
[2023-03-22 04:40:35] [INFO ] Dead Transitions using invariants and state equation in 208 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 202/214 places, 181/193 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 561 ms. Remains : 202/214 places, 181/193 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-003B-LTLCardinality-11 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 s64 0) (EQ s41 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 203 reset in 197 ms.
Stack based approach found an accepted trace after 649 steps with 2 reset with depth 99 and stack size 99 in 1 ms.
FORMULA ShieldPPPt-PT-003B-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-003B-LTLCardinality-11 finished in 857 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' '!(((p0 U p1) U X(G(p1))))'
Support contains 4 out of 214 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 193/193 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 204 transition count 183
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 204 transition count 183
Applied a total of 20 rules in 6 ms. Remains 204 /214 variables (removed 10) and now considering 183/193 (removed 10) transitions.
// Phase 1: matrix 183 rows 204 cols
[2023-03-22 04:40:36] [INFO ] Computed 34 place invariants in 1 ms
[2023-03-22 04:40:36] [INFO ] Implicit Places using invariants in 108 ms returned []
[2023-03-22 04:40:36] [INFO ] Invariant cache hit.
[2023-03-22 04:40:36] [INFO ] Implicit Places using invariants and state equation in 324 ms returned []
Implicit Place search using SMT with State Equation took 438 ms to find 0 implicit places.
[2023-03-22 04:40:36] [INFO ] Invariant cache hit.
[2023-03-22 04:40:36] [INFO ] Dead Transitions using invariants and state equation in 133 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 204/214 places, 183/193 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 578 ms. Remains : 204/214 places, 183/193 transitions.
Stuttering acceptance computed with spot in 250 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), true]
Running random walk in product with property : ShieldPPPt-PT-003B-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(OR (EQ s198 0) (EQ s180 1)), p0:(OR (EQ s187 0) (EQ s41 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 495 steps with 5 reset in 1 ms.
FORMULA ShieldPPPt-PT-003B-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-003B-LTLCardinality-12 finished in 865 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 214 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 193/193 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 203 transition count 182
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 203 transition count 182
Applied a total of 22 rules in 4 ms. Remains 203 /214 variables (removed 11) and now considering 182/193 (removed 11) transitions.
// Phase 1: matrix 182 rows 203 cols
[2023-03-22 04:40:36] [INFO ] Computed 34 place invariants in 1 ms
[2023-03-22 04:40:37] [INFO ] Implicit Places using invariants in 107 ms returned []
[2023-03-22 04:40:37] [INFO ] Invariant cache hit.
[2023-03-22 04:40:37] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
[2023-03-22 04:40:37] [INFO ] Invariant cache hit.
[2023-03-22 04:40:37] [INFO ] Dead Transitions using invariants and state equation in 261 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 203/214 places, 182/193 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 519 ms. Remains : 203/214 places, 182/193 transitions.
Stuttering acceptance computed with spot in 175 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : ShieldPPPt-PT-003B-LTLCardinality-14 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:(OR (EQ s106 0) (EQ s184 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]]
Product exploration explored 100000 steps with 50000 reset in 111 ms.
Product exploration explored 100000 steps with 50000 reset in 103 ms.
Computed a total of 46 stabilizing places and 46 stable transitions
Computed a total of 46 stabilizing places and 46 stable transitions
Knowledge obtained : [p0, (X p0), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 141 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-003B-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-003B-LTLCardinality-14 finished in 1114 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(p1)||p0))))'
[2023-03-22 04:40:38] [INFO ] Flatten gal took : 9 ms
[2023-03-22 04:40:38] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-22 04:40:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 214 places, 193 transitions and 494 arcs took 2 ms.
Total runtime 28136 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/984/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ShieldPPPt-PT-003B-LTLCardinality-07

BK_STOP 1679460038879

--------------------
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 ShieldPPPt-PT-003B-LTLCardinality-07
ltl formula formula --ltl=/tmp/984/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 214 places, 193 transitions and 494 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.000 user 0.040 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/984/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/984/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/984/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/984/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 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:

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="ShieldPPPt-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 ShieldPPPt-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-167903717200571"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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