About the Execution of 2023-gold for ShieldPPPt-PT-005B
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
1227.592 | 35608.00 | 57414.00 | 563.10 | FFFFFFFTTFFFTFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r373-tall-171683789100377.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is ShieldPPPt-PT-005B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r373-tall-171683789100377
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Apr 11 14:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K Apr 11 14:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 11 14:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 11 14:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 92K May 18 16:43 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-005B-LTLCardinality-00
FORMULA_NAME ShieldPPPt-PT-005B-LTLCardinality-01
FORMULA_NAME ShieldPPPt-PT-005B-LTLCardinality-02
FORMULA_NAME ShieldPPPt-PT-005B-LTLCardinality-03
FORMULA_NAME ShieldPPPt-PT-005B-LTLCardinality-04
FORMULA_NAME ShieldPPPt-PT-005B-LTLCardinality-05
FORMULA_NAME ShieldPPPt-PT-005B-LTLCardinality-06
FORMULA_NAME ShieldPPPt-PT-005B-LTLCardinality-07
FORMULA_NAME ShieldPPPt-PT-005B-LTLCardinality-08
FORMULA_NAME ShieldPPPt-PT-005B-LTLCardinality-09
FORMULA_NAME ShieldPPPt-PT-005B-LTLCardinality-10
FORMULA_NAME ShieldPPPt-PT-005B-LTLCardinality-11
FORMULA_NAME ShieldPPPt-PT-005B-LTLCardinality-12
FORMULA_NAME ShieldPPPt-PT-005B-LTLCardinality-13
FORMULA_NAME ShieldPPPt-PT-005B-LTLCardinality-14
FORMULA_NAME ShieldPPPt-PT-005B-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1716983749169
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=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-005B
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-29 11:55:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 11:55:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 11:55:51] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2024-05-29 11:55:51] [INFO ] Transformed 393 places.
[2024-05-29 11:55:51] [INFO ] Transformed 358 transitions.
[2024-05-29 11:55:51] [INFO ] Found NUPN structural information;
[2024-05-29 11:55:51] [INFO ] Parsed PT model containing 393 places and 358 transitions and 896 arcs in 159 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 4 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA ShieldPPPt-PT-005B-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-005B-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-005B-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-005B-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-005B-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-005B-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 393 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 393/393 places, 358/358 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 343 transition count 308
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 343 transition count 308
Applied a total of 100 rules in 61 ms. Remains 343 /393 variables (removed 50) and now considering 308/358 (removed 50) transitions.
// Phase 1: matrix 308 rows 343 cols
[2024-05-29 11:55:51] [INFO ] Computed 56 invariants in 15 ms
[2024-05-29 11:55:51] [INFO ] Implicit Places using invariants in 300 ms returned []
[2024-05-29 11:55:51] [INFO ] Invariant cache hit.
[2024-05-29 11:55:52] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 607 ms to find 0 implicit places.
[2024-05-29 11:55:52] [INFO ] Invariant cache hit.
[2024-05-29 11:55:52] [INFO ] Dead Transitions using invariants and state equation in 196 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 343/393 places, 308/358 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 866 ms. Remains : 343/393 places, 308/358 transitions.
Support contains 29 out of 343 places after structural reductions.
[2024-05-29 11:55:52] [INFO ] Flatten gal took : 53 ms
[2024-05-29 11:55:52] [INFO ] Flatten gal took : 22 ms
[2024-05-29 11:55:52] [INFO ] Input system was already deterministic with 308 transitions.
Finished random walk after 1161 steps, including 0 resets, run visited all 16 properties in 84 ms. (steps per millisecond=13 )
Parikh walk visited 0 properties in 1 ms.
FORMULA ShieldPPPt-PT-005B-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 81 stabilizing places and 81 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 343 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 343/343 places, 308/308 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 72 place count 342 transition count 235
Reduce places removed 72 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 74 rules applied. Total rules applied 146 place count 270 transition count 233
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 147 place count 269 transition count 233
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 147 place count 269 transition count 198
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 217 place count 234 transition count 198
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 222 place count 229 transition count 193
Iterating global reduction 3 with 5 rules applied. Total rules applied 227 place count 229 transition count 193
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 227 place count 229 transition count 189
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 235 place count 225 transition count 189
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: 81
Deduced a syphon composed of 81 places in 1 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 3 with 162 rules applied. Total rules applied 397 place count 144 transition count 108
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 425 place count 130 transition count 108
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 427 place count 128 transition count 106
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 428 place count 127 transition count 106
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 428 place count 127 transition count 104
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 432 place count 125 transition count 104
Applied a total of 432 rules in 63 ms. Remains 125 /343 variables (removed 218) and now considering 104/308 (removed 204) transitions.
// Phase 1: matrix 104 rows 125 cols
[2024-05-29 11:55:53] [INFO ] Computed 55 invariants in 3 ms
[2024-05-29 11:55:53] [INFO ] Implicit Places using invariants in 83 ms returned [107, 111]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 86 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 123/343 places, 104/308 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 121 transition count 102
Applied a total of 4 rules in 7 ms. Remains 121 /123 variables (removed 2) and now considering 102/104 (removed 2) transitions.
// Phase 1: matrix 102 rows 121 cols
[2024-05-29 11:55:53] [INFO ] Computed 53 invariants in 2 ms
[2024-05-29 11:55:53] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-29 11:55:53] [INFO ] Invariant cache hit.
[2024-05-29 11:55:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-29 11:55:53] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 121/343 places, 102/308 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 339 ms. Remains : 121/343 places, 102/308 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 157 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-005B-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s120 0) (NEQ s49 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 359 ms.
Stack based approach found an accepted trace after 22 steps with 0 reset with depth 23 and stack size 23 in 2 ms.
FORMULA ShieldPPPt-PT-005B-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-005B-LTLCardinality-00 finished in 925 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G((X(p0)&&F(p1)))))))'
Support contains 4 out of 343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 308/308 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 338 transition count 303
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 338 transition count 303
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 337 transition count 302
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 337 transition count 302
Applied a total of 12 rules in 30 ms. Remains 337 /343 variables (removed 6) and now considering 302/308 (removed 6) transitions.
// Phase 1: matrix 302 rows 337 cols
[2024-05-29 11:55:54] [INFO ] Computed 56 invariants in 6 ms
[2024-05-29 11:55:54] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-05-29 11:55:54] [INFO ] Invariant cache hit.
[2024-05-29 11:55:54] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
[2024-05-29 11:55:54] [INFO ] Invariant cache hit.
[2024-05-29 11:55:54] [INFO ] Dead Transitions using invariants and state equation in 154 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 337/343 places, 302/308 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 502 ms. Remains : 337/343 places, 302/308 transitions.
Stuttering acceptance computed with spot in 289 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : ShieldPPPt-PT-005B-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=true, acceptance={} source=3 dest: 4}, { cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(AND (EQ s183 0) (EQ s194 1)), p0:(AND (EQ s328 0) (EQ s57 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA ShieldPPPt-PT-005B-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-005B-LTLCardinality-02 finished in 829 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 4 out of 343 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 343/343 places, 308/308 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 342 transition count 236
Reduce places removed 71 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 73 rules applied. Total rules applied 144 place count 271 transition count 234
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 145 place count 270 transition count 234
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 145 place count 270 transition count 199
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 215 place count 235 transition count 199
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 219 place count 231 transition count 195
Iterating global reduction 3 with 4 rules applied. Total rules applied 223 place count 231 transition count 195
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 223 place count 231 transition count 192
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 229 place count 228 transition count 192
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 1 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 3 with 166 rules applied. Total rules applied 395 place count 145 transition count 109
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 419 place count 133 transition count 109
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 421 place count 131 transition count 107
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 422 place count 130 transition count 107
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 422 place count 130 transition count 105
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 426 place count 128 transition count 105
Applied a total of 426 rules in 51 ms. Remains 128 /343 variables (removed 215) and now considering 105/308 (removed 203) transitions.
// Phase 1: matrix 105 rows 128 cols
[2024-05-29 11:55:54] [INFO ] Computed 55 invariants in 2 ms
[2024-05-29 11:55:54] [INFO ] Implicit Places using invariants in 77 ms returned [111, 115]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 89 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 126/343 places, 105/308 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 124 transition count 103
Applied a total of 4 rules in 13 ms. Remains 124 /126 variables (removed 2) and now considering 103/105 (removed 2) transitions.
// Phase 1: matrix 103 rows 124 cols
[2024-05-29 11:55:55] [INFO ] Computed 53 invariants in 1 ms
[2024-05-29 11:55:55] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-29 11:55:55] [INFO ] Invariant cache hit.
[2024-05-29 11:55:55] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 124/343 places, 103/308 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 351 ms. Remains : 124/343 places, 103/308 transitions.
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-005B-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s23 0) (EQ s21 1)), p1:(OR (EQ s80 0) (EQ s24 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1 reset in 330 ms.
Stack based approach found an accepted trace after 723 steps with 0 reset with depth 724 and stack size 722 in 3 ms.
FORMULA ShieldPPPt-PT-005B-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-005B-LTLCardinality-04 finished in 738 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U !p1))'
Support contains 4 out of 343 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 343/343 places, 308/308 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 69 rules applied. Total rules applied 69 place count 342 transition count 238
Reduce places removed 69 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 71 rules applied. Total rules applied 140 place count 273 transition count 236
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 143 place count 271 transition count 235
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 37 Pre rules applied. Total rules applied 143 place count 271 transition count 198
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 217 place count 234 transition count 198
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 221 place count 230 transition count 194
Iterating global reduction 3 with 4 rules applied. Total rules applied 225 place count 230 transition count 194
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 225 place count 230 transition count 191
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 231 place count 227 transition count 191
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 391 place count 147 transition count 111
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 417 place count 134 transition count 111
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 419 place count 132 transition count 109
Applied a total of 419 rules in 39 ms. Remains 132 /343 variables (removed 211) and now considering 109/308 (removed 199) transitions.
// Phase 1: matrix 109 rows 132 cols
[2024-05-29 11:55:55] [INFO ] Computed 56 invariants in 1 ms
[2024-05-29 11:55:55] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-29 11:55:55] [INFO ] Invariant cache hit.
[2024-05-29 11:55:55] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 11:55:55] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
[2024-05-29 11:55:55] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-29 11:55:55] [INFO ] Invariant cache hit.
[2024-05-29 11:55:55] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 132/343 places, 109/308 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 333 ms. Remains : 132/343 places, 109/308 transitions.
Stuttering acceptance computed with spot in 87 ms :[p1, true, (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-005B-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s82 0) (EQ s125 1)), p0:(OR (EQ s70 0) (EQ s78 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-005B-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-005B-LTLCardinality-05 finished in 443 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0)) U G((F(p1)||X((p2 U p3))))))'
Support contains 7 out of 343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 308/308 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 337 transition count 302
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 337 transition count 302
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 336 transition count 301
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 336 transition count 301
Applied a total of 14 rules in 21 ms. Remains 336 /343 variables (removed 7) and now considering 301/308 (removed 7) transitions.
// Phase 1: matrix 301 rows 336 cols
[2024-05-29 11:55:56] [INFO ] Computed 56 invariants in 4 ms
[2024-05-29 11:55:56] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-29 11:55:56] [INFO ] Invariant cache hit.
[2024-05-29 11:55:56] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
[2024-05-29 11:55:56] [INFO ] Invariant cache hit.
[2024-05-29 11:55:56] [INFO ] Dead Transitions using invariants and state equation in 161 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 336/343 places, 301/308 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 536 ms. Remains : 336/343 places, 301/308 transitions.
Stuttering acceptance computed with spot in 582 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)), (AND p0 (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p2) p0)]
Running random walk in product with property : ShieldPPPt-PT-005B-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={} source=2 dest: 4}, { cond=true, acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=4 dest: 7}, { cond=(AND (NOT p1) (NOT p3) p2 (NOT p0)), acceptance={} source=4 dest: 8}], [{ cond=(AND (NOT p1) p3), acceptance={0} source=5 dest: 1}, { cond=(OR (AND (NOT p1) p3) (AND (NOT p1) (NOT p2))), acceptance={} source=5 dest: 4}, { cond=(OR (AND (NOT p1) p3) (AND (NOT p1) p2)), acceptance={} source=5 dest: 5}, { cond=(NOT p1), acceptance={} source=5 dest: 9}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 8}, { cond=(NOT p0), acceptance={} source=6 dest: 10}], [{ cond=(NOT p1), acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={0} source=8 dest: 8}], [{ cond=(OR (AND (NOT p1) p3 (NOT p0)) (AND (NOT p1) (NOT p2) (NOT p0))), acceptance={} source=9 dest: 8}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=9 dest: 11}], [{ cond=(AND (NOT p1) p0), acceptance={} source=10 dest: 8}, { cond=p0, acceptance={} source=10 dest: 10}], [{ cond=(OR (AND (NOT p1) p3 p0) (AND (NOT p1) (NOT p2) p0)), acceptance={} source=11 dest: 8}, { cond=(AND (NOT p1) p0), acceptance={} source=11 dest: 11}]], initial=0, aps=[p1:(EQ s148 1), p3:(OR (EQ s141 0) (EQ s91 1)), p2:(OR (EQ s165 0) (EQ s168 1)), p0:(OR (EQ s51 0) (EQ s334 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33204 reset in 309 ms.
Product exploration explored 100000 steps with 33310 reset in 263 ms.
Computed a total of 78 stabilizing places and 78 stable transitions
Computed a total of 78 stabilizing places and 78 stable transitions
Knowledge obtained : [(AND (NOT p1) p3 p2 p0), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p3) p2))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p3) p2 (NOT p0))))), (X (X (OR (AND (NOT p1) p3) (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) p3))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (OR (AND (NOT p1) p3) (AND (NOT p1) p2)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 314 ms. Reduced automaton from 12 states, 27 edges and 4 AP (stutter sensitive) to 12 states, 27 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 550 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)), (AND p0 (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p2) p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 14) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-29 11:55:58] [INFO ] Invariant cache hit.
[2024-05-29 11:55:59] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 11:55:59] [INFO ] [Nat]Absence check using 56 positive place invariants in 11 ms returned sat
[2024-05-29 11:55:59] [INFO ] After 111ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :1
[2024-05-29 11:55:59] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 4 ms to minimize.
[2024-05-29 11:55:59] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 1 ms to minimize.
[2024-05-29 11:55:59] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2024-05-29 11:55:59] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-05-29 11:55:59] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-29 11:55:59] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-29 11:55:59] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 0 ms to minimize.
[2024-05-29 11:55:59] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-29 11:55:59] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-29 11:55:59] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 636 ms
[2024-05-29 11:55:59] [INFO ] After 767ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2024-05-29 11:55:59] [INFO ] After 882ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :1
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 7 ms.
Support contains 7 out of 336 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 336/336 places, 301/301 transitions.
Drop transitions removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 336 transition count 236
Reduce places removed 65 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 66 rules applied. Total rules applied 131 place count 271 transition count 235
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 132 place count 270 transition count 235
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 132 place count 270 transition count 195
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 212 place count 230 transition count 195
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: 81
Deduced a syphon composed of 81 places in 0 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 3 with 162 rules applied. Total rules applied 374 place count 149 transition count 114
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 375 place count 149 transition count 113
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 377 place count 148 transition count 112
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 403 place count 135 transition count 112
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 415 place count 135 transition count 112
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 416 place count 134 transition count 111
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 417 place count 133 transition count 111
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 417 place count 133 transition count 109
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 421 place count 131 transition count 109
Applied a total of 421 rules in 47 ms. Remains 131 /336 variables (removed 205) and now considering 109/301 (removed 192) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 131/336 places, 109/301 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1245877 steps, run timeout after 3001 ms. (steps per millisecond=415 ) properties seen :{}
Probabilistic random walk after 1245877 steps, saw 621117 distinct states, run finished after 3003 ms. (steps per millisecond=414 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 109 rows 131 cols
[2024-05-29 11:56:03] [INFO ] Computed 55 invariants in 4 ms
[2024-05-29 11:56:03] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 11:56:03] [INFO ] [Nat]Absence check using 55 positive place invariants in 7 ms returned sat
[2024-05-29 11:56:03] [INFO ] After 38ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 11:56:03] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-29 11:56:03] [INFO ] After 16ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 11:56:03] [INFO ] After 27ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2024-05-29 11:56:03] [INFO ] After 110ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 7 out of 131 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 131/131 places, 109/109 transitions.
Applied a total of 0 rules in 4 ms. Remains 131 /131 variables (removed 0) and now considering 109/109 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 131/131 places, 109/109 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 131/131 places, 109/109 transitions.
Applied a total of 0 rules in 3 ms. Remains 131 /131 variables (removed 0) and now considering 109/109 (removed 0) transitions.
[2024-05-29 11:56:03] [INFO ] Invariant cache hit.
[2024-05-29 11:56:03] [INFO ] Implicit Places using invariants in 81 ms returned [112, 116]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 83 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 129/131 places, 109/109 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 127 transition count 107
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 127 transition count 107
Applied a total of 4 rules in 6 ms. Remains 127 /129 variables (removed 2) and now considering 107/109 (removed 2) transitions.
// Phase 1: matrix 107 rows 127 cols
[2024-05-29 11:56:03] [INFO ] Computed 53 invariants in 1 ms
[2024-05-29 11:56:03] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-29 11:56:03] [INFO ] Invariant cache hit.
[2024-05-29 11:56:03] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-29 11:56:03] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 127/131 places, 107/109 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 314 ms. Remains : 127/131 places, 107/109 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 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1246662 steps, run timeout after 3001 ms. (steps per millisecond=415 ) properties seen :{}
Probabilistic random walk after 1246662 steps, saw 628232 distinct states, run finished after 3006 ms. (steps per millisecond=414 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 11:56:06] [INFO ] Invariant cache hit.
[2024-05-29 11:56:06] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 11:56:06] [INFO ] [Nat]Absence check using 53 positive place invariants in 7 ms returned sat
[2024-05-29 11:56:06] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 11:56:06] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-29 11:56:06] [INFO ] After 7ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 11:56:06] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2024-05-29 11:56:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2024-05-29 11:56:06] [INFO ] After 70ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2024-05-29 11:56:06] [INFO ] After 170ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 7 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 107/107 transitions.
Applied a total of 0 rules in 5 ms. Remains 127 /127 variables (removed 0) and now considering 107/107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 127/127 places, 107/107 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 107/107 transitions.
Applied a total of 0 rules in 3 ms. Remains 127 /127 variables (removed 0) and now considering 107/107 (removed 0) transitions.
[2024-05-29 11:56:06] [INFO ] Invariant cache hit.
[2024-05-29 11:56:06] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-29 11:56:06] [INFO ] Invariant cache hit.
[2024-05-29 11:56:06] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-29 11:56:07] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
[2024-05-29 11:56:07] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-29 11:56:07] [INFO ] Invariant cache hit.
[2024-05-29 11:56:07] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 295 ms. Remains : 127/127 places, 107/107 transitions.
Partial Free-agglomeration rule applied 24 times.
Drop transitions removed 24 transitions
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 127 transition count 107
Applied a total of 24 rules in 5 ms. Remains 127 /127 variables (removed 0) and now considering 107/107 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 107 rows 127 cols
[2024-05-29 11:56:07] [INFO ] Computed 53 invariants in 1 ms
[2024-05-29 11:56:07] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 11:56:07] [INFO ] [Nat]Absence check using 53 positive place invariants in 6 ms returned sat
[2024-05-29 11:56:07] [INFO ] After 39ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 11:56:07] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-29 11:56:07] [INFO ] After 11ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 11:56:07] [INFO ] After 23ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2024-05-29 11:56:07] [INFO ] After 127ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p3 p2 p0), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p3) p2))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p3) p2 (NOT p0))))), (X (X (OR (AND (NOT p1) p3) (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) p3))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (OR (AND (NOT p1) p3) (AND (NOT p1) p2)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (G (NOT (AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)))), (G (NOT (AND (NOT p1) (NOT p2) (NOT p3))))]
False Knowledge obtained : [(F (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) p3)))), (F (NOT (AND (NOT p1) p3))), (F (NOT (OR (AND (NOT p1) p2) (AND (NOT p1) p3)))), (F (AND (NOT p1) (NOT p0))), (F (AND (NOT p1) p2 (NOT p3))), (F (NOT (OR (AND (NOT p1) (NOT p2) p0) (AND (NOT p1) p3 p0)))), (F (NOT (AND (NOT p1) p0))), (F p1), (F (AND (NOT p1) (NOT p3))), (F (OR (AND (NOT p1) (NOT p2) (NOT p0)) (AND (NOT p1) p3 (NOT p0)))), (F (NOT p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 18 factoid took 444 ms. Reduced automaton from 12 states, 27 edges and 4 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Support contains 3 out of 336 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 336/336 places, 301/301 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 335 transition count 235
Reduce places removed 65 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 66 rules applied. Total rules applied 131 place count 270 transition count 234
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 132 place count 269 transition count 234
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 132 place count 269 transition count 194
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 212 place count 229 transition count 194
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 0 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 3 with 158 rules applied. Total rules applied 370 place count 150 transition count 115
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 371 place count 150 transition count 114
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 373 place count 149 transition count 113
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 399 place count 136 transition count 113
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 401 place count 134 transition count 111
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 402 place count 133 transition count 111
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 402 place count 133 transition count 109
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 406 place count 131 transition count 109
Applied a total of 406 rules in 39 ms. Remains 131 /336 variables (removed 205) and now considering 109/301 (removed 192) transitions.
// Phase 1: matrix 109 rows 131 cols
[2024-05-29 11:56:07] [INFO ] Computed 55 invariants in 1 ms
[2024-05-29 11:56:08] [INFO ] Implicit Places using invariants in 80 ms returned [112, 116]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 81 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 129/336 places, 109/301 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 127 transition count 107
Applied a total of 4 rules in 4 ms. Remains 127 /129 variables (removed 2) and now considering 107/109 (removed 2) transitions.
// Phase 1: matrix 107 rows 127 cols
[2024-05-29 11:56:08] [INFO ] Computed 53 invariants in 1 ms
[2024-05-29 11:56:08] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-29 11:56:08] [INFO ] Invariant cache hit.
[2024-05-29 11:56:08] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-29 11:56:08] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 127/336 places, 107/301 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 317 ms. Remains : 127/336 places, 107/301 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND (NOT p1) p3)]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p3))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3)))))]
Knowledge based reduction with 1 factoid took 157 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p3)]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p3))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (F (AND (NOT p1) (NOT p3)))]
Knowledge based reduction with 1 factoid took 230 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Product exploration explored 100000 steps with 3 reset in 239 ms.
Product exploration explored 100000 steps with 2 reset in 283 ms.
Built C files in :
/tmp/ltsmin1108131388330563050
[2024-05-29 11:56:09] [INFO ] Computing symmetric may disable matrix : 107 transitions.
[2024-05-29 11:56:09] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 11:56:09] [INFO ] Computing symmetric may enable matrix : 107 transitions.
[2024-05-29 11:56:09] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 11:56:09] [INFO ] Computing Do-Not-Accords matrix : 107 transitions.
[2024-05-29 11:56:09] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 11:56:09] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1108131388330563050
Running compilation step : cd /tmp/ltsmin1108131388330563050;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 367 ms.
Running link step : cd /tmp/ltsmin1108131388330563050;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin1108131388330563050;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12153047744349726021.hoa' '--buchi-type=spotba'
LTSmin run took 165 ms.
FORMULA ShieldPPPt-PT-005B-LTLCardinality-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPt-PT-005B-LTLCardinality-10 finished in 14155 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 308/308 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 338 transition count 303
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 338 transition count 303
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 337 transition count 302
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 337 transition count 302
Applied a total of 12 rules in 16 ms. Remains 337 /343 variables (removed 6) and now considering 302/308 (removed 6) transitions.
// Phase 1: matrix 302 rows 337 cols
[2024-05-29 11:56:10] [INFO ] Computed 56 invariants in 2 ms
[2024-05-29 11:56:10] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-05-29 11:56:10] [INFO ] Invariant cache hit.
[2024-05-29 11:56:10] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
[2024-05-29 11:56:10] [INFO ] Invariant cache hit.
[2024-05-29 11:56:10] [INFO ] Dead Transitions using invariants and state equation in 163 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 337/343 places, 302/308 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 504 ms. Remains : 337/343 places, 302/308 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : ShieldPPPt-PT-005B-LTLCardinality-11 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 s139 0) (EQ s170 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 ShieldPPPt-PT-005B-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-005B-LTLCardinality-11 finished in 604 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 308/308 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 337 transition count 302
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 337 transition count 302
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 336 transition count 301
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 336 transition count 301
Applied a total of 14 rules in 12 ms. Remains 336 /343 variables (removed 7) and now considering 301/308 (removed 7) transitions.
// Phase 1: matrix 301 rows 336 cols
[2024-05-29 11:56:10] [INFO ] Computed 56 invariants in 2 ms
[2024-05-29 11:56:10] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-29 11:56:10] [INFO ] Invariant cache hit.
[2024-05-29 11:56:11] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 365 ms to find 0 implicit places.
[2024-05-29 11:56:11] [INFO ] Invariant cache hit.
[2024-05-29 11:56:11] [INFO ] Dead Transitions using invariants and state equation in 158 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 336/343 places, 301/308 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 536 ms. Remains : 336/343 places, 301/308 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-005B-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s136 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 50000 reset in 239 ms.
Product exploration explored 100000 steps with 50000 reset in 246 ms.
Computed a total of 78 stabilizing places and 78 stable transitions
Computed a total of 78 stabilizing places and 78 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 19 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-005B-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-005B-LTLCardinality-12 finished in 1145 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 308/308 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 337 transition count 302
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 337 transition count 302
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 336 transition count 301
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 336 transition count 301
Applied a total of 14 rules in 14 ms. Remains 336 /343 variables (removed 7) and now considering 301/308 (removed 7) transitions.
[2024-05-29 11:56:11] [INFO ] Invariant cache hit.
[2024-05-29 11:56:12] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-05-29 11:56:12] [INFO ] Invariant cache hit.
[2024-05-29 11:56:12] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
[2024-05-29 11:56:12] [INFO ] Invariant cache hit.
[2024-05-29 11:56:12] [INFO ] Dead Transitions using invariants and state equation in 156 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 336/343 places, 301/308 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 533 ms. Remains : 336/343 places, 301/308 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-005B-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(EQ s148 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1128 reset in 169 ms.
Product exploration explored 100000 steps with 1139 reset in 180 ms.
Computed a total of 78 stabilizing places and 78 stable transitions
Computed a total of 78 stabilizing places and 78 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 75 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 60 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=60 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 222 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-29 11:56:13] [INFO ] Invariant cache hit.
[2024-05-29 11:56:13] [INFO ] [Real]Absence check using 56 positive place invariants in 17 ms returned sat
[2024-05-29 11:56:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 11:56:14] [INFO ] [Real]Absence check using state equation in 313 ms returned sat
[2024-05-29 11:56:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 11:56:14] [INFO ] [Nat]Absence check using 56 positive place invariants in 17 ms returned sat
[2024-05-29 11:56:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 11:56:14] [INFO ] [Nat]Absence check using state equation in 255 ms returned sat
[2024-05-29 11:56:14] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-05-29 11:56:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2024-05-29 11:56:14] [INFO ] Computed and/alt/rep : 300/446/300 causal constraints (skipped 0 transitions) in 17 ms.
[2024-05-29 11:56:16] [INFO ] Added : 300 causal constraints over 61 iterations in 1986 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 336 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 336/336 places, 301/301 transitions.
Applied a total of 0 rules in 5 ms. Remains 336 /336 variables (removed 0) and now considering 301/301 (removed 0) transitions.
[2024-05-29 11:56:16] [INFO ] Invariant cache hit.
[2024-05-29 11:56:16] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-29 11:56:16] [INFO ] Invariant cache hit.
[2024-05-29 11:56:16] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
[2024-05-29 11:56:16] [INFO ] Invariant cache hit.
[2024-05-29 11:56:16] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 483 ms. Remains : 336/336 places, 301/301 transitions.
Computed a total of 78 stabilizing places and 78 stable transitions
Computed a total of 78 stabilizing places and 78 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 73 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 88 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=88 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 101 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-29 11:56:17] [INFO ] Invariant cache hit.
[2024-05-29 11:56:17] [INFO ] [Real]Absence check using 56 positive place invariants in 17 ms returned sat
[2024-05-29 11:56:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 11:56:18] [INFO ] [Real]Absence check using state equation in 332 ms returned sat
[2024-05-29 11:56:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 11:56:18] [INFO ] [Nat]Absence check using 56 positive place invariants in 17 ms returned sat
[2024-05-29 11:56:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 11:56:18] [INFO ] [Nat]Absence check using state equation in 271 ms returned sat
[2024-05-29 11:56:18] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 2 ms to minimize.
[2024-05-29 11:56:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2024-05-29 11:56:18] [INFO ] Computed and/alt/rep : 300/446/300 causal constraints (skipped 0 transitions) in 19 ms.
[2024-05-29 11:56:20] [INFO ] Added : 300 causal constraints over 61 iterations in 1881 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1132 reset in 171 ms.
Product exploration explored 100000 steps with 1122 reset in 179 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 336 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 336/336 places, 301/301 transitions.
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 336 transition count 301
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 25 Pre rules applied. Total rules applied 70 place count 336 transition count 321
Deduced a syphon composed of 95 places in 0 ms
Iterating global reduction 1 with 25 rules applied. Total rules applied 95 place count 336 transition count 321
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 188 places in 1 ms
Iterating global reduction 1 with 93 rules applied. Total rules applied 188 place count 336 transition count 321
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 189 place count 336 transition count 320
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 226 place count 299 transition count 283
Deduced a syphon composed of 151 places in 0 ms
Iterating global reduction 2 with 37 rules applied. Total rules applied 263 place count 299 transition count 283
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 152 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 264 place count 299 transition count 283
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 266 place count 297 transition count 281
Deduced a syphon composed of 150 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 268 place count 297 transition count 281
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: -80
Deduced a syphon composed of 169 places in 0 ms
Iterating global reduction 2 with 19 rules applied. Total rules applied 287 place count 297 transition count 361
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 306 place count 278 transition count 323
Deduced a syphon composed of 150 places in 0 ms
Iterating global reduction 2 with 19 rules applied. Total rules applied 325 place count 278 transition count 323
Deduced a syphon composed of 150 places in 1 ms
Applied a total of 325 rules in 68 ms. Remains 278 /336 variables (removed 58) and now considering 323/301 (removed -22) transitions.
[2024-05-29 11:56:21] [INFO ] Redundant transitions in 16 ms returned []
// Phase 1: matrix 323 rows 278 cols
[2024-05-29 11:56:21] [INFO ] Computed 56 invariants in 5 ms
[2024-05-29 11:56:21] [INFO ] Dead Transitions using invariants and state equation in 174 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 278/336 places, 323/301 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 268 ms. Remains : 278/336 places, 323/301 transitions.
Built C files in :
/tmp/ltsmin6854395885796309604
[2024-05-29 11:56:21] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6854395885796309604
Running compilation step : cd /tmp/ltsmin6854395885796309604;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 409 ms.
Running link step : cd /tmp/ltsmin6854395885796309604;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin6854395885796309604;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15752488751007919119.hoa' '--buchi-type=spotba'
LTSmin run took 893 ms.
FORMULA ShieldPPPt-PT-005B-LTLCardinality-13 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPt-PT-005B-LTLCardinality-13 finished in 10860 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
Support contains 1 out of 343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 308/308 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 337 transition count 302
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 337 transition count 302
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 336 transition count 301
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 336 transition count 301
Applied a total of 14 rules in 24 ms. Remains 336 /343 variables (removed 7) and now considering 301/308 (removed 7) transitions.
// Phase 1: matrix 301 rows 336 cols
[2024-05-29 11:56:22] [INFO ] Computed 56 invariants in 2 ms
[2024-05-29 11:56:22] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-05-29 11:56:22] [INFO ] Invariant cache hit.
[2024-05-29 11:56:23] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
[2024-05-29 11:56:23] [INFO ] Invariant cache hit.
[2024-05-29 11:56:23] [INFO ] Dead Transitions using invariants and state equation in 155 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 336/343 places, 301/308 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 531 ms. Remains : 336/343 places, 301/308 transitions.
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-005B-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}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=3, aps=[p0:(EQ s112 0)], 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, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 191 ms.
Product exploration explored 100000 steps with 33333 reset in 191 ms.
Computed a total of 78 stabilizing places and 78 stable transitions
Computed a total of 78 stabilizing places and 78 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 14 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-005B-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-005B-LTLCardinality-14 finished in 1059 ms.
All properties solved by simple procedures.
Total runtime 32671 ms.
BK_STOP 1716983784777
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPt-PT-005B"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is ShieldPPPt-PT-005B, 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 r373-tall-171683789100377"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-005B.tgz
mv ShieldPPPt-PT-005B 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 '
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 ;