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-167903717000395.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 ShieldPPPs-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-167903717000395
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 7.1K Feb 26 02:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 26 02:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 26 02:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 02:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 26 02:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 26 02:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 02:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Feb 26 02:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:58 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 52K 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 ShieldPPPs-PT-003B-LTLCardinality-00
FORMULA_NAME ShieldPPPs-PT-003B-LTLCardinality-01
FORMULA_NAME ShieldPPPs-PT-003B-LTLCardinality-02
FORMULA_NAME ShieldPPPs-PT-003B-LTLCardinality-03
FORMULA_NAME ShieldPPPs-PT-003B-LTLCardinality-04
FORMULA_NAME ShieldPPPs-PT-003B-LTLCardinality-05
FORMULA_NAME ShieldPPPs-PT-003B-LTLCardinality-06
FORMULA_NAME ShieldPPPs-PT-003B-LTLCardinality-07
FORMULA_NAME ShieldPPPs-PT-003B-LTLCardinality-08
FORMULA_NAME ShieldPPPs-PT-003B-LTLCardinality-09
FORMULA_NAME ShieldPPPs-PT-003B-LTLCardinality-10
FORMULA_NAME ShieldPPPs-PT-003B-LTLCardinality-11
FORMULA_NAME ShieldPPPs-PT-003B-LTLCardinality-12
FORMULA_NAME ShieldPPPs-PT-003B-LTLCardinality-13
FORMULA_NAME ShieldPPPs-PT-003B-LTLCardinality-14
FORMULA_NAME ShieldPPPs-PT-003B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679444381011

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=ShieldPPPs-PT-003B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 00:19:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 00:19:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 00:19:44] [INFO ] Load time of PNML (sax parser for PT used): 80 ms
[2023-03-22 00:19:44] [INFO ] Transformed 207 places.
[2023-03-22 00:19:44] [INFO ] Transformed 192 transitions.
[2023-03-22 00:19:44] [INFO ] Found NUPN structural information;
[2023-03-22 00:19:44] [INFO ] Parsed PT model containing 207 places and 192 transitions and 528 arcs in 195 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 ShieldPPPs-PT-003B-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-003B-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-003B-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-003B-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-003B-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-003B-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-003B-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 207 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 207/207 places, 192/192 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 195 transition count 180
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 195 transition count 180
Applied a total of 24 rules in 40 ms. Remains 195 /207 variables (removed 12) and now considering 180/192 (removed 12) transitions.
// Phase 1: matrix 180 rows 195 cols
[2023-03-22 00:19:44] [INFO ] Computed 34 place invariants in 17 ms
[2023-03-22 00:19:45] [INFO ] Implicit Places using invariants in 494 ms returned []
[2023-03-22 00:19:45] [INFO ] Invariant cache hit.
[2023-03-22 00:19:45] [INFO ] Implicit Places using invariants and state equation in 573 ms returned []
Implicit Place search using SMT with State Equation took 1115 ms to find 0 implicit places.
[2023-03-22 00:19:45] [INFO ] Invariant cache hit.
[2023-03-22 00:19:46] [INFO ] Dead Transitions using invariants and state equation in 261 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 195/207 places, 180/192 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1417 ms. Remains : 195/207 places, 180/192 transitions.
Support contains 30 out of 195 places after structural reductions.
[2023-03-22 00:19:46] [INFO ] Flatten gal took : 52 ms
[2023-03-22 00:19:46] [INFO ] Flatten gal took : 15 ms
[2023-03-22 00:19:46] [INFO ] Input system was already deterministic with 180 transitions.
Support contains 29 out of 195 places (down from 30) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 17) seen :16
Finished Best-First random walk after 1140 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=380 )
FORMULA ShieldPPPs-PT-003B-LTLCardinality-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA ShieldPPPs-PT-003B-LTLCardinality-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 41 stabilizing places and 41 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((X(p1)&&p0)))))'
Support contains 3 out of 195 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 180/180 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 187 transition count 172
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 187 transition count 172
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 186 transition count 171
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 186 transition count 171
Applied a total of 18 rules in 37 ms. Remains 186 /195 variables (removed 9) and now considering 171/180 (removed 9) transitions.
// Phase 1: matrix 171 rows 186 cols
[2023-03-22 00:19:47] [INFO ] Computed 34 place invariants in 2 ms
[2023-03-22 00:19:47] [INFO ] Implicit Places using invariants in 343 ms returned []
[2023-03-22 00:19:47] [INFO ] Invariant cache hit.
[2023-03-22 00:19:47] [INFO ] Implicit Places using invariants and state equation in 417 ms returned []
Implicit Place search using SMT with State Equation took 764 ms to find 0 implicit places.
[2023-03-22 00:19:47] [INFO ] Invariant cache hit.
[2023-03-22 00:19:48] [INFO ] Dead Transitions using invariants and state equation in 180 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 186/195 places, 171/180 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 997 ms. Remains : 186/195 places, 171/180 transitions.
Stuttering acceptance computed with spot in 559 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPs-PT-003B-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p0:(AND (NEQ s2 0) (NEQ s173 1)), p1:(EQ s113 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 3 ms.
FORMULA ShieldPPPs-PT-003B-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-003B-LTLCardinality-03 finished in 1747 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 195 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 195/195 places, 180/180 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 194 transition count 157
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 172 transition count 157
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 44 place count 172 transition count 142
Deduced a syphon composed of 15 places in 9 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 74 place count 157 transition count 142
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 83 place count 148 transition count 133
Iterating global reduction 2 with 9 rules applied. Total rules applied 92 place count 148 transition count 133
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 92 place count 148 transition count 130
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 98 place count 145 transition count 130
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 2 with 98 rules applied. Total rules applied 196 place count 96 transition count 81
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 198 place count 94 transition count 79
Applied a total of 198 rules in 130 ms. Remains 94 /195 variables (removed 101) and now considering 79/180 (removed 101) transitions.
// Phase 1: matrix 79 rows 94 cols
[2023-03-22 00:19:48] [INFO ] Computed 34 place invariants in 3 ms
[2023-03-22 00:19:49] [INFO ] Implicit Places using invariants in 185 ms returned []
[2023-03-22 00:19:49] [INFO ] Invariant cache hit.
[2023-03-22 00:19:49] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
[2023-03-22 00:19:49] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 00:19:49] [INFO ] Invariant cache hit.
[2023-03-22 00:19:49] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 94/195 places, 79/180 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 539 ms. Remains : 94/195 places, 79/180 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-003B-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s29 0) (NEQ s92 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 22357 reset in 366 ms.
Product exploration explored 100000 steps with 22210 reset in 250 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 201 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(NOT p0)]
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 215 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
[2023-03-22 00:19:50] [INFO ] Invariant cache hit.
[2023-03-22 00:19:50] [INFO ] [Real]Absence check using 34 positive place invariants in 9 ms returned sat
[2023-03-22 00:19:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 00:19:50] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2023-03-22 00:19:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 00:19:50] [INFO ] [Nat]Absence check using 34 positive place invariants in 7 ms returned sat
[2023-03-22 00:19:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 00:19:51] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2023-03-22 00:19:51] [INFO ] Computed and/alt/rep : 76/145/76 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-22 00:19:51] [INFO ] Added : 44 causal constraints over 9 iterations in 161 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 94 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 94/94 places, 79/79 transitions.
Applied a total of 0 rules in 3 ms. Remains 94 /94 variables (removed 0) and now considering 79/79 (removed 0) transitions.
[2023-03-22 00:19:51] [INFO ] Invariant cache hit.
[2023-03-22 00:19:51] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-22 00:19:51] [INFO ] Invariant cache hit.
[2023-03-22 00:19:51] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
[2023-03-22 00:19:51] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 00:19:51] [INFO ] Invariant cache hit.
[2023-03-22 00:19:51] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 203 ms. Remains : 94/94 places, 79/79 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 170 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 267 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0)]
[2023-03-22 00:19:52] [INFO ] Invariant cache hit.
[2023-03-22 00:19:52] [INFO ] [Real]Absence check using 34 positive place invariants in 11 ms returned sat
[2023-03-22 00:19:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 00:19:52] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2023-03-22 00:19:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 00:19:52] [INFO ] [Nat]Absence check using 34 positive place invariants in 23 ms returned sat
[2023-03-22 00:19:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 00:19:52] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2023-03-22 00:19:52] [INFO ] Computed and/alt/rep : 76/145/76 causal constraints (skipped 0 transitions) in 14 ms.
[2023-03-22 00:19:52] [INFO ] Added : 44 causal constraints over 9 iterations in 151 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22269 reset in 168 ms.
Product exploration explored 100000 steps with 22267 reset in 194 ms.
Support contains 2 out of 94 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 94/94 places, 79/79 transitions.
Applied a total of 0 rules in 2 ms. Remains 94 /94 variables (removed 0) and now considering 79/79 (removed 0) transitions.
[2023-03-22 00:19:53] [INFO ] Invariant cache hit.
[2023-03-22 00:19:53] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-22 00:19:53] [INFO ] Invariant cache hit.
[2023-03-22 00:19:53] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
[2023-03-22 00:19:53] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-22 00:19:53] [INFO ] Invariant cache hit.
[2023-03-22 00:19:53] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 348 ms. Remains : 94/94 places, 79/79 transitions.
Treatment of property ShieldPPPs-PT-003B-LTLCardinality-05 finished in 4904 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 U p1)||F(p2)||(p0&&F(G(p3)))))))'
Support contains 7 out of 195 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 180/180 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 189 transition count 174
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 189 transition count 174
Applied a total of 12 rules in 5 ms. Remains 189 /195 variables (removed 6) and now considering 174/180 (removed 6) transitions.
// Phase 1: matrix 174 rows 189 cols
[2023-03-22 00:19:53] [INFO ] Computed 34 place invariants in 2 ms
[2023-03-22 00:19:53] [INFO ] Implicit Places using invariants in 153 ms returned []
[2023-03-22 00:19:53] [INFO ] Invariant cache hit.
[2023-03-22 00:19:53] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
[2023-03-22 00:19:53] [INFO ] Invariant cache hit.
[2023-03-22 00:19:54] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 189/195 places, 174/180 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 462 ms. Remains : 189/195 places, 174/180 transitions.
Stuttering acceptance computed with spot in 306 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : ShieldPPPs-PT-003B-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2) (NOT p3)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) p0 (NOT p2) p3), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2) (NOT p3)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) p3), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s61 0) (EQ s107 1)), p0:(OR (EQ s70 0) (EQ s31 1)), p2:(EQ s73 1), p3:(OR (EQ s161 0) (EQ s3 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 193 reset in 296 ms.
Product exploration explored 100000 steps with 189 reset in 234 ms.
Computed a total of 38 stabilizing places and 38 stable transitions
Computed a total of 38 stabilizing places and 38 stable transitions
Detected a total of 38/189 stabilizing places and 38/174 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p1 p0 (NOT p2) p3), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), true, (X (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0 (NOT p2) p3)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 668 ms. Reduced automaton from 5 states, 10 edges and 4 AP (stutter sensitive) to 5 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 495 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Incomplete random walk after 10000 steps, including 18 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:19:56] [INFO ] Invariant cache hit.
[2023-03-22 00:19:56] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:19:56] [INFO ] [Nat]Absence check using 34 positive place invariants in 9 ms returned sat
[2023-03-22 00:19:56] [INFO ] After 79ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:19:56] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 18 ms to minimize.
[2023-03-22 00:19:56] [INFO ] Deduced a trap composed of 17 places in 116 ms of which 1 ms to minimize.
[2023-03-22 00:19:56] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
[2023-03-22 00:19:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 361 ms
[2023-03-22 00:19:56] [INFO ] After 450ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2023-03-22 00:19:56] [INFO ] After 578ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 5 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 174/174 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 189 transition count 153
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 168 transition count 153
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 42 place count 168 transition count 137
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 74 place count 152 transition count 137
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 75 place count 151 transition count 136
Iterating global reduction 2 with 1 rules applied. Total rules applied 76 place count 151 transition count 136
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 76 place count 151 transition count 135
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 78 place count 150 transition count 135
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 174 place count 102 transition count 87
Partial Free-agglomeration rule applied 23 times.
Drop transitions removed 23 transitions
Iterating global reduction 2 with 23 rules applied. Total rules applied 197 place count 102 transition count 87
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 198 place count 101 transition count 86
Applied a total of 198 rules in 17 ms. Remains 101 /189 variables (removed 88) and now considering 86/174 (removed 88) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 101/189 places, 86/174 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) 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 1754060 steps, run timeout after 3001 ms. (steps per millisecond=584 ) properties seen :{}
Probabilistic random walk after 1754060 steps, saw 318459 distinct states, run finished after 3004 ms. (steps per millisecond=583 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 86 rows 101 cols
[2023-03-22 00:20:00] [INFO ] Computed 34 place invariants in 2 ms
[2023-03-22 00:20:00] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:20:00] [INFO ] [Nat]Absence check using 31 positive place invariants in 10 ms returned sat
[2023-03-22 00:20:00] [INFO ] [Nat]Absence check using 31 positive and 3 generalized place invariants in 15 ms returned sat
[2023-03-22 00:20:00] [INFO ] After 72ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:20:00] [INFO ] Deduced a trap composed of 6 places in 85 ms of which 2 ms to minimize.
[2023-03-22 00:20:00] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 0 ms to minimize.
[2023-03-22 00:20:00] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 1 ms to minimize.
[2023-03-22 00:20:00] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 242 ms
[2023-03-22 00:20:00] [INFO ] After 333ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-22 00:20:00] [INFO ] After 451ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 86/86 transitions.
Applied a total of 0 rules in 5 ms. Remains 101 /101 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 101/101 places, 86/86 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 86/86 transitions.
Applied a total of 0 rules in 15 ms. Remains 101 /101 variables (removed 0) and now considering 86/86 (removed 0) transitions.
[2023-03-22 00:20:00] [INFO ] Invariant cache hit.
[2023-03-22 00:20:00] [INFO ] Implicit Places using invariants in 91 ms returned []
[2023-03-22 00:20:00] [INFO ] Invariant cache hit.
[2023-03-22 00:20:00] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
[2023-03-22 00:20:00] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 00:20:00] [INFO ] Invariant cache hit.
[2023-03-22 00:20:00] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 292 ms. Remains : 101/101 places, 86/86 transitions.
Applied a total of 0 rules in 2 ms. Remains 101 /101 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-22 00:20:00] [INFO ] Invariant cache hit.
[2023-03-22 00:20:00] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:20:00] [INFO ] [Nat]Absence check using 31 positive place invariants in 5 ms returned sat
[2023-03-22 00:20:00] [INFO ] [Nat]Absence check using 31 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-22 00:20:01] [INFO ] After 75ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:20:01] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 1 ms to minimize.
[2023-03-22 00:20:01] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 1 ms to minimize.
[2023-03-22 00:20:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 140 ms
[2023-03-22 00:20:01] [INFO ] After 235ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-22 00:20:01] [INFO ] After 299ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 p0 (NOT p2) p3), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), true, (X (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0 (NOT p2) p3)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) p3))), (F (AND (NOT p1) (NOT p2) p0 p3)), (F (AND (NOT p2) (NOT p3))), (F p2), (F (AND (NOT p1) (NOT p2) p0 (NOT p3)))]
Knowledge based reduction with 9 factoid took 745 ms. Reduced automaton from 5 states, 10 edges and 4 AP (stutter sensitive) to 5 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 418 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 450 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Support contains 7 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 174/174 transitions.
Applied a total of 0 rules in 6 ms. Remains 189 /189 variables (removed 0) and now considering 174/174 (removed 0) transitions.
// Phase 1: matrix 174 rows 189 cols
[2023-03-22 00:20:02] [INFO ] Computed 34 place invariants in 10 ms
[2023-03-22 00:20:03] [INFO ] Implicit Places using invariants in 285 ms returned []
[2023-03-22 00:20:03] [INFO ] Invariant cache hit.
[2023-03-22 00:20:03] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 515 ms to find 0 implicit places.
[2023-03-22 00:20:03] [INFO ] Invariant cache hit.
[2023-03-22 00:20:03] [INFO ] Dead Transitions using invariants and state equation in 193 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 716 ms. Remains : 189/189 places, 174/174 transitions.
Computed a total of 38 stabilizing places and 38 stable transitions
Computed a total of 38 stabilizing places and 38 stable transitions
Detected a total of 38/189 stabilizing places and 38/174 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p2) p0 p3), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0 (NOT p3)))), true, (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p2) p0 p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0 (NOT p3))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 542 ms. Reduced automaton from 5 states, 10 edges and 4 AP (stutter sensitive) to 5 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 308 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Incomplete random walk after 10000 steps, including 17 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:20:04] [INFO ] Invariant cache hit.
[2023-03-22 00:20:04] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:20:04] [INFO ] [Nat]Absence check using 34 positive place invariants in 11 ms returned sat
[2023-03-22 00:20:04] [INFO ] After 57ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:20:04] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
[2023-03-22 00:20:04] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 0 ms to minimize.
[2023-03-22 00:20:04] [INFO ] Deduced a trap composed of 22 places in 112 ms of which 1 ms to minimize.
[2023-03-22 00:20:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 279 ms
[2023-03-22 00:20:05] [INFO ] After 344ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-22 00:20:05] [INFO ] After 438ms 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 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 174/174 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 189 transition count 153
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 168 transition count 153
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 42 place count 168 transition count 137
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 74 place count 152 transition count 137
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 75 place count 151 transition count 136
Iterating global reduction 2 with 1 rules applied. Total rules applied 76 place count 151 transition count 136
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 76 place count 151 transition count 135
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 78 place count 150 transition count 135
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 174 place count 102 transition count 87
Partial Free-agglomeration rule applied 23 times.
Drop transitions removed 23 transitions
Iterating global reduction 2 with 23 rules applied. Total rules applied 197 place count 102 transition count 87
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 198 place count 101 transition count 86
Applied a total of 198 rules in 41 ms. Remains 101 /189 variables (removed 88) and now considering 86/174 (removed 88) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 101/189 places, 86/174 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1932894 steps, run timeout after 3001 ms. (steps per millisecond=644 ) properties seen :{}
Probabilistic random walk after 1932894 steps, saw 344762 distinct states, run finished after 3006 ms. (steps per millisecond=643 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 86 rows 101 cols
[2023-03-22 00:20:08] [INFO ] Computed 34 place invariants in 7 ms
[2023-03-22 00:20:08] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:20:08] [INFO ] [Nat]Absence check using 31 positive place invariants in 8 ms returned sat
[2023-03-22 00:20:08] [INFO ] [Nat]Absence check using 31 positive and 3 generalized place invariants in 26 ms returned sat
[2023-03-22 00:20:08] [INFO ] After 63ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:20:08] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 1 ms to minimize.
[2023-03-22 00:20:08] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 0 ms to minimize.
[2023-03-22 00:20:08] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 0 ms to minimize.
[2023-03-22 00:20:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 241 ms
[2023-03-22 00:20:08] [INFO ] After 334ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-22 00:20:08] [INFO ] After 458ms 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 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 86/86 transitions.
Applied a total of 0 rules in 3 ms. Remains 101 /101 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 101/101 places, 86/86 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 86/86 transitions.
Applied a total of 0 rules in 2 ms. Remains 101 /101 variables (removed 0) and now considering 86/86 (removed 0) transitions.
[2023-03-22 00:20:08] [INFO ] Invariant cache hit.
[2023-03-22 00:20:09] [INFO ] Implicit Places using invariants in 426 ms returned []
[2023-03-22 00:20:09] [INFO ] Invariant cache hit.
[2023-03-22 00:20:09] [INFO ] Implicit Places using invariants and state equation in 403 ms returned []
Implicit Place search using SMT with State Equation took 834 ms to find 0 implicit places.
[2023-03-22 00:20:09] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-22 00:20:09] [INFO ] Invariant cache hit.
[2023-03-22 00:20:09] [INFO ] Dead Transitions using invariants and state equation in 150 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1009 ms. Remains : 101/101 places, 86/86 transitions.
Applied a total of 0 rules in 2 ms. Remains 101 /101 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-22 00:20:09] [INFO ] Invariant cache hit.
[2023-03-22 00:20:09] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:20:09] [INFO ] [Nat]Absence check using 31 positive place invariants in 4 ms returned sat
[2023-03-22 00:20:09] [INFO ] [Nat]Absence check using 31 positive and 3 generalized place invariants in 12 ms returned sat
[2023-03-22 00:20:09] [INFO ] After 140ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:20:10] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 0 ms to minimize.
[2023-03-22 00:20:10] [INFO ] Deduced a trap composed of 6 places in 152 ms of which 0 ms to minimize.
[2023-03-22 00:20:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 244 ms
[2023-03-22 00:20:10] [INFO ] After 405ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-22 00:20:10] [INFO ] After 496ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 (NOT p2) p0 p3), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0 (NOT p3)))), true, (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p2) p0 p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0 (NOT p3))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) p3))), (F (AND (NOT p1) (NOT p2) p0 p3)), (F (AND (NOT p2) (NOT p3))), (F p2), (F (AND (NOT p1) (NOT p2) p0 (NOT p3)))]
Knowledge based reduction with 9 factoid took 864 ms. Reduced automaton from 5 states, 10 edges and 4 AP (stutter sensitive) to 5 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 397 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 403 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 395 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Product exploration explored 100000 steps with 191 reset in 276 ms.
Product exploration explored 100000 steps with 192 reset in 232 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 300 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Support contains 7 out of 189 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 189/189 places, 174/174 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 189 transition count 174
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 9 Pre rules applied. Total rules applied 20 place count 189 transition count 176
Deduced a syphon composed of 29 places in 1 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 29 place count 189 transition count 176
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 83 places in 1 ms
Iterating global reduction 1 with 54 rules applied. Total rules applied 83 place count 189 transition count 176
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 103 place count 169 transition count 156
Deduced a syphon composed of 63 places in 0 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 123 place count 169 transition count 156
Deduced a syphon composed of 63 places in 0 ms
Applied a total of 123 rules in 38 ms. Remains 169 /189 variables (removed 20) and now considering 156/174 (removed 18) transitions.
[2023-03-22 00:20:13] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 156 rows 169 cols
[2023-03-22 00:20:13] [INFO ] Computed 34 place invariants in 2 ms
[2023-03-22 00:20:13] [INFO ] Dead Transitions using invariants and state equation in 175 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 169/189 places, 156/174 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 244 ms. Remains : 169/189 places, 156/174 transitions.
Support contains 7 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 174/174 transitions.
Applied a total of 0 rules in 3 ms. Remains 189 /189 variables (removed 0) and now considering 174/174 (removed 0) transitions.
// Phase 1: matrix 174 rows 189 cols
[2023-03-22 00:20:13] [INFO ] Computed 34 place invariants in 1 ms
[2023-03-22 00:20:13] [INFO ] Implicit Places using invariants in 89 ms returned []
[2023-03-22 00:20:13] [INFO ] Invariant cache hit.
[2023-03-22 00:20:14] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
[2023-03-22 00:20:14] [INFO ] Invariant cache hit.
[2023-03-22 00:20:14] [INFO ] Dead Transitions using invariants and state equation in 198 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 468 ms. Remains : 189/189 places, 174/174 transitions.
Treatment of property ShieldPPPs-PT-003B-LTLCardinality-06 finished in 20651 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||X(X(G(p1))))))'
Support contains 1 out of 195 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 180/180 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 187 transition count 172
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 187 transition count 172
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 186 transition count 171
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 186 transition count 171
Applied a total of 18 rules in 8 ms. Remains 186 /195 variables (removed 9) and now considering 171/180 (removed 9) transitions.
// Phase 1: matrix 171 rows 186 cols
[2023-03-22 00:20:14] [INFO ] Computed 34 place invariants in 1 ms
[2023-03-22 00:20:14] [INFO ] Implicit Places using invariants in 76 ms returned []
[2023-03-22 00:20:14] [INFO ] Invariant cache hit.
[2023-03-22 00:20:14] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
[2023-03-22 00:20:14] [INFO ] Invariant cache hit.
[2023-03-22 00:20:14] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 186/195 places, 171/180 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 314 ms. Remains : 186/195 places, 171/180 transitions.
Stuttering acceptance computed with spot in 240 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-003B-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p0:(EQ s106 1), p1:(EQ s106 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 17 steps with 0 reset in 0 ms.
FORMULA ShieldPPPs-PT-003B-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-003B-LTLCardinality-08 finished in 571 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 195 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 195/195 places, 180/180 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 194 transition count 157
Reduce places removed 22 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 23 rules applied. Total rules applied 45 place count 172 transition count 156
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 46 place count 171 transition count 156
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 46 place count 171 transition count 141
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 76 place count 156 transition count 141
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 85 place count 147 transition count 132
Iterating global reduction 3 with 9 rules applied. Total rules applied 94 place count 147 transition count 132
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 94 place count 147 transition count 129
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 100 place count 144 transition count 129
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 198 place count 95 transition count 80
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 200 place count 93 transition count 78
Applied a total of 200 rules in 16 ms. Remains 93 /195 variables (removed 102) and now considering 78/180 (removed 102) transitions.
// Phase 1: matrix 78 rows 93 cols
[2023-03-22 00:20:14] [INFO ] Computed 34 place invariants in 0 ms
[2023-03-22 00:20:14] [INFO ] Implicit Places using invariants in 103 ms returned []
[2023-03-22 00:20:14] [INFO ] Invariant cache hit.
[2023-03-22 00:20:15] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
[2023-03-22 00:20:15] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 00:20:15] [INFO ] Invariant cache hit.
[2023-03-22 00:20:15] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 93/195 places, 78/180 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 347 ms. Remains : 93/195 places, 78/180 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-003B-LTLCardinality-10 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 (EQ s65 0) (EQ s47 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 238 steps with 0 reset in 1 ms.
FORMULA ShieldPPPs-PT-003B-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-003B-LTLCardinality-10 finished in 440 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1))))'
Support contains 3 out of 195 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 195/195 places, 180/180 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 194 transition count 157
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 172 transition count 157
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 44 place count 172 transition count 142
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 74 place count 157 transition count 142
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 82 place count 149 transition count 134
Iterating global reduction 2 with 8 rules applied. Total rules applied 90 place count 149 transition count 134
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 90 place count 149 transition count 132
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 94 place count 147 transition count 132
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 2 with 92 rules applied. Total rules applied 186 place count 101 transition count 86
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 188 place count 99 transition count 84
Applied a total of 188 rules in 17 ms. Remains 99 /195 variables (removed 96) and now considering 84/180 (removed 96) transitions.
// Phase 1: matrix 84 rows 99 cols
[2023-03-22 00:20:15] [INFO ] Computed 34 place invariants in 1 ms
[2023-03-22 00:20:15] [INFO ] Implicit Places using invariants in 76 ms returned []
[2023-03-22 00:20:15] [INFO ] Invariant cache hit.
[2023-03-22 00:20:15] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
[2023-03-22 00:20:15] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 00:20:15] [INFO ] Invariant cache hit.
[2023-03-22 00:20:15] [INFO ] Dead Transitions using invariants and state equation in 150 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 99/195 places, 84/180 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 401 ms. Remains : 99/195 places, 84/180 transitions.
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPs-PT-003B-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(OR (EQ s38 0) (EQ s1 1)), p0:(EQ s28 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 10896 reset in 164 ms.
Product exploration explored 100000 steps with 10852 reset in 154 ms.
Computed a total of 5 stabilizing places and 5 stable transitions
Computed a total of 5 stabilizing places and 5 stable transitions
Detected a total of 5/99 stabilizing places and 5/84 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 5 factoid took 405 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p1) (NOT p0))]
Finished random walk after 1245 steps, including 5 resets, run visited all 2 properties in 3 ms. (steps per millisecond=415 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (NOT (AND p1 (NOT p0)))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 5 factoid took 516 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p1) (NOT p0))]
Support contains 3 out of 99 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 99/99 places, 84/84 transitions.
Applied a total of 0 rules in 5 ms. Remains 99 /99 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-22 00:20:17] [INFO ] Invariant cache hit.
[2023-03-22 00:20:17] [INFO ] Implicit Places using invariants in 330 ms returned []
[2023-03-22 00:20:17] [INFO ] Invariant cache hit.
[2023-03-22 00:20:17] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 655 ms to find 0 implicit places.
[2023-03-22 00:20:17] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 00:20:17] [INFO ] Invariant cache hit.
[2023-03-22 00:20:18] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 790 ms. Remains : 99/99 places, 84/84 transitions.
Computed a total of 5 stabilizing places and 5 stable transitions
Computed a total of 5 stabilizing places and 5 stable transitions
Detected a total of 5/99 stabilizing places and 5/84 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 5 factoid took 361 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 41 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :1
Finished Best-First random walk after 386 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=386 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (NOT (AND p1 (NOT p0)))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 5 factoid took 491 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 45 ms :[(AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 10963 reset in 168 ms.
Product exploration explored 100000 steps with 10913 reset in 165 ms.
Support contains 3 out of 99 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 99/99 places, 84/84 transitions.
Applied a total of 0 rules in 2 ms. Remains 99 /99 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-22 00:20:19] [INFO ] Invariant cache hit.
[2023-03-22 00:20:19] [INFO ] Implicit Places using invariants in 138 ms returned []
[2023-03-22 00:20:19] [INFO ] Invariant cache hit.
[2023-03-22 00:20:20] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 481 ms to find 0 implicit places.
[2023-03-22 00:20:20] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 00:20:20] [INFO ] Invariant cache hit.
[2023-03-22 00:20:20] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 581 ms. Remains : 99/99 places, 84/84 transitions.
Treatment of property ShieldPPPs-PT-003B-LTLCardinality-11 finished in 4857 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) U X(X(p1)))))'
Support contains 4 out of 195 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 180/180 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 186 transition count 171
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 186 transition count 171
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 185 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 185 transition count 170
Applied a total of 20 rules in 6 ms. Remains 185 /195 variables (removed 10) and now considering 170/180 (removed 10) transitions.
// Phase 1: matrix 170 rows 185 cols
[2023-03-22 00:20:20] [INFO ] Computed 34 place invariants in 1 ms
[2023-03-22 00:20:20] [INFO ] Implicit Places using invariants in 164 ms returned []
[2023-03-22 00:20:20] [INFO ] Invariant cache hit.
[2023-03-22 00:20:20] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
[2023-03-22 00:20:20] [INFO ] Invariant cache hit.
[2023-03-22 00:20:20] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 185/195 places, 170/180 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 488 ms. Remains : 185/195 places, 170/180 transitions.
Stuttering acceptance computed with spot in 437 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-003B-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}, { cond=true, acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=(NOT p1), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(OR (EQ s19 0) (EQ s16 1)), p1:(OR (EQ s139 0) (EQ s24 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]]
Product exploration explored 100000 steps with 24996 reset in 127 ms.
Product exploration explored 100000 steps with 25019 reset in 125 ms.
Computed a total of 35 stabilizing places and 35 stable transitions
Computed a total of 35 stabilizing places and 35 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 307 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 441 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Finished random walk after 333 steps, including 0 resets, run visited all 3 properties in 8 ms. (steps per millisecond=41 )
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 4 factoid took 392 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 422 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 432 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Support contains 4 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 170/170 transitions.
Applied a total of 0 rules in 3 ms. Remains 185 /185 variables (removed 0) and now considering 170/170 (removed 0) transitions.
[2023-03-22 00:20:23] [INFO ] Invariant cache hit.
[2023-03-22 00:20:23] [INFO ] Implicit Places using invariants in 114 ms returned []
[2023-03-22 00:20:23] [INFO ] Invariant cache hit.
[2023-03-22 00:20:23] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
[2023-03-22 00:20:23] [INFO ] Invariant cache hit.
[2023-03-22 00:20:23] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 468 ms. Remains : 185/185 places, 170/170 transitions.
Computed a total of 35 stabilizing places and 35 stable transitions
Computed a total of 35 stabilizing places and 35 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 282 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 494 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Finished random walk after 908 steps, including 1 resets, run visited all 3 properties in 17 ms. (steps per millisecond=53 )
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 4 factoid took 460 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 499 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 455 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 499 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 25038 reset in 169 ms.
Product exploration explored 100000 steps with 24935 reset in 117 ms.
Applying partial POR strategy [false, false, false, true, false, false, true]
Stuttering acceptance computed with spot in 431 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Support contains 4 out of 185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 170/170 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 185 transition count 170
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 8 Pre rules applied. Total rules applied 21 place count 185 transition count 171
Deduced a syphon composed of 29 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 29 place count 185 transition count 171
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 88 places in 0 ms
Iterating global reduction 1 with 59 rules applied. Total rules applied 88 place count 185 transition count 171
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 111 place count 162 transition count 148
Deduced a syphon composed of 65 places in 0 ms
Iterating global reduction 1 with 23 rules applied. Total rules applied 134 place count 162 transition count 148
Deduced a syphon composed of 65 places in 0 ms
Applied a total of 134 rules in 26 ms. Remains 162 /185 variables (removed 23) and now considering 148/170 (removed 22) transitions.
[2023-03-22 00:20:27] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 148 rows 162 cols
[2023-03-22 00:20:27] [INFO ] Computed 34 place invariants in 2 ms
[2023-03-22 00:20:27] [INFO ] Dead Transitions using invariants and state equation in 160 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 162/185 places, 148/170 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 198 ms. Remains : 162/185 places, 148/170 transitions.
Support contains 4 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 170/170 transitions.
Applied a total of 0 rules in 1 ms. Remains 185 /185 variables (removed 0) and now considering 170/170 (removed 0) transitions.
// Phase 1: matrix 170 rows 185 cols
[2023-03-22 00:20:27] [INFO ] Computed 34 place invariants in 0 ms
[2023-03-22 00:20:27] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-03-22 00:20:27] [INFO ] Invariant cache hit.
[2023-03-22 00:20:27] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
[2023-03-22 00:20:27] [INFO ] Invariant cache hit.
[2023-03-22 00:20:28] [INFO ] Dead Transitions using invariants and state equation in 166 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 410 ms. Remains : 185/185 places, 170/170 transitions.
Treatment of property ShieldPPPs-PT-003B-LTLCardinality-13 finished in 7951 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(((p0 U p1)||F(p2)||(p0&&F(G(p3)))))))'
Found a Lengthening insensitive property : ShieldPPPs-PT-003B-LTLCardinality-06
Stuttering acceptance computed with spot in 283 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Support contains 7 out of 195 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 195/195 places, 180/180 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 194 transition count 159
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 40 place count 174 transition count 159
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 40 place count 174 transition count 143
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 72 place count 158 transition count 143
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 78 place count 152 transition count 137
Iterating global reduction 2 with 6 rules applied. Total rules applied 84 place count 152 transition count 137
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 84 place count 152 transition count 136
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 86 place count 151 transition count 136
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 174 place count 107 transition count 92
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 176 place count 105 transition count 90
Applied a total of 176 rules in 10 ms. Remains 105 /195 variables (removed 90) and now considering 90/180 (removed 90) transitions.
// Phase 1: matrix 90 rows 105 cols
[2023-03-22 00:20:28] [INFO ] Computed 34 place invariants in 0 ms
[2023-03-22 00:20:28] [INFO ] Implicit Places using invariants in 143 ms returned []
[2023-03-22 00:20:28] [INFO ] Invariant cache hit.
[2023-03-22 00:20:28] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
[2023-03-22 00:20:28] [INFO ] Invariant cache hit.
[2023-03-22 00:20:28] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 105/195 places, 90/180 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 377 ms. Remains : 105/195 places, 90/180 transitions.
Running random walk in product with property : ShieldPPPs-PT-003B-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2) (NOT p3)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) p0 (NOT p2) p3), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2) (NOT p3)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) p3), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s34 0) (EQ s63 1)), p0:(OR (EQ s38 0) (EQ s17 1)), p2:(EQ s40 1), p3:(OR (EQ s90 0) (EQ s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 424 reset in 175 ms.
Product exploration explored 100000 steps with 418 reset in 243 ms.
Computed a total of 8 stabilizing places and 8 stable transitions
Computed a total of 8 stabilizing places and 8 stable transitions
Detected a total of 8/105 stabilizing places and 8/90 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p1 p0 (NOT p2) p3), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), true, (X (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0 (NOT p2) p3)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 621 ms. Reduced automaton from 5 states, 10 edges and 4 AP (stutter sensitive) to 5 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 253 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Incomplete random walk after 10000 steps, including 39 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:20:30] [INFO ] Invariant cache hit.
[2023-03-22 00:20:30] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:20:30] [INFO ] [Nat]Absence check using 34 positive place invariants in 7 ms returned sat
[2023-03-22 00:20:30] [INFO ] After 56ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:20:30] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2023-03-22 00:20:30] [INFO ] Deduced a trap composed of 8 places in 115 ms of which 0 ms to minimize.
[2023-03-22 00:20:30] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2023-03-22 00:20:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 245 ms
[2023-03-22 00:20:30] [INFO ] After 311ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-22 00:20:30] [INFO ] After 415ms 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 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 90/90 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 0 with 1 rules applied. Total rules applied 1 place count 105 transition count 89
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 104 transition count 89
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 2 with 4 rules applied. Total rules applied 6 place count 102 transition count 87
Partial Free-agglomeration rule applied 21 times.
Drop transitions removed 21 transitions
Iterating global reduction 2 with 21 rules applied. Total rules applied 27 place count 102 transition count 87
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 101 transition count 86
Applied a total of 28 rules in 7 ms. Remains 101 /105 variables (removed 4) and now considering 86/90 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 101/105 places, 86/90 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1867115 steps, run timeout after 3001 ms. (steps per millisecond=622 ) properties seen :{}
Probabilistic random walk after 1867115 steps, saw 340656 distinct states, run finished after 3001 ms. (steps per millisecond=622 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 86 rows 101 cols
[2023-03-22 00:20:33] [INFO ] Computed 34 place invariants in 3 ms
[2023-03-22 00:20:33] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:20:34] [INFO ] [Nat]Absence check using 33 positive place invariants in 36 ms returned sat
[2023-03-22 00:20:34] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 24 ms returned sat
[2023-03-22 00:20:34] [INFO ] After 859ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:20:34] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 1 ms to minimize.
[2023-03-22 00:20:35] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 1 ms to minimize.
[2023-03-22 00:20:35] [INFO ] Deduced a trap composed of 6 places in 345 ms of which 0 ms to minimize.
[2023-03-22 00:20:35] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2023-03-22 00:20:35] [INFO ] Deduced a trap composed of 6 places in 85 ms of which 0 ms to minimize.
[2023-03-22 00:20:35] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 700 ms
[2023-03-22 00:20:35] [INFO ] After 1584ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-22 00:20:35] [INFO ] After 1719ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 86/86 transitions.
Applied a total of 0 rules in 3 ms. Remains 101 /101 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 101/101 places, 86/86 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 86/86 transitions.
Applied a total of 0 rules in 3 ms. Remains 101 /101 variables (removed 0) and now considering 86/86 (removed 0) transitions.
[2023-03-22 00:20:35] [INFO ] Invariant cache hit.
[2023-03-22 00:20:35] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-22 00:20:35] [INFO ] Invariant cache hit.
[2023-03-22 00:20:35] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
[2023-03-22 00:20:35] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 00:20:35] [INFO ] Invariant cache hit.
[2023-03-22 00:20:35] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 314 ms. Remains : 101/101 places, 86/86 transitions.
Applied a total of 0 rules in 1 ms. Remains 101 /101 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-22 00:20:35] [INFO ] Invariant cache hit.
[2023-03-22 00:20:36] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:20:36] [INFO ] [Nat]Absence check using 33 positive place invariants in 12 ms returned sat
[2023-03-22 00:20:36] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 00:20:36] [INFO ] After 38ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:20:36] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 0 ms to minimize.
[2023-03-22 00:20:36] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 6 ms to minimize.
[2023-03-22 00:20:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 150 ms
[2023-03-22 00:20:36] [INFO ] After 217ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-22 00:20:36] [INFO ] After 290ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 p0 (NOT p2) p3), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), true, (X (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0 (NOT p2) p3)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) p3))), (F (AND (NOT p1) (NOT p2) p0 p3)), (F (AND (NOT p2) (NOT p3))), (F p2), (F (AND (NOT p1) (NOT p2) p0 (NOT p3)))]
Knowledge based reduction with 9 factoid took 849 ms. Reduced automaton from 5 states, 10 edges and 4 AP (stutter sensitive) to 5 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 393 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 458 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Support contains 7 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 90/90 transitions.
Applied a total of 0 rules in 2 ms. Remains 105 /105 variables (removed 0) and now considering 90/90 (removed 0) transitions.
// Phase 1: matrix 90 rows 105 cols
[2023-03-22 00:20:38] [INFO ] Computed 34 place invariants in 1 ms
[2023-03-22 00:20:38] [INFO ] Implicit Places using invariants in 116 ms returned []
[2023-03-22 00:20:38] [INFO ] Invariant cache hit.
[2023-03-22 00:20:38] [INFO ] Implicit Places using invariants and state equation in 531 ms returned []
Implicit Place search using SMT with State Equation took 665 ms to find 0 implicit places.
[2023-03-22 00:20:38] [INFO ] Invariant cache hit.
[2023-03-22 00:20:38] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 761 ms. Remains : 105/105 places, 90/90 transitions.
Computed a total of 8 stabilizing places and 8 stable transitions
Computed a total of 8 stabilizing places and 8 stable transitions
Detected a total of 8/105 stabilizing places and 8/90 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p2) p0 p3), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0 (NOT p3)))), true, (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p2) p0 p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0 (NOT p3))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 482 ms. Reduced automaton from 5 states, 10 edges and 4 AP (stutter sensitive) to 5 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 308 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Incomplete random walk after 10000 steps, including 38 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:20:39] [INFO ] Invariant cache hit.
[2023-03-22 00:20:39] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:20:39] [INFO ] [Nat]Absence check using 34 positive place invariants in 6 ms returned sat
[2023-03-22 00:20:40] [INFO ] After 129ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:20:40] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
[2023-03-22 00:20:40] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 1 ms to minimize.
[2023-03-22 00:20:40] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 0 ms to minimize.
[2023-03-22 00:20:40] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 174 ms
[2023-03-22 00:20:40] [INFO ] After 310ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-22 00:20:40] [INFO ] After 398ms 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 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 90/90 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 0 with 1 rules applied. Total rules applied 1 place count 105 transition count 89
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 104 transition count 89
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 2 with 4 rules applied. Total rules applied 6 place count 102 transition count 87
Partial Free-agglomeration rule applied 21 times.
Drop transitions removed 21 transitions
Iterating global reduction 2 with 21 rules applied. Total rules applied 27 place count 102 transition count 87
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 101 transition count 86
Applied a total of 28 rules in 7 ms. Remains 101 /105 variables (removed 4) and now considering 86/90 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 101/105 places, 86/90 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1853230 steps, run timeout after 3001 ms. (steps per millisecond=617 ) properties seen :{}
Probabilistic random walk after 1853230 steps, saw 338683 distinct states, run finished after 3002 ms. (steps per millisecond=617 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 86 rows 101 cols
[2023-03-22 00:20:43] [INFO ] Computed 34 place invariants in 13 ms
[2023-03-22 00:20:43] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:20:43] [INFO ] [Nat]Absence check using 33 positive place invariants in 189 ms returned sat
[2023-03-22 00:20:43] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-22 00:20:43] [INFO ] After 56ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:20:43] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 0 ms to minimize.
[2023-03-22 00:20:43] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 1 ms to minimize.
[2023-03-22 00:20:43] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 0 ms to minimize.
[2023-03-22 00:20:43] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2023-03-22 00:20:43] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 0 ms to minimize.
[2023-03-22 00:20:43] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 304 ms
[2023-03-22 00:20:43] [INFO ] After 373ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-22 00:20:43] [INFO ] After 629ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 86/86 transitions.
Applied a total of 0 rules in 4 ms. Remains 101 /101 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 101/101 places, 86/86 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 86/86 transitions.
Applied a total of 0 rules in 3 ms. Remains 101 /101 variables (removed 0) and now considering 86/86 (removed 0) transitions.
[2023-03-22 00:20:43] [INFO ] Invariant cache hit.
[2023-03-22 00:20:44] [INFO ] Implicit Places using invariants in 339 ms returned []
[2023-03-22 00:20:44] [INFO ] Invariant cache hit.
[2023-03-22 00:20:44] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 551 ms to find 0 implicit places.
[2023-03-22 00:20:44] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 00:20:44] [INFO ] Invariant cache hit.
[2023-03-22 00:20:45] [INFO ] Dead Transitions using invariants and state equation in 1078 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1641 ms. Remains : 101/101 places, 86/86 transitions.
Applied a total of 0 rules in 20 ms. Remains 101 /101 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-22 00:20:45] [INFO ] Invariant cache hit.
[2023-03-22 00:20:45] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:20:45] [INFO ] [Nat]Absence check using 33 positive place invariants in 5 ms returned sat
[2023-03-22 00:20:45] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 7 ms returned sat
[2023-03-22 00:20:45] [INFO ] After 65ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:20:45] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 0 ms to minimize.
[2023-03-22 00:20:45] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 0 ms to minimize.
[2023-03-22 00:20:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 140 ms
[2023-03-22 00:20:46] [INFO ] After 226ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-22 00:20:46] [INFO ] After 334ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 (NOT p2) p0 p3), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0 (NOT p3)))), true, (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p2) p0 p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0 (NOT p3))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) p3))), (F (AND (NOT p1) (NOT p2) p0 p3)), (F (AND (NOT p2) (NOT p3))), (F p2), (F (AND (NOT p1) (NOT p2) p0 (NOT p3)))]
Knowledge based reduction with 9 factoid took 965 ms. Reduced automaton from 5 states, 10 edges and 4 AP (stutter sensitive) to 5 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 378 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 425 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 400 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Product exploration explored 100000 steps with 422 reset in 228 ms.
Product exploration explored 100000 steps with 425 reset in 278 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 337 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Support contains 7 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 90/90 transitions.
Applied a total of 0 rules in 3 ms. Remains 105 /105 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2023-03-22 00:20:49] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 90 rows 105 cols
[2023-03-22 00:20:49] [INFO ] Computed 34 place invariants in 1 ms
[2023-03-22 00:20:49] [INFO ] Dead Transitions using invariants and state equation in 303 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 317 ms. Remains : 105/105 places, 90/90 transitions.
Support contains 7 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 90/90 transitions.
Applied a total of 0 rules in 1 ms. Remains 105 /105 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2023-03-22 00:20:49] [INFO ] Invariant cache hit.
[2023-03-22 00:20:49] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-22 00:20:49] [INFO ] Invariant cache hit.
[2023-03-22 00:20:49] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
[2023-03-22 00:20:49] [INFO ] Invariant cache hit.
[2023-03-22 00:20:49] [INFO ] Dead Transitions using invariants and state equation in 189 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 473 ms. Remains : 105/105 places, 90/90 transitions.
Treatment of property ShieldPPPs-PT-003B-LTLCardinality-06 finished in 21785 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1))))'
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) U X(X(p1)))))'
Found a Lengthening insensitive property : ShieldPPPs-PT-003B-LTLCardinality-13
Stuttering acceptance computed with spot in 504 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Support contains 4 out of 195 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 195/195 places, 180/180 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 194 transition count 157
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 172 transition count 157
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 44 place count 172 transition count 141
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 76 place count 156 transition count 141
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 85 place count 147 transition count 132
Iterating global reduction 2 with 9 rules applied. Total rules applied 94 place count 147 transition count 132
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 94 place count 147 transition count 129
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 100 place count 144 transition count 129
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 2 with 92 rules applied. Total rules applied 192 place count 98 transition count 83
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 194 place count 96 transition count 81
Applied a total of 194 rules in 12 ms. Remains 96 /195 variables (removed 99) and now considering 81/180 (removed 99) transitions.
// Phase 1: matrix 81 rows 96 cols
[2023-03-22 00:20:50] [INFO ] Computed 34 place invariants in 0 ms
[2023-03-22 00:20:51] [INFO ] Implicit Places using invariants in 468 ms returned []
[2023-03-22 00:20:51] [INFO ] Invariant cache hit.
[2023-03-22 00:20:51] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 664 ms to find 0 implicit places.
[2023-03-22 00:20:51] [INFO ] Invariant cache hit.
[2023-03-22 00:20:51] [INFO ] Dead Transitions using invariants and state equation in 169 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 96/195 places, 81/180 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 846 ms. Remains : 96/195 places, 81/180 transitions.
Running random walk in product with property : ShieldPPPs-PT-003B-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}, { cond=true, acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=(NOT p1), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(OR (EQ s6 0) (EQ s4 1)), p1:(OR (EQ s69 0) (EQ s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 24980 reset in 131 ms.
Product exploration explored 100000 steps with 25009 reset in 151 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 315 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 473 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Finished random walk after 923 steps, including 3 resets, run visited all 3 properties in 4 ms. (steps per millisecond=230 )
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 4 factoid took 446 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 429 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 500 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Support contains 4 out of 96 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 81/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 96 /96 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2023-03-22 00:20:54] [INFO ] Invariant cache hit.
[2023-03-22 00:20:54] [INFO ] Implicit Places using invariants in 117 ms returned []
[2023-03-22 00:20:54] [INFO ] Invariant cache hit.
[2023-03-22 00:20:54] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
[2023-03-22 00:20:54] [INFO ] Invariant cache hit.
[2023-03-22 00:20:54] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 388 ms. Remains : 96/96 places, 81/81 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 277 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 494 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Finished random walk after 440 steps, including 1 resets, run visited all 3 properties in 7 ms. (steps per millisecond=62 )
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 4 factoid took 398 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 377 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 543 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 493 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 25025 reset in 171 ms.
Product exploration explored 100000 steps with 24999 reset in 199 ms.
Applying partial POR strategy [false, false, false, true, false, false, true]
Stuttering acceptance computed with spot in 534 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Support contains 4 out of 96 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 96/96 places, 81/81 transitions.
Applied a total of 0 rules in 13 ms. Remains 96 /96 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2023-03-22 00:20:58] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 00:20:58] [INFO ] Invariant cache hit.
[2023-03-22 00:20:58] [INFO ] Dead Transitions using invariants and state equation in 194 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 234 ms. Remains : 96/96 places, 81/81 transitions.
Support contains 4 out of 96 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 81/81 transitions.
Applied a total of 0 rules in 0 ms. Remains 96 /96 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2023-03-22 00:20:58] [INFO ] Invariant cache hit.
[2023-03-22 00:20:58] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-22 00:20:58] [INFO ] Invariant cache hit.
[2023-03-22 00:20:58] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
[2023-03-22 00:20:58] [INFO ] Invariant cache hit.
[2023-03-22 00:20:58] [INFO ] Dead Transitions using invariants and state equation in 150 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 474 ms. Remains : 96/96 places, 81/81 transitions.
Treatment of property ShieldPPPs-PT-003B-LTLCardinality-13 finished in 8759 ms.
[2023-03-22 00:20:58] [INFO ] Flatten gal took : 15 ms
[2023-03-22 00:20:58] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-22 00:20:58] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 195 places, 180 transitions and 504 arcs took 2 ms.
Total runtime 74632 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2582/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2582/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2582/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2582/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ShieldPPPs-PT-003B-LTLCardinality-05
Could not compute solution for formula : ShieldPPPs-PT-003B-LTLCardinality-06
Could not compute solution for formula : ShieldPPPs-PT-003B-LTLCardinality-11
Could not compute solution for formula : ShieldPPPs-PT-003B-LTLCardinality-13

BK_STOP 1679444459758

--------------------
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 ShieldPPPs-PT-003B-LTLCardinality-05
ltl formula formula --ltl=/tmp/2582/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
pnml2lts-mc( 0/ 4): Petri net has 195 places, 180 transitions and 504 arcs
Warning: program compiled against libxml 210 using older 209
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.050 real 0.020 user 0.020 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2582/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2582/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2582/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2582/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 1 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name ShieldPPPs-PT-003B-LTLCardinality-06
ltl formula formula --ltl=/tmp/2582/ltl_1_
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: =============================================================================
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): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 195 places, 180 transitions and 504 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.050 real 0.000 user 0.030 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2582/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2582/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2582/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2582/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 7 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:
malloc_consolidate(): invalid chunk size
ltl formula name ShieldPPPs-PT-003B-LTLCardinality-11
ltl formula formula --ltl=/tmp/2582/ltl_2_
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
pnml2lts-mc( 0/ 4): Petri net has 195 places, 180 transitions and 504 arcs
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
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.040 real 0.010 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2582/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2582/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2582/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2582/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 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:
malloc_consolidate(): invalid chunk size
ltl formula name ShieldPPPs-PT-003B-LTLCardinality-13
ltl formula formula --ltl=/tmp/2582/ltl_3_
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 195 places, 180 transitions and 504 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.030 real 0.010 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2582/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2582/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2582/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2582/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
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="ShieldPPPs-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 ShieldPPPs-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-167903717000395"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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