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-167903716600107.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 ShieldIIPs-PT-020B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r393-oct2-167903716600107
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 720K
-rw-r--r-- 1 mcc users 7.3K Feb 25 16:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 25 16:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 16:36 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.9K Feb 25 16:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.4K Feb 25 16:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 25 16:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 16:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 38K Feb 25 16:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 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 332K 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 ShieldIIPs-PT-020B-LTLCardinality-00
FORMULA_NAME ShieldIIPs-PT-020B-LTLCardinality-01
FORMULA_NAME ShieldIIPs-PT-020B-LTLCardinality-02
FORMULA_NAME ShieldIIPs-PT-020B-LTLCardinality-03
FORMULA_NAME ShieldIIPs-PT-020B-LTLCardinality-04
FORMULA_NAME ShieldIIPs-PT-020B-LTLCardinality-05
FORMULA_NAME ShieldIIPs-PT-020B-LTLCardinality-06
FORMULA_NAME ShieldIIPs-PT-020B-LTLCardinality-07
FORMULA_NAME ShieldIIPs-PT-020B-LTLCardinality-08
FORMULA_NAME ShieldIIPs-PT-020B-LTLCardinality-09
FORMULA_NAME ShieldIIPs-PT-020B-LTLCardinality-10
FORMULA_NAME ShieldIIPs-PT-020B-LTLCardinality-11
FORMULA_NAME ShieldIIPs-PT-020B-LTLCardinality-12
FORMULA_NAME ShieldIIPs-PT-020B-LTLCardinality-13
FORMULA_NAME ShieldIIPs-PT-020B-LTLCardinality-14
FORMULA_NAME ShieldIIPs-PT-020B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679424302655

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=ShieldIIPs-PT-020B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-21 18:45:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-21 18:45:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 18:45:05] [INFO ] Load time of PNML (sax parser for PT used): 182 ms
[2023-03-21 18:45:05] [INFO ] Transformed 1203 places.
[2023-03-21 18:45:05] [INFO ] Transformed 1183 transitions.
[2023-03-21 18:45:05] [INFO ] Found NUPN structural information;
[2023-03-21 18:45:05] [INFO ] Parsed PT model containing 1203 places and 1183 transitions and 3566 arcs in 325 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.
FORMULA ShieldIIPs-PT-020B-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-020B-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-020B-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-020B-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-020B-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-020B-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-020B-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-020B-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-020B-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 1203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1203/1203 places, 1183/1183 transitions.
Discarding 134 places :
Symmetric choice reduction at 0 with 134 rule applications. Total rules 134 place count 1069 transition count 1049
Iterating global reduction 0 with 134 rules applied. Total rules applied 268 place count 1069 transition count 1049
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 269 place count 1068 transition count 1048
Iterating global reduction 0 with 1 rules applied. Total rules applied 270 place count 1068 transition count 1048
Applied a total of 270 rules in 264 ms. Remains 1068 /1203 variables (removed 135) and now considering 1048/1183 (removed 135) transitions.
// Phase 1: matrix 1048 rows 1068 cols
[2023-03-21 18:45:06] [INFO ] Computed 181 place invariants in 25 ms
[2023-03-21 18:45:06] [INFO ] Implicit Places using invariants in 555 ms returned []
[2023-03-21 18:45:06] [INFO ] Invariant cache hit.
[2023-03-21 18:45:08] [INFO ] Implicit Places using invariants and state equation in 1608 ms returned []
Implicit Place search using SMT with State Equation took 2189 ms to find 0 implicit places.
[2023-03-21 18:45:08] [INFO ] Invariant cache hit.
[2023-03-21 18:45:09] [INFO ] Dead Transitions using invariants and state equation in 1025 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1068/1203 places, 1048/1183 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3481 ms. Remains : 1068/1203 places, 1048/1183 transitions.
Support contains 30 out of 1068 places after structural reductions.
[2023-03-21 18:45:09] [INFO ] Flatten gal took : 106 ms
[2023-03-21 18:45:09] [INFO ] Flatten gal took : 72 ms
[2023-03-21 18:45:09] [INFO ] Input system was already deterministic with 1048 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 279 ms. (steps per millisecond=35 ) properties (out of 18) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-21 18:45:10] [INFO ] Invariant cache hit.
[2023-03-21 18:45:10] [INFO ] After 165ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 18:45:10] [INFO ] [Nat]Absence check using 181 positive place invariants in 79 ms returned sat
[2023-03-21 18:45:11] [INFO ] After 484ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 18:45:11] [INFO ] Deduced a trap composed of 23 places in 343 ms of which 7 ms to minimize.
[2023-03-21 18:45:11] [INFO ] Deduced a trap composed of 19 places in 325 ms of which 1 ms to minimize.
[2023-03-21 18:45:12] [INFO ] Deduced a trap composed of 37 places in 314 ms of which 1 ms to minimize.
[2023-03-21 18:45:12] [INFO ] Deduced a trap composed of 29 places in 493 ms of which 2 ms to minimize.
[2023-03-21 18:45:13] [INFO ] Deduced a trap composed of 21 places in 358 ms of which 1 ms to minimize.
[2023-03-21 18:45:13] [INFO ] Deduced a trap composed of 40 places in 330 ms of which 1 ms to minimize.
[2023-03-21 18:45:13] [INFO ] Deduced a trap composed of 30 places in 204 ms of which 1 ms to minimize.
[2023-03-21 18:45:13] [INFO ] Deduced a trap composed of 28 places in 196 ms of which 11 ms to minimize.
[2023-03-21 18:45:14] [INFO ] Deduced a trap composed of 24 places in 207 ms of which 1 ms to minimize.
[2023-03-21 18:45:14] [INFO ] Deduced a trap composed of 30 places in 183 ms of which 2 ms to minimize.
[2023-03-21 18:45:14] [INFO ] Deduced a trap composed of 28 places in 273 ms of which 0 ms to minimize.
[2023-03-21 18:45:14] [INFO ] Deduced a trap composed of 21 places in 186 ms of which 1 ms to minimize.
[2023-03-21 18:45:15] [INFO ] Deduced a trap composed of 28 places in 210 ms of which 0 ms to minimize.
[2023-03-21 18:45:15] [INFO ] Deduced a trap composed of 35 places in 243 ms of which 1 ms to minimize.
[2023-03-21 18:45:15] [INFO ] Deduced a trap composed of 21 places in 154 ms of which 0 ms to minimize.
[2023-03-21 18:45:15] [INFO ] Deduced a trap composed of 36 places in 204 ms of which 2 ms to minimize.
[2023-03-21 18:45:16] [INFO ] Deduced a trap composed of 50 places in 137 ms of which 2 ms to minimize.
[2023-03-21 18:45:16] [INFO ] Deduced a trap composed of 32 places in 109 ms of which 0 ms to minimize.
[2023-03-21 18:45:16] [INFO ] Deduced a trap composed of 28 places in 160 ms of which 0 ms to minimize.
[2023-03-21 18:45:16] [INFO ] Deduced a trap composed of 32 places in 175 ms of which 0 ms to minimize.
[2023-03-21 18:45:16] [INFO ] Deduced a trap composed of 34 places in 158 ms of which 1 ms to minimize.
[2023-03-21 18:45:17] [INFO ] Deduced a trap composed of 32 places in 217 ms of which 5 ms to minimize.
[2023-03-21 18:45:17] [INFO ] Deduced a trap composed of 28 places in 141 ms of which 0 ms to minimize.
[2023-03-21 18:45:17] [INFO ] Deduced a trap composed of 34 places in 120 ms of which 1 ms to minimize.
[2023-03-21 18:45:17] [INFO ] Deduced a trap composed of 45 places in 122 ms of which 0 ms to minimize.
[2023-03-21 18:45:17] [INFO ] Deduced a trap composed of 39 places in 79 ms of which 1 ms to minimize.
[2023-03-21 18:45:17] [INFO ] Deduced a trap composed of 41 places in 90 ms of which 0 ms to minimize.
[2023-03-21 18:45:18] [INFO ] Deduced a trap composed of 44 places in 73 ms of which 0 ms to minimize.
[2023-03-21 18:45:18] [INFO ] Deduced a trap composed of 48 places in 88 ms of which 0 ms to minimize.
[2023-03-21 18:45:18] [INFO ] Deduced a trap composed of 42 places in 139 ms of which 0 ms to minimize.
[2023-03-21 18:45:18] [INFO ] Deduced a trap composed of 32 places in 116 ms of which 1 ms to minimize.
[2023-03-21 18:45:18] [INFO ] Deduced a trap composed of 38 places in 123 ms of which 1 ms to minimize.
[2023-03-21 18:45:18] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 7662 ms
[2023-03-21 18:45:18] [INFO ] After 8203ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 55 ms.
[2023-03-21 18:45:18] [INFO ] After 8497ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 2 out of 1068 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1068/1068 places, 1048/1048 transitions.
Drop transitions removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 1068 transition count 948
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 200 place count 968 transition count 948
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 102 Pre rules applied. Total rules applied 200 place count 968 transition count 846
Deduced a syphon composed of 102 places in 4 ms
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 2 with 204 rules applied. Total rules applied 404 place count 866 transition count 846
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 409 place count 861 transition count 841
Iterating global reduction 2 with 5 rules applied. Total rules applied 414 place count 861 transition count 841
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 414 place count 861 transition count 840
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 416 place count 860 transition count 840
Performed 357 Post agglomeration using F-continuation condition.Transition count delta: 357
Deduced a syphon composed of 357 places in 2 ms
Reduce places removed 357 places and 0 transitions.
Iterating global reduction 2 with 714 rules applied. Total rules applied 1130 place count 503 transition count 483
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 137 times.
Drop transitions removed 137 transitions
Iterating global reduction 2 with 137 rules applied. Total rules applied 1267 place count 503 transition count 483
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1268 place count 502 transition count 482
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1269 place count 501 transition count 482
Applied a total of 1269 rules in 329 ms. Remains 501 /1068 variables (removed 567) and now considering 482/1048 (removed 566) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 329 ms. Remains : 501/1068 places, 482/1048 transitions.
Finished random walk after 618 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=154 )
FORMULA ShieldIIPs-PT-020B-LTLCardinality-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 242 stabilizing places and 242 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' '!(F(G(p0)))'
Support contains 1 out of 1068 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1068/1068 places, 1048/1048 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 1067 transition count 946
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 1 with 101 rules applied. Total rules applied 202 place count 966 transition count 946
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 202 place count 966 transition count 845
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 404 place count 865 transition count 845
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 410 place count 859 transition count 839
Iterating global reduction 2 with 6 rules applied. Total rules applied 416 place count 859 transition count 839
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 416 place count 859 transition count 838
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 418 place count 858 transition count 838
Performed 355 Post agglomeration using F-continuation condition.Transition count delta: 355
Deduced a syphon composed of 355 places in 1 ms
Reduce places removed 355 places and 0 transitions.
Iterating global reduction 2 with 710 rules applied. Total rules applied 1128 place count 503 transition count 483
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1130 place count 501 transition count 481
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1131 place count 500 transition count 481
Applied a total of 1131 rules in 222 ms. Remains 500 /1068 variables (removed 568) and now considering 481/1048 (removed 567) transitions.
// Phase 1: matrix 481 rows 500 cols
[2023-03-21 18:45:19] [INFO ] Computed 180 place invariants in 2 ms
[2023-03-21 18:45:20] [INFO ] Implicit Places using invariants in 223 ms returned []
[2023-03-21 18:45:20] [INFO ] Invariant cache hit.
[2023-03-21 18:45:20] [INFO ] Implicit Places using invariants and state equation in 784 ms returned []
Implicit Place search using SMT with State Equation took 1012 ms to find 0 implicit places.
[2023-03-21 18:45:21] [INFO ] Redundant transitions in 225 ms returned [480]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 480 rows 500 cols
[2023-03-21 18:45:21] [INFO ] Computed 180 place invariants in 2 ms
[2023-03-21 18:45:21] [INFO ] Dead Transitions using invariants and state equation in 480 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 500/1068 places, 480/1048 transitions.
Applied a total of 0 rules in 13 ms. Remains 500 /500 variables (removed 0) and now considering 480/480 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1975 ms. Remains : 500/1068 places, 480/1048 transitions.
Stuttering acceptance computed with spot in 199 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-020B-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s303 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 95 reset in 636 ms.
Product exploration explored 100000 steps with 95 reset in 821 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 150 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Finished random walk after 248 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=82 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 181 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Support contains 1 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 480/480 transitions.
Applied a total of 0 rules in 11 ms. Remains 500 /500 variables (removed 0) and now considering 480/480 (removed 0) transitions.
[2023-03-21 18:45:23] [INFO ] Invariant cache hit.
[2023-03-21 18:45:23] [INFO ] Implicit Places using invariants in 270 ms returned []
[2023-03-21 18:45:23] [INFO ] Invariant cache hit.
[2023-03-21 18:45:24] [INFO ] Implicit Places using invariants and state equation in 611 ms returned []
Implicit Place search using SMT with State Equation took 884 ms to find 0 implicit places.
[2023-03-21 18:45:24] [INFO ] Redundant transitions in 95 ms returned []
[2023-03-21 18:45:24] [INFO ] Invariant cache hit.
[2023-03-21 18:45:24] [INFO ] Dead Transitions using invariants and state equation in 227 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1248 ms. Remains : 500/500 places, 480/480 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Finished random walk after 167 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=83 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 160 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0)]
Product exploration explored 100000 steps with 95 reset in 522 ms.
Product exploration explored 100000 steps with 96 reset in 584 ms.
Support contains 1 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 480/480 transitions.
Applied a total of 0 rules in 17 ms. Remains 500 /500 variables (removed 0) and now considering 480/480 (removed 0) transitions.
[2023-03-21 18:45:26] [INFO ] Invariant cache hit.
[2023-03-21 18:45:26] [INFO ] Implicit Places using invariants in 241 ms returned []
[2023-03-21 18:45:26] [INFO ] Invariant cache hit.
[2023-03-21 18:45:27] [INFO ] Implicit Places using invariants and state equation in 606 ms returned []
Implicit Place search using SMT with State Equation took 849 ms to find 0 implicit places.
[2023-03-21 18:45:27] [INFO ] Redundant transitions in 40 ms returned []
[2023-03-21 18:45:27] [INFO ] Invariant cache hit.
[2023-03-21 18:45:27] [INFO ] Dead Transitions using invariants and state equation in 339 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1252 ms. Remains : 500/500 places, 480/480 transitions.
Treatment of property ShieldIIPs-PT-020B-LTLCardinality-02 finished in 8453 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 1 out of 1068 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1068/1068 places, 1048/1048 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 1067 transition count 946
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 1 with 101 rules applied. Total rules applied 202 place count 966 transition count 946
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 202 place count 966 transition count 845
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 404 place count 865 transition count 845
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 409 place count 860 transition count 840
Iterating global reduction 2 with 5 rules applied. Total rules applied 414 place count 860 transition count 840
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 414 place count 860 transition count 839
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 416 place count 859 transition count 839
Performed 356 Post agglomeration using F-continuation condition.Transition count delta: 356
Deduced a syphon composed of 356 places in 0 ms
Reduce places removed 356 places and 0 transitions.
Iterating global reduction 2 with 712 rules applied. Total rules applied 1128 place count 503 transition count 483
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1130 place count 501 transition count 481
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1131 place count 500 transition count 481
Applied a total of 1131 rules in 109 ms. Remains 500 /1068 variables (removed 568) and now considering 481/1048 (removed 567) transitions.
// Phase 1: matrix 481 rows 500 cols
[2023-03-21 18:45:28] [INFO ] Computed 180 place invariants in 2 ms
[2023-03-21 18:45:28] [INFO ] Implicit Places using invariants in 227 ms returned []
[2023-03-21 18:45:28] [INFO ] Invariant cache hit.
[2023-03-21 18:45:28] [INFO ] Implicit Places using invariants and state equation in 394 ms returned []
Implicit Place search using SMT with State Equation took 624 ms to find 0 implicit places.
[2023-03-21 18:45:28] [INFO ] Redundant transitions in 89 ms returned [480]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 480 rows 500 cols
[2023-03-21 18:45:28] [INFO ] Computed 180 place invariants in 1 ms
[2023-03-21 18:45:29] [INFO ] Dead Transitions using invariants and state equation in 278 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 500/1068 places, 480/1048 transitions.
Applied a total of 0 rules in 15 ms. Remains 500 /500 variables (removed 0) and now considering 480/480 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1124 ms. Remains : 500/1068 places, 480/1048 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-020B-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s271 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 1033 steps with 0 reset in 7 ms.
FORMULA ShieldIIPs-PT-020B-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-020B-LTLCardinality-06 finished in 1193 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G((!p0||(p1 U X(p2)))) U X(p2)) U X(G(p3))))'
Support contains 8 out of 1068 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1068/1068 places, 1048/1048 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1064 transition count 1044
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1064 transition count 1044
Applied a total of 8 rules in 90 ms. Remains 1064 /1068 variables (removed 4) and now considering 1044/1048 (removed 4) transitions.
// Phase 1: matrix 1044 rows 1064 cols
[2023-03-21 18:45:29] [INFO ] Computed 181 place invariants in 3 ms
[2023-03-21 18:45:29] [INFO ] Implicit Places using invariants in 294 ms returned []
[2023-03-21 18:45:29] [INFO ] Invariant cache hit.
[2023-03-21 18:45:30] [INFO ] Implicit Places using invariants and state equation in 1006 ms returned []
Implicit Place search using SMT with State Equation took 1306 ms to find 0 implicit places.
[2023-03-21 18:45:30] [INFO ] Invariant cache hit.
[2023-03-21 18:45:31] [INFO ] Dead Transitions using invariants and state equation in 660 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1064/1068 places, 1044/1048 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2056 ms. Remains : 1064/1068 places, 1044/1048 transitions.
Stuttering acceptance computed with spot in 538 ms :[(AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p2), (AND p0 (NOT p2)), (AND p0 (NOT p2) (NOT p3)), (NOT p2), true, (NOT p2), (NOT p3)]
Running random walk in product with property : ShieldIIPs-PT-020B-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=0 dest: 5}, { cond=(AND (NOT p2) p3), acceptance={} source=0 dest: 6}, { cond=(AND p0 p1 (NOT p2) (NOT p3)), acceptance={} source=0 dest: 7}, { cond=(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p3))), acceptance={} source=0 dest: 9}], [{ cond=(OR (NOT p0) p1), acceptance={} source=1 dest: 0}, { cond=p3, acceptance={} source=1 dest: 1}, { cond=(NOT p3), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=2 dest: 8}, { cond=(AND (NOT p2) p3), acceptance={} source=2 dest: 10}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2) p3), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2) p3), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2) (NOT p3)), acceptance={} source=3 dest: 7}], [{ cond=(NOT p2), acceptance={} source=4 dest: 8}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}, { cond=(AND p0 p1), acceptance={} source=5 dest: 7}], [{ cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=6 dest: 4}, { cond=(NOT p3), acceptance={} source=6 dest: 5}, { cond=p3, acceptance={} source=6 dest: 6}, { cond=(AND p0 p1 (NOT p3)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=7 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={0} source=7 dest: 7}], [{ cond=true, acceptance={0} source=8 dest: 8}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=9 dest: 4}, { cond=(NOT p2), acceptance={} source=9 dest: 5}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=9 dest: 7}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), acceptance={0} source=9 dest: 9}], [{ cond=(NOT p3), acceptance={} source=10 dest: 8}, { cond=p3, acceptance={} source=10 dest: 10}]], initial=1, aps=[p0:(OR (EQ s975 0) (EQ s531 1)), p1:(OR (EQ s539 0) (EQ s556 1)), p2:(OR (EQ s200 0) (EQ s966 1)), p3:(OR (EQ s96 0) (EQ s771 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 39991 reset in 799 ms.
Product exploration explored 100000 steps with 39985 reset in 667 ms.
Computed a total of 239 stabilizing places and 239 stable transitions
Computed a total of 239 stabilizing places and 239 stable transitions
Knowledge obtained : [(AND p0 p1 p2 p3), (X (OR (NOT p0) p1)), (X p3), (X (NOT (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p3))))), (X (AND p0 p1)), (X (NOT (AND p0 p1 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) p3))), (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p2) p3))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) p1 (NOT p2) p3))), (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3)))), (X (X (OR (NOT p0) p1))), (X (X (AND p0 p1))), (X (X (NOT (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p3)))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X p2)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p2) p3)))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))))), (X (X p3)), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 p1 (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 36 factoid took 2773 ms. Reduced automaton from 11 states, 33 edges and 4 AP (stutter sensitive) to 11 states, 33 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 658 ms :[(AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p2), (AND p0 (NOT p2)), (AND p0 (NOT p2) (NOT p3)), (NOT p2), true, (NOT p2), (NOT p3)]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 339 ms. (steps per millisecond=29 ) properties (out of 21) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-21 18:45:37] [INFO ] Invariant cache hit.
[2023-03-21 18:45:37] [INFO ] After 290ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-21 18:45:37] [INFO ] [Nat]Absence check using 181 positive place invariants in 50 ms returned sat
[2023-03-21 18:45:38] [INFO ] After 661ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-21 18:45:39] [INFO ] Deduced a trap composed of 28 places in 434 ms of which 0 ms to minimize.
[2023-03-21 18:45:39] [INFO ] Deduced a trap composed of 16 places in 210 ms of which 1 ms to minimize.
[2023-03-21 18:45:39] [INFO ] Deduced a trap composed of 19 places in 237 ms of which 0 ms to minimize.
[2023-03-21 18:45:39] [INFO ] Deduced a trap composed of 35 places in 227 ms of which 1 ms to minimize.
[2023-03-21 18:45:40] [INFO ] Deduced a trap composed of 21 places in 171 ms of which 1 ms to minimize.
[2023-03-21 18:45:40] [INFO ] Deduced a trap composed of 16 places in 178 ms of which 0 ms to minimize.
[2023-03-21 18:45:40] [INFO ] Deduced a trap composed of 19 places in 197 ms of which 1 ms to minimize.
[2023-03-21 18:45:40] [INFO ] Deduced a trap composed of 14 places in 232 ms of which 0 ms to minimize.
[2023-03-21 18:45:41] [INFO ] Deduced a trap composed of 37 places in 281 ms of which 2 ms to minimize.
[2023-03-21 18:45:41] [INFO ] Deduced a trap composed of 14 places in 846 ms of which 2 ms to minimize.
[2023-03-21 18:45:42] [INFO ] Deduced a trap composed of 24 places in 226 ms of which 1 ms to minimize.
[2023-03-21 18:45:42] [INFO ] Deduced a trap composed of 11 places in 212 ms of which 0 ms to minimize.
[2023-03-21 18:45:42] [INFO ] Deduced a trap composed of 21 places in 332 ms of which 1 ms to minimize.
[2023-03-21 18:45:43] [INFO ] Deduced a trap composed of 33 places in 305 ms of which 0 ms to minimize.
[2023-03-21 18:45:43] [INFO ] Deduced a trap composed of 22 places in 212 ms of which 1 ms to minimize.
[2023-03-21 18:45:43] [INFO ] Deduced a trap composed of 24 places in 252 ms of which 1 ms to minimize.
[2023-03-21 18:45:43] [INFO ] Deduced a trap composed of 36 places in 174 ms of which 1 ms to minimize.
[2023-03-21 18:45:44] [INFO ] Deduced a trap composed of 26 places in 208 ms of which 1 ms to minimize.
[2023-03-21 18:45:44] [INFO ] Deduced a trap composed of 26 places in 270 ms of which 1 ms to minimize.
[2023-03-21 18:45:44] [INFO ] Deduced a trap composed of 36 places in 213 ms of which 1 ms to minimize.
[2023-03-21 18:45:44] [INFO ] Deduced a trap composed of 30 places in 225 ms of which 1 ms to minimize.
[2023-03-21 18:45:45] [INFO ] Deduced a trap composed of 34 places in 230 ms of which 1 ms to minimize.
[2023-03-21 18:45:45] [INFO ] Deduced a trap composed of 26 places in 164 ms of which 1 ms to minimize.
[2023-03-21 18:45:45] [INFO ] Deduced a trap composed of 35 places in 280 ms of which 1 ms to minimize.
[2023-03-21 18:45:45] [INFO ] Deduced a trap composed of 29 places in 169 ms of which 1 ms to minimize.
[2023-03-21 18:45:46] [INFO ] Deduced a trap composed of 36 places in 189 ms of which 3 ms to minimize.
[2023-03-21 18:45:46] [INFO ] Deduced a trap composed of 35 places in 209 ms of which 1 ms to minimize.
[2023-03-21 18:45:46] [INFO ] Deduced a trap composed of 37 places in 174 ms of which 0 ms to minimize.
[2023-03-21 18:45:46] [INFO ] Deduced a trap composed of 37 places in 123 ms of which 0 ms to minimize.
[2023-03-21 18:45:46] [INFO ] Deduced a trap composed of 32 places in 150 ms of which 1 ms to minimize.
[2023-03-21 18:45:47] [INFO ] Deduced a trap composed of 24 places in 179 ms of which 15 ms to minimize.
[2023-03-21 18:45:47] [INFO ] Deduced a trap composed of 25 places in 145 ms of which 0 ms to minimize.
[2023-03-21 18:45:47] [INFO ] Deduced a trap composed of 28 places in 168 ms of which 3 ms to minimize.
[2023-03-21 18:45:47] [INFO ] Deduced a trap composed of 34 places in 106 ms of which 0 ms to minimize.
[2023-03-21 18:45:47] [INFO ] Deduced a trap composed of 46 places in 172 ms of which 12 ms to minimize.
[2023-03-21 18:45:48] [INFO ] Deduced a trap composed of 37 places in 156 ms of which 0 ms to minimize.
[2023-03-21 18:45:48] [INFO ] Deduced a trap composed of 22 places in 304 ms of which 20 ms to minimize.
[2023-03-21 18:45:48] [INFO ] Deduced a trap composed of 19 places in 128 ms of which 0 ms to minimize.
[2023-03-21 18:45:48] [INFO ] Deduced a trap composed of 25 places in 198 ms of which 1 ms to minimize.
[2023-03-21 18:45:49] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 1 ms to minimize.
[2023-03-21 18:45:49] [INFO ] Deduced a trap composed of 45 places in 167 ms of which 0 ms to minimize.
[2023-03-21 18:45:49] [INFO ] Deduced a trap composed of 46 places in 135 ms of which 1 ms to minimize.
[2023-03-21 18:45:49] [INFO ] Deduced a trap composed of 28 places in 96 ms of which 0 ms to minimize.
[2023-03-21 18:45:49] [INFO ] Deduced a trap composed of 34 places in 90 ms of which 1 ms to minimize.
[2023-03-21 18:45:49] [INFO ] Deduced a trap composed of 47 places in 134 ms of which 7 ms to minimize.
[2023-03-21 18:45:49] [INFO ] Trap strengthening (SAT) tested/added 46/45 trap constraints in 11354 ms
[2023-03-21 18:45:50] [INFO ] Deduced a trap composed of 17 places in 139 ms of which 1 ms to minimize.
[2023-03-21 18:45:50] [INFO ] Deduced a trap composed of 17 places in 164 ms of which 0 ms to minimize.
[2023-03-21 18:45:50] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 1 ms to minimize.
[2023-03-21 18:45:50] [INFO ] Deduced a trap composed of 48 places in 106 ms of which 0 ms to minimize.
[2023-03-21 18:45:50] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 2 ms to minimize.
[2023-03-21 18:45:50] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 856 ms
[2023-03-21 18:45:51] [INFO ] Deduced a trap composed of 39 places in 217 ms of which 1 ms to minimize.
[2023-03-21 18:45:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 300 ms
[2023-03-21 18:45:51] [INFO ] Deduced a trap composed of 49 places in 119 ms of which 1 ms to minimize.
[2023-03-21 18:45:51] [INFO ] Deduced a trap composed of 49 places in 90 ms of which 1 ms to minimize.
[2023-03-21 18:45:51] [INFO ] Deduced a trap composed of 51 places in 111 ms of which 0 ms to minimize.
[2023-03-21 18:45:51] [INFO ] Deduced a trap composed of 35 places in 135 ms of which 2 ms to minimize.
[2023-03-21 18:45:52] [INFO ] Deduced a trap composed of 32 places in 98 ms of which 0 ms to minimize.
[2023-03-21 18:45:52] [INFO ] Deduced a trap composed of 27 places in 162 ms of which 1 ms to minimize.
[2023-03-21 18:45:52] [INFO ] Deduced a trap composed of 27 places in 177 ms of which 0 ms to minimize.
[2023-03-21 18:45:52] [INFO ] Deduced a trap composed of 32 places in 101 ms of which 1 ms to minimize.
[2023-03-21 18:45:52] [INFO ] Deduced a trap composed of 35 places in 142 ms of which 0 ms to minimize.
[2023-03-21 18:45:52] [INFO ] Deduced a trap composed of 25 places in 94 ms of which 0 ms to minimize.
[2023-03-21 18:45:53] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 0 ms to minimize.
[2023-03-21 18:45:53] [INFO ] Deduced a trap composed of 39 places in 104 ms of which 0 ms to minimize.
[2023-03-21 18:45:53] [INFO ] Deduced a trap composed of 37 places in 98 ms of which 0 ms to minimize.
[2023-03-21 18:45:53] [INFO ] Deduced a trap composed of 38 places in 73 ms of which 1 ms to minimize.
[2023-03-21 18:45:53] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2208 ms
[2023-03-21 18:45:53] [INFO ] Deduced a trap composed of 17 places in 132 ms of which 1 ms to minimize.
[2023-03-21 18:45:53] [INFO ] Deduced a trap composed of 21 places in 99 ms of which 0 ms to minimize.
[2023-03-21 18:45:53] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 1 ms to minimize.
[2023-03-21 18:45:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 446 ms
[2023-03-21 18:45:54] [INFO ] Deduced a trap composed of 26 places in 116 ms of which 0 ms to minimize.
[2023-03-21 18:45:54] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 1 ms to minimize.
[2023-03-21 18:45:54] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 0 ms to minimize.
[2023-03-21 18:45:54] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 0 ms to minimize.
[2023-03-21 18:45:54] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 0 ms to minimize.
[2023-03-21 18:45:54] [INFO ] Deduced a trap composed of 32 places in 151 ms of which 0 ms to minimize.
[2023-03-21 18:45:55] [INFO ] Deduced a trap composed of 43 places in 118 ms of which 0 ms to minimize.
[2023-03-21 18:45:55] [INFO ] Deduced a trap composed of 30 places in 243 ms of which 0 ms to minimize.
[2023-03-21 18:45:55] [INFO ] Deduced a trap composed of 39 places in 189 ms of which 0 ms to minimize.
[2023-03-21 18:45:55] [INFO ] Deduced a trap composed of 42 places in 128 ms of which 0 ms to minimize.
[2023-03-21 18:45:55] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1782 ms
[2023-03-21 18:45:55] [INFO ] After 17967ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 332 ms.
[2023-03-21 18:45:56] [INFO ] After 18682ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 356 ms.
Support contains 8 out of 1064 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1064/1064 places, 1044/1044 transitions.
Drop transitions removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 1064 transition count 944
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 200 place count 964 transition count 944
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 102 Pre rules applied. Total rules applied 200 place count 964 transition count 842
Deduced a syphon composed of 102 places in 1 ms
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 2 with 204 rules applied. Total rules applied 404 place count 862 transition count 842
Performed 349 Post agglomeration using F-continuation condition.Transition count delta: 349
Deduced a syphon composed of 349 places in 1 ms
Reduce places removed 349 places and 0 transitions.
Iterating global reduction 2 with 698 rules applied. Total rules applied 1102 place count 513 transition count 493
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 137 times.
Drop transitions removed 137 transitions
Iterating global reduction 2 with 137 rules applied. Total rules applied 1239 place count 513 transition count 493
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1240 place count 512 transition count 492
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1241 place count 511 transition count 492
Applied a total of 1241 rules in 80 ms. Remains 511 /1064 variables (removed 553) and now considering 492/1044 (removed 552) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 511/1064 places, 492/1044 transitions.
Finished random walk after 8173 steps, including 2 resets, run visited all 8 properties in 95 ms. (steps per millisecond=86 )
Knowledge obtained : [(AND p0 p1 p2 p3), (X (OR (NOT p0) p1)), (X p3), (X (NOT (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p3))))), (X (AND p0 p1)), (X (NOT (AND p0 p1 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) p3))), (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p2) p3))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) p1 (NOT p2) p3))), (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3)))), (X (X (OR (NOT p0) p1))), (X (X (AND p0 p1))), (X (X (NOT (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p3)))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X p2)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p2) p3)))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))))), (X (X p3)), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 p1 (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3)))))]
False Knowledge obtained : [(F (NOT (AND p1 p0))), (F (AND (NOT p1) p0)), (F (AND (NOT p1) (NOT p2) (NOT p0) p3)), (F (AND p1 p0 (NOT p3))), (F (OR (AND p1 (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p0) (NOT p3)))), (F (AND p1 (NOT p2) p0 (NOT p3))), (F (AND (NOT p1) p0 (NOT p3))), (F (NOT p2)), (F (NOT p3)), (F (AND p1 (NOT p2) (NOT p0) (NOT p3))), (F (NOT (OR p1 (NOT p0)))), (F (AND p1 (NOT p2) p0)), (F (AND (NOT p1) (NOT p2) p0 (NOT p3))), (F (AND (NOT p1) (NOT p2) p0)), (F (AND p1 (NOT p2))), (F (AND (NOT p2) p3)), (F (AND (NOT p2) (NOT p3))), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3))), (F (AND p1 (NOT p2) (NOT p0) p3)), (F (OR (AND p1 (NOT p2)) (AND (NOT p2) (NOT p0))))]
Knowledge based reduction with 36 factoid took 3089 ms. Reduced automaton from 11 states, 33 edges and 4 AP (stutter sensitive) to 11 states, 33 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 481 ms :[(AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p2), (AND p0 (NOT p2)), (AND p0 (NOT p2) (NOT p3)), (NOT p2), true, (NOT p2), (NOT p3)]
Stuttering acceptance computed with spot in 513 ms :[(AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p2), (AND p0 (NOT p2)), (AND p0 (NOT p2) (NOT p3)), (NOT p2), true, (NOT p2), (NOT p3)]
Support contains 8 out of 1064 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1064/1064 places, 1044/1044 transitions.
Applied a total of 0 rules in 24 ms. Remains 1064 /1064 variables (removed 0) and now considering 1044/1044 (removed 0) transitions.
[2023-03-21 18:46:00] [INFO ] Invariant cache hit.
[2023-03-21 18:46:01] [INFO ] Implicit Places using invariants in 334 ms returned []
[2023-03-21 18:46:01] [INFO ] Invariant cache hit.
[2023-03-21 18:46:02] [INFO ] Implicit Places using invariants and state equation in 1182 ms returned []
Implicit Place search using SMT with State Equation took 1519 ms to find 0 implicit places.
[2023-03-21 18:46:02] [INFO ] Invariant cache hit.
[2023-03-21 18:46:02] [INFO ] Dead Transitions using invariants and state equation in 586 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2139 ms. Remains : 1064/1064 places, 1044/1044 transitions.
Computed a total of 239 stabilizing places and 239 stable transitions
Computed a total of 239 stabilizing places and 239 stable transitions
Knowledge obtained : [(AND p1 p2 p0 p3), (X p3), (X (NOT (AND p1 (NOT p2) (NOT p0) p3))), (X (NOT (AND p1 (NOT p2) p0 (NOT p3)))), (X (NOT (OR (AND p1 (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p0) (NOT p3))))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) p3))), (X (NOT (AND (NOT p2) p3))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) (NOT p2) p0 (NOT p3)))), (X (NOT (AND p1 (NOT p2) (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (OR p1 (NOT p0))), (X (X (NOT (AND p1 p0 (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X p2)), (X (X (NOT (AND p1 (NOT p2) (NOT p0) p3)))), (X (X (NOT (AND p1 (NOT p2) p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND p1 (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p0) (NOT p3)))))), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) p3)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p2) p3)))), true, (X (X (NOT (OR (AND p1 (NOT p2)) (AND (NOT p2) (NOT p0)))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0 (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0) (NOT p3))))), (X (X p3)), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (OR p1 (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 36 factoid took 2442 ms. Reduced automaton from 11 states, 33 edges and 4 AP (stutter sensitive) to 11 states, 33 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 513 ms :[(AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p2), (AND p0 (NOT p2)), (AND p0 (NOT p2) (NOT p3)), (NOT p2), true, (NOT p2), (NOT p3)]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 201 ms. (steps per millisecond=49 ) properties (out of 21) seen :19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-21 18:46:06] [INFO ] Invariant cache hit.
[2023-03-21 18:46:06] [INFO ] After 115ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 18:46:06] [INFO ] [Nat]Absence check using 181 positive place invariants in 45 ms returned sat
[2023-03-21 18:46:07] [INFO ] After 589ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 18:46:07] [INFO ] Deduced a trap composed of 22 places in 222 ms of which 0 ms to minimize.
[2023-03-21 18:46:07] [INFO ] Deduced a trap composed of 19 places in 178 ms of which 1 ms to minimize.
[2023-03-21 18:46:07] [INFO ] Deduced a trap composed of 30 places in 188 ms of which 1 ms to minimize.
[2023-03-21 18:46:08] [INFO ] Deduced a trap composed of 21 places in 250 ms of which 1 ms to minimize.
[2023-03-21 18:46:08] [INFO ] Deduced a trap composed of 24 places in 207 ms of which 1 ms to minimize.
[2023-03-21 18:46:08] [INFO ] Deduced a trap composed of 25 places in 223 ms of which 1 ms to minimize.
[2023-03-21 18:46:08] [INFO ] Deduced a trap composed of 16 places in 162 ms of which 1 ms to minimize.
[2023-03-21 18:46:09] [INFO ] Deduced a trap composed of 18 places in 166 ms of which 2 ms to minimize.
[2023-03-21 18:46:09] [INFO ] Deduced a trap composed of 18 places in 204 ms of which 1 ms to minimize.
[2023-03-21 18:46:09] [INFO ] Deduced a trap composed of 18 places in 209 ms of which 0 ms to minimize.
[2023-03-21 18:46:09] [INFO ] Deduced a trap composed of 16 places in 219 ms of which 0 ms to minimize.
[2023-03-21 18:46:10] [INFO ] Deduced a trap composed of 24 places in 242 ms of which 1 ms to minimize.
[2023-03-21 18:46:10] [INFO ] Deduced a trap composed of 33 places in 257 ms of which 0 ms to minimize.
[2023-03-21 18:46:11] [INFO ] Deduced a trap composed of 37 places in 828 ms of which 1 ms to minimize.
[2023-03-21 18:46:11] [INFO ] Deduced a trap composed of 30 places in 187 ms of which 1 ms to minimize.
[2023-03-21 18:46:11] [INFO ] Deduced a trap composed of 34 places in 205 ms of which 1 ms to minimize.
[2023-03-21 18:46:11] [INFO ] Deduced a trap composed of 39 places in 178 ms of which 0 ms to minimize.
[2023-03-21 18:46:12] [INFO ] Deduced a trap composed of 37 places in 173 ms of which 1 ms to minimize.
[2023-03-21 18:46:12] [INFO ] Deduced a trap composed of 28 places in 140 ms of which 1 ms to minimize.
[2023-03-21 18:46:12] [INFO ] Deduced a trap composed of 43 places in 140 ms of which 1 ms to minimize.
[2023-03-21 18:46:12] [INFO ] Deduced a trap composed of 33 places in 164 ms of which 1 ms to minimize.
[2023-03-21 18:46:12] [INFO ] Deduced a trap composed of 30 places in 117 ms of which 1 ms to minimize.
[2023-03-21 18:46:12] [INFO ] Deduced a trap composed of 30 places in 116 ms of which 0 ms to minimize.
[2023-03-21 18:46:13] [INFO ] Deduced a trap composed of 35 places in 151 ms of which 1 ms to minimize.
[2023-03-21 18:46:13] [INFO ] Deduced a trap composed of 31 places in 179 ms of which 3 ms to minimize.
[2023-03-21 18:46:13] [INFO ] Deduced a trap composed of 43 places in 157 ms of which 0 ms to minimize.
[2023-03-21 18:46:13] [INFO ] Deduced a trap composed of 40 places in 181 ms of which 1 ms to minimize.
[2023-03-21 18:46:13] [INFO ] Deduced a trap composed of 36 places in 120 ms of which 0 ms to minimize.
[2023-03-21 18:46:14] [INFO ] Deduced a trap composed of 43 places in 200 ms of which 0 ms to minimize.
[2023-03-21 18:46:14] [INFO ] Deduced a trap composed of 37 places in 337 ms of which 13 ms to minimize.
[2023-03-21 18:46:14] [INFO ] Deduced a trap composed of 35 places in 202 ms of which 0 ms to minimize.
[2023-03-21 18:46:15] [INFO ] Deduced a trap composed of 28 places in 194 ms of which 1 ms to minimize.
[2023-03-21 18:46:15] [INFO ] Deduced a trap composed of 48 places in 139 ms of which 1 ms to minimize.
[2023-03-21 18:46:15] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 8168 ms
[2023-03-21 18:46:15] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 1 ms to minimize.
[2023-03-21 18:46:15] [INFO ] Deduced a trap composed of 31 places in 102 ms of which 0 ms to minimize.
[2023-03-21 18:46:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 294 ms
[2023-03-21 18:46:15] [INFO ] After 9121ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 90 ms.
[2023-03-21 18:46:15] [INFO ] After 9396ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 52 ms.
Support contains 8 out of 1064 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1064/1064 places, 1044/1044 transitions.
Drop transitions removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 1064 transition count 944
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 200 place count 964 transition count 944
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 102 Pre rules applied. Total rules applied 200 place count 964 transition count 842
Deduced a syphon composed of 102 places in 1 ms
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 2 with 204 rules applied. Total rules applied 404 place count 862 transition count 842
Performed 349 Post agglomeration using F-continuation condition.Transition count delta: 349
Deduced a syphon composed of 349 places in 1 ms
Reduce places removed 349 places and 0 transitions.
Iterating global reduction 2 with 698 rules applied. Total rules applied 1102 place count 513 transition count 493
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 137 times.
Drop transitions removed 137 transitions
Iterating global reduction 2 with 137 rules applied. Total rules applied 1239 place count 513 transition count 493
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1240 place count 512 transition count 492
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1241 place count 511 transition count 492
Applied a total of 1241 rules in 100 ms. Remains 511 /1064 variables (removed 553) and now considering 492/1044 (removed 552) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 511/1064 places, 492/1044 transitions.
Finished random walk after 441 steps, including 0 resets, run visited all 2 properties in 8 ms. (steps per millisecond=55 )
Knowledge obtained : [(AND p1 p2 p0 p3), (X p3), (X (NOT (AND p1 (NOT p2) (NOT p0) p3))), (X (NOT (AND p1 (NOT p2) p0 (NOT p3)))), (X (NOT (OR (AND p1 (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p0) (NOT p3))))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) p3))), (X (NOT (AND (NOT p2) p3))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) (NOT p2) p0 (NOT p3)))), (X (NOT (AND p1 (NOT p2) (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (OR p1 (NOT p0))), (X (X (NOT (AND p1 p0 (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X p2)), (X (X (NOT (AND p1 (NOT p2) (NOT p0) p3)))), (X (X (NOT (AND p1 (NOT p2) p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND p1 (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p0) (NOT p3)))))), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) p3)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p2) p3)))), true, (X (X (NOT (OR (AND p1 (NOT p2)) (AND (NOT p2) (NOT p0)))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0 (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0) (NOT p3))))), (X (X p3)), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (OR p1 (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (AND p0 (NOT p1))), (F (AND (NOT p2) p3 (NOT p0) (NOT p1))), (F (AND (NOT p3) p0 p1)), (F (OR (AND (NOT p2) (NOT p3) (NOT p0)) (AND (NOT p2) (NOT p3) p1))), (F (AND (NOT p3) p0 (NOT p1))), (F (AND (NOT p2) (NOT p3) p0 p1)), (F (NOT p2)), (F (NOT p3)), (F (AND (NOT p2) (NOT p3) (NOT p0) p1)), (F (NOT (OR (NOT p0) p1))), (F (AND (NOT p2) p0 p1)), (F (AND (NOT p2) (NOT p3) p0 (NOT p1))), (F (AND (NOT p2) p0 (NOT p1))), (F (AND (NOT p2) p1)), (F (AND (NOT p2) p3)), (F (AND (NOT p2) (NOT p1))), (F (AND (NOT p2) (NOT p3))), (F (AND (NOT p2) (NOT p3) (NOT p0) (NOT p1))), (F (AND (NOT p2) p3 (NOT p0) p1)), (F (OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) p1)))]
Knowledge based reduction with 36 factoid took 3063 ms. Reduced automaton from 11 states, 33 edges and 4 AP (stutter sensitive) to 11 states, 33 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 483 ms :[(AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p2), (AND p0 (NOT p2)), (AND p0 (NOT p2) (NOT p3)), (NOT p2), true, (NOT p2), (NOT p3)]
Stuttering acceptance computed with spot in 519 ms :[(AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p2), (AND p0 (NOT p2)), (AND p0 (NOT p2) (NOT p3)), (NOT p2), true, (NOT p2), (NOT p3)]
Stuttering acceptance computed with spot in 568 ms :[(AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p2), (AND p0 (NOT p2)), (AND p0 (NOT p2) (NOT p3)), (NOT p2), true, (NOT p2), (NOT p3)]
Product exploration explored 100000 steps with 40110 reset in 661 ms.
Product exploration explored 100000 steps with 39970 reset in 711 ms.
Applying partial POR strategy [false, false, true, false, true, false, false, false, true, false, true]
Stuttering acceptance computed with spot in 575 ms :[(AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p2), (AND p0 (NOT p2)), (AND p0 (NOT p2) (NOT p3)), (NOT p2), true, (NOT p2), (NOT p3)]
Support contains 8 out of 1064 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1064/1064 places, 1044/1044 transitions.
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 99 rules applied. Total rules applied 99 place count 1064 transition count 1044
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 42 Pre rules applied. Total rules applied 99 place count 1064 transition count 1046
Deduced a syphon composed of 141 places in 1 ms
Iterating global reduction 1 with 42 rules applied. Total rules applied 141 place count 1064 transition count 1046
Performed 410 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 551 places in 1 ms
Iterating global reduction 1 with 410 rules applied. Total rules applied 551 place count 1064 transition count 1046
Renaming transitions due to excessive name length > 1024 char.
Discarding 141 places :
Symmetric choice reduction at 1 with 141 rule applications. Total rules 692 place count 923 transition count 905
Deduced a syphon composed of 410 places in 0 ms
Iterating global reduction 1 with 141 rules applied. Total rules applied 833 place count 923 transition count 905
Deduced a syphon composed of 410 places in 1 ms
Applied a total of 833 rules in 435 ms. Remains 923 /1064 variables (removed 141) and now considering 905/1044 (removed 139) transitions.
[2023-03-21 18:46:23] [INFO ] Redundant transitions in 54 ms returned [904]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 904 rows 923 cols
[2023-03-21 18:46:23] [INFO ] Computed 181 place invariants in 5 ms
[2023-03-21 18:46:23] [INFO ] Dead Transitions using invariants and state equation in 383 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 923/1064 places, 904/1044 transitions.
Deduced a syphon composed of 410 places in 1 ms
Applied a total of 0 rules in 23 ms. Remains 923 /923 variables (removed 0) and now considering 904/904 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 910 ms. Remains : 923/1064 places, 904/1044 transitions.
Support contains 8 out of 1064 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1064/1064 places, 1044/1044 transitions.
Applied a total of 0 rules in 23 ms. Remains 1064 /1064 variables (removed 0) and now considering 1044/1044 (removed 0) transitions.
// Phase 1: matrix 1044 rows 1064 cols
[2023-03-21 18:46:23] [INFO ] Computed 181 place invariants in 4 ms
[2023-03-21 18:46:24] [INFO ] Implicit Places using invariants in 438 ms returned []
[2023-03-21 18:46:24] [INFO ] Invariant cache hit.
[2023-03-21 18:46:25] [INFO ] Implicit Places using invariants and state equation in 1320 ms returned []
Implicit Place search using SMT with State Equation took 1767 ms to find 0 implicit places.
[2023-03-21 18:46:25] [INFO ] Invariant cache hit.
[2023-03-21 18:46:26] [INFO ] Dead Transitions using invariants and state equation in 619 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2412 ms. Remains : 1064/1064 places, 1044/1044 transitions.
Treatment of property ShieldIIPs-PT-020B-LTLCardinality-09 finished in 56987 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) U (p1&&F(p2))))'
Support contains 4 out of 1068 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1068/1068 places, 1048/1048 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1062 transition count 1042
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1062 transition count 1042
Applied a total of 12 rules in 52 ms. Remains 1062 /1068 variables (removed 6) and now considering 1042/1048 (removed 6) transitions.
// Phase 1: matrix 1042 rows 1062 cols
[2023-03-21 18:46:26] [INFO ] Computed 181 place invariants in 3 ms
[2023-03-21 18:46:26] [INFO ] Implicit Places using invariants in 347 ms returned []
[2023-03-21 18:46:26] [INFO ] Invariant cache hit.
[2023-03-21 18:46:27] [INFO ] Implicit Places using invariants and state equation in 1359 ms returned []
Implicit Place search using SMT with State Equation took 1707 ms to find 0 implicit places.
[2023-03-21 18:46:27] [INFO ] Invariant cache hit.
[2023-03-21 18:46:28] [INFO ] Dead Transitions using invariants and state equation in 639 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1062/1068 places, 1042/1048 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2412 ms. Remains : 1062/1068 places, 1042/1048 transitions.
Stuttering acceptance computed with spot in 125 ms :[true, (OR (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : ShieldIIPs-PT-020B-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p2) p0), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(OR (EQ s53 0) (EQ s316 1) (EQ s3 1)), p2:(EQ s3 1), p0:(OR (EQ s316 0) (EQ s740 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 11640 reset in 280 ms.
Product exploration explored 100000 steps with 11524 reset in 264 ms.
Computed a total of 239 stabilizing places and 239 stable transitions
Computed a total of 239 stabilizing places and 239 stable transitions
Detected a total of 239/1062 stabilizing places and 239/1042 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (AND p1 (NOT p2) p0)), (X (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X p0), true, (X (X (AND p1 (NOT p2) p0))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 446 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p2), (NOT p2)]
Finished random walk after 8 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=8 )
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (AND p1 (NOT p2) p0)), (X (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X p0), true, (X (X (AND p1 (NOT p2) p0))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 11 factoid took 484 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p2)]
[2023-03-21 18:46:30] [INFO ] Invariant cache hit.
[2023-03-21 18:46:30] [INFO ] [Real]Absence check using 181 positive place invariants in 83 ms returned sat
[2023-03-21 18:46:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 18:46:33] [INFO ] [Real]Absence check using state equation in 3212 ms returned sat
[2023-03-21 18:46:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 18:46:34] [INFO ] [Nat]Absence check using 181 positive place invariants in 62 ms returned sat
[2023-03-21 18:46:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 18:46:36] [INFO ] [Nat]Absence check using state equation in 1711 ms returned sat
[2023-03-21 18:46:36] [INFO ] Computed and/alt/rep : 1041/2342/1041 causal constraints (skipped 0 transitions) in 48 ms.
[2023-03-21 18:46:45] [INFO ] Added : 423 causal constraints over 87 iterations in 8808 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 1 out of 1062 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1062/1062 places, 1042/1042 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 99 transitions
Trivial Post-agglo rules discarded 99 transitions
Performed 99 trivial Post agglomeration. Transition count delta: 99
Iterating post reduction 0 with 99 rules applied. Total rules applied 99 place count 1061 transition count 942
Reduce places removed 99 places and 0 transitions.
Iterating post reduction 1 with 99 rules applied. Total rules applied 198 place count 962 transition count 942
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 198 place count 962 transition count 841
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 400 place count 861 transition count 841
Performed 355 Post agglomeration using F-continuation condition.Transition count delta: 355
Deduced a syphon composed of 355 places in 1 ms
Reduce places removed 355 places and 0 transitions.
Iterating global reduction 2 with 710 rules applied. Total rules applied 1110 place count 506 transition count 486
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1112 place count 504 transition count 484
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1113 place count 503 transition count 484
Applied a total of 1113 rules in 79 ms. Remains 503 /1062 variables (removed 559) and now considering 484/1042 (removed 558) transitions.
// Phase 1: matrix 484 rows 503 cols
[2023-03-21 18:46:45] [INFO ] Computed 180 place invariants in 2 ms
[2023-03-21 18:46:45] [INFO ] Implicit Places using invariants in 255 ms returned []
[2023-03-21 18:46:45] [INFO ] Invariant cache hit.
[2023-03-21 18:46:45] [INFO ] Implicit Places using invariants and state equation in 449 ms returned []
Implicit Place search using SMT with State Equation took 708 ms to find 0 implicit places.
[2023-03-21 18:46:45] [INFO ] Redundant transitions in 38 ms returned [483]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 483 rows 503 cols
[2023-03-21 18:46:45] [INFO ] Computed 180 place invariants in 1 ms
[2023-03-21 18:46:46] [INFO ] Dead Transitions using invariants and state equation in 193 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 503/1062 places, 483/1042 transitions.
Applied a total of 0 rules in 9 ms. Remains 503 /503 variables (removed 0) and now considering 483/483 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1044 ms. Remains : 503/1062 places, 483/1042 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/503 stabilizing places and 2/483 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p2), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 2 factoid took 161 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 24 ms :[(NOT p2)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p2), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2)), (F p2)]
Knowledge based reduction with 2 factoid took 145 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 46 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p2)]
[2023-03-21 18:46:46] [INFO ] Invariant cache hit.
[2023-03-21 18:46:46] [INFO ] [Real]Absence check using 180 positive place invariants in 138 ms returned sat
[2023-03-21 18:46:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 18:46:47] [INFO ] [Real]Absence check using state equation in 656 ms returned sat
[2023-03-21 18:46:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 18:46:47] [INFO ] [Nat]Absence check using 180 positive place invariants in 33 ms returned sat
[2023-03-21 18:46:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 18:46:48] [INFO ] [Nat]Absence check using state equation in 191 ms returned sat
[2023-03-21 18:46:48] [INFO ] Deduced a trap composed of 9 places in 175 ms of which 0 ms to minimize.
[2023-03-21 18:46:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 239 ms
[2023-03-21 18:46:48] [INFO ] Computed and/alt/rep : 446/1486/446 causal constraints (skipped 35 transitions) in 31 ms.
[2023-03-21 18:46:49] [INFO ] Added : 109 causal constraints over 22 iterations in 1314 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 46 ms :[(NOT p2)]
Product exploration explored 100000 steps with 27556 reset in 277 ms.
Product exploration explored 100000 steps with 27617 reset in 315 ms.
Support contains 1 out of 503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 503/503 places, 483/483 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 503 transition count 481
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 501 transition count 481
Applied a total of 4 rules in 11 ms. Remains 501 /503 variables (removed 2) and now considering 481/483 (removed 2) transitions.
// Phase 1: matrix 481 rows 501 cols
[2023-03-21 18:46:50] [INFO ] Computed 180 place invariants in 1 ms
[2023-03-21 18:46:50] [INFO ] Implicit Places using invariants in 267 ms returned []
[2023-03-21 18:46:50] [INFO ] Invariant cache hit.
[2023-03-21 18:46:51] [INFO ] Implicit Places using invariants and state equation in 559 ms returned []
Implicit Place search using SMT with State Equation took 844 ms to find 0 implicit places.
[2023-03-21 18:46:51] [INFO ] Redundant transitions in 75 ms returned []
[2023-03-21 18:46:51] [INFO ] Invariant cache hit.
[2023-03-21 18:46:51] [INFO ] Dead Transitions using invariants and state equation in 269 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 501/503 places, 481/483 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1214 ms. Remains : 501/503 places, 481/483 transitions.
Treatment of property ShieldIIPs-PT-020B-LTLCardinality-11 finished in 25381 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(((p1 U X(p2))||(F(p3) U !p0))))))'
Support contains 7 out of 1068 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1068/1068 places, 1048/1048 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1064 transition count 1044
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1064 transition count 1044
Applied a total of 8 rules in 79 ms. Remains 1064 /1068 variables (removed 4) and now considering 1044/1048 (removed 4) transitions.
// Phase 1: matrix 1044 rows 1064 cols
[2023-03-21 18:46:51] [INFO ] Computed 181 place invariants in 4 ms
[2023-03-21 18:46:51] [INFO ] Implicit Places using invariants in 332 ms returned []
[2023-03-21 18:46:51] [INFO ] Invariant cache hit.
[2023-03-21 18:46:53] [INFO ] Implicit Places using invariants and state equation in 1435 ms returned []
Implicit Place search using SMT with State Equation took 1782 ms to find 0 implicit places.
[2023-03-21 18:46:53] [INFO ] Invariant cache hit.
[2023-03-21 18:46:53] [INFO ] Dead Transitions using invariants and state equation in 629 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1064/1068 places, 1044/1048 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2491 ms. Remains : 1064/1068 places, 1044/1048 transitions.
Stuttering acceptance computed with spot in 495 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), true, (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND (NOT p3) (NOT p2)), (AND p0 (NOT p2)), (AND (NOT p2) (NOT p3)), (NOT p3), p0]
Running random walk in product with property : ShieldIIPs-PT-020B-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=3 dest: 5}, { cond=(AND p0 p1), acceptance={} source=3 dest: 6}, { cond=(AND p0 p1 (NOT p3)), acceptance={} source=3 dest: 7}], [{ cond=(AND p0 (NOT p3) (NOT p2)), acceptance={} source=4 dest: 8}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 9}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=5 dest: 8}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=6 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=6 dest: 6}, { cond=(AND p0 p1 (NOT p3) (NOT p2)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=7 dest: 5}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=7 dest: 7}], [{ cond=(NOT p3), acceptance={} source=8 dest: 8}], [{ cond=(AND p0 (NOT p3)), acceptance={} source=9 dest: 8}, { cond=p0, acceptance={} source=9 dest: 9}]], initial=0, aps=[p0:(EQ s671 1), p1:(OR (EQ s65 0) (EQ s14 1)), p3:(OR (EQ s442 0) (EQ s297 1)), p2:(OR (EQ s836 0) (EQ s690 1))], nbAcceptance=0, 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, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-020B-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-020B-LTLCardinality-12 finished in 3019 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||(F(p1)&&X(X(G(p2)))))))'
Support contains 5 out of 1068 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1068/1068 places, 1048/1048 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 1063 transition count 1043
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 1063 transition count 1043
Applied a total of 10 rules in 47 ms. Remains 1063 /1068 variables (removed 5) and now considering 1043/1048 (removed 5) transitions.
// Phase 1: matrix 1043 rows 1063 cols
[2023-03-21 18:46:54] [INFO ] Computed 181 place invariants in 3 ms
[2023-03-21 18:46:54] [INFO ] Implicit Places using invariants in 358 ms returned []
[2023-03-21 18:46:54] [INFO ] Invariant cache hit.
[2023-03-21 18:46:55] [INFO ] Implicit Places using invariants and state equation in 1030 ms returned []
Implicit Place search using SMT with State Equation took 1390 ms to find 0 implicit places.
[2023-03-21 18:46:55] [INFO ] Invariant cache hit.
[2023-03-21 18:46:56] [INFO ] Dead Transitions using invariants and state equation in 471 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1063/1068 places, 1043/1048 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1909 ms. Remains : 1063/1068 places, 1043/1048 transitions.
Stuttering acceptance computed with spot in 320 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p1), (NOT p2), (NOT p2), true]
Running random walk in product with property : ShieldIIPs-PT-020B-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=p2, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (NEQ s15 0) (NEQ s274 1)), p1:(AND (EQ s118 0) (EQ s627 1)), p2:(EQ s46 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1751 steps with 0 reset in 42 ms.
FORMULA ShieldIIPs-PT-020B-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-020B-LTLCardinality-13 finished in 2298 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)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G((!p0||(p1 U X(p2)))) U X(p2)) U X(G(p3))))'
Found a Lengthening insensitive property : ShieldIIPs-PT-020B-LTLCardinality-09
Stuttering acceptance computed with spot in 415 ms :[(AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p2), (AND p0 (NOT p2)), (AND p0 (NOT p2) (NOT p3)), (NOT p2), true, (NOT p2), (NOT p3)]
Support contains 8 out of 1068 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1068/1068 places, 1048/1048 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 1067 transition count 947
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 200 place count 967 transition count 947
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 102 Pre rules applied. Total rules applied 200 place count 967 transition count 845
Deduced a syphon composed of 102 places in 1 ms
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 2 with 204 rules applied. Total rules applied 404 place count 865 transition count 845
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 408 place count 861 transition count 841
Iterating global reduction 2 with 4 rules applied. Total rules applied 412 place count 861 transition count 841
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 412 place count 861 transition count 840
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 414 place count 860 transition count 840
Performed 346 Post agglomeration using F-continuation condition.Transition count delta: 346
Deduced a syphon composed of 346 places in 0 ms
Reduce places removed 346 places and 0 transitions.
Iterating global reduction 2 with 692 rules applied. Total rules applied 1106 place count 514 transition count 494
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1108 place count 512 transition count 492
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1109 place count 511 transition count 492
Applied a total of 1109 rules in 104 ms. Remains 511 /1068 variables (removed 557) and now considering 492/1048 (removed 556) transitions.
// Phase 1: matrix 492 rows 511 cols
[2023-03-21 18:46:57] [INFO ] Computed 180 place invariants in 3 ms
[2023-03-21 18:46:57] [INFO ] Implicit Places using invariants in 274 ms returned []
[2023-03-21 18:46:57] [INFO ] Invariant cache hit.
[2023-03-21 18:46:58] [INFO ] Implicit Places using invariants and state equation in 506 ms returned []
Implicit Place search using SMT with State Equation took 794 ms to find 0 implicit places.
[2023-03-21 18:46:58] [INFO ] Invariant cache hit.
[2023-03-21 18:46:58] [INFO ] Dead Transitions using invariants and state equation in 228 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 511/1068 places, 492/1048 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1131 ms. Remains : 511/1068 places, 492/1048 transitions.
Running random walk in product with property : ShieldIIPs-PT-020B-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=0 dest: 5}, { cond=(AND (NOT p2) p3), acceptance={} source=0 dest: 6}, { cond=(AND p0 p1 (NOT p2) (NOT p3)), acceptance={} source=0 dest: 7}, { cond=(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p3))), acceptance={} source=0 dest: 9}], [{ cond=(OR (NOT p0) p1), acceptance={} source=1 dest: 0}, { cond=p3, acceptance={} source=1 dest: 1}, { cond=(NOT p3), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=2 dest: 8}, { cond=(AND (NOT p2) p3), acceptance={} source=2 dest: 10}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2) p3), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2) p3), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2) (NOT p3)), acceptance={} source=3 dest: 7}], [{ cond=(NOT p2), acceptance={} source=4 dest: 8}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}, { cond=(AND p0 p1), acceptance={} source=5 dest: 7}], [{ cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=6 dest: 4}, { cond=(NOT p3), acceptance={} source=6 dest: 5}, { cond=p3, acceptance={} source=6 dest: 6}, { cond=(AND p0 p1 (NOT p3)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=7 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={0} source=7 dest: 7}], [{ cond=true, acceptance={0} source=8 dest: 8}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=9 dest: 4}, { cond=(NOT p2), acceptance={} source=9 dest: 5}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=9 dest: 7}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), acceptance={0} source=9 dest: 9}], [{ cond=(NOT p3), acceptance={} source=10 dest: 8}, { cond=p3, acceptance={} source=10 dest: 10}]], initial=1, aps=[p0:(OR (EQ s467 0) (EQ s251 1)), p1:(OR (EQ s255 0) (EQ s261 1)), p2:(OR (EQ s89 0) (EQ s462 1)), p3:(OR (EQ s37 0) (EQ s367 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 14462 steps with 318 reset in 83 ms.
Treatment of property ShieldIIPs-PT-020B-LTLCardinality-09 finished in 1726 ms.
FORMULA ShieldIIPs-PT-020B-LTLCardinality-09 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
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) U (p1&&F(p2))))'
Found a Lengthening insensitive property : ShieldIIPs-PT-020B-LTLCardinality-11
Stuttering acceptance computed with spot in 110 ms :[true, (OR (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p2)]
Support contains 4 out of 1068 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1068/1068 places, 1048/1048 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 99 transitions
Trivial Post-agglo rules discarded 99 transitions
Performed 99 trivial Post agglomeration. Transition count delta: 99
Iterating post reduction 0 with 99 rules applied. Total rules applied 99 place count 1067 transition count 948
Reduce places removed 99 places and 0 transitions.
Iterating post reduction 1 with 99 rules applied. Total rules applied 198 place count 968 transition count 948
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 198 place count 968 transition count 847
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 400 place count 867 transition count 847
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 406 place count 861 transition count 841
Iterating global reduction 2 with 6 rules applied. Total rules applied 412 place count 861 transition count 841
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 412 place count 861 transition count 840
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 414 place count 860 transition count 840
Performed 354 Post agglomeration using F-continuation condition.Transition count delta: 354
Deduced a syphon composed of 354 places in 1 ms
Reduce places removed 354 places and 0 transitions.
Iterating global reduction 2 with 708 rules applied. Total rules applied 1122 place count 506 transition count 486
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1124 place count 504 transition count 484
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1125 place count 503 transition count 484
Applied a total of 1125 rules in 104 ms. Remains 503 /1068 variables (removed 565) and now considering 484/1048 (removed 564) transitions.
// Phase 1: matrix 484 rows 503 cols
[2023-03-21 18:46:58] [INFO ] Computed 180 place invariants in 4 ms
[2023-03-21 18:46:59] [INFO ] Implicit Places using invariants in 315 ms returned []
[2023-03-21 18:46:59] [INFO ] Invariant cache hit.
[2023-03-21 18:46:59] [INFO ] Implicit Places using invariants and state equation in 485 ms returned []
Implicit Place search using SMT with State Equation took 819 ms to find 0 implicit places.
[2023-03-21 18:46:59] [INFO ] Invariant cache hit.
[2023-03-21 18:46:59] [INFO ] Dead Transitions using invariants and state equation in 241 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 503/1068 places, 484/1048 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1178 ms. Remains : 503/1068 places, 484/1048 transitions.
Running random walk in product with property : ShieldIIPs-PT-020B-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p2) p0), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(OR (EQ s19 0) (EQ s146 1) (EQ s1 1)), p2:(EQ s1 1), p0:(OR (EQ s146 0) (EQ s351 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 27694 reset in 349 ms.
Product exploration explored 100000 steps with 27490 reset in 311 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/503 stabilizing places and 2/484 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT (AND (NOT p1) p0))), (X p0), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND p1 (NOT p2) p0)), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT p2)), (X p2), (X (X (AND p1 (NOT p2) p0))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 7 factoid took 491 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p2), (NOT p2)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT (AND (NOT p1) p0))), (X p0), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND p1 (NOT p2) p0)), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT p2)), (X p2), (X (X (AND p1 (NOT p2) p0))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT p2))), (X (X p2)), (F p2)]
Knowledge based reduction with 7 factoid took 549 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p2)]
[2023-03-21 18:47:01] [INFO ] Invariant cache hit.
[2023-03-21 18:47:02] [INFO ] [Real]Absence check using 180 positive place invariants in 87 ms returned sat
[2023-03-21 18:47:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 18:47:03] [INFO ] [Real]Absence check using state equation in 747 ms returned sat
[2023-03-21 18:47:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 18:47:03] [INFO ] [Nat]Absence check using 180 positive place invariants in 74 ms returned sat
[2023-03-21 18:47:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 18:47:03] [INFO ] [Nat]Absence check using state equation in 364 ms returned sat
[2023-03-21 18:47:03] [INFO ] Computed and/alt/rep : 447/1491/447 causal constraints (skipped 35 transitions) in 87 ms.
[2023-03-21 18:47:04] [INFO ] Added : 30 causal constraints over 7 iterations in 574 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 1 out of 503 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 503/503 places, 484/484 transitions.
Applied a total of 0 rules in 24 ms. Remains 503 /503 variables (removed 0) and now considering 484/484 (removed 0) transitions.
[2023-03-21 18:47:04] [INFO ] Invariant cache hit.
[2023-03-21 18:47:04] [INFO ] Implicit Places using invariants in 251 ms returned []
[2023-03-21 18:47:04] [INFO ] Invariant cache hit.
[2023-03-21 18:47:05] [INFO ] Implicit Places using invariants and state equation in 704 ms returned []
Implicit Place search using SMT with State Equation took 979 ms to find 0 implicit places.
[2023-03-21 18:47:05] [INFO ] Redundant transitions in 84 ms returned [483]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 483 rows 503 cols
[2023-03-21 18:47:05] [INFO ] Computed 180 place invariants in 1 ms
[2023-03-21 18:47:05] [INFO ] Dead Transitions using invariants and state equation in 258 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 503/503 places, 483/484 transitions.
Applied a total of 0 rules in 8 ms. Remains 503 /503 variables (removed 0) and now considering 483/483 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1377 ms. Remains : 503/503 places, 483/484 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/503 stabilizing places and 2/483 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p2), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 2 factoid took 158 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 29 ms :[(NOT p2)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p2), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2)), (F p2)]
Knowledge based reduction with 2 factoid took 142 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 38 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 24 ms :[(NOT p2)]
[2023-03-21 18:47:06] [INFO ] Invariant cache hit.
[2023-03-21 18:47:06] [INFO ] [Real]Absence check using 180 positive place invariants in 43 ms returned sat
[2023-03-21 18:47:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 18:47:06] [INFO ] [Real]Absence check using state equation in 533 ms returned sat
[2023-03-21 18:47:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 18:47:07] [INFO ] [Nat]Absence check using 180 positive place invariants in 37 ms returned sat
[2023-03-21 18:47:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 18:47:07] [INFO ] [Nat]Absence check using state equation in 415 ms returned sat
[2023-03-21 18:47:07] [INFO ] Computed and/alt/rep : 446/1486/446 causal constraints (skipped 35 transitions) in 24 ms.
[2023-03-21 18:47:09] [INFO ] Added : 114 causal constraints over 23 iterations in 1549 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 37 ms :[(NOT p2)]
Product exploration explored 100000 steps with 27523 reset in 276 ms.
Product exploration explored 100000 steps with 27738 reset in 386 ms.
Support contains 1 out of 503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 503/503 places, 483/483 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 503 transition count 481
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 501 transition count 481
Applied a total of 4 rules in 14 ms. Remains 501 /503 variables (removed 2) and now considering 481/483 (removed 2) transitions.
// Phase 1: matrix 481 rows 501 cols
[2023-03-21 18:47:09] [INFO ] Computed 180 place invariants in 3 ms
[2023-03-21 18:47:10] [INFO ] Implicit Places using invariants in 287 ms returned []
[2023-03-21 18:47:10] [INFO ] Invariant cache hit.
[2023-03-21 18:47:10] [INFO ] Implicit Places using invariants and state equation in 489 ms returned []
Implicit Place search using SMT with State Equation took 777 ms to find 0 implicit places.
[2023-03-21 18:47:10] [INFO ] Redundant transitions in 187 ms returned []
[2023-03-21 18:47:10] [INFO ] Invariant cache hit.
[2023-03-21 18:47:11] [INFO ] Dead Transitions using invariants and state equation in 194 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 501/503 places, 481/483 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1201 ms. Remains : 501/503 places, 481/483 transitions.
Treatment of property ShieldIIPs-PT-020B-LTLCardinality-11 finished in 12443 ms.
[2023-03-21 18:47:11] [INFO ] Flatten gal took : 40 ms
[2023-03-21 18:47:11] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-21 18:47:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1068 places, 1048 transitions and 3296 arcs took 6 ms.
Total runtime 125942 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2611/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2611/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2611/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ShieldIIPs-PT-020B-LTLCardinality-02
Could not compute solution for formula : ShieldIIPs-PT-020B-LTLCardinality-09
Could not compute solution for formula : ShieldIIPs-PT-020B-LTLCardinality-11

BK_STOP 1679424433012

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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 ShieldIIPs-PT-020B-LTLCardinality-02
ltl formula formula --ltl=/tmp/2611/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1068 places, 1048 transitions and 3296 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.160 real 0.060 user 0.050 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2611/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2611/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2611/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2611/ltl_0_
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:
0: pnml2lts-mc(+0xa23f4) [0x55ba0f5e03f4]
1: pnml2lts-mc(+0xa2496) [0x55ba0f5e0496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f37cb2ef140]
3: pnml2lts-mc(+0x405be5) [0x55ba0f943be5]
4: pnml2lts-mc(+0x16b3f9) [0x55ba0f6a93f9]
5: pnml2lts-mc(+0x164ac4) [0x55ba0f6a2ac4]
6: pnml2lts-mc(+0x272e0a) [0x55ba0f7b0e0a]
7: pnml2lts-mc(+0xb61f0) [0x55ba0f5f41f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f37cb1424d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f37cb14267a]
10: pnml2lts-mc(+0xa1581) [0x55ba0f5df581]
11: pnml2lts-mc(+0xa1910) [0x55ba0f5df910]
12: pnml2lts-mc(+0xa32a2) [0x55ba0f5e12a2]
13: pnml2lts-mc(+0xa50f4) [0x55ba0f5e30f4]
14: pnml2lts-mc(+0xa516b) [0x55ba0f5e316b]
15: pnml2lts-mc(+0x3f34b3) [0x55ba0f9314b3]
16: pnml2lts-mc(+0x7c63d) [0x55ba0f5ba63d]
17: pnml2lts-mc(+0x67d86) [0x55ba0f5a5d86]
18: pnml2lts-mc(+0x60a8a) [0x55ba0f59ea8a]
19: pnml2lts-mc(+0x5eb15) [0x55ba0f59cb15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f37cb12ad0a]
21: pnml2lts-mc(+0x6075e) [0x55ba0f59e75e]
ltl formula name ShieldIIPs-PT-020B-LTLCardinality-09
ltl formula formula --ltl=/tmp/2611/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: =============================================================================
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 1068 places, 1048 transitions and 3296 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.270 real 0.030 user 0.170 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2611/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2611/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2611/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2611/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 12 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
corrupted size vs. prev_size in fastbins
ltl formula name ShieldIIPs-PT-020B-LTLCardinality-11
ltl formula formula --ltl=/tmp/2611/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
pnml2lts-mc( 0/ 4): Petri net has 1068 places, 1048 transitions and 3296 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
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.250 real 0.050 user 0.060 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2611/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2611/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2611/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2611/ltl_2_
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)

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="ShieldIIPs-PT-020B"
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 ShieldIIPs-PT-020B, 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-167903716600107"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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